A new way to run a quantum algorithm using much simpler methods than previously thought has been discovered by a team of researchers at the University of Bristol. These findings could dramatically bring forward the development of a 'quantum computer' capable of beating a conventional computer.
Theories show how computing devices that operate according to quantum mechanics can solve problems that conventional (classical) computers, including super computers, can never solve. These theories have been experimentally tested for small-scale quantum systems, but the world is waiting for the first definitive demonstration of a quantum device that beats a classical computer.
Now, researchers from the Centre for Quantum Photonics (CQP) at the University of Bristol together with collaborators from the University of Queensland (UQ) and Imperial College London have increased the likelihood of such a demonstration in the near term by discovering a new way to run a quantum algorithm with much simpler methods than previously thought.
The first definitive defeat for a classical computer could be achieved with a quantum device that runs an algorithm known as Boson Sampling, recently developed by researchers at MIT.
Boson Sampling uses single photons of light and optical circuits to take samples from an exponentially large probability distribution, which has been proven to be extremely difficult for classical computers.
Unlike other quantum algorithms, Boson Sampling has the benefit of being practical for near-term implementations, with the only experimental drawback being the difficulty of generating the dozens of single photons required for the important quantum victory.
However, the Bristol-UQ-Imperial researchers have found that the Boson Sampling algorithm can still be proven to be hard for classical computers when using standard probabilistic methods to generate single photons.
Dr Anthony Laing who led the CQP elements of the research said: "We realised we could chain together many standard two-photon sources in such a way as to give a dramatic boost to the number of photons generated."
Dr Austin Lund from UQ and currently on sabbatical in CQP added: "Once we had the idea for the boosted source, we needed to prove that it could solve a version of the Boson Sampling algorithm. We hope that the last major experimental hurdle has now been overcome."
The research is published this week in Physical Review Letters.
Explore further: Verifying the future of quantum computing
'Boson Sampling from a Gaussian State' by A.-P. Lund, A. Laing, S. Rahimi-Keshari, T. Rudolph, J.-L. O'Brien, and T.-C. Ralph in Phys. Rev. Lett. 113, 100502. journals.aps.org/prl/abstract/ … ysRevLett.113.100502