Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1509.01561 · Physical Review Letters

Universality of Generalized Bunching and Efficient Assessment of Boson Sampling

V. S. Shchesnovich

Published Mar 22, 2016• 63 citations
arXivHTMLPDF

Abstract

It is found that identical bosons (fermions) show a generalized bunching (antibunching) property in linear networks: the absolute maximum (minimum) of the probability that all N input particles are detected in a subset of K output modes of any nontrivial linear M-mode network is attained only by completely indistinguishable bosons (fermions). For fermions K is arbitrary; for bosons it is either (i) arbitrary for only classically correlated bosons or (ii) satisfies K≥N (or K=1) for arbitrary input states of N particles. The generalized bunching allows us to certify in a polynomial in N number of runs that a physical device realizing boson sampling with an arbitrary network operates in the regime of full quantum coherence compatible only with completely indistinguishable bosons. The protocol needs only polynomial classical computations for the standard boson sampling, whereas an analytic formula is available for the scattershot version.

DOI
10.1103/physrevlett.116.123601

Related papers

Universality of boson bunching and fermion antibunching in linear networks

V. S. Shchesnovich

It is found that identical bosons (fermions) show generalized bunching (antibunching) property in linear networks: The absolute maximum (minimum) of probability that all $N$ input particles are detected in a subset of $\mathcal{K}$ output modes of any nontrivial linear $M$-mode network is attained \textit{only} by completely indistinguishable bosons (fermions). For fermions $\mathcal{K}$ is arbitrary, for bosons it is either ($i$) arbitrary for only classically correlated bosons or ($ii$) satisfies $\mathcal{K}\ge N$ (or $\mathcal{K}=1$) for arbitrary input states of $N$ particles. The generalized bunching allows to certify in a \textit{polynomial} in $N$ number of runs that a physical device realizing Boson Sampling with \textit{an arbitrary} network operates in the regime of full quantum coherence compatible \textit{only} with completely indistinguishable bosons. The protocol needs \textit{only polynomial} classical computations for the standard Boson Sampling, whereas an \textit{analytic formula} is available for the scattershot version.

•Sep 4, 2015•0 citations

Measuring multiparticle indistinguishability with the generalized bunching probability

Shawn Geller, Emanuel H. Knill

The indistinguishability of many bosons undergoing passive linear transformations followed by number basis measurements is fully characterized by the visible state of the bosons. However, measuring all the parameters in the visible state is experimentally demanding. In this work, we seek to perform partial characterization of the visible state by measuring properties of it that are available after randomization. First we study the case where the occupied visible modes are randomly permuted, and second we study the case where Haar random linear optical unitaries are applied. In each case, we find that the generalized bunching probability -- which is the probability that all the input bosons arrive in a given subset of the output modes -- obeys monotonicity with respect to some partial order of distinguishability of the input bosons. As an intermediate result, we show that Lieb's permanental-dominance conjecture for immanants is equivalent to the following statement: for states that are invariant under permutations of the occupied visible modes, the generalized bunching probability is maximized when the bosons are perfectly indistinguishable. We also prove that a consequence of the monotonicity of the generalized bunching probability after Haar averaging is that this average is maximized when the bosons are perfectly indistinguishable. Finally, we discuss applications of our results to thermometry of cold-atom systems.

arXiv:2509.04550•Physical Review A•Feb 3, 2026•5 citations

Near-Optimal Mode Scaling for Finite-Dimensional Boson Sampling via Lie-Algebraic Leakage Bounds

Chon-Fai Kam, En-Jui Kuo

Boson sampling demonstrates quantum advantage through the interference of indistinguishable particles, with output probabilities governed by matrix permanents. Realizing it on deterministic, matter-based platforms requires encoding the bosonic modes in finite-dimensional local Hilbert spaces, which introduces a leakage channel absent in linear optics: multi-particle bunching beyond the local truncation $d$. We develop a unified framework for non-interacting sampling on the irreducible representations of compact Lie groups, in which the transition amplitude is the immanant of a submatrix of the single-particle transition matrix, recovering the permanent in the bosonic case. Within this framework we bound the bunching leakage through a Dyson-series analysis: decomposing the correlated many-body leakage operator into independent random matrices and applying non-commutative concentration inequalities, we prove, in a Gaussian model of the transition matrix, that its spectral norm concentrates at $\tilde{O}(\sqrt{n})$ rather than the $O(n)$ worst-case of prior spin-based emulations; the passage to the physical Haar ensemble is reduced to a single submatrix-comparison input, verified at leading order. Exact numerics across local dimensions $d=2$--$5$ indicate that the bound is tight, the Haar-ensemble norm matching the closed form $\sqrt{d(n-d+1)}$ to sub-percent accuracy. This tightens the required mode number from $m=Ω(n^4)$ to the near-optimal $m=\tildeΩ(n^{1+2/(d-1)})$; for a spin-1 representation ($d=3$) the overhead falls to $m=\tildeΩ(n^2)$, matching the collision-free threshold. The result is independent of particle statistics and applies across finite-dimensional Lie-symmetric architectures, quantifying the spatial resources needed to preserve sampling hardness.

