Theoretical Analyses of Quantum Counting against Decoherence Errors
arXiv:quant-ph/0503202
Abstract
In this paper, we analyze the quantum counting under the decoherence, which can find the number of solutions satisfying a given oracle. We investigate probability distributions related to the first order term of the error rate on the quantum counting with the depolarizing channel. We also implement two circuits for the quantum counting -- the ascending-order circuit and the descending-order circuit -- by reversing ordering of application of controlled-Grover operations. By theoretical and numerical calculations for probability distributions, we reveal the difference of probability distributions on two circuits in the presence of decoherence and show that the ascending-order circuit is more robust against the decoherence than the descending-order circuit. This property of the robustness is applicable to the phase estimation such as the factoring.
22 pages, 21 figures, submitted to Journal of Physics A
References in corpus (11)
- A Quantum Algorithm for Finding the Minimum
- Quantum Sub-Gaussian Mean Estimator
- Fast quantum algorithms for numerical integrals and stochastic processes
- The effect of unitary noise on Grover's quantum search algorithm
- General-Purpose Parallel Simulator for Quantum Computing
- A fast quantum mechanical algorithm for estimating the median
- Decoherence on Grover's quantum algorithm: perturbative approach
- Circuit for Shor's algorithm using 2n+3 qubits
- Quantum searching's underlying SU(2) structure and its quantum decoherence effects
- Simulating the Effects of Quantum Error-correction Schemes
- Simulating the Effect of Decoherence and Inaccuracies on a Quantum Computer