Some Error Analysis for the Quantum Phase Estimation Algorithms
- URL: http://arxiv.org/abs/2111.10430v3
- Date: Tue, 5 Jul 2022 13:16:33 GMT
- Title: Some Error Analysis for the Quantum Phase Estimation Algorithms
- Authors: Xiantao Li
- Abstract summary: We characterize the probability of computing the phase values in terms of the consistency error.
In the first two cases, we show that in order to obtain the phase value with error less or equal to $2-n$ and probability at least $1-epsilon$, the required number of qubits is $ t geq n + log big.
For the third case, we found a similar estimate, but the number of random steps has to be sufficiently large.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: This paper is concerned with the phase estimation algorithm in quantum
computing algorithms, especially the scenarios where (1) the input vector is
not an eigenvector; (2) the unitary operator is not exactly implemented; (3)
random approximations are used for the unitary operator, e.g., the QDRIFT
method. We characterize the probability of computing the phase values in terms
of the consistency error, including the residual error, Trotter splitting
error, or statistical mean-square error. In the first two cases, we show that
in order to obtain the phase value with {error less or equal to $2^{-n}$ } and
probability at least $1-\epsilon$, the required number of qubits is $ t \geq n
+ \log \big(2 + \frac{\delta^2 }{2 \epsilon \Delta\!E^2 } \big).$ The parameter
$\delta$ quantifies the error associated with the inexact eigenvector and/or
the unitary operator, and $\Delta\! E$ characterizes the spectral gap, i.e.,
the separation from the rest of the phase values. For the third case, we found
a similar estimate, but the number of random steps has to be sufficiently
large.
Related papers
- Obtaining Lower Query Complexities through Lightweight Zeroth-Order Proximal Gradient Algorithms [65.42376001308064]
We propose two variance reduced ZO estimators for complex gradient problems.
We improve the state-of-the-art function complexities from $mathcalOleft(minfracdn1/2epsilon2, fracdepsilon3right)$ to $tildecalOleft(fracdepsilon2right)$.
arXiv Detail & Related papers (2024-10-03T15:04:01Z) - Heisenberg-limited adaptive gradient estimation for multiple observables [0.39102514525861415]
In quantum mechanics, measuring the expectation value of a general observable has an inherent statistical uncertainty.
We provide an adaptive quantum algorithm for estimating the expectation values of $M$ general observables within root mean squared error.
Our method paves a new way to precisely understand and predict various physical properties in complicated quantum systems using quantum computers.
arXiv Detail & Related papers (2024-06-05T14:16:47Z) - On adaptive low-depth quantum algorithms for robust multiple-phase
estimation [11.678822620192438]
We present robust multiple-phase estimation (RMPE) algorithms with Heisenberg-limited scaling.
These algorithms are particularly suitable for early fault-tolerant quantum computers.
arXiv Detail & Related papers (2023-03-14T17:38:01Z) - Even shorter quantum circuit for phase estimation on early
fault-tolerant quantum computers with applications to ground-state energy
estimation [5.746732081406236]
We develop a phase estimation method with a distinct feature.
The total cost of the algorithm satisfies the Heisenberg-limited scaling $widetildemathcalO(epsilon-1)$.
Our algorithm may significantly reduce the circuit depth for performing phase estimation tasks on early fault-tolerant quantum computers.
arXiv Detail & Related papers (2022-11-22T03:15:40Z) - Quantum Approximation of Normalized Schatten Norms and Applications to
Learning [0.0]
This paper addresses the problem of defining a similarity measure for quantum operations that can be textitefficiently estimated
We develop a quantum sampling circuit to estimate the normalized Schatten 2-norm of their difference and prove a Poly$(frac1epsilon)$ upper bound on the sample complexity.
We then show that such a similarity metric is directly related to a functional definition of similarity of unitary operations using the conventional fidelity metric of quantum states.
arXiv Detail & Related papers (2022-06-23T07:12:10Z) - Random quantum circuits transform local noise into global white noise [118.18170052022323]
We study the distribution over measurement outcomes of noisy random quantum circuits in the low-fidelity regime.
For local noise that is sufficiently weak and unital, correlations (measured by the linear cross-entropy benchmark) between the output distribution $p_textnoisy$ of a generic noisy circuit instance shrink exponentially.
If the noise is incoherent, the output distribution approaches the uniform distribution $p_textunif$ at precisely the same rate.
arXiv Detail & Related papers (2021-11-29T19:26:28Z) - Random quantum circuits anti-concentrate in log depth [118.18170052022323]
We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated.
Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform.
In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
arXiv Detail & Related papers (2020-11-24T18:44:57Z) - Multivariate mean estimation with direction-dependent accuracy [8.147652597876862]
We consider the problem of estimating the mean of a random vector based on $N$ independent, identically distributed observations.
We prove an estimator that has a near-optimal error in all directions in which the variance of the one dimensional marginal of the random vector is not too small.
arXiv Detail & Related papers (2020-10-22T17:52:45Z) - Sample Complexity of Asynchronous Q-Learning: Sharper Analysis and
Variance Reduction [63.41789556777387]
Asynchronous Q-learning aims to learn the optimal action-value function (or Q-function) of a Markov decision process (MDP)
We show that the number of samples needed to yield an entrywise $varepsilon$-accurate estimate of the Q-function is at most on the order of $frac1mu_min (1-gamma)5varepsilon2+ fract_mixmu_min (1-gamma)$ up to some logarithmic factor.
arXiv Detail & Related papers (2020-06-04T17:51:00Z) - Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings.
In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$.
We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
arXiv Detail & Related papers (2020-02-25T19:18:36Z) - Differentially Quantized Gradient Methods [53.3186247068836]
We show that Differentially Quantized Gradient Descent (DQ-GD) attains a linear contraction factor of $maxsigma_mathrmGD, rhon 2-R$.
No algorithm within a certain class can converge faster than $maxsigma_mathrmGD, 2-R$.
arXiv Detail & Related papers (2020-02-06T20:40: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.