arXiv subjects

Vedika Khemani

Publications and source records attributed to Vedika Khemani.

At least 19 recordsLinked to original sources

arXiv2026

Computing with qLDPC Codes by Climbing the Chain Map Hierarchy

We develop a framework for logical computation with qLDPC codes that places logical Pauli, Clifford, and non-Clifford operations on the same footing. This brings the simple homological description of Pauli logicals to the patchwork landscape of logical Clifford and non-Clifford operations, providing a tool for the discovery of new logical gates. In particular, we define the chain map hierarchy: a family of chain complexes whose homology classes encode logical unitary and code surgery operations at any level of the Clifford hierarchy, precisely analogous to the chain complex description of Pauli logicals. Consequently, intuition for Pauli logicals can be leveraged to discover new logical operations on qLDPC codes. For instance, the familiar ability to deform Pauli logicals with stabilizers---i.e. boundaries of the chain complex---becomes a way to search for constant-depth unitary implementations of (non-)Clifford logical gates. Using this strategy, we discover constant-depth unitary implementations of the full logical Clifford group on any number of blocks of the 2D toric code, including within a single block, and addressable logical CCZ gates on any triple of logical qubits on any number of blocks of the 3D toric code. Beyond manifold codes, we find addressable non-Clifford gates on codes with many encoded qubits. The chain map hierarchy naturally encompasses and extends other constructions of logical gadgets, for instance providing a universal parameterization of cup products. As such, our work provides a unified, useful, and intuitive language for computing with qLDPC codes.

quant-ph↗

arXiv2026

LDPC stabilizer codes as gapped quantum phases: stability under graph-local perturbations

We generalize the proof of stability of topological order, due to Bravyi, Hastings and Michalakis, to stabilizer Hamiltonians corresponding to low-density parity check (LDPC) codes without the restriction of geometric locality in Euclidean space. We consider Hamiltonians $H_0$ defined by $[[N,K,d]]$ LDPC codes which obey certain topological quantum order conditions: (i) code distance $d \geq c \log(N)$, implying local indistinguishability of ground states, and (ii) a mild condition on local and global compatibility of ground states; these include good quantum LDPC codes, and the toric code on a hyperbolic lattice, among others. We consider stability under weak perturbations that are quasi-local on the interaction graph defined by $H_0$, and which can be represented as sums of bounded-norm terms. As long as the local perturbation strength is smaller than a finite constant, we show that the perturbed Hamiltonian has well-defined spectral bands originating from the $O(1)$ smallest eigenvalues of $H_0$. The band originating from the smallest eigenvalue has $2^K$ states, is separated from the rest of the spectrum by a finite energy gap, and has exponentially narrow bandwidth $δ= C N e^{-Θ(d)}$, which is tighter than the best known bounds even in the Euclidean case. We also obtain that the new ground state subspace is related to the initial code subspace by a quasi-local unitary, allowing one to relate their physical properties. Our proof uses an iterative procedure that performs successive rotations to eliminate non-frustration-free terms in the Hamiltonian. Our results extend to quantum Hamiltonians built from classical LDPC codes, which give rise to stable symmetry-breaking phases. These results show that LDPC codes very generally define stable gapped quantum phases, even in the non-Euclidean setting, initiating a systematic study of such phases of matter.

quant-ph↗

arXiv2026

Perturbative stability and error correction thresholds of quantum codes

Topologically-ordered phases are stable to local perturbations, and topological quantum error-correcting codes enjoy thresholds to local errors. We connect the two notions of stability by constructing classical statistical mechanics models for decoding general CSS codes and classical linear codes. Our construction encodes correction success probabilities under uncorrelated bit-flip and phase-flip errors, and simultaneously describes a generalized Z2 lattice gauge theory with quenched disorder. We observe that the clean limit of the latter is precisely the discretized imaginary time path integral of the corresponding quantum code Hamiltonian when the errors are turned into a perturbative X or Z magnetic field. Motivated by error correction considerations, we define general order parameters for all such generalized Z2 lattice gauge theories, and show that they are generally lower bounded by success probabilities of error correction. For CSS codes satisfying the LDPC condition and with a sufficiently large code distance, we prove the existence of a low temperature ordered phase of the corresponding lattice gauge theories, particularly for those lacking Euclidean spatial locality and/or when there is a nonzero code rate. We further argue that these results provide evidence to stable phases in the corresponding perturbed quantum Hamiltonians, obtained in the limit of continuous imaginary time. To do so, we distinguish space- and time-like defects in the lattice gauge theory. A high free-energy cost of space-like defects corresponds to a successful "memory experiment" and suppresses the energy splitting among the ground states, while a high free-energy cost of time-like defects corresponds to a successful "stability experiment" and points to a nonzero gap to local excitations.

quant-ph↗

arXiv2026

Rare Events and Griffiths Phases in Topological Quantum Error Correction

The performance of quantum error correcting (QEC) codes are often studied under the assumption of spatio-temporally uniform error rates. On the other hand, experimental implementations almost always produce heterogeneous error rates, in either space or time, as a result of effects such as imperfect fabrication and/or cosmic rays. It is therefore important to understand if and how their presence can affect the performance of QEC in qualitative ways. In this work, we study effects of non-uniform error rates in the representative examples of the 1D repetition code and the 2D toric code, focusing on when they have extended spatio-temporal correlations; these may arise, for instance, from rare events (such as cosmic rays) that temporarily elevate error rates over the entire code patch. These effects can be described in the corresponding statistical mechanics models for decoding, where long-range correlations in the error rates lead to extended rare regions of weaker coupling. For the 1D repetition code where the rare regions are linear, we find two distinct decodable phases: a conventional ordered phase in which logical failure rates decay exponentially with the code distance, and a rare-region dominated Griffiths phase in which failure rates are parametrically larger and decay as a stretched exponential. In particular, the latter phase is present when the error rates in the rare regions are above the bulk threshold. For the 2D toric code where the rare regions are planar, we find no decodable Griffiths phase: rare events which boost error rates above the bulk threshold lead to an asymptotic loss of threshold and failure to decode. Unpacking the failure mechanism implies that techniques for suppressing extended sequences of repeated rare events (which, without intervention, will be statistically present with high probability) will be crucial for QEC with the toric code.

quant-ph↗

arXiv2026

Brownian ratchets and pumps universally simulate many-body active dynamics

Active systems can exhibit a broad range of phenomena forbidden in equilibrium. Their dynamics are often specified by abstract local update rules, and it is generally unclear when the same behavior can arise from physically natural driving. Here we show that two simple driving mechanisms can universally simulate any local active dynamics in spin systems. The first is the familiar setting of a time-periodic Hamiltonian coupled to a cold bath, which we call a "many-body Brownian pump." As a second mechanism, we promote the Brownian ratchet, traditionally a mechanism for transport, to a "many-body Brownian ratchet": a static Hamiltonian coupled to a hot bath and a cold bath, where the resulting steady heat current can be harnessed not only to drive transport but also to generate local active dynamics. Using probabilistic cellular automata as an explicit model, we prove that for any continuous-time (or discrete-time) local active dynamics, there is always a many-body Brownian ratchet (or pump) that approximates the dynamics, up to noise that can be made arbitrarily weak by tuning energy scales and other parameters. As a concrete demonstration, we construct a simple ferromagnetic Ising ratchet on a bilayer lattice. When the two layers are coupled to baths at different temperatures, this model serves as a robust classical memory even under a symmetry-breaking field, something impossible in equilibrium. More broadly, our work shows that ratchets can use steady heat currents to autonomously generate and stabilize novel collective behavior, realizing a new static setting for nonequilibrium many-body dynamics.

cond-mat.stat-mech↗

arXiv2026

Diffusion Codes: Self-Correction from Small(er)-Set Expansion with Tunable Non-locality

Optimal constructions of classical LDPC codes can be obtained by choosing the Tanner graph uniformly at random among biregular graphs. We introduce a class of codes that we call ``diffusion codes'', defined by placing each edge connecting bits and checks on some graph, and acting on that graph with a random SWAP network. By tuning the depth of the SWAP network, we can tune a tradeoff between the amount of randomness -- and hence the optimality of code parameters -- and locality with respect to the underlying graph. For diffusion codes defined on the cycle graph, if the SWAP network has depth $\sim Tn$ with $T> n^{2β}$ for arbitrary $β>0$, then we prove that almost surely the Tanner graph is a lossless ``smaller set'' vertex expander for small sets up size $δ\sim \sqrt T \sim n^β$, with bounded bit and check degree. At the same time, the geometric size of the largest stabilizer is bounded by $\sqrt T$ in graph distance. We argue, based on physical intuition, that this result should hold more generally on arbitrary graphs. By taking hypergraph products of these classical codes we obtain quantum LDPC codes defined on the torus with smaller-set boundary and co-boundary expansion and the same expansion/locality tradeoffs as for the classical codes. These codes are self-correcting and admit single-shot decoding, while having the geometric size of the stabilizer growing as an arbitrarily small power law. Our proof technique establishes mixing of a random SWAP network on small subsystems at times scaling with only the subsystem size, which may be of independent interest.

quant-ph↗

arXiv2026

Non-Abelian Quantum Low-Density Parity Check Codes and Non-Clifford Operations from Gauging Logical Gates via Measurements

In this work, we introduce constructions for non-Abelian qLDPC codes obtained by gauging transversal Clifford gates using measurement and feedback. In particular, we identify two qualitatively different approaches to gauging qLDPC codes to obtain their non-Abelian counterparts. The first approach applies to codes that exhibit a generalized form of Poincaré duality and leads to a qLDPC non-Abelian Clifford stabilizer code, whose stabilizers are reminiscent of the action of a Type-III twisted quantum double. Our second approach applies to general qLDPC codes, and uses a graph of ancilla qubits which may be tailored to properties of the input codes to gauge a single transversal gate. For both constructions, the resulting gauged codes are shown to have properties analogous to 2D non-Abelian topological order -- e.g. the analog of a single anyon on a torus. We conclude by demonstrating that our gauging procedures enable magic state preparation via the measurement of logical Clifford gates. Consequently, our gauging constructions offer a protocol for performing non-Clifford operations on any qLDPC code.

quant-ph↗

arXiv2026

Slow mixing and emergent one-form symmetries in three-dimensional $\mathbb{Z}_2$ gauge theory

Symmetry-breaking order at low temperatures is often accompanied by slow relaxation dynamics, due to diverging free-energy barriers arising from interfaces between different ordered states. Here, we extend this correspondence to classical topological order, where the ordered states are locally indistinguishable, so there is no notion of interfaces between them. We study the relaxation dynamics of the three-dimensional (3D) classical $\mathbb{Z}_2$ lattice gauge theory (LGT) as a canonical example. We prove a lower bound on the mixing time in the deconfined phase, $t_{\text{mix}} = \exp [Ω(L)]$, where L is the linear system size. This bound applies even in the presence of perturbations that explicitly break the one-form symmetry between different long-lived states. This perturbation destroys the energy barriers between ordered states, but we show that entropic effects nevertheless lead to diverging free-energy barriers at nonzero temperature. Our proof establishes the LGT as a robust finite-temperature classical memory. We further prove that entropic effects lead to an emergent one-form symmetry, via a notion that we make precise. We argue that the exponential mixing time follows from universal properties of the deconfined phase, and numerically corroborate this expectation by exploring mixing time scales at the Higgs and confinement transitions out of the deconfined phase. These transitions are found to exhibit markedly different dynamic scaling, even though both have the static critical exponents of the 3D Ising model. We expect this novel entropic mechanism for memory and emergent symmetry to also bring insight into self-correcting quantum memories.

cond-mat.stat-mech↗

arXiv2025

Circuit-based characterization of finite-temperature quantum phases and self-correcting quantum memory

