Estimating outcome probabilities of quantum circuits using quasiprobabilities

2015/03/31 by Hakop Pashayan, Joel J. Wallman, Stephen D. Bartlett · 3 citations
Physics and Astronomy · #quant-ph

paper · pdf · doi:10.1103/physrevlett.115.070501

published as Phys. Rev. Lett. 115, 070501 (2015) · 5 pages + 1 page appendix, 1 figure, comments welcome; v2 published version

arxiv created 2015/08/10 · arxiv updated 2015/08/12

Abstract

We present a method for estimating the probabilities of outcomes of a quantum circuit using Monte Carlo sampling techniques applied to a quasiprobability representation. Our estimate converges to the true quantum probability at a rate determined by the total negativity in the circuit, using a measure of negativity based on the 1-norm of the quasiprobability. If the negativity grows at most polynomially in the size of the circuit, our estimator converges efficiently. These results highlight the role of negativity as a measure of non-classical resources in quantum computation.

Cited by

• Quantum magic of strongly correlated fermions - the Hubbard dimer
• A trace distance-based geometric analysis of the stabilizer polytope for few-qubit systems
• Scalable Circuit Cutting: A Framework for Combined Gate and Wire Cuts Using Gate Groups
• No-Go Theorems for Universal Quantum State Purification via Classically Simulable Operations

Related

• A Survey of Quantum Alternatives to Randomized Algorithms: Monte Carlo Integration and Beyond
• Visualizing Quantum Circuit Probability -- estimating computational action for quantum program synthesis
• Mean estimation when you have the source code; or, quantum Monte Carlo methods
• Rare Event Simulation of Quantum Error-Correcting Circuits
• Negative Quasi-Probability as a Resource for Quantum Computation