Related papers: Systematic Computation of Braid Generator Matrix i…
Classical simulation of quantum computation is necessary for studying the numerical behavior of quantum algorithms, as there does not yet exist a large viable quantum computer on which to perform numerical tests. Tensor network (TN)…
We review the topological quantum computation scheme of Das Sarma et al. from the perspective of the conformal field theory for the two-dimensional critical Ising model. This scheme originally used the monodromy properties of the…
Recently, it was argued that the braiding and statistics of anyons in a two-dimensional topological phase can be extracted by studying the quantum entanglement of the degenerate ground-states on the torus. This construction either required…
We propose an encoding for topological quantum computation utilizing quantum representations of mapping class groups. Leakage into a non-computational subspace seems to be unavoidable for universality in general. We are interested in the…
Braid theories are applied to quantum computation processes, where to each crossing in the Braid diagram a unitary Yang-Baxter operator R is associated, representing either a Braiding matrix or a universal quantum gate. By operating with…
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…
We study the problem of universality in the anyon model described by the $SU(2)$ Witten-Chern-Simons theory at level $k$. A classic theorem of Freedman-Larsen-Wang states that for $k \geq 3, \ k \neq 4$, braiding of the anyons of…
We describe the mathematical theory of topological quantum computing with symmetry defects in the language of fusion categories and unitary representations. Symmetry defects together with anyons are modeled by G-crossed braided extensions…
In seminal work (arxiv:quant-ph/9707021) Alexei Kitaev proposed topological quantum computing (arXiv:cond-mat/0010440, arxiv:quant-ph/9707021, arXiv:quant-ph/0001108, arXiv:0707.1889), whereby logic gates of a quantum computer are conducted…
Quantum compiling, a process that decomposes the quantum algorithm into a series of hardware-compatible commands or elementary gates, is of fundamental importance for quantum computing. We introduce an efficient algorithm based on deep…
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 consider universal statistical properties of systems that are characterized by phase states with macroscopic degeneracy of the ground state. A possible topological order in such systems is described by non-linear discrete equations. We…
A class of anyonic models for universal quantum computation based on weakly-integral anyons has been recently proposed. While universal set of gates cannot be obtained in this context by anyon braiding alone, designing a certain type of…
Knots and links represent a fundamental motif of non-local connectivity that permeates the physical sciences from string theory to protein folds. While spectral braiding has been explored in two-band non-Hermitian models across various…
The anyonic excitations of topological two-body color code model are used to implement a set of gates. Because of two-body interactions, the model can be simulated in optical lattices. The excitations have nontrivial mutual statistics, and…
Quantum computing promises a new approach to solving difficult computational problems, and the quest of building a quantum computer has started. While the first attempts on construction were succesful, scalability has never been achieved,…
We investigate the topological quantum compilation of two-qubit operations within a system of Fibonacci anyons. Our primary goal is to generate gates that are approximately leakage-free and equivalent to the controlled-NOT (CNOT) gate up to…
The aim of this paper is to analyse algorithms for constructing presentations of graph braid groups from the point of view of anyonic quantum statistics on graphs. In the first part of this paper, we provide a comprehensive review of an…
The spin network quantum simulator relies on the su(2) representation ring (or its q-deformed counterpart at q= root of unity) and its basic features naturally include (multipartite) entanglement and braiding. In particular, q-deformed spin…
While there is a general consensus about the structure of one qubit operations in topological quantum computer, two qubits are as usual a more difficult and complex story of different attempts with varying approaches, problems and…