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

Wiley eBooks

Quantum Computation

Samuel L. Braunstein

Published Aug 24, 2005• 0 citations
Publisher

Abstract

This chapter contains sections titled: Computing at the Atomic Scale Reversible Computation Classical Universal Machines and Logic Gates FANOUT and ERASE Computation without ERASE Elementary Quantum Notation Logic Gates for Quantum Bits Logic Gates in the Laboratory Model Quantum Computer and Quantum Code Quantum Parallelism: Period of a Sequence The Complexity of Factoring Security and RSA Shor's Result: Factoring Numbers Quantum Error Correction Prospects

DOI
10.1002/3527607773.ch12

Related papers

Quantum Computation

Samuel L. Braunstein

This chapter contains sections titled: Introduction 1 Computing at the Atomic Scale 2 Reversible Computation 3 Classical Universal Machines and Logic Gates 3.1 FANOUT and ERASE 3.2 Computation without ERASE 4 Elementary Quantum Notation 5 Logic Gates for Quantum Bits 6 Logic Gates in the Laboratory 7 Model Quantum Computer and Quantum Code 8 Quantum Parallelism: Period of a Sequence 9 The Complexity of Factoring 10 Security and RSA 11 Shor's Result: Factoring Numbers 12 Quantum Error Correction 13 Prospects Glossary Appendix Works Cited

Wiley eBooks•Oct 12, 1999•2 citations

Quantum Computers: First Steps towards a Realization

Thomas Pellizzari

This chapter contains sections titled: Introduction Outline Basic Building Blocks The Quantum Bit 1-Bit Quantum Gates on Single Atoms Quantum Registers and Universal Quantum Gates Experimental Approaches The Ion Trap QC The Basic Principle 2-Bit Quantum Gates The NIST Experiment Why Is the Ion Trap QC the most Realistic Proposal so far? Ion Trapping and Cooling Technology Flying Qubits: Atoms A Cavity Quantum Electrodynamics QC Flying Qubits: Photons Quantum Error Correction Decoherence Why is Quantum Error Correction Difficult? Types of Errors Errors in the Ion Trap QC Correction of Memory Errors Quantum Gate Error Correction Conclusions and Outlook Acknoledgements Appendix: Mathematical Formalism References

Wiley eBooks•May 14, 1998•1 citation

The Quantum Computer

Jürgen Audretsch

This chapter contains sections titled: Registers and Networks Functional Computation Quantum Parallelism Two Simple Quantum Algorithms Grover's Search Algorithm Shor's Factorisation Algorithm Quantum Error Correction Using Non-local Measurements The Components of the Quantum Computer Complementary Topics and Further Reading Problems for Chapter 12

Wiley eBooks•Feb 23, 2007•0 citations

Quantum Computing

Pranjal Bhaskar Dr.Rajabhushanam C

After some remarks on the fundamental physical nature of information, Bennett and Fredkin’s ideas reversible computation are introduced. This leads to the suggestions of Benioff and Feynman as to the possibility of a new type of essentially ‘quantum computer’. If we happen to build such devices, Deutsch scientists showed that‘quantum parallelism’ leads to new algorithms and new complexity classes. This is dramatically illustrated by Shor's quantum algorithm for factorization which is polynomial in time in contrast to algorithms for factorization on a classical Turing computer. This discovery has potentially important implications for the security of many modern cryptographic systems. The fundamentals of quantum computing are then introduced - reversible logic gates, qubits and quantum registers. The key quantum property of ‘entanglement’ is described, with due homage to Einstein and Bell. As an illustration of a quantum program, Grover's database search algorithm is described in some detail. After all this theory, the status of experimental attempts to build a quantum computer is reviewed: it will become evident that we have a long way to go before we can factorize even small numbers. Finally, we end with some thoughts about the process of ‘quantum compilation’ - translating a quantum algorithm into actual physical operations on a quantum system - and some comments on prospects for future progress.

Eurasian Journal of Analytical Chemistry•Jul 30, 2017•0 citations

Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits

Madelyn Cain, Qian Xu, Robbie King +6 more

