Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Quantum computation and quantum information
Quantum computation and quantum information
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Classical and Quantum Computation
Classical and Quantum Computation
Improved bounds for the approximate QFT
WISICT '04 Proceedings of the winter international synposium on Information and communication technologies
Quantum Speed-Up of Markov Chain Based Algorithms
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
An Introduction to Quantum Computing
An Introduction to Quantum Computing
Algorithms for quantum computation: discrete logarithms and factoring
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Quantum phase estimation with arbitrary constant-precision phase shift operators
Quantum Information & Computation
| Hi-index | 0.00 |
We investigate the cost of three phase estimation procedures that require only constant-precision phase shift operators. The cost is in terms of the number of elementary gates, not just the number of measurements. Faster phase estimation requires the minimal number of measurements with a logarithmic factor of reduction when the required precision $$n$$n is large. The arbitrary constant-precision approach (ACPA) requires the minimal number of elementary gates with a minimal factor of 14 of reduction in comparison with Kitaev's approach. The reduction factor increases as the precision gets higher in ACPA. Kitaev's approach is with a reduction factor of 14 in comparison with the faster phase estimation in terms of elementary gate counts.