SearcharxivSearch

arXiv · 2305.09747

Symmetry-enriched topological order from partially gauging symmetry-protected topologically ordered states assisted by measurements

Abstract

Symmetry protected topological phases exhibit nontrivial short-ranged entanglement protected by symmetry and cannot be adiabatically connected to trivial product states while preserving the symmetry. In contrast, intrinsic topological phases do not need ordinary symmetry to stabilize them and their ground states exhibit long-range entanglement. It is known that for a given symmetry group $G$, the 2D SPT phase protected by $G$ is dual to the 2D topological phase exemplified by the twisted quantum double model $D^{\omega}(G)$ via gauging the global symmetry $G$. Recently it was realized that such a general gauging map can be implemented by some local unitaries and local measurements when $G$ is a finite, solvable group. Here, we review the general approach to gauging a $G$-SPT starting from a fixed-point ground-state wave function and applying a $N$-step gauging procedure. We provide an in-depth analysis of the intermediate states emerging during the N-step gauging and provide tools to measure and identify the emerging symmetry-enriched topological order of these states. We construct the generic lattice parent Hamiltonians for these intermediate states, and show that they form an entangled superposition of a twisted quantum double with an SPT ordered state. Notably, we show that they can be connected to the TQD through a finite-depth, local quantum circuit which does not respect the global symmetry of the SET order. We introduce the so-called symmetry branch line operators and show that they can be used to extract the symmetry fractionalization classes and symmetry defectification classes of the SET phases with the input data $G$ and $[\omega]\in H^3(G,U(1))$ of the pre-gauged SPT ordered state. We illustrate the procedure of preparing and characterizing the emerging SET ordered states for some Abelian and non-Abelian examples such as dihedral groups $D_n$ and the quaternion group $Q_8$.

Explore related subjects

Keep this discovery

BibTeXRIS

Yabo Li, Hiroki Sukeno, Aswin Parayil Mana, Hendrik Poulsen Nautrup, Tzu-Chieh Wei. 2023-05-16. Symmetry-enriched topological order from partially gauging symmetry-protected topologically ordered states assisted by measurements. https://doi.org/10.1103/physrevb.108.115144

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