arXiv subjects

Alioscia Hamma

Publications and source records attributed to Alioscia Hamma.

At least 37 records · Page 2Linked to original sources

arXiv2025

Interplay of entanglement structures and stabilizer entropy in spin models

Understanding the interplay between nonstabilizerness and entanglement is crucial for uncovering the fundamental origins of quantum complexity. Recent studies have proposed entanglement spectral quantities, such as antiflatness of the entanglement spectrum and entanglement capacity, as effective complexity measures, establishing direct connections to stabilizer Rényi entropies. In this work, we systematically investigate quantum complexity across a diverse range of spin models, analyzing how entanglement structure and nonstabilizerness serve as distinctive signatures of quantum phases. By studying entanglement spectra and stabilizer entropy measures, we demonstrate that these quantities consistently differentiate between distinct phases of matter. Specifically, we provide a detailed analysis of spin chains including the XXZ model, the transverse-field XY model, its extension with Dzyaloshinskii-Moriya interactions, as well as the Cluster Ising and Cluster XY models. Our findings reveal that entanglement spectral properties and magic-based measures serve as intertwined, robust indicators of quantum phase transitions, highlighting their significance in characterizing quantum complexity in many-body systems.

quant-ph↗

arXiv2025

Invested and Potential Magic Resources in Measurement-Based Quantum Computation

Magic states and magic gates are crucial for achieving universal quantum computation, but important questions about how magic resources should be implemented to attain maximal quantum advantage have remained unexplored, especially in the context of measurement-based quantum computation (MQC). This work bridges the gap between MQC and the resource theory of magic by introducing the key concepts of "invested" and "potential" magic resources. The former quantifies the magic cost associated with MQC, serving as both a resource witness and a feasible upper bound for the practical realization, and is gate-order independent; The latter represents the maximal achievable magic resource in a given graph structure defining MQC. We utilize both concepts to analyze the quantum Fourier transform (QFT) and provide a fresh perspective on the universality of MQC, highlighting the crucial role of non-Pauli measurements in injecting magic. In particular, we theoretically prove that high-dimensional graphs can generate an exponential advantage of MQC compared to classical computing. We demonstrate experimentally our theoretical findings in a high-fidelity four-photon setup, surpassing conventional magic state injection (MSI) methods in both qubit efficiency and resource utilization. Our findings pave the way for future research exploring magic resource optimization and novel distillation schemes within the MQC framework, advancing fault-tolerant universal quantum computation.

quant-ph↗

arXiv2025

The scrambling power of gravity in black hole radiation

The black hole information paradox remains a profound challenge in theoretical physics. Among the proposed resolutions, the soft-hair approach stands out for its independence from any specific quantum gravity model. In this paper, we investigate how the inclusion of soft degrees of freedom in the unitary evolution of quantum electrodynamics, within a spacetime collapsing into a Reissner-Nordstrom black hole, leads to information scrambling. By evaluating the tripartite mutual information of this unitary evolution, we estimate the degree of information scrambling in the corresponding quantum channel. Our results show that the presence of soft degrees of freedom induces scrambling of information initially encoded in hard degrees of freedom, driven by quantum electrodynamics interactions and the nontrivial transformations arising from the non-uniqueness of the vacuum in the collapsing spacetime. This lays the groundwork for a deeper understanding of the black hole information paradox, particularly the mechanisms behind information scrambling.

gr-qc↗

arXiv2025

Stabilizer Entropy and entanglement complexity in the Sachdev-Ye-Kitaev model

The Sachdev-Ye-Kitaev (SYK) model is of paramount importance for the understanding of both strange metals and a microscopic theory of two-dimensional gravity. We study the interplay between Stabilizer Rényi Entropy (SRE) and entanglement entropy in both the ground state and highly excited states of the SYK4+SYK2 model interpolating the highly chaotic four-body interactions model with the integrable two-body interactions one. The interplay between these quantities is assessed also through universal statistics of the entanglement spectrum and its anti-flatness. We find that SYK4 is indeed characterized by a complex pattern of both entanglement and non-stabilizer resources while SYK2 is non-universal and not complex. We discuss the fragility and robustness of these features depending on the interpolation parameter.

quant-ph↗

arXiv2025

Logarithmic light cone, slow entanglement growth, and quantum memory

Effective light cones, characterized by Lieb-Robinson bounds, emerge in nonrelativistic local quantum systems. Here, we present several analytical results derived from logarithmic light cones (LLCs). Possible origins of LLCs include the one-dimensional (1D) disordered XXZ model and a phenomenological model of many-body localization (MBL). In the LLC regime, we prove that, for arbitrary spatial dimensions and any initial pure state, entanglement growth is upper-bounded by logarithmic time with an additional subleading \emph{double-logarithmic} correction -- arising from a real asymptotic solution of the \emph{Lambert W} function -- valid up to the asymptotic time limit. In the context of the 1D disordered XXZ model, this result resolves the ambiguity in distinguishing between logarithmic and power-law fits of entanglement growth in numerical studies; we also propose a falsifiable phenomenological functional form for the entanglement growth that agrees with existing numerical results. We show that information scrambling is logarithmically slow in the LLC regime. Furthermore, we demonstrate that the LLC supports long-lived quantum memories -- quantum codes with macroscopic code distance and lifetimes that scale exponentially with system size -- under unitary time evolution. Our analytical results provide benchmarks for future numerical studies of the MBL regime at large time scales.

quant-ph↗

arXiv2025

Stabilizer entropy in non-integrable quantum evolutions

Entanglement and stabilizer entropy are both involved in the onset of complex behavior in quantum many-body systems. Their interplay is at the root of complexity of simulability, scrambling, thermalization and typicality. In this work, we study the dynamics of entanglement, stabilizer entropy, and the anti-flatness of the entanglement spectrum after a quantum quench in a spin chain. We find that free-fermion theories show a gap in the long-time behavior of these resources compared to their random matrix theory value while non-integrable models saturate it.

quant-ph↗

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

Bounded light cone and robust topological order out of equilibrium

The ground state degeneracy of topologically ordered gapped Hamiltonians is the bedrock for self-correcting quantum memories, which are unfortunately not stable away from equilibrium even at zero temperature. This plague precludes practical robust self-correction since stability at zero temperature is a prerequisite for finite-temperature robustness. In this work, we show that the emergence of a bounded light cone renders the unitary time evolution a quasi-adiabatic continuation that preserves topological order, with the initial ground space retaining its macroscopic distance at all times as a quantum code. We also show how bounded light cones can emerge through suitable perturbations in Kitaev's toric code and honeycomb model. Our results suggest that topological orders and self-correcting quantum memories can be dynamically robust at zero temperature.

quant-ph↗

arXiv2024

Learning t-doped stabilizer states

In this paper, we present a learning algorithm aimed at learning states obtained from computational basis states by Clifford circuits doped with a finite number $t$ of $T$-gates. The algorithm learns an exact tomographic description of $t$-doped stabilizer states in terms of Pauli observables. This is possible because such states are countable and form a discrete set. To tackle the problem, we introduce a novel algebraic framework for $t$-doped stabilizer states, which extends beyond $T$-gates and includes doping with any kind of local non-Clifford gate. The algorithm requires resources of complexity $\text{poly}(n,2^t)$ and exhibits an exponentially small probability of failure.

quant-ph↗

arXiv2024

Quantifying non-stabilizerness through entanglement spectrum flatness

Non-stabilizerness - also colloquially referred to as magic - is the a resource for advantage in quantum computing and lies in the access to non-Clifford operations. Developing a comprehensive understanding of how non-stabilizerness can be quantified and how it relates other quantum resources is crucial for studying and characterizing the origin of quantum complexity. In this work, we establish a direct connection between non-stabilizerness and entanglement spectrum flatness for a pure quantum state. We show that this connection can be exploited to efficiently probe non-stabilizerness even in presence of noise. Our results reveal a direct connection between non-stabilizerness and entanglement response, and define a clear experimental protocol to probe non-stabilizerness in cold atom and solid-state platforms.

quant-ph↗

arXiv2024

Geometric methods in quantum information and entanglement variational principle

Geometrical methods in quantum information are very promising for both providing technical tools and intuition into difficult control or optimization problems. Moreover, they are of fundamental importance in connecting pure geometrical theories, like GR, to quantum mechanics, like in the AdS/CFT correspondence. In this paper, we first make a survey of the most important settings in which geometrical methods have proven useful to quantum information theory. Then, we lay down a general framework for an action principle for quantum resources like entanglement, coherence, and anti-flatness. We discuss the case of a two-qubit system.

quant-ph↗

arXiv2024

Learning efficient decoders for quasi-chaotic quantum scramblers

