arXiv:2609.38145
Query-optimal unitary channel tomography in diamond distance with parallel access
Entong He, Zihao Li, Yuxiang Yang
Abstract
In the study of quantum process tomography, it has remained open how to learn a unitary channel in diamond distance with strictly parallel queries as efficiently as with sequential queries. Sequential queries allow one to exploit adaptivity to refine the estimate and adjust the learning strategy accordingly, whereas such adjustments are impossible for parallel queries. From the perspective of higher-order quantum operations, any parallel learning strategy can be simulated by a sequential one, whereas the converse does not hold in general, suggesting that sequential learning strategies are potentially more powerful. Contrary to this intuition, we present a new protocol for learning an unknown $d$-dimensional unitary channel to within $\varepsilon$ in diamond distance using $\mathcal{O}(d^2/\varepsilon)$ parallel queries, matching the lower bound presented in [Haah, Kothari, O'Donnell, and Tang, FOCS '23]. Our protocol thus closes the gap between parallel and sequential strategies for unitary channel tomography. As applications, it achieves optimal query complexity for boundary-regime quantum channel tomography and improves the query efficiency of the best-known protocol for tomography of fermionic linear optics.
AI Summary
The paper asks whether strictly parallel queries can match the optimal sequential query complexity for learning an unknown $d$-dimensional unitary channel in diamond distance. Parallel access permits entangled inputs and a collective final measurement, but no oracle output can influence another oracle input. Existing parallel bounds incurred additional dimension factors or worse accuracy dependence. It constructs a protocol using $O(d^2/\varepsilon)$ parallel queries that outputs a classical unitary-channel estimate within diamond distance $\varepsilon$ with probability at least $2/3$. Specifically, it uses at most $Q=d(L-d)\leq 8\pi d^2/\varepsilon$ queries, where $L=\lceil8\pi d/\varepsilon\rceil-1$. This matches the known information-theoretic lower bound and sequential upper bound. The construction uses covariant estimation and representation-theoretic probe weights derived from a Slater determinant of the lowest $d$ discrete sine modes. Global-phase invariance allows coherence between sectors with different query counts to be replaced by classical randomization. Rather than converting average infidelity into diamond distance, the analysis directly bounds eigenphase escape probabilities: the expected number outside a prescribed arc is $O(d^3/(L\varepsilon)^3)$, sufficient when $L=\Theta(d/\varepsilon)$. Applications give optimal $O(rd_1d_2/\varepsilon)$ channel tomography in the boundary regime $rd_2=d_1$, using a parallel-tester dilation theorem, and $O(n^2/\varepsilon)$ queries for $n$-mode fermionic linear-optics tomography. The guarantees concern query complexity with unrestricted probe preparation and collective measurements; gate complexity and implementation costs are not bounded. General channel tomography outside the boundary regime is not resolved.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 30 pages. Comments are welcome