Related papers: Simulating and assessing boson sampling experiment…
The search for new, application-specific quantum computers designed to outperform any classical computer is driven by the ending of Moore's law and the quantum advantages potentially obtainable. Photonic networks are promising examples,…
A growing cohort of experimental linear photonic networks implementing Gaussian boson sampling (GBS) have now claimed quantum advantage. However, many open questions remain on how to effectively verify these experimental results, as…
BosonSampling is an intermediate model of quantum computation where linear-optical networks are used to solve sampling problems expected to be hard for classical computers. Since these devices are not expected to be universal for quantum…
Boson Sampling is a task that is conjectured to be computationally hard for a classical computer, but which can be efficiently solved by linear-optical interferometers with Fock state inputs. Significant advances have been reported in the…
Universal quantum computers promise a dramatic speed-up over classical computers but a full-size realization remains challenging. However, intermediate quantum computational models have been proposed that are not universal, but can solve…
Many developing quantum technologies make use of quantum networks of different types. Even linear quantum networks are nontrivial, as the output photon distributions can be exponentially complex. Despite this, they can still be…
It is predicted that quantum computers will dramatically outperform their conventional counterparts. However, large-scale universal quantum computers are yet to be built. Boson sampling is a rudimentary quantum algorithm tailored to the…
A universal quantum computer of large scale is not available yet, however, intermediate models of quantum computation would still permit demonstrations of a quantum computational advantage over classical computing and could challenge the…
Boson Sampling is a computational task strongly believed to be hard for classical computers, but efficiently solvable by orchestrated bosonic interference in a specialised quantum computer. Current experimental schemes, however, are still…
Quantum mechanics promises computational powers beyond the reach of classical computers. Current technology is on the brink of an experimental demonstration of the superior power of quantum computation compared to classical devices. For…
The first post-classical computation will most probably be performed not on a universal quantum computer, but rather on a dedicated quantum hardware. A strong candidate for achieving this is represented by the task of sampling from the…
While 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,…
Multiphoton interference is at the very heart of quantum foundations and applications in quantum sensing and information processing. In particular, boson sampling experiments have the potential to demonstrate quantum computational supremacy…
BosonSampling is a problem where a quantum computer offers a provable speedup over classical computers. Its main feature is that it can be solved with current linear optics technology, without the need for a full quantum computer. In this…
BosonSampling is a restricted model of quantum computation proposed recently, where a non-adaptive linear-optical network is used to solve a sampling problem that seems to be hard for classical computers. Here we show that, even if the…
We pose a generalized Boson Sampling problem. Strong evidence exists that such a problem becomes intractable on a classical computer as a function of the number of Bosons. We describe a quantum optical processor that can solve this problem…
Achieving a quantum computational advantage regime, and thus providing evidence against the extended Church-Turing thesis, remains one of the key challenges of modern science. Boson sampling seems to be a very promising platform in this…
We show how phase-space simulations of Gaussian quantum states in a photonic network permit verification of measurable correlations of Gaussian boson sampling (GBS) quantum computers. Our results agree with experiments for up to 100-th…
Quantum computers are expected to be more efficient in performing certain computations than any classical machine. Unfortunately, the technological challenges associated with building a full-scale quantum computer have not yet allowed the…
Boson sampling is a problem intractable for classical computers, but can be naturally solved on a specialized photonic quantum simulator which requires less resources than building a universal quantum computer. The biggest challenge to…