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:2607.11708

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

Chon-Fai Kam, En-Jui Kuo

quant-phmath-phSubmitted Jul 13, 2026• Announced Jul 14, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

Related papers

Boson sampling beyond the dilute regime: second moments and anti-concentration

Hela Mhiri, Hugo Thomas, Léo Monbroussou +3 more

Boson sampling is a leading candidate for demonstrating quantum advantage in photonic systems. Despite significant experimental and theoretical progress, a characterization of its output statistics remains incomplete. This is especially true beyond the dilute regime, where photon collisions and bunching become significant. The associated saturated regime, characterized by mode number growing linearly with photon number, or more generally sub-quadratically, is precisely the regime of greatest experimental interest. As a consequence, anti-concentration of the output distribution--a key ingredient in hardness arguments--remains poorly understood in boson sampling. In this work, we leverage representation-theoretic tools to address this gap, obtaining closed-form expressions for second moments of generic particle-number-preserving bosonic observables. We express these quantities in terms of Hilbert-Schmidt norms of projections onto irreducible components of the operator space and show that these projection norms admit compact analytical expressions by exploiting the underlying symmetry structure. Focusing on Fock state output probabilities, we further establish anti-concentration beyond the dilute regime. Together with recent complexity-theoretic results, our findings strengthen hardness guarantees for boson sampling in experimentally interesting settings.

quant-pharXiv:2604.14323•Apr 17, 2026•0 citations

Proof of the hiding conjecture for Gaussian boson sampling with an arbitrary number of squeezed input modes

Laura Shou, Alexey V. Gorshkov, Victor Galitski +1 more

Gaussian boson sampling (GBS) is a sampling task proposed to demonstrate quantum advantage. We consider Gaussian boson sampling on $M$ optical modes, with $K$ equally squeezed input modes and $N$ observed photon counts. We complete the proof of the hiding conjecture for Gaussian boson sampling with an arbitrary number of squeezers $K$, which is a part of the argument for classical hardness of GBS. In particular, we show that for any $K$ and $N=o(\sqrt{K})$, the symmetric product $MK^{-1/2}U_{NK}U_{NK}^T$, for $U_{NK}$ the top left $N\times K$ submatrix of an $M\times M$ Haar random unitary $U$, is close in total variation distance to both an $N\times N$ symmetric complex Gaussian matrix $\mathbf G$ with independent entries, and the symmetric product $GG^T/\sqrt{K}$ for $G$ an $N\times K$ matrix of iid standard complex Gaussians. We show however that the density-based instance generating method of [Aaronson and Arkhipov, Theory Comput. 9, 143 (2013), Lemma 5.8] used to efficiently implement a hiding procedure fails for Gaussian boson sampling with $K=cM$ if $c<1/2$. Instead we use approximate instance generating to implement the hiding for the usual classical hardness reduction.

quant-pharXiv:2608.19314•Aug 21, 2026•0 citations

Lie-Algebraic Classical Simulation of Bosonic Systems Beyond Gaussian Dynamics

Adelina Bärligea, Timothy Heightman, Jakob S. Kottmann +1 more

Classical simulability is ultimately determined by both the dynamics of a quantum system and the observables being evaluated. Lie-algebraic simulation exploits the latter to make exact polynomial-time classical simulations by propagating observables through low-dimensional invariant operator spaces. However, its conventional formulation in terms of polynomial-dimensional dynamical Lie algebras does not directly accommodate bosonic systems as their algebras are neither compact nor semisimple. In this contribution, we overcome this limitation, making bosonic systems accessible to the Lie-algebraic programme of exact polynomial-time classical simulation. We prove that expectation values, fixed-order correlation functions, including multi-time correlators and out-of-time-ordered correlators, and gradients are efficiently computable whenever their operator modules have polynomial dimension. This recovers Gaussian quantum optics and extends it to non-Gaussian input states, while identifying exact polynomial regimes of interacting non-Gaussian dynamics including bounded-photon Kerr and pair-hopping Hamiltonians and nilpotent polynomial phase dynamics. We show that unlike in the finite-dimensional spin and fermionic setting treated previously, a finite-dimensional bosonic generator algebra alone does not guarantee finite observable dynamics. We further derive a controlled perturbative hierarchy for squeezing beyond exact sector confinement and confirm the predicted error orders numerically. We also evaluate operator spreading on interacting chains of up to $400$ modes and connect a topological doublon band with flux-reversed edge motion. These results provide a unified formalism for classifying, discovering, and systematically approximating tractable bosonic quantum dynamics with classical polynomial-time simulation.

quant-pharXiv:2608.17094•Aug 19, 2026•0 citations

The magic cost of fermionic randomness

Chenfeng Cao, Yifan Tang, Jens Eisert

