Gaussian boson sampling (GBS) allows for a way to demonstrate quantum supremacy with the relatively modest experimental resources of squeezed light sources, linear optics, and photon detection. In a realistic experimental setting, numerous effects can modify the complexity of the sampling, in particular loss, partial distinguishability of the photons, and the use of threshold detectors rather than photon counting detectors. In this paper, we investigate GBS with partial distinguishability using an approach based on virtual modes and indistinguishability efficiency. We develop a model using these concepts and derive the probabilities of measuring a specific output pattern from partially distinguishable and lossy GBS for both types of detectors. In the case of threshold detectors, the probability as calculated by the Torontonian is a special case under our framework. By analyzing the expressions of these probabilities we propose an efficient auxiliary classical simulation algorithm which can be used to calculate the probabilities. Our model and the auxiliary algorithm provide foundations for an approximation method for the probability calculation and simulation algorithms not only compatible with existing state-of-the-art simulation algorithms for ideal GBS but also reduce their complexities exponentially depending on the indistinguishability. Using the approximation method and the simulation algorithms we show how the boundary of quantum supremacy in GBS can be pushed further by partial distinguishability.
Evaluating noises of fast-simulated boson sampling with statistical benchmark methods
Shanghai Research Center for Quantum Sciences（上海量子科学研究中心）；The 32nd Research Institute of China Electronics Technology Group Corporation（中国电子科技集团公司第三十二研究所）
Characterizing Photonic Partial Distinguishability Through Gram Matrix Tomography
Center for Quantum Enabled-Computing, Center for Theoretical Physics of the Polish Academy of Sciences（波兰科学院理论物理中心量子使能计算中心）；International Iberian Nanotechnology Laboratory (INL)（伊比利亚纳米技术国际实验室）；Centre for Quantum Information and Communication, École polytechnique de Bruxelles, CP 165/59, Université libre de Bruxelles（布鲁塞尔自由大学布鲁塞尔理工学院量子信息与通信中心）；Instituto de Física, Universidade Federal Fluminense（弗鲁米嫩塞联邦大学物理研究所）
Distinguishability theory is developed for quantum interference of the squeezed vacuum states on unitary linear interferometers. It is found that the entanglement of photon pairs over the Schmidt modes is one of the sources of distinguishability. The distinguishability is quantified by the symmetric part of the internal state of $n$ pairs of photons, whose normalization $q_{2n}$ is the probability that $2n$ photons interfere as indistinguishable. For two pairs of photons $q_{4}=(1+ 2\mathbb{P} )/3$, where $\mathbb{P} $ is the purity of the squeezed states ($K=1/\mathbb{P} $ is the Schmidt numb…
Using tools from representation theory, we derive expressions for the coincidence rate of partially-distinguishable particles in an interferometry experiment. Our expressions are valid for either bosons or fermions, and for any number of particles. In an experiment with $n$ particles the expressions we derive contain a term for each partition of the integer $n$; Gamas's theorem is used to determine which of these terms are automatically zero based on the pairwise level of distinguishability between particles. Most sampling schemes (such as Boson Sampling) are limited to completely indistinguis…
With the recent claim of a quantum advantage demonstration in photonics by Zhong et al, the question of the computation of lower-order approximations of boson sampling with arbitrary quantum states at arbitrary distinguishability has come to the fore. In this work, we present results in this direction, building on the results of Clifford and Clifford. In particular, we show: 1) How to compute marginal detection probabilities (i.e. probabilities of the detection of some but not all photons) for arbitrary quantum states. 2) Using the first result, how to generalize the sampling algorithm of Clif…
We introduce the notion of "generalized bosons" whose exchange statistics resemble those of bosons, but the local bosonic commutator $[a_i,a_i^\dagger]=1$ is replaced by an arbitrary single-mode operator that is diagonal in the generalized Fock basis. Examples of generalized bosons include boson pairs and spins. We consider the analogue of the boson sampling task for these particles and observe that its output probabilities are still given by permanents, so that the results regarding hardness of sampling directly carry over. Finally, we propose implementations of generalized boson sampling in …
Efficiently simulating the work distribution of multiple identical bosons with boson sampling
Center for Quantum Technology Research and Key Laboratory of Advanced Optoelectronic Quantum Architecture and Measurements (MOE), School of Physics, Beijing Institute of Technology（北京理工大学物理学院量子技术研究中心及先进光电子量子架构与测量教育部重点实验室）
On computational complexity and average-case hardness of shallow-depth boson sampling
NextQuantum Innovation Research Center, Department of Physics and Astronomy, Seoul National University（首尔大学物理与天文学系Next量子创新研究中心）；Department of Physics, Korea Advanced Institute of Science and Technology（韩国科学技术院物理系）
It has been proven that Boson sampling is a much promising model of optical quantum computation, which has been applied to designing quantum computer successfully, such as "Jiuzhang". However, the meaningful randomness of Boson sampling results, whose correctness and significance were proved from a specific quantum mechanical distribution, has not been utilized or exploited. In this research, Boson sampling is applied to design a novel Quantum Random Number Generator (QRNG) by fully exploiting the randomness of Boson sampling results, and its prototype system is constructed with the programmab…
Optical losses are the main obstacle to demonstrating a quantum advantage via boson sampling without leaving open the possibility of classical spoofing. We propose a method for generating low-depth optical circuits suitable for boson sampling with very high efficiencies. Our circuits require only a constant number of optical components (namely three) to implement an optical transformation suitable for demonstrating a quantum advantage. Consequently, our proposal has a constant optical loss regardless of the number of optical modes. We argue that sampling from our family of circuits is computat…
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 order correlations, provided decoherence is included. We extend this to more than 16,000 modes, and describe how to simulate genuine multipartite entanglement.
