Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

CLASSICAL AND QUANTUM COMPUTATION WITH SMALL SPACE BOUNDS

Abuzer Yakarylmaz

Published Jan 1, 2011• 8 citations
OpenAlex

Related papers

QUANTUM COMPUTATION

John P. Preskill

General Relativity and Gravitation•Nov 1, 2005•24 citations

OVERVIEW OF QUANTUM COMPUTATION

H.E. Caicedo-Ortiz, Elizabeth Santiago-Cortes

Apple Academic Press eBooks•Oct 22, 2014•1 citation

QUANTUM INFORMATION AND COMPUTATION

Jeffrey Bub

Elsevier eBooks•Jan 1, 2007•105 citations

QUANTUM INFORMATION AND COMPUTATION

WORLD SCIENTIFIC eBooks•Jun 1, 2000•172 citations

TRADING CLASSICAL FOR QUANTUM COMPUTATION USING INDIRECTION

Rodney Van Meter

Modular exponentiation is the most expensive portion of Shor’s algorithm. We show that it is possible to reduce the number of quantum modular multiplications necessary by a factor of , at a cost of adding temporary storage space and associated machinery for a table of entries, and performing times as many classical modular multiplications. The storage space may be a quantum-addressable classical memory, or pure quantum memory. With classical computation as much as times as fast as quantum computation, values of from 2 to 30 seem attractive; physically feasible values depend on the implementation of the memory.

International Symposium on Mesoscopic Superconductivity and Spintronics (MS+S)•Aug 1, 2005•0 citations

Classical and Quantum Computation

Song Yuan Yan

Springer eBooks•Jan 1, 2015•1 citation
Modular exponentiation is the most expensive portion of Shor’s algorithm. We show that it is possible to reduce the number of quantum modular multiplications necessary by a factor of , at a cost of adding temporary storage space and associated machinery for a table of entries, and performing times as many classical modular multiplications. The storage space may be a quantum-addressable classical memory, or pure quantum memory. With classical computation as much as times as fast as quantum computation, values of from 2 to 30 seem attractive; physically feasible values depend on the implementation of the memory.