Sampling-based quantum advantage raises a basic resource question: how much non-Gaussianity is needed to reproduce the random-matrix statistics often associated with quantum chaos? Passive fermionic linear optics preserves Gaussian structure, and even Haar-random mode mixing fails to anticoncentrate for Slater inputs. We show that overcoming this obstruction requires an extensive input resource. For any pure half-filled input state, the one-body defect $ν$, defined as the summed occupation variance of the natural orbitals, must scale linearly with system size. For products of bounded-size blocks on $4N$ modes, this condition is also sufficient, with normalized collision moment asymptotic to $2N/ν$, compared with the Porter-Thomas value 2. For four-mode products, the full Porter-Thomas moment hierarchy is recovered precisely when the defect density tends to its maximum. Assuming average-case hardness, approximate classical sampling remains hard near maximal density, with an error tolerance that increases with the density. Two-copy number fluctuations measure $ν$ directly, and the same quantity lower-bounds the combined cost of non-Gaussian resource modes and parity-preserving local gates in deterministic exact preparation. Fermionic randomness therefore carries an extensive magic cost, with a quantitative link between sampling statistics, preparation resources, and an experimentally accessible witness.

quant-pharXiv:2610.05093•Oct 6, 2026•0 citations

Uniform Hiding and Two Routes to Relative Accuracy in Gaussian Boson Sampling

Hongru Zhao

Gaussian boson sampling requires control of how closely finite optical matrices follow Gaussian reference laws. We prove an explicit total variation bound of order $N^2/M$ between a rescaled Haar transpose Gram block and its Gaussian transpose Gram counterpart, where $N$ is the detected photon count and $M$ is the number of optical modes. The bound establishes quantitative product hiding uniformly over every number of squeezed inputs. The proof combines Stiefel recursion, centered circular orthogonal ensemble scores, and a rectangular entropy estimate. Applications combine hiding with local hafnian bounds to obtain relative probability guarantees and connect them to sampler error through exact photon-sector normalization.

quant-pharXiv:2609.01008•Sep 2, 2026•0 citations

Weak Permanent Anti-Concentration for Random Gaussian Matrices in Boson Sampling

Fei Meng, Bin Cheng, Jianan Li +1 more

Recent demonstrations of quantum computational advantage have been driven largely by sampling problems. A prominent model, boson sampling, involves sampling from the output distribution of a linear optical network. However, its classical hardness hinges on two plausible yet less-studied conjectures: the average-case hardness of approximating Gaussian permanents, and the permanent anti-concentration conjecture (PACC). The PACC is a purely mathematical assertion regarding the distributional properties of random Gaussian matrices. While the typical magnitude of the permanent has been established for discrete random matrices, the complex Gaussian case, which governs transition amplitudes in linear optical networks, has remained open. Here, we establish a weak anti-concentration bound by upper-bounding the probability that a random Gaussian permanent is superexponentially smaller than its standard deviation. Tightening this bound to an inverse-polynomial fraction would prove the original PACC. As a corollary, we establish the typical magnitude of Gaussian permanents, on par with Tao and Vu's seminal result for Bernoulli matrices. Combined with the Aaronson-Arkhipov framework, our result implies that classically simulating boson sampling to within a superexponentially small total variation distance would collapse the polynomial hierarchy, assuming the remaining conjectures hold.

