Quantum Technologies: System-Level Performance and Validation Priorities

Performance claims in quantum technology are not properties of hardware alone. They are properties of a declared task, system boundary, normalization denominator, uncertainty or security convention, and comparator. We perform a cross-domain analysis spanning quantum computing, simulation, communication, sensing, clocks, randomness generation, and their enabling technologies. The analysis changes substantive conclusions in several representative cases. For the longest direct finite-key quantum key distribution case analyzed here, the same final key gives rates differing by a factor of $1.91$ when normalized by complete acquisition rather than transmission-active time. In Advanced LIGO, $6.1\,\mathrm{dB}$ peak quantum-noise reduction coexists with a $0.534$ coincident analysis-ready fraction, separating detector-level gain from delivered observing service. In quantum computation and photonic sampling, matching the observable, error tolerance, loss model, sample count, amortization, and classical hardware moves or reverses published crossover claims. Across domains, the recurring limits are correlated error, multiplicative interface loss, thermal and nonequilibrium occupation, calibration covariance, measurement efficiency, fabrication yield, and control latency. A quantum advantage is therefore established only for a fixed task and boundary when the accepted output outperforms the best documented alternative at matched accuracy, elapsed time, availability, and lifecycle cost. The resulting framework identifies the measurements required to convert component records into reproducible system capability. Credible progress is defined by reproduced logical workloads, prospectively validated simulations, repeater links outperforming direct transmission, long-duration calibrated sensors and clocks, integrated hardware with predictable yield and reliability.

Source: arXiv:2608.21436v1 - http://arxiv.org/abs/2608.21436v1 PDF: https://arxiv.org/pdf/2608.21436v1 Original Link: http://arxiv.org/abs/2608.21436v1