quanum computing. what is quantum computation? new model of computing based on quantum mechanics....
TRANSCRIPT
![Page 1: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/1.jpg)
Quanum computing
![Page 2: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/2.jpg)
What is quantum computation?
• New model of computing based on quantum mechanics.
• Quantum circuits, quantum Turing machines
• More powerful than conventional models.
![Page 3: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/3.jpg)
Quantum algorithms
• Factoring: given N=pq, find p and q.
• Best algorithm 2O(n1/3), n -number of digits.
• Many cryptosystems based on hardness of factoring.
• O(n2) time quantum algorithm [Shor, 1994]
• Similar quantum algorithm solves discrete log.
![Page 4: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/4.jpg)
Quantum algorithms
• Find if there exists i for which xi=1.
• Queries: input i, output xi.
• Classically, n queries.
• Quantum, O(n) queries [Grover, 1996].
• Speeds up exhaustive search.
0 1 0 0...
x1 x2 xnx3
![Page 5: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/5.jpg)
Quantum cryptography
• Key distribution: two parties want to create a secret shared key by using a channel that can be eavesdropped.
• Classically: secure if discrete log hard.
• Quantum: secure if quantum mechanics valid [Bennett, Brassard, 1984].
• No extra assumptions needed.
![Page 6: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/6.jpg)
Quantum communication
• Dense coding: 1 quantum bit can encode 2 classical bits.
• Teleportation: quantum states can be transmitted by sending classical information.
• Quantum protocols that send exponentially less bits than classical.
![Page 7: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/7.jpg)
Experiments
• ~10 different ideas how to implement QC.
• NMR, ion traps, optical, semiconductor, etc.
• 7 quantum bit QC [Knill et.al., 2000].
• QKD has been implemented.
![Page 8: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/8.jpg)
Outline
• Today: basic notions, quantum key distribution.
• Tomorrow: quantum algorithms, factoring.
• Friday: current research in quantum cryptography, coin flipping.
![Page 9: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/9.jpg)
Model
• Quantum states
• Unitary transformations
• Measurements
![Page 10: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/10.jpg)
Quantum bit
• 2-dimensional vector of length 1.
• Basis states |0>, |1>.• Arbitrary state:
|0>+|1>, , complex,
||2+ ||2=1.
|1>
|0>
![Page 11: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/11.jpg)
Physical quantum bits
• Nuclear spin = orientation of atom’s nucleus in magnetic field. = |0>, = |1>.
• Photons in a cavity.
• No photon = |0>, one photon = |1>
![Page 12: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/12.jpg)
Physical quantum bits (2)
• Energy states of an atom
• Polarization of photon
• Many others.
|0> |1>
ground state excited state
![Page 13: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/13.jpg)
General quantum states
• k-dimensional quantum system.
• Basis |1>, |2>, …, |k>.
• General state
1|1>+2|2>+…+k|k>,
|1|^2+…+ |k|^2=1
• 2k dimensional system can be constructed as a tensor product of k quantum bits.
![Page 14: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/14.jpg)
Unitary transformations
• Linear transformations that preserve vector norm.
• In 2 dimensions, linear transformations that preserve unit circle (rotations and reflections).
![Page 15: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/15.jpg)
Examples
• Bit flip
• Hamamard transform
0|1|
1|0|
1|2
10|
2
11|
1|2
10|
2
10|
![Page 16: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/16.jpg)
Linearity
• Bit flip
|0>|1>
|1>|0>
By linearity,|0>+|1> |1>+|0>
Sufficient to specify U|0>, U|1>.
![Page 17: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/17.jpg)
Examples
|1>
|0>
1|2
10|
2
1
1|2
10|
2
1
![Page 18: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/18.jpg)
• Measuring |0>+|1> in basis |0>, |1> gives: 0 with probability | |2, 1 with probability | |2.
• Measurement changes the state: it becomes |0> or |1>.
• Repeating measurement gives the same outcome.
Measurements
![Page 19: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/19.jpg)
Measurements
1|2
10|
2
1Probability 1/2
Probability 1/2
|0>
|1>
![Page 20: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/20.jpg)
General measurements
• Let |0>, | 1> be two orthogonal one-qubit
states.• Then,
|> = 0|0> + 1|1>.
• Measuring | > gives | i> with probability |i|2.
• This is equivalent to mapping |0>, | 1> to |0>, |1> and then measuring.
![Page 21: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/21.jpg)
Measurements
1|2
10|
2
1
1|2
10|
2
1
Probability 1
![Page 22: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/22.jpg)
Measurements
1|2
10|
2
1 1|
2
10|
2
1
Probability 1/2Probability 1/2
|1>
![Page 23: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/23.jpg)
Measurements
• Measuring
1|1>+2|2>+…+k|k>
in the basis |1>, |2>, …, |k> gives |i> with probability |i|2.
• Any orthogonal basis can be used.
![Page 24: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/24.jpg)
Partial measurements
• Example: two quantum bits, measure first.
102
101
2
100
2
1
01|2
100|
2
1 10|
Result 0 Result 1
![Page 25: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/25.jpg)
Classical vs. Quantum
Classical bits:• can be measured
completely,• are not changed by
measurement,• can be copied,• can be erased.
Quantum bits:• can be measured
partially,• are changed by
measurement,• cannot be copied,• cannot be erased.
![Page 26: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/26.jpg)
Copying
One nuclear spin Two spins
Impossible!
?
Related to impossiblity of measuring a state perfectly.
![Page 27: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/27.jpg)
No-cloning theorem
• Imagine we could copy quantum states.
• Then, by linearity
• Not the same as two copies of |0>+|1>.
1|1|2
10|0|
2
11|
2
10|
2
1
1|1|1|
0|0|0|
![Page 28: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/28.jpg)
Key distribution
• Alice and Bob want to create a shared secret key by communicating over an insecure channel.
• Needed for symmetric encryption (one-time pad, DES etc.).
![Page 29: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/29.jpg)
Key distribution
• Can be done classically.
• Needs hardness assumptions.
• Impossible classically if adversary has unlimited computational power.
• Quantum protocols can be secure against any adversary.
• The only assumption: quantum mechanics.
![Page 30: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/30.jpg)
BB84 states
1|2
10|
2
1
1|2
10|
2
1|> = |1>
|> = |0>
| >=| >=
![Page 31: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/31.jpg)
BB84 QKD
...
...
...No Yes Yes Yes
...
0 0 1
Alice Bob
![Page 32: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/32.jpg)
BB84 QKD
• Alice sends n qubits.
• Bob chooses the same basis n/2 times.
• If there is no eavesdropping/transmission errors, they share the same n/2 bits.
![Page 33: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/33.jpg)
Eavesdropping
• Assume that Eve measures some qubits in , | basis and resends them.
• If the qubit she measures is |> or |>, Eve resends a different state ( or | ).
• If Bob chooses |>, |> basis, he gets each answer with probability 1/2.
• With probability 1/2, Alice and Bob have different bits.
![Page 34: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/34.jpg)
Eavesdropping
• Theorem: Impossible to obtain information about non-orthogonal states without disturbing them.
• In this protocol:
![Page 35: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/35.jpg)
Check for eavesdropping
• Alice randomly chooses a fraction of the final string and announces it.
• Bob counts the number of different bits.
• If too many different bits, reject (eavesdropper found).
• If Eve measured many qubits, she gets caught.
![Page 36: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/36.jpg)
Next step
• Alice and Bob share a string most of which is unknown to Eve.
• Eve might know a few bits.
• There could be differences due to transmission errors.
![Page 37: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/37.jpg)
Classical post-processing
• Information reconciliation: Alice and Bob apply error correcting code to correct transmission errors.
• They now have the same string but small number of bits might be known to Eve.
• Privacy amplification: apply a hash function to the string.
![Page 38: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/38.jpg)
QKD summary
• Alice and Bob generate a shared bit string by sending qubits and measuring them.
• Eavesdropping results in different bits.
• That allows to detect Eve.
• Error correction.
• Privacy amplification (hashing).
![Page 39: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/39.jpg)
Eavesdropping models
• Simplest: Eve measures individual qubits.
• Most general: coherent measurements.
• Eve gathers all qubits, performs a joint measurement, resends.
![Page 40: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/40.jpg)
Security proofs
• Mayers, 1998.
• Lo, Chau, 1999.
• Preskill, Shor, 2000.
• Boykin et.al., 2000.
• Ben-Or, 2000.
![Page 41: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/41.jpg)
EPR state
1|1|2
10|0|
2
1
• First qubit to Alice, second to Bob.• If they measure, same answers.
||2
1||
2
1
• Same for infinitely many bases.
![Page 42: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/42.jpg)
Bell’s theorem
• Alice’s basis:
• Bob’s basis: y instead of x. |0>
|1>
1sin0cos xx
1cos0sin xx
![Page 43: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/43.jpg)
Bell’s theorem
yx 2cos2
1
yx 2cos2
1
yx 2sin2
1
yx 2sin2
1
Pr[b=0]
Pr[a=1]
Pr[a=0]
Pr[b=1]
![Page 44: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/44.jpg)
Classical simulation
• Alice and Bob share random variables.
• Someone gives to them x and y.
• Can they produce the right distribution without communication?
![Page 45: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/45.jpg)
Bell’s theorem
• Classical simulation impossible:
• Bell’s inequality: constraint satisfied by any result produced by classical randomness.
4
3,
4,
4
3,
4
yx
![Page 46: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/46.jpg)
Ekert’s QKD
• Alice generates n states
sends 2nd qubits to Bob.
• They use half of states for Bell’s test.
• If test passed, they error-correct/amplify the rest and measure.
1|1|2
10|0|
2
1
![Page 47: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/47.jpg)
Equivalence
• In BB84 protocol, Alice could prepare the state
keep the first register and send the second to Bob.
32
12
2
11
2
10
2
1
![Page 48: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/48.jpg)
Ekert and BB84 states
1|1|2
10|0|
2
1E
32
12
2
11
2
10
2
1BB
32
12
2
11
2
11|
32
12
2
10
2
10|
U
U
UI
![Page 49: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/49.jpg)
QKD summary
• Key distribution requires hardness assumptions classically.
• QKD based on quantum mechanics.
• Higher degree of security.
• Showed two protocols for QKD.
![Page 50: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/50.jpg)
QKD implementations
• First: Bennett et.al., 1992.
• Currently: 67km, 1000 bits/second.
• Commercially available: Id Quantique, 2002.
![Page 51: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/51.jpg)
Quantum Factoring
![Page 52: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/52.jpg)
Quantum Algorithms
Quantum Algorithms should exploit quantum parallelism and quantum interference.
We have already seen some elementary algorithms.
![Page 53: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/53.jpg)
Quantum Algorithms
These algorithms have been computing essentially classical functions on quantum superpositions
This encoded information in the phases of the basis states: measuring basis states would provide little useful information
But a simple quantum transformation translated the phase information into information that was measurable in the computational basis
![Page 54: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/54.jpg)
Extracting phase information with the Hadamard operation
nH
nH
x y
yx
ny)1(
2
1
y
yx
ny)1(
2
1x
![Page 55: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/55.jpg)
Overview
Quantum Phase Estimation Eigenvalue Kick-back Eigenvalue estimation and order-findi
ng/factoring Shor’s approach Discrete Logarithm and Hidden Subgr
oup Problem (if there’s time)
![Page 56: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/56.jpg)
Quantum Phase Estimation
Suppose we wish to estimate a numbergiven the quantum state )1,0[
12
0y
i2n
yye
Note that in binary we can express321 xxx.0
321 xx.x2
1nn1n3211n xx.xxxx2
![Page 57: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/57.jpg)
Quantum Phase Estimation
1e ik2 Since for any integer k, we have
...)xx.0(i2...)xx.0(i2ix2...)xx.x(i2)(i2 32321321 eeee2e
...)xx.0(i2)k(i2 2k1ke2e
![Page 58: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/58.jpg)
Quantum Phase Estimation
1x.0 If then we can do the following
H 1x2
1)1(02
1e0
1
1
x
)x.0(i2
![Page 59: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/59.jpg)
Useful identity
We can show that
1e0
1e01e0
1e0
1e01e0
yye
...)xx.0(i2
...)xxx.0(i2...)xx.0(i2
)(i2
)2n2(i2)1n2(i2
12
0y
i2
21
1nn1n1nn
n
![Page 60: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/60.jpg)
Quantum Phase Estimation
21xx.0 So if then we can do the following
H 2x
2
1e0 )xx.0(i2 21
2
1e0 )x.0(i2 2
H 1x12R
k2/i2k e0
01R
![Page 61: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/61.jpg)
Quantum Phase Estimation
321 xxx.0 So if then we can do the following
H 3x
2
1e0 )xx.0(i2 32
2
1e0 )x.0(i2 3
H 2x12R
2
1e0 )xxx.0(i2 321H 1x1
2R 13R
![Page 62: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/62.jpg)
Quantum Phase Estimation
Generalizing this network (and reversing the order of the qubits at the end) gives us a network with O(n2) gates that implements
xyyx
e12
0y
n2i2
n
![Page 63: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/63.jpg)
Discrete Fourier Transform
The discrete Fourier transform maps vectors of dimension N by transforming the elementary vector according to
1N
0y
Ni2
yyx
ex
)e,,e,e,1()0,...0,1,0,...,0,0( Nx)1N(
i2Nx2
i2Nx
i2
thx
The quantum Fourier transform maps vectors in a Hilbert space of dimension N according to
![Page 64: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/64.jpg)
Discrete Fourier Transform
Thus we have illustrated how to implement (the inverse of) the quantum Fourier transform in a Hilbert space of dimension 2n
![Page 65: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/65.jpg)
Estimating arbitrary
What if is not necessarily of the formfor some integer x?
)1,0[
12
0x
i2n
zze The QFT will map to a
superposition
n2x
where
y
y y~
Ny
1Oy2
8N1
Ny
obPr
![Page 66: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/66.jpg)
For any real
Quantum Phase Estimation
H
1x
2
10 22 )( ie
2
10 42 )( ie
H 2x12R
2
1e0 )(i2
H
3x
12R 1
3R
)1,0[
With high probability ω8
24 321 xxx
![Page 67: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/67.jpg)
Recall the “trick”:
Eigenvalue kick-back
x
)x(f10
x)1( )x(f
)10(x)1(
)10()1(x)x(f
)x(f
10
)1)x(f)x(f(x)10(x
![Page 68: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/68.jpg)
Consider a unitary operation U with eigenvalue and eigenvector
Eigenvalue kick-back
i2e 1
1e i2
1e
e1i2
i2 U11
U
![Page 69: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/69.jpg)
Eigenvalue kick-back
0
0
U
![Page 70: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/70.jpg)
Eigenvalue kick-back
10
1e0 i2
U
As a relative phase, becomes measurable
i2e
![Page 71: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/71.jpg)
If we exponentiate U, we get multiples of
Eigenvalue kick-back
1
1xe i2
xU
![Page 72: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/72.jpg)
Eigenvalue kick-back
10
1xe0 i2
xU
![Page 73: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/73.jpg)
Eigenvalue kick-back
10
1e0 i2
U
10 1e0 )2(i2 1n
10
10 1e0 )2(i2
U2U U
1n2 2n2
1e0 )2(i2 2n
![Page 74: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/74.jpg)
Phase estimation
1e0 i2
1e0 )2(i2 1n
1e0 )2(i2
1e0 )2(i2 2n
H
1x
H
2x
12R
nn2
2n1
1n
2
xx2x2
nx
12R 1
3R
1nx
H
![Page 75: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/75.jpg)
Eigenvalue estimation
10
10
2U U 4U
10 H
1x
2x12R
H
3x
12R 1
3R
H
![Page 76: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/76.jpg)
Eigenvalue estimation
xU
0
1x
2x
3x
00
8QFT 18QFT
![Page 77: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/77.jpg)
Eigenvalue estimation
U Given with eigenvector and eigenvalue we thus have an algorithm that maps
i2e
~0 IQFT,Uc,IQFT 1x
![Page 78: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/78.jpg)
Eigenvalue kick-back
U Given with eigenvectors and respective eigenvalues we thus have an algorithm that maps
kki2
e
kkk~0
k
kkkk
kkk
kk~00
and therefore
![Page 79: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/79.jpg)
Eigenvalue kick-back
Measuring the first register of
k
kkk~
is equivalent to measuring with probability
k~
2
k
kkkk
kkkk
kkkk
Tr
~~
~~ *
22
i.e.
![Page 80: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/80.jpg)
Example
Suppose we have a group and we wish to find the order of (I.e. the smallest positive such that )
If we can efficiently do arithmetic in the group, then we can realize a unitary operator that maps
Notice that
GGa
r 1ar
aU axx I
aUaU r
r
This means that the eigenvalues of are of the form where k is an integer
aU
rki2
e
![Page 81: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/81.jpg)
(Aside: more on reversible computing)
If we know how to efficiently compute and then we can efficiently and reversibly map
x
bfU
x
)(xfb
c
y1f
U)(1 yfc
y
f1f
![Page 82: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/82.jpg)
(Aside: more on reversible computing)
And therefore we can efficiently map
x
0fU 1f
U0
)(xf
)(xfx
![Page 83: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/83.jpg)
Example
Let Then We can easily implement, for example,
14,13,12,11 2441
5mod}4,3,2,1{ZG *5
010001U2
The eigenvectors of include
100001U 22
011001U 32
2U
00100142 U
2U
5mod2e j3
0j
4
jki2
k
![Page 84: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/84.jpg)
Example
011e100e010e001
011e100e010e001
41
i242
i243
i2
49
i246
i243
i2
3
![Page 85: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/85.jpg)
Example
343
i2
41
i242
i243
i243
i2
41
i242
i243
i2
32
e
)001011e100e010e(e
001e011e100e010
U
![Page 86: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/86.jpg)
Example
343
i2
32
242
i2
22
141
i2
12
002
eU
eU
eU
U
00121
3210
![Page 87: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/87.jpg)
Example
343
i2
32
242
i2
22
141
i2
12
002
1e010Uc
1e010Uc
1e010Uc
1010Uc
![Page 88: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/88.jpg)
Example
342
i2
32
2
222
2
142
i2
12
2
002
2
1e010Uc
1010Uc
1e010Uc
1010Uc
![Page 89: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/89.jpg)
Eigenvalue Kickback
10
3
10
22U 2U
1e0 )1.0(i2
1e0 )11.0(i2
![Page 90: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/90.jpg)
Eigenvalue Kickback
10
3
10
22U 2U
1H12R
H
3
1
1123
![Page 91: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/91.jpg)
Eigenvalue Kickback
10
k
10
22U 2U
1kH12R
H
k
2k
21 kk2k
![Page 92: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/92.jpg)
Eigenvalue Kickback
10
3
0kk2
1
1
10
22U 2U
H12R
H
3
0kkk
21
![Page 93: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/93.jpg)
Quantum Factoring
• The security of many public key cryptosystems used in industry today relies on the difficulty of factoring large numbers into smaller factors.
• Factoring the integer N into smaller factors can be reduced to the following task: Given integer a, find the smallest positive integer r so that ar Nmod1
![Page 94: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/94.jpg)
Example
Let We can easily implement
1ar *NZGa
axxUa
The eigenvectors of include
xaxa
UxU 22
2a
aUj
1r
0j
r
jki2
k ae
xaxa
UxUn2
n2
n2a
![Page 95: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/95.jpg)
Example
krki2
1rrk)1r(
i22rk2
i2rki2
rki2
rrk)1r(
i23rk2
i22rki2
1rrk)1r(
i22rk2
i2rki2
aka
e
)aeaeae1(e
aeaeaea
)aeaeae1(UU
![Page 96: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/96.jpg)
Example
1r1
1r210
krk2
i2
kj21e010
aUc
j
![Page 97: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/97.jpg)
Eigenvalue kick-back
U Given with eigenvectors and respective eigenvalues we thus have an algorithm that maps
krki2
e
kk rk~
0
k
kkk
kkk
kk rk~
00
and therefore
![Page 98: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/98.jpg)
Eigenvalue Estimation
10
1r
0kkr
1
1
10
22U 2U
n21QFT
1r
0kkr
k~
21
10
2U21n
![Page 99: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/99.jpg)
Eigenvalue kick-back
Measuring the first register of
k
krk~
r1
is equivalent to measuring with probability r
k~
r1
![Page 100: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/100.jpg)
Finding r
For most integers k, a good estimate of
(with error at most ) allows us to determine r (even if we don’t know k). (using continued fractions)
rk
2r21
![Page 101: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/101.jpg)
(aside: how does factoring reduce to order-finding??)
• The most common approach for factoring integers is the difference of squares technique:– “Randomly” find two integers x and y
satisfying
– So N divides– Hope that is non-trivial
• If r is even, then let so that
Nyx mod22
),gcd( yxN ))((22 yxyxyx
Nax r mod2/Nx mod122
![Page 102: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/102.jpg)
Shor’s approach
This eigenvalue estimation approach is not the original approach discovered by Shor
Kitaev developed an eigenvalue estimation approach (to the more general “Hidden Stabilizer Problem”)
We’ve presented the CEMM version here
![Page 103: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/103.jpg)
Discrete Fourier Transform
The discrete Fourier transform maps uniform periodic states, say with period r dividing N, and offset w, to a periodic state with period N/r.
),0,0,,0,0,,0,0,1(
1
)0,1,0,0,0,1,0,0,0,1,0,0(
12
222
rwr
irw
irwi
eeer
Nr
![Page 104: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/104.jpg)
Discrete Fourier Transform
1
0
21
0
r
k
irN
x
krNr
wk
ewxrNr
The quantum Fourier transform maps vectors in a Hilbert space of dimension N according to
![Page 105: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/105.jpg)
Shor’s Factoring Algorithm
x
/\x /
\ax
/\
/\a
y
r y
( ) /\a
r0
r r1 k
F-1
w0w
0w
x
/\x /
\1w
w
1r
1r
![Page 106: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/106.jpg)
Network for Shor’s Factoring Algorithm
U
F-1
x
F
a/\1
/\0
![Page 107: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/107.jpg)
Eigenvalue Estimation Factoring Algorithm
( ) /\
kk r
k
x /
\xk
e2π ix
rk
/\
k
/\0 /
\1 x /
\xk
/\
k
![Page 108: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/108.jpg)
Network for Eigenvalue Estimation Factoring Algorithm
U
F-1
x
F
a/\1
/\0
![Page 109: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/109.jpg)
Equivalence of Shor&CEMM Shor analysis CEMM analysis
s
s010
s
sxx
xx 1
ss
x
r
sxix
r
x k
xeaxrk 21
0
ss
xr
x
a 1
0 r
s
r
k
rrr
210
![Page 110: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/110.jpg)
Equivalence of Shor&CEMM Shor analysis CEMM analysis
ss
xr
x
a 1
0
s
r
x
1
0
r
k
rrr
210 r
s
r
k
rrr
210 r
k
rrr
210 r
s
r
s
![Page 111: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/111.jpg)
Consider two elements from a group G satisfying
Find s.
Gba ,
1rasab
xU xaa
Discrete Logarithm Problem
![Page 112: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/112.jpg)
Discrete Logarithm Problem
We know has eigenvectorsUa
Ua kk k
i2π
e r
j1r
0j
r
kji2-
k aeψ
![Page 113: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/113.jpg)
Discrete Logarithm Problem
Thus has the same eigenvectors but with eigenvalues exponentiated to the power of s
Ub
Ub kkk ψψψ ks
i2π
erU sa
![Page 114: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/114.jpg)
Discrete Logarithm Problem
1 kΨxaU
k0rF
1rF
![Page 115: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/115.jpg)
Discrete Logarithm Problem
kΨkΨx
bU
ks0rF
1rF
Given k and ks, we can compute s mod r (provided k and r are coprime)
![Page 116: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/116.jpg)
Abelian Hidden Subgroup Problem
f ( ) f ( )x
f :
Z Z ZM MM
1
. . .
nG
G X
y iff x y-
KG
K
Find generators for K
0
![Page 117: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/117.jpg)
Network for AHS
U
F-1F/
\0
f
![Page 118: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/118.jpg)
AHS Algorithm in standard basis
( )s
/\
x
/\x /
\f ( )x
f ( )w
s s0
1n
w
F-
/\f ( )ww
/\w K
1
K
![Page 119: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/119.jpg)
AHS for in eigenbasis
/\
( )
s K /\f ( )x- )1(
x.ss
s ss/\
is an eigenvector of f ( )x f ( )x y
x
/\x /
\f ( )xF
-
(Simon’s Problem)
nZ
2
1
K
![Page 120: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/120.jpg)
Other applications of Abelian HSP
• Any finite Abelian group G is the direct sum of finite cyclic groups
• But finding generators satisfying is not always easy, e.g.
for it’s as hard as factoring N• Given any polynomial sized set of generators,
we can use the Abelian HSP algorithm to find new generators that decompose G into a direct sum of finite cyclic groups.
nggg 21
nggg ,,, 21
ngggG 21
*NZG
![Page 121: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/121.jpg)
Examples:
Deutsch’s Problem: }1,0{G X
K }1,0{
}1,0{
}0{ or
Order finding: ZGf
X
)x( K rZ
any group
ax
![Page 122: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/122.jpg)
Example:
Discrete Log of to base :
G rr ZZ X any group
b a
f )y,x( ax by
K 1,
ak
k
![Page 123: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/123.jpg)
Examples:
Self-shift equivalences: n)q(GFG
f
]X,...,X,X)[q(GFX n21
)a,...,a,a( n21
K
)aX,...,aX(P nn11
)}X,...,X(P)aX,...,aX(P
:)a,...,a{(
n1nn11
n1
![Page 124: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/124.jpg)
What about non-Abelian HSP
• Consider the symmetric group• Sn is the set of permutations of n elements• Let G be an n-vertex graph• Let
• Define• Then where
nSG
}|)({ nG SGX ππ
)(GfG ππ GnG XSf :
KKff GG 2121 ππππ GGGAUTK ππ |)(
![Page 125: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/125.jpg)
Graph automorphism problem
• So the hidden subgroup of is the automorphism group of G
• This is a difficult problem in NP that is believed not to be in BPP and yet not NP-complete.
Gf
![Page 126: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/126.jpg)
Other
Progress on the Hidden Subgroup Problem in non-Abelian groups (not an exhaustive list)•Ettinger, Hoyer arxiv.gov/abs/quant-ph/9807029•Roetteler,Beth quant-ph/9812070•Ivanyos,Magniez,Santha arxiv.org/abs/quant-ph/0102014•Friedl,Ivanyos,Magniez,Santha,Sen quant-ph/0211091 (Hidden Translation and Orbit Coset in Quantum Computing); they show e.g. that the HSP can be solved for solvable groups with bounded exponent and of bounded derived series•Moore,Rockmore,Russell,Schulman, quant-ph/0211124
![Page 127: Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful](https://reader034.vdocuments.us/reader034/viewer/2022051116/5697bf821a28abf838c86022/html5/thumbnails/127.jpg)