Quantum State Preparation of Normal Distributions using Matrix Product States
arXiv:2303.01562 · doi:10.1038/s41534-024-00805-0
Abstract
State preparation is a necessary component of many quantum algorithms. In this work, we combine a method for efficiently representing smooth differentiable probability distributions using matrix product states with recently discovered techniques for initializing quantum states to approximate matrix product states. Using this, we generate quantum states encoding a class of normal probability distributions in a trapped ion quantum computer for up to 20 qubits. We provide an in depth analysis of the different sources of error which contribute to the overall fidelity of this state preparation procedure. Our work provides a study in quantum hardware for scalable distribution loading, which is the basis of a wide range of algorithms that provide quantum advantage.
arXiv comment29 pages, 9 figures
References in corpus (19)
- The density-matrix renormalization group in the age of matrix product states
- Quantum algorithm for solving linear systems of equations
- Entanglement in quantum critical phenomena
- Efficient classical simulation of slightly entangled quantum computations
- Quantum Circuit Learning
- Hamiltonian Simulation by Qubitization
- Toward the first quantum simulation with quantum speedup
- Quantum Generative Adversarial Networks for Learning and Loading Random Distributions
- Optimal Quantum Circuits for General Two-Qubit Gates
- Real- and imaginary-time evolution with compressed quantum circuits
- Quantum State Preparation with Optimal Circuit Depth: Implementations and Applications
- Encoding of Matrix Product States into Quantum Circuits of One- and Two-Qubit Gates
- Black-box quantum state preparation without arithmetic
- Quantum-inspired algorithms for multivariate analysis: from interpolation to partial differential equations
- Efficient State Preparation for Quantum Amplitude Estimation
- Generative Quantum Learning of Joint Probability Distribution Functions
- The Efficient Preparation of Normal Distributions in Quantum Registers
- Fast Black-Box Quantum State Preparation
- The Problem with Grover-Rudolph State Preparation for Quantum Monte-Carlo
Cited by in corpus (14)
- Efficient quantum amplitude encoding of polynomial functions
- Simulating fluid flows with quantum computing
- Quantum Financial Modeling on Noisy Intermediate-Scale Quantum Hardware: Random Walks using Approximate Quantum Counting
- Quantum state preparation for multivariate functions
- Energy risk analysis with Dynamic Amplitude Estimation and Piecewise Approximate Quantum Compiling
- Quantum Algorithm for Vibronic Dynamics: Case Study on Singlet Fission Solar Cell Design
- The State Preparation of Multivariate Normal Distributions using Tree Tensor Network
- Efficient Gaussian State Preparation in Quantum Circuits
- Quantum state preparation via piecewise QSVT
- Quantum State Preparation for Probability Distributions with Reflection Symmetry Using Matrix Product States
- Adaptive Circuit Learning of Born Machine: Towards Realization of Amplitude Embedding and Quantum Data Loading
- Comment on arXiv:2307.08384 "Efficient Quantum State Preparation with Walsh Series"
- Quantum Encoding of Structured Data with Matrix Product States
- Trainable Quantum Neural Network for Multiclass Image Classification with the Power of Pre-trained Tree Tensor Networks