Related papers: Quantum double aspects of surface code models
With recent breakthroughs in the construction of good qLDPC codes and nearly good qLTCs, the study of (co)homological invariants of quantum code complexes, which fundamentally underlie their logical operations, has become evidently…
Quantum computing (QC) is at the cusp of a revolution. Machines with 100 quantum bits (qubits) are anticipated to be operational by 2020 [googlemachine,gambetta2015building], and several-hundred-qubit machines are around the corner.…
We study parallel fault-tolerant quantum computing for families of homological quantum low-density parity-check (LDPC) codes defined on 3-manifolds with constant or almost-constant encoding rate. We derive generic formula for a transversal…
Quantum error correction (QEC) and fault-tolerant (FT) mechanisms are essential for reliable quantum computing. However, QEC considerably increases the computation size up to four orders of magnitude. Moreover, FT implementation has…
The development of quantum codes with good error correction parameters and useful sets of transversal gates is a problem of major interest in quantum error-correction. Abundant prior works have studied transversal gates which are restricted…
Each year, the gap between theoretical proposals and experimental endeavours to create quantum computers gets smaller, driven by the promise of fundamentally faster algorithms and quantum simulations. This occurs by the combination of…
Individual impurity atoms in silicon can make superb individual qubits, but it remains an immense challenge to build a multi-qubit processor: There is a basic conflict between nanometre separation desired for qubit-qubit interactions, and…
We classify equivalence classes of Hopf algebra quotient pairs $(D,\theta)$ of the Drinfeld double $D(G)$ of a finite group scheme $G$ over an algebraically closed field $\mathbf{k}$ of characteristic $p\ge 0$, in terms of group…
The network paradigm for quantum computing involves interconnecting many modules to form a scalable machine. Typically it is assumed that the links between modules are prone to noise while operations within modules have significantly higher…
Quantum error correction will be a necessary component towards realizing scalable quantum computers with physical qubits. Theoretically, it is possible to perform arbitrarily long computations if the error rate is below a threshold value.…
We compute quantum character varieties of arbitrary closed surfaces with boundaries and marked points. These are categorical invariants $\int_S\mathcal A$ of a surface $S$, determined by the choice of a braided tensor category $\mathcal A$,…
We analyze propagation of quantum information along chiral Majorana edge states in two-dimensional topological materials. The use of edge states may facilitate the braiding operation, an important ingredient in topological quantum…
In recent papers of the author, a method was developed for constructing quasitriangular Hopf algebras (quantum groups) of the quantum-double type. As a by-product, a novel non-standard example of the quantum double has been found. In the…
A scalable quantum information processing architecture based on silicon metal-oxide-semiconductor technology is presented, combining quantum hardware elements from planar and 3D silicon-on-insulator technologies. This architecture is…
We conjecture that appropriate K-theoretic Gromov-Witten invariants of complex flag manifolds G/B are governed by finite-difference versions of Toda systems constructed in terms of the Langlands-dual quantized universal enveloping algebras…
In this paper we introduce a new class of integrable 3D lattice models, possessing continuous families of commuting layer-to-layer transfer matrices. Algebraically, this commutativity is based on a very special construction of local…
We introduce a two-body quantum Hamiltonian model with spins-$\half$ located on the vertices of a 2D spatial lattice. The model exhibits an exact topological degeneracy in all coupling regimes. This is a remarkable non-perturbative effect.…
A basic question in the theory of fault-tolerant quantum computation is to understand the fundamental resource costs for performing a universal logical set of gates on encoded qubits to arbitrary accuracy. Here we consider qubits encoded…
While stabilizer tableaus have proven exceptionally useful as a descriptive tool for additive quantum codes, they offer little guidance for concrete constructions or coding algorithm analysis. We introduce a representation of stabilizer…
Fault tolerance is a prerequisite for scalable quantum computing. Architectures based on 2D topological codes are effective for near-term implementations of fault tolerance. To obtain high performance with these architectures, we require a…