As a service to the community this article is available to view for free. Use your via AAAS ID to log in or register for a free account

Via your Institution

Log in through your institution

If your organization uses OpenAthens, you can log in using your OpenAthens username and password. To check if your institution is supported, please see this list. Contact your library for more details.

Log in through your institution

You may be able to gain access using your login credentials for your institution. Contact your library if you do not have a username and password.

Free with registration

Science research is available free with registration one year after initial publication. To get your free access please visit our registration form.

Abstract

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.