Realistic lower bounds for the factorization time of large numbers on a quantum computer
Open Access
- 1 May 1996
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 53 (5) , 2986-2990
Abstract
We investigate the time T a quantum computer requires to factorize a given number dependent on the number of bits L required to represent this number. We stress the fact that in most cases one has to take into account that the execution time of a single quantum gate is related to the decoherence time of the quantum bits (qubits) that are involved in the computation. Although exhibited here only for special systems, this interdependence of decoherence and computation time seems to be a restriction in many current models for quantum computers and leads to the result that the computation time T scales much stronger with L than previously expected. © 1996 The American Physical Society.Keywords
All Related Versions
This publication has 6 references indexed in Scilit:
- Coherent population transfer in multilevel systems with magnetic sublevels. II. Algebraic analysisPhysical Review A, 1995
- Coherent population transfer in multilevel systems with magnetic sublevels. I. Numerical studiesPhysical Review A, 1995
- Realizable Universal Quantum Logic GatesPhysical Review Letters, 1995
- Quantum Computations with Cold Trapped IonsPhysical Review Letters, 1995
- Conditional Quantum Dynamics and Logic GatesPhysical Review Letters, 1995
- Maintaining coherence in quantum computersPhysical Review A, 1995