Quantum phases at zero temperature can be characterized as equivalence classes under local unitary transformations: two ground states within a gapped phase can be transformed into each other via a local unitary circuit. We generalize this circuit-based characterization of phases to systems at finite-temperature thermal equilibrium described by Gibbs states. We construct a channel circuit that approximately transforms one Gibbs state into another provided the two are connected by a path in parameter space along which a certain correlation-decay condition holds. For finite-dimensional systems of linear size $L$ and approximation error $ε$, the locality of the circuit is ${\rm polylog}({\rm poly}(L)/ε)$. The correlation-decay condition, which we specify, is expected to be satisfied in the interior of many noncritical thermal phases, including those displaying discrete symmetry breaking and topological order. As an application, we show that any system in the same thermal phase as a zero-temperature topological code coherently preserves quantum information for a macroscopically long time, establishing self-correction as a universal property of thermal phases. As part of the proof, we provide explicit encoding and decoding channel circuits to encode information into, and decode it from, a system in thermal equilibrium.

quant-ph↗

arXiv2025

Dynamical correlations and domain wall relocalization in transverse field Ising chains

We study conventional and out-of-time-ordered correlators (OTOCs) for a wide variety of transverse field Ising chains: classical and quantum, clean and disordered, and integrable and generic. The setting we consider is that of a quantum quench. We find a remarkably rich phenomenology, ranging from stable periodic signals to ones decaying with varying rates. This variety is due to a complex interplay of constraints on thermalization imposed by integrability and symmetry. A process we term dynamical domain wall relocalization provides a long-lived signal in the clean, integrable case, which can be degraded by the addition of disorder even without interactions. Our results shed light on a proposal to use an OTOC as a dynamical diagnostic of a quantum phase more powerful than a standard observable.

cond-mat.str-el↗

arXiv2025

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↗

arXiv2025

Expansion creates spin-glass order in finite-connectivity models: a rigorous and intuitive approach from the theory of LDPC codes

Complex free-energy landscapes with many local minima separated by large barriers are believed to underlie glassy behavior across diverse physical systems. This is the heuristic picture associated with replica symmetry breaking (RSB) in spin glasses, but RSB has only been rigorously verified for certain mean-field models with all-to-all connectivity. In this work, we give a rigorous proof of finite temperature spin glass order for a family of models with local interactions on finite-connectivity, non-Euclidean expander graphs. To this end, we bypass the RSB formalism entirely, and instead exploit the mathematical equivalence of such models to certain low-density parity check (LDPC) codes. We use code expansion, a property of LDPC codes which guarantees extensive energy barriers around ground states. Together with mild additional assumptions, this allows us to construct an explicit decomposition of the low-temperature Gibbs state into disjoint components, each hosting an asymptotically long-lived state associated with a local minimum of the landscape. Each component carries at most an exponentially small fraction of the total weight, and almost all components do not contain ground states -- which we take together to define spin-glass order. The proof is elementary, and treats various expanding graph topologies on the same footing, including those with short loops where existing approaches such as the cavity method fail. Our results apply rigorously to diluted p-spin glasses for sufficiently large p, and while unproven, we also expect our assumptions to hold in a broader family of codes. Motivated by this, we numerically study two simple models, on random regular graphs and a regular tesselation of hyperbolic space. We show that both models undergo two transitions as a function of temperature, corresponding to the onset of weak ergodicity breaking and spin glass order, respectively.

cond-mat.stat-mech↗

arXiv2025

Phases and phase transition in Grover's algorithm with systematic noise

While limitations on quantum computation by Markovian environmental noise are well-understood in generality, their behavior for different quantum circuits and noise realizations can be less universal. Here we consider a canonical quantum algorithm - Grover's algorithm for unordered search on $L$ qubits - in the presence of systematic noise. This allows us to write the behavior as a random Floquet unitary, which we show is well-characterized by random matrix theory (RMT). The RMT analysis enables analytical predictions for phases and phase transitions of the many-body dynamics. We find two separate transitions. At moderate disorder $δ_{c,\mathrm{gap}}\sim L^{-1}$, there is a ergodicity breaking transition such that a finite-dimensional manifold remains non-ergodic for $δ< δ_{c,\mathrm{gap}}$. Computational power is lost at a much smaller disorder, $δ_{c,\mathrm{comp}} \sim L^{-1/2}2^{-L/2}$. We comment on relevance to non-systematic noise in realistic quantum computers, including cold atom, trapped ion, and superconducting platforms.

quant-ph↗

arXiv2025

Quantum chaos at finite temperature in local spin Hamiltonians

