#BosonSampling
#ImageRecognition
#QuantumComputing
Quantum Photonic Processor is set up and ready to go.
Exciting times lie ahead for us at the quantum photonics group of Lehrstuhl für Lasertechnik (LLT) at RWTH Aachen University / Fraunhofer ILT.
#Quantum #QuantumComputing #QuantumPhotonicProcessor #QuantumPhotonics #BosonSampling #QuantumInternet #ScienceCommunication
A new paper from my research group at #INL on #BosonSampling!!
New #QLOC_INL publication! Joint work by my supervisor Ernesto Galvão with Fabio Sciarrino, Nicolò Spagnolo (Rome) and Daniel Brod (UFF).
https://www.nature.com/articles/s41534-023-00676-x
Here they explore how to simulate non-linear photonic gates using linear optics, as a way to gauge the associated complexity. In particular, they look at simulations of non-linear phase gates, and how the complexity is affected by the density of photons in the device.
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 last few years, with demonstrations of small- and medium-scale devices, as well as implementations of variants such as Gaussian Boson Sampling. Besides the relevance of this class of computational models in the quest for unambiguous experimental demonstrations of quantum advantage, recent results have also proposed the first applications for hybrid quantum computing. Here, we introduce the adoption of non-linear photon–photon interactions in the Boson Sampling framework, and analyze the enhancement in complexity via an explicit linear-optical simulation scheme. By extending the computational expressivity of Boson Sampling, the introduction of non-linearities promises to disclose novel functionalities for this class of quantum devices. Hence, our results are expected to lead to new applications of near-term, restricted photonic quantum computers.
#BosonSampling is a problem that has hardness of classical simulation well established, but that quantum systems can do absurdly fast
One major difficulty is that this sampling task is not easy to be verified, hence not clear how to benchmark #QuantumAdvantage BosonSampling experiments
In a new preprint from #QLOC_INL Leonardo Novo, together with Benoît Seron (main author), A Arkhipov and N Cerf advance the field of Boson Sampling validation!
https://scirate.com/arxiv/2212.09643
Congrats to Benoît et al!
In order to substantiate claims of quantum computational advantage, it is crucial to develop efficient methods for validating the experimental data. We propose a test of the correct functioning of a boson sampler with single-photon inputs that is based on how photons distribute among partitions of the output modes. Our method is versatile and encompasses previous validation tests based on bunching phenomena, marginal distributions, and even some suppression laws. We show via theoretical arguments and numerical simulations that binned-mode photon number distributions can be used in practical scenarios to efficiently distinguish ideal boson samplers from those affected by realistic imperfections, especially partial distinguishability of the photons.