Skip to content

On the experimental verification of quantum complexity in linear optics

Research output: Contribution to journalArticle

Original languageEnglish
Pages (from-to)621-626
Number of pages6
JournalNature Photonics
Volume8
Issue number8
DOIs
DatePublished - Aug 2014

Abstract

Quantum computers promise to solve certain problems that are forever intractable to classical computers. The first of these devices are likely to tackle bespoke problems suited to their own particular physical capabilities. Sampling the probability distribution from many bosons interfering quantum-mechanically is conjectured to be intractable to a classical computer but solvable with photons in linear optics. However, the complexity of this type of problem means its solution is mathematically unverifiable, so the task of establishing successful operation becomes one of gathering sufficiently convincing circumstantial or experimental evidence. Here, we develop scalable methods to experimentally establish correct operation for this class of computation, which we implement for three, four and five photons in integrated optical circuits, on Hilbert spaces of up to 50,000 dimensions. Our broad approach is practical for all quantum computational architectures where formal verification methods for quantum algorithms are either intractable or unknown.

Additional information

Comments welcome

    Research areas

  • PHOTONS, INTERFERENCE

Documents

DOI

View research connections

Related faculties, schools or groups