We consider Kitaev's quantum double model based on a finite group $G$ and describe quantum circuits for (a) preparation of the ground state, (b) creation of anyon pairs separated by an arbitrary distance, and (c) non-destructive topological charge measurement. We show that for any solvable group $G$ all above tasks can be realized by constant-depth adaptive circuits with geometrically local unitary gates and mid-circuit measurements. Each gate may be chosen adaptively depending on previous measurement outcomes. Constant-depth circuits are well suited for implementation on a noisy hardware since it may be possible to execute the entire circuit within the qubit coherence time. Thus our results could facilitate an experimental study of exotic phases of matter with a non-abelian particle statistics. We also show that adaptiveness is essential for our circuit construction. Namely, task (b) cannot be realized by non-adaptive constant-depth local circuits for any non-abelian group $G$. This is in a sharp contrast with abelian anyons which can be created and moved over an arbitrary distance by a depth-$1$ circuit composed of generalized Pauli gates.
We consider Kitaev's quantum double model based on a finite group G and describe quantum circuits for (a) preparation of the ground state, (b) creation of anyon pairs separated by an arbitrary distance, and (c) non-destructive topological charge measurement. We show that for any solvable group G all above tasks can be realized by constant-depth adaptive circuits with geometrically local unitary gates and mid-circuit measurements. Each gate may be chosen adaptively depending on previous measurement outcomes. Constant-depth circuits are well suited for implementation on a noisy hardware since it may be possible to execute the entire circuit within the qubit coherence time. Thus our results could facilitate an experimental study of exotic phases of matter with a non-abelian particle statistics. We also show that adaptiveness is essential for our circuit construction. Namely, task (b) cannot be realized by non-adaptive constant-depth local circuits for any non-abelian group G. This is in a sharp contrast with abelian anyons which can be created and moved over an arbitrary distance by a depth-1 circuit composed of generalized Pauli gates.
The classification of topological phases of matter is a fundamental challenge in quantum many-body physics, with applications to quantum technology. Recently, this classification has been extended to the setting of adaptive finite-depth local unitary (AFDLU) circuits, which allow global classical communication. In this setting, the trivial phase is the collection of all topological states that can be prepared via AFDLU. Here, we propose a complete classification of the trivial phase by showing how to prepare all solvable anyon theories that admit a gapped boundary via AFDLU, extending recent results on solvable groups. Our construction includes non-Abelian anyons with irrational quantum dimensions, such as Ising anyons, and more general acyclic anyons. Specifically, we introduce a sequential gauging procedure, with an AFDLU implementation, to produce a string-net ground state in any topological phase described by a solvable anyon theory with gapped boundary. In addition, we introduce a sequential ungauging and regauging procedure, with an AFDLU implementation, to apply string operators of arbitrary length for anyons and symmetry twist defects in solvable anyon theories. We apply our procedure to the quantum double of the group S 3 and to several examples that are beyond solvable groups, including the doubled Ising theory, the Z 3 Tambara-Yamagami string net, and doubled SU ( 2 ) 4 anyons.
We provide explicit constant-depth local unitary circuits that realize general anyon permutations in Kitaev's quantum double models. This construction can be naturally understood through a correspondence between anyon permutation symmetries of two-dimensional topological orders and self-dualities in one-dimensional systems, where local gates implement self-duality transformations on the boundaries of microscopic regions. From this holographic perspective, general anyon permutations in the D(G) quantum double correspond to compositions of three classes of one-dimensional self-dualities, including gauging of certain subgroups of G, stacking with G symmetry-protected topological phases, and outer automorphisms of the group G. We construct circuits realizing the first class by employing self-dual unitary gauging maps, and present transversal circuits for the latter two classes.
Adaptive quantum circuits employ unitary gates assisted by mid-circuit measurement, classical computation on the measurement outcome, and the conditional application of future unitary gates based on the result of the classical computation. In this paper, we experimentally demonstrate that even a noisy adaptive quantum circuit of constant depth can achieve a task that is impossible for any purely unitary quantum circuit of identical depth: the preparation of long-range entangled topological states with high fidelity. We prepare a particular toric code ground state with fidelity of at least 76.9±1.3% using a constant depth (d=4) adaptive circuit, and rigorously show that no unitary circuit of the same depth and connectivity could prepare this state with fidelity greater than 50%.
The preparation of long-range entangled states using unitary circuits is limited by Lieb-Robinson bounds, but circuits with projective measurements and feedback ("adaptive circuits") can evade such restrictions.We introduce three classes of local adaptive circuits that enable low-depth preparation of long-range entangled quantum matter characterized by gapped topological orders and conformal field theories (CFTs).The three classes are inspired by distinct physical insights, including tensor-network constructions, the multiscale entanglement renormalization ansatz, and parton constructions.A large class of topological orders, including chiral topological order, can be prepared in constant depth or time, and onedimensional CFT states and non-Abelian topological orders with both solvable and nonsolvable groups can be prepared in depth scaling logarithmically with system size.We also build on a recently discovered correspondence between symmetry-protected topological phases and long-range entanglement to derive efficient protocols for preparing symmetry-enriched topological order and arbitrary Calderbank-Shor-Steane codes.Our work illustrates the practical and conceptual versatility of measurement for state preparation.
We present an entirely 2D constant-depth realization of topologically protected phase gates at any level of the Clifford hierarchy, and beyond, using non-Abelian surface codes. Our construction encodes a logical qubit in the quantum double D(G) of a non-Abelian group G on a triangular spatial patch. The logical gate is implemented by a constant-depth circuit constructed from stacking on the spatial region a symmetry-protected topological (SPT) phase specified by a group 2-cocycle and boundary counter-terms. The Bravyi-König theorem limits the unitary gates implementable by constant-depth quantum circuits on Pauli stabilizer codes in D dimensions to the D-th level of the Clifford hierarchy. We bypass this limitation, by constructing constant-depth unitary gates at arbitrary levels of the Clifford hierarchy purely in 2D, without sacrificing locality or fault tolerance, at the cost of using the quantum double of a non-Abelian group G. Specifically, for G=D4N, the dihedral group of order 8N, we realize the phase gate T1/N=diag(1,eiπ/(4N)) in the logical Z basis. In this context, we propose a non-abelian stabilizer group formalism, which we work out for dihedral groups. For 8N=2n, the logical gate lies at the n-th level of the Clifford hierarchy and, importantly, has a qubit-only realization: we show that it can be constructed in terms of Clifford-hierarchy stabilizers for a code with n physical qubits on each edge of the lattice. We also discuss code-switching to the double surface-code D(Z2×Z2), to complete a universal gate-set in this setup.
Adaptive quantum circuits, which combine local unitary gates, midcircuit measurements, and feedforward operations, have recently emerged as a promising avenue for efficient state preparation, particularly on near-term quantum devices limited to shallow-depth circuits. Matrix product states (MPS) comprise a significant class of many-body entangled states, efficiently describing the ground states of one-dimensional gapped local Hamiltonians and finding applications in a number of recent quantum algorithms. Recently, it has been shown that the Affleck-Kennedy-Lieb-Tasaki state—a paradigmatic example of an MPS—can be exactly prepared with an adaptive quantum circuit of constant depth, an impossible feat with local unitary gates alone due to its nonzero correlation length [Smith , PRX Quantum 4, 020315 (2023)]. In this work, we broaden the scope of this approach and demonstrate that a diverse class of MPS can be exactly prepared using constant-depth adaptive quantum circuits, outperforming theoretically optimal preparation with unitary circuits. We show that this class includes short- and long-ranged entangled MPS, symmetry-protected topological (SPT) and symmetry-broken states, MPS with finite Abelian, non-Abelian, and continuous symmetries, resource states for MBQC, and families of states with tunable correlation length. Moreover, we illustrate the utility of our framework for designing constant-depth sampling protocols, such as for random MPS or for generating MPS in a particular SPT phase. We present sufficient conditions for particular MPS to be preparable in constant time, with global on-site symmetry playing a pivotal role. Altogether, this work demonstrates the immense promise of adaptive quantum circuits for efficiently preparing many-body entangled states and provides explicit algorithms that outperform known protocols to prepare an essential class of states. Published by the American Physical Society 2024