Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userAmplitude estimation without phase estimation
480
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
This paper focuses on the quantum amplitude estimation algorithm, which is a core subroutine in quantum computation for various applications. The conventional approach for amplitude estimation is to use the phase estimation algorithm, which consists of many controlled amplification operations followed by a quantum Fourier transform. However, the whole procedure is hard to implement with current and near-term quantum computers. In this paper, we propose a quantum amplitude estimation algorithm without the use of expensive controlled operations; the key idea is to utilize the maximum likelihood estimation based on the combined measurement data produced from quantum circuits with different numbers of amplitude amplification operations. Numerical simulations we conducted demonstrate that our algorithm asymptotically achieves nearly the optimal quantum speedup with a reasonable circuit length.
rate research
Read More
We study the generation of planar quantum squeezed (PQS) states by quantum non-demolition (QND) measurement of a cold ensemble of $^{87}$Rb atoms. Precise calibration of the QND measurement allows us to infer the conditional covariance matrix describing the $F_y$ and $F_z$ components of the PQS, revealing the dual squeezing characteristic of PQS. PQS states have been proposed for single-shot phase estimation without prior knowledge of the likely values of the phase. We show that for an arbitrary phase, the generated PQS gives a metrological advantage of at least 3.1 dB relative to classical states. The PQS also beats traditional squeezed states generated with the same QND resources, except for a narrow range of phase values. Using spin squeezing inequalities, we show that spin-spin entanglement is responsible for the metrological advantage.
We derive, and experimentally demonstrate, an interferometric scheme for unambiguous phase estimation with precision scaling at the Heisenberg limit that does not require adaptive measurements. That is, with no prior knowledge of the phase, we can obtain an estimate of the phase with a standard deviation that is only a small constant factor larger than the minimum physically allowed value. Our scheme resolves the phase ambiguity that exists when multiple passes through a phase shift, or NOON states, are used to obtain improved phase resolution. Like a recently introduced adaptive technique [Higgins et al 2007 Nature 450 393], our experiment uses multiple applications of the phase shift on single photons. By not requiring adaptive measurements, but rather using a predetermined measurement sequence, the present scheme is both conceptually simpler and significantly easier to implement. Additionally, we demonstrate a simplified adaptive scheme that also surpasses the standard quantum limit for single passes.
We consider performing phase estimation under the following conditions: we are given only one copy of the input state, the input state does not have to be an eigenstate of the unitary, and the state must not be measured. Most quantum estimation algorithms make assumptions that make them unsuitable for this coherent setting, leaving only the textbook approach. We present novel algorithms for phase, energy, and amplitude estimation that are both conceptually and computationally simpler than the textbook method, featuring both a smaller query complexity and ancilla footprint. They do not require a quantum Fourier transform, and they do not require a quantum sorting network to compute the median of several estimates. Instead, they use block-encoding techniques to compute the estimate one bit at a time, performing all amplification via singular value transformation. These improved subroutines accelerate the performance of quantum Metropolis sampling and quantum Bayesian inference.
In this paper we derive from simple and reasonable assumptions a Gaussian noise model for NISQ Quantum Amplitude Estimation (QAE). We provide results from QAE run on various IBM superconducting quantum computers and Honeywells H1 trapped-ion quantum computer to show that the proposed model is a good fit for real-world experimental data. We then give an example of how to embed this noise model into any NISQ QAE algorithm, such that the amplitude estimation is noise-aware.
We develop a quantum filter diagonalization method (QFD) that lies somewhere between the variational quantum eigensolver (VQE) and the phase estimation algorithm (PEA) in terms of required quantum circuit resources and conceptual simplicity. QFD uses a set of of time-propagated guess states as a variational basis for approximate diagonalization of a sparse Pauli Hamiltonian. The variational coefficients of the basis functions are determined by the Rayleigh-Ritz procedure by classically solving a generalized eigenvalue problem in the space of time-propagated guess states. The matrix elements of the subspace Hamiltonian and subspace metric matrix are each determined in quantum circuits by a one-ancilla extended swap test, i.e., statistical convergence of a one-ancilla PEA circuit. These matrix elements can be determined by many parallel quantum circuit evaluations, and the final Ritz estimates for the eigenvectors can conceptually be prepared as a linear combination over separate quantum state preparation circuits. The QFD method naturally provides for the computation of ground-state, excited-state, and transition expectation values. We numerically demonstrate the potential of the method by classical simulations of the QFD algorithm for an N=8 octamer of BChl-a chromophores represented by an 8-qubit ab initio exciton model (AIEM) Hamiltonian. Using only a handful of time-displacement points and a coarse, variational Trotter expansion of the time propagation operators, the QFD method recovers an accurate prediction of the absorption spectrum.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
