High performance Boson Sampling simulation via data-flow engines
arXiv:2309.07027 · doi:10.1088/1367-2630/ad313b
Abstract
In this work, we generalize the Balasubramanian-Bax-Franklin-Glynn (BB/FG) permanent formula to account for row multiplicities during the permanent evaluation and reduce the complexity of permanent evaluation in scenarios where such multiplicities occur. This is achieved by incorporating n-ary Gray code ordering of the addends during the evaluation. We implemented the designed algorithm on FPGA-based data-flow engines and utilized the developed accessory to speed up boson sampling simulations up to photons, by drawing samples from a mode interferometer at an averaged rate of seconds per sample utilizing FPGA chips. We also show that the performance of our BS simulator is in line with the theoretical estimation of Clifford \& Clifford \cite{clifford2020faster} providing a way to define a single parameter to characterize the performance of the BS simulator in a portable way. The developed design can be used to simulate both ideal and lossy boson sampling experiments.
arXiv comment25 pages
References in corpus (40)
- Quantum computational advantage using photons
- Characterizing Quantum Supremacy in Near-Term Devices
- Boson Sampling on a Photonic Chip
- Quantum Computational Supremacy
- Experimental Boson Sampling
- Experimental boson sampling in arbitrary integrated photonic circuits
- Photonic Boson Sampling in a Tunable Circuit
- Boson sampling with 20 input photons in 60-mode interferometers at state spaces
- Gaussian Boson Sampling
- Efficient experimental validation of photonic boson sampling against the uniform distribution
- Boson Sampling from Gaussian States
- Average-case complexity versus approximate simulation of commuting quantum computations
- Quantum Supremacy and the Complexity of Random Circuit Sampling
- Experimental Scattershot Boson Sampling
- Quantum Sampling Problems, BosonSampling and Quantum Supremacy
- A detailed study of Gaussian Boson Sampling
- No imminent quantum supremacy by boson sampling
- Gaussian Boson Sampling with Pseudo-Photon-Number Resolving Detectors and Quantum Computational Advantage
- Scalable boson-sampling with time-bin encoding using a loop-based architecture
- Gaussian Boson Sampling using threshold detectors
- A chip-based array of near-identical, pure, heralded single photon sources
- Simulating boson sampling in lossy architectures
- The Boundary for Quantum Advantage in Gaussian Boson Sampling
- Scalable Implementation of Boson Sampling with Trapped Ions
- On-chip quantum interference with heralded photons from two independent micro-ring resonator sources in silicon photonics
- A Benchmark Test of Boson Sampling on Tianhe-2 Supercomputer
- Microwave Boson Sampling
- Pattern recognition techniques for Boson Sampling validation
- Classical simulation of boson sampling based on graph structure
- Fermion Sampling: a robust quantum computational advantage scheme using fermionic linear optics and magic input states
- Classical simulation of linear optics subject to nonuniform losses
- Closing gaps of a quantum advantage with short-time Hamiltonian dynamics
- Driven Boson Sampling
- Generalized concurrence in boson sampling
- Spoofing cross entropy measure in boson sampling
- Efficient computation of permanents, with applications to boson sampling and random matrices
- High Dimensional Unitary Transformations and Boson Sampling on Temporal Modes using Dispersive Optics
- Quantum supremacy in driven quantum many-body systems
- Faster classical Boson Sampling
- Complexity-theoretic foundations of BosonSampling with a linear number of modes