arXiv subjects

Guglielmo Lami

Publications and source records attributed to Guglielmo Lami.

At least 19 recordsLinked to original sources

arXiv2026

Noise-induced Simulability Transition from Operator Scrambling

The complexity of simulating quantum many-body dynamics, or quantum computations, in the Heisenberg picture is governed by the scrambling of initially simple operators into superpositions of exponentially many Pauli strings. The corresponding expansion coefficients define the Pauli spectrum, whose structure controls the performance of classical algorithms based on truncating Pauli expansions. Here we determine the finite-depth Pauli spectrum of random quantum circuits, both in the noiseless case and in the presence of local noise, through its moments, given by the operator stabilizer Rényi entropies. In noiseless circuits, we uncover a hierarchy in the approach to the fully scrambled regime: low moments equilibrate at relatively short depths, while higher moments, which are sensitive to rare, large-amplitude Pauli coefficients, require parametrically larger depths. In noisy circuits, scrambling competes with an effective suppression of operator spreading. Above a critical error per cycle $γ_c N=\mathcal{O}(1)$, the operator fails to reach the fully scrambled distribution and remains supported on an atypically sparse subset of Pauli strings. Conversely, below this scale, we rigorously show that classical simulation remains exponentially hard, demonstrating that finite noise does not automatically imply classical simulability. The resulting noise-induced transition in operator complexity therefore delineates the boundary between intrinsically hard quantum dynamics and those that remain classically accessible.

quant-ph↗

arXiv2026

Error-Correction Transitions in Finite-Depth Quantum Channels

We study error correction type protocols in which a quantum channel encodes logical information into an enlarged Hilbert space. Specifically, we consider channels realized by one dimensional random noisy quantum circuits with spatially local interaction gates. We analyze both noise acting after the encoding and noise affecting the encoding circuit itself. Using the coherent information as a metric, we show that in both cases the infinite depth limit is governed by random matrix theory, which predicts a universal phase transition at a critical noise rate. This critical point separates an error correcting phase, in which encoded information is preserved, from a phase in which it is irretrievably lost. Going beyond the infinite depth limit, we characterize the systematic finite depth deviations from random matrix universality. In particular, we show that these deviations behave parametrically differently depending on whether the noise acts after the encoding or also affects the encoding itself. For noiseless encoders, the approach is exponential in circuit depth, although boundary effects can delay perfect encoding relative to the circuit design time. For noisy encoders, we find that the circuit fidelity effectively replaces the Hashing bound, and perfect encoding is approached polynomially with depth.

quant-ph↗

arXiv2026

The non-stabilizerness of fermionic Gaussian states

We introduce an efficient method to quantify nonstabilizerness in fermionic Gaussian states, overcoming the long-standing challenge posed by their extensive entanglement. Using a perfect sampling scheme based on an underlying determinantal point process, we compute the Stabilizer Renyi Entropies (SREs) for systems with hundreds of qubits. Benchmarking on random Gaussian states with and without particle conservation, we reveal an extensive leading behavior equal to that of Haar random states, with logarithmic subleading corrections. We support these findings with analytical calculations for a set of related quantities, the participation entropies in the computational (or Fock) basis, for which we derive an exact formula. We also investigate the time evolution of non-stabilizerness in a random unitary circuit with Gaussian gates, observing that it converges in a time that scales logarithmically with the system size. Applying the sampling algorithm to a two-dimensional free-fermionic topological model, we uncover a sharp transition in non-stabilizerness at the phase boundaries, highlighting the power of our approach in exploring different phases of quantum many-body systems, even in higher dimensions.

quant-ph↗

arXiv2026

Universality in the Anticoncentration of Noisy Quantum Circuits at Finite Depths

We present universal properties of anticoncentration in weakly noisy quantum circuits at finite depth. We develop a generic framework for single- and multi-qubit noise channels in the weak-noise limit and introduce an effective description in terms of a random matrix product operator (RMPO). Within this weak-noise regime, we show that distinct noise mechanisms act in a quantitatively similar way, yielding a universal distribution of bit-string probabilities that is largely independent of the microscopic noise channel and of the circuit architecture. We identify three depth-dependent regimes, each characterized by a distinct scaling of cross-entropy benchmarking (XEB) with rescaled depth. In the shallow-depth regime, noise effects are perturbatively small; in the intermediate regime, circuit-induced fluctuations and noise compete on equal footing; and in the deep-depth regime, the output distribution becomes effectively classical, up to corrections that are exponentially small in the noise strength. We provide quantitative predictions for anticoncentration in generic finite-depth circuits and benchmark them against numerical simulations, finding excellent agreement even at shallow depths. Moreover, we show that, contrary to previous expectations, the late-time value of XEB provides direct access to the global circuit fidelity, even at large noise strengths. Our results are directly applicable to current quantum processors and demonstrate universal behavior beyond the pure random-matrix-theory regime, which only emerges at asymptotically large depths.

