Universal Quantum Computation with the $S_3$ Quantum Double: A Pedagogical Exposition
- URL: http://arxiv.org/abs/2502.14974v1
- Date: Thu, 20 Feb 2025 19:07:31 GMT
- Title: Universal Quantum Computation with the $S_3$ Quantum Double: A Pedagogical Exposition
- Authors: Chiu Fan Bowen Lo, Anasuya Lyons, Ruben Verresen, Ashvin Vishwanath, Nathanan Tantivasadakarn,
- Abstract summary: We show how anyon braiding and measurement in $S_3$ TO are primitives for topological quantum computation.<n>This provides a roadmap for near-term quantum platforms.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Non-Abelian topological order (TO) enables topologically protected quantum computation with its anyonic quasiparticles. Recently, TO with $S_3$ gauge symmetry was identified as a sweet spot -- simple enough to emerge from finite-depth adaptive circuits yet powerful enough to support a universal topological gate-set. In these notes, we review how anyon braiding and measurement in $S_3$ TO are primitives for topological quantum computation and we explicitly demonstrate universality. These topological operations are made concrete in the $S_3$ quantum double lattice model, aided by the introduction of a generalized ribbon operator. This provides a roadmap for near-term quantum platforms.
Related papers
- Exact path integrals on half-line in quantum cosmology with a fluid clock and aspects of operator ordering ambiguity [0.0]
We perform $textitexact$ half-line path integral quantization of flat, homogeneous cosmological models containing a perfect fluid acting as an internal clock.<n>We argue that a particular ordering prescription in the quantum theory can preserve two symmetries.
arXiv Detail & Related papers (2025-01-20T19:00:02Z) - Variational Quantum Simulation of Anyonic Chains [0.0]
Anyonic chains provide lattice realizations of a rich set of quantum field theories in two space-time dimensions.<n>The described quantum simulation scheme provides a systematic approach to give rise to a large family of quantum field theories.
arXiv Detail & Related papers (2024-12-23T18:39:28Z) - A Universal Circuit Set Using the $S_3$ Quantum Double [0.5231056284485742]
We present a quantum double model $mathcalD(S_3)$ -- a specific non-Abelian topological code.
We encode each physical degree of freedom of $mathcalD(S_3)$ into a novel, quantum, error-correcting code.
Our proposal offers a promising path to realize universal topological quantum computation in the NISQ era.
arXiv Detail & Related papers (2024-11-14T18:58:41Z) - 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) - On quantum algorithms for the Schr\"odinger equation in the
semi-classical regime [27.175719898694073]
We consider Schr"odinger's equation in the semi-classical regime.
Such a Schr"odinger equation finds many applications, including in Born-Oppenheimer molecular dynamics and Ehrenfest dynamics.
arXiv Detail & Related papers (2021-12-25T20:01:54Z) - 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) - Straddling-gates problem in multipartite quantum systems [20.428960719376164]
We study a variant of quantum circuit complexity, the binding complexity.
We show that any $m$partite Schmidt decomposable state has binding complexity linear in $m$, which hints its multi-separable property.
arXiv Detail & Related papers (2021-10-13T16:28:12Z) - Quantum simulation of $\phi^4$ theories in qudit systems [53.122045119395594]
We discuss the implementation of quantum algorithms for lattice $Phi4$ theory on circuit quantum electrodynamics (cQED) system.
The main advantage of qudit systems is that its multi-level characteristic allows the field interaction to be implemented only with diagonal single-qudit gates.
arXiv Detail & Related papers (2021-08-30T16:30:33Z) - 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) - 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) - 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) - Universal topological quantum computation with strongly correlated
Majorana edge modes [7.930410828384357]
Majorana-based quantum gates are not complete for performing universal topological quantum computation.
We show the application to Shor's integer factorization algorithm.
arXiv Detail & Related papers (2020-04-07T12:03:14Z)
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.