scholarly journals Optimizing Clifford gate generation for measurement-only topological quantum computation with Majorana zero modes

2020 ◽  
Vol 8 (6) ◽  
Author(s):  
Alan Tran ◽  
Alex Bocharov ◽  
Bela Bauer ◽  
Parsa Bonderson

One of the main challenges for quantum computation is that while the number of gates required to perform a non-trivial quantum computation may be very large, decoherence and errors in realistic quantum architectures limit the number of physical gate operations that can be performed coherently. Therefore, an optimal mapping of the quantum algorithm into the physically available set of operations is of crucial importance. We examine this problem for a measurement-only topological quantum computer based on Majorana zero modes, where gates are performed through sequences of measurements. Such a scheme has been proposed as a practical, scalable approach to process quantum information in an array of topological qubits built using Majorana zero modes. Building on previous work that has shown that multi-qubit Clifford gates can be enacted in a topologically protected fashion in such qubit networks, we discuss methods to obtain the optimal measurement sequence for a given Clifford gate under the constraints imposed by the physical architecture, such as layout and the relative difficulty of implementing different types of measurements. Our methods also provide tools for comparative analysis of different architectures and strategies, given experimental characterizations of particular aspects of the systems under consideration. As a further non-trivial demonstration, we discuss an implementation of the surface code in Majorana-based topological qubits. We use the techniques developed here to obtain an optimized measurement sequence that implements the stabilizer measurements using only fermionic parity measurements on nearest-neighbor topological qubit islands.

2012 ◽  
Vol 12 (9&10) ◽  
pp. 876-892
Author(s):  
Ben W. Reichardt

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 braiding capabilities are limited. Given the ability to pull nontrivial Fibonacci anyon pairs from the vacuum with a certain success probability, we show how to simulate universal quantum computation by braiding one quasiparticle and with only one measurement, to read out the result. The difficulty lies in initializing the system. We give a systematic construction of a family of braid sequences that initialize to arbitrary accuracy nontrivial composite anyons. Instead of using the Solovay-Kitaev theorem, the sequences are based on a quantum algorithm for convergent search.


2021 ◽  
Vol 12 (1) ◽  
Author(s):  
Lingyuan Kong ◽  
Lu Cao ◽  
Shiyu Zhu ◽  
Michał Papaj ◽  
Guangyang Dai ◽  
...  

AbstractThe iron-based superconductor is emerging as a promising platform for Majorana zero mode, which can be used to implement topological quantum computation. One of the most significant advances of this platform is the appearance of large vortex level spacing that strongly protects Majorana zero mode from other low-lying quasiparticles. Despite the advantages in the context of physics research, the inhomogeneity of various aspects hampers the practical construction of topological qubits in the compounds studied so far. Here we show that the stoichiometric superconductor LiFeAs is a good candidate to overcome this obstacle. By using scanning tunneling microscopy, we discover that the Majorana zero modes, which are absent on the natural clean surface, can appear in vortices influenced by native impurities. Our detailed analysis reveals a new mechanism for the emergence of those Majorana zero modes, i.e. native tuning of bulk Dirac fermions. The discovery of Majorana zero modes in this homogeneous material, with a promise of tunability, offers an ideal material platform for manipulating and braiding Majorana zero modes, pushing one step forward towards topological quantum computation.


2007 ◽  
Vol 05 (01n02) ◽  
pp. 223-228 ◽  
Author(s):  
ANNALISA MARZUOLI ◽  
MARIO RASETTI

We resort to considerations based on topological quantum field theory to outline the development of a possible quantum algorithm for the evaluation of the permanent of a 0 - 1 matrix. Such an algorithm might represent a breakthrough for quantum computation, since computing the permanent is considered a "universal problem", namely, one among the hardest problems that a quantum computer can efficiently handle.


2003 ◽  
Vol 01 (01) ◽  
pp. 1-23 ◽  
Author(s):  
VLATKO VEDRAL

In the first part of this review we introduce the basics theory behind geometric phases and emphasize their importance in quantum theory. The subject is presented in a general way so as to illustrate its wide applicability, but we also introduce a number of examples that will help the reader understand the basic issues involved. In the second part we show how to perform a universal quantum computation using only geometric effects appearing in quantum phases. It is then finally discussed how this geometric way of performing quantum gates can lead to a stable, large scale, intrinsically fault-tolerant quantum computer.


