Anyons obtained from a finite gauge theory have a computational power that depends on the symmetry group. The relationship between group structure and computational power is discussed in this paper. In particular, it is shown that anyons based on finite groups that are solvable but not nilpotent are capable of universal quantum computation. This extends previously published results to groups that are smaller, and therefore more practical. Additionally, a new universal gate-set is built out of an operation called a probabilistic projection, and a quasi-universal leakage correction scheme is discussed.
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 …
Schemes for topological quantum computation are usually based on the assumption that the system is initially prepared in a specific state. In practice, this state preparation is expected to be challenging as it involves non-topological operations which heavily depend on the experimental realization and are not naturally robust against noise. Here we show that this assumption can be relaxed by using composite anyons: starting from an unknown state with reasonable physical properties, it is possible to efficiently distill suitable initial states for computation purely by braiding. This is achiev…
Topological quantum computers promise a fault tolerant means to perform quantum computation. Topological quantum computers use particles with exotic exchange statistics called non-Abelian anyons, and the simplest anyon model which allows for universal quantum computation by particle exchange or braiding alone is the Fibonacci anyon model. One classically hard problem that can be solved efficiently using quantum computation is finding the value of the Jones polynomial of knots at roots of unity. We aim to provide a pedagogical, self-contained, review of topological quantum computation with Fibo…
An obstacle affecting any proposal for a topological quantum computer based on Ising anyons is that quasiparticle braiding can only implement a finite (non-universal) set of quantum operations. The computational power of this restricted set of operations (often called stabilizer operations) has been studied in quantum information theory, and it is known that no quantum-computational advantage can be obtained without the help of an additional non-stabilizer operation. Similarly, a bipartite two-qubit system based on Ising anyons cannot exhibit non-locality (in the sense of violating a Bell ineq…
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 realize a large class of topologically ordered states and simulate their quasiparticle excitations on a digital quantum computer. To achieve this we design a set of linear-depth quantum circuits to generate ground states of general string-net models together with unitary open string operators to simulate the creation and braiding of abelian and non-abelian an…
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 braiding gates for two qubits exhaust the entire two-qubit Clifford group. Analyzing the structure of the Clifford group for n \geq 3 qubits we prove that the the image of the braid group is a non-trivial subgroup of the Clifford group so that not all Clifford gates could be implemented by braiding in the Ising topological quantum computation scheme. We als…
Inspired by non-abelian vortex anyons in spinor Bose-Einstein condensates, we consider the quantum double $\mathcal{D}(Q_8)$ anyon model as a platform to carry out a particular instance of Shor's factorization algorithm. We provide the excitation spectrum, the fusion rules, and the braid group representation for this model, and design a circuit architecture that facilitates the computation. All necessary quantum gates, less one, can be compiled exactly for this hybrid topological quantum computer, and to achieve universality the last operation can be implemented in a non-topological fashion. T…
A two-dimensional quantum system with anyonic excitations can be considered as a quantum computer. Unitary transformations can be performed by moving the excitations around each other. Measurements can be performed by joining excitations in pairs and observing the result of fusion. Such computation is fault-tolerant by its physical nature.
A topological quantum computer should allow intrinsically fault-tolerant quantum computation, but there remains uncertainty about how such a computer can be implemented. It is known that topological quantum computation can be implemented with limited quasiparticle braiding capabilities, in fact using only a single mobile quasiparticle, if the system can be properly initialized by measurements. It is also known that measurements alone suffice without any braiding, provided that the measurement devices can be dynamically created and modified. We study a model in which both measurement and braidi…
We introduce a pentagon equation solver, available as part of SageMath, and use it to construct braid group representations associated to certain anyon systems. We recall the category-theoretic framework for topological quantum computation to explain how these representations describe the sets of logical gates available to an anyonic quantum computer for information processing. In doing so, we avoid venturing deep into topological or conformal quantum field theory. Instead, we present anyons abstractly as sets of labels together with a collection of data satisfying a number of axioms, includin…
A braiding operation defines a real-space renormalization group for anyonic chains. The resulting renormalization group flow can be used to define a quantum scaling limit by operator-algebraic renormalization. It is illustrated how this works for the Ising chain, also known as transverse-field Ising model. In this case, the quantum scaling limit results in the vacuum state of the well-known Ising CFT. Distinguishing between the braiding and its inverse is directly related to the chiral sectors of the Ising CFT. This has direct implications for the simulation of CFTs on topological quantum comp…
Quantum simulation of lattice gauge theories coupled to fermionic matter via anyonic regularization
Center for Computing Research, Sandia National Laboratories（桑迪亚国家实验室计算研究中心）；Center for Quantum Information and Control, University of New Mexico（新墨西哥大学量子信息与控制中心）；Department of Physics and Astronomy, University of New Mexico（新墨西哥大学物理与天文学系）；Quantum Algorithms and Applications Collaboratory, Sandia National Laboratories（桑迪亚国家实验室量子算法与应用协作中心）
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 possible gate sets which can emerge in this setting. As a first step, we prove that for abelian anyons, all gates from these mapping class group representations are normalizer gates. Results of Van den Nest then allow us to conclude that for abelian anyons this quantum computing scheme can be simulated efficiently on a classical computer. With an eye toward mo…
We study fault-tolerant error correction in a quantum memory constructed as a two-dimensional model of Fibonacci anyons on a torus, in the presence of thermal noise represented by pair-creation processes and measurement errors. The correction procedure is based on the cellular automaton decoders originating in the works of Gács and Harrington. Through numerical simulations, we observe that this code behaves fault-tolerantly and that threshold behavior is likely present. Hence, we provide strong evidence for the existence of a fault-tolerant universal non-Abelian topological quantum computer.
We propose a divide-and-conquer method for the quantum-classical hybrid algorithm to solve larger problems with small-scale quantum computers. Specifically, we concatenate a variational quantum eigensolver (VQE) with a reduction in the system dimension, where the interactions between divided subsystems are taken as an effective Hamiltonian expanded by the reduced basis. Then the effective Hamiltonian is further solved by VQE, which we call deep VQE. Deep VQE allows us to apply quantum-classical hybrid algorithms on small-scale quantum computers to large systems with strong intra-subsystem inte…
Quantum simulations of electronic structure with a transformed Hamiltonian that includes some electron correlation effects are demonstrated. The transcorrelated Hamiltonian used in this work is efficiently constructed classically, at polynomial cost, by an approximate similarity transformation with an explicitly correlated two-body unitary operator. This Hamiltonian is Hermitian, includes no more than two-particle interactions, and is free of electron-electron singularities. We investigate the effect of such a transformed Hamiltonian on the accuracy and computational cost of quantum simulation…
Symmetrization of topologically ordered wavefunctions is a powerful method for constructing new topological models. Here, we study wavefunctions obtained by symmetrizing quantum double models of a group $G$ in the Projected Entangled Pair States (PEPS) formalism. We show that symmetrization naturally gives rise to a larger symmetry group $\tilde G$ which is always non-abelian. We prove that by symmetrizing on sufficiently large blocks, one can always construct wavefunctions in the same phase as the double model of $\tilde G$. In order to understand the effect of symmetrization on smaller patch…
Simulation of a Battery Cell on Quantum Computers: Reactions & Transport
Institute of Engineering Thermodynamics, German Aerospace Center (DLR)（德国航空航天中心工程热力学研究所）；Helmholtz Institute Ulm（乌尔姆亥姆霍兹研究所）；Department of Physics, Ulm University（乌尔姆大学物理系）
