Fibonacci anyons versus Majorana fermions

• URL: http://arxiv.org/abs/2008.10790v1
• Date: Tue, 25 Aug 2020 02:44:17 GMT
• Title: Fibonacci anyons versus Majorana fermions
• Authors: Emil G\'enetay Johansen, Tapio Simula
• Abstract summary: We compare the Ising ($k=2$) anyon and Fibonacci ($k=3$) anyon models, motivated by their potential for future realizations based on Majorana fermion quasiparticles or exotic fractional quantum-Hall states. We find that for reasonable levels of decoherence, even the hybrid Ising anyon model retains a significant topological advantage over a conventional, non-topological, quantum computer.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We have studied ${\rm SU}(2)_k$ anyon models, assessing their prospects for topological quantum computation. In particular, we have compared the Ising ($k=2$) anyon and Fibonacci ($k=3$) anyon models, motivated by their potential for future realizations based on Majorana fermion quasiparticles or exotic fractional quantum-Hall states, respectively. The quantum computational performance of the different anyon models is quantified at single qubit level by the difference between a target unitary operator and its approximation realised by anyon braiding. To facilitate efficient comparisons, we have developed a Monte Carlo enhanced Solovay-Kitaev quantum compiler algorithm that finds optimal braid words in polynomial time from the exponentially large search tree. Since universal quantum computation cannot be achieved within the Ising anyon model by braiding alone, we have introduced an additional elementary phase gate to model a non-topological measurement process, which restores universality of the anyon model at the cost of breaking the full topological protection. We model conventional kinds of decoherence processes algorithmically by introducing a controllable noise term to all non-topological gate operations. We find that for reasonable levels of decoherence, even the hybrid Ising anyon model retains a significant topological advantage over a conventional, non-topological, quantum computer. Furthermore, we find that only surprisingly short anyon braids are ever required to be compiled due to the gate noise exceeding the intrinsic error of the braid words already for word lengths of the order of $100$ elementary braids. We conclude that the future for hybrid topological quantum computation remains promising.

Related papers

• First-Order Phase Transition of the Schwinger Model with a Quantum Computer [0.0]
  We explore the first-order phase transition in the lattice Schwinger model in the presence of a topological $theta$-term. We show that the electric field density and particle number, observables which reveal the phase structure of the model, can be reliably obtained from the quantum hardware.
  arXiv  Detail & Related papers  (2023-12-20T08:27:49Z)
• Many-body Majorana braiding without an exponential Hilbert space [0.0]
  Qubits built out of Majorana zero modes (MZMs) constitute the primary path towards topologically protected quantum computing. Simulating the braiding process of multiple MZMs corresponds to the quantum dynamics of a superconducting many-body system. We present a method to calculate arbitrary many-body wavefunctions as well as their expectation values, correlators and overlaps from time evolved single-particle states of a superconductor.
  arXiv  Detail & Related papers  (2023-03-01T19:00:01Z)
• 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)
• Neural network enhanced measurement efficiency for molecular groundstates [63.36515347329037]
  We adapt common neural network models to learn complex groundstate wavefunctions for several molecular qubit Hamiltonians. We find that using a neural network model provides a robust improvement over using single-copy measurement outcomes alone to reconstruct observables.
  arXiv  Detail & Related papers  (2022-06-30T17:45:05Z)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• Generalization Metrics for Practical Quantum Advantage in Generative Models [68.8204255655161]
  Generative modeling is a widely accepted natural use case for quantum computers. We construct a simple and unambiguous approach to probe practical quantum advantage for generative modeling by measuring the algorithm's generalization performance. Our simulation results show that our quantum-inspired models have up to a $68 times$ enhancement in generating unseen unique and valid samples.
  arXiv  Detail & Related papers  (2022-01-21T16:35:35Z)
• Average-case Speedup for Product Formulas [69.68937033275746]
  Product formulas, or Trotterization, are the oldest and still remain an appealing method to simulate quantum systems. We prove that the Trotter error exhibits a qualitatively better scaling for the vast majority of input states. Our results open doors to the study of quantum algorithms in the average case.
  arXiv  Detail & Related papers  (2021-11-09T18:49:48Z)
• Provably accurate simulation of gauge theories and bosonic systems [2.406160895492247]
  We develop methods for bounding the rate of growth of local quantum numbers. For the Hubbard-Holstein model, we compute a bound on $Lambda$ that achieves accuracy $epsilon$. We also establish a criterion for truncating the Hamiltonian with a provable guarantee on the accuracy of time evolution.
  arXiv  Detail & Related papers  (2021-10-13T18:00:02Z)
• Prime number factorization using a spinor Bose-Einstein condensate inspired topological quantum computer [0.0]
  We consider the quantum double $mathcalD(Q_8)$ anyon model as a platform to carry out a particular instance of Shor's factorization algorithm. All necessary quantum gates, less one, can be compiled exactly for this hybrid topological quantum computer.
  arXiv  Detail & Related papers  (2021-05-12T06:06:19Z)
• Compiling single-qubit braiding gate for Fibonacci anyons topological quantum computation [0.0]
  Topological quantum computation is an implementation of a quantum computer in a way that radically reduces decoherence. Topological qubits are encoded in the topological evolution of two-dimensional quasi-particles called anyons.
  arXiv  Detail & Related papers  (2020-08-08T15:34:03Z)
• Variational Monte Carlo calculations of $\mathbf{A\leq 4}$ nuclei with an artificial neural-network correlator ansatz [62.997667081978825]
  We introduce a neural-network quantum state ansatz to model the ground-state wave function of light nuclei. We compute the binding energies and point-nucleon densities of $Aleq 4$ nuclei as emerging from a leading-order pionless effective field theory Hamiltonian.
  arXiv  Detail & Related papers  (2020-07-28T14:52:28Z)

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.