Quantum computers have the potential to perform computational tasks beyond the reach of classical machines. A prominent example is Shor's algorithm for integer factorization and discrete logarithms, which is of both fundamental importance and practical relevance to cryptography. However, due to the high overhead of quantum error correction, optimized resource estimates for cryptographically relevant instances of Shor's algorithm require millions of physical qubits. Here, by leveraging advances in high-rate quantum error-correcting codes, efficient logical instruction sets, and circuit design, we show that Shor's algorithm can be executed at cryptographically relevant scales with as few as 10,000 reconfigurable atomic qubits. Increasing the number of physical qubits improves time efficiency by enabling greater parallelism; under plausible assumptions, the runtime for discrete logarithms on the P-256 elliptic curve could be just a few days for a system with 26,000 physical qubits, while the runtime for factoring RSA-2048 integers is one to two orders of magnitude longer. Recent neutral-atom experiments have demonstrated universal fault-tolerant operations below the error-correction threshold, computation on arrays of hundreds of qubits, and trapping arrays with more than 6,000 highly coherent qubits. Although substantial engineering challenges remain, our theoretical analysis indicates that an appropriately designed neutral-atom architecture could support quantum computation at cryptographically relevant scales. More broadly, these results highlight the capability of neutral atoms for fault-tolerant quantum computing with wide-ranging scientific and technological applications.

quant-pharXiv:2603.28627•Mar 31, 2026•160 citations

Introduction to quantum computing

Pawan Kumar Verma, Mohit Kumar, Saurabh Singhal +1 more

This chapter introduces quantum computing as a new computational paradigm built on superposition, entanglement, interference, and measurement and establishes its relevance to quantum searching and optimization. It first defines the core information primitives—qubits, quantum gates, and quantum circuits—and explains how they enable nonclassical state manipulation compared with deterministic bit-based processing. This chapter then surveys three major models of quantum computation: the gate-based circuit model for algorithmic execution via unitary gate sequences, the measurement-based model using pre-entangled resource states with computation driven by adaptive measurements, and the adiabatic model that encodes solutions in the ground state of a gradually evolved system, aligning naturally with annealing-style optimization. A structured comparison between classical and quantum computing highlights differences in data representation, intrinsic parallelism, scalability constraints, and error behavior and situates quantum supremacy as a task-specific benchmark rather than a universal replacement for classical machines. This chapter connects these foundations to application-critical algorithms, emphasizing Grover’s search and Shor’s factoring as canonical demonstrations of computational advantage. Finally, it motivates the book’s focus by mapping quantum search and optimization to practical domains including database querying, cryptography and post-quantum security, financial risk and fraud analytics, supply-chain logistics, scientific simulation, and emerging workflows such as quantum-assisted drug discovery and routing problems, while noting current hardware limitations and the need for robust error control.

