DMRG Preprints

Various algorithms have been developed to simulate quantum circuits on classical hardware. Among the most prominent are approaches based on \emph{stabilizer decompositions} and \emph{tensor network contraction}. In this work, we present a unified framework that bridges these two approaches, placing them under a common formalism. Using this, we present two new algorithms to simulate an $n$-qubit circuit $C$: one that runs in $\tilde{O}(T^{\mathsf{tw}(C)})$ time and the other in \tilde{O}(T^{γ&dcedil;ot \mathsf{tw}(C)}) time, where $\mathsf{tw}(C)$ and $\mathsf{rw}(C)$ refer to the the tree-width and rank-width, respectively, of a tensor network associated to $C$, $T$ is the number of non-Clifford gates in $C$, and $γ\approx 3.42$. The proposed algorithms are simple, only require a linear amount of memory, are trivially parallelizable, and interact nicely with ZX-diagram simplification routines. Furthermore, we introduce the refined complexity measures \emph{focused tree-width} and \emph{focused rank-width}, which are always at least as efficient as their standard equivalent; these can be directly applied within our simulation algorithms, allowing for a more precise upper bound on the run time.

Symmetry-protected topological (SPT) phases extend the Landau paradigm of quantum matter by admitting distinct symmetry-preserving phases that lack any local order parameter. Demonstrating these phases at scale on programmable quantum processors is a key milestone in using quantum hardware to probe emergent many-body phenomena, yet it is impeded by the circuit depth normally required to capture non-trivial entanglement. Here we use a tensor network based approximate quantum compiling (AQC) protocol to construct shallow quantum circuits (18-39 CNOT depth), which prepare 100-site ground states of the spin-1/2 bond-alternating Heisenberg chain in both SPT phases, to 97.9-99.0% fidelity. Upon executing the circuits on IBM quantum hardware, the resulting states exhibit all defining signatures of SPT order including non-local string order for strings of up to length 20, characteristic degeneracies in the entanglement spectrum and clear evidence of symmetry-protected edge modes. The simultaneous observation of these independent diagnostics establishes current quantum computers as versatile platforms for large-scale studies of symmetry-protected quantum matter. More broadly, our results establish a practical foundation for probing non-equilibrium quench dynamics of such systems in regimes that challenge classical computational methods.

Tensor networks provide discrete representations of quantum many-body systems, yet their precise connection to continuum field theories remains relatively poorly understood. Invoking a notion of typicality, we develop a continuum description for random ensembles of two-dimensional fermionic matchgate tensor networks with spatially fluctuating parameters. As a diagnostic of the resulting universal physics, we analyze disorder-averaged moments of fermionic two-point functions, both in flat geometry and on a hyperbolic disk, where curvature reshapes their long-distance structure. We show that disorder drives universal long-distance behavior governed by a nonlinear sigma-model of symmetry class D with a topological term, placing random matchgate networks in direct correspondence with the thermal quantum Hall problem. The resulting phase structure includes localized phases, quantum Hall criticality, and a robust thermal metal with diffusive correlations and spontaneous replica-symmetry breaking. Weak non-Gaussian deformations reduce the symmetry to discrete permutations, generate a mass for the Goldstone modes, and suppress long-range correlations. In this way, typicality offers a route from ensembles of discrete tensor networks to continuum quantum field theories.

Fermionic Gaussian states (FGSs) and the associated matchgate circuits play a central role in quantum information theory and condensed matter physics. Despite being possibly highly entangled, they can still be efficiently simulated on classical computers. We address the question of how to optimally create such states when using matchgate circuits acting on product states. To this end, we derive lower bounds on the number of gates required to prepare an arbitrary pure FGS: We establish both an asymptotic bound on the minimal gate count over general nearest-neighbor gate sets and an exact bound for circuits composed solely of matchgates. We present explicit algorithms whose constructions saturate these bounds, thereby proving their optimality. We furthermore determine when an FGS can be prepared with a circuit of any given depth, and derive an algorithm that constructs such a circuit whenever this condition is satisfied, either exactly or approximately. Our results have direct applications to (approximate) state preparation and to disentangling procedures. Moreover, we introduce a new classical simulation algorithm for matchgate circuits, based entirely on manipulating the generating circuits of the FGSs. Finally, we briefly study an extension of our framework for $t$-doped Gaussian states and circuits.

