arXiv subjects

Ulysse Chabaud

Publications and source records attributed to Ulysse Chabaud.

At least 19 recordsLinked to original sources

arXiv2026

Rigorous characterization of continuous-variable quantum states via optical parametric amplifiers

Characterizing non-Gaussian quantum states is of paramount importance for continuous-variable quantum information processing, yet conventional homodyne-measurement-based state tomography remains limited by optical loss, detector efficiency, and measurement bandwidth. Here, we introduce an integrated framework for loss-tolerant characterization and certification using high-gain phase-sensitive optical parametric amplification and power measurements. Our computationally efficient semidefinite programming approach enables faithful reconstruction of parity-symmetric quantum states from amplified quadrature measurements while substantially relaxing detector-efficiency requirements and increasing the measurement bandwidth. We further develop a certification framework that directly quantifies non-Gaussianity via stellar-rank witnesses and Wigner negativity, using the same quadrature-power measurements. We demonstrate the efficacy of the proposed framework through both simulated and experimental data for representative quantum states, including single-photon, Schrodinger cat, and Gottesman-Kitaev-Preskill (GKP) states. By unifying loss-tolerant measurements, state tomography, and nonclassical-state certification within a single experimentally accessible framework, our approach provides a practical pathway toward verifying increasingly complex states and can be readily implemented with current quantum photonic technologies.

quant-ph↗

arXiv2026

Improved GKP magic states from error-corrected non-Gaussian quantum states

Gate teleportation, together with magic state distillation, is a promising route towards fault-tolerant, universal computation. In the context of bosonic quantum computation, Baragiola et al. PRL 123(20).200502 (2019) showed that within the framework of Gottesman--Kitaev--Preskill codes, encoded magic states suitable for distillation can be produced by error correcting Gaussian states, such as the vacuum. Here, we show that applying the same framework to simple non-Gaussian input states can significantly improve the quality of the magic states obtained, reducing the overall resources for the complete distillation procedure. We focus on superpositions of coherent states or Fock states, showing that many can lead to improvements in the generation of high-quality encoded magic states, which in some cases reduces the resources required for magic state distillation by about a factor $3$. We also investigate the primary source of these improvements and find that, unlike what was previously conjectured, the suitability of input states is not fully explained by symmetry arguments. Instead, the best states seem to avoid projection near stabilizer states as a result of the error correction procedure.

quant-ph↗

arXiv2026

Bosonic quantum error-correcting codes with finite stellar rank

Bosonic quantum error correction (QEC) relies on non-Gaussian bosonic encodings whose preparation cost is a central practical constraint. In this work, we use stellar rank as a resource measure to design and benchmark bosonic codes under finite non-Gaussian resources. For fixed cat and Gottesman--Kitaev--Preskill (GKP) code families, we show that finite stellar rank creates a trade-off among state approximability, energy, and logical protection under photon loss and photon-number dephasing, evaluated with optimal recovery. This trade-off implies that codewords with better ideal error-correction properties need not be optimal once finite-rank preparation constraints are imposed. Going beyond fixed-target codewords, we directly optimize bosonic encodings at fixed stellar rank, revealing noise-adapted code structures and concrete resource thresholds. Grid-like encodings emerge under photon loss, whereas approximately rotation-symmetric encodings arise under dephasing. In the optimized search, stellar rank k=2 suffices to surpass break-even for all dephasing strengths considered, while under photon loss the required rank increases with the loss rate. These results establish stellar rank as an operationally meaningful resource measure for bosonic QEC under practical state-preparation constraints.

quant-ph↗

arXiv2026

Local controllability of heralded quantum linear optics

Photonic linear optical networks provide a versatile platform for quantum information processing and quantum state engineering. However, the set of states that can be generated using passive linear optics alone is fundamentally constrained by bosonic symmetries. Heralding, based on conditional measurements on auxiliary modes, is a widely used technique to overcome these limitations and effectively enlarge the set of accessible states. Despite the widespread use of heralding, it is often unclear how specific ancillary resources impact the overall reachability of the target space. In this work, we investigate the local controllability of photonic states in linear optical networks by analyzing the rank of the Jacobian of the output state with respect to the underlying unitary circuit, which provides a quantitative measure of the dimension of the accessible tangent space at a given configuration. Our analysis ranges from passive linear optics to heralded linear optics, where auxiliary resources and conditional measurements are included. Within this framework, we quantify how different resources enlarge the locally accessible state space beyond that of passive linear optics and determine the resources required for the Jacobian rank to reach its maximal value, thereby achieving full local controllability. As maximal local rank is a necessary condition for global reachability, our framework offers a systematic tool to assess and compare the accessible state space of measurement-based photonic architectures, and to establish practical criteria for the resources needed in high-dimensional quantum state engineering.

