Realizing string-net condensation: Fibonacci anyon braiding for universal gates and sampling chromatic polynomials

Abstract

The remarkable complexity of the vacuum state of a topologically-ordered many-body quantum system encodes the character and intricate braiding interactions of its emergent particles, the anyons.} Quintessential predictions exploiting this complexity use the Fibonacci string-net condensate (Fib-SNC) and its Fibonacci anyons to go beyond classical computing. Sampling the Fib-SNC wavefunction is expected to yield estimates of the chromatic polynomial of graph objects, a classical task that is provably hard. At the same time, exchanging anyons of Fib-SNC is expected to allow fault-tolerant universal quantum computation. Nevertheless, the physical realization of Fib-SNC and its anyons remains elusive. Here, we introduce a scalable dynamical string-net preparation (DSNP) approach, suitable even for near-term quantum processors, which dynamically prepares Fib-SNC and its anyons through reconfigurable graphs. Using a superconducting quantum processor, we couple the DSNP approach with composite error-mitigation on deep circuits to successfully create, measure, and braid anyons of Fib-SNC in a scalable manner. We certify the creation of anyons by measuring their `anyon charge', finding an average experimental accuracy of $94\%$. Furthermore, we validate that exchanging these anyons yields the { expected} golden ratio~$\varphi$ with~$98\%$ average accuracy and~$8\%$ measurement uncertainty. Finally, we sample the Fib-SNC to estimate the chromatic polynomial at~$\varphi +2$ for {several} graphs. Our results establish the proof of principle for using Fib-SNC and its anyons for fault-tolerant universal quantum computation and {for aiming at} a classically-hard problem.

4 pages and 4 figures with Supplemental Materials (49 pages, 20 Figures)

References in corpus (22)

• Non-Abelian Anyons and Topological Quantum Computation
• String-net condensation: A physical mechanism for topological phases
• Error mitigation for short-depth quantum circuits
• Characterizing Quantum Supremacy in Near-Term Devices
• Probing Topological Spin Liquids on a Programmable Quantum Simulator
• Lieb-Robinson bounds and the generation of correlations and topological quantum order
• Quantum Error Mitigation
• Braid Topologies for Quantum Computation
• Non-Abelian Topological Order and Anyons on a Trapped-Ion Processor
• Model-free readout-error mitigation for quantum expectation values
• Photons and electrons as emergent phenomena
• Quantum computation with Turaev-Viro codes
• Interferometry of non-Abelian Anyons
• Digital simulation of non-Abelian anyons with 68 programmable superconducting qubits
• Realizing non-Abelian statistics
• Inapproximability of the Tutte polynomial
• Methods for simulating string-net states and anyons on a digital quantum computer
• Fault-Tolerant Postselected Quantum Computation: Threshold Analysis
• Non-Abelian braiding of Fibonacci anyons with a superconducting processor
• Inapproximability of the Tutte polynomial of a planar graph
• Tutte chromatic identities from the Temperley-Lieb algebra
• Graph gauge theory of mobile non-Abelian anyons in a qubit stabilizer code

Cited by in corpus (7)

• Protocols for Creating Anyons and Defects via Gauging
• Digital Quantum Simulation of the Kitaev Quantum Spin Liquid
• Intrinsic Heralding and Optimal Decoders for Non-Abelian Topological Order
• Simulating Topological Order on Quantum Processors
• Universal Gates from Braiding and Fusing Anyons on Quantum Hardware
• Universal fault tolerant quantum computation in 2D without getting tied in knots
• Utility-Scale Quantum State Preparation: Classical Training using Pauli Path Simulation