arXiv subjects

Matteo Ippoliti

Publications and source records attributed to Matteo Ippoliti.

At least 19 recordsLinked to original sources

arXiv2026

Continuous-angle logical rotations in the Steane code

We experimentally demonstrate continuous-angle logical $Z$ rotations in the $[[7,1,3]]$ Steane code on the IonQ Forte trapped-ion processor. A round of the protocol applies a transversal physical $Z$ rotation by $\theta$, followed by Steane syndrome extraction and decoding, which induces a syndrome-dependent logical $Z$ rotation. We analytically derive the effect of dephasing noise on the logical rotation angle and logical dephasing rate. Using logical Ramsey interferometry, we observe coherent syndrome-dependent logical rotations from a single round of the protocol. We find that the logical channel reconstructed from process tomography is a noisy logical $Z$ rotation well explained by a dephasing model. We further implement a two-round protocol applying physical rotations $+\theta$ and $-\theta$, and observe cancellation of the total logical angle with low logical dephasing for repeated trivial syndromes. This constitutes a proof-of-principle demonstration of continuously tunable non-Clifford logical gates by transversal rotations and standard error correction in a small quantum code.

quant-ph↗

arXiv2026

Provable random-matrix spectral ramp in a static, geometrically local Hamiltonian

Quantum chaos is commonly associated with the emergence of random-matrix statistics in the spectra of quantum systems. A useful diagnostic is provided by the spectral form factor (SFF), which for random matrix ensembles displays a universal linear-growth regime (`ramp'). In the last decade, a landmark result by Bertini, Kos and Prosen (BKP) identified for the first time a class of geometrically local quantum dynamics of finite-dimensional particles where the SFF provably exhibits a random-matrix ramp: periodically driven (Floquet) qudit chains whose evolution is described by `dual-unitary' circuits. Here, building on the BKP result and on a recently proposed variant of the Feynman-Kitaev clock construction, we obtain a spectral ramp in a class of static, geometrically local Hamiltonians. Our strategy is to embed the Floquet quasienergy spectrum of a dual-unitary circuit into the energy spectrum of a static local Hamiltonian, and to prove that the latter's connected SFF inherits the BKP ramp within a symmetry sector. This is to our knowledge the first proof of a spectral ramp in a time-independent, geometrically local many-body system with finite local Hilbert space dimension.

quant-ph↗

arXiv2026

Quantum resource localizability transitions in deep thermalization

We investigate how quantum resource constraints affect deep thermalization, the emergence of universal local wavefunction distributions from partial measurements of a quantum many-body state. Quantum resources, such as non-stabilizerness (magic), coherence, asymmetry, imaginarity, and non-Gaussianity, are essential for quantum information processing, and constraints on their global abundance can reshape these emergent distributions. To address this question, we develop a unified framework for deep thermalization within general quantum resource theories (QRTs). Our central result is that QRTs fall into two classes: ``smoothly localizable'' (SL) QRTs, where the resource content of local post-measurement states changes continuously with the global resource density, set by the initial state and measurement basis, yielding continuously tunable wavefunction distributions; and ``threshold localizable'' (TL) QRTs, where the local resource content jumps discontinuously from minimal to near-maximal past a critical global resource threshold, producing a sharp transition between a resourceless, ``deep-ergodicity breaking'' distribution and a resourceful, maximally random one. We trace this SL-TL dichotomy to an information-theoretic mechanism, block sharpening: by viewing each QRT as coherence between blocks in Hilbert space, we show that the local resource content depends on the measurement's ability to collapse an initial superposition into a single resourceless block. Our theory is analytically tractable and quantitatively predicts the phase boundaries across all studied QRTs, which we validate with extensive numerical simulations. Finally, we highlight two consequences: a novel magic transition in zero-rate quantum error-correcting codes--previously believed to occur only at finite rates--and new implications for quantum resource certification protocols based on post-measurement state ensembles.

quant-ph↗

arXiv2025

Coherence-induced deep thermalization transition in random permutation quantum dynamics

We report a phase transition in the projected ensemble - the collection of post-measurement wavefunctions of a local subsystem obtained by measuring its complement. The transition emerges in systems undergoing random permutation dynamics, a type of quantum time evolution wherein computational basis states are shuffled without creating superpositions. It separates a phase exhibiting deep thermalization, where the projected ensemble is distributed over Hilbert space in a maximally entropic fashion (Haar-random), from a phase where it is minimally entropic ("classical bit-string ensemble"). Crucially, this deep thermalization transition is invisible to the subsystem's density matrix, which always exhibits thermalization to infinite-temperature across the phase diagram. Through a combination of analytical arguments and numerical simulations, we show that the transition is tuned by the total amount of coherence injected by the input state and the measurement basis, and is exhibited robustly across different microscopic models. Our findings represent a novel form of ergodicity-breaking universality in quantum many-body dynamics, characterized not by a failure of regular thermalization, but rather by a failure of deep thermalization.

quant-ph↗

arXiv2025

Simulation of bilayer Hamiltonians based on monitored quantum trajectories

In the study of open quantum systems it is often useful to treat mixed states as pure states of a fictitious doubled system. In this work we explore the opposite approach: mapping isolated bilayer systems to open monolayer systems. Specifically, we show that arbitrary bilayer Hamiltonians possessing an antiunitary layer exchange symmetry, and subject to a constraint on the sign of interlayer couplings, can be mapped to Lindbladians on a monolayer system with some of the jump operators postselected on a fixed outcome ("monitored"). Low-energy states of the bilayer Hamiltonian then correspond to late-time states of the monolayer dynamics. Simulating the latter by quantum trajectory methods has the potential of substantially reducing the computational cost of estimating low-energy observables in the bilayer Hamiltonian by effectively halving the system size. The overhead due to sampling quantum trajectories can be controlled by a suitable importance sampling scheme. We show that, when the quantum trajectories exhibit free fermion dynamics, our approach reduces to the auxiliary field quantum Monte Carlo (AFQMC) method. This provides a physically transparent interpretation of the AFQMC sign-free criteria in terms of properties of quantum dynamics. Finally, we benchmark our approach on the 1D quantum Ashkin-Teller model.

quant-ph↗

arXiv2025

Infinite temperature at zero energy

We construct a family of static, geometrically local Hamiltonians that inherit eigenstate properties of periodically-driven (Floquet) systems. Our construction is a variation of the Feynman-Kitaev clock -- a well-known mapping between quantum circuits and local Hamiltonians -- where the clock register is given periodic boundary conditions. Assuming the eigenstate thermalization hypothesis (ETH) holds for the input circuit, our construction yields Hamiltonians whose eigenstates have properties characteristic of infinite temperature, like volume-law entanglement entropy, across the whole spectrum -- including the ground state. We then construct a family of exactly solvable Floquet quantum circuits whose eigenstates are shown to obey the ETH at infinite temperature. Combining the two constructions yields a new family of local Hamiltonians with provably volume-law-entangled ground states, and the first such construction where the volume law holds for all contiguous subsystems.

quant-ph↗

arXiv2025

Hardness of observing strong-to-weak symmetry breaking

Spontaneous symmetry breaking (SSB) is the cornerstone of our understanding of quantum phases of matter. Recent works have generalized this concept to the domain of mixed states in open quantum systems, where symmetries can be realized in two distinct ways dubbed strong and weak. Novel intrinsically mixed phases of quantum matter can then be defined by the spontaneous breaking of strong symmetry down to weak symmetry. However, proposed order parameters for strong-to-weak SSB (based on mixed-state fidelities or purities) seem to require exponentially many copies of the state, raising the question: is it possible to efficiently detect strong-to-weak SSB in general? Here we answer this question negatively in the paradigmatic cases of $Z_2$ and $U(1)$ symmetries. We construct ensembles of pseudorandom mixed states that do not break the strong symmetry, yet are computationally indistinguishable from states that do. This rules out the existence of efficient state-agnostic protocols to detect strong-to-weak SSB.

quant-ph↗

arXiv2024

Emergent unitary designs for encoded qubits from coherent errors and syndrome measurements

Unitary $k$-designs are distributions of unitary gates that match the Haar distribution up to its $k$-th statistical moment. They are a crucial resource for randomized quantum protocols. However, their implementation on encoded logical qubits is nontrivial due to the need for magic gates, which can require a large resource overhead. In this work, we propose an efficient approach to generate unitary designs for encoded qubits in surface codes by applying local unitary rotations ("coherent errors") on the physical qubits followed by syndrome measurement and error correction. We prove that under some conditions on the coherent errors (notably including all single-qubit unitaries) and on the error correcting code, this process induces a unitary transformation of the logical subspace. We numerically show that the ensemble of logical unitaries (indexed by the random syndrome outcomes) converges to a unitary design in the thermodynamic limit, provided the density or strength of coherent errors is above a finite threshold. This "unitary design" phase transition coincides with the code's coherent error threshold under optimal decoding. Furthermore, we propose a classical algorithm to simulate the protocol based on a "staircase" implementation of the surface code encoder and decoder circuits. This enables a mapping to a 1+1D monitored circuit, where we observe an entanglement phase transition (and thus a classical complexity phase transition of the decoding algorithm) coinciding with the aforementioned unitary design phase transition. Our results provide a practical way to realize unitary designs on encoded qubits, with applications including quantum state tomography and benchmarking in error correcting codes.

quant-ph↗

arXiv2024

Pseudoentanglement from tensor networks

Pseudoentangled states are defined by their ability to hide their entanglement structure: they are indistinguishable from random states to any observer with polynomial resources, yet can have much less entanglement than random states. Existing constructions of pseudoentanglement based on phase- and/or subset-states are limited in the entanglement structures they can hide: e.g., the states may have low entanglement on a single cut, on all cuts at once, or on local cuts in one dimension. Here we introduce new constructions of pseudoentangled states based on (pseudo)random tensor networks that affords much more flexibility in the achievable entanglement structures. We illustrate our construction with the simplest example of a matrix product state, realizable as a staircase circuit of pseudorandom unitary gates, which exhibits pseudo-area-law scaling of entanglement in one dimension. We then generalize our construction to arbitrary tensor network structures that admit an isometric realization. A notable application of this result is the construction of pseudoentangled `holographic' states whose entanglement entropy obeys a Ryu-Takayanagi `minimum-cut' formula, answering a question posed in [Aaronson et al., arXiv:2211.00747].

quant-ph↗

arXiv2024

Deep thermalization under charge-conserving quantum dynamics

"Deep thermalization" describes the emergence of universal wavefunction distributions in quantum many-body dynamics, appearing on a local subsystem upon measurement of its environment. In this work, we study in detail the effect of continuous internal symmetries and associated conservation laws on deep thermalization. Concretely, we consider quantum spin systems with a $U(1)$ symmetry associated with the conservation of magnetization (or `charge'), and analyze how the choice of initial states (specifically, their degree of charge fluctuations) and the choice of measurement basis (specifically, whether or not it can reveal information about the local charge density) determine the ensuing universal wavefunction distributions. We put forth a universal ansatz for the limiting form of the projected ensemble, motivated by maximum-entropy principles rooted in statistical physics and quantum information theory. This limiting form depends on a polynomial amount of data on the initial state and measurement basis, a `coarse-graining' that is an essential feature of bona fide thermodynamic ensembles. We support our ansatz with three complementary approaches: (i) a rigorous proof in the simplest case of no charge fluctuations in either the initial state or the measurement basis; (ii) analytical calculations using a `replica limit' approach, applicable when charge fluctuations are allowed in either the input state or the measurement basis but not both; (iii) extensive numerical simulations of finite-sized systems in the most general case. Our findings demonstrate a rich interplay between symmetries and the information extracted by measurements, which allows deep thermalization to exhibit a range of universal behaviors far beyond regular thermalization.

quant-ph↗

arXiv2024

Approximate inverse measurement channel for shallow shadows

Classical shadows are a versatile tool to probe many-body quantum systems, consisting of a combination of randomised measurements and classical post-processing computations. In a recently introduced version of the protocol, the randomization step is performed via unitary circuits of variable depth $t$, defining the so-called shallow shadows. For sufficiently large $t$, this approach allows one to get around the use of non-local unitaries to probe global properties such as the fidelity with respect to a target state or the purity. Still, shallow shadows involve the inversion of a many-body map, the measurement channel, which requires non-trivial computations in the post-processing step, thus limiting its applicability when the number of qubits $N$ is large. In this work, we put forward a simple approximate post-processing scheme where the infinite-depth inverse channel is applied to the finite-depth classical shadows and study its performance for fidelity and purity estimation. The scheme allows for different circuit connectivity, as we illustrate for geometrically local circuits in one and two spatial dimensions and geometrically non-local circuits made of two-qubit gates. For the fidelity, we find that the resulting estimator coincides with a known linear cross-entropy, achieving an arbitrary small approximation error $\delta$ at depth $t=O(\log (N/\delta))$ (independent of the circuit connectivity). For the purity, we show that the estimator becomes accurate at a depth $O(N)$. In addition, at those depths, the variances of both the fidelity and purity estimators display the same scaling with $N$ as in the case of global random unitaries. We establish these bounds by analytic arguments and extensive numerical computations in several cases of interest. Our work extends the applicability of shallow shadows to large system sizes and general circuit connectivity.

quant-ph↗

arXiv2024

Holographic Classical Shadow Tomography

We introduce "holographic shadows", a new class of randomized measurement schemes for classical shadow tomography that achieves the optimal scaling of sample complexity for learning geometrically local Pauli operators at any length scale, without the need for fine-tuning protocol parameters such as circuit depth or measurement rate. Our approach utilizes hierarchical quantum circuits, such as tree quantum circuits or holographic random tensor networks. Measurements within the holographic bulk correspond to measurements at different scales on the boundary (i.e. the physical system of interests), facilitating efficient quantum state estimation across observable at all scales. Considering the task of estimating string-like Pauli observables supported on contiguous intervals of $k$ sites in a 1D system, our method achieves an optimal sample complexity scaling of $\sim d^k\mathrm{poly}(k)$, with $d$ the local Hilbert space dimension. We present a holographic minimal cut framework to demonstrate the universality of this sample complexity scaling and validate it with numerical simulations, illustrating the efficacy of holographic shadows in enhancing quantum state learning capabilities.

quant-ph↗

arXiv2024

Charge and Spin Sharpening Transitions on Dynamical Quantum Trees

The dynamics of monitored systems can exhibit a measurement-induced phase transition (MIPT) between entangling and disentangling phases, tuned by the measurement rate. When the dynamics obeys a continuous symmetry, the entangling phase further splits into a fuzzy phase and a sharp phase based on the scaling of fluctuations of the symmetry charge. While the sharpening transition for Abelian symmetries is well understood analytically, no such understanding exists for the non- Abelian case. In this work, building on a recent analytical solution of the MIPT on tree-like circuit architectures (where qubits are repatedly added or removed from the system in a recursive pattern), we study entanglement and sharpening transitions in monitored dynamical quantum trees obeying U (1) and SU (2) symmetries. The recursive structure of tree tensor networks enables powerful analytical and numerical methods to determine the phase diagrams in both cases. In the U (1) case, we analytically derive a Fisher-KPP-like differential equation that allows us to locate the critical point and identify its properties. We find that the entanglement/purification and sharpening transitions generically occur at distinct measurement rates. In the SU (2) case, we find that the fuzzy phase is generic, and a sharp phase is possible only in the limit of maximal measurement rate. In this limit, we analytically solve the boundaries separating the fuzzy and sharp phases, and find them to be in agreement with exact numerical simulations.

quant-ph↗

arXiv2024

Learnability transitions in monitored quantum dynamics via eavesdropper's classical shadows

Monitored quantum dynamics -- unitary evolution interspersed with measurements -- has recently emerged as a rich domain for phase structure in quantum many-body systems away from equilibrium. Here we study monitored dynamics from the point of view of an eavesdropper who has access to the classical measurement outcomes, but not to the quantum many-body system. We show that a measure of information flow from the quantum system to the classical measurement record -- the informational power -- undergoes a phase transition in correspondence with the measurement-induced phase transition (MIPT). This transition determines the eavesdropper's (in)ability to learn properties of an unknown initial quantum state of the system, given a complete classical description of the monitored dynamics and arbitrary classical computational resources. We make this learnability transition concrete by defining classical shadows protocols that the eavesdropper may apply to this problem, and show that the MIPT manifests as a transition in the sample complexity of various shadow estimation tasks, which become harder in the low-measurement phase. We focus on three applications of interest: Pauli expectation values (where we find the MIPT appears as a point of optimal learnability for typical Pauli operators), many-body fidelity, and global charge in $U(1)$-symmetric dynamics. Our work unifies different manifestations of the MIPT under the umbrella of learnability and gives this notion a general operational meaning via classical shadows.

quant-ph↗

arXiv2024

Classical shadows based on locally-entangled measurements

We study classical shadows protocols based on randomized measurements in $n$-qubit entangled bases, generalizing the random Pauli measurement protocol ($n = 1$). We show that entangled measurements ($n\geq 2$) enable nontrivial and potentially advantageous trade-offs in the sample complexity of learning Pauli expectation values. This is sharply illustrated by shadows based on two-qubit Bell measurements: the scaling of sample complexity with Pauli weight $k$ improves quadratically (from $\sim 3^k$ down to $\sim 3^{k/2}$) for many operators, while others become impossible to learn. Tuning the amount of entanglement in the measurement bases defines a family of protocols that interpolate between Pauli and Bell shadows, retaining some of the benefits of both. For large $n$, we show that randomized measurements in $n$-qubit GHZ bases further improve the best scaling to $\sim (3/2)^k$, albeit on an increasingly restricted set of operators. Despite their simplicity and lower hardware requirements, these protocols can match or outperform recently-introduced "shallow shadows" in some practically-relevant Pauli estimation tasks.

quant-ph↗

arXiv2024

Dynamics of Pseudoentanglement

The dynamics of quantum entanglement plays a central role in explaining the emergence of thermal equilibrium in isolated many-body systems. However, entanglement is notoriously hard to measure. Recent works have introduced a notion of pseudoentanglement describing ensembles of many-body states that, while only weakly entangled, cannot be efficiently distinguished from states with much higher entanglement, such as random states in the Hilbert space. This prompts the question: how much entanglement is truly necessary to achieve thermal equilibrium in quantum systems? In this work we address this question by introducing random circuit models of quantum dynamics that, at late times, equilibrate to pseudoentangled ensembles -- a phenomenon we name ensemble pseudothermalization. These models replicate all the efficiently observable predictions of thermal equilibrium, while generating only a small (and tunable) amount of entanglement. We examine (i) how a pseudoentangled ensemble on a small subsystem spreads to the whole system as a function of time, and (ii) how a pseudoentangled ensemble can be generated from an initial product state. We map the above problems onto a family of classical Markov chains on subsets of the computational basis. The mixing times of such Markov chains are related to the time scales at which the states produced from the dynamics become indistinguishable from Haar-random states at the level of each statistical moment, or number of copies. Based on a combination of rigorous bounds and conjectures supported by numerics, we argue that each Markov chain's relaxation time and mixing time have different asymptotic behavior in the limit of large system size. This is a necessary condition for a cutoff phenomenon: an abrupt dynamical transition to equilibrium. We thus conjecture that our random circuits give rise to asymptotically sharp distinguishability transitions.

quant-ph↗

arXiv2023

Efficient sampling of noisy shallow circuits via monitored unraveling

We introduce a classical algorithm for sampling the output of shallow, noisy random circuits on two-dimensional qubit arrays. The algorithm builds on the recently-proposed "space-evolving block decimation" (SEBD) and extends it to the case of noisy circuits. SEBD is based on a mapping of 2D unitary circuits to 1D {\it monitored} ones, which feature measurements alongside unitary gates; it exploits the presence of a measurement-induced entanglement phase transition to achieve efficient (approximate) sampling below a finite critical depth $T_c$. Our noisy-SEBD algorithm unravels the action of noise into measurements, further lowering entanglement and enabling efficient classical sampling up to larger circuit depths. We analyze a class of physically-relevant noise models (unital qubit channels) within a two-replica statistical mechanics treatment, finding weak measurements to be the optimal (i.e. most disentangling) unraveling. We then locate the noisy-SEBD complexity transition as a function of circuit depth and noise strength in realistic circuit models. As an illustrative example, we show that circuits on heavy-hexagon qubit arrays with noise rates of $\approx 2\%$ per CNOT, based on IBM Quantum processors, can be efficiently sampled up to a depth of 5 iSWAP (or 10 CNOT) gate layers. Our results help sharpen the requirements for practical hardness of simulation of noisy hardware.

quant-ph↗

arXiv2023

Measurement-induced entanglement and teleportation on a noisy quantum processor

Measurement has a special role in quantum theory: by collapsing the wavefunction it can enable phenomena such as teleportation and thereby alter the "arrow of time" that constrains unitary evolution. When integrated in many-body dynamics, measurements can lead to emergent patterns of quantum information in space-time that go beyond established paradigms for characterizing phases, either in or out of equilibrium. On present-day NISQ processors, the experimental realization of this physics is challenging due to noise, hardware limitations, and the stochastic nature of quantum measurement. Here we address each of these experimental challenges and investigate measurement-induced quantum information phases on up to 70 superconducting qubits. By leveraging the interchangeability of space and time, we use a duality mapping, to avoid mid-circuit measurement and access different manifestations of the underlying phases -- from entanglement scaling to measurement-induced teleportation -- in a unified way. We obtain finite-size signatures of a phase transition with a decoding protocol that correlates the experimental measurement record with classical simulation data. The phases display sharply different sensitivity to noise, which we exploit to turn an inherent hardware limitation into a useful diagnostic. Our work demonstrates an approach to realize measurement-induced physics at scales that are at the limits of current NISQ processors.

quant-ph↗