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

The Quantum Computer

Jürgen Audretsch

Published Feb 23, 2007• 0 citations
Publisher

Abstract

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

DOI
10.1002/9783527619153.ch12

Related papers

Quantum Algorithms

David McMahon

This chapter contains sections titled: Hadamard Gates The Phase Gate Matrix Representation of Serial and Parallel Operations Quantum Interference Quantum Parallelism and Function Evaluation Deutsch-Jozsa Algorithm Quantum Fourier Transform Phase Estimation Shor's Algorithm Quantum Searching and Grover's Algorithm Exercises

Wiley eBooks•Mar 23, 2007•0 citations

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 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—the new generation of supercomputers?

Reinhard F. Werner

This chapter contains sections titled: Introduction Quantum information Superposition and entanglement Quantum computer and complexity The Shor algorithm Reduction to the problem of searching the period Realizations and outlook Bibliography

Wiley eBooks•Jan 1, 2002•1 citation

Quantum computing: an introduction

Tony Hey

The basic ideas of quantum computation are introduced by a brief discussion of Bennett (1973, 1982) and Fredkin's (1982, 1997) ideas of reversible computation. After some remarks about Deutsch's (1985) pioneering work on quantum complexity and Shor's (1996) factorisation algorithm, quantum logic gates, qubits and registers are discussed. The role of quantum entanglement is stressed and Grover's (1997) quantum search algorithm described in detail. The paper ends with a review of the current experimental status of quantum computers.

Computing & Control Engineering Journal•Jun 1, 1999•276 citations

Quantum Computing

Stig Stenholm, Kalle-Antti Suominen

This chapter contains sections titled: Logic Operations The Computer Quantum Algorithms Errors in Quantum Computing Energetics of Quantum Computations References

Wiley eBooks•Aug 10, 2005•0 citations
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
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
The basic ideas of quantum computation are introduced by a brief discussion of Bennett (1973, 1982) and Fredkin's (1982, 1997) ideas of reversible computation. After some remarks about Deutsch's (1985) pioneering work on quantum complexity and Shor's (1996) factorisation algorithm, quantum logic gates, qubits and registers are discussed. The role of quantum entanglement is stressed and Grover's (1997) quantum search algorithm described in detail. The paper ends with a review of the current experimental status of quantum computers.