Non-Abelian braiding of Fibonacci anyons with a superconducting processor

• URL: http://arxiv.org/abs/2404.00091v1
• Date: Fri, 29 Mar 2024 18:00:01 GMT
• Title: Non-Abelian braiding of Fibonacci anyons with a superconducting processor
• Authors: Shibo Xu, Zheng-Zhi Sun, Ke Wang, Hekang Li, Zitian Zhu, Hang Dong, Jinfeng Deng, Xu Zhang, Jiachen Chen, Yaozu Wu, Chuanyu Zhang, Feitong Jin, Xuhao Zhu, Yu Gao, Aosai Zhang, Ning Wang, Yiren Zou, Ziqi Tan, Fanhao Shen, Jiarun Zhong, Zehang Bao, Weikang Li, Wenjie Jiang, Li-Wei Yu, Zixuan Song, Pengfei Zhang, Liang Xiang, Qiujiang Guo, Zhen Wang, Chao Song, H. Wang, Dong-Ling Deng,
• Abstract summary: We report the realization of non-Abelian topologically ordered states of the Fibonacci string-net model. We demonstrate braidings of Fibonacci anyons featuring universal computational power. Our results establish a versatile digital approach to exploring exotic non-Abelian topological states.
• Score: 15.68967425584753
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Non-Abelian topological orders offer an intriguing path towards fault-tolerant quantum computation, where information can be encoded and manipulated in a topologically protected manner immune to arbitrary local noises and perturbations. However, realizing non-Abelian topologically ordered states is notoriously challenging in both condensed matter and programmable quantum systems, and it was not until recently that signatures of non-Abelian statistics were observed through digital quantum simulation approaches. Despite these exciting progresses, none of them has demonstrated the appropriate type of topological orders and associated non-Abelian anyons whose braidings alone support universal quantum computation. Here, we report the realization of non-Abelian topologically ordered states of the Fibonacci string-net model and demonstrate braidings of Fibonacci anyons featuring universal computational power, with a superconducting quantum processor. We exploit efficient quantum circuits to prepare the desired states and verify their nontrivial topological nature by measuring the topological entanglement entropy. In addition, we create two pairs of Fibonacci anyons and demonstrate their fusion rule and non-Abelian braiding statistics by applying unitary gates on the underlying physical qubits. Our results establish a versatile digital approach to exploring exotic non-Abelian topological states and their associated braiding statistics with current noisy intermediate-scale quantum processors.

Related papers

• Efficient Quantum Pseudorandomness from Hamiltonian Phase States [41.94295877935867]
  We introduce a quantum hardness assumption called the Hamiltonian Phase State (HPS) problem. We show that our assumption is plausibly fully quantum; meaning, it cannot be used to construct one-way functions. We show that our assumption and its variants allow us to efficiently construct many pseudorandom quantum primitives.
  arXiv  Detail & Related papers  (2024-10-10T16:10:10Z)
• Diagonal Coset Approach to Topological Quantum Computation with Fibonacci Anyons [0.0]
  We investigate a promising conformal field theory realization scheme for topological quantum computation based on the Fibonacci anyons. The quantum gates are realized by braiding of these anyons.
  arXiv  Detail & Related papers  (2024-04-02T09:44:02Z)
• Non-adiabatic holonomies as photonic quantum gates [36.136619420474766]
  We present the quantum-optical realization of non-adiabatic holonomies that can be used as single-qubit quantum gates. The inherent non-adiabaticity of the structures paves the way for unprecedented miniaturization.
  arXiv  Detail & Related papers  (2024-01-08T16:44:45Z)
• Non-Abelian Topological Order and Anyons on a Trapped-Ion Processor [0.0]
  Non-Abelian topological order (TO) is a coveted state of matter with remarkable properties. We present the first unambiguous realization of non-Abelian TO and demonstrate control of its anyons.
  arXiv  Detail & Related papers  (2023-05-05T18:01:05Z)
• General quantum algorithms for Hamiltonian simulation with applications to a non-Abelian lattice gauge theory [44.99833362998488]
  We introduce quantum algorithms that can efficiently simulate certain classes of interactions consisting of correlated changes in multiple quantum numbers. The lattice gauge theory studied is the SU(2) gauge theory in 1+1 dimensions coupled to one flavor of staggered fermions. The algorithms are shown to be applicable to higher-dimensional theories as well as to other Abelian and non-Abelian gauge theories.
  arXiv  Detail & Related papers  (2022-12-28T18:56:25Z)
• Digital simulation of non-Abelian anyons with 68 programmable superconducting qubits [15.75710727890576]
  Non-Abelian anyons are exotic quasiparticle excitations hosted by certain topological phases of matter. We report an experimental quantum digital simulation of projective non-Abelian anyons and their braiding statistics.
  arXiv  Detail & Related papers  (2022-11-17T18:59:10Z)
• 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)
• Complexity-Theoretic Limitations on Quantum Algorithms for Topological Data Analysis [59.545114016224254]
  Quantum algorithms for topological data analysis seem to provide an exponential advantage over the best classical approach. We show that the central task of TDA -- estimating Betti numbers -- is intractable even for quantum computers. We argue that an exponential quantum advantage can be recovered if the input data is given as a specification of simplices.
  arXiv  Detail & Related papers  (2022-09-28T17:53:25Z)
• Methods for simulating string-net states and anyons on a digital quantum computer [2.119778346188635]
  We show how to realize a large class of topologically ordered states and simulate their quasiparticle excitations on a digital quantum computer. We show that the abelian (non-abelian) unitary string operators can be implemented with a constant (linear) depth quantum circuit. This set of efficiently prepared topologically ordered states has potential applications in the development of fault-tolerant quantum computers.
  arXiv  Detail & Related papers  (2021-10-05T13:09:51Z)
• Probing Topological Spin Liquids on a Programmable Quantum Simulator [40.96261204117952]
  We use a 219-atom programmable quantum simulator to probe quantum spin liquid states. In our approach, arrays of atoms are placed on the links of a kagome lattice and evolution under Rydberg blockade creates frustrated quantum states. The onset of a quantum spin liquid phase of the paradigmatic toric code type is detected by evaluating topological string operators.
  arXiv  Detail & Related papers  (2021-04-09T00:18:12Z)

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.