Understanding the emergence of chaos in many-body quantum systems away from semi-classical limits, particularly in spatially local interacting spin Hamiltonians, has been a long-standing problem. In these intrinsically quantum regimes, quantum chaos has been primarily understood through the correspondence between the eigensystem statistics of midspectrum eigenstates and the universal statistics described by random matrix theory (RMT). However, this correspondence no longer holds for finite-temperature eigenstates. Here we show that the statistical properties of finite-temperature eigenstates of quantum chaotic Hamiltonians can be accurately described by pure random states constrained by a local charge, with the average charge density of the constrained random state ensemble playing the same role as the average energy density of the eigenstates. By properly normalizing the energy density using a single Hamiltonian-dependent parameter that quantifies the typical energy per degree of freedom, we find excellent agreement between the entanglement entropy statistics of eigenstates and that of constrained random states. Interestingly, in small pockets of Hamiltonian parameter phase space which we previously identified as `maximally chaotic' [PRX 14, 031014 (2024)], we find excellent agreement not only at the level of the first moment, including O(1) corrections, but also at the level of statistical fluctuations. These results show that notions of maximal chaos -- in terms of how much randomness eigenstates contain -- can still be defined at finite temperature in physical Hamiltonian models away from semi-classical and large-$N$ limits.

cond-mat.stat-mech↗

arXiv2024

Topological Quantum Spin Glass Order and its realization in qLDPC codes

Ordered phases of matter have close connections to computation. Two prominent examples are spin glass order, with wide-ranging applications in machine learning and optimization, and topological order, closely related to quantum error correction. Here, we introduce the concept of topological quantum spin glass (TQSG) order which marries these two notions, exhibiting both the complex energy landscapes of spin glasses, and the quantum memory and long-range entanglement characteristic of topologically ordered systems. Using techniques from coding theory and a quantum generalization of Gibbs state decompositions, we show that TQSG order is the low-temperature phase of various quantum LDPC codes on expander graphs, including hypergraph and balanced product codes. Our work introduces a topological analog of spin glasses that preserves quantum information, opening new avenues for both statistical mechanics and quantum computer science.

quant-ph↗

arXiv2024

Bottlenecks in quantum channels and finite temperature phases of matter

We prove an analogue of the "bottleneck theorem", well-known for classical Markov chains, for Markovian quantum channels. In particular, we show that if two regions (subspaces) of Hilbert space are separated by a region that has very low weight in the channel's steady state, then states initialized on one side of this barrier will take a long time to relax, putting a lower bound on the mixing time in terms of an appropriately defined "quantum bottleneck ratio". Importantly, this bottleneck ratio involves not only the probabilities of the relevant subspaces, but also the size of off-diagonal matrix elements between them. For low-temperature quantum many-body systems, we use the bottleneck theorem to bound the performance of any quasi-local Gibbs sampler. This leads to a new perspective on thermally stable quantum phases in terms of a decomposition of the Gibbs state into multiple components separated by bottlenecks. As a concrete application, we show rigorously that weakly perturbed commuting projector models with extensive energy barriers (including certain classical and quantum expander codes) have exponentially large mixing times.

quant-ph↗

arXiv2024

Absorbing state transitions with long-range annihilation

We introduce a family of classical stochastic processes describing diffusive particles undergoing branching and long-range annihilation in the presence of a parity constraint. The probability for a pair-annihilation event decays as a power-law in the distance between particles, with a tunable exponent. Such long-range processes arise naturally in various classical settings, such as chemical reactions involving reagents with long-range electromagnetic interactions. They also increasingly play a role in the study of quantum dynamics, in which certain quantum protocols can be mapped to classical stochastic processes with long-range interactions: for example, state preparation or error correction processes aim to prepare ordered ground states, which requires removing point-like excitations in pairs via non-local feedback operations conditioned on a global set of measurement outcomes. We analytically and numerically describe features of absorbing phases and phase transitions in this family of classical models as pairwise annihilation is performed at larger and larger distances. Notably, we find that the two canonical absorbing-state universality classes -- directed-percolation and parity-conserving -- are endpoints of a line of universality classes with continuously interpolating critical exponents.

cond-mat.stat-mech↗

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↗