⚛️Researchers Prove Optimal Quantum Channel Tomography Needs Only Θ(dindoutk) Queries
Quantum process tomography just got a provably optimal recipe
TL;DR
Researchers proved the query complexity of quantum channel tomography is Θ(dindoutk) at constant diamond-distance accuracy, closing a gap that stood at O(d^6) for years. The algorithm is conceptually simple: run optimal state tomography on the Choi state. If you build quantum hardware or simulators, your characterization budget just got a lot clearer.
Somebody finally nailed the cost of characterizing a quantum channel. The new result shows you need Θ(dindoutk) channel uses to learn an unknown channel to fixed constant accuracy in diamond distance, and the upper bound matches the lower bound. That's the whole game for quantum process tomography. Why should you care? If you're poking at quantum hardware, channel tomography is how you find out what your gates actually do. Until now, the best schemes for arbitrary d-dimensional channels burned roughly O(d^6) uses, and the gap to the information-theoretic floor was embarrassingly large. The algorithm here is simple: do optimal tomography on the Choi-state representation, which reduces the whole problem to pure-state tomography. Channels subsume states, unitaries, and measurements, so one protocol covers all of them. The numbers: channels with input and output dimensions din and dout and Kraus rank at most k have a Θ(dindoutk)-parameter description. Without a Kraus rank assumption, the query complexity is O(din^2 dout^2/ε^2). When Kraus rank exceeds the minimum the dimensions allow, an Ω(ε^-2) term is unavoidable. Watch for follow-up work on whether these constants survive in noisy, experimentally realistic settings.

Key Points
The best previously known schemes for arbitrary d-dimensional channels required roughly O(d^6) channel uses, leaving a substantial gap against information-theoretic lower bounds.
Keep reading — it's free
Enter your email to keep reading — plus the best of AI & tech, daily. Free, forever.
Already a member? Sign in
Comments
Be the first to comment