CRC Press eBooks•Nov 6, 2026•0 citations
This chapter contains sections titled: Computing at the Atomic Scale Reversible Computation Classical Universal Machines and Logic Gates FANOUT and ERASE Computation without ERASE Elementary Quantum Notation Logic Gates for Quantum Bits Logic Gates in the Laboratory Model Quantum Computer and Quantum Code Quantum Parallelism: Period of a Sequence The Complexity of Factoring Security and RSA Shor's Result: Factoring Numbers Quantum Error Correction Prospects
This chapter contains sections titled: Introduction 1 Computing at the Atomic Scale 2 Reversible Computation 3 Classical Universal Machines and Logic Gates 3.1 FANOUT and ERASE 3.2 Computation without ERASE 4 Elementary Quantum Notation 5 Logic Gates for Quantum Bits 6 Logic Gates in the Laboratory 7 Model Quantum Computer and Quantum Code 8 Quantum Parallelism: Period of a Sequence 9 The Complexity of Factoring 10 Security and RSA 11 Shor's Result: Factoring Numbers 12 Quantum Error Correction 13 Prospects Glossary Appendix Works Cited
This chapter contains sections titled: Introduction Outline Basic Building Blocks The Quantum Bit 1-Bit Quantum Gates on Single Atoms Quantum Registers and Universal Quantum Gates Experimental Approaches The Ion Trap QC The Basic Principle 2-Bit Quantum Gates The NIST Experiment Why Is the Ion Trap QC the most Realistic Proposal so far? Ion Trapping and Cooling Technology Flying Qubits: Atoms A Cavity Quantum Electrodynamics QC Flying Qubits: Photons Quantum Error Correction Decoherence Why is Quantum Error Correction Difficult? Types of Errors Errors in the Ion Trap QC Correction of Memory Errors Quantum Gate Error Correction Conclusions and Outlook Acknoledgements Appendix: Mathematical Formalism References
After some remarks on the fundamental physical nature of information, Bennett and Fredkin’s ideas reversible computation are introduced. This leads to the suggestions of Benioff and Feynman as to the possibility of a new type of essentially ‘quantum computer’. If we happen to build such devices, Deutsch scientists showed that‘quantum parallelism’ leads to new algorithms and new complexity classes. This is dramatically illustrated by Shor's quantum algorithm for factorization which is polynomial in time in contrast to algorithms for factorization on a classical Turing computer. This discovery has potentially important implications for the security of many modern cryptographic systems. The fundamentals of quantum computing are then introduced - reversible logic gates, qubits and quantum registers. The key quantum property of ‘entanglement’ is described, with due homage to Einstein and Bell. As an illustration of a quantum program, Grover's database search algorithm is described in some detail. After all this theory, the status of experimental attempts to build a quantum computer is reviewed: it will become evident that we have a long way to go before we can factorize even small numbers. Finally, we end with some thoughts about the process of ‘quantum compilation’ - translating a quantum algorithm into actual physical operations on a quantum system - and some comments on prospects for future progress.
Quantum computers have the potential to perform computational tasks beyond the reach of classical machines. A prominent example is Shor's algorithm for integer factorization and discrete logarithms, which is of both fundamental importance and practical relevance to cryptography. However, due to the high overhead of quantum error correction, optimized resource estimates for cryptographically relevant instances of Shor's algorithm require millions of physical qubits. Here, by leveraging advances in high-rate quantum error-correcting codes, efficient logical instruction sets, and circuit design, we show that Shor's algorithm can be executed at cryptographically relevant scales with as few as 10,000 reconfigurable atomic qubits. Increasing the number of physical qubits improves time efficiency by enabling greater parallelism; under plausible assumptions, the runtime for discrete logarithms on the P-256 elliptic curve could be just a few days for a system with 26,000 physical qubits, while the runtime for factoring RSA-2048 integers is one to two orders of magnitude longer. Recent neutral-atom experiments have demonstrated universal fault-tolerant operations below the error-correction threshold, computation on arrays of hundreds of qubits, and trapping arrays with more than 6,000 highly coherent qubits. Although substantial engineering challenges remain, our theoretical analysis indicates that an appropriately designed neutral-atom architecture could support quantum computation at cryptographically relevant scales. More broadly, these results highlight the capability of neutral atoms for fault-tolerant quantum computing with wide-ranging scientific and technological applications.
This chapter introduces quantum computing as a new computational paradigm built on superposition, entanglement, interference, and measurement and establishes its relevance to quantum searching and optimization. It first defines the core information primitives—qubits, quantum gates, and quantum circuits—and explains how they enable nonclassical state manipulation compared with deterministic bit-based processing. This chapter then surveys three major models of quantum computation: the gate-based circuit model for algorithmic execution via unitary gate sequences, the measurement-based model using pre-entangled resource states with computation driven by adaptive measurements, and the adiabatic model that encodes solutions in the ground state of a gradually evolved system, aligning naturally with annealing-style optimization. A structured comparison between classical and quantum computing highlights differences in data representation, intrinsic parallelism, scalability constraints, and error behavior and situates quantum supremacy as a task-specific benchmark rather than a universal replacement for classical machines. This chapter connects these foundations to application-critical algorithms, emphasizing Grover’s search and Shor’s factoring as canonical demonstrations of computational advantage. Finally, it motivates the book’s focus by mapping quantum search and optimization to practical domains including database querying, cryptography and post-quantum security, financial risk and fraud analytics, supply-chain logistics, scientific simulation, and emerging workflows such as quantum-assisted drug discovery and routing problems, while noting current hardware limitations and the need for robust error control.