quant-ph↗

arXiv2026

Quantum State Designs via Magic Teleportation

We investigate how non-stabilizer resources enable the emergence of quantum state designs within the projected ensemble. Starting from initial states with finite magic and applying resource-free Clifford circuits to scramble them, we analyze the ensemble generated by performing projective Pauli measurements on a subsystem of the final state. Using both analytical arguments and large-scale numerics, we show that the projected ensemble converges towards a state $k$-design with an error that decays exponentially with the $k$-th Stabilizer Rényi Entropy of the pre-measurement state, via a Magic-Induced Design Ansatz (MIDA) that we introduce. We identify a universal scaling form, valid across different classes of magic initial states, and corroborate it through numerical simulations and analytical calculations of the frame potential. For finite-depth Clifford unitaries, we show that the timescales at which state designs emerge are controlled by the transport of magic. We identify a ``magic teleportation'' mechanism whereby non-Clifford resources injected locally spread through Clifford scrambling and measurements across distances beyond the lightcone. Our results demonstrate how a small and controlled amount of magic suffices to generate highly random states, providing a systematic route toward generating quantum state designs in early fault-tolerant devices.

quant-ph↗

arXiv2025

Emergence of Generic Entanglement Structure in Doped Matchgate Circuits

Free fermionic Gaussian, a.k.a. matchgate, random circuits exhibit atypical behavior compared to generic interacting systems. They produce anomalously slow entanglement growth, characterized by diffusive scaling $S(t) \sim \sqrt{t}$, and evolve into volume-law entangled states at late times, $S \sim N$, which are highly unstable to measurements. Here, we investigate how doping such circuits with non-Gaussian resources (gates) restores entanglement structures of typical dynamics. We demonstrate that ballistic entanglement growth $S(t) \sim t$ is recovered after injecting an extensive total amount of non-Gaussian gates, also restoring Kardar-Parisi-Zhang fluctuations. When the evolution is perturbed with measurements, we uncover a measurement-induced phase transition between an area-law and a power-law entangled phase, $S \sim N^α$, with $α$ controlled by the doping. A genuine volume-law entangled phase is recovered only when non-Gaussian gates are injected at an extensive rate. Our findings bridge the dynamics of free and interacting fermionic systems, identifying non-Gaussianity as a key resource driving the emergence of non-integrable behavior.

quant-ph↗

arXiv2025

Magic phase transitions in monitored gaussian fermions

Monitored quantum systems, where unitary dynamics compete with continuous measurements, exhibit dynamical transitions as the measurement rate is varied. These reflect abrupt changes in the structure of the evolving wavefunction, captured by complementary complexity diagnostics that include and go beyond entanglement aspects. Here, we investigate how monitoring affects magic state resources, the nonstabilizerness, of Gaussian fermionic systems. Using scalable Majorana sampling techniques, we track the evolution of stabilizer Rényi entropies in large systems under projective measurements. While the leading extensive (volume-law) scaling of magic remains robust across all measurement rates, we uncover a sharp transition in the subleading logarithmic corrections. This measurement-induced complexity transition, invisible to standard entanglement probes, highlights the power of magic-based diagnostics in revealing hidden features of monitored many-body dynamics.

quant-ph↗

arXiv2025

Universality in the Anticoncentration of Chaotic Quantum Circuits

We identify a \emph{universal functional form} that governs anticoncentration in random quantum circuits-one that holds across diverse circuit architectures and depths, and crucially remains valid even at finite system sizes and shallow depth. We support this claim through analytical results for ensembles of random tensor-network states and random-phase models. This compact, universal expression for the output bitstring probability distribution is fully characterized by just two fitting parameters, as validated through extensive numerical simulations. Our findings underscore the pivotal role of finite-size and finite-depth effects in shaping anticoncentration and introduce a practical framework for benchmarking quantum devices using shallow circuits, thereby enabling validation of systems significantly larger than previously accessible.

quant-ph↗

arXiv2025

Overcoming the entanglement barrier with sampled tensor networks

