Quantum tomography using state-preparation unitaries
Not on the map. Why?
Abstract (arXiv)
We describe algorithms to obtain an approximate classical description of a d-dimensional quantum state when given access to a unitary (and its inverse) that prepares it. For pure states we characterize the query complexity for ℓq-norm error up to logarithmic factors. As a special case, we show that it takes widetildeTheta(d/varepsilon) applications of the unitaries to obtain an varepsilon-ℓ2-approximation of the state. For mixed states we consider a similar model, where the unitary prepares a purification of the state. In this model we give an efficient algorithm for obtaining Schatten q-norm estimates of a rank-r mixed state, giving query upper bounds that are close to optimal. In particular, we show that a trace-norm (q=1) estimate can be obtained with widetildeO(dr/varepsilon) queries. This improves (assuming our stronger input model) the varepsilon-dependence over the algorithm of Haah et al. (2017) that uses a joint measurement on widetildeO(dr/varepsilon2) copies of the state. To our knowledge, the most sample-efficient results for pure-state tomography come from setting the rank to 1 in generic mixed-state tomography algorithms, which can be computationally demanding. We describe sample-optimal algorithms for pure states that are easy and fast to implement. Along the way we show that an ℓ_∞-norm estimate of a normalized vector induces a (slightly worse) ℓq-norm estimate for that vector, without losing a dimension-dependent factor in the precision. We also develop an unbiased and symmetric version of phase estimation, where the probability distribution of the estimate is centered around the true value. Finally, we give an efficient method for estimating multiple expectation values, improving over the recent result by Huggins et al. (2021) when the measurement operators do not fully overlap.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 18 Jul 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 2; 2025: 3; 2026: 1.
6 papers.
- 2025Evaluating the Potential of Quantum Machine Learning in Cybersecurity: A Case-Study on PCA-based Intrusion Detection Systemscited by 2
- 2024Quantum Speedup for Spectral Approximation of Kronecker Productscited by 1
- 2024Separable Power of Classical and Quantum Learning Protocols Through the Lens of No-Free-Lunch Theoremcited by 1
- 2025Accelerating Inference for Multilayer Neural Networks with Quantum Computerscited by 1
- 2025Quantum Sparse Recovery and Quantum Orthogonal Matching Pursuitcited by 0
- 2026Advantage of Sample Complexity in Quantum PAC Learning Requires Inverse Access to State-Preparation Unitariescited by 0
- 2026Advantage of Sample Complexity in Quantum PAC Learning Requires Inverse Access to State-Preparation Unitaries29 Sep 2026
- 2025Accelerating Inference for Multilayer Neural Networks with Quantum Computers8 Oct 2025
- 2025Quantum Sparse Recovery and Quantum Orthogonal Matching Pursuit8 Oct 2025
- 2025Evaluating the Potential of Quantum Machine Learning in Cybersecurity: A Case-Study on PCA-based Intrusion Detection Systems16 Feb 2025
- 2024Separable Power of Classical and Quantum Learning Protocols Through the Lens of No-Free-Lunch Theorem12 May 2024
- 2024Quantum Speedup for Spectral Approximation of Kronecker Products10 Feb 2024