Related papers: Topological Computation without Braiding
Quantum computation in solid state quantum dots faces two significant challenges: Decoherence from interactions with the environment and the difficulty of generating local magnetic fields for the single qubit rotations. This paper presents…
The ability to perform computations on encrypted data is a powerful tool for protecting privacy. Recently, protocols to achieve this on classical computing systems have been found. Here we present an efficient solution to the quantum…
We study the computation power of lattices composed of two dimensional systems (qubits) on which translationally invariant global two-qubit gates can be performed. We show that if a specific set of 6 global two qubit gates can be performed,…
We give a general proof for the existence and realizability of Clifford gates in the Ising topological quantum computer. We show that all quantum gates that can be implemented by braiding of Ising anyons are Clifford gates. We find that the…
We propose to implement tunable interfaces for realizing universal quantum computation with topological qubits. One interface is between the topological and superconducting qubits, which can realize arbitrary single-qubit gate on the…
Toponomic quantum computing (TQC) employs rotation sequences of anticoherent $k$-planes to construct noise-tolerant quantum gates. In this work, we demonstrate the implementation of generalized Toffoli gates, using $k$-planes of spin…
Topological quantum computers provide a fault-tolerant method for performing quantum computation. Topological quantum computers manipulate topological defects with exotic exchange statistics called anyons. The simplest anyon model for…
We show that 2D fractal subsystem symmetry-protected topological phases may serve as resources for universal measurement-based quantum computation. This is demonstrated explicitly for two cluster models known to lie within fractal…
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…
Majorana bound states have been a focus of condensed matter research for their potential applications in topological quantum computation. Here we utilize two charge-qubit arrays to explicitly simulate a DIII class one-dimensional…
Surface codes offer a very promising avenue towards fault-tolerant quantum computation. We argue that two-dimensional interacting networks of Majorana bound states in topological superconductor/semiconductor heterostructures hold several…
Finding physical realizations of topologically ordered states in experimental settings, from condensed matter to artificial quantum systems, has been the main challenge en route to utilizing their unconventional properties. We show how to…
We investigate entanglement naturally present in the 1D topologically ordered phase protected with the on-site symmetry group of an octahedron as a potential resource for teleportation-based quantum computation. We show that, as long as…
We introduce a recoupling theory for virtual braided trees. This recoupling theory can be utilized to incorporate swap gates into anyonic models of quantum computation.
A model of quantum computing is presented, based on properties of connections with a prescribed monodromy group on holomorphic vector bundles over bases with nontrivial topology. Such connections with required properties appear in the…
We develop a computation model for solving Boolean networks by implementing wires through quantum ground-mode computation and gates through identities following from angular momentum algebra and statistics. Gates are represented by…
We construct a class of topological quantum codes to perform quantum entanglement distillation. These codes implement the whole Clifford group of unitary operations in a fully topological manner and without selective addressing of qubits.…
A universal set of gates for (classical or quantum) computation is a set of gates that can be used to approximate any other operation. It is well known that a universal set for classical computation augmented with the Hadamard gate results…
We propose a scheme for quantum computing using high-Q cavities in which the qubits are represented by single cavity modes restricted in the space spanned by the two lowest Fock states. We show that single qubit operations and universal…
We propose a universal quantum computing scheme in which the orthogonal qubit states $|0>$ and $|1>$ are identical in their single-particle spin and charge properties. Each qubit is contained in a single quantum dot and gate operations are…