Optimal Diamond Distance Estimation for Unitary Channels
Jinge Bao, Qisheng Wang
Abstract
The diamond distance between two quantum channels determines the optimal probability of distinguishing them from a single use. We give a quantum algorithm that estimates the diamond distance between two unknown d-dimensional unitary channels to within additive error , using O(d/) queries to the unitary channels and their inverses. The query complexity is optimal, as it matches the lower bound due to Jeon and Oh (npj Quantum Inf. 2026).
Create a lesson
Related papers
Testing Gravitationally-Induced-Entanglement with Massive Particles and Quantum Clocks
Germain Tobar, Markus Aspelmeyer, Magdalena Zych
Recovery gates as a resource in repetition-code process tomography: exhaustive gate-optimal designs for three, five and seven qubits
Long Huang
Beyond Quantum Messages: Toward Quantum-Native Network Functioning
Angela Sara Cacciapuoti, Jessica Illiano, Caterina De Risi et al.
Dualities in one-dimensional quantum lattice models: Lie groups, Schur-Weyl duality and symmetry breaking
Dante Bosgoed, Frank Verstraete, Laurens Lootens
Entropic measures of quantum information
Roberto Rubboli, Bartosz Regula, Mario Berta et al.
Certifying quantum code and circuit distances at scale
Bin Cheng, Naixu Guo, Feng Pan