Fast and robust quantum state tomography from few basis measurements
arXiv:2009.08216 · doi:10.4230/LIPIcs.TQC.2021.7
Abstract
Quantum state tomography is a powerful, but resource-intensive, general solution for numerous quantum information processing tasks. This motivates the design of robust tomography procedures that use relevant resources as sparingly as possible. Important cost factors include the number of state copies and measurement settings, as well as classical postprocessing time and memory. In this work, we present and analyze an online tomography algorithm designed to optimize all the aforementioned resources at the cost of a worse dependence on accuracy. The protocol is the first to give provably optimal performance in terms of rank and dimension for state copies, measurement settings and memory. Classical runtime is also reduced substantially and numerical experiments demonstrate a favorable comparison with other state-of-the-art techniques. Further improvements are possible by executing the algorithm on a quantum computer, giving a quantum speedup for quantum state tomography.
arXiv commentCorrected typos and added numerical examples
References in corpus (27)
- Quantum Computing in the NISQ era and beyond
- Improved Simulation of Stabilizer Circuits
- Quantum state tomography via compressed sensing
- Quantum random access memory
- Matrix product states represent ground states faithfully
- Exact and Approximate Unitary 2-Designs: Constructions and Applications
- Coding Theorem and Strong Converse for Quantum Channels
- Quantum Tomography via Compressed Sensing: Error Bounds, Sample Complexity, and Efficient Estimators
- Evenly distributed unitaries: on the structure of unitary designs
- Quantum Metropolis Sampling
- Sampling from the thermal quantum Gibbs state and evaluating partition functions with a quantum computer
- Multiqubit Clifford groups are unitary 3-designs
- Sample-optimal tomography of quantum states
- Experimental quantum compressed sensing for a seven-qubit system
- A Quantum-Quantum Metropolis Algorithm
- Self-guided quantum tomography
- Unitary designs from statistical mechanics in random quantum circuits
- Recovering quantum gates from few average gate fidelities
- The Clifford group fails gracefully to be a unitary 4-design
- Precision-guaranteed quantum tomography
- Strong bound between trace distance and Hilbert-Schmidt distance for low-rank states
- Distinguishing multi-partite states by local measurements
- Qubit stabilizer states are complex projective 3-designs
- Faster quantum and classical SDP approximations for quadratic binary optimization
- Quantum Tomography From Few Full-Rank Observables
- Distinguishing quantum states using Clifford orbits
- Semi-device-dependent blind quantum tomography
Cited by in corpus (7)
- Projected Least-Squares Quantum Process Tomography
- Faster quantum and classical SDP approximations for quadratic binary optimization
- Learning quantum many-body systems from a few copies
- Quantum State Tomography for Matrix Product Density Operators
- Efficient learning of -doped stabilizer states with single-copy measurements
- Comparison of confidence regions for quantum state tomography
- Efficient Learning of Quantum States Prepared With Few Non-Clifford Gates