2017 ◽  
Vol 95 (23) ◽  
Author(s):  
Torsten Karzig ◽  
Christina Knapp ◽  
Roman M. Lutchyn ◽  
Parsa Bonderson ◽  
Matthew B. Hastings ◽  
...  

2017 ◽  
Vol 3 (3) ◽  
Author(s):  
Ville Lahtinen ◽  
Jiannis Pachos

This review presents an entry-level introduction to topological quantum computation -- quantum computing with anyons. We introduce anyons at the system-independent level of anyon models and discuss the key concepts of protected fusion spaces and statistical quantum evolutions for encoding and processing quantum information. Both the encoding and the processing are inherently resilient against errors due to their topological nature, thus promising to overcome one of the main obstacles for the realisation of quantum computers. We outline the general steps of topological quantum computation, as well as discuss various challenges faced by it. We also review the literature on condensed matter systems where anyons can emerge. Finally, the appearance of anyons and employing them for quantum computation is demonstrated in the context of a simple microscopic model -- the topological superconducting nanowire -- that describes the low-energy physics of several experimentally relevant settings. This model supports localised Majorana zero modes that are the simplest and the experimentally most tractable types of anyons that are needed to perform topological quantum computation.


Author(s):  
Sergey Ulyanov ◽  
Andrey Reshetnikov ◽  
Olga Tyatyushkina ◽  
Vladimir Korenkov

All the quantum algorithms are based on a certain quantum computing model, varying from the quantum circuit, one-way quantum computation, adiabatic quantum computation and topological quantum computation. These four models are equivalent in computational power; among them, the quantum circuit model is most frequently used. In the circuit model, it has been proved that arbitrary single-qubit rotations plus twoqubit controlled-NOT gates are universal, i.e. they can provide a set of gates to implement any quantum algorithm. This article discusses the goal for this research: it is to given a lightning-fast (as-barebones-as-possible) definition of the quantum circuit model computing and leisurely development of quantum computation before actually getting around to sophisticated algorithms. In this article the main ideas of quantum software engineering is described.


2016 ◽  
Vol 30 (27) ◽  
pp. 1650213
Author(s):  
Qiu-Bo Cheng ◽  
Jing He ◽  
Jing Yu ◽  
Xiao-Ming Zhao ◽  
Su-Peng Kou

Recently, Majorana fermions (MFs) have attracted intensive attention due to their exotic statistics and possible applications in topological quantum computation. They are proposed to exist in various two-dimensional (2D) topological systems, such as [Formula: see text] topological superconductor (SC) and nanowire–superconducting hybridization system. In this paper, we point out that Majorana fermions in different topological systems obey different types of polygon sign rules. A numerical approach is described to identify the type of polygon sign rule of the Majorana fermions. Applying the approach to study two 2D topological systems, we find that vortex-induced Majorana fermions obey topological polygon sign rule and line-defect-induced Majorana fermions obey normal polygon sign rule.


2020 ◽  
Vol 17 (2 Jul-Dec) ◽  
pp. 115
Author(s):  
R. Romero

This is a pedagogical paper, where bispinors solutions to the four-dimensional massless Dirac equation are considered in relativistic quantum mechanics and in quantum computation, taking advantage of the common mathematical description of four-dimensional spaces. First, Weyl and massless Majorana bispinors are shown to be unitary equivalent, closing a gap in the literature regarding their equivalence. A discrepancy in the number of linearly independent solutions reported in the literature is also addressed. Then, it is shown that Weyl bispinors are algebraically equivalent to two-qubit direct product states, and that the massless Majorana bispinors are algebraically equivalent to maximally entangled sates (Bell states), with the transformations relating the two bispinors types acting as entangling gates in quantum computation. Different types of entangling gates are presented, highlighting a set that fulfills the required properties for Majorana zero mode operators in topological quantum computation. Based on this set, a general topological quantum computation model with four Majorana operators is presented, which exhibits all the required technical and physical properties to obtain entanglement of two logical qubits from tpological operations.


Sign in / Sign up

Export Citation Format

Share Document