Efficient State Preparation for Quantum Amplitude Estimation

Abstract

Quantum Amplitude Estimation (QAE) can achieve a quadratic speed-up for applications classically solved by Monte Carlo simulation. A key requirement to realize this advantage is efficient state preparation. If state preparation is too expensive, it can diminish the quantum advantage. Preparing arbitrary quantum states has exponential complexity with respect to the number of qubits, thus, is not applicable. Currently known efficient techniques require problems based on log-concave probability distributions, involve learning an unknown distribution from empirical data, or fully rely on quantum arithmetic. In this paper, we introduce an approach to simplify state preparation, together with a circuit optimization technique, both of which can help reduce the circuit complexity for QAE state preparation significantly. We demonstrate the introduced techniques for a numerical integration example on real quantum hardware, as well as for option pricing under the Heston model, i.e., based on a stochastic volatility process, using simulation.

arXiv comment12 pages, 12 figures

References in corpus (14)

• Quantum Amplitude Amplification and Estimation
• Error mitigation for short-depth quantum circuits
• Extending the computational reach of a noisy superconducting quantum processor
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Synthesis of Quantum Logic Circuits
• Quantum Generative Adversarial Networks for Learning and Loading Random Distributions
• Cloud Quantum Computing of an Atomic Nucleus
• Quantum-state preparation with universal gate decompositions
• Quantum speedup of Monte Carlo methods
• Quantum Risk Analysis
• Quantum computational finance: Monte Carlo pricing of financial derivatives
• Amplitude estimation without phase estimation
• Option Pricing using Quantum Computers
• Characterization of a two-transmon processor with individual single-shot qubit readout

Cited by in corpus (22)

• Warm-starting quantum optimization
• A Threshold for Quantum Advantage in Derivative Pricing
• Enhancing the Quantum Linear Systems Algorithm using Richardson Extrapolation
• Grid-based methods for chemistry simulations on a quantum computer
• Hybrid quantum algorithms for flow problems
• The Efficient Preparation of Normal Distributions in Quantum Registers
• Quantum State Preparation of Normal Distributions using Matrix Product States
• A variational quantum algorithm for the Feynman-Kac formula
• Well-conditioned multi-product formulas for hardware-friendly Hamiltonian simulation
• The Problem with Grover-Rudolph State Preparation for Quantum Monte-Carlo
• Sampling, rates, and reaction currents through reverse stochastic quantization on quantum computers
• Efficient Hamiltonian Simulation for Solving Option Price Dynamics
• Quantum Monte Carlo simulations for financial risk analytics: scenario generation for equity, rate, and credit risk factors
• Quantum algorithms for the generalized eigenvalue problem
• Quantum Encoding and Analysis on Continuous Time Stochastic Process with Financial Applications
• Simple Hamiltonian dynamics is a powerful quantum processing resource
• The State Preparation of Multivariate Normal Distributions using Tree Tensor Network
• Quantum-Enhanced Simulation-Based Optimization for Newsvendor Problems
• An Amplitude-Based Implementation of the Unit Step Function on a Quantum Computer
• The simulation of distributed quantum algorithms
• Efficient Sparse State Preparation via Quantum Walks
• Quantum Encoding of Structured Data with Matrix Product States