Quantum computation

@article{Patel1999QuantumC,
  title={Quantum computation},
  author={Apoorva D. Patel},
  journal={Resonance},
  year={1999},
  volume={16},
  pages={821-835}
}
The driving force in the pursuit for quantum computation is the exciting possibility that quantum algorithms can be more efficient than their classical analogues. Research on the subject has unraveled several aspects of how that can happen. Clever quantum algorithms have been discovered in recent years, although not systematically, and the field remains under active investigation. Richard Feynman was one of the pioneers who foresaw the power of quantum computers. In this issue dedicated to him… 
2 Citations

Figures from this paper

Quantum Algorithm: A Classical Realizationin High-Performance Computing Using MPI
TLDR
This paper focuses on exposing the strength of quantum algorithm in high performance computing by using MPI, and on comparing the sequential and parallel execution of programs on the basis of execution time and CPU utilization.
Three-qubit Protocol to Purify Generalized Werner States
Generalizing the two-qubit purification method of Bennett et al. (Phys. Rev. Lett. 76, 722–725 1996), we present a three-qubit protocol, to purify partially entangled pairs of generalized Werner

References

SHOWING 1-10 OF 31 REFERENCES
Bulk Spin-Resonance Quantum Computation
TLDR
A new approach to quantum computing is introduced based on the use of multiple-pulse resonance techniques to manipulate the small deviation from equilibrium of the density matrix of a macroscopic ensemble so that it appears to be the density Matrix of a much lower dimensional pure state.
Quantum Computation and Shor's Factoring Algorithm
The eld of quantum computation studies the power of computers that are based on quantum-mechanical principles. We give a brief introduction to the model of quantum computation and to its main success
Quantum information and computation
TLDR
In information processing, as in physics, the classical world view provides an incomplete approximation to an underlying quantum reality that can be harnessed to break codes, create unbreakable codes, and speed up otherwise intractable computations.
Nuclear magnetic resonance spectroscopy: an experimentally accessible paradigm for quantum computing
Abstract We present experimental results which demonstrate that nuclear magnetic resonance spectroscopy is capable of emulating many of the capabilities of quantum computers, including unitary
The Quantum Theory
IN a lecture on the quantum theory it might be thought fitting to commence with a clear explanation of the purpose, nature, and scope of the subject; but an attempt to answer briefly the question,
Quantum Computations with Cold Trapped Ions.
  • Cirac, Zoller
  • Physics, Medicine
    Physical review letters
  • 1995
TLDR
A quantum computer can be implemented with cold ions confined in a linear trap and interacting with laser beams, where decoherence is negligible, and the measurement can be carried out with a high efficiency.
Quantum theory, the Church–Turing principle and the universal quantum computer
  • D. Deutsch
  • Mathematics
    Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences
  • 1985
It is argued that underlying the Church–Turing hypothesis there is an implicit physical assertion. Here, this assertion is presented explicitly as a physical principle: ‘every finitely realizible
A fast quantum mechanical algorithm for database search
TLDR
In early 1994, it was demonstrated that a quantum mechanical computer could efficiently solve a well-known problem for which there was no known efficient algorithm using classical computers, i.e. testing whether or not a given integer, N, is prime, in a time which is a finite power of o (logN) .
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
  • P. Shor
  • Computer Science, Mathematics
    SIAM Rev.
  • 1999
TLDR
Efficient randomized algorithms are given for factoring integers and finding discrete logarithms, two problems which are generally thought to be hard on a classical computer and have been used as the basis of several proposed cryptosystems.
Elementary gates for quantum computation.
TLDR
U(2) gates are derived, which derive upper and lower bounds on the exact number of elementary gates required to build up a variety of two- and three-bit quantum gates, the asymptotic number required for n-bit Deutsch-Toffoli gates, and make some observations about the number of unitary operations on arbitrarily many bits.
...
1
2
3
4
...