quant-ph↗

arXiv2026

Exponentially-improved effective descriptions of physical bosonic systems

The effective description of a bosonic quantum system identifies the minimum finite dimension required to capture its essential dynamics. This effective dimension plays an important role in the complexity of classical and quantum algorithms for learning and simulating bosonic systems. While generic bosonic states require a dimension scaling as $1/\epsilon^2$ for a precision of approximation $\epsilon$, here we identify a natural energy condition which allows us to improve this scaling exponentially to $\log(1/\epsilon)$. We then prove that most bosonic quantum states satisfy this condition, and in particular those produced by combining Gaussian dynamics with generic energy-preserving dynamics, which include the output states of universal bosonic quantum circuits. We apply this finding to enhance learning algorithms for bosonic quantum states and we further obtain new classical simulation algorithms for a large class of bosonic systems. Finally, using efficient decompositions of Kerr gates as sums of Gaussian gates, we significantly refine these classical simulation algorithms for universal bosonic quantum circuits. Our results demonstrate that physical bosonic systems are significantly more well-behaved than previously assumed, allowing for efficient descriptions even at high precision.

quant-ph↗

arXiv2026

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

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-ph↗

arXiv2026

Lower Bounds on Coherent State Rank

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-ph↗

arXiv2026

Universality of Classically Trainable, Quantum-Deployed Boson-Sampling Generative Models

Recent work on the instantaneous quantum polynomial-time (IQP) quantum-circuit Born machine (QCBM) highlights a promising paradigm for generative modeling: train classically, deploy quantumly. In this setting, the training objective can be evaluated efficiently on a classical computer, while sampling from the resulting model may still be classically intractable. Furthermore, in the IQP-QCBM framework, extending the model family with ancillary qubits has been proven to yield universality. This paper asks whether similar results hold for linear-optical generative models. To this end, we introduce the Boson Sampling Born Machine (BSBM). Our analysis retraces analogous steps as were found for IQP-QCBMs with twists. Using recent results that enable classical approximation of broad classes of expectation values in linear optics, we show that BSBMs can be trained classically for wide families of loss functions. Next, we argue that "basic" BSBMs are not universal generative models, and that universality can be achieved by expanding the model while preserving efficient classical training and sampling hardness. In our approach, we introduce and analyze the role of constant-function postprocessing, generalizing the construction for IQP-QCBMs, which under suitable conditions can lead to universality while preserving the hardness of classically simulating the models. We showcase a family of BSBMs, characterized by a single hyperparameter, that allows for a monotonic increase in expressivity toward universality while retaining the capacity to represent ostensibly hard distributions. Furthermore, we discuss the possible modalities for the efficient classical training, in the sense of efficient estimation of gradients of the loss function.

quant-ph↗

arXiv2026

A unified framework for Bell inequalities from continuous-variable contextuality

Although the original EPR paradox was formulated in terms of position and momentum, most studies of these phenomena have focused on measurement scenarios with only a discrete number of possible measurement outcomes. Here, we present a framework for studying non-locality that is agnostic to the dimension of the physical systems involved, allowing us to probe purely continuous-variable, discrete-variable, or hybrid non-locality. Our approach allows us to find the optimal Bell inequality for any given measurement scenario and quantifies the amount of non-locality that is present in measurement statistics. This formalism unifies the existing literature on continuous-variable non-locality and allows us to identify new states in which Bell non-locality can be probed through homodyne detection. Notably, we find the first example of continuous-variable non-locality that cannot be mapped to a CHSH Bell inequality. Moreover, we provide several examples of simple hybrid DV-CV entangled states that could lead to near-term violation of Bell inequalities.

quant-ph↗

arXiv2025

Characterising the sets of quantum states with non-negative Wigner function

