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 Oct 12, 1999• 2 citations
Publisher

Abstract

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

DOI
10.1002/3527603093.ch1

Related papers

Quantum Computation

Samuel L. Braunstein

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

Wiley eBooks•Aug 24, 2005•0 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

Quantum Computing Devices: Principles, Designs, and Analysis

Berthold‐Georg Englert, Bernd Rohwedder, Marlan O. Scully +1 more

Preface FOUNDATIONS OF QUANTUM INFORMATICS Spins: The Stern-Gerlach experiment and spin filter EPR, Bell's inequalities, and hidden variables The Landauer principle QUANTUM COMPUTATION AND QUANTUM SYSTEMS Turing machines and binary logic gates Quantum mechanical systems Hilbert spaces Complex finite dimensional Hilbert Spaces Quantum Turing machines Universality of elementary quantum gates Quantum algorithms Quantum adder and multiplier Quantum error correction codes Lasers: a heuristic introduction Quantum computing devices and requirements TWO-LEVEL ATOMS AND CAVITY QED Two-level atoms Quantization of the electromagnetic field Cavity QED Cavity QED for the quantum phase gate Quantum eraser Quantum disentanglement eraser IMPERFECT QUANTUM OPERATIONS Fidelity Density matrices Time evolution of density matrices Examples of master equations Fidelity calculations ION TRAPS Introduction Ion qubits Summary of ion preparation Coherence Quantum gates Large scale confined-ion quantum computer Trap architecture and performance Teleportation of coherent information Experimental DFS logic gates Quantum error correction by ion traps Summary of ion quantum computation QUANTUM LOGIC USING COLD, CONFINED ATOMS Introduction Atom trapping and detection Atom interactions with external fields Atom trapping Qubits and gates Controlled two-qubit gates Coherence properties of atom gates Assessment QUANTUM DOTS QUANTUM COMPUTING GATES Introduction Electrons in quantum dots microcavity Coupled electron spins Biexciton in a single quantum dot Conclusions LINEAR OPTICS COMPUTERS Classical electrodynamics - Classical computers Quantum electrodynamics - Quantum computers Teleportation Summary and outlook SUPERCONDUCTING QUANTUM COMPUTING DEVICES Introduction Superconductivity More on Cooper pairs and Josephson junctions Superconducting circuits: classical Superconducting circuits: quantum Quantum gates Measurement NMR QUANTUM COMPUTING Nuclear magnetic resonance Basic technology with NMR Solid state NMR Shor's algorithm and its experimental realization Quantum algorithm for lattice-gas systems Conclusion Appendix A: The Fock-Darwin States Appendix B: Evaluation of the exchange energy Appendix C: Transformation of quantum states: SU(2) and SO(3) Appendix D: The Homeomorphism from SU(2) to SO(3)

•Sep 18, 2006•59 citations

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

John H. Reif

This chapter contains sections titled: Introduction Quantum Computing Models Complexity Bounds for QC Bounds on Measurement, Sensing, and Communication Quantum Compression Quantum Error-Correcting Codes Quantum Cryptography Other Algorithmic Applications of QC Possible Technologies for Doing QC Resource Bounds Summary and Acknowledgments Appendix: Volume of Observation Apparatus for Quantum Computing Conclusions References

Wiley eBooks•May 29, 2009•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
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
Preface FOUNDATIONS OF QUANTUM INFORMATICS Spins: The Stern-Gerlach experiment and spin filter EPR, Bell's inequalities, and hidden variables The Landauer principle QUANTUM COMPUTATION AND QUANTUM SYSTEMS Turing machines and binary logic gates Quantum mechanical systems Hilbert spaces Complex finite dimensional Hilbert Spaces Quantum Turing machines Universality of elementary quantum gates Quantum algorithms Quantum adder and multiplier Quantum error correction codes Lasers: a heuristic introduction Quantum computing devices and requirements TWO-LEVEL ATOMS AND CAVITY QED Two-level atoms Quantization of the electromagnetic field Cavity QED Cavity QED for the quantum phase gate Quantum eraser Quantum disentanglement eraser IMPERFECT QUANTUM OPERATIONS Fidelity Density matrices Time evolution of density matrices Examples of master equations Fidelity calculations ION TRAPS Introduction Ion qubits Summary of ion preparation Coherence Quantum gates Large scale confined-ion quantum computer Trap architecture and performance Teleportation of coherent information Experimental DFS logic gates Quantum error correction by ion traps Summary of ion quantum computation QUANTUM LOGIC USING COLD, CONFINED ATOMS Introduction Atom trapping and detection Atom interactions with external fields Atom trapping Qubits and gates Controlled two-qubit gates Coherence properties of atom gates Assessment QUANTUM DOTS QUANTUM COMPUTING GATES Introduction Electrons in quantum dots microcavity Coupled electron spins Biexciton in a single quantum dot Conclusions LINEAR OPTICS COMPUTERS Classical electrodynamics - Classical computers Quantum electrodynamics - Quantum computers Teleportation Summary and outlook SUPERCONDUCTING QUANTUM COMPUTING DEVICES Introduction Superconductivity More on Cooper pairs and Josephson junctions Superconducting circuits: classical Superconducting circuits: quantum Quantum gates Measurement NMR QUANTUM COMPUTING Nuclear magnetic resonance Basic technology with NMR Solid state NMR Shor's algorithm and its experimental realization Quantum algorithm for lattice-gas systems Conclusion Appendix A: The Fock-Darwin States Appendix B: Evaluation of the exchange energy Appendix C: Transformation of quantum states: SU(2) and SO(3) Appendix D: The Homeomorphism from SU(2) to SO(3)
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.