Back to News
quantum-computing

Quantum Channel Testing in Average-Case Distance

Gregory Rosenthal, Hugo Aaronson, Sathyawageeswar Subramanian, Animesh Datta, and Tom Gur
Loading...
16 min read
0 likes
⚡ Quantum Brief
AbstractWe study the complexity of testing properties of quantum channels. First, we show that testing identity to any channel $\mathcal N: \mathbb C^{d_{\mathrm{in}} \times d_{\mathrm{in}}} \to \mathbb C^{d_{\mathrm{out}} \times d_{\mathrm{out}}}$ in diamond norm distance requires $\Omega(\sqrt{d_{\mathrm{in}}} / \varepsilon)$ 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.
AI Audio Summary
0:00 / 0:00
Click to play
quantum computing images (2).jpg
Quantum News · Media Library

AbstractWe study the complexity of testing properties of quantum channels. First, we show that testing identity to any channel $\mathcal N: \mathbb C^{d_{\mathrm{in}} \times d_{\mathrm{in}}} \to \mathbb C^{d_{\mathrm{out}} \times d_{\mathrm{out}}}$ in diamond norm distance requires $\Omega(\sqrt{d_{\mathrm{in}}} / \varepsilon)$ 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 $\tilde O(d_{\mathrm{in}} d_{\mathrm{out}}^{3/2} / \varepsilon^2)$ queries in ACID distance and $\tilde O(d_{\mathrm{in}}^2 d_{\mathrm{out}}^{3/2} / \varepsilon^2)$ queries in diamond distance in this model. Finally, we prove tight bounds on the complexity of channel tomography in ACID distance.► BibTeX data@article{Rosenthal2026quantumchannel, doi = {10.22331/q-2026-11-18-2276}, url = {https://doi.org/10.22331/q-2026-11-18-2276}, title = {Quantum {C}hannel {T}esting in {A}verage-{C}ase {D}istance}, author = {Rosenthal, Gregory and Aaronson, Hugo and Subramanian, Sathyawageeswar and Datta, Animesh and Gur, Tom}, journal = {{Quantum}}, issn = {2521-327X}, publisher = {{Verein zur F{\"{o}}rderung des Open Access Publizierens in den Quantenwissenschaften}}, volume = {10}, pages = {2276}, month = nov, year = {2026} }► References [1] Rajeev Acharya, Laleh Aghababaie-Beni, Igor Aleiner, Trond I Andersen, Markus Ansmann, Frank Arute, Kunal Arya, Abraham Asfaw, Nikita Astrakhantsev, and Juan Atalaya, ``Quantum error correction below the surface code threshold''. https:/​/​doi.org/​10.48550/​arXiv.2408.13687 [2] Dorit Aharonov, Alexei Y. Kitaev, and Noam Nisan, ``Quantum Circuits with Mixed States'' Symposium on the Theory of Computing (STOC) 20–30 (1998). https:/​/​doi.org/​10.1145/​276698.276708 [3] Koenraad M R Audenaert ``A sharp continuity estimate for the von Neumann entropy'' J. Phys. A 40, 8127–8136 (2007). https:/​/​doi.org/​10.1088/​1751-8113/​40/​28/​s18 [4] Sébastien Bubeck, Sitan Chen, and Jerry Li, ``Entanglement is Necessary for Optimal Quantum Property Testing'' Symposium on Foundations of Computer Science (FOCS) 692–703 (2020). https:/​/​doi.org/​10.1109/​FOCS46700.2020.00070 arXiv:2004.07869 [5] John Bostanci, Yuval Efron, Tony Metger, Alexander Poremba, Luowen Qian, and Henry Yuen, ``Unitary Complexity and the Uhlmann Transformation Problem'' (2023). https:/​/​doi.org/​10.48550/​ARXIV.2306.13073 [6] Costin Badescu, Ryan O'Donnell, and John Wright, ``Quantum state certification'' Symposium on Theory of Computing (STOC) 503–514 (2019). https:/​/​doi.org/​10.1145/​3313276.3316344 arXiv:1708.06002 [7] Fernando GSL Brandao, Marco Piani, and Paweł Horodecki, ``Generic emergence of classical features in quantum Darwinism'' Nat. Commun. 6, 7908 (2015). https:/​/​doi.org/​10.1038/​ncomms8908 arXiv:1310.8640 [8] Zongbo Baoand Penghui Yao ``On Testing and Learning Quantum Junta Channels'' Conference on Learning Theory (COLT) 195, 1064–1094 (2023). https:/​/​doi.org/​10.48550/​arXiv.2305.12097 https:/​/​proceedings.mlr.press/​v195/​bao23b.html [9] John F Clauser, Michael A Horne, Abner Shimony, and Richard A Holt, ``Proposed experiment to test local hidden-variable theories'' Phys. Rev. Lett. 23, 880 (1969). https:/​/​doi.org/​10.1103/​PhysRevLett.23.880 [10] Sitan Chen, Jerry Li, Brice Huang, and Allen Liu, ``Tight Bounds for Quantum State Certification with Incoherent Measurements'' Symposium on Foundations of Computer Science (FOCS) 1205–1213 (2022). https:/​/​doi.org/​10.1109/​FOCS54457.2022.00118 arXiv:2204.07155 [11] Sitan Chen, Jerry Li, and Ryan O'Donnell, ``Toward Instance-Optimal State Certification With Incoherent Measurements'' Conference on Learning Theory (COLT) 178, 2541–2596 (2022). https:/​/​doi.org/​10.48550/​arXiv.2102.13098 https:/​/​proceedings.mlr.press/​v178/​chen22b.html [12] Thomas Chen, Shivam Nadimpalli, and Henry Yuen, ``Testing and Learning Quantum Juntas Nearly Optimally'' Symposium on Discrete Algorithms (SODA) 1163–1185 (2023). https:/​/​doi.org/​10.1137/​1.9781611977554.CH43 arXiv:2207.05898 [13] Omar Fawzi, Nicolas Flammarion, Aurélien Garivier, and Aadil Oufkir, ``Quantum Channel Certification with Incoherent Measurements'' Conference on Learning Theory (COLT) 195, 1822–1884 (2023). https:/​/​doi.org/​10.48550/​arXiv.2303.01188 https:/​/​proceedings.mlr.press/​v195/​fawzi23a.html [14] Alexei Gilchrist, Nathan K. Langford, and Michael A. Nielsen, ``Distance measures to compare real and ideal quantum processes'' Phys. Rev. A 71, 062310 (2005). https:/​/​doi.org/​10.1103/​PhysRevA.71.062310 [15] Yinzheng Gu ``Moments of random matrices and weingarten functions'' (2013). https:/​/​qspace.library.queensu.ca/​server/​api/​core/​bitstreams/​cee37ba4-2035-48e0-ac08-2974e082a0a9/​content [16] Aram Harrow ``The church of the symmetric subspace'' (2013). https:/​/​doi.org/​10.48550/​arXiv.1308.6595 [17] Jeongwan Haah, Robin Kothari, Ryan O'Donnell, and Ewin Tang, ``Query-optimal estimation of unitary channels in diamond distance'' Symposium on Foundations of Computer Science (FOCS) 363–390 (2023). https:/​/​doi.org/​10.1109/​FOCS57990.2023.00028 arXiv:2302.14066 [18] Daniel J. Hsu, Sham M. Kakade, and Tong Zhang, ``A tail inequality for quadratic forms of subgaussian random vectors'' Electron. Commun. Probab. 17, 1–6 (2012). https:/​/​doi.org/​10.1214/​ECP.v17-2079 arXiv:1110.2842 [19] Fumio Hiaiand Dénes Petz ``The semicircle law, free random variables and entropy'' American Mathematical Soc. (2000). https:/​/​doi.org/​10.1090/​surv/​077 [20] Anna Jenčováand Martin Plávala ``Conditions for optimal input states for discrimination of quantum channels'' J. Math. Phys. 57 (2016). https:/​/​doi.org/​10.1063/​1.4972286 arXiv:1603.01437 [21] E. Knilland R. Laflamme ``Power of One Bit of Quantum Information'' Phys. Rev. Lett. 81, 5672–5675 (1998). https:/​/​doi.org/​10.1103/​PhysRevLett.81.5672 [22] Richard Kueng, David M. Long, Andrew C. Doherty, and Steven T. Flammia, ``Comparing Experiments to the Fault-Tolerance Threshold'' Phys. Rev. Lett. 117, 170502 (2016). https:/​/​doi.org/​10.1103/​PhysRevLett.117.170502 arXiv:1510.05653 [23] Robbie King, Kianna Wan, and Jarrod McClean, ``Exponential learning advantages with conjugate states and minimal quantum memory'' (2024). https:/​/​doi.org/​10.48550/​arXiv.2403.03469 [24] Noah Lindenand Ronald de Wolf ``Lightweight Detection of a Small Number of Large Errors in a Quantum Circuit'' Quantum 5, 436 (2021). https:/​/​doi.org/​10.22331/​Q-2021-04-20-436 [25] B. Laurentand P. Massart ``Adaptive estimation of a quadratic functional by model selection'' Ann. Statist. 28, 1302–1338 (2000). https:/​/​doi.org/​10.1214/​aos/​1015957395 [26] Richard A. Low ``Learning and testing algorithms for the Clifford group'' Phys. Rev. A 80, 052314 (2009). https:/​/​doi.org/​10.1103/​PhysRevA.80.052314 arXiv:0907.2833 [27] Elihu Lubkin ``Entropy of an n-system from its correlation with ak-reservoir'' J. Math. Phys. 19, 1028–1031 (1978). https:/​/​doi.org/​10.1063/​1.523763 [28] Ashley Montanaroand Ronald de Wolf ``A Survey of Quantum Property Testing'' Theory Comput. 7, 1–81 (2016). https:/​/​doi.org/​10.4086/​TOC.GS.2016.007 arXiv:1310.2035 [29] Elizabeth Meckes ``The random matrix theory of the classical compact groups'' (2019). https:/​/​doi.org/​10.1017/​9781108303453 https:/​/​case.edu/​artsci/​math/​esmeckes/​Haar_book.pdf [30] Ashley Montanaroand Tobias Osborne ``Quantum boolean functions'' Chic. J. Theor. Comput. Sci. 2010 (2010). https:/​/​doi.org/​10.4086/​cjtcs.2010.001 arXiv:0810.2435 [31] Filip B. Maciejewski, Zbigniew Puchala, and Michal Oszmaniec, ``Operational Quantum Average-Case Distances'' Quantum 7, 1106 (2023). https:/​/​doi.org/​10.22331/​Q-2023-09-11-1106 [32] Michael A. Nielsenand Isaac L. Chuang ``Quantum Computation and Quantum Information (10th Anniversary edition)'' Cambridge University Press (2010). https:/​/​doi.org/​10.1017/​CBO9780511976667 [33] Aadil Oufkir ``Sample-Optimal Quantum Process Tomography with non-adaptive Incoherent Measurements'' Symposium on Information Theory (ISIT) 1919–1924 (2023). https:/​/​doi.org/​10.1109/​ISIT54713.2023.10206538 arXiv:2301.12925 [34] Ryan O’Donnelland John Wright ``Learning and testing quantum states via probabilistic combinatorics and representation theory'' Current Developments in Mathematics 2021, 43–94 (2021). https:/​/​doi.org/​10.4310/​CDM.2021.v2021.n1.a2 https:/​/​www.cs.cmu.edu/​~odonnell/​papers/​learning-quantum-states.pdf [35] Ryan O’Donnelland John Wright ``Quantum spectrum testing'' Commun. Math. Phys. 387, 1–75 (2021). https:/​/​doi.org/​10.1145/​2746539.2746582 arXiv:1501.05028 [36] Liam Paninski ``A Coincidence-Based Test for Uniformity Given Very Sparsely Sampled Discrete Data'' IEEE Trans. Inf. Theory 54, 4750–4755 (2008). https:/​/​doi.org/​10.1109/​TIT.2008.928987 http:/​/​www.stat.columbia.edu/​~liam/​research/​pubs/​sparse-unif-test.pdf [37] Guoming Wang ``Property testing of unitary operators'' Phys. Rev. A 84, 052328 (2011). https:/​/​doi.org/​10.1103/​PhysRevA.84.052328 arXiv:1110.1133 [38] Guoming Wang ``Property Testing of Quantum Measurements'' (2012). https:/​/​doi.org/​10.48550/​arXiv.1205.0828 [39] John Watrous ``The theory of quantum information'' Cambridge university press (2018). https:/​/​doi.org/​10.1017/​9781316848142 https:/​/​cs.uwaterloo.ca/​~watrous/​TQI/​ [40] Mark M Wilde ``Quantum information theory'' Cambridge university press (2013). https:/​/​doi.org/​10.1017/​9781316809976 arXiv:1106.1445 [41] Haimeng Zhao, Laura Lewis, Ishaan Kannan, Yihui Quek, Hsin-Yuan Huang, and Matthias C. Caro, ``Learning quantum states and unitaries of bounded gate complexity'' (2023). https:/​/​doi.org/​10.48550/​ARXIV.2310.19882Cited by[1] Zhenhuan Liu, Weiyuan Gong, Zhenyu Du, and Zhenyu Cai, "Exponential Separations between Quantum Learning with and without Purification", arXiv:2410.17718, (2024). [2] Antonio Anna Mele and Lennart Bittel, "Optimal learning of quantum channels in diamond distance", arXiv:2512.10214, (2025). [3] Marcel Hinsche, Zongbo Bao, Philippe van Dordrecht, Jens Eisert, Jop Briët, and Jonas Helsen, "Clifford testing: algorithms and lower bounds", arXiv:2510.07164, (2025). [4] Roy Araiza, Yidong Chen, Marius Junge, and Peixue Wu, "Resource-Dependent Complexity of Quantum Channels", Quantum 10, 1960 (2026). [5] Filippo Girardi, Francesco Anna Mele, Haimeng Zhao, Marco Fanizza, and Ludovico Lami, "Random Stinespring superchannel: converting channel queries into dilation isometry queries", arXiv:2512.20599, (2025). [6] Andreas Bluhm, Matthias C. Caro, Francisco Escudero Gutiérrez, Junseo Lee, Aadil Oufkir, Cambyse Rouzé, and Myeongjin Shin, "Certifying and learning local quantum Hamiltonians", arXiv:2603.29809, (2026). [7] Kean Chen, Nengkun Yu, and Zhicheng Zhang, "Quantum channel tomography and estimation by local test", arXiv:2512.13614, (2025). [8] Kean Chen, Filippo Girardi, Aadil Oufkir, Nengkun Yu, and Zhicheng Zhang, "Quantum channel tomography: optimal bounds and a Heisenberg-to-classical phase transition", arXiv:2604.17369, (2026). [9] Sangwoo Jeon and Changhun Oh, "On the query complexity of unitary channel certification", npj Quantum Information 12 1, 2 (2025). [10] Zongbo Bao and Penghui Yao, "On Testing and Learning Quantum Junta Channels", IEEE Transactions on Pattern Analysis and Machine Intelligence 47 4, 2991 (2025). [11] Yiyi Cai, "Optimal detection of dissipation in Lindbladian dynamics", arXiv:2603.17736, (2026). [12] Congcong Zheng, Kun Wang, Xutao Yu, Ping Xu, and Zaichen Zhang, "Optimal Distributed Similarity Estimation of Quantum Channels", arXiv:2512.10465, (2025). [13] Hirak Ghosh, Andrew Jackson, and Animesh Datta, "Unitary Channel Testing Under a Depolarizing Noise Assumption", arXiv:2606.10730, (2026). [14] Kean Chen, Zhicheng Zhang, and Nengkun Yu, "Optimal lower bound for quantum channel tomography in away-from-boundary regime", arXiv:2601.10683, (2026). [15] Kean Chen, Qisheng Wang, and Zhicheng Zhang, "Strict Hierarchy for Quantum Channel Certification to Unitary", arXiv:2604.26900, (2026). [16] Kristin Sundal Lien and Marco Túlio Quintino, "Entanglement in quantum channel discrimination: sometimes less is more", arXiv:2605.31519, (2026). [17] Manaki Arihara, Satoshi Yoshida, Philip Taranto, and Mio Murao, "An exponential query advantage from access to Stinespring dilation unitaries in quantum channel learning", arXiv:2609.40001, (2026). [18] Satoshi Yoshida, Kazuki Okigami, Pietro M. Posta, and Dmitry Grinko, "Optimal learning of covariant quantum states and channels", arXiv:2609.39280, (2026). The above citations are from SAO/NASA ADS (last updated successfully 2026-11-18 14:42:17). The list may be incomplete as not all publishers provide suitable and complete citation data.Could not fetch Crossref cited-by data during last attempt 2026-11-18 14:42:14: Could not fetch cited-by data for 10.22331/q-2026-11-18-2276 from Crossref. This is normal if the DOI was registered recently.This Paper is published in Quantum under the Creative Commons Attribution 4.0 International (CC BY 4.0) license. Copyright remains with the original copyright holders such as the authors or their institutions. AbstractWe study the complexity of testing properties of quantum channels. First, we show that testing identity to any channel $\mathcal N: \mathbb C^{d_{\mathrm{in}} \times d_{\mathrm{in}}} \to \mathbb C^{d_{\mathrm{out}} \times d_{\mathrm{out}}}$ in diamond norm distance requires $\Omega(\sqrt{d_{\mathrm{in}}} / \varepsilon)$ 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 $\tilde O(d_{\mathrm{in}} d_{\mathrm{out}}^{3/2} / \varepsilon^2)$ queries in ACID distance and $\tilde O(d_{\mathrm{in}}^2 d_{\mathrm{out}}^{3/2} / \varepsilon^2)$ queries in diamond distance in this model. Finally, we prove tight bounds on the complexity of channel tomography in ACID distance.► BibTeX data@article{Rosenthal2026quantumchannel, doi = {10.22331/q-2026-11-18-2276}, url = {https://doi.org/10.22331/q-2026-11-18-2276}, title = {Quantum {C}hannel {T}esting in {A}verage-{C}ase {D}istance}, author = {Rosenthal, Gregory and Aaronson, Hugo and Subramanian, Sathyawageeswar and Datta, Animesh and Gur, Tom}, journal = {{Quantum}}, issn = {2521-327X}, publisher = {{Verein zur F{\"{o}}rderung des Open Access Publizierens in den Quantenwissenschaften}}, volume = {10}, pages = {2276}, month = nov, year = {2026} }► References [1] Rajeev Acharya, Laleh Aghababaie-Beni, Igor Aleiner, Trond I Andersen, Markus Ansmann, Frank Arute, Kunal Arya, Abraham Asfaw, Nikita Astrakhantsev, and Juan Atalaya, ``Quantum error correction below the surface code threshold''. https:/​/​doi.org/​10.48550/​arXiv.2408.13687 [2] Dorit Aharonov, Alexei Y. Kitaev, and Noam Nisan, ``Quantum Circuits with Mixed States'' Symposium on the Theory of Computing (STOC) 20–30 (1998). https:/​/​doi.org/​10.1145/​276698.276708 [3] Koenraad M R Audenaert ``A sharp continuity estimate for the von Neumann entropy'' J. Phys. A 40, 8127–8136 (2007). https:/​/​doi.org/​10.1088/​1751-8113/​40/​28/​s18 [4] Sébastien Bubeck, Sitan Chen, and Jerry Li, ``Entanglement is Necessary for Optimal Quantum Property Testing'' Symposium on Foundations of Computer Science (FOCS) 692–703 (2020). https:/​/​doi.org/​10.1109/​FOCS46700.2020.00070 arXiv:2004.07869 [5] John Bostanci, Yuval Efron, Tony Metger, Alexander Poremba, Luowen Qian, and Henry Yuen, ``Unitary Complexity and the Uhlmann Transformation Problem'' (2023). https:/​/​doi.org/​10.48550/​ARXIV.2306.13073 [6] Costin Badescu, Ryan O'Donnell, and John Wright, ``Quantum state certification'' Symposium on Theory of Computing (STOC) 503–514 (2019). https:/​/​doi.org/​10.1145/​3313276.3316344 arXiv:1708.06002 [7] Fernando GSL Brandao, Marco Piani, and Paweł Horodecki, ``Generic emergence of classical features in quantum Darwinism'' Nat. Commun. 6, 7908 (2015). https:/​/​doi.org/​10.1038/​ncomms8908 arXiv:1310.8640 [8] Zongbo Baoand Penghui Yao ``On Testing and Learning Quantum Junta Channels'' Conference on Learning Theory (COLT) 195, 1064–1094 (2023). https:/​/​doi.org/​10.48550/​arXiv.2305.12097 https:/​/​proceedings.mlr.press/​v195/​bao23b.html [9] John F Clauser, Michael A Horne, Abner Shimony, and Richard A Holt, ``Proposed experiment to test local hidden-variable theories'' Phys. Rev. Lett. 23, 880 (1969). https:/​/​doi.org/​10.1103/​PhysRevLett.23.880 [10] Sitan Chen, Jerry Li, Brice Huang, and Allen Liu, ``Tight Bounds for Quantum State Certification with Incoherent Measurements'' Symposium on Foundations of Computer Science (FOCS) 1205–1213 (2022). https:/​/​doi.org/​10.1109/​FOCS54457.2022.00118 arXiv:2204.07155 [11] Sitan Chen, Jerry Li, and Ryan O'Donnell, ``Toward Instance-Optimal State Certification With Incoherent Measurements'' Conference on Learning Theory (COLT) 178, 2541–2596 (2022). https:/​/​doi.org/​10.48550/​arXiv.2102.13098 https:/​/​proceedings.mlr.press/​v178/​chen22b.html [12] Thomas Chen, Shivam Nadimpalli, and Henry Yuen, ``Testing and Learning Quantum Juntas Nearly Optimally'' Symposium on Discrete Algorithms (SODA) 1163–1185 (2023). https:/​/​doi.org/​10.1137/​1.9781611977554.CH43 arXiv:2207.05898 [13] Omar Fawzi, Nicolas Flammarion, Aurélien Garivier, and Aadil Oufkir, ``Quantum Channel Certification with Incoherent Measurements'' Conference on Learning Theory (COLT) 195, 1822–1884 (2023). https:/​/​doi.org/​10.48550/​arXiv.2303.01188 https:/​/​proceedings.mlr.press/​v195/​fawzi23a.html [14] Alexei Gilchrist, Nathan K. Langford, and Michael A. Nielsen, ``Distance measures to compare real and ideal quantum processes'' Phys. Rev. A 71, 062310 (2005). https:/​/​doi.org/​10.1103/​PhysRevA.71.062310 [15] Yinzheng Gu ``Moments of random matrices and weingarten functions'' (2013). https:/​/​qspace.library.queensu.ca/​server/​api/​core/​bitstreams/​cee37ba4-2035-48e0-ac08-2974e082a0a9/​content [16] Aram Harrow ``The church of the symmetric subspace'' (2013). https:/​/​doi.org/​10.48550/​arXiv.1308.6595 [17] Jeongwan Haah, Robin Kothari, Ryan O'Donnell, and Ewin Tang, ``Query-optimal estimation of unitary channels in diamond distance'' Symposium on Foundations of Computer Science (FOCS) 363–390 (2023). https:/​/​doi.org/​10.1109/​FOCS57990.2023.00028 arXiv:2302.14066 [18] Daniel J. Hsu, Sham M. Kakade, and Tong Zhang, ``A tail inequality for quadratic forms of subgaussian random vectors'' Electron. Commun. Probab. 17, 1–6 (2012). https:/​/​doi.org/​10.1214/​ECP.v17-2079 arXiv:1110.2842 [19] Fumio Hiaiand Dénes Petz ``The semicircle law, free random variables and entropy'' American Mathematical Soc. (2000). https:/​/​doi.org/​10.1090/​surv/​077 [20] Anna Jenčováand Martin Plávala ``Conditions for optimal input states for discrimination of quantum channels'' J. Math. Phys. 57 (2016). https:/​/​doi.org/​10.1063/​1.4972286 arXiv:1603.01437 [21] E. Knilland R. Laflamme ``Power of One Bit of Quantum Information'' Phys. Rev. Lett. 81, 5672–5675 (1998). https:/​/​doi.org/​10.1103/​PhysRevLett.81.5672 [22] Richard Kueng, David M. Long, Andrew C. Doherty, and Steven T. Flammia, ``Comparing Experiments to the Fault-Tolerance Threshold'' Phys. Rev. Lett. 117, 170502 (2016). https:/​/​doi.org/​10.1103/​PhysRevLett.117.170502 arXiv:1510.05653 [23] Robbie King, Kianna Wan, and Jarrod McClean, ``Exponential learning advantages with conjugate states and minimal quantum memory'' (2024). https:/​/​doi.org/​10.48550/​arXiv.2403.03469 [24] Noah Lindenand Ronald de Wolf ``Lightweight Detection of a Small Number of Large Errors in a Quantum Circuit'' Quantum 5, 436 (2021). https:/​/​doi.org/​10.22331/​Q-2021-04-20-436 [25] B. Laurentand P. Massart ``Adaptive estimation of a quadratic functional by model selection'' Ann. Statist. 28, 1302–1338 (2000). https:/​/​doi.org/​10.1214/​aos/​1015957395 [26] Richard A. Low ``Learning and testing algorithms for the Clifford group'' Phys. Rev. A 80, 052314 (2009). https:/​/​doi.org/​10.1103/​PhysRevA.80.052314 arXiv:0907.2833 [27] Elihu Lubkin ``Entropy of an n-system from its correlation with ak-reservoir'' J. Math. Phys. 19, 1028–1031 (1978). https:/​/​doi.org/​10.1063/​1.523763 [28] Ashley Montanaroand Ronald de Wolf ``A Survey of Quantum Property Testing'' Theory Comput. 7, 1–81 (2016). https:/​/​doi.org/​10.4086/​TOC.GS.2016.007 arXiv:1310.2035 [29] Elizabeth Meckes ``The random matrix theory of the classical compact groups'' (2019). https:/​/​doi.org/​10.1017/​9781108303453 https:/​/​case.edu/​artsci/​math/​esmeckes/​Haar_book.pdf [30] Ashley Montanaroand Tobias Osborne ``Quantum boolean functions'' Chic. J. Theor. Comput. Sci. 2010 (2010). https:/​/​doi.org/​10.4086/​cjtcs.2010.001 arXiv:0810.2435 [31] Filip B. Maciejewski, Zbigniew Puchala, and Michal Oszmaniec, ``Operational Quantum Average-Case Distances'' Quantum 7, 1106 (2023). https:/​/​doi.org/​10.22331/​Q-2023-09-11-1106 [32] Michael A. Nielsenand Isaac L. Chuang ``Quantum Computation and Quantum Information (10th Anniversary edition)'' Cambridge University Press (2010). https:/​/​doi.org/​10.1017/​CBO9780511976667 [33] Aadil Oufkir ``Sample-Optimal Quantum Process Tomography with non-adaptive Incoherent Measurements'' Symposium on Information Theory (ISIT) 1919–1924 (2023). https:/​/​doi.org/​10.1109/​ISIT54713.2023.10206538 arXiv:2301.12925 [34] Ryan O’Donnelland John Wright ``Learning and testing quantum states via probabilistic combinatorics and representation theory'' Current Developments in Mathematics 2021, 43–94 (2021). https:/​/​doi.org/​10.4310/​CDM.2021.v2021.n1.a2 https:/​/​www.cs.cmu.edu/​~odonnell/​papers/​learning-quantum-states.pdf [35] Ryan O’Donnelland John Wright ``Quantum spectrum testing'' Commun. Math. Phys. 387, 1–75 (2021). https:/​/​doi.org/​10.1145/​2746539.2746582 arXiv:1501.05028 [36] Liam Paninski ``A Coincidence-Based Test for Uniformity Given Very Sparsely Sampled Discrete Data'' IEEE Trans. Inf. Theory 54, 4750–4755 (2008). https:/​/​doi.org/​10.1109/​TIT.2008.928987 http:/​/​www.stat.columbia.edu/​~liam/​research/​pubs/​sparse-unif-test.pdf [37] Guoming Wang ``Property testing of unitary operators'' Phys. Rev. A 84, 052328 (2011). https:/​/​doi.org/​10.1103/​PhysRevA.84.052328 arXiv:1110.1133 [38] Guoming Wang ``Property Testing of Quantum Measurements'' (2012). https:/​/​doi.org/​10.48550/​arXiv.1205.0828 [39] John Watrous ``The theory of quantum information'' Cambridge university press (2018). https:/​/​doi.org/​10.1017/​9781316848142 https:/​/​cs.uwaterloo.ca/​~watrous/​TQI/​ [40] Mark M Wilde ``Quantum information theory'' Cambridge university press (2013). https:/​/​doi.org/​10.1017/​9781316809976 arXiv:1106.1445 [41] Haimeng Zhao, Laura Lewis, Ishaan Kannan, Yihui Quek, Hsin-Yuan Huang, and Matthias C. Caro, ``Learning quantum states and unitaries of bounded gate complexity'' (2023). https:/​/​doi.org/​10.48550/​ARXIV.2310.19882Cited by[1] Zhenhuan Liu, Weiyuan Gong, Zhenyu Du, and Zhenyu Cai, "Exponential Separations between Quantum Learning with and without Purification", arXiv:2410.17718, (2024). [2] Antonio Anna Mele and Lennart Bittel, "Optimal learning of quantum channels in diamond distance", arXiv:2512.10214, (2025). [3] Marcel Hinsche, Zongbo Bao, Philippe van Dordrecht, Jens Eisert, Jop Briët, and Jonas Helsen, "Clifford testing: algorithms and lower bounds", arXiv:2510.07164, (2025). [4] Roy Araiza, Yidong Chen, Marius Junge, and Peixue Wu, "Resource-Dependent Complexity of Quantum Channels", Quantum 10, 1960 (2026). [5] Filippo Girardi, Francesco Anna Mele, Haimeng Zhao, Marco Fanizza, and Ludovico Lami, "Random Stinespring superchannel: converting channel queries into dilation isometry queries", arXiv:2512.20599, (2025). [6] Andreas Bluhm, Matthias C. Caro, Francisco Escudero Gutiérrez, Junseo Lee, Aadil Oufkir, Cambyse Rouzé, and Myeongjin Shin, "Certifying and learning local quantum Hamiltonians", arXiv:2603.29809, (2026). [7] Kean Chen, Nengkun Yu, and Zhicheng Zhang, "Quantum channel tomography and estimation by local test", arXiv:2512.13614, (2025). [8] Kean Chen, Filippo Girardi, Aadil Oufkir, Nengkun Yu, and Zhicheng Zhang, "Quantum channel tomography: optimal bounds and a Heisenberg-to-classical phase transition", arXiv:2604.17369, (2026). [9] Sangwoo Jeon and Changhun Oh, "On the query complexity of unitary channel certification", npj Quantum Information 12 1, 2 (2025). [10] Zongbo Bao and Penghui Yao, "On Testing and Learning Quantum Junta Channels", IEEE Transactions on Pattern Analysis and Machine Intelligence 47 4, 2991 (2025). [11] Yiyi Cai, "Optimal detection of dissipation in Lindbladian dynamics", arXiv:2603.17736, (2026). [12] Congcong Zheng, Kun Wang, Xutao Yu, Ping Xu, and Zaichen Zhang, "Optimal Distributed Similarity Estimation of Quantum Channels", arXiv:2512.10465, (2025). [13] Hirak Ghosh, Andrew Jackson, and Animesh Datta, "Unitary Channel Testing Under a Depolarizing Noise Assumption", arXiv:2606.10730, (2026). [14] Kean Chen, Zhicheng Zhang, and Nengkun Yu, "Optimal lower bound for quantum channel tomography in away-from-boundary regime", arXiv:2601.10683, (2026). [15] Kean Chen, Qisheng Wang, and Zhicheng Zhang, "Strict Hierarchy for Quantum Channel Certification to Unitary", arXiv:2604.26900, (2026). [16] Kristin Sundal Lien and Marco Túlio Quintino, "Entanglement in quantum channel discrimination: sometimes less is more", arXiv:2605.31519, (2026). [17] Manaki Arihara, Satoshi Yoshida, Philip Taranto, and Mio Murao, "An exponential query advantage from access to Stinespring dilation unitaries in quantum channel learning", arXiv:2609.40001, (2026). [18] Satoshi Yoshida, Kazuki Okigami, Pietro M. Posta, and Dmitry Grinko, "Optimal learning of covariant quantum states and channels", arXiv:2609.39280, (2026). The above citations are from SAO/NASA ADS (last updated successfully 2026-11-18 14:42:17). The list may be incomplete as not all publishers provide suitable and complete citation data.Could not fetch Crossref cited-by data during last attempt 2026-11-18 14:42:14: Could not fetch cited-by data for 10.22331/q-2026-11-18-2276 from Crossref. This is normal if the DOI was registered recently.This Paper is published in Quantum under the Creative Commons Attribution 4.0 International (CC BY 4.0) license. Copyright remains with the original copyright holders such as the authors or their institutions.

Read Original

Tags

quantum-networking

Source Information

Source: Quantum Journal

Discussion

0 professional contributions

Sign in to join this professional discussion.

Be the first to add a constructive contribution.