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:2305.17099 · Optica Quantum

Simulation of quantum optics by coherent state decomposition

Jeffrey Marshall, Namit Anand

Published Nov 27, 2023• 16 citations
arXivHTMLPDF

Abstract

We introduce a framework for simulating quantum optics by decomposing the system into a finite rank (number of terms) superposition of coherent states. This allows us to define a resource theory, where linear optical operations are “free” (i.e., do not increase the rank), and the simulation complexity for an m -mode system scales quadratically in m , in stark contrast to the Hilbert space dimension. We outline this approach explicitly in the Fock basis, relevant in particular for Boson sampling, where the simulation time (space) complexity for computing output amplitudes, to arbitrary accuracy, scales as O ( m 2 2 n ) [ O ( m 2 n )] for n photons distributed among m modes. We additionally demonstrate that linear optical simulations with the n photons initially in the same mode scales efficiently, as O ( m 2 n ). This paradigm provides a practical notion of “non-classicality,” i.e., the classical resources required for simulation. Moreover, by making connections to the stellar rank formalism, we show this comes from two independent contributions, the number of single-photon additions and the amount of squeezing.

DOI
10.1364/opticaq.504311

Related papers

Lower Bounds on Coherent State Rank

Florian Cottier, Ulysse Chabaud

The approximate coherent state rank is the minimal number of (classical) coherent states required to approximate a continuous-variable bosonic quantum state and directly relates to the classical complexity of simulating bosonic computations. Despite its importance, little is known about lower bounds on this quantity, even for basic families of states. In this work, we initiate a systematic study of lower bounds on the approximate coherent state rank. Our contributions are as follows. (i) We introduce a technique based on low-rank approximation theory yielding generic lower bounds on the approximate coherent state rank of arbitrary single-mode states. (ii) Using this technique, we find a complete characterization of all single-mode states of finite approximate coherent state rank, and we obtain in particular analytical expressions for the approximate coherent state rank of squeezed states and of finite superpositions of Fock states. (iii) We further show that our single-mode lower bounds can be lifted to multimode lower bounds for finite superpositions of multimode Fock states. (iv) Finally, we prove a super-polynomial lower bound on the approximate coherent state rank of the $n$-mode Fock state $|1\rangle^{\otimes n}$, by exploiting a connection to the permanent. To do so, we show that the algebraic complexity of approximate multi-linear formulas for the permanent is super-polynomial, building upon the proof of a lower bound for exact formulas due to [Raz, JACM 2009]. Our results establish an unconditional barrier to efficient classical simulation of Boson Sampling via coherent state decompositions and connect non-classicality of bosonic quantum systems to central questions in algebraic complexity.

quant-pharXiv:2604.00766•Apr 2, 2026•0 citations

Classical simulation and quantum resource theory of non-Gaussian optics

Oliver Hahn, Ryuji Takagi, Giulia Ferrini +1 more

We propose efficient algorithms for classically simulating Gaussian unitaries and measurements applied to non-Gaussian initial states. The constructions are based on decomposing the non-Gaussian states into linear combinations of Gaussian states. We use an extension of the covariance matrix formalism to efficiently track relative phases in the superpositions of Gaussian states. We get an exact simulation algorithm, which costs quadratically with the number of Gaussian states required to represent the initial state, and an approximate simulation algorithm, which costs linearly with the l 1 norm of the coefficients associated with the superposition. We define measures of non-Gaussianity quantifying this simulation cost, which we call the Gaussian rank and the Gaussian extent. From the perspective of quantum resource theories, we investigate the properties of this type of non-Gaussianity measure and compute optimal decompositions for states relevant to continuous-variable quantum computing.

arXiv:2404.07115•Quantum•Oct 13, 2025•7 citations

Optimal stellar rank approximation of squeezed cat states with photon catalysis

Julian K. Nauth, Nathan Walk, Ananga M. Datta +4 more

