Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Bulletin of the American Physical Society

Efficient and stringent certification of boson sampling in symmetric waveguide lattices

Robert Keil, Christoph Dittel, Thomas Kauten, Gregor Weihs, Armando Pérez-Leija, Steffen Weimann, Maxime Lebugle, Alexander Szameit, Malte C. Tichy

Published Jun 11, 2015• 0 citations
OpenAlex

Related papers

A novel computational approach towards the certification of large-scale boson sampling

Joonsuk Huh

Bulletin of the American Physical Society•Mar 18, 2016•0 citations

Boson sampling of many-body quantum random walkers on a lattice

Gopikrishnan Muraleedharan, Akimasa Miyake, Ivan Deutsch

Bulletin of the American Physical Society•Mar 14, 2017•0 citations

Boson sampling of multiple quantum random walkers on a lattice

Gopikrishnan Muraleedharan, Ivan Deutsch, Akimasa Miyake

Bulletin of the American Physical Society•Mar 7, 2018•0 citations

Efficient Certification of Boson Sampling in Waveguide Lattices with parity-like Symmetry

Christoph Dittel, Robert Keil, Malte C. Tichy +6 more

The goal of universal quantum computing that challenges classical computation is still far from being reached. However, Aaronson and Arkhipov recently proposed a nonuniversal quantum computer [1] to solve sampling problems of identical bosons in linear-optical networks which are intractable for classical computers. Once outperforming the classically computable limit of such a boson-sampling device, the very hardness of boson sampling excludes any straightforward efficient verification of the results. A computationally accessible while physically non-trivial instance of the problem was proposed to prove many-particle interference and thereby benchmark the functionality of a candidate device [2]. However, the Fourier matrix proposed in [2] is a highly artificial singular case that remains challenging to implement experimentally.

European Quantum Electronics Conference (EQEC)•Jun 21, 2015•0 citations

Implementation and validation of photonic Boson Sampling

Fulvio Flamini, Fabio Sciarrino

Proceedings of the International School of Physics "Enrico Fermi"•Jan 1, 2018•0 citations

Stringent and Efficient Assessment of Boson-Sampling Devices

Malte C. Tichy, Klaus Mayer, Andreas Buchleitner +1 more

Boson sampling holds the potential to experimentally falsify the extended Church-Turing thesis. The computational hardness of boson sampling, however, complicates the certification that an experimental device yields correct results in the regime in which it outmatches classical computers. To certify a boson sampler, one needs to verify quantum predictions and rule out models that yield these predictions without true many-boson interference. We show that a semiclassical model for many-boson propagation reproduces coarse-grained observables that are proposed as witnesses of boson sampling. A test based on Fourier matrices is demonstrated to falsify physically plausible alternatives to coherent many-boson propagation.

arXiv:1312.3080•Physical Review Letters•Jul 9, 2014•127 citations
The goal of universal quantum computing that challenges classical computation is still far from being reached. However, Aaronson and Arkhipov recently proposed a nonuniversal quantum computer [1] to solve sampling problems of identical bosons in linear-optical networks which are intractable for classical computers. Once outperforming the classically computable limit of such a boson-sampling device, the very hardness of boson sampling excludes any straightforward efficient verification of the results. A computationally accessible while physically non-trivial instance of the problem was proposed to prove many-particle interference and thereby benchmark the functionality of a candidate device [2]. However, the Fourier matrix proposed in [2] is a highly artificial singular case that remains challenging to implement experimentally.
Boson sampling holds the potential to experimentally falsify the extended Church-Turing thesis. The computational hardness of boson sampling, however, complicates the certification that an experimental device yields correct results in the regime in which it outmatches classical computers. To certify a boson sampler, one needs to verify quantum predictions and rule out models that yield these predictions without true many-boson interference. We show that a semiclassical model for many-boson propagation reproduces coarse-grained observables that are proposed as witnesses of boson sampling. A test based on Fourier matrices is demonstrated to falsify physically plausible alternatives to coherent many-boson propagation.