quantum computers - santa rosa junior collegesrjcstaff.santarosa.edu/~yataiiya/4d/quantum...

16
Quantum Computers RUBEN GUZMAN RICHARD CASTILLO JORGE VAQUERO ANTONIO JACOBO SRJC, Spring 2014, PHYS43

Upload: others

Post on 24-Jul-2020

2 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Quantum Computers - Santa Rosa Junior Collegesrjcstaff.santarosa.edu/~yataiiya/4D/Quantum computing.pdf · A general timeline of quantum computing: 1982 Richard Feynman proposes a

Quantum

Computers RUBEN GUZMAN

RICHARD CASTILLO

JORGE VAQUERO

ANTONIO JACOBO

SRJC, Spring 2014, PHYS43

Page 2: Quantum Computers - Santa Rosa Junior Collegesrjcstaff.santarosa.edu/~yataiiya/4D/Quantum computing.pdf · A general timeline of quantum computing: 1982 Richard Feynman proposes a

Video

https://www.youtube.com/watch?v=YgFVzOksm4

o

Page 3: Quantum Computers - Santa Rosa Junior Collegesrjcstaff.santarosa.edu/~yataiiya/4D/Quantum computing.pdf · A general timeline of quantum computing: 1982 Richard Feynman proposes a

What's quantum

Computing --a computation device that makes direct use of quantum-mechanical phenomena, such as superposition and entanglement, to perform operations on data

Babbage engine Silicon Wafers Atoms

1m 1X 10^-7 m 1 1X 10^-11m

Every 18 months microprocessors double in speed

Faster = Smaller

Page 4: Quantum Computers - Santa Rosa Junior Collegesrjcstaff.santarosa.edu/~yataiiya/4D/Quantum computing.pdf · A general timeline of quantum computing: 1982 Richard Feynman proposes a

Origins

The field of quantum computing was first

introduced by Yuri Manin in 1980 and Richard

Feynman in 1982.

Richard Feynman

Yuri Manin

Page 5: Quantum Computers - Santa Rosa Junior Collegesrjcstaff.santarosa.edu/~yataiiya/4D/Quantum computing.pdf · A general timeline of quantum computing: 1982 Richard Feynman proposes a

Theoretical Quantum

Computer

Quantum logic gates and connect them into a

network.

Like a classical gate a quantum logic gate

performs one elementary quantum operation,

usually on 2 qubits with the added functionality of

superposition.

Page 6: Quantum Computers - Santa Rosa Junior Collegesrjcstaff.santarosa.edu/~yataiiya/4D/Quantum computing.pdf · A general timeline of quantum computing: 1982 Richard Feynman proposes a

Simons algorithm

There exist quantum algorithms, such as Simon's

algorithm, which run faster than any possible

probabilistic classical algorithm.

Simon's problem is a computational problem in

the model of decision tree complexity or query

complexity, conceived by Daniel Simon in 1994.

Simon exhibited a quantum algorithm, usually

called Simon's algorithm, that solves the problem

exponentially faster than any (deterministic or

probabilistic) classical algorithm.

Page 7: Quantum Computers - Santa Rosa Junior Collegesrjcstaff.santarosa.edu/~yataiiya/4D/Quantum computing.pdf · A general timeline of quantum computing: 1982 Richard Feynman proposes a

Modern Vs Quantum

Modern Computer:

Only two states in which a bit can exist

Can only perform one operation at a given time

Page 8: Quantum Computers - Santa Rosa Junior Collegesrjcstaff.santarosa.edu/~yataiiya/4D/Quantum computing.pdf · A general timeline of quantum computing: 1982 Richard Feynman proposes a

Quantum Computer:

Multiple states can exist

Can perform multiple operations at a given time

Page 9: Quantum Computers - Santa Rosa Junior Collegesrjcstaff.santarosa.edu/~yataiiya/4D/Quantum computing.pdf · A general timeline of quantum computing: 1982 Richard Feynman proposes a
Page 10: Quantum Computers - Santa Rosa Junior Collegesrjcstaff.santarosa.edu/~yataiiya/4D/Quantum computing.pdf · A general timeline of quantum computing: 1982 Richard Feynman proposes a

