相关论文: Anyon condensation and the color code
We review here the recent success in quantum annealing, i.e., optimization of the cost or energy functions of complex systems utilizing quantum fluctuations. The concept is introduced in successive steps through the studies of mapping of…
The monochromatic driving of a quantum system is a successful technique in quantum simulations, well captured by an effective Hamiltonian approach, and with applications in artificial gauge fields and topological engineering. In this…
The surface code is currently the leading proposal to achieve fault-tolerant quantum computation. Among its strengths are the plethora of known ways in which fault-tolerant Clifford operations can be performed, namely, by deforming the…
We introduce the domain wall color code, a new variant of the quantum error-correcting color code that exhibits exceptionally high code-capacity error thresholds for qubits subject to biased noise. In the infinite bias regime, a…
Topological color codes are widely acknowledged as promising candidates for fault-tolerant quantum computing. Neither a two-dimensional nor a three-dimensional topology, however, can provide a universal gate set $\{$H, T, CNOT$\}$, with the…
We study and generalize the class of qubit topological stabilizer codes that arise in the Abelian phase of the honeycomb lattice model. The resulting family of codes, which we call `matching codes' realize the same anyon model as the…
As there is no quantum error correction code with universal set of transversal gates, several approaches have been proposed which, in combination of transversal gates, make universal fault-tolerant quantum computation possible. Magic state…
Topological quantum computation encodes quantum information in the internal fusion space of non-Abelian anyonic quasiparticles, whose braiding implements logical gates. This goes beyond Abelian topological order (TO) such as the toric code,…
Bosonic codes represent a promising route toward quantum error correction in continuous-variable systems, with direct relevance to experimental platforms such as circuit QED and optomechanics. However, their preparation and stabilization…
Fault-tolerant quantum computation critically depends on architectures uniting high encoding rates with physical implementability. Quantum low-density parity-check (qLDPC) codes, including bivariate bicycle (BB) codes, achieve dramatic…
We present ColorFloat, a family of O(1) space complexity algorithms that solve the problem of attributing (coloring) fungible tokens to the entity that minted them (minter). Tagging fungible tokens with metadata is not a new problem and was…
We numerically study the effects of two forms of quenched disorder on the anyons of the toric code. Firstly, a new class of codes based on random lattices of stabilizer operators is presented, and shown to be superior to the standard square…
Non-semisimple extensions of the Ising anyon model developed in our previous work enable universal topological quantum computation via braiding alone, overcoming the Clifford-only limitation of semisimple theories. The non-semisimple theory…
We investigate the composite systems consisting of topological orders separated by gapped domain walls. We derive a pair of domain-wall Verlinde formulae, that elucidate the connection between the braiding of interdomain excitations labeled…
Recent measurements on 2d materials tuning between fractional quantum anomalous Hall phases and a plethora of correlated electronic states call for a detailed understanding of the dynamics of anyons. Here we develop a general theory of the…
We systematically construct and classify fault-tolerant logical gates implemented by constant-depth circuits for quantum codes using cohomology operations and symmetry. These logical gates are obtained from unitary operators given by…
Topological quantum computation (TQC) is one of the most striking architectures that can realize fault-tolerant quantum computers. In TQC, the logical space and the quantum gates are topologically protected, i.e., robust against local…
Fault-tolerant quantum computation (FTQC) schemes using large block codes that encode $k>1$ qubits in $n$ physical qubits can potentially reduce the resource overhead to a great extent because of their high encoding rate. However, the…
We present a unified category-theoretic framework for quantum Hall hierarchy constructions and anyon superconductivity based on modular tensor categories over $\mathrm{Rep}(\mathrm{U}(1))$ and $\mathrm{sRep}(\mathrm{U}(1)^f)$. Our approach…
Product codes are a class of quantum error correcting codes built from two or more constituent codes. They have recently gained prominence for a breakthrough yielding quantum low-density parity-check (qLDPC) codes with favorable scaling of…