For Hilbert spaces $\mathcal H\subseteq L^2(\mathbb R)$ we consider the convex sets $\mathcal D_+(\mathcal H)$ of Wigner-positive states (WPS), i.e.~density matrices over $\mathcal H$ with non-negative Wigner function. We investigate the topological structure of these sets, namely concerning closure, compactness, interior and boundary (in a relative topology induced by the trace norm). We also study their geometric structure and construct minimal sets of states that generate $\mathcal D_+(\mathcal H)$ through convex combinations. If $\mathcal H$ is finite-dimensional, the existence of such sets follows from a central result in convex analysis, namely the Krein-Milman theorem. In the infinite-dimensional case $\mathcal H=L^2(\mathbb R)$ this is not so, due to lack of compactness of the set $\mathcal D_+(\mathcal H)$. Nevertheless, we prove that a Krein-Milman theorem holds in this case, which allows us to extend most of the results concerning the sets of generators to the infinite-dimensional setting. Finally, we study the relation between the finite and infinite-dimensional sets of WPS, and prove that the former provide a hierarchy of closed subsets, which are also proper faces of the latter. These results provide a basis for an operational characterisation of the extreme points of the sets of WPS, which we undertake in a companion paper. Our work offers a unified perspective on the topological and geometric properties of the sets of WPS in finite and infinite dimensions, along with explicit constructions of minimal sets of generators.

math-ph↗

arXiv2025

Extreme non-negative Wigner functions

Providing an operational characterization of the Wigner-positive states (WPS), i.e., the set of quantum states with non-negative Wigner function, is a longstanding open problem. For pure states, the only WPS are Gaussian states, but the situation is considerably more subtle for mixed states. Here, we approach the problem using convex geometry, reducing the question to the characterization of the extreme points of the set of WPS. We give a constructive method to generate a large class of such extreme WPS, which combines the following steps: (i) we characterize the phase-invariant extreme points of the superset of Wigner-positive quasi-states (WPQS); (ii) we introduce a new quantum map, named Vertigo map, which maps extreme WPQS to extreme WPS while preserving phase invariance; (iii) we identify families of extremality-preserving maps and use them to obtain extreme WPS while relaxing phase invariance. Our construction generates all extreme WPS of low dimension, starting from a specific kind of WPS known as beam-splitter states. Our results build upon new mathematical properties of the set of WPS derived in a companion paper and unveil the remarkable structure of mixed states with non-negative Wigner functions.

quant-ph↗

arXiv2025

Efficient certification of intractable quantum states with few Pauli measurements

Efficient verification of quantum computational resources is crucial as experiments advance toward fault-tolerance. Universal quantum computation can be achieved by consuming resource states through simple Pauli measurements, yet a significant gap remains between states that are easy to certify and those required for universality. We focus on \emph{Clifford-enhanced Product States}, a class of resource states obtained by applying Clifford circuits to a product of single-qubit, potentially magic, states. While essential for universal computation, the certification of such states has previously relied on query oracles that are \#P-hard to implement, leaving their efficient, oracle-free verification an open challenge. In this work, we demonstrate that such classically intractable resource states can be efficiently verified using only Pauli measurements. Our protocol achieves sample- and time-efficiency in both i.i.d.\ and adversarial settings. This work fills a gap in Pauli-based certification, providing a new practical pathway to verify resource states that drive universal Pauli-based quantum computation.

quant-ph↗

arXiv2025

Energy, Bosons and Computational Complexity

We investigate the role of energy, i.e. average photon number, as a resource in the computational complexity of bosonic systems. We show three sets of results: (1. Energy growth rates) There exist bosonic gate sets which increase energy incredibly rapidly, obtaining e.g. infinite energy in finite/constant time. We prove these high energies can make computing properties of bosonic computations, such as deciding whether a given computation will attain infinite energy, extremely difficult, formally undecidable. (2. Lower bounds on computational power) More energy ``='' more computational power. For example, certain gate sets allow poly-time bosonic computations to simulate PTOWER, the set of deterministic computations whose runtime scales as a tower of exponentials with polynomial height. Even just exponential energy and $O(1)$ modes suffice to simulate NP, which, importantly, is a setup similar to that of the recent bosonic factoring algorithm of [Brenner, Caha, Coiteux-Roy and Koenig (2024)]. For simpler gate sets, we show an energy hierarchy theorem. (3. Upper bounds on computational power) Bosonic computations with polynomial energy can be simulated in BQP, ``physical'' bosonic computations with arbitrary finite energy are decidable, and the gate set consisting of Gaussian gates and the cubic phase gate can be simulated in PP, with exponential bound on energy, improving upon the previous PSPACE upper bound. Finally, combining upper and lower bounds yields no-go theorems for a continuous-variable Solovay--Kitaev theorem for gate sets such as the Gaussian and cubic phase gates.

quant-ph↗

arXiv2025

On the role of coherence for quantum computational advantage

