Pattern Recognition Techniques for Boson Sampling Validation Iris Agresti 1 , Niko Viggianiello 1 , Fulvio Flamini 1 , Nicolò Spagnolo 1 , Andrea Crespi 2,3 , Roberto Osellame 2,3 , Nathan Wiebe 4 , Fabio Sciarrino 1 www.quantumlab.it 1. Dipartimento di fisica, Sapienza Università di Roma 2. Istituto di Fotonica e Nanotecnologie, Consiglio Nazionale delle Ricerche (IFN-CNR) 3. Dipartimento di Fisica, Politecnico di Milano 4. Station Q Quantum Architectures and Computation Group, Microsoft Research Verona QML 2017 6/11/2017
23
Embed
Pattern Recognition Techniques for Boson Sampling Validationqtml2017.di.univr.it/resources/Slides/Pattern-recognition...Pattern Recognition Techniques for Boson Sampling Validation
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Pattern Recognition Techniques
for Boson Sampling Validation
Iris Agresti1, Niko Viggianiello1, Fulvio Flamini1,
Nicolò Spagnolo1, Andrea Crespi2,3, Roberto Osellame2,3,
Nathan Wiebe4, Fabio Sciarrino1
www.quantumlab.it
1. Dipartimento di fisica, Sapienza Università di Roma
2. Istituto di Fotonica e Nanotecnologie, Consiglio Nazionale delle Ricerche (IFN-CNR)
3. Dipartimento di Fisica, Politecnico di Milano
4. Station Q Quantum Architectures and Computation Group, Microsoft Research
Verona QML 20176/11/2017
vs.
Can quantum computation
outperform classical computation?
Can quantum computation
outperform classical computation?
vs.
EXTENDED CHURCH TURING THESIS
A probabilistic Turing machine can
EFFICIENTLY simulate any
realistic model of computation
Can quantum computation
outperform classical computation?
Boson Sampling Problem
Unitary
Tranformation
INPUT
|𝒏𝟏… 𝒏𝒎 >
OUTPUT
𝒊=𝟏
𝑵𝑺
γ𝑺 |𝒏𝟏𝑺… 𝒏𝒎
𝑺 >
We want to sample the output probability
Proposed in 2010
by Scott Aaronson and Alex Arkhipov
The computational complexity of linear optics, 2011,
Proceedings of the 43rd Annual ACM Symposium on Theory of Computing