Basic concepts in quantum computation

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

37 pages, lectures given at les Houches Summer School on "Coherent Matter Waves", July-August 1999

References in corpus (3)

• Quantum Algorithms Revisited
• Grover's quantum searching algorithm is optimal
• A Framework for Structured Quantum Search

Cited by in corpus (17)

• Information and Computation: Classical and Quantum Aspects
• Multiparticle entanglement with quantum logic networks: Application to cold trapped ions
• Quantum Strategies Win in a Defector-Dominated Population
• An Introduction to Quantum Game Theory
• A Novel Clustering Algorithm Based on Quantum Games
• The Early Universe as a Quantum Growing Network
• Quantum Computation of Jones' Polynomials
• From Monte Carlo to Quantum Computation
• Quantum Computing Spacetime
• Classicity from Entangled Ensemble States of Knotted Spin Networks. A Conceptual Approach
• An unsharp logic from quantum computation
• Recent Conceptual Consequences of Loop Quantum Gravity. Part I: Foundational Aspects
• Quantum Integration in Sobolev Classes
• Unitary Evolution on a Phase Space with Power of Two Discretization
• Quantum Summation with an Application to Integration
• On a Problem in Quantum Summation
• Maximum Likelihood Based Quantum Set Separation