The rapid growth of entanglement under unitary time evolution is the primary bottleneck for modern tensor-network techniques--such as Matrix Product States (MPS)--when computing time-dependent expectation values. This {entanglement barrier} restricts classical simulations and, conversely, underpins the quantum advantage anticipated from future devices. Here we show that, for one-dimensional Hamiltonian dynamics, the spatio-temporal tensor network encoding the evolved wave function amplitudes can be contracted efficiently along the left-right (spatial) direction. Exploiting this structure, we develop a hybrid Tensor-Network/Monte-Carlo (TN-MC) algorithm that samples the wave function and evaluates expectation values of generic local operators with computational cost that scales only polynomially in time. The accurate contraction of the wave function amplitudes is a consequence of the favorable scaling with time of the generalised temporal entropies. We find that their real part either saturates or, at most, grows logarithmically with time, revealing new instances of continuous dynamical quantum phase transitions (DQPTs) which we characterize. Our results therefore show that, when computing expectation values of local operators, the entanglement barrier in one-dimensional Hamiltonian evolution can be bypassed with a TN-MC blend.

quant-ph↗

arXiv2025

Quantum State Design and Emergent Confinement Mechanism in Measured Tensor Network States

Randomness is a fundamental aspect of quantum mechanics, arising from the measurement process that collapses superpositions into definite outcomes according to Born's rule. Generating large-scale random quantum states is crucial for quantum computing and many-body physics, yet remains a key challenge. We present a practical method based on local measurements of random Tensor Networks, focusing on random Matrix Product States (MPS) generated by two distinct quantum circuit architectures, both feasible on near-term devices. We certify the emergent quantum randomness using the frame potential and establish a mapping between its behavior and the statistical mechanics of a domain wall particle model. In both architectures, the effect of quantum measurements induces a nontrivial confinement mechanism, where domain walls are either trapped by an external potential or bound in pairs to form meson-like excitations. Our results, supported by both exact analytical calculations and numerical simulations, suggest that confinement is a general mechanism underlying random state generation in broader settings with local measurements, including quantum circuits and chaotic dynamics.

quant-ph↗

arXiv2025

Tensor Network Techniques for Quantum Computation

This book serves as an introductory yet thorough guide to tensor networks and their applications in quantum computation and quantum information, designed for advanced undergraduate and graduate-level readers. In Part I, foundational topics are covered, including tensor structures and network representations like Matrix Product States (MPS) and Tree Tensor Networks (TTN). These preliminaries provide readers with the core mathematical tools and concepts necessary for quantum physics and quantum computing applications, bridging the gap between multi-linear algebra and complex quantum systems. Part II explores practical applications of tensor networks in simulating quantum dynamics, with a particular focus on the efficiency they offer for systems of high computational complexity. Key topics include Hamiltonian dynamics, quantum annealing, open system dynamics, and optimization strategies using TN frameworks. A final chapter addresses the emerging role of "quantum magic" in tensor networks. It delves into non-stabilizer states and their contribution to quantum computational power beyond classical simulability, featuring methods such as stabilizer-enhanced MPS and the Clifford-dressed TDVP.

quant-ph↗

arXiv2025

Beginner's Lecture Notes on Quantum Spin Chains, Exact Diagonalization and Tensor Networks

Aimed at introducing readers to the physics of strongly correlated many-body systems, these notes focus on numerical methods, with detailed discussions on implementing working code for exact diagonalization. A brief introduction to tensor network methods is also included. Prepared for the Summer School Quantumandu, held at Tribhuvan University (Kathmandu, Nepal) from 25 to 31 July 2024, as part of the ICTP's Physics Without Frontiers program, these notes are primarily intended for readers encountering this field for the first time.

cond-mat.str-el↗

arXiv2025

Correlations, Spectra and Entanglement Transitions in Ensembles of Matrix Product States

We investigate ensembles of Matrix Product States (MPSs) generated by quantum circuit evolution followed by projection onto MPSs with a fixed bond dimension $χ$. Specifically, we consider ensembles produced by: (i) random sequential unitary circuits, (ii) random brickwork unitary circuits, and (iii) circuits involving both unitaries and projective measurements. In all cases, we analyze the spectra of the MPS transfer matrices and relate them to the spreading of mutual information in the MPS state. We demonstrate how different features of the spectral density correspond to distinct types of circuits, revealing that these MPS ensembles retain crucial physical information about the underlying microscopic dynamics. Notably, in the presence of quantum monitoring, we show the existence of a measurement-induced entanglement transition (MIPT) in MPS ensembles, with the averaged dimension of the transfer matrix's null space serving as the effective order parameter.

quant-ph↗

arXiv2024

Estimating Non-Stabilizerness Dynamics Without Simulating It

