Related papers: Universal quantum computing with parafermions assi…
We show that single-qudit universality in Clifford-based gate sets follows a trichotomy determined by the prime factorization of the local dimension $d$. For prime $d$, any gate outside the Clifford group is universal. For prime-power…
Quantum information protected by the topology of the storage medium is expected to exhibit long coherence times. Another feature are topologically protected gates generated through braiding of Majorana bound states. However, braiding…
We propose a topological qubit in which braiding and readout are mediated by the $4\pi$ Majorana-Josephson effect. The braidonium device consists of three Majorana nanowires that come together to make a tri-junction; in order to control the…
The Gottesman-Knill theorem holds that operations from the Clifford group, when combined with preparation and detection of qubit states in the computational basis, are insufficient for universal quantum computation. Indeed, any measurement…
Fibonacci anyons are non-Abelian particles for which braiding is universal for quantum computation. Reichardt has shown how to systematically generate nontrivial braids for three Fibonacci anyons which yield unitary operations with…
We analyze the posibility of employing the mesoscopic-nanoscopic ring of a normal metal in a doubly degenerate persistent current state with a third auxihilary level and in the presence of the Aharonov-Bohm flux equal to the half of the…
We present some compact quantum circuits for a deterministic quantum computing on electron-spin qubits assisted by quantum dots inside single-side optical microcavities, including the CNOT, Toffoli, and Fredkin gates. They are constructed…
We establish a unified framework for Majorana-based fault-tolerant quantum computation with Majorana surface codes and Majorana color codes. All logical Clifford gates are implemented with zero time overhead. This is done by introducing a…
An efficient and intuitive framework for universal quantum computation is presented that uses pairs of spin-1/2 particles to form logical qubits and a single physical interaction, Heisenberg exchange, to produce all gate operations. Only…
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…
Let G(A,B) denote the 2-qubit gate which acts as the 1-qubit SU(2) gates A and B in the even and odd parity subspaces respectively, of two qubits. Using a Clifford algebra formalism we show that arbitrary uniform families of circuits of…
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…
This is a tutorial review of methods to braid the world lines of non-Abelian anyons (Majorana zero-modes) in topological superconductors. That "Holy Grail" of topological quantum information processing has not yet been reached in the…
We describe how continuous-variable abelian anyons, created on the surface of a continuous-variable analogue of Kitaev's lattice model can be utilized for quantum computation. In particular, we derive protocols for the implementation of…
The realization and manipulation of Majorana zero modes have drawn significant attention for their crucial role in enabling topological quantum computation. Conventional approaches to the braiding of Majorana zero modes rely on adiabatic…
Topological excitations, such as Majorana zero modes, are a promising route for encoding quantum information. Topologically protected gates of Majorana qubits, based on their braiding, will require some form of network. Here, we propose to…
We propose a fluxon-controlled quantum computer incorporated with three-qubit quantum error correction using special gate operations, i.e., joint-phase and SWAP gate operations, inherent in capacitively coupled superconducting flux qubits.…
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…
A topological quantum computer should allow intrinsically fault-tolerant quantum computation, but there remains uncertainty about how such a computer can be implemented. It is known that topological quantum computation can be implemented…
A method for compiling quantum algorithms into specific braiding patterns for non-Abelian quasiparticles described by the so-called Fibonacci anyon model is developed. The method is based on the observation that a universal set of quantum…