Classical boson sampling algorithms with superior performance to near-term experiments

A classical algorithm solves the boson sampling problem for 30 bosons with standard computing hardware, suggesting that a much larger experimental effort will be needed to reach a regime where quantum hardware outperforms classical methods. It is predicted that quantum computers will dramatically ou...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Nature physics Ročník 13; číslo 12; s. 1153 - 1157
Hlavní autoři: Neville, Alex, Sparrow, Chris, Clifford, Raphaël, Johnston, Eric, Birchall, Patrick M., Montanaro, Ashley, Laing, Anthony
Médium: Journal Article
Jazyk:angličtina
Vydáno: London Nature Publishing Group UK 01.12.2017
Nature Publishing Group
Témata:
639/624/400/3925
639/624/400/482
639/705/1042
639/766/483/481
Algorithms
Atomic
Bosons
Classical and Continuum Physics
Complex Systems
Computation
Condensed Matter Physics
Experiments
Hardware
letter
Mathematical and Computational Physics
Molecular
Optical and Plasma Physics
Optics
Photonics
Photons
Physics
Quantum computers
Quantum computing
Sampling
Scaling
Theoretical
ISSN:1745-2473, 1745-2481
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:A classical algorithm solves the boson sampling problem for 30 bosons with standard computing hardware, suggesting that a much larger experimental effort will be needed to reach a regime where quantum hardware outperforms classical methods. It is predicted that quantum computers will dramatically outperform their conventional counterparts. However, large-scale universal quantum computers are yet to be built. Boson sampling 1 is a rudimentary quantum algorithm tailored to the platform of linear optics, which has sparked interest as a rapid way to demonstrate such quantum supremacy 2 , 3 , 4 , 5 , 6 . Photon statistics are governed by intractable matrix functions, which suggests that sampling from the distribution obtained by injecting photons into a linear optical network could be solved more quickly by a photonic experiment than by a classical computer. The apparently low resource requirements for large boson sampling experiments have raised expectations of a near-term demonstration of quantum supremacy by boson sampling 7 , 8 . Here we present classical boson sampling algorithms and theoretical analyses of prospects for scaling boson sampling experiments, showing that near-term quantum supremacy via boson sampling is unlikely. Our classical algorithm, based on Metropolised independence sampling, allowed the boson sampling problem to be solved for 30 photons with standard computing hardware. Compared to current experiments, a demonstration of quantum supremacy over a successful implementation of these classical methods on a supercomputer would require the number of photons and experimental components to increase by orders of magnitude, while tackling exponentially scaling photon loss.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1745-2473
1745-2481
DOI:10.1038/nphys4270