Prime Numbers and Quantum Computers - CERN

28
Prime Numbers and Quantum Computers Workshop on Quantum Computing for High Energy Physics CERN, Geneva, 5-6 Nov 2018 Germán Sierra Instituto de Física Teórica CSIC-UAM, Madrid

Transcript of Prime Numbers and Quantum Computers - CERN

Page 1: Prime Numbers and Quantum Computers - CERN

Prime Numbersand

Quantum Computers

Workshop on Quantum Computing for High Energy PhysicsCERN, Geneva, 5-6 Nov 2018

Germán Sierra Instituto de Física Teórica CSIC-UAM, Madrid

Page 2: Prime Numbers and Quantum Computers - CERN

UCSB 2012

15 = 3 x 5

Page 3: Prime Numbers and Quantum Computers - CERN

RSA-129 = 114381625757888867669235779976146612010218296721242362562561842935706935245733897830597123563958705058989075147599290026879543541= 3490529510847650949147849619903898133417764638493387843990820577 ×32769132993266709549961988190834461413177642967992942539798288533

Factorized in 1994 using 1.600 computers connected in internet

Page 4: Prime Numbers and Quantum Computers - CERN

Quantum promise

Page 5: Prime Numbers and Quantum Computers - CERN

Prime numbers go quantum

Page 6: Prime Numbers and Quantum Computers - CERN
Page 7: Prime Numbers and Quantum Computers - CERN
Page 8: Prime Numbers and Quantum Computers - CERN
Page 9: Prime Numbers and Quantum Computers - CERN
Page 10: Prime Numbers and Quantum Computers - CERN

Prime Number Theorem (1896)

Page 11: Prime Numbers and Quantum Computers - CERN
Page 12: Prime Numbers and Quantum Computers - CERN
Page 13: Prime Numbers and Quantum Computers - CERN

Non trivial zeros of the zeta function have real part equal to 1/2

Page 14: Prime Numbers and Quantum Computers - CERN

Test

Page 15: Prime Numbers and Quantum Computers - CERN
Page 16: Prime Numbers and Quantum Computers - CERN

Problem: given x determine if it is prime or not

Miller-Rabin primality test:

Choose in the range

Test then x is composite with certainty

Run a test that involves

(witness)

Test then

strong witness

2) x is composite strong lier1) x is prime with high probability

Solution: use several witnesses

For

With k witnesses the error is

Page 17: Prime Numbers and Quantum Computers - CERN
Page 18: Prime Numbers and Quantum Computers - CERN
Page 19: Prime Numbers and Quantum Computers - CERN
Page 20: Prime Numbers and Quantum Computers - CERN

Quantum speed up

Page 21: Prime Numbers and Quantum Computers - CERN

Turing, computers and number theory

Turing did not believe in the Riemann hypothesis and wanted to disprove it.

In 1950 he used the electronic computer at the Manchester university

to find the first 1104 Riemann zeros who all lie on the critical line.

Then the machine broke down.

Page 22: Prime Numbers and Quantum Computers - CERN

Entanglement entropy of the Prime state(JI Latorre, GS, 2015)

Page 23: Prime Numbers and Quantum Computers - CERN

A random density matrix has

Volumen law entropy

The Prime state is not random

(Don Page)

Page 24: Prime Numbers and Quantum Computers - CERN

Prime correlations (Hardy-Littlewood)

Entanglement encode correlations between primes

Page 25: Prime Numbers and Quantum Computers - CERN

IBM quantum computer and the Prime state(Diego García-Martín, GS, 2018)

Page 26: Prime Numbers and Quantum Computers - CERN

Conclusions

- Use quantum computers to study fundamental quantities in number theory:

Counting by measuring

- Number theory provides interesting highly entangled states to test quantum computers:

Quantum Arithmetics

Page 27: Prime Numbers and Quantum Computers - CERN

”Quantum Computation of prime number functions”,J.I. Latorre and G.S., Quan. Info. Comm. 2014.

”There is entanglement in the primes”,J.I. Latorre and G.S., Quan. Info. Comm. 2015.

”Five experimental Tests on the 5-Qubit IBM Quantum Computer”,D. García-Martín and G.S., J. Applied Maths and Phys. 2018

Work done in collaboration with J.I. Latorre and D. García-Martín

Page 28: Prime Numbers and Quantum Computers - CERN

Thanks for your attention