Related papers: 3-Fermion topological quantum computation

Topological quantum computing promises error-resistant quantum computation without active error correction. However, there is a worry that during the process of executing quantum gates by braiding anyons around each other, extra anyonic…

We describe in detail how to perform universal fault-tolerant quantum computation on a 2-D color code, making use of only nearest neighbor interactions. Three defects (holes) in the code are used to represent logical qubits. Triple defect…

We consider Abelian topological quantum field theories (TQFTs) in 3d and show that gaugings of invertible global symmetries naturally give rise to additive codes. These codes emerge as nonanomalous subgroups of the 1-form symmetry group,…

In a topological quantum computer, universal quantum computation is performed by dragging quasiparticle excitations of certain two dimensional systems around each other to form braids of their world lines in 2+1 dimensional space-time. In…

In three spatial dimensions, particles are limited to either bosonic or fermionic statistics. Two-dimensional systems, on the other hand, can support anyonic quasiparticles exhibiting richer statistical behaviours. An exciting proposal for…

A quantum computer can perform exponentially faster than its classical counterpart. It works on the principle of superposition. But due to the decoherence effect, the superposition of a quantum state gets destroyed by the interaction with…

We show that universal quantum computation can be concretely made fault-tolerant without mid-circuit measurements. To this end, we introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical $\mathit{CCZ}$…

We investigate the measurement-only topological quantum computation (MOTQC) approach proposed by Bonderson et al. [Phys. Rev. Lett. 101, 010501 (2008)] where the braiding operation is shown to be equivalent to a series of topological charge…

Non-Abelian anyons promise to reveal spectacular features of quantum mechanics that could ultimately provide the foundation for a decoherence-free quantum computer. A key breakthrough in the pursuit of these exotic particles originated from…

Quantum computers are predicted to utilize quantum states to perform memory and to process tasks far faster than those of conventional classical computers. In this paper we show a new road towards building fault tolerance quantum computer…

In this work, we propose and study in depth a universal quantum computing architecture based on a quantum construction of transistors. Our teleportation-based quantum transistors, called ``telesistors'', are ground states of systems with…

We present a scalable architecture for fault-tolerant topological quantum computation using networks of voltage-controlled Majorana Cooper pair boxes, and topological color codes for error correction. Color codes have a set of transversal…

Quasiparticle poisoning, expected to arise during the measurement of Majorana zero mode state, poses a fundamental problem towards the realization of Majorana-based quantum computation. Parafermions, a natural generalization of Majorana…

Simulation of quantum systems that provide intrinsically fault-tolerant quantum computation is shown to preserve fault tolerance. Errors committed in the course of simulation are eliminated by the natural error-correcting features of the…

In topological quantum computation, quantum information is stored in states which are intrinsically protected from decoherence, and quantum gates are carried out by dragging particle-like excitations (quasiparticles) around one another in…

The three-dimensional (3D) Ising model is mapped into a 3D spinless fermionic model by the Jordan-Wigner transformation. The exact solution of the 3D model for spinless fermions is derived analytically by performing a diagonalization…

We elaborate the idea of quantum computation through measuring the correlation of a gapped ground state, while the bulk Hamiltonian is utilized to stabilize the resource. A simple computational primitive, by pulling out a single spin…

We show that the topological modular functor from Witten-Chern-Simons theory is universal for quantum computation in the sense a quantum circuit computation can be efficiently approximated by an intertwining action of a braid on the…

In a topological quantum computer, braids of non-Abelian anyons in a (2+1)-dimensional space-time form quantum gates, whose fault tolerance relies on the topological, rather than geometric, properties of the braids. Here we propose to…

Topological quantum computation provides an elegant way around decoherence, as one encodes quantum information in a non-local fashion that the environment finds difficult to corrupt. Here we establish that one of the key…