Operational Quantum Average-Case Distances
arXiv:2112.14283 · doi:10.22331/q-2023-09-11-1106
Abstract
We introduce distance measures between quantum states, measurements, and channels based on their statistical distinguishability in generic experiments. Specifically, we analyze the average Total Variation Distance (TVD) between output statistics of protocols in which quantum objects are intertwined with random circuits and measured in standard basis. We show that for circuits forming approximate 4-designs, the average TVDs can be approximated by simple explicit functions of the underlying objects -- the average-case distances (ACDs). We apply them to analyze the effects of noise in quantum advantage experiments and for efficient discrimination of high-dimensional states and channels without quantum memory. We argue that ACDs are better suited for assessing the quality of NISQ devices than common distance measures such as trace distance or the diamond norm.
arXiv comment6 pages, 2 figures; v2: changed title, corrected typos; v3: improved narration, corrected typos, extended numerical simulations; v4: major changes, improved narration, extended examples and numerical simulations; v5: version accepted in Quantum, improved narration, expanded appendices; comments and suggestions are welcome; accompanying technical paper: arXiv:2112.14284
References in corpus (32)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- A variational eigenvalue solver on a quantum processor
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- QuTiP 2: A Python framework for the dynamics of open quantum systems
- Barren plateaus in quantum neural network training landscapes
- QuTiP: An open-source Python framework for the dynamics of open quantum systems
- Characterizing Quantum Supremacy in Near-Term Devices
- Predicting Many Properties of a Quantum System from Very Few Measurements
- Robust randomized benchmarking of quantum processes
- Distance measures to compare real and ideal quantum processes
- Scalable Noise Estimation with Random Unitary Operators
- Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
- Efficient measurement of quantum gate error by interleaved randomized benchmarking
- Measuring measurement
- Local random quantum circuits are approximate polynomial-designs
- Characterization of addressability by simultaneous randomized benchmarking
- Quantum Computation of Electronic Transitions using a Variational Quantum Eigensolver
- Information-theoretic bounds on quantum advantage in machine learning
- Mitigation of readout noise in near-term quantum devices by classical post-processing based on detector tomography
- Simulating positive-operator-valued measures with projective measurements
- Robust shadow estimation
- Approximate unitary -designs by short random quantum circuits using nearest-neighbor and long-range gates
- Models of quantum complexity growth
- Learning to Measure: Adaptive Informationally Complete Generalized Measurements for Quantum Algorithms
- Quantum Algorithmic Measurement
- Performance of quantum error correction with coherent errors
- How energy conservation limits our measurements
- Modeling and mitigation of cross-talk effects in readout noise with applications to the Quantum Approximate Optimization Algorithm
- Strategies for optimal single-shot discrimination of quantum measurements
- Improved spectral gaps for random quantum circuits: large local dimensions and all-to-all interactions
- Exploring Quantum Average-Case Distances: proofs, properties, and examples
Cited by in corpus (4)
- The Wasserstein distance of order 1 for quantum spin systems on infinite lattices
- Saturation and recurrence of quantum complexity in random local quantum dynamics
- Certification of quantum state functions under partial information
- Benchmarking the quality of multiplexed qubit readout beyond assignment fidelity