Quantum Channel Testing in Average-Case Distance

We study the complexity of testing properties of quantum channels. First, we show that testing identity to any channel N : C d i n × d i n → C d o u t × d o u t in diamond norm distance requires Ω ( d i n / ε ) queries, even in the strongest algorithmic model that admits ancillae, coherence, and adaptivity. This is due to the worst-case nature of the distance induced by the diamond norm.Motivated by this limitation and other theoretical and practical applications, we introduce an average-case analogue of the diamond norm, which we call the average-case imitation diamond (ACID) norm. In the weakest algorithmic model without ancillae, coherence, or adaptivity, we prove that testing identity to certain types of channels in ACID distance can be done with complexity independent of the dimensions of the channel, while for other types of channels the complexity depends on both the input and output dimensions. Building on previous work, we also show that identity to any fixed channel can be tested with O ~ ( d i n d o u t 3 / 2 / ε 2 ) queries in ACID distance and O ~ ( d i n 2 d o u t 3 / 2 / ε 2 ) queries in diamond distance in this model. Finally, we prove tight bounds on the complexity of channel tomography in ACID distance.

Authors

Institutions

Publication Details

Journal
Quantum
Published
2026-11-18
DOI
https://doi.org/10.22331/q-2026-11-18-2276
Citations
19
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
13.55

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Quantum Channel Testing in Average-Case Distance

Animesh Datta, Tom Gur, Sathyawageeswar Subramanian, Hugo Aaronson
19 citations
Quantum
Quantum Computing Algorithms and Architecture
13.55
article

Quantum Channel Testing in Average-Case Distance

Animesh Datta, Tom Gur, Sathyawageeswar Subramanian, Hugo Aaronson
article en
19 citations

Abstract

We study the complexity of testing properties of quantum channels. First, we show that testing identity to any channel N : C d i n × d i n → C d o u t × d o u t in diamond norm distance requires Ω ( d i n / ε ) queries, even in the strongest algorithmic model that admits ancillae, coherence, and adaptivity. This is due to the worst-case nature of the distance induced by the diamond norm.Motivated by this limitation and other theoretical and practical applications, we introduce an average-case analogue of the diamond norm, which we call the average-case imitation diamond (ACID) norm. In the weakest algorithmic model without ancillae, coherence, or adaptivity, we prove that testing identity to certain types of channels in ACID distance can be done with complexity independent of the dimensions of the channel, while for other types of channels the complexity depends on both the input and output dimensions. Building on previous work, we also show that identity to any fixed channel can be tested with O ~ ( d i n d o u t 3 / 2 / ε 2 ) queries in ACID distance and O ~ ( d i n 2 d o u t 3 / 2 / ε 2 ) queries in diamond distance in this model. Finally, we prove tight bounds on the complexity of channel tomography in ACID distance.

QuantumVol. 10
University of Cambridge (GB), University of Warwick (GB)
UK Research and Innovation, Medical Research Council, Engineering and Physical Sciences Research Council, HORIZON EUROPE European Research Council
Openalex Percentile: Top 1%
Quantum Computing Algorithms and Architecture
13.55
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon