arXiv subjects

Martin Larocca

Publications and source records attributed to Martin Larocca.

At least 19 recordsLinked to original sources

arXiv2026

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph↗

arXiv2026

Ambient unitaries don't enable shallow group designs

Characterising the efficiency with which designs over various subsets of the unitary group may be constructed is an important goal of quantum information theory. While it is now known that approximate unitary designs can be realised in depth logarithmic in the system size, it has recently been shown that ensembles of local nearest-neighbour sublinear-depth one-dimensional circuits over the matchgate, orthogonal, and symplectic groups cannot form approximate 2-designs over their parent groups; similarly, sublinear-depth ensembles of Cliffords cannot form a Clifford 4-design. In this note we show that this remarkable exponential separation is not merely an artefact of restricting to ensembles consisting of unitaries from the subgroups themselves, but rather that no ensemble of local nearest-neighbour sublinear-depth unitaries can realise approximate designs in the aforementioned cases, even when employing "ambient" unitaries from beyond the subgroup itself (possibly acting on ancilla qubits). This implies that various natural tomography and benchmarking schemes which involves sampling from these groups suffer from a dramatic circuit depth overhead compared to similar protocols which involve sampling from the full unitary group. We additionally conclude that, in all of the above cases, the known linear-depth design constructions are up to constant factors optimal.

quant-ph↗

arXiv2026

Particle-preserving fermionic shadows with mode-independent sample complexity

We consider the problem of learning expectation values of particle-preserving operators with respect to an unknown $\eta$-particle $n$-mode fermionic state via classical shadows. Our main application is to estimating overlaps with arbitrary Slater determinant states: While it is known that such overlaps can, in the average case, be learnt to a fixed additive precision with a constant number of samples, the best-known worst case bound is $\mathcal{O}(\sqrt n \log n)$; here we improve this to $\mathcal{O}(\eta\log\eta)$, achieving a mode-independent sample cost. Our procedure is also computationally efficient, requiring only classical post-processing which for a generic dense orbital runs in time $\mathcal{O}(n\eta^2)$. For the task of estimating the expectation value of a general particle-preserving quadratic fermionic observable $h$, we prove a sample complexity bound of $\mathcal{O}(\eta \|h_0\|_2^2)$, where $h_0$ is the traceless component of $h$; the associated classical post-processing scales as $\mathcal{O}(n^2\eta )$. Finally, we discuss implementation of the required randomization: in a first-quantized encoding, approximate unitary designs give circuit depths polylogarithmic in the number of modes, contrasting with linear-depth requirements for nearest-neighbor second-quantized matchgate implementations. On the technical side, our proof reduces the extremal shadow variance to harmonic analysis on the AIII symmetric space $U(n)/(U(\eta)\times U(n-\eta))$ and evaluates the resulting integral using techniques from the theories of Jacobi ensembles and orthogonal polynomials, in a calculation which may be of independent interest.

quant-ph↗

arXiv2026

Classical shadows over symmetric spaces

Efficiently learning expectation values of unknown quantum states via classical shadows has become an important primitive in both theoretical and experimental aspects of quantum computation. Typically, classical shadow protocols involve randomised measurements induced by sampling uniformly randomly from a compact group, a situation which is now quite well understood. In this work we go beyond this standard assumption, studying the classical shadow protocols occasioned by sampling uniformly randomly from the so-called compact symmetric spaces. We uncover a unifying theory of such protocols, extending the extent to which the general theory of classical shadows is understood at a mathematical level. Interestingly, for the estimation of observables sampled from certain distributions we further find that some of these protocols allow for slight improvements in sample-complexity over existing shadow schemes.

quant-ph↗

arXiv2026

Classical shadows with arbitrary group representations

Classical shadows (CS) has recently emerged as an important framework to efficiently predict properties of an unknown quantum state. A common strategy in CS protocols is to parametrize the basis in which one measures the state by a random group action; many examples of this have been proposed and studied on a case-by-case basis. In this work, we present a unified theory that allows us to simultaneously understand CS protocols based on sampling from general group representations, extending previous approaches that worked in simplified (multiplicity-free) settings. We identify a class of measurement bases which we call "centralizing bases" that allows us to analytically characterize and invert the measurement channel, minimizing classical post-processing costs. We complement this analysis by deriving general bounds on the sample-complexity necessary to obtain estimates of a given precision. Beyond its unification of previous CS protocols, our method allows us to readily generate new protocols based on other groups, or different representations of previously considered ones. For example, we characterize novel shadow protocols based on sampling from the spin and tensor representations of $\textsf{SU}(2)$, symmetric and orthogonal groups, and the exceptional Lie group $G_2$.

quant-ph↗

arXiv2026

The commutant of fermionic Gaussian unitaries