We introduce the Iterative Clifford Circuit Renormalization (ICCR), a novel technique designed to efficiently handle the dynamics of non-stabilizerness (a.k.a. quantum magic) in generic quantum circuits. ICCR iteratively adjusts the starting circuit, transforming it into a Clifford circuit where all elements that can alter the non-stabilizerness, such as measurements or T gates, have been removed. In the process the initial state is renormalized in such a way that the new circuit outputs the same final state as the original one. This approach embeds the complex dynamics of non-stabilizerness in the flow of an effective initial state, enabling its efficient evaluation while avoiding the need for direct and computationally expensive simulation of the original circuit. The initial state renormalization can be computed explicitly using a matrix-product state approximation that can be systematically improved. We implement the ICCR algorithm to evaluate the non-stabilizerness dynamics for systems of size up to N = 1000. We validate our method by comparing it to tensor networks simulations. Finally, we employ the ICCR technique to study a magic purification circuit, where a measurement-induced transition is observed.

quant-ph↗

arXiv2024

Quantum State Designs with Clifford Enhanced Matrix Product States

Nonstabilizerness, or `magic', is a critical quantum resource that, together with entanglement, characterizes the non-classical complexity of quantum states. Here, we address the problem of quantifying the average nonstabilizerness of random Matrix Product States (RMPS). RMPS represent a generalization of random product states featuring bounded entanglement that scales logarithmically with the bond dimension $χ$. We demonstrate that the $2$-Stabilizer Rényi Entropy converges to that of Haar random states as $N/χ^2$, where $N$ is the system size. This indicates that MPS with a modest bond dimension are as magical as generic states. Subsequently, we introduce the ensemble of Clifford enhanced Matrix Product States ($\mathcal{C}$MPS), built by the action of Clifford unitaries on RMPS. Leveraging our previous result, we show that $\mathcal{C}$MPS can approximate $4$-spherical designs with arbitrary accuracy. Specifically, for a constant $N$, $\mathcal{C}$MPS become close to $4$-designs with a scaling as $χ^{-2}$. Our findings indicate that combining Clifford unitaries with polynomially complex tensor network states can generate highly non-trivial quantum states.

quant-ph↗

arXiv2024

Anticoncentration and state design of random tensor networks

We investigate quantum random tensor network states where the bond dimensions scale polynomially with the system size, $N$. Specifically, we examine the delocalization properties of random Matrix Product States (RMPS) in the computational basis by deriving an exact analytical expression for the Inverse Participation Ratio (IPR) of any degree, applicable to both open and closed boundary conditions. For bond dimensions $χ\sim γN$, we determine the leading order of the associated overlaps probability distribution and demonstrate its convergence to the Porter-Thomas distribution, characteristic of Haar-random states, as $γ$ increases. Additionally, we provide numerical evidence for the frame potential, measuring the $2$-distance from the Haar ensemble, which confirms the convergence of random MPS to Haar-like behavior for $χ\gg \sqrt{N}$. We extend this analysis to two-dimensional systems using random Projected Entangled Pair States (PEPS), where we similarly observe the convergence of IPRs to their Haar values for $χ\gg \sqrt{N}$. These findings demonstrate that random tensor networks with bond dimensions scaling polynomially in the system size are fully Haar-anticoncentrated and approximate unitary designs, regardless of the spatial dimension.

quant-ph↗

arXiv2024

Clifford Dressed Time-Dependent Variational Principle

We propose an enhanced Time-Dependent Variational Principle (TDVP) algorithm for Matrix Product States (MPS) that integrates Clifford disentangling techniques to efficiently manage entanglement growth. By leveraging the Clifford group, which maps Pauli strings to other Pauli strings while maintaining low computational complexity, we introduce a Clifford dressed single-site 1-TDVP scheme. During the TDVP integration, we apply a global Clifford transformation as needed to reduce entanglement by iteratively sweeping over two-qubit Clifford unitaries that connect neighboring sites in a checkerboard pattern. We validate the new algorithm numerically using various quantum many-body models, including both integrable and non-integrable systems. Our results demonstrate that the Clifford dressed TDVP significantly improves entanglement management and computational efficiency, achieving higher accuracy, extended simulation times, and enhanced precision in computed observables compared to standard TDVP approaches. Additionally, we propose incorporating Clifford gates directly within the two-site 2-TDVP scheme.

quant-ph↗

arXiv2024

Variational ground-state quantum adiabatic theorem

We present a variational quantum adiabatic theorem, which states that, under certain assumptions, the adiabatic dynamics projected onto a variational manifold follow the instantaneous variational ground state. We focus on low-entanglement variational manifolds and target Hamiltonians with classical ground states. Despite the presence of highly entangled intermediate states along the exact quantum annealing path, the variational evolution converges to the target ground state. We demonstrate this approach with several examples that align with our theoretical analysis.

quant-ph↗