arXiv subjects

Poetri Sonya Tarabunga

Publications and source records attributed to Poetri Sonya Tarabunga.

At least 19 recordsLinked to original sources

arXiv2026

Pauli spectrum and nonstabilizerness of random fermionic Gaussian states

We characterize the magic of random fermionic Gaussian states through their Pauli spectrum and their stabilizer entropies. For the Haar ensemble of Majorana Gaussian states we derive closed finite-$N$ expressions for the average stabilizer purities and reconstruct the Pauli spectrum exactly, as a mixture of products of beta-distributed variables resolved by Majorana weight. The stabilizer entropies, and their filtered versions, freeze at Rényi index $q_c=2$: for $q>2$ the magic density is $1/(q-1)$, controlled by rare weight-two Majorana strings. Resolving these contributions requires exponentially many characteristic samples, making direct sampling estimates of the stabilizer entropies inefficient in this frozen regime. For Haar-random Gaussian states at fixed filling, we express the averaged stabilizer purities at positive integer $q$ as coefficient integrals over $\mathrm{SU}(2q)$, with dimension independent of $N$, and evaluate the $q=2$ case exactly. We establish that the frozen density describes typical states in the Majorana and half-filled number-conserving ensembles and relate these ensembles to the corresponding $\mathrm{SYK}_2$ ground states. Finally, we show that typical fermionic Gaussian states retain certified magic after discarding any fixed fraction $κ<κ_\star^{\rm G}\simeq0.7613$ of their modes in the thermodynamic limit, remaining magical even beyond the $2/3$ threshold for Haar-random states in the full Hilbert space.

quant-ph↗

arXiv2026

Fermionic non-Gaussianity via Bell sampling: monotones and efficient quantum algorithms

Fermionic non-Gaussianity is an essential resource for unlocking the full computational power of fermionic quantum platforms. In this work we develop monotones and efficient quantum algorithms for fermionic non-Gaussianity, all built on the eigenvalue structure of the operator $Λ= \sum_{j=1}^{2n}γ_j\otimesγ_j$ defined on two copies of an $n$-mode fermionic state, accessible via Bell sampling. In particular, we introduce the \emph{bridge degree} of even pure states, a novel non-Gaussianity monotone defined as the largest eigenvalue of $Λ$ whose eigenspace is populated by two copies of the state. Our key technical result is that the bridge degree is non-increasing under post-selected Gaussian protocols, which yields no-go theorems for Gaussian conversion beyond the reach of previously known monotones and shows that the resource theory of fermionic non-Gaussianity is irreversible in the exact-conversion setting. Beyond this, the bridge degree exhibits several further features: it (i) is easy to compute, (ii) is efficiently witnessed through Bell sampling, (iii) lower-bounds the non-Gaussian gate complexity of state preparation, (iv) controls the non-Gaussian gate complexity of producing quantum state designs, and (v) naturally extends to mixed states via the Choi--Jamiołkowski isomorphism. We further develop an approximate variant together with an efficiently measurable lower bound, yielding an experimentally certifiable lower bound on the non-Gaussian cost of approximately preparing any state, based directly on Bell-sampling data. Finally, the same eigenvalue structure underlies two Bell-sampling-based algorithmic primitives, both with polynomial sample complexity: a two-copy Gaussianity test with perfect completeness, optimal among two-copy tests sharing this property, and a test for the state $2$-design property of matchgate-invariant ensembles.

quant-ph↗

arXiv2026

Williamson majorization theory of fermionic non-Gaussianity

Pure-state entanglement rests on a single algebraic backbone: majorization of the Schmidt spectrum governs state conversion under local operations and classical communication, and constrains entanglement monotones. Here we establish a corresponding majorization law for fermionic non-Gaussianity, the resource that elevates free fermions to universal quantum computation. Under any fermionic Gaussian protocol with pure state outcomes, the Williamson spectrum of a pure state's Majorana covariance matrix is weakly majorized by its ensemble average. This spectral law mirrors that of entanglement theory. It turns computable non-Gaussianity quantifiers such as fermionic antiflatness and occupation entropies into strong monotones for fermionic non-Gaussianity, and delivers necessary conditions and converse bounds on state conversion under Gaussian protocols. When fermion parity is conserved, no catalyst can remove a majorization obstruction---unless it carries parity coherence---and asymptotic interconversion is irreversible already for pure states. All relevant quantities are accessible from two-point Majorana correlators, turning the theory developed here into experimentally observable properties of quantum matter, testable on present-day quantum devices.

quant-ph↗

arXiv2026

Quantifying mixed-state entanglement via partial transpose and realignment moments

Entanglement plays a crucial role in quantum information science and many-body physics, yet quantifying it in mixed quantum many-body systems has remained a notoriously difficult problem. Here, we introduce families of quantitative entanglement witnesses, constructed from partial transpose and realignment moments, which provide rigorous bounds on entanglement monotones as well as entanglement dimensionality. Our witnesses can be efficiently measured using SWAP tests or variants of Bell measurements, thus making them directly implementable on current hardware. Leveraging our witnesses, we present several novel results on entanglement properties of mixed states, both in quantum information and many-body physics. We develop efficient algorithms to test whether mixed states with bounded entropy have low or high entanglement, which previously was only possible for pure states. We also provide an efficient algorithm to test the Schmidt rank using only two-copy measurements, and the operator Schmidt rank using four-copy measurements. Further, our witnesses robustly certify the quantum circuit depth in the presence of noise, as well as the Schmidt rank of mixed states. Finally, we show that the entanglement phase diagram of Haar random states, quantified by the partial transpose negativity, can be fully established solely by computing our witness, a result that also applies to any state $4$-design. Our witnesses can also be efficiently computed for matrix product states, thus enabling the characterization of entanglement in extensive many-body systems. Finally, we make progress on the entanglement required for quantum cryptography, establishing rigorous limits on pseudoentanglement and pseudorandom density matrices with bounded entropy. Our work opens new avenues for quantifying entanglement in large and noisy quantum systems.

quant-ph↗

arXiv2026

Computable fermionic non-Gaussianity from the covariance matrix

Fermionic non-Gaussianity, or fermionic magic, is a key resource underlying the computational complexity of fermionic quantum systems, yet tractable and operationally meaningful ways to quantify it remain limited. We address this challenge by developing a convex resource theory of fermionic non-Gaussianity and introducing two families of computable quantities for pure fermionic states, both derived from the Williamson normal form of the covariance matrix. The first family, occupation number entropies, is defined as the Tsallis-$α$ entropy of the occupation numbers. We prove that one member of this family is monotonic under Gaussian protocols, establishing it as a computable convex resource monotone. It consequently lower bounds the number of non-Gaussian gates needed for state preparation. The second family, natural-orbital participation entropies, is given by the Rényi-$α$ entropy of the squared amplitudes of the state in the natural-orbital basis, defined by the eigenvectors of the covariance matrix. They quantify state compressibility in this basis and thus upper bound the classical simulation cost in an orthonormal Gaussian basis. We analyze both families for stabilizer and translation-invariant states, where they simplify and reveal additional structure. We further study representative examples, including random SWAP-doped matchgate circuits and the bond-modulated XXZ model, highlighting the role of non-Gaussianity in many-body phenomena. Our work establishes a resource-theoretic framework for computable fermionic non-Gaussianity that unifies notions arising across quantum information, condensed-matter physics, and quantum chemistry, opening new directions for studying the complexity of quantum many-body systems and providing practical tools to assess the classical simulability of fermionic states relevant for quantum advantage.

quant-ph↗

arXiv2026

Unitary Designs from Doped Matchgate Circuits

Matchgate circuits realize free-fermion dynamics: they are efficiently classically simulable, yet cannot on their own generate the generic randomness required for universal computation or unitary design formation. We study a controlled route beyond this integrable limit by doping matchgate circuits with non-Gaussian gates-physically, the injection of fermionic interactions into an otherwise free system. Using the matchgate commutant framework, we obtain analytic control over unitary $2$-design formation. For globally scrambled dynamics, the design problem maps exactly onto a classical birth-death Markov chain with an Ornstein-Uhlenbeck continuum limit, recasting the emergence of quantum randomness in terms of spectral gaps and mixing times and yielding rigorous bounds on the number of non-Gaussian gates needed for approximate $2$-designs. These bounds hold for a broad class of parity-preserving non-Gaussian gates, independently of microscopic details, with numerics indicating that the same mechanism governs higher-order designs. Used as local building blocks in a glued-circuit architecture, they yield approximate parity-preserving $2$-designs in polylogarithmic depth with a sparse non-Gaussian gate count, with implications for Page-like entanglement growth and fermionic classical-shadow protocols. Finally, locality reshapes this picture: in local brickwork dynamics, design formation is diffusion-limited and far slower. Our results establish doped matchgate circuits as a controlled, analytically tractable route from free fermions to interaction-generated quantum designs.

