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.

27 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 (15)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• A Quantum Approximate Optimization Algorithm
• Robust randomized benchmarking of quantum processes
• Measuring measurement
• Characterization of addressability by simultaneous randomized benchmarking
• Quantum Computation of Electronic Transitions using a Variational Quantum Eigensolver
• Clean Positive Operator Valued Measures
• Quantum detector tomography of superconducting nanostrip photon-number-resolving detector
• Recursive quantum detector tomography
• Quantum circuits for exact unitary $t$-designs and applications to higher-order randomized benchmarking
• Adaptive Pauli Shadows for Energy Estimation
• Averaged circuit eigenvalue sampling
• Geometric approach to quantum statistical inference
• Distinguishing quantum states using Clifford orbits
• 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