Related papers: Universal Gates from Braiding and Fusing Anyons on…
We study the quantum computational power of a generic class of anisotropic solid state Hamiltonians. A universal set of encoded logic operations are found which do away with difficult-to-implement single-qubit gates in a number of quantum…
This expository article supplies the mathematical background underpinning the braid representation calculator introduced in arXiv:2212.00831; those representations describe the sets of logic gates available to a topological quantum computer…
We present the teleportation and superdense coding protocols for a family of anyon theories coming from Tambara-Yamagami categories, of which the lowest rank theories describe Ising anyons. In contrast to the usual approach to anyonic…
We first give a brief exposition of our recent realization of anyonic quantum states on single M5-brane probes in 11D super-gravity backgrounds, by non-perturbative quantization of the topological sector of the self-dual tensor field on the…
We show that a set of gates that consists of all one-bit quantum gates (U(2)) and the two-bit exclusive-or gate (that maps Boolean values $(x,y)$ to $(x,x \oplus y)$) is universal in the sense that all unitary operations on arbitrarily many…
We show that all quantum gates which could be implemented by braiding of Ising anyons in the Ising topological quantum computer preserve the n-qubit Pauli group. Analyzing the structure of the Pauli group's centralizer, also known as the…
We naturally obtain the NOT and CNOT logic gates, which are key pieces of quantum computing algorithms, in the framework of the non-Abelian Chern-Simons-Higgs theory in two spatial dimensions. For that, we consider the anyonic quantum…
A universal quantum computing scheme, with a universal set of logical gates, is proposed based on networks of 1D quantum systems. The encoding of information is in terms of universal features of gapped phases, for which effective field…
We study the resources required to achieve universal quantum computing via the gate sets that provide the fundamental instructions from which quantum algorithms are built. While single-gate universal sets are known, they rely on precisely…
Measurement-based quantum computation describes a scheme where entanglement of resource states is utilized to simulate arbitrary quantum gates via local measurements. Recent works suggest that symmetry-protected topologically non-trivial,…
Any residual coupling of a quantum computer to the environment results in computational errors. Encoding quantum information in a so-called decoherence-free subspace provides means to avoid these errors. Despite tremendous progress in…
Implementing a qubit quantum computer in continuous-variable systems conventionally requires the engineering of specific interactions according to the encoding basis states. In this work, we present a unified formalism to conduct universal…
We propose protocols to implement non-Clifford logical gates between stabilizer codes by entangling into a non-Abelian topological order as an intermediate step. Generalizing previous approaches, we provide a framework that generates a…
Qubits in topological quantum computation are built from non-Abelian anyons. Adiabatic braiding of anyons is exploited as topologically protected logical gate operations. Thus, the adiabaticity upon which the notion of quantum statistics is…
Topological quantum computation with Fibonacci anyons relies on the possibility of efficiently generating unitary transformations upon pseudoparticles braiding. The crucial fact that such set of braids has a dense image in the unitary…
A problem of universality in simulation of evolution of quantum system and in theory of quantum computations is related with the possibility of expression or approximation of arbitrary unitary transformation by composition of specific…
While the realization of scalable quantum computation will arguably require topological stabilization and, with it, topological-hardware-aware quantum programming and topological-quantum circuit verification, the proper combination of these…
A topological order is a new quantum phase that is beyond Landau's symmetry-breaking paradigm. Its defining features include robust degenerate ground states, long-range entanglement and anyons. It was known that $R$- and $F$-matrices, which…
We study the non-abelian statistics characterizing systems where counter-propagating gapless modes on the edges of fractional quantum Hall states are gapped by proximity-coupling to superconductors and ferromagnets. The most transparent…
We revisit the question of universality in quantum computing and propose a new paradigm. Instead of forcing a physical system to enact a predetermined set of universal gates (e.g., single-qubit operations and CNOT), we focus on the…