ﻻ يوجد ملخص باللغة العربية
Topological quantum computing is believed to be inherently fault-tolerant. One mathematical justification would be to prove that ground subspaces or ground state manifolds of topological phases of matter behave as error correction codes with macroscopic distance. While this is widely assumed and used as a definition of topological phases of matter in the physics literature, besides the doubled abelian anyon models in Kitaevs seminal paper, no non-abelian models are proven to be so mathematically until recently. Cui et al extended the theorem from doubled abelian anyon models to all Kitaev models based on any finite group. Those proofs are very explicit using detailed knowledge of the Hamiltonians, so it seems to be hard to further extend the proof to cover other models such as the Levin-Wen. We pursue a totally different approach based on topological quantum field theories (TQFTs), and prove that a lattice implementation of the disk axiom and annulus axiom in TQFTs as essentially the equivalence of TQO1 and TQO2 conditions. We confirm the error correcting properties of ground subspaces for topological lattice Hamiltonian schemas of the Levin-Wen model and Dijkgraaf-Witten TQFTs by providing a lattice version of the disk axiom and annulus of the underlying TQFTs. The error correcting property of ground subspaces is also shared by gapped fracton models such as the Haah codes. We propose to characterize topological phases of matter via error correcting properties, and refer to gapped fracton models as lax-topological.
Topological quantum error-correcting codes are a promising candidate for building fault-tolerant quantum computers. Decoding topological codes optimally, however, is known to be a computationally hard problem. Various decoders have been proposed that
We introduce a purely graph-theoretical object, namely the coding clique, to construct quantum errorcorrecting codes. Almost all quantum codes constructed so far are stabilizer (additive) codes and the construction of nonadditive codes, which are pot
We present a general formalism for quantum error-correcting codes that encode both classical and quantum information (the EACQ formalism). This formalism unifies the entanglement-assisted formalism and classical error correction, and includes encodin
We study stabilizer quantum error correcting codes (QECC) generated under hybrid dynamics of local Clifford unitaries and local Pauli measurements in one dimension. Building upon 1) a general formula relating the error-susceptibility of a subregion t
In this paper, based on the nonbinary graph state, we present a systematic way of constructing good non-binary quantum codes, both additive and nonadditive, for systems with integer dimensions. With the help of computer search, which results in many