Quantum Computing with Noninteracting Particles
description
Transcript of Quantum Computing with Noninteracting Particles
![Page 1: Quantum Computing with Noninteracting Particles](https://reader036.fdocuments.us/reader036/viewer/2022081801/56814f82550346895dbd360c/html5/thumbnails/1.jpg)
Quantum Computing with Noninteracting Particles
Alex Arkhipov
![Page 2: Quantum Computing with Noninteracting Particles](https://reader036.fdocuments.us/reader036/viewer/2022081801/56814f82550346895dbd360c/html5/thumbnails/2.jpg)
Noninteracting Particle Model
• Weak model of QC– Probably not universal– Restricted kind of entanglement– Not qubit-based
• Why do we care?– Gains with less quantum– Easier to build– Mathematically pretty
![Page 3: Quantum Computing with Noninteracting Particles](https://reader036.fdocuments.us/reader036/viewer/2022081801/56814f82550346895dbd360c/html5/thumbnails/3.jpg)
Classical Analogue
![Page 4: Quantum Computing with Noninteracting Particles](https://reader036.fdocuments.us/reader036/viewer/2022081801/56814f82550346895dbd360c/html5/thumbnails/4.jpg)
Balls and Slots
![Page 5: Quantum Computing with Noninteracting Particles](https://reader036.fdocuments.us/reader036/viewer/2022081801/56814f82550346895dbd360c/html5/thumbnails/5.jpg)
Transition Matrix
![Page 6: Quantum Computing with Noninteracting Particles](https://reader036.fdocuments.us/reader036/viewer/2022081801/56814f82550346895dbd360c/html5/thumbnails/6.jpg)
A Transition Probability
?
![Page 7: Quantum Computing with Noninteracting Particles](https://reader036.fdocuments.us/reader036/viewer/2022081801/56814f82550346895dbd360c/html5/thumbnails/7.jpg)
A Transition Probability
![Page 8: Quantum Computing with Noninteracting Particles](https://reader036.fdocuments.us/reader036/viewer/2022081801/56814f82550346895dbd360c/html5/thumbnails/8.jpg)
A Transition Probability
![Page 9: Quantum Computing with Noninteracting Particles](https://reader036.fdocuments.us/reader036/viewer/2022081801/56814f82550346895dbd360c/html5/thumbnails/9.jpg)
A Transition Probability
![Page 10: Quantum Computing with Noninteracting Particles](https://reader036.fdocuments.us/reader036/viewer/2022081801/56814f82550346895dbd360c/html5/thumbnails/10.jpg)
A Transition Probability
![Page 11: Quantum Computing with Noninteracting Particles](https://reader036.fdocuments.us/reader036/viewer/2022081801/56814f82550346895dbd360c/html5/thumbnails/11.jpg)
A Transition Probability
![Page 12: Quantum Computing with Noninteracting Particles](https://reader036.fdocuments.us/reader036/viewer/2022081801/56814f82550346895dbd360c/html5/thumbnails/12.jpg)
A Transition Probability
![Page 13: Quantum Computing with Noninteracting Particles](https://reader036.fdocuments.us/reader036/viewer/2022081801/56814f82550346895dbd360c/html5/thumbnails/13.jpg)
Probabilities for Classical Analogue
![Page 14: Quantum Computing with Noninteracting Particles](https://reader036.fdocuments.us/reader036/viewer/2022081801/56814f82550346895dbd360c/html5/thumbnails/14.jpg)
Probabilities for Classical Analogue
• What about other transitions?
?
?
![Page 15: Quantum Computing with Noninteracting Particles](https://reader036.fdocuments.us/reader036/viewer/2022081801/56814f82550346895dbd360c/html5/thumbnails/15.jpg)
Configuration TransitionsTransition
matrix for one ball
m=3, n=1
Transition matrix for two-ball configurations
m=3, n=2
![Page 16: Quantum Computing with Noninteracting Particles](https://reader036.fdocuments.us/reader036/viewer/2022081801/56814f82550346895dbd360c/html5/thumbnails/16.jpg)
Classical Model Summary
• n identical balls• m slots• Choose start configuration• Choose stochastic transition matrix M• Move each ball as per M• Look at resulting configuration
![Page 17: Quantum Computing with Noninteracting Particles](https://reader036.fdocuments.us/reader036/viewer/2022081801/56814f82550346895dbd360c/html5/thumbnails/17.jpg)
Quantum Model
![Page 18: Quantum Computing with Noninteracting Particles](https://reader036.fdocuments.us/reader036/viewer/2022081801/56814f82550346895dbd360c/html5/thumbnails/18.jpg)
Quantum Particles
• Two types of particle: Bosons and Fermions
Bosons Fermions
(Slide concept by Scott Aaronson)
![Page 19: Quantum Computing with Noninteracting Particles](https://reader036.fdocuments.us/reader036/viewer/2022081801/56814f82550346895dbd360c/html5/thumbnails/19.jpg)
Identical Bosons
?
![Page 20: Quantum Computing with Noninteracting Particles](https://reader036.fdocuments.us/reader036/viewer/2022081801/56814f82550346895dbd360c/html5/thumbnails/20.jpg)
Identical Fermions
?
![Page 21: Quantum Computing with Noninteracting Particles](https://reader036.fdocuments.us/reader036/viewer/2022081801/56814f82550346895dbd360c/html5/thumbnails/21.jpg)
Algebraic Formalism
• Modes are single-particle basis states Variables
• Configurations are multi-particle basis states Monomials
• Identical bosons commute
• Identical fermions anticommute
![Page 22: Quantum Computing with Noninteracting Particles](https://reader036.fdocuments.us/reader036/viewer/2022081801/56814f82550346895dbd360c/html5/thumbnails/22.jpg)
Example: Hadamarding Bosons
Hong-Ou-Mandel dip
![Page 23: Quantum Computing with Noninteracting Particles](https://reader036.fdocuments.us/reader036/viewer/2022081801/56814f82550346895dbd360c/html5/thumbnails/23.jpg)
Example: Hadamarding Fermions
![Page 24: Quantum Computing with Noninteracting Particles](https://reader036.fdocuments.us/reader036/viewer/2022081801/56814f82550346895dbd360c/html5/thumbnails/24.jpg)
Definition of Model
x2
x2
x1
x4
x5
n particles
Initial configuration
U
U
U
U
U
m×m unitary
![Page 25: Quantum Computing with Noninteracting Particles](https://reader036.fdocuments.us/reader036/viewer/2022081801/56814f82550346895dbd360c/html5/thumbnails/25.jpg)
Complexity
![Page 26: Quantum Computing with Noninteracting Particles](https://reader036.fdocuments.us/reader036/viewer/2022081801/56814f82550346895dbd360c/html5/thumbnails/26.jpg)
Complexity Comparison
Particle: Fermion Classical Boson
Function: Det Perm Perm
Matrix: Unitary Stochastic Unitary
Compute probability: In P Approximable
[JSV ‘01]#P-complete
[Valiant ‘79]
Sample: In BPP[Valiant ‘01]
In BPP Not in BPP [AA ‘10 in prep]
Adaptive → BQP[KLM ‘01]
![Page 27: Quantum Computing with Noninteracting Particles](https://reader036.fdocuments.us/reader036/viewer/2022081801/56814f82550346895dbd360c/html5/thumbnails/27.jpg)
Bosons are Hard: Proof• Classically simulate identical bosons
• Using NP oracle, estimate AAAAAAA XXXXXXXXXXX
• Compute permanent in BPPNP
• P#P lies within BPPNP
• Polynomial hierarchy collapses
Approx counting
Toda’s Theorem
Reductions
Perm is #P-complete
![Page 28: Quantum Computing with Noninteracting Particles](https://reader036.fdocuments.us/reader036/viewer/2022081801/56814f82550346895dbd360c/html5/thumbnails/28.jpg)
Approximate Bosons are Hard: Proof• Classically approximately simulate identical bosons
• Using NP oracle, estimate of random M with high probability
• Compute permanent in BPPNP
• P#P lies within BPPNP
• Polynomial hierarchy collapses
+ conjectures
Approx counting
Toda’s Theorem
Random self-reducibility
Perm is #P-complete
![Page 29: Quantum Computing with Noninteracting Particles](https://reader036.fdocuments.us/reader036/viewer/2022081801/56814f82550346895dbd360c/html5/thumbnails/29.jpg)
Experimental Prospects
![Page 30: Quantum Computing with Noninteracting Particles](https://reader036.fdocuments.us/reader036/viewer/2022081801/56814f82550346895dbd360c/html5/thumbnails/30.jpg)
Linear Optics• Photons and half-silvered mirrors
• Beamsplitters + phaseshifters are universal
![Page 31: Quantum Computing with Noninteracting Particles](https://reader036.fdocuments.us/reader036/viewer/2022081801/56814f82550346895dbd360c/html5/thumbnails/31.jpg)
Challenge: Do These Reliably
• Encode values into mirrors• Generate single photons• Have photons hit mirrors at same time• Detect output photons
![Page 32: Quantum Computing with Noninteracting Particles](https://reader036.fdocuments.us/reader036/viewer/2022081801/56814f82550346895dbd360c/html5/thumbnails/32.jpg)
Proposed Experiment
• Use m=20, n=10• Choose U at random• Check by brute force!