Probabilistic state synthesis based on optimal convex approximation
arXiv:2303.10860 · doi:10.1038/s41534-023-00793-7
Abstract
When preparing a pure state with a quantum circuit, there is an unavoidable approximation error due to the compilation error in fault-tolerant implementation. A recently proposed approach called probabilistic state synthesis, where the circuit is probabilistically sampled, is able to reduce the approximation error compared to conventional deterministic synthesis. In this paper, we demonstrate that the optimal probabilistic synthesis quadratically reduces the approximation error. Moreover, we show that a deterministic synthesis algorithm can be efficiently converted into a probabilistic one that achieves this quadratic error reduction. We also numerically demonstrate how this conversion reduces the -count and analytically prove that this conversion halves an information-theoretic lower bound on the circuit size. In order to derive these results, we prove general theorems about the optimal convex approximation of a quantum state. Furthermore, we demonstrate that this theorem can be used to analyze an entanglement measure.
arXiv comment24 pages, 5 figures. ArXiv:2111.05531 is a preliminary version of this paper
References in corpus (44)
- Fault-tolerant quantum computation by anyons
- Separability of Mixed States: Necessary and Sufficient Conditions
- Quantum algorithm for solving linear systems of equations
- Quantifying Coherence
- Quantum Error Correction for Quantum Memories
- Quantum Resource Theories
- Quantum Nonlocality without Entanglement
- Measurement-based quantum computation
- Hamiltonian Simulation by Qubitization
- Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
- Noise tailoring for scalable quantum computation via randomized compiling
- Universal blind quantum computation
- Graph States for Quantum Secret Sharing
- Aspects of generic entanglement
- Quantum Data Hiding
- The general structure of quantum resource theories
- Quantum-state preparation with universal gate decompositions
- (Quantumness in the context of) Resource Theories
- Quantifying Entanglement with Witness Operators
- Quantum Circuits for Isometries
- One-and-a-half quantum de Finetti theorems
- Faithful Squashed Entanglement
- Quantum Hypergraph States
- Quantum State Preparation with Optimal Circuit Depth: Implementations and Applications
- Distinguishability of quantum states under restricted families of measurements with an application to quantum data hiding
- Models of quantum complexity growth
- Circuit Complexity across a Topological Phase Transition
- Shorter gate sequences for quantum computing by mixing unitaries
- Separability of diagonal symmetric states: a quadratic conic optimization problem
- Imaginarity-free quantum multiparameter estimation
- Distillability and PPT entanglement of low-rank quantum states
- Quantum State Complexity in Computationally Tractable Quantum Circuits
- Randomized compiling for scalable quantum computing on a noisy superconducting quantum processor
- Quantifying the coherence of pure quantum states
- Shorter quantum circuits via single-qubit gate approximation
- A quasipolynomial-time algorithm for the quantum separability problem
- Improved algorithm for quantum separability and entanglement detection
- Building separable approximations for quantum states via neural networks
- Numerical analysis of quantum circuits for state preparation and unitary operator synthesis
- Limitations of semidefinite programs for separable states and entangled games
- Optimal convex approximations of quantum states
- Exploring the optimality of approximate state preparation quantum circuits with a genetic algorithm
- Optimal approximations of available states and a triple uncertainty relation
- The optimal approximation of qubit states with limited quantum states