Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1910.02833 · Quantum Information Processing

Universal computation with quantum fields

Kazuki Ikeda

Published Sep 1, 2020• 3 citations
arXivHTMLPDF
DOI
10.1007/s11128-020-02811-5

Related papers

Universal quantum computation using Ising anyons from a non-semisimple topological quantum field theory

Filippo Iulianelli, Sung Kim, Joshua Sussan +1 more

We propose a framework for topological quantum computation using newly discovered non-semisimple analogs of topological quantum field theories in 2 + 1 dimensions. These enhanced theories offer more powerful models for quantum computation. The conventional theory of Ising anyons, which is believed to describe excitations in the ν = 5/2 fractional quantum Hall state, is not universal for quantum computation via braiding of quasiparticles. However, we show that the non-semisimple theory introduces new anyon types that extend the Ising framework. By adding just one new anyon type, universal quantum computation can be achieved through braiding alone. This result opens new avenues for realizing fault-tolerant quantum computing in topologically ordered systems. Ising anyons are a promising platform for topological quantum computation, but braiding alone is not universal. Here, authors show that extending to non-semi simple TQFTs introduces new anyon types that enable universal quantum computation with Ising anyons.

arXiv:2410.14860•Nature Communications•Aug 5, 2025•11 citations

Universal Quantum Computation

Junya Kasahara

•Jan 1, 2019•1 citation

Universality in Quantum Computation

Emmanuel Jeandel

Lecture notes in computer science•Jan 1, 2004•6 citations

Quantum computing with sine-Gordon qubits

Dongsheng Wang

A universal quantum computing scheme, with a universal set of logical gates, is proposed based on networks of one-dimensional (1D) quantum systems. The encoding of information is in terms of universal features of gapped phases, for which effective field theories such as sine-Gordon field theory can be employed to describe a qubit. Primary logical gates are from twist, pump, glue, and shuffle operations that can be realized in principle by tuning parameters of the systems. Our scheme demonstrates the power of 1D quantum systems for robust quantum computing.

arXiv:1901.04551•Physical review. B./Physical review. B•Jul 18, 2019•4 citations

Quantum Computation

Biao Wu

Springer eBooks•Jan 1, 2023•0 citations

Realizable Hamiltonians for universal adiabatic quantum computers

Jacob Biamonte, Peter J. Love

It has been established that local lattice spin Hamiltonians can be used for universal adiabatic quantum computation. However, the two-local model Hamiltonians used in these proofs are general and hence do not limit the types of interactions required between spins. To address this concern, the present paper provides two simple model Hamiltonians that are of practical interest to experimentalists working toward the realization of a universal adiabatic quantum computer. The model Hamiltonians presented are the simplest known quantum-Merlin-Arthur-complete (QMA-complete) two-local Hamiltonians. The two-local Ising model with one-local transverse field which has been realized using an array of technologies, is perhaps the simplest quantum spin model but is unlikely to be universal for adiabatic quantum computation. We demonstrate that this model can be rendered universal and QMA-complete by adding a tunable two-local transverse ${\ensuremath{\sigma}}^{x}{\ensuremath{\sigma}}^{x}$ coupling. We also show the universality and QMA-completeness of spin models with only one-local ${\ensuremath{\sigma}}^{z}$ and ${\ensuremath{\sigma}}^{x}$ fields and two-local ${\ensuremath{\sigma}}^{z}{\ensuremath{\sigma}}^{x}$ interactions.

arXiv:0704.1287•Physical Review A•Jul 28, 2008•190 citations
We propose a framework for topological quantum computation using newly discovered non-semisimple analogs of topological quantum field theories in 2 + 1 dimensions. These enhanced theories offer more powerful models for quantum computation. The conventional theory of Ising anyons, which is believed to describe excitations in the ν = 5/2 fractional quantum Hall state, is not universal for quantum computation via braiding of quasiparticles. However, we show that the non-semisimple theory introduces new anyon types that extend the Ising framework. By adding just one new anyon type, universal quantum computation can be achieved through braiding alone. This result opens new avenues for realizing fault-tolerant quantum computing in topologically ordered systems. Ising anyons are a promising platform for topological quantum computation, but braiding alone is not universal. Here, authors show that extending to non-semi simple TQFTs introduces new anyon types that enable universal quantum computation with Ising anyons.
A universal quantum computing scheme, with a universal set of logical gates, is proposed based on networks of one-dimensional (1D) quantum systems. The encoding of information is in terms of universal features of gapped phases, for which effective field theories such as sine-Gordon field theory can be employed to describe a qubit. Primary logical gates are from twist, pump, glue, and shuffle operations that can be realized in principle by tuning parameters of the systems. Our scheme demonstrates the power of 1D quantum systems for robust quantum computing.
It has been established that local lattice spin Hamiltonians can be used for universal adiabatic quantum computation. However, the two-local model Hamiltonians used in these proofs are general and hence do not limit the types of interactions required between spins. To address this concern, the present paper provides two simple model Hamiltonians that are of practical interest to experimentalists working toward the realization of a universal adiabatic quantum computer. The model Hamiltonians presented are the simplest known quantum-Merlin-Arthur-complete (QMA-complete) two-local Hamiltonians. The two-local Ising model with one-local transverse field which has been realized using an array of technologies, is perhaps the simplest quantum spin model but is unlikely to be universal for adiabatic quantum computation. We demonstrate that this model can be rendered universal and QMA-complete by adding a tunable two-local transverse ${\ensuremath{\sigma}}^{x}{\ensuremath{\sigma}}^{x}$ coupling. We also show the universality and QMA-completeness of spin models with only one-local ${\ensuremath{\sigma}}^{z}$ and ${\ensuremath{\sigma}}^{x}$ fields and two-local ${\ensuremath{\sigma}}^{z}{\ensuremath{\sigma}}^{x}$ interactions.