,
Qisheng Wang
,
Zhicheng Zhang
Creative Commons Attribution 4.0 International license
We consider the problem of quantum channel certification to unitary, where one is given access to an unknown d-dimensional channel ℰ, and wants to test whether ℰ is equal to a target unitary channel or is ε-far from it in the diamond norm. We present optimal quantum algorithms for this problem, settling the query complexities in three access models with increasing power. Specifically, we show that: 1) Θ(d/ε²) queries suffice for incoherent access model, matching the lower bound due to Fawzi, Flammarion, Garivier, and Oufkir (COLT 2023). 2) Θ(d/ε) queries suffice for coherent access model, matching the lower bound due to Regev and Schiff (ICALP 2008). 3) Θ(√d/ε) queries suffice for source-code access model, matching the lower bound due to Jeon and Oh (npj Quantum Inf. 2026). This demonstrates a strict hierarchy of complexities for quantum channel certification to unitary across various access models.
@InProceedings{chen_et_al:LIPIcs.ICALP.2026.59,
author = {Chen, Kean and Wang, Qisheng and Zhang, Zhicheng},
title = {{Strict Hierarchy for Quantum Channel Certification to Unitary}},
booktitle = {53rd International Colloquium on Automata, Languages, and Programming (ICALP 2026)},
pages = {59:1--59:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-428-4},
ISSN = {1868-8969},
year = {2026},
volume = {374},
editor = {Bhattacharya, Sayan and Nanongkai, Danupon and Benedikt, Michael and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.59},
URN = {urn:nbn:de:0030-drops-264480},
doi = {10.4230/LIPIcs.ICALP.2026.59},
annote = {Keywords: Quantum algorithms, quantum channels, quantum certification, query complexity, entanglement fidelity}
}