Demonstration of magic state power of $\mathbf{D}(\mathbf{S}_{3})$ anyons with two qudits

• URL: http://arxiv.org/abs/2408.03377v3
• Date: Wed, 05 Nov 2025 12:34:30 GMT
• Title: Demonstration of magic state power of $\mathbf{D}(\mathbf{S}_{3})$ anyons with two qudits
• Authors: Lucy Byles, Ewan Forbes, Jiannis K. Pachos,
• Abstract summary: We present a method for implementing both braiding and fusion evolutions using only the operators that create and measure anyons.<n>We show that the entire scheme can be encoded in just two qudits, offering a compact blueprint that is inherently scalable and readily implementable in current quantum platforms.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We consider a lattice of $d=6$ qudits that supports $\mathbf{D}(\mathbf{S}_3)$ non-Abelian anyons. We present a method for implementing both braiding and fusion evolutions using only the operators that create and measure anyons, without requiring additional dynamical control. This provides a minimal protocol demonstrating that $\mathbf{D}(\mathbf{S}_3)$ anyons can generate magic states, thereby establishing their universality for quantum computation. Furthermore, we show that the entire scheme can be encoded in just two qudits, offering a compact blueprint that is inherently scalable and readily implementable in current quantum platforms.

Related papers

• Composing $p$-adic qubits: from representations of SO(3)$_p$ to entanglement and universal quantum logic gates [1.3999481573773072]
  We build on the notion of a single $p$-adic qubit as a two-dimensional irreducible representation of the compact $p$-adic special group SO(3)$_p$.<n>We tackle the problem of $p$-adic qubit composition and entanglement, fundamental for a $p$-adic formulation of quantum information processing.
  arXiv  Detail & Related papers  (2026-01-20T10:07:49Z)
• Quantum oracles for the finite element method [45.200826131319815]
  This study examines the quantum routines required for the implementation of oracles used in the block-encoding of the $N times N stiffness and mass matrices.<n>We show how to construct the necessary oracles, which require the calculation of element geometry, square root and the implementation of conditional operations.
  arXiv  Detail & Related papers  (2025-04-28T14:28:31Z)
• Quantum Simulation of non-Abelian Lattice Gauge Theories: a variational approach to $\mathbb{D}_8$ [0.0]
  We show a procedure that removes the matter and improves the efficiency of the hardware resources. We map the lattice gauge theory onto qudit systems with local interactions. This can serve as a way of simulating lattice gauge theories in high spatial dimensions.
  arXiv  Detail & Related papers  (2025-01-29T18:59:59Z)
• String Breaking in the Heavy Quark Limit with Scalable Circuits [0.0]
  A truncation of the Hilbert space of non-Abelian lattice gauge theories with matter in the heavy quark limit is developed. A state with a single $qoverlineq$ pair is prepared on quantum hardware and the inelastic production of $qoverlineq$ pairs is observed using $104$ qubits on IBM's Heron quantum computer ibm_torino.
  arXiv  Detail & Related papers  (2024-11-08T19:00:27Z)
• A General Quantum Duality for Representations of Groups with Applications to Quantum Money, Lightning, and Fire [8.714677279673738]
  We show that manipulating quantum states in one basis is equivalent to extracting values in a complementary basis. We present the first secure quantum lightning construction based on a plausible cryptographic assumption. We show equivalence among four security notions: quantum lightning security, worst-case and average-case cloning security, and security against preparing a canonical state.
  arXiv  Detail & Related papers  (2024-11-01T11:56:11Z)
• Geometry of degenerate quantum states, configurations of $m$-planes and invariants on complex Grassmannians [55.2480439325792]
  We show how to reduce the geometry of degenerate states to the non-abelian connection $A$. We find independent invariants associated with each triple of subspaces. Some of them generalize the Berry-Pancharatnam phase, and some do not have analogues for 1-dimensional subspaces.
  arXiv  Detail & Related papers  (2024-04-04T06:39:28Z)
• Unveiling the non-Abelian statistics of $D(S_3)$ anyons via photonic simulation [0.0]
  Scheme can simulate exotic statistics of $D(S_3)$ non-Abelian anyons with minimal resources. We employ a photonic simulator to encode a single qutrit and manipulate it to perform the fusion and braiding properties of non-Abelian $D(S_3)$ anyons.
  arXiv  Detail & Related papers  (2023-04-11T15:36:27Z)
• Pauli-based model of quantum computation with higher-dimensional systems [0.0]
  Pauli-based computation (PBC) is a universal model for quantum computation with qubits. We generalize PBC for odd-prime-dimensional systems and demonstrate its universality.
  arXiv  Detail & Related papers  (2023-02-27T12:05:13Z)
