Quantum Computation and Shor's Factoring Algorithm

@article{Ekert1996QuantumCA,
  title={Quantum Computation and Shor's Factoring Algorithm},
  author={Artur K. Ekert and Richard Jozsa},
  journal={Reviews of Modern Physics},
  year={1996},
  volume={68},
  pages={733-753}
}
  • A. Ekert, R. Jozsa
  • Published 1 July 1996
  • Computer Science
  • Reviews of Modern Physics
Current technology is beginning to allow us to manipulate rather than just observe individual quantum phenomena. This opens up the possibility of exploiting quantum effects to perform computations beyond the scope of any classical computer. Recently Peter Shor discovered an efficient algorithm for factoring whole numbers, which uses characteristically quantum effects. The algorithm illustrates the potential power of quantum computation, as there is no known efficient classical method for… 

Figures from this paper

Basics of quantum computation
Quantum algorithms for algebraic problems
TLDR
This article reviews the current state of quantum algorithms, focusing on algorithms with superpolynomial speedup over classical computation and, in particular, on problems with an algebraic flavor.
Experimental realization of a quantum algorithm
Quantum computers can in principle exploit quantum-mechanical effects to perform computations (such as factoring large numbers or searching an unsorted database) more rapidly than classical
Quantum Algorithms from a Linear Algebra Perspective
TLDR
Analysis of some quantum algorithms, notably Grover's database search algorithm, and Shor's factoring and discrete log algorithms, from the perspective of linear algebra are given.
Quantum Computation Input ||> Computation ||> Output
TLDR
This review describes the recent theoretical results which show that quantum computers maintain their complexity power even in the presence of noise, inaccuracies and nite precision, and asks what the implications to other issues in computer science and physics are.
Qubit Neural Network: Its Performance and Applications
Since Shor (1994) proposed a way of factorizing large integers in polynomial time by using a quantum computing algorithm, the study of quantum information science, including quantum communication,
On quantum computing with macroscopic Josephson qubits
  • Jie Han, P. Jonker
  • Physics
    Proceedings of the 2nd IEEE Conference on Nanotechnology
  • 2002
The achievements of quantum computation theory, e.g. Shor's factoring algorithm, motivate efforts to realize quantum computers. Among systems proposed for quantum computing, macroscopic
Thoughts on quantum computation
TLDR
Some of the design principles of quantum gate constructions are illustrated, using the two-bit adder as a simple example and some details of the Shor prime factoring algorithm are discussed.
Demonstration of a compiled version of Shor's quantum factoring algorithm using photonic qubits.
TLDR
An experimental demonstration of a complied version of Shor's algorithm using four photonic qubits using a simplified linear optical network to coherently implement the quantum circuits of the modular exponential execution and semiclassical quantum Fourier transformation.
...
...

References

SHOWING 1-10 OF 100 REFERENCES
Simple quantum computer.
  • Chuang, Yamamoto
  • Physics, Computer Science
    Physical review. A, Atomic, molecular, and optical physics
  • 1995
We propose an implementation of a quantum computer to solve Deutsch's problem, which requires exponential time on a classical computer but only linear time with quantum parallelism. By using a
Quantum networks for elementary arithmetic operations.
  • Vedral, Barenco, Ekert
  • Computer Science
    Physical review. A, Atomic, molecular, and optical physics
  • 1996
TLDR
This work provides an explicit construction of quantum networks effecting basic arithmetic operations: from addition to modular exponentiation, and shows that the auxiliary memory required to perform this operation in a reversible way grows linearly with the size of the number to be factorized.
Quantum-mechanical computers and uncomputability.
  • Lloyd
  • Physics
    Physical review letters
  • 1993
The time evolution operator for any quantum-mechanical computer is diagonalizable, but to obtain the diagonal decomposition of a program state of the computer is as hard as actually performing the
Two-bit gates are universal for quantum computation.
  • DiVincenzo
  • Physics
    Physical review. A, Atomic, molecular, and optical physics
  • 1995
A proof is given, which relies on the commutator algebra of the unitary Lie groups, that quantum gates operating on just two bits at a time are sufficient to construct a general quantum circuit. The
Quantum computers and dissipation
  • G. Palma, K. Suominen, A. Ekert
  • Physics
    Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
  • 1996
We analyse dissipation in quantum computation and its destructive impact on the efficiency of quantum algorithms. Using a general model of decoherence, we study the time evolution of a quantum
Quantum Error Correction by Coding
TLDR
A new technique based on the use of coding is proposed in order to detect and correct errors due to imperfect transmission lines in quantum cryptography or memories in quantum computers.
A Potentially Realizable Quantum Computer
TLDR
P pulsed arrays are true quantum computers: Bits can be placed in superpositions of 0 and 1, logical operations take place coherently, and dissipation is required only for error correction.
Quantum Mechanical Hamiltonian Models of Computers a
Interest in the physical limitations of the computation process has been increasing in recent years.’.’ Landauer3“ has discussed this subject extensively, particularly from the viewpoint of energy
Realizable Universal Quantum Logic Gates.
TLDR
This work identifies a 2-bit quantum gate that is sufficient to build any quantum logic network and proposes an explicit construction of this gate, which is based on cavity QED techniques and may be realizable with current technology.
An approximate Fourier transform useful in quantum factoring", IBM Research Report RC19642 ,; R. Cle
We define an approximate version of the Fourier transform on $2^L$ elements, which is computationally attractive in a certain setting, and which may find application to the problem of factoring
...
...