In this work, we characterize the $t$-th order commutants of fermionic Gaussian unitaries and of their particle-preserving subgroup acting on $n$ fermionic modes. These commutants govern Haar averages over the corresponding groups and therefore play a central role in fermionic randomized protocols, invariant theory, and resource quantification. Using Howe dualities, we show that the particle-preserving commutant is generated by generalized copy-hopping operators, while that for general Gaussian commutant is generated by generalized quadratic Majorana bilinears together with parity. We then derive closed formulas for the dimensions of both commutants as functions of $t$ and $n$, and develop constructive Gelfand--Tsetlin procedures to obtain explicit orthonormal bases, with detailed low-$t$ examples. Our framework also clarifies the structure of replicated fermionic states and connects naturally to measures of fermionic correlations, generalized Pl\"ucker-type constraints, and the stabilizer entropy of fermionic Gaussian states. These results provide a unified algebraic description of higher-order invariants for fermionic Gaussian dynamics.

quant-ph↗

arXiv2026

Practical framework for simulating permutation-equivariant quantum circuits

Understanding which subclasses of quantum circuits are efficiently classically simulable is fundamental to delineating the boundary between classical and quantum computation. In this context, it is well known that certain tasks based on permutation-equivariant unitaries-i.e., $n$-qubit circuits whose action commutes with the qubit-permuting representation of the symmetric group $S_n$-can be simulated in polynomial time. However, existing approaches scale as $O(n^7)$, and can rapidly become prohibitively expensive. In this work, we introduce a practical algorithm for simulating $S_n$-equivariant circuits under the assumption that the gate generators are at most $k$-local, with $k\in O(1)$. The resulting method runs in $O(n^{\omega+1})$ time for constant depth, where $\omega$ is the matrix multiplication exponent, significantly lowering the polynomial degree compared to existing techniques. Finally, we numerically validate this scaling by simulating the dynamical evolution of the Lipkin-Meshkov-Glick model, and show that for $n=512$ spins, a standard laptop can compute the concurrence of the evolved state in under two minutes.

quant-ph↗

arXiv2026

Group Fourier filtering of quantum resources in quantum phase space

Recently, it has been shown that group Fourier analysis of quantum states, i.e., decomposing them into the irreducible representations (irreps) of a symmetry group, enables new ways to characterize their resourcefulness. Given that quantum phase spaces (QPSs) provide an alternative description of quantum systems, and thus of the group's representation, one may wonder how such harmonic analysis changes. In this work we show that for general compact Lie-group quantum resource theories (QRTs), the entire family of Stratonovich-Weyl quantum phase space representations-characterized by the Cahill-Glauber parameter $s$-has a clear resource-theoretic and signal-processing meaning. Specifically, changing $s$ implements a group Fourier filter that can be continuously tuned to favor low-dimensional irreps where free states have most of their support ($s=-1$), leave the spectrum unchanged ($s=0$), or highlight resourceful, high-dimensional irreps ($s=1$). As such, distinct QPSs constitute veritable group Fourier filters for resources. Moreover, we show that the norms of the QRT's free state Fourier components completely characterize all QPSs. Finally, we uncover an $s$-duality relating the phase space spectra of free states and typical (Haar-random) highly resourceful states through a shift in $s$. Overall, our results provide a new interpretation of QPSs and promote them to a signal-processing framework for diagnosing, filtering, and visualizing quantum resources.

quant-ph↗

arXiv2025

High-dimensional quantum Schur transforms

The quantum Schur transform has become a foundational quantum algorithm, yet even after two decades since the seminal 2005 paper by Bacon, Chuang, and Harrow (BCH), some aspects of the transform remain insufficiently understood. Moreover, an alternative approach proposed by Krovi in 2018 was recently found to contain a crucial error. In this paper, we present a corrected version of Krovi's algorithm along with a detailed treatment of the high-dimensional version of the BCH Schur transform. This high-dimensional focus makes the two versions of the transform practical for regimes where the number of qudits $n$ is smaller than the local dimension $d$, with Krovi's algorithm scaling as $\widetilde{O}(n^4)$ and BCH as $\widetilde{O}(\min(n^5,nd^4))$. Our work addresses a key gap in the literature, strengthening the algorithmic foundations of a wide range of results that rely on Schur--Weyl duality in quantum information theory and quantum computation.

quant-ph↗

arXiv2025

A unified approach to quantum resource theories and a new class of free operations