Local-operator entanglement (LOE) quantifies the nonlocal structure of Heisenberg operators and serves as a diagnostic of many-body chaos. We provide rigorous bounds showing when an operator can be well-approximated by a matrix-product operator (MPO), given asymptotic scaling of its LOE $α$-Rényi entropies. Specifically, we prove that a volume law scaling for $α\geq 1$ implies that the operator cannot be approximated efficiently as an MPO while faithfully reproducing all expectation values. On the other hand, if we restrict to correlations over a relevant sub-class of (ensembles of) states, then logarithmic scaling of the $α< 1$ Rényi LOE entropies implies MPO simulability. This result covers a range of relevant quantities, including infinite temperature autocorrelation functions, out-of-time-ordered correlators, and average-case expectation values over ensembles of computational basis states. Beyond this regime, we provide numerical evidence together with a random matrix model to argue that, also for out-of-equilibrium expectation values, logarithmic scaling for $α< 1$ Rényi LOE typically guarantees simulability. Our results put on firm footing the heuristic expectation that a low operator entanglement implies efficient tensor network representability, extending celebrated foundational results from the theory of matrix-product states and providing a formal link between quantum chaos and classical simulability.

We introduce group surface codes, which are a natural generalization of the $ℤ_2$ surface code, and equivalent to quantum double models of finite groups with specific boundary conditions. We show that group surface codes can be leveraged to perform non-Clifford gates in $ℤ_2$ surface codes, thus enabling universal computation with well-established means of performing logical Clifford gates. Moreover, for suitably chosen groups, we demonstrate that arbitrary reversible classical gates can be implemented transversally in the group surface code. We present the logical operations in terms of a set of elementary logical operations, which include transversal logical gates, a means of transferring encoded information into and out of group surface codes, and preparation and readout. By composing these elementary operations, we implement a wide variety of logical gates and provide a unified perspective on recent constructions in the literature for sliding group surface codes and preparing magic states. We furthermore use tensor networks inspired by ZX-calculus to construct spacetime implementations of the elementary operations. This spacetime perspective also allows us to establish explicit correspondences with topological gauge theories. Our work extends recent efforts in performing universal quantum computation in topological orders without the braiding of anyons, and shows how certain group surface codes allow us to bypass the restrictions set by the Bravyi-K{ö}nig theorem, which limits the computational power of topological Pauli stabilizer models.

Correlated noise is a critical failure mode in quantum error correction (QEC), as temporal memory and spatial structure concentrate faults into error bursts that undermine standard threshold assumptions. Yet, a fundamental gap persists between the stochastic Pauli models ubiquitous in QEC and the microscopic, non-Markovian descriptions of physical device dynamics. We close this gap by introducing \emph{Spatiotemporal Pauli Processes} (SPPs). By applying a multi-time Pauli twirl -- operationally realised by Pauli-frame randomisation -- to a general process tensor, we map arbitrary multi-time, non-Markovian dynamics to a multi-time Pauli process. This process is represented by a process-separable comb, or equivalently, a well-defined joint probability distribution over Pauli trajectories in spacetime. We show that SPPs inherit efficient tensor network representations whose bond dimensions are bounded by the environment's Liouville-space dimension. To interpret these structures, we develop transfer operator diagnostics linking spectra to correlation decay, and exact hidden Markov representations for suitable classes of SPPs. We demonstrate the framework via surface code memory and stability simulations of up to distance \(19\) for (i) a temporally correlated ``storm'' model that tunes correlation length at fixed marginal error rates, and (ii) a genuinely spatiotemporal 2D quantum cellular automaton bath that maps exactly to a nonlinear probabilistic cellular automaton under twirling. Tuning coherent bath interactions drives the system into a pseudo-critical regime, exhibiting critical slowing down and macroscopic error avalanches that cause a complete breakdown of surface code distance scaling. Together, these results justify SPPs as an operationally grounded, scalable toolkit for modelling, diagnosing, and benchmarking correlated noise in QEC.

