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

CRC Press eBooks

Quantum Computation

Richard Hughes

Published Nov 15, 2018• 2 citations
Publisher

Abstract

The remarkable developments in theoretical and experimental quantum computation that have been inspired by Feynman’s seminal papers on the subject are reviewed. Following an introduction to quantum computation, the implications for cryptography of quantum factoring are discussed. The requirements and challenges for practical quantum computational hardware are illustrated with an overview of the ion trap quantum computation project at Los Alamos. The physical limitations to quantum computation with trapped ions are analyzed and an assessment of the computational potential of the technology is made. … it seems that the laws of physics present no barrier to reducing the size of computers until bits are the size of atoms, and quantum behavior holds dominant sway.” R. P. Feynman, 1985 [ 1 ]. “I think I can safely say that nobody understands quantum mechanics.” R. P. Feynman, 1965 [ 2 ].

DOI
10.1201/9780429500459-14

Related papers

Cryptography, Quantum Computation and Trapped Ions

Richard Hughes

The significance of quantum computation for cryptography is discussed. Following a brief survey of the requirements for quantum computational hardware, an overview of the ion trap quantum computation project at Los Alamos is presented. The physical limitations to quantum computation with trapped ions are analyzed and an assessment of the computational potential of the technology is made.

arXiv:quant-ph/9712054•Dec 23, 1997•7 citations

Cryptography, quantum computation and trapped ions

Richard Hughes

The significance of quantum computation for cryptography is discussed. Following a brief survey of the requirements for quantum computational hardware, an overview of the ion–trap quantum–computation project at Los Alamos is presented. The physical limitations to quantum computation with trapped ions are analysed and an assessment of the computational potential of the technology is made.

Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences•Aug 15, 1998•18 citations

Quantum computing with trapped ions

Richard Hughes

The significance of quantum computation for cryptography is discussed. Following a brief survey of the requirements for quantum computational hardware, an overview of the ion trap quantum computation project at Los Alamos is presented. The physical limitations to quantum computation with trapped ions are analyzed and an assessment of the computational potential of the technology is made.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 15, 1998•0 citations

Prospects for Quantum Computation with Trapped Ions

Richard Hughes, Daniel F. V. James

A brief survey of the requirements for quantum computational hardware, and an overview of the ion trap quantum computation project at Los Alamos are presented. The physical limitations to quantum computation with trapped ions are discussed.

Fortschritte der Physik•Nov 1, 1998•1 citation

Quantum Computing: Principles, Progress, and Prospects

V. Raghu Ram Chowdary

Quantum computing leverages quantum mechanical concepts, including superposition, entanglement, and interference, to solve problems that traditional computers cannot handle efficiently. This study presents a comprehensive overview of the field, covering both the theoretical foundations and the latest developments in quantum hardware and algorithms. This study covers fundamental elements, qubits, gates, and circuits while emphasizing quantum parallelism as a distinctive feature. To illustrate efficiency gains, we explore notable algorithms like Shor’s factorization procedure and Grover’s search algorithm. Furthermore, we analyze recent advancements in quantum hardware, focusing on superconducting qubits, trapped ions, and photonic quantum computers, with an emphasis on implementations by IBM, Google, and other industry leaders. The discussion also addresses major challenges such as decoherence, noise, and the need for quantum error correction to achieve fault tolerance. Finally, we explore emerging applications in cryptography, optimization, quantum machine learning, and material simulation, and identify critical open problems that must be addressed to realize scalable, universal quantum computing. Our review underscores the transformative potential of quantum technologies across science and industry.

Journal of Intelligent Data Analysis and Computational Statistics•Sep 30, 2025•0 citations

Quantum Computation: A Brief Overview

Henan Huang

Quantum computation has teased scientific imagination ever since Richard Feynman dreamed in 1982 of quantum-mechanical computers, which could solve problems that are effectively out of reach of classical computation thanks to their ability to use superposition and entanglement. This critical survey recalls the field’s journey from theoretical advances to present-day engineering challenges, highlighting the yawning gulf between quantum computing’s lofty promises and its actual realizations. By examining three decades of developments, from Shor’s integer factorization and Grover’s search algorithms to recent demonstrations of quantum supremacy, this paper shows how idealized mathematical models interact with the noisy, resource-constrained realities of physical quantum systems. The author presents a literature review through critically analyzing key achievements in quantum computing research.. This paper concludes that quantum advantage will not arise from brute-force universality, but through application specific co-design, combining noise-adjusted algorithms to quantum hardware restrictions whilst mixing classical and quantum processing modes and fundamentally changing the way we think of error correction through the physics of qubits. This shift in paradigm from theoretical maximalism to engineering pragmatism embodies a realistic roadmap for practical quantum computation.

Theoretical and Natural Science•May 23, 2025•0 citations
The remarkable developments in theoretical and experimental quantum computation that have been inspired by Feynman’s seminal papers on the subject are reviewed. Following an introduction to quantum computation, the implications for cryptography of quantum factoring are discussed. The requirements and challenges for practical quantum computational hardware are illustrated with an overview of the ion trap quantum computation project at Los Alamos. The physical limitations to quantum computation with trapped ions are analyzed and an assessment of the computational potential of the technology is made. … it seems that the laws of physics present no barrier to reducing the size of computers until bits are the size of atoms, and quantum behavior holds dominant sway.” R. P. Feynman, 1985 [ 1 ]. “I think I can safely say that nobody understands quantum mechanics.” R. P. Feynman, 1965 [ 2 ].
Quantum computing leverages quantum mechanical concepts, including superposition, entanglement, and interference, to solve problems that traditional computers cannot handle efficiently. This study presents a comprehensive overview of the field, covering both the theoretical foundations and the latest developments in quantum hardware and algorithms. This study covers fundamental elements, qubits, gates, and circuits while emphasizing quantum parallelism as a distinctive feature. To illustrate efficiency gains, we explore notable algorithms like Shor’s factorization procedure and Grover’s search algorithm. Furthermore, we analyze recent advancements in quantum hardware, focusing on superconducting qubits, trapped ions, and photonic quantum computers, with an emphasis on implementations by IBM, Google, and other industry leaders. The discussion also addresses major challenges such as decoherence, noise, and the need for quantum error correction to achieve fault tolerance. Finally, we explore emerging applications in cryptography, optimization, quantum machine learning, and material simulation, and identify critical open problems that must be addressed to realize scalable, universal quantum computing. Our review underscores the transformative potential of quantum technologies across science and industry.
Quantum computation has teased scientific imagination ever since Richard Feynman dreamed in 1982 of quantum-mechanical computers, which could solve problems that are effectively out of reach of classical computation thanks to their ability to use superposition and entanglement. This critical survey recalls the field’s journey from theoretical advances to present-day engineering challenges, highlighting the yawning gulf between quantum computing’s lofty promises and its actual realizations. By examining three decades of developments, from Shor’s integer factorization and Grover’s search algorithms to recent demonstrations of quantum supremacy, this paper shows how idealized mathematical models interact with the noisy, resource-constrained realities of physical quantum systems. The author presents a literature review through critically analyzing key achievements in quantum computing research.. This paper concludes that quantum advantage will not arise from brute-force universality, but through application specific co-design, combining noise-adjusted algorithms to quantum hardware restrictions whilst mixing classical and quantum processing modes and fundamentally changing the way we think of error correction through the physics of qubits. This shift in paradigm from theoretical maximalism to engineering pragmatism embodies a realistic roadmap for practical quantum computation.