ID: 1310.4150

Asymptotically Optimal Topological Quantum Compiling

October 15, 2013

View on ArXiv

Similar papers 4

How quickly can anyons be braided? Or: How I learned to stop worrying about diabatic errors and love the anyon

January 21, 2016

85% Match
Christina Knapp, Michael Zaletel, Dong E. Liu, Meng Cheng, ... , Nayak Chetan
Mesoscale and Nanoscale Phys...
Strongly Correlated Electron...

Topological phases of matter are a potential platform for the storage and processing of quantum information with intrinsic error rates that decrease exponentially with inverse temperature and with the length scales of the system, such as the distance between quasiparticles. However, it is less well-understood how error rates depend on the speed with which non-Abelian quasiparticles are braided. In general, diabatic corrections to the holonomy or Berry's matrix vanish at least...

Find SimilarView on arXiv

Topological Quantum Programming in TED-K

September 17, 2022

85% Match
Hisham Sati, Urs Schreiber
Algebraic Topology

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 strategies into dedicated topological quantum programming languages has not yet received attention. Here we describe a fundamental and natural scheme that we are developing, for typed functional (hence verifiable) topological quantum progr...

Find SimilarView on arXiv

Universal Quantum Computation with the nu=5/2 Fractional Quantum Hall State

November 17, 2005

85% Match
Sergey Bravyi
Quantum Physics

We consider topological quantum computation (TQC) with a particular class of anyons that are believed to exist in the Fractional Quantum Hall Effect state at Landau level filling fraction nu=5/2. Since the braid group representation describing statistics of these anyons is not computationally universal, one cannot directly apply the standard TQC technique. We propose to use very noisy non-topological operations such as direct short-range interaction between anyons to simulate...

Find SimilarView on arXiv

A probabilistic evolutionary optimization approach to compute quasiparticle braids

October 2, 2014

85% Match
Roberto Santana, Ross B. McDonald, Helmut G. Katzgraber
Neural and Evolutionary Comp...

Topological quantum computing is an alternative framework for avoiding the quantum decoherence problem in quantum computation. The problem of executing a gate in this framework can be posed as the problem of braiding quasiparticles. Because these are not Abelian, the problem can be reduced to finding an optimal product of braid generators where the optimality is defined in terms of the gate approximation and the braid's length. In this paper we propose the use of different va...

Find SimilarView on arXiv

Instantaneous braids and Dehn twists in topologically ordered states

June 15, 2018

84% Match
Guanyu Zhu, Ali Lavasani, Maissam Barkeshli
Strongly Correlated Electron...
Mathematical Physics
Quantum Algebra

A defining feature of topologically ordered states of matter is the existence of locally indistinguishable states on spaces with non-trivial topology. These degenerate states form a representation of the mapping class group (MCG) of the space, which is generated by braids of defects or anyons, and by Dehn twists along non-contractible cycles. These operations can be viewed as fault-tolerant logical gates in the context of topological quantum error correcting codes and topolog...

Find SimilarView on arXiv

Topological Quantum Computing with Read-Rezayi States

March 12, 2009

84% Match
L. Hormozi, N. E. Bonesteel, S. H. Simon
Mesoscale and Nanoscale Phys...

Read-Rezayi fractional quantum Hall states are among the prime candidates for realizing non-Abelian anyons which in principle can be used for topological quantum computation. We present a prescription for efficiently finding braids which can be used to carry out a universal set of quantum gates on encoded qubits based on anyons of the Read-Rezayi states with $k>2$, $k\neq4$. This work extends previous results which only applied to the case $k = 3$ (Fibonacci) and clarifies wh...

Find SimilarView on arXiv

Local unitary representations of the braid group and their applications to quantum computing

April 21, 2016

84% Match
Colleen Delaney, Eric C. Rowell, Zhenghan Wang
Quantum Algebra

We provide an elementary introduction to topological quantum computation based on the Jones representation of the braid group. We first cover the Burau representation and Alexander polynomial. Then we discuss the Jones representation and Jones polynomial and their application to anyonic quantum computation. Finally we outline the approximation of the Jones polynomial and explicit localizations of braid group representations.

Find SimilarView on arXiv

On Topological Quantum Computing With Mapping Class Group Representations

May 12, 2018

84% Match
Wade Bloomquist, Zhenghan Wang
Quantum Algebra

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 ...

Find SimilarView on arXiv

The Fibonacci Model and the Temperley-Lieb Algebra

April 28, 2008

84% Match
Louis H. Kauffman, Samuel J. Jr Lomonaco,
Quantum Physics

We give an elementary construction of the Fibonacci model, a unitary braid group representation that is universal for quantum computation. This paper is dedicated to Professor C. N. Yang, on his 85-th birthday.

Find SimilarView on arXiv

Methods for simulating string-net states and anyons on a digital quantum computer

October 5, 2021

84% Match
Yu-Jie Liu, Kirill Shtengel, ... , Pollmann Frank
Strongly Correlated Electron...

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-ne...

Find SimilarView on arXiv