arXiv subjects

Gianluca Esposito

Publications and source records attributed to Gianluca Esposito.

10 recordsLinked to original sources

arXiv2026

Nonstabilizerness of quantum tensor network states is intractable in two dimensions

Nonstabilizerness is a necessary resource for quantum systems to lie beyond the classically simulable regime. With the advent of stabilizer $α$-Rényi entropies, nonstabilizerness has also become a many-body diagnostic, complementary to entanglement. While deciding whether an arbitrary quantum state has nonstabilizerness is provably hard, such states already require a description exponentially large in the number of qubits and are thus out of reach for many-body physics. Here we instead consider 2D tensor network (TN) states, which compactly capture states obeying an entanglement area law, and ask whether they admit a simpler algorithm for the same task. In contrast to the 1D case, we prove that, even at small, constant bond dimension, computing the stabilizer entropy of 2D TN states is $\#\mathrm{P}$-hard for any integer $α\ge 2$, and deciding stabilizer membership is $\mathrm{C_=P}$-complete. The corresponding constant-accuracy problems remain $\mathrm{C_= P}$-hard. We further prove that deciding whether a PEPS can be transformed into a stabilizer state by local unitaries over a specified bipartition is $\mathrm{C_= P}$-hard. Under standard complexity assumptions, these results rule out classical or quantum algorithms with polynomial resources for all three tasks in the worst case.

quant-ph↗

arXiv2026

Probes of chaos over the Clifford group and approach to Haar values

Chaotic behavior of quantum systems can be characterized by the adherence of the expectation values of given probes to moments of the Haar distribution. In this work, we analyze the behavior of several probes of chaos using a technique known as Isospectral Twirling [1]. This consists in fixing the spectrum of the Hamiltonian and picking its eigenvectors at random. Here, we study the transition from stabilizer bases to random bases according to the Haar measure by T-doped random quantum circuits. We then compute the average value of the probes over ensembles of random spectra from Random Matrix Theory, the Gaussian Diagonal Ensemble and the Gaussian Unitary Ensemble, associated with non-chaotic and chaotic behavior respectively. We also study the behavior of such probes over the Toric Code Hamiltonian.

quant-ph↗

arXiv2026

Non-stabilizerness and violations of CHSH inequalities

We study quantitatively the interplay between entanglement and non-stabilizer resources in violating the CHSH inequalities. We show that, while non-stabilizer resources are necessary, they must have a specific structure, namely they need to be both asymmetric and (surprisingly) {\it local}. We employ stabilizer entropy (SE) to quantify the non-stabilizer resources involved and the probability of violation given the resources. We show how spectral quantities related to the flatness of entanglement spectrum and its relationship with non-local SE affect the CHSH inequality. Finally, we utilize these results - together with tools from representation theory - to construct a systematic way of building ensembles of states with higher probability of violation.

quant-ph↗

arXiv2026

Stabilizer entropy is trustworthy for mixed states

Quantifying non-stabilizerness in mixed states is provably intractable, as any strict monotone requires superexponential time. We propose a linear Stabilizer Entropy that acts as a proper non-stabilizerness monotone with overwhelming probability when restricted to non-adaptive Clifford channels acting on flat mixed stabilizer states. Analytical and numerical results for Haar-random states, Clifford orbits, and random matrix product states show that monotonicity violation probabilities decay as $\exp-ηN$. We also prove the validity of Stabilizer Entropy in specific many-body systems undergoing partial measurements, where the amount of resource never increases for each measurement outcome as well as when averaged over outcome probabilities. Given the hardness of strict alternatives, Stabilizer Entropy emerges as a practical and theoretically justified resource measure.

quant-ph↗

arXiv2026

Experimental demonstration of non-local magic in a superconducting quantum processor

Non-local magic is the non-stabilizerness that no local unitary operation can erase. It captures the joint action of entanglement and magic underlying quantum advantage, and it has never been measured on quantum hardware. Here we report its first experimental demonstration, on a superconducting quantum processing unit, through two independent routes: an optimal local-erasure protocol and a direct, state-agnostic measurement of subsystem purity. The two agree with each other and with theory. Exploiting direct access to the device, we construct a noise model with no free parameters that identifies readout error and a depolarizing controlled-Z channel as the dominant mechanisms, and we show that local and non-local magic can be addressed separately, erasing local magic in situ while preserving the non-local part. Non-local magic provides a hardware benchmark beyond standard gate-fidelity protocols and points toward more reliable pre-fault tolerant devices.The same tools underlie a purity-estimation protocol with exponential speedup and the decoding of Hawking radiation in a black-hole toy model.

