Quantum Computing. Presentation by Joe Mazzanti and Colin Hart SRJC PHYS 43 Spring 2011. A little background…. A computer is a programmable machine designed to sequentially and automatically carry out a sequence of arithmetic or logical operations.
Presentation by Joe Mazzanti and Colin Hart
SRJC PHYS 43 Spring 2011
a representation of a
block of quantum
In 1980, Richard Feynman, among others, begins to investigate the generalization of conventional information science concepts to quantum physical processes, considering the representation of binary numbers in relation to the quantum states of two-state quantum systems: in other words, simulating quantum systems not with conventional computers but with other quantum systems constructed for this purpose.
In 1985, David Deutsch,
publishes a theoretical
paper describing a universal
proving that if two-state
system could be made to evolve by means of a set of simple operations, any such evolution could be produced, and made to simulate any physical system; these operations come to be called quantum 'gates', as they function similarly to binary logic gates in classical computers.
In 1994, proposes a method using entanglement of qubits and superposition to find the prime factors of an integer, a rather valuable process as many encryption systems exploit the difficulty in finding factors of large numbers. In principle, his algorithm would far surpass the efficiency of any known computer when executed on a quantum computer; Shor’s discovery proves quite instrumental in provoking a storm of research both by physicists and computer scientists.