Quantifying the resources available to a quantum computer appears to be necessary to separate quantum from classical computation. Among them, entanglement, nonstabilizerness and coherence are arguably of great significance. We introduce path coherence as a measure of the coherent paths interferences arising in a quantum computation. Leveraging the sum-over-paths formalism, we obtain a classical algorithm for estimating quantum transition amplitudes, the complexity of which scales with path coherence. As path coherence relates to the hardness of classical estimation of quantum transition amplitudes, it provides a new perspective on the role of coherence in quantum computational advantage. Beyond their fundamental significance, our results have practical applications for simulating large classes of quantum computations with classical computers.

quant-ph↗

arXiv2025

Shedding light on classical shadows: learning photonic quantum states

Learning quantum state properties is both a fundamental and practical problem in quantum information theory. Classical shadows have emerged as an efficient method for estimating properties of unknown quantum states, with rigorous statistical guarantees, by performing randomized measurement on few copies of the state. With the advent of photonic technologies, formulating efficient learning algorithms for such platforms comes out as a natural problem. Here, we introduce a practical classical shadow protocol for learning photonic quantum states via randomized passive linear optical transformations and photon-number measurement. We provide rigorous theoretical guarantees showing that our scheme is sample- and time-efficient for measuring physical observables of interest. We experimentally demonstrate our photonic classical shadow protocol on both a twelve-mode and a twenty-four-mode integrated quantum processing unit, and showcase its versatility with five different applications, including Hamiltonian measurement and learning complex photonic states.

quant-ph↗

arXiv2025

When quantum resources backfire: Non-gaussianity and symplectic coherence in noisy bosonic circuits

Analyzing the impact of noise is of fundamental importance to understand the advantages provided by quantum systems. While the classical simulability of noisy discrete-variable systems is increasingly well understood, noisy bosonic circuits are more challenging to simulate and analyze. Here, we address this gap by introducing the $\textit{displacement propagation}$ algorithm, a continuous-variable analogue of Pauli propagation for simulating noisy bosonic circuits. By exploring the interplay of noise and quantum resources, we identify several computational phase transitions, revealing regimes where even modest noise levels render bosonic circuits efficiently classically simulable. In particular, our analysis reveals a surprising phenomenon: computational resources usually associated with bosonic quantum advantage, namely non-Gaussianity and symplectic coherence, can make the system easier to classically simulate in presence of noise.

quant-ph↗

arXiv2025

Bounding the computational power of bosonic systems

Bosonic quantum systems operate in an infinite-dimensional Hilbert space, unlike discrete-variable quantum systems. This distinct mathematical structure leads to fundamental differences in quantum information processing, such as an exponentially greater complexity of state tomography [MMB+24] or a factoring algorithm in constant space [BCCRK24]. Yet, it remains unclear whether this structural difference of bosonic systems may also translate to a practical computational advantage over finite-dimensional quantum computers. Here we take a step towards answering this question by showing that universal bosonic quantum computations can be simulated in polynomial space (and exponential time) on a classical computer, significantly improving the best previous upper bound requiring exponential memory [CJMM24]. In complexity-theoretic terms, we improve the best upper bound on $\textsf{CVBQP}$ from $ \textsf{EXPSPACE}$ to $\textsf{PSPACE}$. This result is achieved using a simulation strategy based on finite energy cutoffs and approximate coherent state decompositions. While we propose ways to potentially refine this bound, we also present arguments supporting the plausibility of an exponential computational advantage of bosonic quantum computers over their discrete-variable counterparts. Furthermore, we emphasize the role of circuit energy as a resource and discuss why it may act as the fundamental bottleneck in realizing this advantage in practical implementations.

quant-ph↗

arXiv2025

On the complex zeros of the wavefunction

The Schrödinger wavefunction is ubiquitous in quantum mechanics, quantum chemistry, and bosonic quantum information theory. Its zero-set for fermionic systems is well-studied and central for determining chemical properties, yet for bosonic systems the zero-set is less understood, especially in the context of characterizing non-classicality. Here we study the zeros of such wavefunctions and give them a novel information-theoretic interpretation. Our main technical result is showing that the wavefunction of most bosonic quantum systems can be extended to a holomorphic function over the complex plane, allowing the application of powerful techniques from complex analysis. As a consequence, we prove a version of Hudson's theorem for the wavefunction and characterize Gaussian dynamics as classical motion of the wavefunction zeros. Our findings suggest that the non-Gaussianity of quantum optical states can be detected by measuring a single quadrature of the electromagnetic field, which we demonstrate in a companion paper [arXiv:2507.23005]. More generally, our results show that the non-Gaussian features of bosonic quantum systems are encoded in the zeros of their wavefunction.

quant-ph↗