Galois orbits of TQFTs: symmetries and unitarity

We study Galois actions on 2+1D topological quantum field theories (TQFTs), characterizing their interplay with theory factorization, gauging, the structure of gapped boundaries and dualities, 0-form symmetries, 1-form symmetries, and 2-groups. In order to gain a better physical understanding of Galois actions, we prove sufficient conditions for the preservation of unitarity. We then map out the Galois orbits of various classes of unitary TQFTs. The simplest such orbits are trivial (e.g., as in various theories of physical interest like the Toric Code, Double Semion, and 3-Fermion Model), and we refer to such theories as unitary “Galois fixed point TQFTs”. Starting from these fixed point theories, we study conditions for preservation of Galois invariance under gauging 0-form and 1-form symmetries (as well as under more general anyon condensation). Assuming a conjecture in the literature, we prove that all unitary Galois fixed point TQFTs can be engineered by gauging 0-form symmetries of theories built from Deligne products of certain abelian TQFTs.

On tensor network representations of the (3+1)d toric code

We define two dual tensor network representations of the (3+1)d toric code ground state subspace. These two representations, which are obtained by initially imposing either family of stabilizer constraints, are characterized by different virtual symmetries generated by string-like and membrane-like operators, respectively. We discuss the topological properties of the model from the point of view of these virtual symmetries, emphasizing the differences between both representations. In particular, we argue that, depending on the representation, the phase diagram of boundary entanglement degrees of freedom is naturally associated with that of a (2+1)d Hamiltonian displaying either a global or a gauge Z2-symmetry.

Almost-linear time decoding algorithm for topological codes

In order to build a large scale quantum computer, one must be able to correct errors extremely fast. We design a fast decoding algorithm for topological codes to correct for Pauli errors and erasure and combination of both errors and erasure. Our algorithm has a worst case complexity of O(nα(n)), where n is the number of physical qubits and α is the inverse of Ackermann's function, which is very slowly growing. For all practical purposes, α(n)≤3. We prove that our algorithm performs optimally for errors of weight up to (d−1)/2 and for loss of up to d−1 qubits, where d is the minimum distance of the code. Numerically, we obtain a threshold of 9.9% for the 2d-toric code with perfect syndrome measurements and 2.6% with faulty measurements.

Dynamically Generated Logical Qubits

We present a quantum error correcting code with dynamically generated logical qubits. When viewed as a subsystem code, the code has no logical qubits. Nevertheless, our measurement patterns generate logical qubits, allowing the code to act as a fault-tolerant quantum memory. Our particular code gives a model very similar to the two-dimensional toric code, but each measurement is a two-qubit Pauli measurement.

Optimal local unitary encoding circuits for the surface code

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(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.

Dissipative encoding of quantum information

We formalize the problem of dissipative quantum encoding, and explore the advantages of using Markovian evolution to prepare a quantum code in the desired logical space, with emphasis on discrete-time dynamics and the possibility of exact finite-time convergence. In particular, we investigate robustness of the encoding dynamics and their ability to tolerate initialization errors, thanks to the existence of non-trivial basins of attraction. As a key application, we show that for stabilizer quantum codes on qubits, a finite-time dissipative encoder may always be constructed, by using at most a number of quantum maps determined by the number of stabilizer generators. We find that even in situations where the target code lacks gauge degrees of freedom in its subsystem form, dissipative encoders afford nontrivial robustness against initialization errors, thus overcoming a limitation of purely unitary encoding procedures. Our general results are illustrated in a number of relevant examples, including Kitaev's toric code.