Photonic Boson Sampling in a Tunable Circuit
Matthew A. Broome,Alessandro Fedrizzi,Saleh Rahimi-Keshari,Justin Dove,Scott Aaronson,Timothy C. Ralph,Andrew White +6 more
TL;DR: The central premise of boson sampling was tested, experimentally verifying that three-photon scattering amplitudes are given by the permanents of submatrices generated from a unitary describing a six-mode integrated optical circuit.
read more
Abstract: Quantum computers are unnecessary for exponentially efficient computation or simulation if the Extended Church-Turing thesis is correct. The thesis would be strongly contradicted by physical devices that efficiently perform tasks believed to be intractable for classical computers. Such a task is boson sampling: sampling the output distributions of n bosons scattered by some passive, linear unitary process. We tested the central premise of boson sampling, experimentally verifying that three-photon scattering amplitudes are given by the permanents of submatrices generated from a unitary describing a six-mode integrated optical circuit. We find the protocol to be robust, working even with the unavoidable effects of photon loss, non-ideal sources, and imperfect detection. Scaling this to large numbers of photons should be a much simpler task than building a universal quantum computer.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Linear optical demonstration of quantum speed-up with a single qudit.
TL;DR: It is proved that even a single qudit is enough for designing an oracle-based algorithm which can solve a certain problem twice faster than any classical algorithm.
Non-classical photon correlation in a two-dimensional photonic lattice
Jun Gao,Lu-Feng Qiao,Xiao-Feng Lin,Zhi-Qiang Jiao,Zhen Feng,Zheng Zhou,Zhen-Wei Gao,Xiao-Yun Xu,Yuan Chen,Hao Tang,Xian-Min Jin +10 more
TL;DR: In this article, the authors experimentally observed non-classical correlation of two identical photons in a fully coupled two-dimensional structure, i.e. photonic lattice manufactured by three-dimensional femtosecond laser writing.
Two component quantum walk in one-dimensional lattice with hopping imbalance.
TL;DR: In this article, the authors investigated the two-component quantum walk in one-dimensional lattice and showed that the inter-component interaction strength together with the hopping imbalance between the components exhibit distinct features in the quantum walk for different initial states.
Signatures of Many-Particle Interference
TL;DR: In this paper, the authors introduce the mathematical framework for describing systems of identical particles and explain the notion of indistinguishability, and focus their attention on dynamical systems of free particles and formally introduce the concept of manyparticle interference.
Toward Scalable Boson Sampling with Photon Loss
Hui Wang,Wei Li,Xiao Jiang,Yu-Ming He,Yu-Huai Li,Xing Ding,Ming-Cheng Chen,Jian Qin,Cheng-Zhi Peng,Christian Schneider,Martin Kamp,Wenjun Zhang,H. J. Li,Lixing You,Zujian Wang,Jonathan P. Dowling,Jonathan P. Dowling,Sven Höfling,Sven Höfling,Sven Höfling,Chao-Yang Lu,Jian-Wei Pan +21 more
TL;DR: This experiment uses a quantum-dot-micropillar single-photon source demultiplexed into up to seven input ports of a 16×16 mode ultralow-loss photonic circuit, and detects three-, four- and fivefold coincidence counts, and demonstrates that boson sampling with a few photons lost can increase the sampling rate.
References
Measurement of subpicosecond time intervals between two photons by interference.
TL;DR: A fourth-order interference technique has been used to measure the time intervals between two photons, and by implication the length of the photon wave packet, produced in the process of parametric down-conversion.
4.8K
The complexity of computing the permanent
TL;DR: It is shown that the permanent function of (0, 1)-matrices is a complete problem for the class of counting problems associated with nondeterministic polynomial time computations.
3.3K
Quantum Discord and the Power of One Qubit
TL;DR: In this paper, the authors use quantum discord to characterize the correlations present in the model called deterministic quantum computation with one quantum bit (DQC1), introduced by Knill and Laflamme [1998].
1.4K
The Computational Complexity of Linear Optics
Scott Aaronson,Alex Arkhipov +1 more
TL;DR: In this paper, it was shown that even an approximate or noisy classical simulation would already imply a collapse of the polynomial hierarchy, and hence the hierarchy collapses to the third level.