In this work, we numerically study the effect of weak measurement on deconfined quantum critical point(DQCP). Particularly, we consider the ground state of an one-dimensional spin $1/2$ system with long range exchange interactions($K$), which shows analogues phase transition to DQCP in the thermodynamic limit. This system is in the ferromagnetic phase below the critical exchange interaction $K_c$ and in the valance bond solid phase above $K_c$. The weak measurement is carried out by coupling a secondary ancilla system to the critical system via unitary interactions and later measuring the ancilla spins projectively. We numerically calculate entanglement entropy,correlation length, and order parameters of leading post-measurement states using uniform matrix product state representation of the quantum many-body state in the thermodynamic limit. We report asymmetric restructuring of entanglement of the post measurement states across the phase boundary under weak measurements. Especially, the trajectory $\left(\downarrow \downarrow\right)$ describing a uniform measurement outcome given the all ancilla spins initiated in the same $\left(\downarrow \right)$ state, shows anomalous entanglement when increasing the strength of weak measurement. The bipartite entanglement entropy strongly increases when $K<K_c$ whereas it weakly decreases when $K>K_c$. We argue with numerical evidences that observed asymmetry in entanglement would lead to a weak first order phase boundary in the thermodynamic limit. We also discuss important aspects in experimental observation of measurement induced effects linked to the strength of weak measurement and probability of post-measurement states.

We train machine learning algorithms to infer the entanglement structure of disordered long-range interacting quantum spin chains by learning from the strong disorder renormalisation group (SDRG) method. The system consists of $S=1/2$-quantum spins coupled by antiferromagnetic power-law interactions with decay exponent $α$ at random positions on a one-dimensional chain. Using SDRG as a physics-informed teacher, we compare a Random Forest classifier as a classical baseline with a graph neural network (GNN) that operates directly on the interaction graph and learns a bond-ranking rule mirroring the SDRG decimation policy. The GNN achieves a disorder-averaged pairing accuracy close to one and reproduces the entanglement entropy $S(\ell)$ in excellent quantitative agreement with SDRG across all subsystem sizes and interaction exponents. RG flow heat maps confirm that the GNN learns the sequential decimation hierarchy rather than merely fitting final-state observables. Finite-temperature entanglement properties are incorporated via the SDRGX framework through a two-stage strategy, using the zero-temperature GNN to generate the RG flow and sampling thermal occupations from the canonical ensemble, yielding results in agreement with both numerical SDRGX and analytical predictions without retraining.

Classical tensor network and hybrid quantum-classical algorithms are promising candidates for the investigation of real-time properties of lattice gauge theories. We develop here a novel framework which enforces gauge symmetry via a quantum-link virtual rishon representation applied at intermediate steps. Crucially, the gauge and matter degrees of freedom are dynamical variables encoded in terms of qubits, enabling analysis of gauge theories in $d+1$ spacetime dimensions. We benchmark this framework in a U(1) gauge theory with and without matter fields. For $d = 1$, the multi-flavor Schwinger model with $1\leq N_f\leq3$ flavors is analyzed for arbitrary boundary conditions and nonzero topological angle, capturing signatures of the underlying Wess-Zumino-Witten conformal field theory. For $d = 2$, we extract the confining string tension in close agreement with continuum expectations. These results establish the virtual rishon framework as a scalable and robust approach for the simulation of lattice gauge theories using both classical tensor networks as well as near-term quantum hardware.