quant-ph↗

arXiv2026

Theory of the Matchgate Commutant

In quantum information theory and statistical physics, symmetries of multiple copies, or replicas, of a system play a pivotal role. For unitary ensembles, these symmetries are encoded in the replicated commutant: the algebra of operators commuting with the ensemble across $k$ replicas. Determining the commutant is straightforward for the full unitary group, but remains a major obstacle for structured, computationally relevant circuit families. We solve this problem for matchgate circuits, which prepare fermionic Gaussian states on $n$ qubits. Using a Majorana fermion representation, we show that operators coupling different system copies generate the orthogonal Lie algebra $\mathfrak{so}(k)$, endowing the space of invariants with rich and tractable structure. This underlying symmetry decomposes the matchgate commutant into irreducible sectors, which we completely resolve via a Gelfand--Tsetlin construction. We provide an explicit orthonormal basis of the matchgate commutant for all $k$ and $n$, together with a formula for its dimension that grows polynomially in $n$. Furthermore, we characterize the commutant of the Clifford--matchgate subgroup, showing that restricting to signed permutations of Majorana modes yields a commutant that qualitatively diverges from the matchgate case for $k \geq 4$ replicas. Ultimately, our orthonormal basis turns algebraic classification into a working toolbox. Using it, we derive closed-form expressions for matchgate twirling channels and a fermionic analogue of Weingarten calculus, the projector encoding all moments of the Gaussian state orbit, state and unitary frame potentials, the average nonstabilizerness of fermionic Gaussian states, a systematic hierarchy of non-Gaussianity measures, and a fermionic de Finetti theorem.

quant-ph↗

arXiv2025

Topological magic response in quantum spin chains

Topological matter provides natural platforms for robust, non-local information storage, central to quantum error correction. Yet, while the relation between entanglement and topology is well established, little is known about the role of nonstabilizerness (or magic), a pivotal concept in fault-tolerant quantum computation, in topological phases. We introduce the concept of topological magic response, the ability of a state to spread over stabilizer space when perturbed by finite-depth non-Clifford circuits. Unlike a topological invariant or order parameter, this response function probes how a phase reacts to non-Clifford perturbations, revealing the presence of non-local quantum correlations. In Ising-type spin chains, we show that symmetry-broken and paramagnetic phases lack such a response, whereas symmetry-protected topological (SPT) phases always display it. To capture this, we utilize a combination of stabilizer Rényi entropies that, in analogy with topological entanglement entropy, isolates non-locally stored information. Using exact analytic computations and matrix product states simulations based on an algorithmic technique we introduce, we show that SPT phases doped with $T$ gates support robust topological magic response, while trivial phases remain featureless.

quant-ph↗

arXiv2025

Bell sampling in Quantum Monte Carlo simulations

Quantum Monte Carlo (QMC) methods are essential for the numerical study of large-scale quantum many-body systems, yet their utility has been significantly hampered by the difficulty in computing key quantities such as off-diagonal operators and entanglement. This work introduces Bell-QMC, a novel QMC framework leveraging Bell sampling, a two-copy measurement protocol in the transversal Bell basis. We demonstrate that Bell-QMC enables an efficient and unbiased estimation of both challenging classes of observables, offering a significant advantage over previous QMC approaches. Notably, the entanglement across all system partitions can be computed in a single Bell-QMC simulation. We implement this method within the stochastic series expansion (SSE), where we design an efficient update scheme for sampling the configurations in the Bell basis. We demonstrate our algorithm in the one-dimensional transverse-field Ising model and the two-dimensional $\mathbb{Z}_2$ lattice gauge theory, extracting universal quantum features using only simple diagonal measurements. This work establishes Bell-QMC as a powerful framework that significantly expands the accessible quantum properties in QMC simulations, providing a substantial advantage over conventional QMC.

quant-ph↗

arXiv2025

Emergent dipole field theory in atomic ladders

