Related papers: Universal quantum computing with parafermions assi…
We show that an n-th root of the Walsh-Hadamard transform (obtained from the Hadamard gate and a cyclic permutation of the qubits), together with two diagonal matrices, namely a local qubit-flip (for a fixed but arbitrary qubit) and a…
Exchanging the positions of two non-Abelian anyons transforms between many-body wavefunctions within a degenerate ground-state manifold. This behavior is fundamentally distinct from fermions, bosons and Abelian anyons. Recently, quantum…
In condensed matter physics, non-Abelian statistics for Majorana zero modes (or Majorana Fermions) is very important, really exotic, and completely robust. The race for searching Majorana zero modes and verifying the corresponding…
In a topological quantum computer, universality is achieved by braiding and quantum information is natively protected from small local errors. We address the problem of compiling single-qubit quantum operations into braid representations…
We propose a scheme for universal quantum computing based on Kramers rare-earth ions. Their nuclear spins in the presence of a Zeeman-split electronic crystal field ground state act as 'passive' qubits which store quantum information. The…
We extend the topological quantum computation scheme using the Pfaffian quantum Hall state, which has been recently proposed by Das Sarma et al., in a way that might potentially allow for the topologically protected construction of a…
A fundamental problem in fault-tolerant quantum computation is the tradeoff between universality and dimensionality, exemplified by the the Bravyi-K\"onig bound for $n$-dimensional topological stabilizer codes. In this work, we extend…
Fourier transform is an essential ingredient in Shor's factoring algorithm. In the standard quantum circuit model with the gate set $\{\U(2), \textrm{CNOT}\}$, the discrete Fourier transforms $F_N=(\omega^{ij})_{N\times N},i,j=0,1,..., N-1,…
We study the implementation of a universal quantum gate set via multiple-braiding within $SU(2)_k$ ($k > 2$, $k \neq 4$) anyon models. The multiple elementary braiding matrices (MEBMs) are derived from the $q$-deformed representation theory…
Braiding of Majorana fermions gives accurate topological quantum operations that are intrinsically robust to noise and imperfection, providing a natural method to realize fault-tolerant quantum information processing. Unfortunately, it is…
In this paper we will present some ideas to use 3D topology for quantum computing extending ideas from a previous paper. Topological quantum computing used \textquotedblleft knotted\textquotedblright{} quantum states of topological phases…
Qubits built out of Majorana zero modes (MZMs) have long been theorized as a potential pathway toward fault-tolerant topological quantum computation. Almost unavoidable in these processes is Majorana wavefunction overlap, known as…
Parafermions are fractional excitations which can be regarded as generalizations of Majorana bound states, but in contrast to the latter they require electron-electron interactions. Compared to Majorana bound states, they offer richer…
Superconducting logic is fast and energy-efficient relative to CMOS, but also fundamental studies are needed to scale up circuits for greater utility. Recently, ballistic shift registers for single-flux quanta (SFQ) bits were shown in…
We introduce an exactly solvable model of interacting Majorana fermions realizing $Z_{2}$ topological order with a $Z_{2}$ fermion parity grading and lattice symmetries permuting the three fundamental anyon types. We propose a concrete…
There are various gate sets that can be used to describe a quantum computation. A particularly popular gate set in the literature on quantum computing consists of arbitrary single-qubit gates and 2-qubit CNOT gates. A CNOT gate is however…
Quantum information science strives to leverage the quantum-mechanical nature of our universe in order to achieve large improvements in certain information processing tasks. In deep-space optical communications, current receivers for the…
Any quantum computational network can be constructed with a sequence of the two-qubit diagonal quantum gates and one-qubit gates in two-state quantum systems. The universal construction of these quantum gates in the quantum systems and of…
We propose and study a parafermionic generalization of the topological Kondo effect. The latter has been predicted to arise for a Coulomb-blockaded mesoscopic topological superconductor (Majorana box), where at least three normal leads are…
Quantum arithmetic computation requires a substantial number of scratch qubits to stay reversible. These operations necessitate qubit and gate resources equivalent to those needed for the larger of the input or output registers due to state…