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

Physics

Quantum Computing with a Twist

Ryan Wilkinson

Published Oct 17, 2024• 0 citations
Publisher
DOI
10.1103/physics.17.s129

Related papers

Quantum computation with generalized dislocation codes

Manoj G. Gowda, Pradeep Kiran Sarvepalli

In this paper, we study quantum computing with twists. Twists are yet another form of defects in a lattice. They arise from dislocations in the lattice and can be used to encode and process quantum information. Surface codes with twists are also called dislocation codes. Hastings and Geller showed that dislocation codes could provide gains in space-time complexity of quantum computation. In this paper, we undertake a detailed study of generalized dislocation codes. We develop the theory of qubit dislocation codes over arbitrary four-valent and bicolorable lattices. We give a construction to introduce twists in such lattices and also study the structure of logical operators. We then study dislocation codes over odd prime dimensions in square lattices. Using the theory developed, we present protocols for implementing a universal gate set in qubit dislocation codes. We also show how to implement the generalized Clifford group in qudit dislocation codes in odd prime dimensions.

Physical Review A•Oct 29, 2020•4 citations

Toward Quantum Computing

Science•Feb 16, 2012•0 citations

On quantum computation of Kloosterman sums

Peter Bruin

We give two quantum algorithms for computing (twisted) Kloosterman sums attached to a finite field $\mathbf{F}$ of $q$ elements. The first algorithm computes a quantum state containing, as its coefficients with respect to the standard basis, all Kloosterman sums for $\mathbf{F}$ twisted by a given multiplicative character, and runs in time polynomial in $\log q$. The second algorithm computes a single Kloosterman sum to a prescribed precision, and runs in time quasi-linear in $\sqrt{q}$.

arXiv:1807.03600•Jul 10, 2018•1 citation

The Quantum Computing Challenge

Paul M. B. Vitanyi

Lecture notes in computer science•Jan 1, 2001•2 citations

Twisted simplicial distributions

Cihan Okay, Walker H. Stern

We introduce a theory of twisted simplicial distributions on simplicial principal bundles, which allow us to capture Bell's non-locality, and the more general notion of quantum contextuality. We leverage the classical theory of simplicial principal bundles, as well as structures on categories of such bundles, to provide powerful computational tools for analyzing twisted distributions in terms of both direct constructions in simplicial sets and techniques from homological algebra. We use these techniques to analyze our key examples: quantum distributions and operator-theoretic polytopes used in the classical simulation of quantum computation.

arXiv:2403.19808•Mar 28, 2024•5 citations

Towards Quantum Computing

WORLD SCIENTIFIC eBooks•Jul 11, 2022•0 citations
In this paper, we study quantum computing with twists. Twists are yet another form of defects in a lattice. They arise from dislocations in the lattice and can be used to encode and process quantum information. Surface codes with twists are also called dislocation codes. Hastings and Geller showed that dislocation codes could provide gains in space-time complexity of quantum computation. In this paper, we undertake a detailed study of generalized dislocation codes. We develop the theory of qubit dislocation codes over arbitrary four-valent and bicolorable lattices. We give a construction to introduce twists in such lattices and also study the structure of logical operators. We then study dislocation codes over odd prime dimensions in square lattices. Using the theory developed, we present protocols for implementing a universal gate set in qubit dislocation codes. We also show how to implement the generalized Clifford group in qudit dislocation codes in odd prime dimensions.
We give two quantum algorithms for computing (twisted) Kloosterman sums attached to a finite field F\mathbf{F}F of qqq elements. The first algorithm computes a quantum state containing, as its coefficients with respect to the standard basis, all Kloosterman sums for F\mathbf{F}F twisted by a given multiplicative character, and runs in time polynomial in log⁡q\log qlogq. The second algorithm computes a single Kloosterman sum to a prescribed precision, and runs in time quasi-linear in q\sqrt{q}q​.
We introduce a theory of twisted simplicial distributions on simplicial principal bundles, which allow us to capture Bell's non-locality, and the more general notion of quantum contextuality. We leverage the classical theory of simplicial principal bundles, as well as structures on categories of such bundles, to provide powerful computational tools for analyzing twisted distributions in terms of both direct constructions in simplicial sets and techniques from homological algebra. We use these techniques to analyze our key examples: quantum distributions and operator-theoretic polytopes used in the classical simulation of quantum computation.