Related papers: Homology, Hopf Algebras and Quantum Code Surgery

Homology, Hopf Algebras and Quantum Code Surgery

URL: http://arxiv.org/abs/2508.01496v1
Date: Sat, 02 Aug 2025 21:38:33 GMT
Title: Homology, Hopf Algebras and Quantum Code Surgery
Authors: Alexander Cowtan,
Abstract summary: We study quantum error-correction codes from an algebraic perspective.<n>We derive new methods of performing fault-tolerant quantum computation.<n>At its core, this thesis asks: what is lattice surgery?
Score: 55.2480439325792
License: http://creativecommons.org/licenses/by/4.0/
Abstract: This thesis is a study of quantum error-correction codes from an algebraic perspective. We concern ourselves not only with quantum codes but also protocols to perform logical quantum computation using such codes. We derive new methods of performing fault-tolerant quantum computation, rooted in abstract algebra and category theory. We also generalise known constructions of quantum codes and rigorously formalise existing constructions. At its core, this thesis asks: what is lattice surgery?

Related papers

Efficient Quantum Pseudorandomness from Hamiltonian Phase States [41.94295877935867]
We introduce a quantum hardness assumption called the Hamiltonian Phase State (HPS) problem.<n>We show that our assumption is plausibly fully quantum; meaning, it cannot be used to construct one-way functions.<n>We show that our assumption and its variants allow us to efficiently construct many pseudorandom quantum primitives.
arXiv Detail & Related papers (2024-10-10T16:10:10Z)
Quantum types: going beyond qubits and quantum gates [0.0]
This article outlines the need for higher-level abstractions and proposes some of them in a developer-friendly programming language called Rhyme. The new quantum types are extensions of classical types, including bits, integers, floats, characters, arrays, and strings.
arXiv Detail & Related papers (2024-01-26T18:54:35Z)
Quotient Space Quantum Codes [0.0]
In this paper, I establish the quotient space codes to construct quantum codes. These new codes unify additive codes and codeword stabilized codes and can transmit classical codewords. I also present new bounds for quantum codes and provide a simple proof of the quantum Singleton bound.
arXiv Detail & Related papers (2023-11-13T12:03:59Z)
Quantum Circuit Completeness: Extensions and Simplifications [44.99833362998488]
The first complete equational theory for quantum circuits has only recently been introduced. We simplify the equational theory by proving that several rules can be derived from the remaining ones. The complete equational theory can be extended to quantum circuits with ancillae or qubit discarding.
arXiv Detail & Related papers (2023-03-06T13:31:27Z)
Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
arXiv Detail & Related papers (2023-03-02T14:18:17Z)
Qafny: A Quantum-Program Verifier [39.47005122712576]
We present Qafny, an automated proof system for verifying quantum programs. At its core, Qafny uses a type-guided quantum proof system that translates quantum operations to classical array operations. We show how Qafny can efficiently verify important quantum algorithms, including quantum-walk algorithms, Grover's algorithm, and Shor's algorithm.
arXiv Detail & Related papers (2022-11-11T18:50:52Z)
Quantum computations (course of lectures) [0.0]
The course is devoted to a new type of computations based on quantum mechanics. Various forms of quantum computing are considered: the Feynman gate model, fermionic and adiabatic computations.
arXiv Detail & Related papers (2021-07-16T10:12:18Z)
Depth-efficient proofs of quantumness [77.34726150561087]
A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
arXiv Detail & Related papers (2021-07-05T17:45:41Z)
Theory of quasi-exact fault-tolerant quantum computing and valence-bond-solid codes [3.6192409729339223]
We develop the theory of quasi-exact fault-tolerant quantum computation, which uses qubits encoded into quasi-exact quantum error-correction codes ("quasi codes") The model of QEQ lies in between the two well-known ones: the usual noisy quantum universality without error correction and the usual fault-tolerant quantum computation, but closer to the later.
arXiv Detail & Related papers (2021-05-31T08:17:30Z)
On quantum neural networks [91.3755431537592]
We argue that the concept of a quantum neural network should be defined in terms of its most general function. Our reasoning is based on the use of the Feynman path integral formulation in quantum mechanics.
arXiv Detail & Related papers (2021-04-12T18:30:30Z)
Quantum error-correcting codes and their geometries [0.6445605125467572]
This article aims to introduce the reader to the underlying mathematics and geometry of quantum error correction. We go on to construct quantum codes: firstly qubit stabilizer codes, then qubit non-stabilizer codes, and finally codes with a higher local dimension. This allows one to deduce the parameters of the code efficiently, deduce the inequivalence between codes that have the same parameters, and presents a useful tool in deducing the feasibility of certain parameters.
arXiv Detail & Related papers (2020-07-12T13:57:39Z)

This list is automatically generated from the titles and abstracts of the papers in this site.