Maximum expectation of observables with restricted purity states

Abstract

Assessment of practical quantum information processing (QIP) remains partial without understanding limits imposed by noise. Unfortunately, mere description of noise grows exponentially with system size, becoming cumbersome even for modest sized systems of imminent practical interest. We fulfill the need for estimates on performing noisy quantum state preparation, verification, and observation. To do the estimation we propose fast numerical algorithms to maximize the expectation value of any $d$-dimensional observable over states of bounded purity. This bound on purity factors in noise in a measurable way. Our fastest algorithm takes $O(d)$ steps if the eigendecomposition of the observable is known, otherwise takes $O(d^3)$ steps at worst. The algorithms also solve maximum likelihood estimation for quantum state tomography with convex and even non-convex purity constraints. Numerics show performance of our key sub-routine (it finds in linear time a probability vector with bounded norm that most overlaps with a fixed vector) can be several orders of magnitude faster than a common state-of-the-art convex optimization solver. Our work fosters a practical way forward to asses limitations on QIP imposed by quantum noise. Along the way, we also give a simple but fundamental insight, noisy systems (equivalently noisy Hamiltonians) always give higher ground-state energy than their noiseless counterparts.

arXiv comment28 pages, 7 figures, comments are welcome

References in corpus (19)

• SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
• Quantum Computing in the NISQ era and beyond
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum Simulation
• Quantum computational chemistry
• Continuous-variable optical quantum state tomography
• Measurement-based quantum computation
• Quantum Process Tomography: Resource Analysis of Different Strategies
• Maximum Likelihood, Minimum Effort
• Quantum channels and their entropic characteristics
• Fast linear algebra is stable
• Quantum Entanglement and Communication Complexity
• Knowledge and ignorance in incomplete quantum state tomography
• Hedged maximum likelihood estimation
• Characterizing non-Markovian Off-Resonant Errors in Quantum Gates
• Entanglement sharing through noisy qubit channels: One-shot optimal singlet fraction
• Maximum a posteriori estimation of quantum states
• Entanglement sharing via qudit channels: Nonmaximally entangled states may be necessary for one-shot optimal singlet fraction and negativity
• Optimal one-shot entanglement sharing