quant-pharXiv:2607.22088•Jul 27, 2026•0 citations
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.
Boson sampling is a leading candidate for demonstrating quantum advantage in photonic systems. Despite significant experimental and theoretical progress, a characterization of its output statistics remains incomplete. This is especially true beyond the dilute regime, where photon collisions and bunching become significant. The associated saturated regime, characterized by mode number growing linearly with photon number, or more generally sub-quadratically, is precisely the regime of greatest experimental interest. As a consequence, anti-concentration of the output distribution--a key ingredient in hardness arguments--remains poorly understood in boson sampling. In this work, we leverage representation-theoretic tools to address this gap, obtaining closed-form expressions for second moments of generic particle-number-preserving bosonic observables. We express these quantities in terms of Hilbert-Schmidt norms of projections onto irreducible components of the operator space and show that these projection norms admit compact analytical expressions by exploiting the underlying symmetry structure. Focusing on Fock state output probabilities, we further establish anti-concentration beyond the dilute regime. Together with recent complexity-theoretic results, our findings strengthen hardness guarantees for boson sampling in experimentally interesting settings.
Gaussian boson sampling (GBS) is a sampling task proposed to demonstrate quantum advantage. We consider Gaussian boson sampling on MMM optical modes, with KKK equally squeezed input modes and NNN observed photon counts. We complete the proof of the hiding conjecture for Gaussian boson sampling with an arbitrary number of squeezers KKK, which is a part of the argument for classical hardness of GBS. In particular, we show that for any KKK and N=o(K)N=o(\sqrt{K})N=o(K​), the symmetric product MK−1/2UNKUNKTMK^{-1/2}U_{NK}U_{NK}^TMK−1/2UNK​UNKT​, for UNKU_{NK}UNK​ the top left N×KN\times KN×K submatrix of an M×MM\times MM×M Haar random unitary UUU, is close in total variation distance to both an N×NN\times NN×N symmetric complex Gaussian matrix G\mathbf GG with independent entries, and the symmetric product GGT/KGG^T/\sqrt{K}GGT/K​ for GGG an N×KN\times KN×K matrix of iid standard complex Gaussians. We show however that the density-based instance generating method of [Aaronson and Arkhipov, Theory Comput. 9, 143 (2013), Lemma 5.8] used to efficiently implement a hiding procedure fails for Gaussian boson sampling with K=cMK=cMK=cM if c<1/2c<1/2c<1/2. Instead we use approximate instance generating to implement the hiding for the usual classical hardness reduction.
Classical simulability is ultimately determined by both the dynamics of a quantum system and the observables being evaluated. Lie-algebraic simulation exploits the latter to make exact polynomial-time classical simulations by propagating observables through low-dimensional invariant operator spaces. However, its conventional formulation in terms of polynomial-dimensional dynamical Lie algebras does not directly accommodate bosonic systems as their algebras are neither compact nor semisimple. In this contribution, we overcome this limitation, making bosonic systems accessible to the Lie-algebraic programme of exact polynomial-time classical simulation. We prove that expectation values, fixed-order correlation functions, including multi-time correlators and out-of-time-ordered correlators, and gradients are efficiently computable whenever their operator modules have polynomial dimension. This recovers Gaussian quantum optics and extends it to non-Gaussian input states, while identifying exact polynomial regimes of interacting non-Gaussian dynamics including bounded-photon Kerr and pair-hopping Hamiltonians and nilpotent polynomial phase dynamics. We show that unlike in the finite-dimensional spin and fermionic setting treated previously, a finite-dimensional bosonic generator algebra alone does not guarantee finite observable dynamics. We further derive a controlled perturbative hierarchy for squeezing beyond exact sector confinement and confirm the predicted error orders numerically. We also evaluate operator spreading on interacting chains of up to 400400400 modes and connect a topological doublon band with flux-reversed edge motion. These results provide a unified formalism for classifying, discovering, and systematically approximating tractable bosonic quantum dynamics with classical polynomial-time simulation.
Sampling-based quantum advantage raises a basic resource question: how much non-Gaussianity is needed to reproduce the random-matrix statistics often associated with quantum chaos? Passive fermionic linear optics preserves Gaussian structure, and even Haar-random mode mixing fails to anticoncentrate for Slater inputs. We show that overcoming this obstruction requires an extensive input resource. For any pure half-filled input state, the one-body defect ννν, defined as the summed occupation variance of the natural orbitals, must scale linearly with system size. For products of bounded-size blocks on 4N4N4N modes, this condition is also sufficient, with normalized collision moment asymptotic to 2N/ν2N/ν2N/ν, compared with the Porter-Thomas value 2. For four-mode products, the full Porter-Thomas moment hierarchy is recovered precisely when the defect density tends to its maximum. Assuming average-case hardness, approximate classical sampling remains hard near maximal density, with an error tolerance that increases with the density. Two-copy number fluctuations measure ννν directly, and the same quantity lower-bounds the combined cost of non-Gaussian resource modes and parity-preserving local gates in deterministic exact preparation. Fermionic randomness therefore carries an extensive magic cost, with a quantitative link between sampling statistics, preparation resources, and an experimentally accessible witness.
Gaussian boson sampling requires control of how closely finite optical matrices follow Gaussian reference laws. We prove an explicit total variation bound of order N2/MN^2/MN2/M between a rescaled Haar transpose Gram block and its Gaussian transpose Gram counterpart, where NNN is the detected photon count and MMM is the number of optical modes. The bound establishes quantitative product hiding uniformly over every number of squeezed inputs. The proof combines Stiefel recursion, centered circular orthogonal ensemble scores, and a rectangular entropy estimate. Applications combine hiding with local hafnian bounds to obtain relative probability guarantees and connect them to sampler error through exact photon-sector normalization.
Recent demonstrations of quantum computational advantage have been driven largely by sampling problems. A prominent model, boson sampling, involves sampling from the output distribution of a linear optical network. However, its classical hardness hinges on two plausible yet less-studied conjectures: the average-case hardness of approximating Gaussian permanents, and the permanent anti-concentration conjecture (PACC). The PACC is a purely mathematical assertion regarding the distributional properties of random Gaussian matrices. While the typical magnitude of the permanent has been established for discrete random matrices, the complex Gaussian case, which governs transition amplitudes in linear optical networks, has remained open. Here, we establish a weak anti-concentration bound by upper-bounding the probability that a random Gaussian permanent is superexponentially smaller than its standard deviation. Tightening this bound to an inverse-polynomial fraction would prove the original PACC. As a corollary, we establish the typical magnitude of Gaussian permanents, on par with Tao and Vu's seminal result for Bernoulli matrices. Combined with the Aaronson-Arkhipov framework, our result implies that classically simulating boson sampling to within a superexponentially small total variation distance would collapse the polynomial hierarchy, assuming the remaining conjectures hold.