Using fewer qubits in shor's factorization algorithm via simultaneous diophantine approximation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2020, Issue , 2001, Pages 319-327

  Seifert, Jean Pierre ^a  

^a INFINEON TECHNOLOGIES AG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; FACTORIZATION; POLYNOMIAL APPROXIMATION; QUANTUM OPTICS; QUBITS;

COMPOSITE NUMBERS; CONTINUED FRACTION ALGORITHM; DIOPHANTINE APPROXIMATION; FACTORIZATION ALGORITHMS; POSITIVE CONSTANT; QUANTUM ALGORITHMS; SHOR'S ALGORITHMS; SIMULTANEOUS DIOPHANTINE APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 84937574527     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45353-9_24     Document Type: Conference Paper

References (26)

1. D. Aharonov, M. Ben-Or, “Fault-tolerant quantum computing with constant error", Proc. of the 29th Ann. ACM Symp. on Theory of Comp., pp. 176-188, 1997.
2. J. W. S. Cassels, An Introduction to Diophantine Approximations, Cambridge University Press, Cambridge, 1957.
3. I. J. Cirac, P. Zoller, “Quantum computations with cold trapped ions", Phys. Rev. Let. 74:4091-4094, 1995.
4. I. L. Chuang, L. M. K. Vandersypen, X. Zhou, D. W. Leung, S. Lloyd, “Experimental realization of a quantum algorithm", Nature 393:143-146, 1998.
5. J. Gruska, Quantum Computing, McGraw-Hill, London, 1999.
6. J. Hástad, A. W. Schrift, A. Shamir, “The discrete logarithm modulo a composite hides O(n) bits", J. Comp. Sys. Sci. 47:376-404, 1993.
7. A. Y. Kitaev, “Quantum measurements and the Abelian stabilizer problem", Technical report, quant-ph/9511026, 1995.
8. J. C. Lagarias, “Some new results in simultaneous diophantine approximation", Queen's Pap. Pure Appl. Math. 54:453-474, 1980.
9. J. C. Lagarias, “Best simultaneous Diophantine approximations. I: Growth rates of best approximation denominators", Trans. Am. Math. Soc. 272:545-554, 1982.
10. J. C. Lagarias, “Best simultaneous Diophantine approximations. II: Behaviour of consecutive best approximations", Pacific J. Math. 102:61-88, 1982.
11. J. C. Lagarias, “The computational complexity of simultaneous Diophantine approximation problems", SIAM J. Computing 14:196-209, 1985.
12. J. Lagarias, J. Hástad, “Simultaneous diophantine approximation of rationals by rationals", J. Number Theory 24:200-228, 1986.
13. A. M. Legendre, Essai sur la thffeorie des nombres, J. B. M. Duprat, Paris, 1798.
14. L. Lovasz, An Algorithmic Theory of Graphs, Numbers and Convexity, SIAM Publications, Philadelphia, 1986.
15. M. Mosca, “Quantum searching, counting and amplititude modification by eigenvector analysis", Proc. of the MFCS'98 Workshop on Randomized Algorithms, pp. 90-100, 1998.
16. M. Mosca, A. Ekert, “The hidden subgroup problem and eigenvalue estimation on a quantum computer", Proc. of the 1st NASA International Conference on Quantum Computing and Quantum Communication, 1998.
17. S. Parker, M. B. Plenio, “Efficient factorization with a single pure qubit", Technical report, quant-ph/0001066, 2000.
18. H. Ritter, Zufallsbits basierend auf dem diskreten Logarithmus, Master Thesis, University of Frankfurt, Dept. of Math., 1992.
19. R. Rivest, A. Shamir, L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems", Comm. of the ACM 21:120-126, 1978.
20. C. Rössner, J.-P. Seifert, “Approximating good simultaneous diophantine approximations is almost NP-hard", Proc. 21st Symposium on Mathematical Foundations of Computer Science, pp. 494-504, 1996.
21. A. Schrijver, An Introduction to Linear and Integer Programming, John Wiley & Sons, New York, 1986.
22. B. E. Kane, “Silicon based quantum computation", Technical report, quantph/ 0003031, 2000.
23. D. E. Knuth, The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, 3rd ed., Addison-Wesley, Reading MA, 1999.
24. A. Shamir, “A polynomial-time algorithm for breaking the basic Merkle-Hellman cryptosystem", IEEE Trans. Inf. Theory IT-30:699-704, 1984.
25. P. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer", SIAM J. Computing 26:1484-1509, 1997.
26. C. Zalka, “Fast version of Shor's quantum factoring algorithm", Technical report, quant-ph/9806084, 1998.