We study the dynamics of hard-core bosons on ladders, in the presence of strong kinetic constrains akin to those of the Bariev model. We use a combination of analytical methods and numerical simulations to establish the phase diagram of the model. The model displays a paired Tomonaga-Luttinger liquid phase featuring an emergent dipole symmetry, which encodes the local pairing constraint into a global, nonlocal quantity. We scrutinize the effect of such emergent low-energy symmetry during quench dynamics including single-particle defects. We observe that, despite being approximate, the dipole symmetry still leads to very slow relaxation dynamics, which we model via an effective field theory. The model we discuss is amenable to realization in both cold atoms in optical lattices and Rydberg atom arrays with dynamics taking place solely in the Rydberg manifold. To observe the unusual dynamics of excitations in such experimental platforms, we propose a two-step protocol, which starts with the quasi-adiabatic preparation of low-energy states, followed by the local creation of defects and their study under quench dynamics.

cond-mat.quant-gas↗

arXiv2025

Efficient mutual magic and magic capacity with matrix product states

Stabilizer Rényi entropies (SREs) probe the non-stabilizerness (or magic) of many-body systems and quantum computers. Here, we introduce the mutual von-Neumann SRE and magic capacity, which can be efficiently computed in time $O(Nχ^3)$ for matrix product states (MPSs) of bond dimension $χ$. We find that mutual SRE characterizes the critical point of ground states of the transverse-field Ising model, independently of the chosen local basis. Then, we relate the magic capacity to the anti-flatness of the Pauli spectrum, which quantifies the complexity of computing SREs. The magic capacity characterizes transitions in the ground state of the Heisenberg and Ising model, randomness of Clifford+T circuits, and distinguishes typical and atypical states. Finally, we make progress on numerical techniques: we design two improved Monte-Carlo algorithms to compute the mutual $2$-SRE, overcoming limitations of previous approaches based on local update. We also give improved statevector simulation methods for Bell sampling and SREs with $O(8^{N/2})$ time and $O(2^N)$ memory, which we demonstrate for $24$ qubits. Our work uncovers improved approaches to study the complexity of quantum many-body systems.

quant-ph↗

arXiv2025

Robustness of Magic in the quantum Ising chain via Quantum Monte Carlo tomography

We study the behavior of magic as a bipartite correlation in the quantum Ising chain across its quantum phase transition, and at finite temperature. In order to quantify the magic of partitions rigorously, we formulate a hybrid scheme that combines stochastic sampling of reduced density matrices via quantum Monte Carlo, with state-of-the-art estimators for the robustness of magic - a {\it bona fide} measure of magic for mixed states. This allows us to compute the mutual robustness of magic for partitions up to 8 sites, embedded into a much larger system. We show how mutual robustness is directly related to critical behaviors: at the critical point, it displays a power law decay as a function of the distance between partitions, whose exponent is related to the partition size. Once finite temperature is included, mutual magic retains its low temperature value up to an effective critical temperature, whose dependence on size is also algebraic. This suggests that magic, differently from entanglement, does not necessarily undergo a sudden death.

quant-ph↗

arXiv2025

Universal Spreading of Nonstabilizerness and Quantum Transport

We investigate how transport properties of $U(1)$-conserving dynamics impact the growth of quantum resources characterizing the complexity of many-body states. We quantify wave-function delocalization using participation entropy (PE), a measure rooted in the coherence theory of pure states, and assess nonstabilizerness through stabilizer Rényi entropy (SRE). Focusing on the XXZ spin chain initialized in domain-wall state, we demonstrate universal power-law growth of both PE and SRE, with scaling exponents explicitly reflecting the underlying transport regimes, ballistic, diffusive, or KPZ-type superdiffusive. Our results establish a solid connection between quantum resources and transport, providing insights into the dynamics of complexity within symmetry-constrained quantum systems.

quant-ph↗

arXiv2025

Efficient witnessing and testing of magic in mixed quantum states

