Quantum Computers and Games: a new research direction in Finland
52
Quantum Computers and Games a new research direction in Finland www.openquantum.com Sabrina Maniscalco Department of Physics and Astronomy University of Turku
-
Upload
sm588 -
Category
Technology
-
view
1.076 -
download
1
Transcript of Quantum Computers and Games: a new research direction in Finland
Quantum Computers and Games
a new research direction in Finland
www.openquantum.com
Sabrina ManiscalcoDepartment of Physics and Astronomy
University of Turku
Two major societal and scientific
revolutions
The rise of the Games
Game player13h / week playing
1 year of
=
12
Quantum Technologies
Google/NASAbuys Dwave QC for US$10million
Fold it
“The challenge of designing scientific discovery games”, Cooper et al. + 57,000 Foldit players
?
O. T. Brown, et al., “Serious Games for Quantum Research” Lecture Notes in Computer Science 8101, 178 (2013)
N = p x qprime numbers
Factoring problem
15 = 3 x 5prime numbers
RSA-7681230186684530117755130494958384962720772853569595334792197322452151726400507263657518745202199786469389956474942774063845925192557326303453731548268507917026122142913461670429214311602221240479274737794080665351419597459856902143413
RSA-768 has 232 decimal digits (768 bits)
RSA-76833478071698956898786044169848212690817704794983713768568912431388982883793878002287614711652531743087737814467999489× 36746043666799590428244633799627952632279158164343087642676032283815739666511279233373417143396810270092798736308917
N = p x q
x mod N, x2 mod N, x3 mod N, x4 mod N,....
Factoring
Period finding
N=21
2, 4, 8, 16, 11, 1, 2, 4, 8,16, .....period: 6
21
4187
RSA-768
Scaling laws
as all known classical algorithms
better than any known classical algorithms
as good as a quantum computer!
O(ed)
O(dk)
O(d3)
digits number
Screenshot of Mathlab programme showing a test level that factors 4187
Jacob Harper
12 billions game players
Serious Games
Collision detection
Collision detection
Gilbert, Johnson and Keerthi algorithm
A B
A�B = {a� b : a 2 A, b 2 B}Minkowski difference
Configuration Space Obstacle
1988
GJK - CLASSICAL
Computational time grows linearly with the number of inputs
Quantum Collision Detection
Oliver Brown’s question
Quantum Collision Detection
Claw finding
Claw finding
f(x) = g(y)
Claw finding
Grover search algorithm
f(x) = g(y)
Quantum Walkson a Johnson graph
collaboration with Elham Kashefi and Rik Sarkar
S. Tani, “Claw finding algorithms using quantum walk”, Theoretical Computer Science, 410 (50), 5285 (2009)
Random Walk
OR
Quantum Walk|coini = c1|headi+ c2|taili
Computational time grows sublinearly with the number of inputs
Quantum Collision Detection
O(NM)1/3
Games for Quantum Finnish [email protected]
www.dscien.com
www.dscien.com
THANK YOU