quant-ph↗

arXiv2026

Magic of discrete lattice gauge theories

Simulation of quantum field theories and fundamental interactions are one of the most challenging tasks in modern particle physics. Classical computers generally fail to reproduce accurate results when it comes to strongly coupled theories such as QCD. Recent developments in quantum technologies open up the possibility of simulating such physical regimes by using quantum computers. In this paper, we study the quantum resource related to the simulability of a quantum theory, i.e. non-stabilizerness for Lattice Gauge Theory (LGT) with discrete symmetry gauge groups. We show that enforcing gauge constraints for $\mathbb{Z}_l$ LGTs has no cost in terms of this resource and discuss the relation between non-abelianity of the gauge group with the average non-stabilizerness of the gauge invariant Hilbert space.

hep-lat↗

arXiv2025

Entanglement and Stabilizer entropies of random bipartite pure quantum states

The interplay between non-stabilizerness and entanglement in random states is a very rich arena of study for the understanding of quantum advantage and complexity. In this work, we tackle the problem of such interplay in random pure quantum states. We show that while there is a strong dependence between entanglement and magic, they are, surprisingly, perfectly uncorrelated. We compute the expectation value of non-stabilizerness given the Schmidt spectrum (and thus entanglement). At a first approximation, entanglement determines the average magic on the Schmidt orbit. However, there is a finer structure in the average magic distinguishing different orbits where the flatness of entanglement spectrum is involved.

quant-ph↗

arXiv2024

Phase transition in Stabilizer Entropy and efficient purity estimation

Stabilizer Entropy (SE) quantifies the spread of a state in the basis of Pauli operators. It is a computationally tractable measure of non-stabilizerness and thus a useful resource for quantum computation. SE can be moved around a quantum system, effectively purifying a subsystem from its complex features. We show that there is a phase transition in the residual subsystem SE as a function of the density of non-Clifford resources. This phase transition has important operational consequences: it marks the onset of a subsystem purity estimation protocol that requires $poly(n)exp(t)$ many queries to a circuit containing $t$ non-Clifford gates that prepares the state from a stabilizer state. Then, for $t=O(\log_2 n)$, it estimates the purity with polynomial resources and, for highly entangled states, attains an exponential speed-up over the known state-of-the-art algorithms.

quant-ph↗

arXiv2024

Stabilizer entropy of quantum tetrahedra

How complex is the structure of quantum geometry? In several approaches, the spacetime atoms are obtained by the SU(2) intertwiner called quantum tetrahedron. The complexity of this construction has a concrete consequence in recent efforts to simulate such models and toward experimental demonstrations of quantum gravity effects. There are, therefore, both a computational and an experimental complexity inherent to this class of models. In this paper, we study this complexity under the lens of stabilizer entropy (SE). We calculate the SE of the gauge-invariant basis states and its average in the SU(2) gauge invariant subspace. We find that the states of definite volume are singled out by the (near) maximal SE and give precise bounds to the verification protocols for experimental demonstrations on available quantum computers.

hep-th↗

arXiv2021

Improving the efficacy of Deep Learning models for Heart Beat detection on heterogeneous datasets

Deep Learning (DL) have greatly contributed to bioelectric signals processing, in particular to extract physiological markers. However, the efficacy and applicability of the results proposed in the literature is often constrained to the population represented by the data used to train the models. In this study, we investigate the issues related to applying a DL model on heterogeneous datasets. In particular, by focusing on heart beat detection from Electrocardiogram signals (ECG), we show that the performance of a model trained on data from healthy subjects decreases when applied to patients with cardiac conditions and to signals collected with different devices. We then evaluate the use of Transfer Learning (TL) to adapt the model to the different datasets. In particular, we show that the classification performance is improved, even with datasets with a small sample size. These results suggest that a greater effort should be made towards generalizability of DL models applied on bioelectric signals, in particular by retrieving more representative datasets.

stat.ML↗