Challenges
Datasets
Workspaces
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice
Research Papers

Research Papers

Share and discuss quantum computing research

last post 23d ago by aqora_bot
Aqora Botaqora_bot

1

Posted 3mo ago

Quantum channel tomography: optimal bounds and a Heisenberg-to-classical phase transition

External link
Kean Chen, Filippo Girardi, Aadil Oufkir, Nengkun Yu, Zhicheng Zhang (Apr 21 2026).
Abstract: How many black-box queries to a quantum channel are needed to learn its full classical description? This question lies at the heart of quantum channel tomography (also known as quantum process tomography), a fundamental task in the characterization and validation of quantum hardware. Despite extensive prior work, the optimal query complexity for quantum channel tomography is far from fully understood. In this paper, we study tomography of an unknown quantum channel with input dimension d1d_1d1​, output dimension d2d_2d2​, and Kraus rank at most rrr, to within error ε\varepsilonε. We identify the dilation rate τ=rd2/d1\tau = r d_2 / d_1τ=rd2​/d1​ (which always satisfies τ≥1\tau\geq 1τ≥1 due to the trace preservation of quantum channels) as a key parameter, and establish that the optimal query complexity of channel tomography exhibits distinct scaling laws across three regimes of τ\tauτ. - In the boundary regime (τ=1\tau = 1τ=1): we show that the query complexity is Θ(rd1d2/ε)\Theta(r d_1 d_2/\varepsilon)Θ(rd1​d2​/ε) for Choi trace norm error ε\varepsilonε, and is upper bounded by O(min⁡{rd11.5d2/ε,rd1d2/ε2})O(\min\{r d_1^{1.5} d_2/\varepsilon, r d_1 d_2/\varepsilon^2\})O(min{rd11.5​d2​/ε,rd1​d2​/ε2}) and lower bounded by Ω(rd1d2/ε)\Omega(r d_1 d_2/\varepsilon)Ω(rd1​d2​/ε) for diamond norm error ε\varepsilonε. - In the away-from-boundary regime (τ≥1+Ω(1)\tau \geq 1+\Omega(1)τ≥1+Ω(1)): we show that the query complexity is Θ(rd1d2/ε2)\Theta(r d_1 d_2/\varepsilon^2)Θ(rd1​d2​/ε2) for both Choi trace norm and diamond norm errors ε\varepsilonε. Our results uncover a sharp Heisenberg-to-classical phase transition in the query complexity of quantum channel tomography: at τ=1\tau=1τ=1, the optimal query complexity exhibits Heisenberg scaling 1/ε1/\varepsilon1/ε, whereas for τ≥1+Ω(1)\tau\geq 1+\Omega(1)τ≥1+Ω(1), it exhibits classical scaling 1/ε21/\varepsilon^21/ε2. In addition, we show that in the near-boundary regime (1<τ<1+o(1)1< \tau < 1+o(1)1<τ<1+o(1)), the query complexity exhibits a mixture of Heisenberg and classical scaling behaviors.
Arxiv: https://arxiv.org/abs/2604.17369

Order by:

Want to join this discussion?

Join our community today and start discussing with our members by participating in exciting events, competitions, and challenges. Sign up now to engage with quantum experts!

LoginSign up