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

• URL: http://arxiv.org/abs/2110.02020v4
• Date: Mon, 24 Oct 2022 23:16:08 GMT
• Title: Methods for simulating string-net states and anyons on a digital quantum computer
• Authors: Yu-Jie Liu, Kirill Shtengel, Adam Smith and Frank Pollmann
• Abstract summary: 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.
• Score: 2.119778346188635
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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 anyons. We show that the abelian (non-abelian) unitary string operators can be implemented with a constant (linear) depth quantum circuit. Our scheme allows us to directly probe characteristic topological properties, including topological entanglement entropy, braiding statistics, and fusion channels of anyons. Moreover, this set of efficiently prepared topologically ordered states has potential applications in the development of fault-tolerant quantum computers.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Thermalization and Criticality on an Analog-Digital Quantum Simulator [133.58336306417294]
  We present a quantum simulator comprising 69 superconducting qubits which supports both universal quantum gates and high-fidelity analog evolution. We observe signatures of the classical Kosterlitz-Thouless phase transition, as well as strong deviations from Kibble-Zurek scaling predictions. We digitally prepare the system in pairwise-entangled dimer states and image the transport of energy and vorticity during thermalization.
  arXiv  Detail & Related papers  (2024-05-27T17:40:39Z)
• Non-Abelian braiding of Fibonacci anyons with a superconducting processor [15.68967425584753]
  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.
  arXiv  Detail & Related papers  (2024-03-29T18:00:01Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Topological Order from Measurements and Feed-Forward on a Trapped Ion Quantum Computer [0.0]
  We show for the first time a constant-depth procedure for creating a toric code ground state in real-time. We create a non-Abelian defect whose presence is confirmed by transmuting anyons via braiding. This work clears the way towards creating complex topological orders in the lab.
  arXiv  Detail & Related papers  (2023-02-03T18:50:57Z)
• 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)
• Probing finite-temperature observables in quantum simulators of spin systems with short-time dynamics [62.997667081978825]
  We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality. We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
  arXiv  Detail & Related papers  (2022-06-03T18:00:02Z)
• 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)
• The Hintons in your Neural Network: a Quantum Field Theory View of Deep Learning [84.33745072274942]
  We show how to represent linear and non-linear layers as unitary quantum gates, and interpret the fundamental excitations of the quantum model as particles. On top of opening a new perspective and techniques for studying neural networks, the quantum formulation is well suited for optical quantum computing.
  arXiv  Detail & Related papers  (2021-03-08T17:24:29Z)
• Reconfigurable Network for Quantum Transport Simulation [0.0]
  We show the first simulation of the exciton dynamics in the B800 ring of the purple bacteria LH2 complex. We implement the Su-Schrieffer-Heeger model to directly observe the emergence of topologically-protected one-dimensional edge states.
  arXiv  Detail & Related papers  (2020-08-13T19:03:20Z)
• Digital Simulation of Topological Matter on Programmable Quantum Processors [0.0]
  We propose and demonstrate an approach to design topologically protected quantum circuits on the current generation of noisy quantum processors. In particular, a low-depth topological quantum circuit is performed on both IBM and Rigetti quantum processors.
  arXiv  Detail & Related papers  (2020-03-13T02:32:48Z)

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.