Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > JEAN-PIERRE SEIFERT:
All reports by Author Jean-Pierre Seifert:

TR00-078 | 18th July 2000
Jean-Pierre Seifert

Using fewer Qubits in Shor's Factorization Algorithm via Simultaneous Diophantine Approximation}

While quantum computers might speed up in principle
certain computations dramatically, in pratice, though
quantum computing technology is still in its infancy.
Even we cannot clearly envison at present what the
hardware of that machine will be like.
Nevertheless, we can be quite confident that it will be
more >>>




ISSN 1433-8092 | Imprint