In quantum resource theories (QRTs) certain quantum states and operations are deemed more valuable than others. While the determination of the ``free'' elements is usually guided by the constraints of some experimental setup, this can make it difficult to study similarities and differences between QRTs. In this work, we argue that QRTs follow from the choice of a preferred algebraic structure $\mathcal{E}$ to be preserved, thus setting the free operations as the automorphisms of $\mathcal{E}$. We illustrate our finding by determining $\mathcal{E}$ for the QRTs of entanglement, Clifford stabilizerness, purity, imaginarity, fermionic Gaussianity, reference frames, thermodynamics and coherence; showing instances where $\mathcal{E}$ is a Lie algebra, group, ring, or even a simple set. This unified understanding allows us to generalize the concept of stochastic local operations and classical communication (SLOCC) to identify novel resource non-increasing operations for Lie-algebra based QRTs, thus finding a new solution to an open problem in the literature. We showcase the sanity of our new set of operations by rigorously proving that they map free states to free states, as well as determine more general situations where these transformations strictly do not increase the resource of a state.

quant-ph↗

arXiv2025

Characterizing quantum resourcefulness via group-Fourier decompositions

In this work we present a general framework for studying the resourcefulness in pure states for quantum resource theories (QRTs) whose free operations arise from the unitary representation of a group. We argue that the group Fourier decompositions (GFDs) of a state, i.e., its projection onto the irreducible representations (irreps) of the Hilbert space, operator space, and tensor products thereof, constitute fingerprints of resourcefulness and complexity. By focusing on the norm of the irrep projections, dubbed GFD purities, we find that low-resource states live in the small dimensional irreps of operator space, whereas high-resource states have support in more, and higher dimensional ones. Such behavior not only resembles that appearing in classical harmonic analysis, but is also universal across the QRTs of entanglement, fermionic Gaussianity, spin coherence, and Clifford stabilizerness. To finish, we show that GFD purities carry operational meaning as they lead to resourcefulness witnesses as well as to notions of state compressibility.

quant-ph↗

arXiv2025

No-go theorems for sublinear-depth group designs

Constructing ensembles of circuits which efficiently approximate the Haar measure over various groups is a long-standing and fundamental problem in quantum information theory. Recently it was shown that one can obtain approximate designs over the unitary group with depths scaling logarithmically in the number of qubits, but that no sublinear-depth approximate designs exist over the orthogonal group. Here we derive, for any group $G$ possessing an invariant state $G^{\otimes k} \lvert\Psi\rangle= \lvert\Psi\rangle$, a lower bound on the diamond distance between the $k$\textsuperscript{th} moment operator of any ensemble of elements of $G$, and that of the Haar measure over $G$. We then use this bound to prove that for many groups of interest, no subset of $G$ consisting of sublinear-depth one-dimensional circuits with local gates can form an approximate $k$-design over $G$. More generally, on a $D$-dimensional lattice, our results imply that such group designs require depths scaling at least as $n^{1/D}$. Moreover, for most of the groups we consider we find that such ensembles can, with high probability, be distinguished from $k$-designs by a single shot of a constant-depth measurement. Among other examples, we show that there is a constant separation between (a) the maximum depth and gate count for which no circuit can approximate even the second moment of random matchgate circuits, and (b) the depth and gate count required to implement the matchgate Haar distribution exactly. We furthermore rule out the existence of sublinear-depth $8$-designs over the Clifford group. Finally, we relax the assumption of working with local gates, and prove the impossibility of obtaining approximate designs over $G$ using any circuit comprised of a sublinear number of gates generated by Pauli strings.

quant-ph↗

arXiv2025

Optimal Haar random fermionic linear optics circuits

Sampling unitary Fermionic Linear Optics (FLO), or matchgate circuits, has become a fundamental tool in quantum information. Such capability enables a large number of applications ranging from randomized benchmarking of continuous gate sets, to fermionic classical shadows. In this work, we introduce optimal algorithms to sample over the non-particle-preserving (active) and particle-preserving (passive) FLO Haar measures. In particular, we provide appropriate distributions for the gates of $n$-qubit parametrized circuits which produce random active and passive FLO. In contrast to previous approaches, which either incur classical $\mathcal{O}(n^3)$ compilation costs or have suboptimal depths, our methods directly output circuits which simultaneously achieve an optimal down-to-the-constant-factor $\Theta(n)$ depth and $\Theta(n^2)$ gate count; with only a $\Theta(n^2)$ classical overhead. Finally, we also provide quantum circuits to sample Clifford FLO with an optimal $\Theta(n^2)$ gate count.

quant-ph↗

arXiv2024

Real classical shadows

Efficiently learning expectation values of a quantum state using classical shadow tomography has become a fundamental task in quantum information theory. In a classical shadows protocol, one measures a state in a chosen basis W after it has evolved under a unitary transformation randomly sampled from a chosen distribution U. In this work we study the case where U corresponds to either local or global orthogonal Clifford gates, and W consists of real-valued vectors. Our results show that for various situations of interest, this ``real'' classical shadow protocol improves the sample complexity over the standard scheme based on general Clifford unitaries. For example, when one is interested in estimating the expectation values of arbitrary real-valued observables, global orthogonal Cliffords decrease the required number of samples by a factor of two. More dramatically, for k-local observables composed only of real-valued Pauli operators, sampling local orthogonal Cliffords leads to a reduction by an exponential-in-k factor in the sample complexity over local unitary Cliffords. Finally, we show that by measuring in a basis containing complex-valued vectors, orthogonal shadows can, in the limit of large system size, exactly reproduce the original unitary shadows protocol.

