Consistent Simulation of Fibonacci Anyon Braiding within a Qubit Quasicrystal Inflation Code

• URL: http://arxiv.org/abs/2506.21643v1
• Date: Wed, 25 Jun 2025 22:33:35 GMT
• Title: Consistent Simulation of Fibonacci Anyon Braiding within a Qubit Quasicrystal Inflation Code
• Authors: Marcelo M. Amaral,
• Abstract summary: Non-Abelian anyon braiding is a critical step towards fault-tolerant quantum computation.<n>We introduce a framework for this task based on a one-dimensional Quasicrystal Inflation Code (QIC)<n>We numerically confirm for systems up to 17 qubits that our construction rigorously satisfies the required Temperley-Lieb and braid group relations.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: The simulation of non-Abelian anyon braiding is a critical step towards fault-tolerant quantum computation. We introduce a framework for this task based on a one-dimensional Quasicrystal Inflation Code (QIC). The code is defined by a local Hamiltonian whose ground state manifold enforces Fibonacci tiling constraints and possesses the correct Fibonacci degeneracy. We derive the corresponding braid operators and demonstrate that, while they are formally non-local, they possess an exact, local 3-qubit structure. This allows us to distill their action into a single, physically realizable $8 \times 8$ gate, which we term the $B_{gate}$. We prove through comparative compilation for systems with different numbers of qubits that constructing circuits by composing these local gates is dramatically more scalable than compiling the equivalent global unitary, showing a greater than tenfold reduction in circuit depth. To validate the framework, we successfully executed a braiding algorithm for the Jones polynomial, a topological invariant of knots, on an IBM Quantum processor, quantifying the signal degradation due to hardware noise. Finally, we numerically confirm for systems up to 17 qubits that our construction rigorously satisfies the required Temperley-Lieb and braid group relations while preserving the code subspace. This work establishes a validated and physically grounded pathway for the scalable simulation of anyonic braiding on programmable quantum systems.

Related papers

• Scalable modular architecture for universal quantum computation [49.1574468325115]
  We show that it is sufficient to connect two qubit arrays that are evolution operator controllable by a single entangling two-qubit gate.<n>Our proof provides a template to build up modular QPUs from smaller building blocks with reduced numbers of local controls and couplings.
  arXiv  Detail & Related papers  (2025-07-19T16:45:47Z)
• Fermion-qubit fault-tolerant quantum computing [39.58317527488534]
  We introduce fermion-qubit fault-tolerant quantum computing, a framework which removes this overhead altogether. We show how our framework can be implemented in neutral atoms, overcoming the apparent inability of neutral atoms to implement non-number-conserving gates. Our framework opens the door to fermion-qubit fault-tolerant quantum computation in platforms with native fermions.
  arXiv  Detail & Related papers  (2024-11-13T19:00:02Z)
• Linear Circuit Synthesis using Weighted Steiner Trees [45.11082946405984]
  CNOT circuits are a common building block of general quantum circuits. This article presents state-of-the-art algorithms for optimizing the number of CNOT gates. A simulated evaluation shows that the suggested is almost always beneficial and reduces the number of CNOT gates by up to 10%.
  arXiv  Detail & Related papers  (2024-08-07T19:51:22Z)
• Fault-tolerant compiling of classically hard IQP circuits on hypercubes [34.225996865725605]
  We develop a hardware-efficient, fault-tolerant approach to realizing quantum sampling circuits.<n>We develop a theory of second-moment properties of degree-$D$ IQP circuits for analyzing hardness and verification of random sampling.<n>Our results highlight fault-tolerant compiling as a powerful tool in co-configurable algorithms with specific error-correcting codes and realistic hardware.
  arXiv  Detail & Related papers  (2024-04-29T18:00:03Z)
• 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)
• Error-corrected Hadamard gate simulated at the circuit level [42.002147097239444]
  We simulate the logical Hadamard gate in the surface code under a circuit-level noise model. Our paper is the first to do this for a unitary gate on a quantum error-correction code.
  arXiv  Detail & Related papers  (2023-12-18T19:00:00Z)
• Dyck Paths and Topological Quantum Computation [1.3958149444453791]
  We show a mapping between the fusion basis of three Fibonacci anyons, $|1rangle, |taurangle$, and the two length 4 Dyck paths. We also show braidwords in this rotated space that efficiently enable the execution of any desired single-qubit operation.
  arXiv  Detail & Related papers  (2023-06-28T09:52:08Z)
• Experimental realization of a topologically protected Hadamard gate via braiding Fibonacci anyons [9.16714038195341]
  Topological quantum computation (TQC) is one of the most striking architectures that can realize fault-tolerant quantum computers. In TQC, the logical space and the quantum gates are topologically protected, i.e., robust against local disturbances. We propose a disk model that can realize the Fibonacci anyon system, and construct the topologically protected logical spaces with the Fibonacci anyons.
  arXiv  Detail & Related papers  (2022-10-21T17:55:45Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Investigating the Exchange of Ising Chains on a Digital Quantum Computer [0.0]
  We study a a braiding-like exchange operation through the movement of the state in the qubit subspace. The system consists of two Ising chains in a 1D geometry where the operation is simulated through the adiabatic time evolution of the ground state. Various aspects of the implementation including the circuit depth, Trotterization error, and quantum gate errors pertaining to the Noisy Intermediate-Scale Quantum (NISQ) hardware are discussed as well.
  arXiv  Detail & Related papers  (2021-03-09T15:50:41Z)
• Building a fault-tolerant quantum computer using concatenated cat codes [44.03171880260564]
  We present a proposed fault-tolerant quantum computer based on cat codes with outer quantum error-correcting codes. We numerically simulate quantum error correction when the outer code is either a repetition code or a thin rectangular surface code. We find that with around 1,000 superconducting circuit components, one could construct a fault-tolerant quantum computer.
  arXiv  Detail & Related papers  (2020-12-07T23:22:40Z)
• 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)
• Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
  We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
  arXiv  Detail & Related papers  (2020-04-15T05:16:24Z)
• Hartree-Fock on a superconducting qubit quantum computer [30.152226344347064]
  Here, we perform a series of quantum simulations of chemistry the largest of which involved a dozen qubits, 78 two-qubit gates, and 114 one-qubit gates. We model the binding energy of $rm H_6$, $rm H_8$, $rm H_10$ and $rm H_12$ chains as well as the isomerization of diazene. We also demonstrate error-mitigation strategies based on $N$-representability which dramatically improve the effective fidelity of our experiments.
  arXiv  Detail & Related papers  (2020-04-08T18:00:06Z)

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.