Exploring Quantum Average-Case Distances: proofs, properties, and examples

Abstract

In this work, we perform an in-depth study of recently introduced average-case quantum distances. The average-case distances approximate the average Total-Variation (TV) distance between measurement outputs of two quantum processes, in which quantum objects of interest (states, measurements, or channels) are intertwined with random circuits. Contrary to conventional distances, such as trace distance or diamond norm, they quantify $\text{average-case}$ statistical distinguishability via random circuits. We prove that once a family of random circuits forms an $\delta$-approximate $4$-design, with $\delta =o(d^{-8})$, then the average-case distances can be approximated by simple explicit functions that can be expressed via degree two polynomials in objects of interest. We prove that those functions, which we call quantum average-case distances, have a plethora of desirable properties, such as subadditivity, joint convexity, and (restricted) data-processing inequalities. Notably, all of the distances utilize the Hilbert-Schmidt norm which provides an operational interpretation it did not possess before. We also derive upper bounds on the maximal ratio between worst-case and average-case distances. For each dimension $d$ this ratio is at most $d^{\frac{1}{2}},d,d^{\frac{3}{2}}$ for states, measurements, and channels, respectively. To support the practical usefulness of our findings, we study multiple examples in which average-case quantum distances can be calculated analytically.

arXiv comment27 pages, 3 figures, 3 tables; v4: major changes, improved narration, extended examples, removed numerical results (extended version of them is available in accompanying paper); v6: multiple minor changes, improved narration, corrected multiple typos. Version accepted in IEEE Transactions on Information Theory; comments and suggestions are welcome; accompanying "practical" paper: arXiv:2112.14283

References in corpus (54)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• A variational eigenvalue solver on a quantum processor
• Variational Quantum Algorithms
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Barren plateaus in quantum neural network training landscapes
• A Quantum Approximate Optimization Algorithm
• Predicting Many Properties of a Quantum System from Very Few Measurements
• Robust randomized benchmarking of quantum processes
• A simple formula for the average gate fidelity of a quantum dynamical operation
• 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
• Mitigating measurement errors in multi-qubit experiments
• 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
• Statistical distinguishability between unitary operations
• Mitigation of readout noise in near-term quantum devices by classical post-processing based on detector tomography
• Gate Set Tomography
• Simulating positive-operator-valued measures with projective measurements
• Model-free readout-error mitigation for quantum expectation values
• Fidelity of Single Qubit Maps
• Distinguishability of quantum states under restricted families of measurements with an application to quantum data hiding
• Quantum annealing initialization of the quantum approximate optimization algorithm
• Robust shadow estimation
• Models of quantum complexity growth
• Clean Positive Operator Valued Measures
• The Quantum Wasserstein Distance of Order 1
• Efficient correction of multiqubit measurement errors
• The Church of the Symmetric Subspace
• Quantum detector tomography of superconducting nanostrip photon-number-resolving detector
• Operationally Invariant Measure of the Distance between Quantum States by Complementary Measurements
• Characterizing local noise in QAOA circuits
• How energy conservation limits our measurements
• Recursive quantum detector tomography
• Modeling and mitigation of cross-talk effects in readout noise with applications to the Quantum Approximate Optimization Algorithm
• Quantum circuits for exact unitary $t$-designs and applications to higher-order randomized benchmarking
• Simulating all quantum measurements using only projective measurements and postselection
• Strategies for optimal single-shot discrimination of quantum measurements
• Distinguishing multi-partite states by local measurements
• Improved spectral gaps for random quantum circuits: large local dimensions and all-to-all interactions
• Almost all quantum channels are equidistant
• Adaptive Pauli Shadows for Energy Estimation
• Entropic trade-off relations for quantum operations
• Averaged circuit eigenvalue sampling
• Efficient Unitarity Randomized Benchmarking of Few-qubit Clifford Gates
• Partitioned trace distances
• Conditions for optimal input states for discrimination of quantum channels
• Geometric approach to quantum statistical inference
• Distinguishing quantum states using Clifford orbits
• Multiple-shot and unambiguous discrimination of von Neumann measurements
• Estimation of correlations and non-separability in quantum channels via unitarity benchmarking

Cited by in corpus (3)

• Operational Quantum Average-Case Distances
• Sparse Probabilistic Synthesis of Quantum Operations
• Extremal jumps of circuit complexity of unitary evolutions generated by random Hamiltonians