quant-pharXiv:2607.11708•Jul 14, 2026•0 citations

Interference of identical particles from entanglement to boson-sampling

Malte C. Tichy

Progress in the reliable preparation, coherent propagation and efficient detection of many-body states has recently brought collective quantum phenomena of many identical particles into the spotlight. This tutorial introduces the physics of many-boson and many-fermion interference required for the description of current experiments and for the understanding of novel approaches to quantum computing. The field is motivated via the two-particle case, for which the uncorrelated, classical dynamics of distinguishable particles is compared to the quantum behaviour of identical bosons and fermions. Bunching of bosons is opposed to anti-bunching of fermions, while both species constitute equivalent sources of bipartite two-level entanglement. The realms of indistinguishable and distinguishable particles are connected by a monotonic transition, on a scale defined by the coherence length of the interfering particles. As we move to larger systems, any attempt to understand many particles via the two-particle paradigm fails: In contrast to two-particle bunching and anti-bunching, the very same signatures can be exhibited by bosons and fermions, and coherent effects dominate over statistical behaviour. The simulation of many-boson interference, termed Boson-Sampling, entails a qualitatively superior computational complexity when compared to fermions. The hierarchy between bosons and fermions also characterises multipartite entanglement generation, for which bosons again clearly outmatch fermions. Finally, the quantum-to-classical transition between many indistinguishable and many distinguishable particles features non-monotonic structures. While the same physical principles govern small and large systems, the deployment of the intrinsic complexity of collective many-body interference makes more particles behave differently.

arXiv:1312.4266•Journal of Physics B Atomic Molecular and Optical Physics•May 7, 2014•98 citations

BosonSampling is far from uniform

Scott Aaronson, Alex Arkhipov

BosonSampling, which we proposed three years ago, is a scheme for using linear-optical networks to solve sampling problems that appear to be intractable for a classical computer. \ In a recent manuscript, Gogolin et al.\ claimed that even an ideal BosonSampling device's output would be operationally indistinguishable\textquotedblright\ from a uniform random outcome, at least \textquotedblleft without detailed a priori knowledge; or at any rate, that telling the two apart might itself be a hard problem. We first answer these claims---explaining why the first is based on a definition of a priori knowledge such that, were it adopted, almost no quantum algorithm could be distinguished from a pure random-number source; while the second is neither new nor a practical obstacle to interesting BosonSampling experiments.However, we then go further, and address some interesting research questions inspired by Gogolin et al.'s arguments. We prove that, with high probability over a Haar-random matrix $A$, the BosonSampling distribution induced by $A$ is far from the uniform distribution in total variation distance. More surprisingly, and counter to Gogolin et al., we give an efficient algorithm that distinguishes these two distributions with constant bias. Finally, we offer three bonus results about BosonSampling. First, we report an observation of Fernando Brandao: that one can efficiently sample a distribution that has large entropy and that's indistinguishable from a BosonSampling distribution by any circuit of fixed polynomial size. Second, we show that BosonSampling distributions can be efficiently distinguished from uniform even with photon losses and for general initial states. Third, we offer the simplest known proof that Fermion Sampling is solvable in classical polynomial time, and we reuse techniques from our Boson Sampling analysis to characterize random FermionSampling distributions.

arXiv:1309.7460•Quantum Information and Computation•Nov 1, 2014•175 citations

The Complexity of Bipartite Gaussian Boson Sampling

Daniel Grier, Daniel J. Brod, Juan Miguel Arrazola +2 more

Gaussian boson sampling is a model of photonic quantum computing that has attracted attention as a platform for building quantum devices capable of performing tasks that are out of reach for classical devices. There is therefore significant interest, from the perspective of computational complexity theory, in solidifying the mathematical foundation for the hardness of simulating these devices. We show that, under the standard Anti-Concentration and Permanent-of-Gaussians conjectures, there is no efficient classical algorithm to sample from ideal Gaussian boson sampling distributions (even approximately) unless the polynomial hierarchy collapses. The hardness proof holds in the regime where the number of modes scales quadratically with the number of photons, a setting in which hardness was widely believed to hold but that nevertheless had no definitive proof. Crucial to the proof is a new method for programming a Gaussian boson sampling device so that the output probabilities are proportional to the permanents of submatrices of an arbitrary matrix. This technique is a generalization of Scattershot BosonSampling that we call BipartiteGBS. We also make progress towards the goal of proving hardness in the regime where there are fewer than quadratically more modes than photons (i.e., the high-collision regime) by showing that the ability to approximate permanents of matrices with repeated rows/columns confers the ability to approximate permanents of matrices with no repetitions. The reduction suffices to prove that GBS is hard in the constant-collision regime.

