Journal
SCIENCE
Volume 339, Issue 6121, Pages 798-801Publisher
AMER ASSOC ADVANCEMENT SCIENCE
DOI: 10.1126/science.1231692
Keywords
-
Categories
Funding
- Engineering and Physical Sciences Research Council [EP/C013840/1, EP/H03031X/1, EP/J000051/1]
- European Commission [248095]
- Royal Society
- Air Force Office of Scientific Research (European Office of Aerospace Research and Development)
- European Union [PIIF-GA-2011-300820, PIEF-GA-2010-275103]
- U.S. Air Force Institute of Technology
- Engineering and Physical Sciences Research Council [EP/H03031X/1, EP/C013956/1, EP/C013840/1, EP/E036066/1, EP/J000051/1] Funding Source: researchfish
- EPSRC [EP/C013956/1, EP/H03031X/1, EP/J000051/1, EP/C013840/1, EP/E036066/1] Funding Source: UKRI
Ask authors/readers for more resources
Although universal quantum computers ideally solve problems such as factoring integers exponentially more efficiently than classical machines, the formidable challenges in building such devices motivate the demonstration of simpler, problem-specific algorithms that still promise a quantum speedup. We constructed a quantum boson-sampling machine (QBSM) to sample the output distribution resulting from the nonclassical interference of photons in an integrated photonic circuit, a problem thought to be exponentially hard to solve classically. Unlike universal quantum computation, boson sampling merely requires indistinguishable photons, linear state evolution, and detectors. We benchmarked our QBSM with three and four photons and analyzed sources of sampling inaccuracy. Scaling up to larger devices could offer the first definitive quantum-enhanced computation.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available