Low-rank quantum state preparation
arXiv:2111.03132 · doi:10.1109/TCAD.2023.3297972
Abstract
Ubiquitous in quantum computing is the step to encode data into a quantum state. This process is called quantum state preparation, and its complexity for non-structured data is exponential on the number of qubits. Several works address this problem, for instance, by using variational methods that train a fixed depth circuit with manageable complexity. These methods have their limitations, as the lack of a back-propagation technique and barren plateaus. This work proposes an algorithm to reduce state preparation circuit depth by offloading computational complexity to a classical computer. The initialized quantum state can be exact or an approximation, and we show that the approximation is better on today's quantum processors than the initialization of the original state. Experimental evaluation demonstrates that the proposed method enables more efficient initialization of probability distributions in a quantum state.
References in corpus (30)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Quantum Machine Learning
- Quantum algorithm for solving linear systems of equations
- Good Quantum Error-Correcting Codes Exist
- Adiabatic Quantum Computing
- Quantum principal component analysis
- How to share a quantum secret
- Multiple Particle Interference and Quantum Error Correction
- Geometric measure of entanglement and applications to bipartite and multipartite quantum states
- Synthesis of Quantum Logic Circuits
- Quantum Generative Adversarial Networks for Learning and Loading Random Distributions
- Quantum-state preparation with universal gate decompositions
- Quantum speedup of Monte Carlo methods
- Quantum computational finance: Monte Carlo pricing of financial derivatives
- Monotones and invariants for multi-particle quantum states
- The Bitter Truth About Quantum Algorithms in the NISQ Era
- Quantum Circuits for Isometries
- Experimental multiparticle entanglement dynamics induced by decoherence
- A divide-and-conquer algorithm for quantum state preparation
- Quantum circuits with uniformly controlled one-qubit gates
- Circuit-Based Quantum Random Access Memory for Classical Data
- Approximate amplitude encoding in shallow parameterized quantum circuits and its application to financial market indicator
- Adiabatic state preparation study of methylene
- Algorithmic complexity and entanglement of quantum states
- Quantum Circuits for Sparse Isometries
- Configurable sublinear circuits for quantum state preparation
- Double sparse quantum state preparation
- Efficient Deterministic Preparation of Quantum States Using Decision Diagrams
- An open-source modular framework for quantum computing
- Accurate calculation of the geometric measure of entanglement for multipartite quantum states
Cited by in corpus (14)
- Sparse Quantum State Preparation for Strongly Correlated Systems
- A Quantum Simulation Approach to Implementing Nuclear Density Functional Theory via Imaginary Time Evolution
- Efficient Quantum Circuits based on the Quantum Natural Gradient
- Quantum Multiplexer Simplification for State Preparation
- Efficient explicit circuit for quantum state preparation of piecewise continuous functions
- Parallel Quantum Signal Processing Via Polynomial Factorization
- Stabilization of symmetry-protected long-range entanglement in stochastic quantum circuits
- Sublinear Classical-to-Quantum Data Encoding using -Toffoli Gates
- DisQu: Investigating the Impact of Disorder in Quantum Generative Models
- Solving coupled Non-linear Schrödinger Equations via Quantum Imaginary Time Evolution
- T-Count Optimizing Genetic Algorithm for Quantum State Preparation
- Quantum Framework for Simulating Linear PDEs with Robin Boundary Conditions
- Tucker iterative quantum state preparation
- Schmidt quantum compressor