Possibilities of Quantum

Computing

Factoring very large numbers

Shor’s Algorithm

RSA

Quantum Simulation:

Study the interactions between molecules and

atoms

Design new drugs or new materials

(superconductors r.t.)

Endless possibilites (ex: laser)

Page 11: Quantum Computers - Santa Rosa Junior Collegesrjcstaff.santarosa.edu/~yataiiya/4D/Quantum computing.pdf · A general timeline of quantum computing: 1982 Richard Feynman proposes a

NASA

Just acquired a

quantum computer

(Google)

512 quibits

Running D-Wave

quantum system

Will manage huge

repositories of data

Coordination of robotic

rovers

Search for exoplants

Page 12: Quantum Computers - Santa Rosa Junior Collegesrjcstaff.santarosa.edu/~yataiiya/4D/Quantum computing.pdf · A general timeline of quantum computing: 1982 Richard Feynman proposes a

State of Development A general timeline of quantum computing:

1982 Richard Feynman proposes a basic model for a quantum computer.

1998 First working nuclear magnetic resonance 2-qubit quantum computer at Oxford University

2000 First working nuclear magnetic resonance 5-qubit quantum computer at the Technical University of Munich

2000 First working nuclear magnetic resonance 7-qubit quantum computer at Los Alamos National Laboratory

2006 First 12 qubit quantum computer benchmarked

2006 Cristophe Boehme, University of Utah, demonstrates the feasibility of reading spin-data on a silicon-phosphorus quantum computer.

2008 Qubit stored for over 1 second in atomic nucleus

2009 Lifetime of qubits extended to hundreds of milliseconds

2009 Quantum entanglement demonstrated over 240 micrometres

2010 Qubits manipulated electrically, not magnetically

2012 Physicists create a working transistor from a single atom

Page 13: Quantum Computers - Santa Rosa Junior Collegesrjcstaff.santarosa.edu/~yataiiya/4D/Quantum computing.pdf · A general timeline of quantum computing: 1982 Richard Feynman proposes a

State of Development

2013 Coherent superposition of an ensemble of approximately 3 billion qubits for 39 minutes at room temperature. The previous record was 2 seconds.

Though surviving for 39 minutes may not sound like very long, it only requires one-hundred-thousandth of a second to perform an operation on a single qubit. So theoretically, over 20 million operations could be performed before the qubits’ data decayed by 1 percent.

Researchers still needed to refreeze the qubits to their original temperature before their data could be read. Only 37 percent of the quibits made it through the process.

Page 14: Quantum Computers - Santa Rosa Junior Collegesrjcstaff.santarosa.edu/~yataiiya/4D/Quantum computing.pdf · A general timeline of quantum computing: 1982 Richard Feynman proposes a

Quantum Computing

Although quantum computing possesses major

obstacles their potential has many applications

that outweigh the costs. Some of the applications

include cryptanalysis, computer models of

weather systems or of complex chemical

reactions and problems which involve a great

multitude of variables.

Page 15: Quantum Computers - Santa Rosa Junior Collegesrjcstaff.santarosa.edu/~yataiiya/4D/Quantum computing.pdf · A general timeline of quantum computing: 1982 Richard Feynman proposes a

Reference

http://io9.com/what-will-nasa-be-doing-with-its-new-quantum-computer-1468333514

http://www.businessweek.com/articles/2013-05-30/what-quantum-computing-can-do-for-you

http://modular.fas.harvard.edu/edu/Fall2001/124/misc/arjen_lenstra_factoring.pdf

https://uwaterloo.ca/institute-for-quantum-computing/quantum-computing-101

http://www.nec.com/en/global/rd/innovative/quantum/03.html

http://computer.howstuffworks.com/quantum-computer.htm

http://www.cs.rice.edu/~taha/teaching/05F/210/news/2005_09_16.htm

Page 16: Quantum Computers - Santa Rosa Junior Collegesrjcstaff.santarosa.edu/~yataiiya/4D/Quantum computing.pdf · A general timeline of quantum computing: 1982 Richard Feynman proposes a