arXiv:2110.06964•Quantum•Nov 28, 2022•47 citations
It is found that identical bosons (fermions) show a generalized bunching (antibunching) property in linear networks: the absolute maximum (minimum) of the probability that all N input particles are detected in a subset of K output modes of any nontrivial linear M-mode network is attained only by completely indistinguishable bosons (fermions). For fermions K is arbitrary; for bosons it is either (i) arbitrary for only classically correlated bosons or (ii) satisfies K≥N (or K=1) for arbitrary input states of N particles. The generalized bunching allows us to certify in a polynomial in N number of runs that a physical device realizing boson sampling with an arbitrary network operates in the regime of full quantum coherence compatible only with completely indistinguishable bosons. The protocol needs only polynomial classical computations for the standard boson sampling, whereas an analytic formula is available for the scattershot version.
It is found that identical bosons (fermions) show generalized bunching (antibunching) property in linear networks: The absolute maximum (minimum) of probability that all NNN input particles are detected in a subset of K\mathcal{K}K output modes of any nontrivial linear MMM-mode network is attained \textit{only} by completely indistinguishable bosons (fermions). For fermions K\mathcal{K}K is arbitrary, for bosons it is either (iii) arbitrary for only classically correlated bosons or (iiiiii) satisfies K≥N\mathcal{K}\ge NK≥N (or K=1\mathcal{K}=1K=1) for arbitrary input states of NNN particles. The generalized bunching allows to certify in a \textit{polynomial} in NNN number of runs that a physical device realizing Boson Sampling with \textit{an arbitrary} network operates in the regime of full quantum coherence compatible \textit{only} with completely indistinguishable bosons. The protocol needs \textit{only polynomial} classical computations for the standard Boson Sampling, whereas an \textit{analytic formula} is available for the scattershot version.
The indistinguishability of many bosons undergoing passive linear transformations followed by number basis measurements is fully characterized by the visible state of the bosons. However, measuring all the parameters in the visible state is experimentally demanding. In this work, we seek to perform partial characterization of the visible state by measuring properties of it that are available after randomization. First we study the case where the occupied visible modes are randomly permuted, and second we study the case where Haar random linear optical unitaries are applied. In each case, we find that the generalized bunching probability -- which is the probability that all the input bosons arrive in a given subset of the output modes -- obeys monotonicity with respect to some partial order of distinguishability of the input bosons. As an intermediate result, we show that Lieb's permanental-dominance conjecture for immanants is equivalent to the following statement: for states that are invariant under permutations of the occupied visible modes, the generalized bunching probability is maximized when the bosons are perfectly indistinguishable. We also prove that a consequence of the monotonicity of the generalized bunching probability after Haar averaging is that this average is maximized when the bosons are perfectly indistinguishable. Finally, we discuss applications of our results to thermometry of cold-atom systems.
Boson sampling demonstrates quantum advantage through the interference of indistinguishable particles, with output probabilities governed by matrix permanents. Realizing it on deterministic, matter-based platforms requires encoding the bosonic modes in finite-dimensional local Hilbert spaces, which introduces a leakage channel absent in linear optics: multi-particle bunching beyond the local truncation ddd. We develop a unified framework for non-interacting sampling on the irreducible representations of compact Lie groups, in which the transition amplitude is the immanant of a submatrix of the single-particle transition matrix, recovering the permanent in the bosonic case. Within this framework we bound the bunching leakage through a Dyson-series analysis: decomposing the correlated many-body leakage operator into independent random matrices and applying non-commutative concentration inequalities, we prove, in a Gaussian model of the transition matrix, that its spectral norm concentrates at O~(n)\tilde{O}(\sqrt{n})O~(n​) rather than the O(n)O(n)O(n) worst-case of prior spin-based emulations; the passage to the physical Haar ensemble is reduced to a single submatrix-comparison input, verified at leading order. Exact numerics across local dimensions d=2d=2d=2--555 indicate that the bound is tight, the Haar-ensemble norm matching the closed form d(n−d+1)\sqrt{d(n-d+1)}d(n−d+1)​ to sub-percent accuracy. This tightens the required mode number from m=Ω(n4)m=Ω(n^4)m=Ω(n4) to the near-optimal m=Ω~(n1+2/(d−1))m=\tildeΩ(n^{1+2/(d-1)})m=Ω~(n1+2/(d−1)); for a spin-1 representation (d=3d=3d=3) the overhead falls to m=Ω~(n2)m=\tildeΩ(n^2)m=Ω~(n2), matching the collision-free threshold. The result is independent of particle statistics and applies across finite-dimensional Lie-symmetric architectures, quantifying the spatial resources needed to preserve sampling hardness.
Progress in the reliable preparation, coherent propagation and efficient detection of many-body states has recently brought collective quantum phenomena of many identical particles into the spotlight. This tutorial introduces the physics of many-boson and many-fermion interference required for the description of current experiments and for the understanding of novel approaches to quantum computing. The field is motivated via the two-particle case, for which the uncorrelated, classical dynamics of distinguishable particles is compared to the quantum behaviour of identical bosons and fermions. Bunching of bosons is opposed to anti-bunching of fermions, while both species constitute equivalent sources of bipartite two-level entanglement. The realms of indistinguishable and distinguishable particles are connected by a monotonic transition, on a scale defined by the coherence length of the interfering particles. As we move to larger systems, any attempt to understand many particles via the two-particle paradigm fails: In contrast to two-particle bunching and anti-bunching, the very same signatures can be exhibited by bosons and fermions, and coherent effects dominate over statistical behaviour. The simulation of many-boson interference, termed Boson-Sampling, entails a qualitatively superior computational complexity when compared to fermions. The hierarchy between bosons and fermions also characterises multipartite entanglement generation, for which bosons again clearly outmatch fermions. Finally, the quantum-to-classical transition between many indistinguishable and many distinguishable particles features non-monotonic structures. While the same physical principles govern small and large systems, the deployment of the intrinsic complexity of collective many-body interference makes more particles behave differently.
BosonSampling, which we proposed three years ago, is a scheme for using linear-optical networks to solve sampling problems that appear to be intractable for a classical computer. \ In a recent manuscript, Gogolin et al.\ claimed that even an ideal BosonSampling device's output would be operationally indistinguishable\textquotedblright\ from a uniform random outcome, at least \textquotedblleft without detailed a priori knowledge; or at any rate, that telling the two apart might itself be a hard problem. We first answer these claims---explaining why the first is based on a definition of a priori knowledge such that, were it adopted, almost no quantum algorithm could be distinguished from a pure random-number source; while the second is neither new nor a practical obstacle to interesting BosonSampling experiments.However, we then go further, and address some interesting research questions inspired by Gogolin et al.'s arguments. We prove that, with high probability over a Haar-random matrix AAA, the BosonSampling distribution induced by AAA is far from the uniform distribution in total variation distance. More surprisingly, and counter to Gogolin et al., we give an efficient algorithm that distinguishes these two distributions with constant bias. Finally, we offer three bonus results about BosonSampling. First, we report an observation of Fernando Brandao: that one can efficiently sample a distribution that has large entropy and that's indistinguishable from a BosonSampling distribution by any circuit of fixed polynomial size. Second, we show that BosonSampling distributions can be efficiently distinguished from uniform even with photon losses and for general initial states. Third, we offer the simplest known proof that Fermion Sampling is solvable in classical polynomial time, and we reuse techniques from our Boson Sampling analysis to characterize random FermionSampling distributions.
Gaussian boson sampling is a model of photonic quantum computing that has attracted attention as a platform for building quantum devices capable of performing tasks that are out of reach for classical devices. There is therefore significant interest, from the perspective of computational complexity theory, in solidifying the mathematical foundation for the hardness of simulating these devices. We show that, under the standard Anti-Concentration and Permanent-of-Gaussians conjectures, there is no efficient classical algorithm to sample from ideal Gaussian boson sampling distributions (even approximately) unless the polynomial hierarchy collapses. The hardness proof holds in the regime where the number of modes scales quadratically with the number of photons, a setting in which hardness was widely believed to hold but that nevertheless had no definitive proof. Crucial to the proof is a new method for programming a Gaussian boson sampling device so that the output probabilities are proportional to the permanents of submatrices of an arbitrary matrix. This technique is a generalization of Scattershot BosonSampling that we call BipartiteGBS. We also make progress towards the goal of proving hardness in the regime where there are fewer than quadratically more modes than photons (i.e., the high-collision regime) by showing that the ability to approximate permanents of matrices with repeated rows/columns confers the ability to approximate permanents of matrices with no repetitions. The reduction suffices to prove that GBS is hard in the constant-collision regime.