The Efficient Preparation of Normal Distributions in Quantum Registers

Abstract

The efficient preparation of input distributions is an important problem in obtaining quantum advantage in a wide range of domains. We propose a novel quantum algorithm for the efficient preparation of arbitrary normal distributions in quantum registers. To the best of our knowledge, our work is the first to leverage the power of Mid-Circuit Measurement and Reuse (MCMR), in a way that is broadly applicable to a range of state-preparation problems. Specifically, our algorithm employs a repeat-until-success scheme, and only requires a constant-bounded number of repetitions in expectation. In the experiments presented, the use of MCMR enables up to a 862.6x reduction in required qubits. Furthermore, the algorithm is provably resistant to both phase-flip and bit-flip errors, leading to a first-of-its-kind empirical demonstration on real quantum hardware, the MCMR-enabled Honeywell System Models H0 and H1-2.

Accepted in Quantum on 2021-12-14. Minor fixes

References in corpus (8)

• Quantum algorithm for solving linear systems of equations
• Quantum-state preparation with universal gate decompositions
• Creating superpositions that correspond to efficiently integrable probability distributions
• Efficient synthesis of universal Repeat-Until-Success circuits
• Quantum Neuron: an elementary building block for machine learning on quantum computers
• Wavefunction preparation and resampling using a quantum computer
• Optimal computation with non-unitary quantum walks
• Efficient Quantum Circuits for Accurate State Preparation of Smooth, Differentiable Functions

Cited by in corpus (20)

• Quantum computing for finance
• Mid-circuit measurements on a single species neutral alkali atom quantum processor
• Grid-based methods for chemistry simulations on a quantum computer
• Quantum Machine Learning for Finance
• Quantum State Preparation of Normal Distributions using Matrix Product States
• Linear-depth quantum circuits for loading Fourier approximations of arbitrary functions
• Simulating fluid flows with quantum computing
• Activation of metrologically useful genuine multipartite entanglement
• On Quantum Speedups for Nonconvex Optimization via Quantum Tunneling Walks
• Quantum state preparation for multivariate functions
• Efficient quantum interpolation of natural data
• Quantum data encoding as a distinct abstraction layer in the design of quantum circuits
• Energy risk analysis with Dynamic Amplitude Estimation and Piecewise Approximate Quantum Compiling
• The State Preparation of Multivariate Normal Distributions using Tree Tensor Network
• Optimized synthesis of circuits for diagonal unitary matrices with reflection symmetry
• QKAN: quantum Kolmogorov-Arnold networks with applications in machine learning and multivariate state preparation
• Efficient Gaussian State Preparation in Quantum Circuits
• Efficient quantum algorithm for weighted partial sums and numerical integration
• Dividing quantum circuits for time evolution of stochastic processes by orthogonal series density estimation
• Accelerating Quantum State Encoding with SIMD: Design, Implementation, and Benchmarking