quant-ph↗

arXiv2024

Random ensembles of symplectic and unitary states are indistinguishable

A unitary state $t$-design is an ensemble of pure quantum states whose moments match up to the $t$-th order those of states uniformly sampled from a $d$-dimensional Hilbert space. Typically, unitary state $t$-designs are obtained by evolving some reference pure state with unitaries from an ensemble that forms a design over the unitary group $\mathbb{U}(d)$, as unitary designs induce state designs. However, in this work we study whether Haar random symplectic states -- i.e., states obtained by evolving some reference state with unitaries sampled according to the Haar measure over $\mathbb{SP}(d/2)$ -- form unitary state $t$-designs. Importantly, we recall that random symplectic unitaries fail to be unitary designs for $t>1$, and that, while it is known that symplectic unitaries are universal, this does not imply that their Haar measure leads to a state design. Notably, our main result states that Haar random symplectic states form unitary $t$-designs for all $t$, meaning that their distribution is unconditionally indistinguishable from that of unitary Haar random states, even with tests that use infinite copies of each state. As such, our work showcases the intriguing possibility of creating state $t$-designs using ensembles of unitaries which do not constitute designs over $\mathbb{U}(d)$ themselves, such as ensembles that form $t$-designs over $\mathbb{SP}(d/2)$.

quant-ph↗

arXiv2024

Classical shadows with symmetries

Classical shadows (CS) have emerged as a powerful way to estimate many properties of quantum states based on random measurements and classical post-processing. In their original formulation, they come with optimal (or close to) sampling complexity guarantees for generic states and generic observables. Still, it is natural to expect to even further lower sampling requirements when equipped with a priori knowledge regarding either the underlying state or the observables. Here, we consider the case where such knowledge is provided in terms of symmetries of the unknown state or of the observables. Criterion and guidelines for symmetric shadows are provided. As a concrete example we focus on the case of permutation invariance (PI), and detail constructions of several families of PI-CSs. In particular, building on results obtained in the field of PI quantum tomography, we develop and study shallow PI-CS protocol. Benefits of these symmetric CS are demonstrated compared to established CS protocols showcasing vastly improved performances.

quant-ph↗

arXiv2024

Quantum Algorithms for Representation-Theoretic Multiplicities

Kostka, Littlewood-Richardson, Plethysm and Kronecker coefficients are the multiplicities of irreducible representations in the decomposition of representations of the symmetric group that play an important role in representation theory, geometric complexity and algebraic combinatorics. We give quantum algorithms for computing these coefficients whenever the ratio of dimensions of the representations is polynomial and study the computational complexity of this problem. We show that there is an efficient classical algorithm for computing the Kostka numbers under this restriction and conjecture the existence of an analogous algorithm for the Littlewood-Richardson coefficients. We argue why such classical algorithm does not straightforwardly work for the Plethysm and Kronecker coefficients and conjecture that our quantum algorithms lead to superpolynomial speedups for these problems. The conjecture about Kronecker coefficients was disproved by Greta Panova in [arXiv:2502.20253] with a classical solution which, if optimal, points to a $\OC(n^{4+2k})$ vs $\tilde{\Omega}(n^{4k^2+1})$ polynomial gap in quantum vs classical computational complexity for an integer parameter $k$.

quant-ph↗

arXiv2024

Gate-based quantum simulation of Gaussian bosonic circuits on exponentially many modes

We introduce a framework for simulating, on an $(n+1)$-qubit quantum computer, the action of a Gaussian Bosonic (GB) circuit on a state over $2^n$ modes. Specifically, we encode the initial bosonic state's expectation values over quadrature operators (and their covariance matrix) as an input qubit-state. This is then evolved by a quantum circuit that effectively implements the symplectic propagators induced by the GB gates. We find families of GB circuits and initial states leading to efficient quantum simulations. For this purpose, we introduce a dictionary that maps between GB and qubit gates such that particle- (non-particle-) preserving GB gates lead to real (imaginary) time evolutions at the qubit level. For the special case of particle-preserving circuits, we present a BQP-complete GB decision problem, indicating that GB evolutions of Gaussian states on exponentially many modes are as powerful as universal quantum computers. We also perform numerical simulations of an interferometer on $\sim8$ billion modes, illustrating the power of our framework.

quant-ph↗