Non-Gaussian quantum states and operations constitute essential resources for achieving quantum computational advantage and enabling quantum error correction in bosonic platforms. However, their generation in optical settings remains a challenging experimental task, often relying on probabilistic heralded protocols. Here, we present an in-depth analysis of the suitability of photon catalysis between low number Fock states and squeezed states for the generation of squeezed coherent state superpositions. We employ the stellar rank formalism to characterize the non-Gaussian complexity of input resources (including both states and measurements) and the generated states. This enables a systematic comparison of the fidelity between the catalyzed output and the target states to the maximum fidelity achievable by any protocol with the same non-Gaussian input resources. In this sense, we identify instances where the catalysis protocols considered here are provably optimal. We identify parameter regimes in which high-fidelity approximations of the target states can be achieved with minimal resources. Furthermore, we benchmark the performance of photon catalysis against Gaussian boson sampling-inspired protocols in terms of success probability and state quality, highlighting the advantages of deterministic Fock state sources. We also investigate the generation of related non-Gaussian resources including squeezed Fock states, relevant for quantum error correction. To account for experimental imperfections, we model losses across all optical modes using a Hilbert space truncation approach in the Fock basis and analyze the robustness of the generated states under realistic conditions. Our results quantify the trade-offs between non-Gaussian resource complexity, achievable fidelity, and losses in photon catalysis protocols, providing practical guidelines for near-term photonic implementations.

quant-pharXiv:2607.02427•Jul 3, 2026•0 citations

Efficient classical algorithm for estimating linear statistics of Boson Sampling

Benoit Seron, Hugo Thomas, Eduardo Araujo +3 more

Boson Sampling is a prominent candidate for the demonstration of quantum computational advantage but it remains unclear whether a large-scale boson sampler can find useful computational applications. The challenge is that to use a boson sampler to estimate, for example, a physical observable, it is necessary to coarse grain the outcome distribution, owing to the exponential size of the outcome space and the anti-concentration properties of the Boson Sampling distribution. In this work, we analyse the complexity of a specific type of coarse-graining of Boson Sampling distributions based on linear functions of the output photon occupation numbers, which we refer to as linear statistics. We present an efficient classical algorithm for approximating linear statistics of boson samplers within additive error for different kinds of input states, such as Fock states and squeezed states. This allows us to unify in the same framework recent results on efficient quantum-inspired classical algorithms for simulating molecular vibronic spectra, or efficient classical approximations of coarse-grained distributions based on detector binning. Additionally, we show how our algorithm can be used to classically evaluate a proposed one-way function based on Boson Sampling, while other proposals for cryptographic applications escape our classical simulation techniques. We leave open the question of classical simulability of non-linear statistics and connect it to the problem of computing transition amplitudes of linear-optical circuits with one layer of interactions.

quant-pharXiv:2609.35447•Sep 29, 2026•0 citations

Inefficiency of classically simulating linear optical quantum computing with Fock-state inputs

Bryan Gard, Jonathan P. Olson, Robert M. Cross +3 more

Aaronson and Arkhipov recently used computational complexity theory to argue that classical computers very likely cannot efficiently simulate linear, multimode, quantum-optical interferometers with arbitrary Fock-state inputs [Aaronson and Arkhipov, Theory Comput. 9, 143 (2013)]. Here we present an elementary argument that utilizes only techniques from quantum optics. We explicitly construct the Hilbert space for such an interferometer and show that its dimension scales exponentially with all the physical resources. We also show in a simple example just how the Schr\"odinger and Heisenberg pictures of quantum theory, while mathematically equivalent, are not in general computationally equivalent. Finally, we conclude our argument by comparing the symmetry requirements of multiparticle bosonic to fermionic interferometers and, using simple physical reasoning, connect the nonsimulatability of the bosonic device to the complexity of computing the permanent of a large matrix.

arXiv:1304.4206•Physical Review A•Feb 18, 2014•22 citations

Non-Gaussianity from superselection rules

Nicolas Moulonguet, Eloi Descamps, José Lorgeré +3 more

