Sample-Optimal Quantum Process Tomography with Non-Adaptive Incoherent Measurements
Aadil Oufkir

TL;DR
This paper establishes near-optimal bounds on the number of copies needed for non-adaptive quantum process tomography, showing the precise scaling with input/output dimensions and error tolerance.
Contribution
It extends previous results to provide tight bounds on the sample complexity for non-adaptive quantum process tomography, including necessary and sufficient conditions.
Findings
Upper bound of (d_in^3 d_out^3 / \u03b5^2) copies for learning quantum channels
Lower bound of (d_in^3 d_out^3 / b5^2) copies for any strategy with incoherent measurements
Bounds hold even with ancilla assistance
Abstract
How many copies of a quantum process are necessary and sufficient to construct an approximate classical description of it? We extend the result of Surawy-Stepney, Kahn, Kueng, and Guta (2022) to show that copies are sufficient to learn any quantum channel to within in diamond norm. Moreover, we show that copies are necessary for any strategy using incoherent non-adaptive measurements. This lower bound applies even for ancilla-assisted strategies.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Stochastic Gradient Optimization Techniques
