Real Quantum Amplitude Estimation
- URL: http://arxiv.org/abs/2204.13641v2
- Date: Tue, 24 May 2022 19:17:40 GMT
- Title: Real Quantum Amplitude Estimation
- Authors: Alberto Manzano, Daniele Musso, \'Alvaro Leitao
- Abstract summary: We introduce the Real Quantum Amplitude Estimation (RQAE) algorithm, an extension of Quantum Amplitude Estimation (QAE)
RQAE is an iterative algorithm which offers explicit control over the amplification policy through an adjustable parameter.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We introduce the Real Quantum Amplitude Estimation (RQAE) algorithm, an
extension of Quantum Amplitude Estimation (QAE) which is sensitive to the sign
of the amplitude. RQAE is an iterative algorithm which offers explicit control
over the amplification policy through an adjustable parameter. We provide a
rigorous analysis of the RQAE performance and prove that it achieves a
quadratic speedup, modulo logarithmic corrections, with respect to unamplified
sampling. Besides, we corroborate the theoretical analysis with a set of
numerical experiments.
Related papers
- Application of Langevin Dynamics to Advance the Quantum Natural Gradient Optimization Algorithm [47.47843839099175]
A Quantum Natural Gradient (QNG) algorithm for optimization of variational quantum circuits has been proposed recently.
In this study, we employ the Langevin equation with a QNG force to demonstrate that its discrete-time solution gives a generalized form, which we call Momentum-QNG.
arXiv Detail & Related papers (2024-09-03T15:21:16Z) - Adaptive variational quantum dynamics simulations with compressed circuits and fewer measurements [4.2643127089535104]
We show an improved version of the adaptive variational quantum dynamics simulation (AVQDS) method, which we call AVQDS(T)
The algorithm adaptively adds layers of disjoint unitary gates to the ansatz circuit so as to keep the McLachlan distance, a measure of the accuracy of the variational dynamics, below a fixed threshold.
We also show a method based on eigenvalue truncation to solve the linear equations of motion for the variational parameters with enhanced noise resilience.
arXiv Detail & Related papers (2024-08-13T02:56:43Z) - Amplitude Amplification and Estimation using a Floquet system [0.0]
The quantum kicked rotor (QKR) is a fundamental model of time-dependent quantum chaos.
It is used to implement a quantum algorithm to perform unstructured search.
arXiv Detail & Related papers (2024-06-19T04:44:12Z) - Constant Stepsize Q-learning: Distributional Convergence, Bias and
Extrapolation [27.17913040244775]
We study asynchronous Q-learning with constant stepsize, which is commonly used in practice for its fast convergence.
By connecting the constant stepsize Q-learning to a time-homogeneous chain, we show the distributional convergence of the iterates in distance.
We also establish a Central Limit Theory for Q-learning iterates, demonstrating the normality of the averaged iterates.
Specifically, the bias is proportional to the stepsize up to higher-order terms and we provide an explicit expression for the linear coefficient.
arXiv Detail & Related papers (2024-01-25T02:01:53Z) - 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) - A Variational Quantum Attack for AES-like Symmetric Cryptography [69.80357450216633]
We propose a variational quantum attack algorithm (VQAA) for classical AES-like symmetric cryptography.
In the VQAA, the known ciphertext is encoded as the ground state of a Hamiltonian that is constructed through a regular graph.
arXiv Detail & Related papers (2022-05-07T03:15:15Z) - 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) - Variational quantum amplitude estimation [0.0]
In the context of Monte Carlo (MC) integration, we numerically show that shallow circuits can accurately approximate many amplitude amplification steps.
We combine the variational approach with maximum likelihood amplitude estimation.
To reduce the variational cost, we propose adaptive VQAE and numerically show in 6 to 12 qubit simulations that it can outperform classical MC sampling.
arXiv Detail & Related papers (2021-09-08T14:47:17Z) - Quantum Amplitude Amplification Operators [3.8073142980733]
We show the characterization of quantum iterations that would generally construct quantum amplitude amplification algorithms with a quadratic speedup.
We show that an optimal and exact quantum amplitude amplification algorithm corresponds to the Grover algorithm together with a single iteration of QAAO.
We then realize 3-qubit QAAOs with the current quantum technologies via cloud-based quantum computing services, IBMQ and IonQ.
arXiv Detail & Related papers (2021-05-20T07:26:23Z) - Momentum Q-learning with Finite-Sample Convergence Guarantee [49.38471009162477]
This paper analyzes a class of momentum-based Q-learning algorithms with finite-sample guarantee.
We establish the convergence guarantee for MomentumQ with linear function approximations and Markovian sampling.
We demonstrate through various experiments that the proposed MomentumQ outperforms other momentum-based Q-learning algorithms.
arXiv Detail & Related papers (2020-07-30T12:27: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.