The quantum theory of the electromagnetic field enables the description of multiphoton states exhibiting nonclassical statistical properties, often reflected in non-Gaussian phase-space distributions. While non-Gaussianity alone does not fully characterize quantum states, several classifications have been proposed to hierarchize non-Gaussian states according to physically or informationally relevant resources. Here, we provide a physical interpretation of non-Gaussianity and connect it to a computational perspective by showing how a prominent classification-the stellar rank-emerges as a limiting case of the roots of polynomials that univocally represent bosonic states defined with a quantized phase reference, namely the Majorana polynomials. A direct consequence of our results is a revised interpretation of both the stellar rank and non-Gaussianity itself: when superselection rules are properly taken into account, quadrature non-Gaussianity - and nonzero stellar rank - act as witnesses of particle entanglement, rather than being linked with photon addition to Gaussian states as previously assumed. In addition, we show that because the stellar rank depends on a specific choice of coherent states, its relation to computational resources and potential quantum advantage is inherently basis-dependent, being naturally tied to quadrature eigenstates as the computational basis. Motivated by this observation, we generalize the notion of stellar rank to arbitrary computational bases, thereby establishing it as a genuine witness of bosonic resources that may enable quantum advantage.

quant-pharXiv:2603.20810•Physical Review Letters•Mar 24, 2026•0 citations
We introduce a framework for simulating quantum optics by decomposing the system into a finite rank (number of terms) superposition of coherent states. This allows us to define a resource theory, where linear optical operations are “free” (i.e., do not increase the rank), and the simulation complexity for an m -mode system scales quadratically in m , in stark contrast to the Hilbert space dimension. We outline this approach explicitly in the Fock basis, relevant in particular for Boson sampling, where the simulation time (space) complexity for computing output amplitudes, to arbitrary accuracy, scales as O ( m 2 2 n ) [ O ( m 2 n )] for n photons distributed among m modes. We additionally demonstrate that linear optical simulations with the n photons initially in the same mode scales efficiently, as O ( m 2 n ). This paradigm provides a practical notion of “non-classicality,” i.e., the classical resources required for simulation. Moreover, by making connections to the stellar rank formalism, we show this comes from two independent contributions, the number of single-photon additions and the amount of squeezing.
The approximate coherent state rank is the minimal number of (classical) coherent states required to approximate a continuous-variable bosonic quantum state and directly relates to the classical complexity of simulating bosonic computations. Despite its importance, little is known about lower bounds on this quantity, even for basic families of states. In this work, we initiate a systematic study of lower bounds on the approximate coherent state rank. Our contributions are as follows. (i) We introduce a technique based on low-rank approximation theory yielding generic lower bounds on the approximate coherent state rank of arbitrary single-mode states. (ii) Using this technique, we find a complete characterization of all single-mode states of finite approximate coherent state rank, and we obtain in particular analytical expressions for the approximate coherent state rank of squeezed states and of finite superpositions of Fock states. (iii) We further show that our single-mode lower bounds can be lifted to multimode lower bounds for finite superpositions of multimode Fock states. (iv) Finally, we prove a super-polynomial lower bound on the approximate coherent state rank of the nnn-mode Fock state ∣1⟩⊗n|1\rangle^{\otimes n}∣1⟩⊗n, by exploiting a connection to the permanent. To do so, we show that the algebraic complexity of approximate multi-linear formulas for the permanent is super-polynomial, building upon the proof of a lower bound for exact formulas due to [Raz, JACM 2009]. Our results establish an unconditional barrier to efficient classical simulation of Boson Sampling via coherent state decompositions and connect non-classicality of bosonic quantum systems to central questions in algebraic complexity.
We propose efficient algorithms for classically simulating Gaussian unitaries and measurements applied to non-Gaussian initial states. The constructions are based on decomposing the non-Gaussian states into linear combinations of Gaussian states. We use an extension of the covariance matrix formalism to efficiently track relative phases in the superpositions of Gaussian states. We get an exact simulation algorithm, which costs quadratically with the number of Gaussian states required to represent the initial state, and an approximate simulation algorithm, which costs linearly with the l 1 norm of the coefficients associated with the superposition. We define measures of non-Gaussianity quantifying this simulation cost, which we call the Gaussian rank and the Gaussian extent. From the perspective of quantum resource theories, we investigate the properties of this type of non-Gaussianity measure and compute optimal decompositions for states relevant to continuous-variable quantum computing.
Non-Gaussian quantum states and operations constitute essential resources for achieving quantum computational advantage and enabling quantum error correction in bosonic platforms. However, their generation in optical settings remains a challenging experimental task, often relying on probabilistic heralded protocols. Here, we present an in-depth analysis of the suitability of photon catalysis between low number Fock states and squeezed states for the generation of squeezed coherent state superpositions. We employ the stellar rank formalism to characterize the non-Gaussian complexity of input resources (including both states and measurements) and the generated states. This enables a systematic comparison of the fidelity between the catalyzed output and the target states to the maximum fidelity achievable by any protocol with the same non-Gaussian input resources. In this sense, we identify instances where the catalysis protocols considered here are provably optimal. We identify parameter regimes in which high-fidelity approximations of the target states can be achieved with minimal resources. Furthermore, we benchmark the performance of photon catalysis against Gaussian boson sampling-inspired protocols in terms of success probability and state quality, highlighting the advantages of deterministic Fock state sources. We also investigate the generation of related non-Gaussian resources including squeezed Fock states, relevant for quantum error correction. To account for experimental imperfections, we model losses across all optical modes using a Hilbert space truncation approach in the Fock basis and analyze the robustness of the generated states under realistic conditions. Our results quantify the trade-offs between non-Gaussian resource complexity, achievable fidelity, and losses in photon catalysis protocols, providing practical guidelines for near-term photonic implementations.
Boson Sampling is a prominent candidate for the demonstration of quantum computational advantage but it remains unclear whether a large-scale boson sampler can find useful computational applications. The challenge is that to use a boson sampler to estimate, for example, a physical observable, it is necessary to coarse grain the outcome distribution, owing to the exponential size of the outcome space and the anti-concentration properties of the Boson Sampling distribution. In this work, we analyse the complexity of a specific type of coarse-graining of Boson Sampling distributions based on linear functions of the output photon occupation numbers, which we refer to as linear statistics. We present an efficient classical algorithm for approximating linear statistics of boson samplers within additive error for different kinds of input states, such as Fock states and squeezed states. This allows us to unify in the same framework recent results on efficient quantum-inspired classical algorithms for simulating molecular vibronic spectra, or efficient classical approximations of coarse-grained distributions based on detector binning. Additionally, we show how our algorithm can be used to classically evaluate a proposed one-way function based on Boson Sampling, while other proposals for cryptographic applications escape our classical simulation techniques. We leave open the question of classical simulability of non-linear statistics and connect it to the problem of computing transition amplitudes of linear-optical circuits with one layer of interactions.
Aaronson and Arkhipov recently used computational complexity theory to argue that classical computers very likely cannot efficiently simulate linear, multimode, quantum-optical interferometers with arbitrary Fock-state inputs [Aaronson and Arkhipov, Theory Comput. 9, 143 (2013)]. Here we present an elementary argument that utilizes only techniques from quantum optics. We explicitly construct the Hilbert space for such an interferometer and show that its dimension scales exponentially with all the physical resources. We also show in a simple example just how the Schr\"odinger and Heisenberg pictures of quantum theory, while mathematically equivalent, are not in general computationally equivalent. Finally, we conclude our argument by comparing the symmetry requirements of multiparticle bosonic to fermionic interferometers and, using simple physical reasoning, connect the nonsimulatability of the bosonic device to the complexity of computing the permanent of a large matrix.
The quantum theory of the electromagnetic field enables the description of multiphoton states exhibiting nonclassical statistical properties, often reflected in non-Gaussian phase-space distributions. While non-Gaussianity alone does not fully characterize quantum states, several classifications have been proposed to hierarchize non-Gaussian states according to physically or informationally relevant resources. Here, we provide a physical interpretation of non-Gaussianity and connect it to a computational perspective by showing how a prominent classification-the stellar rank-emerges as a limiting case of the roots of polynomials that univocally represent bosonic states defined with a quantized phase reference, namely the Majorana polynomials. A direct consequence of our results is a revised interpretation of both the stellar rank and non-Gaussianity itself: when superselection rules are properly taken into account, quadrature non-Gaussianity - and nonzero stellar rank - act as witnesses of particle entanglement, rather than being linked with photon addition to Gaussian states as previously assumed. In addition, we show that because the stellar rank depends on a specific choice of coherent states, its relation to computational resources and potential quantum advantage is inherently basis-dependent, being naturally tied to quadrature eigenstates as the computational basis. Motivated by this observation, we generalize the notion of stellar rank to arbitrary computational bases, thereby establishing it as a genuine witness of bosonic resources that may enable quantum advantage.