Efficient State Preparation for Quantum Amplitude Estimation
- URL: http://arxiv.org/abs/2005.07711v1
- Date: Fri, 15 May 2020 18:00:01 GMT
- Title: Efficient State Preparation for Quantum Amplitude Estimation
- Authors: Almudena Carrera Vazquez, Stefan Woerner
- Abstract summary: Quantum Amplitude Estimation can achieve a quadratic speed-up for applications classically solved by Monte Carlo simulation.
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.
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.
- Score: 0.951828574518325
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- 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.
Related papers
- Mixed-Dimensional Qudit State Preparation Using Edge-Weighted Decision Diagrams [3.393749500700096]
Quantum computers have the potential to solve intractable problems.
One key element to exploiting this potential is the capability to efficiently prepare quantum states for multi-valued, or qudit, systems.
In this paper, we investigate quantum state preparation with a focus on mixed-dimensional systems.
arXiv Detail & Related papers (2024-06-05T18:00:01Z) - Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
We present a model for parallelizing simulation of quantum circuit executions.
The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
arXiv Detail & Related papers (2024-06-05T17:16:07Z) - Sparse Quantum State Preparation for Strongly Correlated Systems [0.0]
In principle, the encoding of the exponentially scaling many-electron wave function onto a linearly scaling qubit register offers a promising solution to overcome the limitations of traditional quantum chemistry methods.
An essential requirement for ground state quantum algorithms to be practical is the initialisation of the qubits to a high-quality approximation of the sought-after ground state.
Quantum State Preparation (QSP) allows the preparation of approximate eigenstates obtained from classical calculations, but it is frequently treated as an oracle in quantum information.
arXiv Detail & Related papers (2023-11-06T18:53:50Z) - Quantum Thermal State Preparation [39.91303506884272]
We introduce simple continuous-time quantum Gibbs samplers for simulating quantum master equations.
We construct the first provably accurate and efficient algorithm for preparing certain purified Gibbs states.
Our algorithms' costs have a provable dependence on temperature, accuracy, and the mixing time.
arXiv Detail & Related papers (2023-03-31T17:29:56Z) - GASP -- A Genetic Algorithm for State Preparation [0.0]
We present a genetic algorithm for state preparation (GASP) which generates relatively low-depth quantum circuits for initialising a quantum computer in a specified quantum state.
GASP can produce more efficient circuits of a given accuracy with lower depth and gate counts than other methods.
arXiv Detail & Related papers (2023-02-22T04:41:01Z) - Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the
Race to Practical Quantum Advantage [43.3054117987806]
We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits.
We show this method significantly improves the trainability and performance of PQCs on a variety of problems.
By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
arXiv Detail & Related papers (2022-08-29T15:24:03Z) - Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees.
Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation.
We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
arXiv Detail & Related papers (2022-03-30T02:02:16Z) - Low-rank quantum state preparation [1.5427245397603195]
We propose an algorithm to reduce state preparation circuit depth by offloading computational complexity to a classical computer.
We show that the approximation is better on today's quantum processors.
arXiv Detail & Related papers (2021-11-04T19:56:21Z) - On exploring practical potentials of quantum auto-encoder with
advantages [92.19792304214303]
Quantum auto-encoder (QAE) is a powerful tool to relieve the curse of dimensionality encountered in quantum physics.
We prove that QAE can be used to efficiently calculate the eigenvalues and prepare the corresponding eigenvectors of a high-dimensional quantum state.
We devise three effective QAE-based learning protocols to solve the low-rank state fidelity estimation, the quantum Gibbs state preparation, and the quantum metrology tasks.
arXiv Detail & Related papers (2021-06-29T14:01:40Z) - Error mitigation and quantum-assisted simulation in the error corrected
regime [77.34726150561087]
A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations.
We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
arXiv Detail & Related papers (2021-03-12T20:58:41Z) - As Accurate as Needed, as Efficient as Possible: Approximations in
DD-based Quantum Circuit Simulation [5.119310422637946]
Decision Diagrams (DDs) have previously shown to reduce the required memory in many important cases by exploiting redundancies in the quantum state.
We show that this reduction can be amplified by exploiting the probabilistic nature of quantum computers to achieve even more compact representations.
Specifically, we propose two new DD-based simulation strategies that approximate the quantum states to attain more compact representations.
arXiv Detail & Related papers (2020-12-10T12:02:03Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.