Quantum State Tomography for Matrix Product Density Operators

Abstract

The reconstruction of quantum states from experimental measurements, often achieved using quantum state tomography (QST), is crucial for the verification and benchmarking of quantum devices. However, performing QST for a generic unstructured quantum state requires an enormous number of state copies that grows \emph{exponentially} with the number of individual quanta in the system, even for the most optimal measurement settings. Fortunately, many physical quantum states, such as states generated by noisy, intermediate-scale quantum computers, are usually structured. In one dimension, such states are expected to be well approximated by matrix product operators (MPOs) with a finite matrix/bond dimension independent of the number of qubits, therefore enabling efficient state representation. Nevertheless, it is still unclear whether efficient QST can be performed for these states in general. In this paper, we attempt to bridge this gap and establish theoretical guarantees for the stable recovery of MPOs using tools from compressive sensing and the theory of empirical processes. We begin by studying two types of random measurement settings: Gaussian measurements and Haar random rank-one Positive Operator Valued Measures (POVMs). We show that the information contained in an MPO with a finite bond dimension can be preserved using a number of random measurements that depends only \emph{linearly} on the number of qubits, assuming no statistical error of the measurements. We then study MPO-based QST with physical quantum measurements through Haar random rank-one POVMs that can be implemented on quantum computers. We prove that only a \emph{polynomial} number of state copies in the number of qubits is required to guarantee bounded recovery error of an MPO state.

References in corpus (54)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• The density-matrix renormalization group in the age of matrix product states
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Area laws for the entanglement entropy - a review
• Machine learning and the physical sciences
• Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
• Predicting Many Properties of a Quantum System from Very Few Measurements
• Matrix Product Density Operators: Simulation of finite-T and dissipative systems
• The Convex Geometry of Linear Inverse Problems
• Matrix product states represent ground states faithfully
• Quantum state estimation
• Efficient tensor completion for color image and video recovery: Low-rank tensor train
• Optimal, reliable estimation of quantum states
• Matrix product operator representations
• The randomized measurement toolbox
• Local random quantum circuits are approximate polynomial-designs
• Tensor Ring Decomposition
• Tight informationally complete quantum measurements
• Efficient tomography of a quantum many-body system
• Image compression and entanglement
• A positive tensor network approach for simulating open quantum many-body systems
• Sample-optimal tomography of quantum states
• Approximation by Quantum Circuits
• Iterative algorithm for reconstruction of entangled states
• A practical and efficient approach for Bayesian quantum state estimation
• Scalable reconstruction of density matrices
• How many entries of a typical orthogonal matrix can be approximated by independent normals?
• Compressing Recurrent Neural Network with Tensor Train
• Practical Bayesian Tomography
• Efficient classical simulation of noisy random quantum circuits in one dimension
• Machine learning assisted quantum state estimation
• Efficient and feasible state tomography of quantum many-body systems
• Quasioptimality of maximum-volume cross interpolation of tensors
• Practical, Reliable Error Bars in Quantum Tomography
• Strong bound between trace distance and Hilbert-Schmidt distance for low-rank states
• Robust CUR Decomposition: Theory and Imaging Applications
• Early Stopping for Deep Image Prior
• Tensor Train decomposition on TensorFlow (T3F)
• Efficient description of many-body systems with Matrix Product Density Operators
• Distinguishing multi-partite states by local measurements
• Tensor Completion by Alternating Minimization under the Tensor Train (TT) Model
• Scalable Quantum Tomography with Fidelity Estimation
• A precise local limit theorem for the multinomial distribution and some applications
• Provable Tensor-Train Format Tensor Completion by Riemannian Optimization
• Quantum Tomography From Few Full-Rank Observables
• Small random initialization is akin to spectral learning: Optimization and generalization guarantees for overparameterized low-rank matrix reconstruction
• A comparison principle for functions of a uniformly random subspace
• Bounds on tail probabilities for quadratic forms in dependent sub-gaussian random variables
• Modulus of continuity of some conditionally sub-Gaussian fields, application to stable random fields
• Fast and robust quantum state tomography from few basis measurements
• Quantum state tomography with tensor train cross approximation
• A Validation Approach to Over-parameterized Matrix and Image Recovery
• Guaranteed Nonconvex Factorization Approach for Tensor Train Recovery

Cited by in corpus (4)

• Conditional Independence of 1D Gibbs States with Applications to Efficient Learning
• Learning mixed quantum states in large-scale experiments
• Tensor Train Quantum State Tomography using Compressed Sensing
• Rigorous Maximum Likelihood Estimation for Quantum States