Related papers: Topological Order, Quantum Codes and Quantum Compu…
2+1D multi-component $U(1)$ gauge theories with a Chern-Simons (CS) term provide a simple and complete characterization of 2+1D Abelian topological orders. In this paper, we extend the theory by taking the number of component gauge fields…
Fault-tolerant quantum computing (FTQC) is essential for achieving large-scale practical quantum computation. Implementing arbitrary FTQC requires the execution of a universal gate set on logical qubits, which is highly challenging.…
Topological stabilizer codes with different spatial dimensions have complementary properties. Here I show that the spatial dimension can be switched using gauge fixing. Combining 2D and 3D gauge color codes in a 3D qubit lattice,…
Gottesman-Kitaev-Preskill (GKP) codes are a promising candidate for implementing fault tolerant quantum computation in quantum harmonic oscillator systems such as superconducting resonators, optical photons and trapped ions, and in recent…
Intersecting codes are a classical object in coding theory whose rank-metric analogue has recently been introduced. Although the definition formally parallels the Hamming-metric case, the structure and parameter constraints of rank-metric…
Executing a logical quantum circuit fault-tolerantly incurs a large spacetime overhead. Recent work has proposed and investigated phantom codes, defined by the property that every in-block logical $\mathrm{CNOT}$ circuit can be implemented…
Topological defects (such as monopoles, vortex lines, or domain walls) mark locations where disparate choices of a broken symmetry vacuum elsewhere in the system lead to irreconcilable differences. They are energetically costly (the energy…
Lattice surgery is a leading approach for implementing fault-tolerant logical operations in surface code quantum computing, but compiling efficient lattice surgery layouts remains challenging. Existing compilers are largely circuit-centric…
One of the leading quantum computing architectures is based on the two-dimensional (2D) surface code. This code has many advantageous properties such as a high error threshold and a planar layout of physical qubits where each physical qubit…
Starting from an isotropic configuration of intersecting, two-dimensional toric codes, we construct a fracton topological phase introduced in Ref. [26], which is characterized by immobile, point- like topological excitations ("fractons"),…
We show how to perform scalable fault-tolerant non-Clifford gates in two dimensions by introducing domain walls between the surface code and a non-Abelian topological code whose codespace is stabilized by Clifford operators. We formulate a…
A fundamental problem of fault-tolerant quantum computation with quantum low-density parity-check (qLDPC) codes is the tradeoff between connectivity and universality. It is widely believed that in order to perform native logical…
It is an ongoing quest to realize topologically ordered quantum states on different platforms including condensed matter systems, quantum simulators and digital quantum processors. Unlike conventional states characterized by their local…
It is well known that two-dimensional fermionic systems with a nonzero Chern number must break the time reversal symmetry, manifested by the appearance of chiral edge modes on an open boundary. Such an incompatibility between topology and…
The advancement of information processing into the realm of quantum mechanics promises a transcendence in computational power that will enable problems to be solved which are completely beyond the known abilities of any "classical"…
We introduce the concept of nested topological order in a class of exact quantum lattice Hamiltonian models with non-abelian discrete gauge symmetry. The topological order present in the models can be partially destroyed by introducing a…
We introduce transversal dimension jump, a code-switching protocol for lifted product (LP) quantum low-density parity-check (qLDPC) codes across different chain-complex dimensions, enabling universal fault-tolerant quantum computation with…
Fault-tolerant logical operations for qubits encoded by CSS codes are discussed, with emphasis on methods that apply to codes of high rate, encoding k qubits per block with k>1. It is shown that the logical qubits within a given block can…
We construct a family of two-dimensional topological stabilizer codes on continuous variable (CV) degrees of freedom, which generalize homological rotor codes and the toric-GKP code. Our topological codes are built using the concept of…
We propose and analyze a structure with which to organize the difference between a knot in the 3-sphere bounding a topologically embedded 2-disk in the 4-ball and it bounding a smoothly embedded disk. The n-solvable filtration of the…