Nonstabilizerness or `magic' is a crucial resource for quantum computers which can be distilled from noisy quantum states. However, determining the magic of mixed quantum has been a notoriously difficult task. Here, we provide efficient witnesses of magic based on the stabilizer Rényi entropy which robustly indicate the presence of magic and quantitatively estimate magic monotones. We also design efficient property testing algorithms to reliably distinguish states with high and low magic, assuming the entropy is bounded. We apply our methods to certify the number of noisy T-gates under a wide class of noise models. Additionally, using the IonQ quantum computer, we experimentally verify the magic of noisy random quantum circuits. Surprisingly, we find that magic is highly robust, persisting even under exponentially strong noise. Our witnesses can also be efficiently computed for matrix product states, revealing that subsystems of many-body quantum states can contain extensive magic despite entanglement. Finally, our work also has direct implications for cryptography and pseudomagic: To mimic high magic states with as little magic as possible, one requires an extensive amount of entropy. This implies that entropy is a necessary resource to hide magic from eavesdroppers. Our work uncovers powerful tools to verify and study the complexity of noisy quantum systems.

quant-ph↗

arXiv2025

Nonstabilizerness in U(1) lattice gauge theory

We present a thorough investigation of nonstabilizerness - a fundamental quantum resource that quantifies state complexity within the framework of quantum computing - in a one-dimensional U(1) lattice gauge theory. We show how nonstabilizerness is always extensive with volume, and has no direct relation to the presence of critical points. However, its derivatives typically display discontinuities across the latter: This indicates that nonstabilizerness is strongly sensitive to criticality, but in a manner that is very different from entanglement (that, typically, is maximal at the critical point). Our results indicate that error-corrected simulations of lattice gauge theories close to the continuum limit have similar computational costs to those at finite correlation length and provide rigorous lower bounds for quantum resources of such quantum computations.

quant-ph↗

arXiv2024

Stabilizer disentangling of conformal field theories

Understanding how entanglement can be reduced through simple operations is crucial for both classical and quantum algorithms. We investigate the entanglement properties of lattice models hosting conformal field theories cooled via local Clifford operations, a procedure we refer to as stabilizer disentangling. We uncover two distinct regimes: a constant gain regime, where disentangling is volume-independent, and a log-gain regime, where disentanglement increases with volume, characterized by a reduced effective central charge. In both cases, disentangling efficiency correlates with the target state magic, with larger magic leading to more effective cooling. The dichotomy between the two cases stems from mutual stabilizer Renyi entropy, which influences the entanglement cooling process. We provide an analytical understanding of such effect in the context of cluster Ising models, that feature disentangling global Clifford operations. Our findings indicate that matrix product states possess subclasses based on the relationship between entanglement and magic, and clarifying the potential of new classes of variational states embedding Clifford dynamics within matrix product states.

quant-ph↗

arXiv2024

A nonstabilizerness monotone from stabilizerness asymmetry

We introduce a nonstabilizerness monotone which we name basis-minimised stabilizerness asymmetry (BMSA). It is based on the notion of $G$-asymmetry, a measure of how much a certain state deviates from being symmetric with respect to a symmetry group $G$. For pure states, we show that the BMSA is a strong monotone for magic-state resource theory, while it can be extended to mixed states via the convex roof construction. We discuss its relation with other magic monotones, first showing that the BMSA coincides with the recently introduced basis-minimized measurement entropy, thereby establishing the strong monotonicity of the latter. Next, we provide inequalities between the BMSA and other nonstabilizerness measures known in the literature. Finally, we present numerical methods to compute the BMSA, highlighting its advantages and drawbacks compared to other nonstabilizerness measures in the context of pure many-body quantum states. We also discuss the importance of additivity and strong monotonicity for measures of nonstabilizerness in many-body physics, motivating the search for additional computable nonstabilizerness monotones.

quant-ph↗

arXiv2024

Magic transition in measurement-only circuits

Magic, also known as nonstabilizerness, quantifies the distance of a quantum state to the set of stabilizer states, and it serves as a necessary resource for potential quantum advantage over classical computing. In this work, we study magic in a measurement-only quantum circuit with competing types of Clifford and non-Clifford measurements, where magic is injected through the non-Clifford measurements. This circuit can be mapped to a classical model that can be simulated efficiently, and the magic can be characterized using any magic measure that is additive for tensor product of single-qubit states. Leveraging this observation, we study the magic transition in this circuit in both one- and two-dimensional lattices using large-scale numerical simulations. Our results demonstrate the presence of a magic transition between two different phases with extensive magic scaling, separated by a critical point in which the mutual magic exhibits scaling behavior analogous to entanglement. We further show that these two distinct phases can be distinguished by the topological magic. In a different regime, with a vanishing rate of non-Clifford measurements, we find that the magic saturates in both phases. Our work sheds light on the behavior of magic and its linear combinations in quantum circuits, employing genuine magic measures.

quant-ph↗