Scrambling of quantum information is an important feature at the root of randomization and benchmarking protocols, the onset of quantum chaos, and black-hole physics. Unscrambling this information is possible given perfect knowledge of the scrambler [arXiv:1710.03363.]. We show that one can retrieve the scrambled information even without any previous knowledge of the scrambler, by a learning algorithm that allows the building of an efficient decoder. Remarkably, the decoder is classical in the sense that it can be efficiently represented on a classical computer as a Clifford operator. It is striking that a classical decoder can retrieve with fidelity one all the information scrambled by a random unitary that cannot be efficiently simulated on a classical computer, as long as there is no full-fledged quantum chaos. This result shows that one can learn the salient properties of quantum unitaries in a classical form, and sheds a new light on the meaning of quantum chaos. Furthermore, we obtain results concerning the algebraic structure of $t$-doped Clifford circuits, i.e., Clifford circuits containing t non-Clifford gates, their gate complexity, and learnability that are of independent interest. In particular, we show that a $t$-doped Clifford circuit $U_t$ can be decomposed into two Clifford circuits $U_{0},U^{\prime}_0$ that sandwich a local unitary operator $u_t$, i.e., $U_t=U_{0} u_{t}U_{0}^{\prime}$. The local unitary operator $u_t$ contains $t$ non-Clifford gates and acts nontrivially on at most $t$ qubits. As simple corollaries, the gate complexity of the $t$-doped Clifford circuit $U_t$ is $O(n^2+t^3)$, and it admits a efficient process tomography using $\mathrm{poly}(n,2^t)$ resources.

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

Unscrambling Quantum Information with Clifford decoders

Quantum information scrambling is a unitary process that destroys local correlations and spreads information throughout the system, effectively hiding it in nonlocal degrees of freedom. In principle, unscrambling this information is possible with perfect knowledge of the unitary dynamics [B. Yoshida and A. Kitaev, arXiv:1710.03363.]. However, this Letter demonstrates that even without previous knowledge of the internal dynamics, information can be efficiently decoded from an unknown scrambler by monitoring the outgoing information of a local subsystem. Surprisingly, we show that scramblers with unknown internal dynamics, which are rapidly mixing but not fully chaotic, can be decoded using Clifford decoders. The essential properties of a scrambling unitary can be efficiently recovered, even if the process is exponentially complex. Specifically, we establish that a unitary operator composed of $t$ non-Clifford gates admits a Clifford decoder up to $t\le n$.

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↗

arXiv2023

Stabilizer entropy dynamics after a quantum quench

Stabilizer entropies (SE) measure deviations from stabilizer resources and as such are a fundamental ingredient for quantum advantage. In particular, the interplay of SE and entanglement is at the root of the complexity of classically simulating quantum many-body systems. In this paper, we study the dynamics of SE in a quantum many-body system away from the equilibrium after a quantum quench in an integrable system. We obtain two main results: (i) we show that SE, despite being an L-extensive quantity, equilibrates in a time that scales at most linearly with the subsystem size; and (ii) we show that there is a SE length increasing linearly in time, akin to correlations and entanglement spreading.

quant-ph↗

arXiv2023

Scrambling Power of Soft Photons

Observable scattering processes entail emission-absorption of soft photons. As these degrees of freedom go undetected, some information is lost. Whether some of this information can be recovered in the observation of the hard photons, depends of the actual pattern of the scrambling of information. We compute the information scrambling of photon scattering by the tripartite mutual information in terms of the 2-Renyi entropy, and find a finite amount of scrambling is present. The developed procedure thus sheds novel light on the black hole information loss paradox, showing that scrambling is a byproduct of decoherence achieved by the scattering system in its interaction with the environment, due to the emission-absorption of soft photons in fully unitary processes.

hep-th↗

arXiv2023

Entanglement complexity of the Rokhsar-Kivelson-sign wavefunctions

In this paper we study the transitions of entanglement complexity in an exemplary family of states - the Rokhsar-Kivelson-sign wavefunctions - whose degree of entanglement is controlled by a single parameter. This family of states is known to feature a transition between a phase exhibiting volume-law scaling of entanglement entropy and a phase with sub-extensive scaling of entanglement, reminiscent of the many-body-localization transition of disordered quantum Hamiltonians [Physical Review B 92, 214204 (2015)]. We study the singularities of the Rokhsar-Kivelson-sign wavefunctions and their entanglement complexity across the transition using several tools from quantum information theory: fidelity metric; entanglement spectrum statistics; entanglement entropy fluctuations; stabilizer Rényi Entropy; and the performance of a disentangling algorithm. Across the whole volume-law phase the states feature universal entanglement spectrum statistics. Yet a "super-universal" regime appears for small values of the control parameter in which all metrics become independent of the parameter itself; the entanglement entropy as well as the stabilizer Rényi entropy appear to approach their theoretical maximum; the entanglement fluctuations scale to zero as in output states of random universal circuits, and the disentangling algorithm has essentially null efficiency. All these indicators consistently reveal a complex pattern of entanglement. In the sub-volume-law phase, on the other hand, the entanglement spectrum statistics is no longer universal, entanglement fluctuations are larger and exhibiting a non-universal scaling; and the efficiency of the disentangling algorithm becomes finite. Our results, based on model wavefunctions, suggest that a similar combination of entanglement scaling properties and of entanglement complexity features may be found in high-energy Hamiltonian eigenstates.

quant-ph↗