Realistic lower bounds for the factorization time of large numbers on a quantum computer

Details Realistic lower bounds for the factorization time of large numbers on a quantum computer Realistic lower bounds for the factorization time of large numbers on a quantum computer

1995-12-02

arxiv.org/abs/quant-ph/9512001v1

Phys. Rev. A 53, 2986 (1996)

Physics

Quantum Physics

10 pages + 3 latex-figures

Scientific paper

10.1103/PhysRevA.53.2986

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 qubits that are involved in the computation. Although exhibited here only for special systems, this inter-dependence 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.

Affiliated with

Also associated with

No associations

Rating

Realistic lower bounds for the factorization time of large numbers on a quantum computer does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Realistic lower bounds for the factorization time of large numbers on a quantum computer, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Realistic lower bounds for the factorization time of large numbers on a quantum computer will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-10624