We propose a systematic and efficient quantum circuit composed solely of Clifford gates for simulating the ground state of the surface code model. This approach yields the ground state of the toric code in ⌈2L+2+log2(d)+L2d⌉ time steps, where L refers to the system size and d represents the maximum distance to constrain the application of the CNOT gates. Our algorithm reformulates the problem into a purely geometric one, facilitating its extension to attain the ground state of certain 3D topological phases, such as the 3D toric model in 3L+8 steps and the X-cube fracton model in 12L+11 steps. Furthermore, we introduce a gluing method involving measurements, enabling our technique to attain the ground state of the 2D toric code on an arbitrary planar lattice and paving the way to more intricate 3D topological phases.
We propose a systematic and efficient quantum circuit composed solely of Clifford gates for simulating the ground state of the surface code model. This approach yields the ground state of the toric code in ⌈2L+2+log2(d)+L2d⌉ time steps, where L refers to the system size and d represents the maximum distance to constrain the application of the CNOT gates. Our algorithm reformulates the problem into a purely geometric one, facilitating its extension to attain the ground state of certain 3D topological phases, such as the 3D toric model in 3L+8 steps and the X-cube fracton model in 12L+11 steps. Furthermore, we introduce a gluing method involving measurements, enabling our technique to attain the ground state of the 2D toric code on an arbitrary planar lattice and paving the way to more intricate 3D topological phases.
The surface code is a leading candidate quantum error correcting code, owing to its high threshold, and compatibility with existing experimental architectures. Bravyi et al. (2006) showed that encoding a state in the surface code using local unitary operations requires time at least linear in the lattice size L , however the most efficient known method for encoding an unknown state, introduced by Dennis et al. (2002), has O(L2) time complexity. Here, we present an optimal local unitary encoding circuit for the planar surface code that uses exactly 2L time steps to encode an unknown state in a distance L planar code. We further show how an O(L) complexity local unitary encoder for the toric code can be found by enforcing locality in the O(logL) -depth non-local renormalisation encoder. We relate these techniques by providing an O(L) local unitary circuit to convert between a toric code and a planar code, and also provide optimal encoders for the rectangular, rotated and 3D surface codes. Furthermore, we show how our encoding circuit for the planar code can be used to prepare fermionic states in the compact mapping, a recently introduced fermion to qubit mapping that has a stabiliser structure similar to that of the surface code and is particularly efficient for simulating the Fermi-Hubbard model.
The surface code is a leading candidate quantum error correcting code, owing to its high threshold, and compatibility with existing experimental architectures. Bravyi {et al.} [7] showed that encoding a state in the surface code using local unitary operations requires time at least linear in the lattice size L, however the most efficient known method for encoding an unknown state, introduced by Dennis {et al.} [18], has O(L^{2}) time complexity. Here, we present an optimal local unitary encoding circuit for the planar surface code that uses exactly 2L time steps to encode an unknown state in a distance L planar code. We further show how an O(L) complexity local unitary encoder for the toric code can be found by enforcing locality in the O(log L) -depth non-local renormalisation encoder. We relate these techniques by providing an O(L) local unitary circuit to convert between a toric code and a planar code, and also provide optimal encoders for the rectangular, rotated and 3D surface codes. Furthermore, we show how our encoding circuit for the planar code can be used to prepare fermionic states in the compact mapping, a recently introduced fermion to qubit mapping that has a stabiliser structure similar to that of the surface code and is particularly efficient for simulating the Fermi-Hubbard model.
Given the wide applicability of topological states for fault-tolerant quantum computation, an important outstanding question is how to generate these states within the quantum circuit model, and if it is possible to do so efficiently. In this work, toric code states on the torus are mapped to an equivalent graph state under local Clifford operations. The graph is composed of only two subgraphs, both of which can be generated in log depth, assuming geometrically non-local gates. Including ancillae and measurements, the circuit depth can be reduced to a constant at the cost of increasing the circuit width. Among many insights, the toric code graph structure reveals a close connection between repetition and topological codes. Due to their local equivalence to the toric code, all two-dimensional translationally invariant topological stabilizer codes are therefore efficiently preparable on a quantum circuit. The results provide a new graph-theoretic framework for the development of novel topological error correction codes, beyond geometrical considerations.
We study the structure and transversal logical capabilities of stabilizer quantum error correcting codes. Among our results, we identify universal lower bounds on circuit depth to generate a full logical Clifford algebra, and develop novel constructions of logical transversal gates including a new depth-one transversal phase S gate in the rotated surface code and a depth-one intra-block CZ gate in the 2D-toric code that generalizes to all odd distances and all lengths L≥3, respectively. Finally, we construct a high-rate non-LDPC CSS code family with parameters [[n,n,Θ(nβ)]] where β≈0.2823 in one demonstrated case, that provably possesses a constant-depth complete 2-local transversal logical Clifford basis instruction set architecture (ISA) composed of all individually targeted S, SHS=X, and CZ gates. This ISA is depth-one for certain subfamilies that we design and generally constant-depth under certain conditions. The code family is built from a small code with parameters [[n0,2,d0]], and is tunable in the standard way: it tiles out to form utility-scale logical qubit counts, and it scales up through concatenation to achieve higher distances and error suppression. We show that this construction preserves the depth-one complete transversal logical Clifford basis ISA when composed with these commuting construction actions, inheriting structure from the core codes so that at scale the complete logical Clifford basis ISA remains depth-one up to depth-two addressable operations between tiled cores. We call these Quantum Logic Codes.
A decade ago Kitaev's toric code model established the new paradigm of topological quantum computation. Due to remarkable theoretical and experimental progress, the quantum simulation of such complex many-body systems is now within the realms of possibility. Here we consider the question, to which extent the ground states of small toric code systems differ from local-unitary (LU)-equivalent graph states. We argue that simplistic (though experimentally attractive) setups obliterate the differences between the toric code and equivalent graph states; hence we search for the smallest setups on the square and triangular lattices, such that the quasilocality of the toric code Hamiltonian becomes a distinctive feature. To this end, a purely geometric procedure to transform a given toric code setup into a local-Clifford (LC)-equivalent graph state is derived. In combination with an algorithmic computation of LC-equivalent graph states, we find the smallest nontrivial setup on the square lattice to contain five plaquettes and 16 qubits; on the triangular lattice the number of plaquettes and qubits is reduced to four and nine, respectively.
Demonstrating how long-range entangled states are born from product states has gained much attention, which is not only important for quantum technology but also provides an unconventional tool in characterizing and classifying exotic phases of matter. In this paper, we introduce a unified and efficient framework of quantum circuits (i.e., a series of local unitary transformations), termed the seed-entangler-enriched sequential quantum circuit (SEESQC) to construct long-range entangled states (i.e., code states) in the code space of topological error-correcting codes. Specifically, we apply SEESQC to construct code states of tetradigit models---a broad class of long-range entangled stabilizer codes indexed by a four-digit parameter. These models are not rare but encompass toric codes across arbitrary dimensions and subsume the X-cube fracton code as special cases. Featuring a hierarchical structure of generalized entanglement renormalization group, many tetradigit models host spatially extended excitations (e.g., loops, membranes, and exotic nonmanifold objects) with constrained mobility and deformability, and exhibit system-size-dependent ground-state degeneracies that scale exponentially with a polynomial in linear sizes. In this work, we begin with graphical and algebraic demonstration of quantum circuits for the computational basis states, before generalizing to broader cases. Central to this framework is a key ingredient termed the seed-entangler acting on a small number of qubits termed seeds, enabling a systematic scheme to achieve arbitrary code states. Remarkably, the number of available seeds equals the number of logical qubits for the constructed examples, which leaves plenty of room for future investigation in theoretical physics, mathematics and quantum information science. Beyond the critical limitation of prior state-engineering methodologies, which required entirely distinct, model-specific circuit designs for each class of topological order, this framework transcends spatial dimensions, bridges liquid and nonliquid states, and unifies gapped phases governed by distinct entanglement renormalization group schemes. With experimental feasibility via synthetic dimensions in modern quantum simulators, the SEESQC framework offers a pathway toward engineering topological phases, and manipulating logical qubits.