• 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)
• Topological Quantum Computation on Supersymmetric Spin Chains [0.0]
  Quantum gates built out of braid group elements form the building blocks of topological quantum computation. We show that the fusion spaces of anyonic systems can be precisely mapped to the product state zero modes of certain Nicolai-like supersymmetric spin chains.
  arXiv  Detail & Related papers  (2022-09-08T13:52:10Z)
• A New Approach to Post-Quantum Non-Malleability [8.859667450008452]
  We provide the first $mathitconstant$-$mathitround$ construction of post-quantum non-malleable commitments. We achieve the standard notion of non-malleability with respect to commitments.
  arXiv  Detail & Related papers  (2022-07-12T21:47:39Z)
• Quantum Resources Required to Block-Encode a Matrix of Classical Data [56.508135743727934]
  We provide circuit-level implementations and resource estimates for several methods of block-encoding a dense $Ntimes N$ matrix of classical data to precision $epsilon$. We examine resource tradeoffs between the different approaches and explore implementations of two separate models of quantum random access memory (QRAM) Our results go beyond simple query complexity and provide a clear picture into the resource costs when large amounts of classical data are assumed to be accessible to quantum algorithms.
  arXiv  Detail & Related papers  (2022-06-07T18:00:01Z)
• Beyond the Berry Phase: Extrinsic Geometry of Quantum States [77.34726150561087]
  We show how all properties of a quantum manifold of states are fully described by a gauge-invariant Bargmann. We show how our results have immediate applications to the modern theory of polarization.
  arXiv  Detail & Related papers  (2022-05-30T18:01:34Z)
• Exponential Separation between Quantum and Classical Ordered Binary Decision Diagrams, Reordering Method and Hierarchies [68.93512627479197]
  We study quantum Ordered Binary Decision Diagrams($OBDD$) model. We prove lower bounds and upper bounds for OBDD with arbitrary order of input variables. We extend hierarchy for read$k$-times Ordered Binary Decision Diagrams ($k$-OBDD$) of width.
  arXiv  Detail & Related papers  (2022-04-22T12:37:56Z)
• Speeding up Learning Quantum States through Group Equivariant Convolutional Quantum Ans\"atze [13.651587339535961]
  We develop a framework for convolutional quantum circuits with SU$(d)$symmetry. We prove Harrow's statement on equivalence between $nameSU(d)$ and $S_n$ irrep bases.
  arXiv  Detail & Related papers  (2021-12-14T18:03:43Z)
• Matrix Discrepancy from Quantum Communication [13.782852293291494]
  We develop a novel connection between discrepancy minimization and (quantum) communication complexity. We show that for every collection of symmetric $n times n$ $A_1,ldots,A_n$ with $|A_i| leq 1$ and $|A_i|_F leq n1/4$ there exist signs $x in pm 1n such that the maximum eigenvalue of $sum_i leq n x_i A_i$ is at most
  arXiv  Detail & Related papers  (2021-10-19T16:51:11Z)
• Quantum double aspects of surface code models [77.34726150561087]
  We revisit the Kitaev model for fault tolerant quantum computing on a square lattice with underlying quantum double $D(G)$ symmetry. We show how our constructions generalise to $D(H)$ models based on a finite-dimensional Hopf algebra $H$.
  arXiv  Detail & Related papers  (2021-06-25T17:03:38Z)
• Sub-bosonic (deformed) ladder operators [62.997667081978825]
  We present a class of deformed creation and annihilation operators that originates from a rigorous notion of fuzziness. This leads to deformed, sub-bosonic commutation relations inducing a simple algebraic structure with modified eigenenergies and Fock states. In addition, we investigate possible consequences of the introduced formalism in quantum field theories, as for instance, deviations from linearity in the dispersion relation for free quasibosons.
  arXiv  Detail & Related papers  (2020-09-10T20:53:58Z)
• A Randomized Algorithm to Reduce the Support of Discrete Measures [79.55586575988292]
  Given a discrete probability measure supported on $N$ atoms and a set of $n$ real-valued functions, there exists a probability measure that is supported on a subset of $n+1$ of the original $N$ atoms. We give a simple geometric characterization of barycenters via negative cones and derive a randomized algorithm that computes this new measure by "greedy geometric sampling" We then study its properties, and benchmark it on synthetic and real-world data to show that it can be very beneficial in the $Ngg n$ regime.
  arXiv  Detail & Related papers  (2020-06-02T16:38:36Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)
• Quantum Simulation of 2D Quantum Chemistry in Optical Lattices [59.89454513692418]
  We propose an analog simulator for discrete 2D quantum chemistry models based on cold atoms in optical lattices. We first analyze how to simulate simple models, like the discrete versions of H and H$+$, using a single fermionic atom. We then show that a single bosonic atom can mediate an effective Coulomb repulsion between two fermions, leading to the analog of molecular Hydrogen in two dimensions.
  arXiv  Detail & Related papers  (2020-02-21T16:00:36Z)

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.