Basic concepts in quantum computation
Artur Ekert, Patrick Hayden, Hitoshi Inamori
TL;DR
This paper provides an overview of fundamental concepts in quantum computation, including qubits, quantum gates, algorithms, and key applications like quantum search and factoring, highlighting the field's foundational principles and early developments.
Contribution
It offers a comprehensive introduction to quantum computing concepts and algorithms, serving as an accessible overview for newcomers and summarizing the state of the field at the time.
Findings
Quantum algorithms can outperform classical counterparts in specific tasks
Quantum coherence is crucial for computational advantage
Early quantum algorithms laid the groundwork for future research
Abstract
Section headings: 1 Qubits, gates and networks 2 Quantum arithmetic and function evaluations 3 Algorithms and their complexity 4 From interferometers to computers 5 The first quantum algorithms 6 Quantum search 7 Optimal phase estimation 8 Periodicity and quantum factoring 9 Cryptography 10 Conditional quantum dynamics 11 Decoherence and recoherence 12 Concluding remarks
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications