Error Resilient Quantum Amplitude Estimation from Parallel Quantum Phase
Estimation
- URL: http://arxiv.org/abs/2204.01337v2
- Date: Fri, 16 Dec 2022 06:21:50 GMT
- Title: Error Resilient Quantum Amplitude Estimation from Parallel Quantum Phase
Estimation
- Authors: M. C. Braun, T. Decker, N. Hegemann, S. F. Kerstan
- Abstract summary: We show how phase and amplitude estimation algorithms can be parallelized.
This can reduce the gate depth of the quantum circuits to that of a single Grover operator with a small overhead.
For quantum amplitude estimation, the parallelization can lead to vast improvements in resilience against quantum errors.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We show how phase and amplitude estimation algorithms can be parallelized.
This can reduce the gate depth of the quantum circuits to that of a single
Grover operator with a small overhead. Further, we show that for quantum
amplitude estimation, the parallelization can lead to vast improvements in
resilience against quantum errors. The resilience is not caused by the lower
gate depth, but by the structure of the algorithm. Even in cases with errors
that make it impossible to read out the exact or approximate solutions from
conventional amplitude estimation, our parallel approach provided the correct
solution with high probability. The results on error resilience hold for the
standard version and for low depth versions of quantum amplitude estimation.
Methods presented are subject of a patent application [Quantum computing
device: Patent application EP 21207022.1].
Related papers
- Adaptive measurement strategy for noisy quantum amplitude estimation with variational quantum circuits [0.3148661669593152]
This paper studies the amplitude estimation in the presence of depolarizing noise with unknown intensity.
We numerically show that the proposed method can nearly attain the quantum Cram'er-Rao bound (QCRB)
arXiv Detail & Related papers (2024-05-24T03:15:56Z) - Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application.
We analyse the generation of random states in PQCs under restrictions on the qubits connectivities.
We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
arXiv Detail & Related papers (2024-05-03T17:32:55Z) - Energy risk analysis with Dynamic Amplitude Estimation and Piecewise
Approximate Quantum Compiling [0.0]
We generalize the Approximate Quantum Compiling algorithm into a new method for CNOT-depth reduction.
We present a 10-qubit experimental demonstration of Iterative Amplitude Estimation on a quantum computer.
The target application is the derivation of the Expected Value of contract portfolios in the energy industry.
arXiv Detail & Related papers (2023-05-16T14:53:08Z) - Error Mitigation-Aided Optimization of Parameterized Quantum Circuits:
Convergence Analysis [42.275148861039895]
Variational quantum algorithms (VQAs) offer the most promising path to obtaining quantum advantages via noisy processors.
gate noise due to imperfections and decoherence affects the gradient estimates by introducing a bias.
Quantum error mitigation (QEM) techniques can reduce the estimation bias without requiring any increase in the number of qubits.
QEM can reduce the number of required iterations, but only as long as the quantum noise level is sufficiently small.
arXiv Detail & Related papers (2022-09-23T10:48:04Z) - Universal cost bound of quantum error mitigation based on quantum
estimation theory [0.0]
We present a unified approach to analyzing the cost of various quantum error mitigation methods on the basis of quantum estimation theory.
We derive for a generic layered quantum circuit under a wide class of Markovian noise that, unbiased estimation of an observable encounters an exponential growth with the circuit depth in the lower bound on the measurement cost.
Our results contribute to the understanding of the physical limitations of quantum error mitigation and offer a new criterion for evaluating the performance of quantum error mitigation techniques.
arXiv Detail & Related papers (2022-08-19T15:04:36Z) - 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) - Reducing the cost of energy estimation in the variational quantum
eigensolver algorithm with robust amplitude estimation [50.591267188664666]
Quantum chemistry and materials is one of the most promising applications of quantum computing.
Much work is still to be done in matching industry-relevant problems in these areas with quantum algorithms that can solve them.
arXiv Detail & Related papers (2022-03-14T16:51:36Z) - Numerical Simulations of Noisy Quantum Circuits for Computational
Chemistry [51.827942608832025]
Near-term quantum computers can calculate the ground-state properties of small molecules.
We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
arXiv Detail & Related papers (2021-12-31T16:33:10Z) - Quantum amplitude damping for solving homogeneous linear differential
equations: A noninterferometric algorithm [0.0]
This work proposes a novel approach by using the Quantum Amplitude Damping operation as a resource, in order to construct an efficient quantum algorithm for solving homogeneous LDEs.
We show that such an open quantum system-inspired circuitry allows for constructing the real exponential terms in the solution in a non-interferometric.
arXiv Detail & Related papers (2021-11-10T11:25:32Z) - Amplitude estimation via maximum likelihood on noisy quantum computer [3.5462326830737805]
We give an experimental demonstration on a superconducting IBM Quantum device.
We show that the proposed maximum likelihood estimator achieves quantum speedup in the number of queries.
arXiv Detail & Related papers (2020-06-29T17:44:04Z) - Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling.
We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
arXiv Detail & Related papers (2020-05-05T20:11:53Z)
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.