SearcharxivSearch

arXiv · 2511.21685

Holographically Emergent Gauge Theory in Symmetric Quantum Circuits

Abstract

We develop a novel holographic framework to study dynamical phases in random quantum circuits with a global symmetry $G$. Viewing the circuit as a tensor network, we decompose it into two parts: a symmetric layer, which defines an emergent gauge wavefunction in one higher dimension, and a non-symmetric layer, composed of random multiplicity tensors. For $G\,{=}\,\mathbb{Z}_N$ symmetric circuits consisting of local unitary gates interspersed with local symmetric noise channels, averaging over the non-symmetric layer yields a dynamically generated noisy $\mathbb{Z}_{N}$ surface code. This allows us to interpret $\mathbb{Z}_{N}$ symmetric circuits in the volume-law phase as quantum error-correcting codes with a distinguished set of logical spin states that inherit the topological protection of the bulk code. By establishing equality of bulk and boundary coherent information, we show that quantum information encoded in these logical states is maximally protected against symmetric noise up to a finite threshold. We further study weakly monitored $\mathbb{Z}_{N}$ symmetric circuits which exhibit a charge-sharpening transition. We show that the point at which the observer gains classical information about the global charge coincides with the point at which measurements destroy the underlying quantum information encoded in the bulk surface code. This also allows for a natural interpretation of the sharpening transition as a confinement transition in the gauge theory. For $N\,{\leq}\,4$, weak measurements drive a single transition from a charge-fuzzy phase with exponential sharpening time $t_{\#}\sim e^{L}$ to a charge-sharp phase with $t_{\#}\sim \mathcal{O}(1)$. On the other hand, for $N>4$, the circuit can enter an intermediate phase with a linear sharpening time $t_{\#}\sim \mathcal{O}(L)$. In this regime, the bulk gauge theory realizes a Coulomb phase with emergent gapless photons.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Akash Vijay, Jong Yeon Lee. 2025-11-26. Holographically Emergent Gauge Theory in Symmetric Quantum Circuits. https://arxiv.org/abs/2511.21685

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph