Boson sampling on a chip

Jun Gao, Zhi‐Qiang Jiao, Ruo-Jing Ren +5 more

Quantum computation, aiming at tackling hard problems beyond classical approaches, has been flourishing with each passing day. Unfortunately, a fully scalable and fault-tolerant universal quantum computer remains challenging based on the current technology. Boson sampling, first proposed by Aaronson and Arkhipov, is commonly believed as the most promising candidate to reach the intermediate quantum computational milestone, namely, quantum supremacy. Following this leading proposal, many experimental implementations as well as variants of boson sampling have been shown. However, most of these works are limited to small scale and cannot fulfill the permanent-of-Gaussians conjecture. Here, we experimentally demonstrate the largest scale boson sampling in the collision-free dominant regime using multi-port interferometer in a 3D photonic chip. We measure all 6,545 no-collision output combinations and validate the experimental results. Our work shows the potential of 3D photonic chip platform and represents a solid step toward large scale boson sampling.

Max Tillmann, Borivoje Dakić, René Heilmann +3 more

Malaquias Correa Anguita, Anita Camillini, Sara Marzban +4 more

Abstract We experimentally demonstrate a testing strategy for boson samplers that is based on efficiently computable expressions for the output photon counting distributions binned over multiple optical modes. We apply this method to validate boson sampling experiments with three photons on a reconfigurable photonic chip, which implements a four-mode interferometer, analyzing 50 Haar-random unitary transformations while tuning photon indistinguishability via controlled delays. We show that for (nearly) indistinguishable photons, the experiment accurately reproduces the ideal boson sampling binned-mode distributions, which exhibit variations that depend both on the specific interferometer implemented as well as the choice of bin, confirming the usefulness of the method to diagnose imperfections such as partial distinguishability or imperfect chip control. Finally, we analyze the behavior of Haar-averaged binned-mode distributions in relation to indistinguishability and demonstrate analytically that its variance is proportional to the average of the square of the photons’ indistinguishability parameter. These findings highlight the central role of binning in boson sampling validation, offering a scalable and efficient framework for assessing multiphoton interference and experimental performance.

Claudio Conti

Yu. A. Biriukov, R. D. Morozov, K. I. Okhlopkov +15 more

We present an experimental demonstration of boson sampling enhanced by optical feedback lines, a novel approach that introduces temporal correlations among photons to amplify computational complexity. We utilize a 25-mode femtosecond laser-written interferometer with five output channels connected to five input channels to create correlations between consecutive photon arrival events. We have reconstructed the unitary matrix of the chip and have conducted Bayesian analysis to validate the sampler and confirm that the system exhibits behavior distinct from standard boson sampling. We also built a theoretical description of the system based on the transformation of annihilation operators and, using it, delivered the structure of the transmission matrix and the complexity of our boson sampler in terms of a conventional boson sampler. This work advances photonic quantum computing by demonstrating a resource-efficient method to increase sampling complexity, paving the way for scalable demonstration of quantum advantage with single photons.

Gregory Morse, Tomasz Rybotycki, Ágoston Kaposi +7 more

Abstract Boson sampling (BS) is viewed to be an accessible quantum computing paradigm to demonstrate computational advantage compared to classical computers. In this context, the evolution of permanent calculation algorithms attracts a significant attention as the simulation of BS experiments involves the evaluation of vast number of permanents. For this reason, we generalize the Balasubramanian–Bax–Franklin–Glynn permanent formula, aiming to efficiently integrate it into the BS strategy of Clifford and Clifford (2020 Faster classical boson sampling). A reduction in simulation complexity originating from multiplicities in photon occupation was achieved through the incorporation of a n-ary Gray code ordering of the addends during the permanent evaluation. Implementing the devised algorithm on FPGA-based data-flow engines, we leverage the resulting tool to accelerate boson sampling simulations for up to 40 photons. Drawing samples from a 60-mode interferometer, the achieved rate averages around 80 s per sample, employing 4 FPGA chips. The developed design facilitates the simulation of both ideal and lossy boson sampling experiments.