Quantum Computing with $\mathbb{Z}_2$ Abelian anyon system
- URL: http://arxiv.org/abs/2203.17235v1
- Date: Tue, 29 Mar 2022 04:59:18 GMT
- Title: Quantum Computing with $\mathbb{Z}_2$ Abelian anyon system
- Authors: Yuanye Zhu
- Abstract summary: Topological quantum computers manipulate topological defects with exotic exchange statistics called anyons.
We report a topological quantum computer prototype based on $mathbb$ abelian anyon system.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: 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 universal topological quantum computation is the Fibonacci anyon model,
which is a non-abelian anyon system. In non-abelian anyon systems, exchanging
anyons always results a unitary operations instead of a simple phase changing
in abelian anyon systems. So, non-abelian anyon systems are of the interest to
topological quantum computation. Up till now, most people still hold the belief
that topological quantum computions can be implemented only on the non-abelian
anyon systems. But actually this is not true. Inspired by extrinsic
semiconductor technology, we suggest that abelian anyon systems with defects
also support topological quantum computing. In this letter, we report a
topological quantum computer prototype based on $\mathbb{Z}_2$ abelian anyon
system.
Related papers
- Demonstrating anyonic non-Abelian statistics with a minimal $d = 6$ qudit lattice [0.0]
We consider a lattice of $d=6$ qudits that give rise to $mathbfD(mathbfS_3)$ non-Abelian anyons.
We present a method that demonstrates the non-commutativity of the braiding and fusion evolutions.
This work represents a foundational step towards the realisation of non-Abelian quantum error-correcting codes.
arXiv Detail & Related papers (2024-08-06T18:00:59Z) - Elementary Quantum Recursion Schemes That Capture Quantum Polylogarithmic Time Computability of Quantum Functions [0.0]
We introduce an elementary form of the quantum recursion, called the fast quantum recursion, and formulate $EQS$ of elementary' quantum functions.
This class captures exactly quantum polylogarithmic-time computability, which forms the complexity class BQPOLYLOGTIME.
We also consider an algorithmic scheme that implements the well-known divide-and-conquer strategy.
arXiv Detail & Related papers (2023-11-27T14:53:45Z) - A Quadratic Speedup in Finding Nash Equilibria of Quantum Zero-Sum Games [102.46640028830441]
We introduce the Optimistic Matrix Multiplicative Weights Update (OMMWU) algorithm and establish its average-iterate convergence complexity as $mathcalO(d/epsilon)$ to $epsilon$-Nash equilibria.
This quadratic speed-up sets a new benchmark for computing $epsilon$-Nash equilibria in quantum zero-sum games.
arXiv Detail & Related papers (2023-11-17T20:38:38Z) - Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
We study the problem of designing worst-case to average-case reductions for quantum algorithms.
We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
arXiv Detail & Related papers (2022-12-06T22:01:49Z) - Non-Abelian braiding of graph vertices in a superconducting processor [144.97755321680464]
Indistinguishability of particles is a fundamental principle of quantum mechanics.
braiding of non-Abelian anyons causes rotations in a space of degenerate wavefunctions.
We experimentally verify the fusion rules of the anyons and braid them to realize their statistics.
arXiv Detail & Related papers (2022-10-19T02:28:44Z) - Quantum Depth in the Random Oracle Model [57.663890114335736]
We give a comprehensive characterization of the computational power of shallow quantum circuits combined with classical computation.
For some problems, the ability to perform adaptive measurements in a single shallow quantum circuit is more useful than the ability to perform many shallow quantum circuits without adaptive measurements.
arXiv Detail & Related papers (2022-10-12T17:54:02Z) - Topological Quantum Computation on Supersymmetric Spin Chains [0.0]
Quantum gates built out of braid group elements form the building blocks of topological quantum computation.
We show that the fusion spaces of anyonic systems can be precisely mapped to the product state zero modes of certain Nicolai-like supersymmetric spin chains.
arXiv Detail & Related papers (2022-09-08T13:52:10Z) - Quantum Field Theories, Topological Materials, and Topological Quantum
Computing [3.553493344868414]
A quantum computer can perform exponentially faster than its classical counterpart.
Topology and knot theory, geometric phases, topological materials, topological quantum field theories, recoupling theory, and category theory are discussed.
arXiv Detail & Related papers (2022-08-20T15:12:44Z) - Ternary Logic Design in Topological Quantum Computing [3.0079490585515343]
A quantum computer can perform exponentially faster than its classical counterpart.
The superposition of a quantum state gets destroyed by the interaction with the environment.
The fault-tolerance is achieved through the topological degrees of freedom of anyons.
arXiv Detail & Related papers (2022-04-03T05:35:59Z) - Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems.
We propose an algorithm to implement imaginary time propagation on a quantum computer.
arXiv Detail & Related papers (2021-02-24T12:48:00Z) - Quantum Gram-Schmidt Processes and Their Application to Efficient State
Read-out for Quantum Algorithms [87.04438831673063]
We present an efficient read-out protocol that yields the classical vector form of the generated state.
Our protocol suits the case that the output state lies in the row space of the input matrix.
One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
arXiv Detail & Related papers (2020-04-14T11:05:26Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.