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

Physics-Uspekhi

Quantum computers: can they be made 'large'?

Kamil A. Valiev

Published Jun 30, 1999• 5 citations
Publisher
DOI
10.1070/pu1999v042n06abeh000585

Related papers

Accurate resource estimation for quantum computation

Simon J. Devitt, Ashley M. Stephens, William J. Munro +1 more

We detail how resource estimates should be made for large scale, error corrected computation. We detail the series of steps needed when compiling algorithms and illustrate how to estimate the qubit/time requirements of any computation.

Conference on Lasers and Electro-Optics Pacific Rim (CLEO-PR)•Jun 1, 2013•0 citations

Quantum computers. Do they have a future?

T.O. Frolova

Politechnical student journal•Apr 1, 2023•0 citations

Continuous-variable quantum computing: scalable designs and fault tolerance

Nicolas C. Menicucci

One of the biggest challenges to a viable quantum computer with real-world impact is scaling it up to handle large computations. Continuous-variable (CV) cluster states, which are resource states for measurement-based quantum computation, can be made on a vast scale with minimal experimental resources. I will present recent experimental breakthroughs in producing large-scale CV cluster states, and I will illustrate how to use these states for fault-tolerant quantum computation.

Photonics for Quantum (PfQ)•Aug 27, 2021•0 citations

Building a Quantum Computer

Jack D. Hidary

Springer eBooks•Jan 1, 2019•3 citations

Shor’s factoring algorithm and modern cryptography. An illustration of the capabilities inherent in quantum computers

E. Gerjuoy

The security of messages encoded via the widely used RSA public key encryption system rests on the enormous computational effort required to find the prime factors of a large number N using classical (conventional) computers. In 1994 Peter Shor showed that for sufficiently large N, a quantum computer could perform the factoring with much less computational effort. This paper endeavors to explain, in a fashion comprehensible to the nonexpert, the RSA encryption protocol; the various quantum computer manipulations constituting the Shor algorithm; how the Shor algorithm performs the factoring; and the precise sense in which a quantum computer employing Shor’s algorithm can be said to accomplish the factoring of very large numbers with less computational effort than a classical computer. It is made apparent that factoring N generally requires many successive runs of the algorithm. Our analysis reveals that the probability of achieving a successful factorization on a single run is about twice as large as commonly quoted in the literature.

arXiv:quant-ph/0411184•American Journal of Physics•May 13, 2005•101 citations

The Limits of Quantum Computers

Scott Aaronson

Lecture notes in computer science•Aug 21, 2007•54 citations
The security of messages encoded via the widely used RSA public key encryption system rests on the enormous computational effort required to find the prime factors of a large number N using classical (conventional) computers. In 1994 Peter Shor showed that for sufficiently large N, a quantum computer could perform the factoring with much less computational effort. This paper endeavors to explain, in a fashion comprehensible to the nonexpert, the RSA encryption protocol; the various quantum computer manipulations constituting the Shor algorithm; how the Shor algorithm performs the factoring; and the precise sense in which a quantum computer employing Shor’s algorithm can be said to accomplish the factoring of very large numbers with less computational effort than a classical computer. It is made apparent that factoring N generally requires many successive runs of the algorithm. Our analysis reveals that the probability of achieving a successful factorization on a single run is about twice as large as commonly quoted in the literature.