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

PL Knight - Physical Review A, 1996 - APS
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 …
Save Cite Cited by 172 Related articles
[Free GPT-4]
[PDF] academia.edu

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

MB Plenio, PL Knight - arxiv preprint quant-ph/9512001 - academia.edu
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 …
Cite
[Free GPT-4]
[PDF] core.ac.uk

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

MB Plenio, PL Knight - PHYSICAL REVIEW A, 1996 - core.ac.uk
Since Shor's discovery 1, 2 of an algorithm that allows the factorization of a large number by
a quantum computer in polynomial time instead of an exponential time as in classical …
Cite
[Free GPT-4]
[PDF] archive.org

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

MB Plenio, PL Knight - PHYSICAL REVIEW A, 1996 - scholar.archive.org
Since Shor's discovery 1, 2 of an algorithm that allows the factorization of a large number by
a quantum computer in polynomial time instead of an exponential time as in classical …
Cite

[CITATION][C] Realistic lower bounds for the factorization time of large numbers on a quantum computer

MB Plenio, PL Knight - Physical review. A, Atomic …, 1996 - pubmed.ncbi.nlm.nih.gov
Cite
[Free GPT-4]
[PDF] researchgate.net

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

MB Plenio, PL Knight - arxiv preprint quant-ph/9512001 - researchgate.net
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 …
Cite

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

MB Plenio, PL Knight - Physical Review A, 1996 - ui.adsabs.harvard.edu
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 …
Cite

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

MB Plenio, PL Knight - Phys. Rev. A, 1996 - inspirehep.net
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 …
Cite

[CITATION][C] Realistic lower bounds for the factorization time of large numbers on a quantum computer.

MB Plenio, PL Knight - Physical review. A, Atomic, Molecular, and …, 1996 - europepmc.org
Realistic lower bounds for the factorization time of large numbers on a quantum computer. -
Abstract - Europe PMC Sign in | Create an account https://orcid.org Europe PMC Menu About …
Cite

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

MB Plenio, PL Knight - arxiv preprint quant-ph/9512001, 1995 - arxiv.org
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 …
Cite