#Boson x level 17 verification

#Boson x level 17 verification

19 This is indeed a relevant issue since the very complexity of the problem forbids the application of usual verification methods, and classical simulations become progressively intractable for the increasing system size. In parallel, theoretical work was required to define suitable methods to verify that a given device is sampling from the correct distribution.

This is leading to a race aimed at reaching the quantum advantage 18 regime in a photonic platform, namely the condition where the experiment is outperforming a classical computer. 11 – 17 Following these theoretical developments, a strong experimental effort was then initiated to realize progressively larger instances of boson sampling experiments. 2 Given the lack of error-correction-an issue shared by all current proposals for quantum computational supremacy 8-it is an open question whether current technology is capable of scaling boson sampling to arbitrarily large sizes while maintaining a quantum advantage, which has also motivated research in more robust variants of the model. To this end, one of the most suitable platforms is provided by photonic systems, as the necessary elements (sources, linear evolution, and detection) are available with present technology. On the other hand, boson sampling can be tackled with a dedicated quantum hardware, which, despite not being universal for quantum computation, is capable of implementing the required dynamics. 9, strong evidence was provided that boson sampling is an intractable problem for classical computers, as it is related to the evaluation of permanents of matrices with complex entries (a problem known, in computational complexity terms, to belong to the #P-hard class 10). This problem consists in sampling from the output distribution of n indistinguishable bosons that interfere during the evolution through a Haar-random-chosen linear network. Within this framework, Aaronson and Arkhipov (AA) 9 formulated a well-defined computational problem that they called boson sampling. A first fundamental step in this direction would be the achievement of the regime of quantum computational supremacy, 8 i.e., the experimental demonstration of a quantum device capable of performing a computational task unambiguously faster than present-day classical computers. Hence, intermediate milestones need to be identified in the long-term effort toward harnessing the computational potential of quantum systems. 1 Despite the tremendous advances in quantum technologies 2 – 7 reported in the last few years, the implementation of a large-scale universal quantum computer is still far from our current capabilities. This effort is motivated by the promise of quantum algorithmic speed-up, with a notable early example provided by Shor’s algorithm for integer factoring. In recent years, much work has been directed to the development of suitable technologies for scalable quantum computation.

We conclude by discussing the future application of photonic boson sampling devices beyond the original theoretical scope. We also discuss recent proposals and implementations of variants of the original problem, theoretical issues occurring when imperfections are considered, and advances in the development of suitable techniques for validation of boson sampling experiments. We review recent advances in photonic boson sampling, describing both the technological improvements achieved and the future challenges. This prospect has stimulated much effort resulting in the experimental implementation of progressively larger devices.

There is strong evidence that such an experiment is hard to classically simulate, but it is naturally solved by dedicated photonic quantum hardware, comprising single photons, linear evolution, and photodetection. The problem consists in sampling from the output distribution of indistinguishable bosons in a linear interferometer. Boson sampling is a computational problem that has recently been proposed as a candidate to obtain an unequivocal quantum computational advantage.