Related papers: Theory of (Co)homological Invariants on Quantum LD…
We take initial steps towards a general framework for constructing logical gates in general quantum CSS codes. Viewing CSS codes as cochain complexes, we observe that cohomology invariants naturally give rise to diagonal logical gates. We…
Quantum LDPC codes have attracted intense interest due to their advantageous properties for realizing efficient fault-tolerant quantum computing. In particular, sheaf codes represent a novel framework that encompasses all well-known good…
We develop a topological theory for fault-tolerant quantum computation in quantum low-density parity-check (qLDPC) codes. We show that there exist hidden simplicial or CW complex structures encoding the topological data for all qLDPC and…
We systematically construct and classify fault-tolerant logical gates implemented by constant-depth circuits for quantum codes using cohomology operations and symmetry. These logical gates are obtained from unitary operators given by…
A major goal in quantum computing is to build a fault-tolerant quantum computer. One approach involves quantum low-density parity-check (qLDPC) codes that support transversal non-Clifford gates. In this work, we provide a large family of…
Class groups of real quadratic fields represent fundamental structures in algebraic number theory with significant computational implications. While Stark's conjecture establishes theoretical connections between special units and class…
We study parallel fault-tolerant quantum computing for families of homological quantum low-density parity-check (LDPC) codes defined on 3-manifolds with constant or almost-constant encoding rate. We derive generic formula for a transversal…
We exhibit nontrivial transversal logical multi-controlled-$Z$ gates on $[\![N,\Theta(N),\tilde\Theta(N)]\!]$ quantum low-density parity-check codes and $[\![N,\Theta(N),\tilde\Theta(N)]\!]$ quantum locally testable codes with soundness…
Quantum low-density parity-check (qLDPC) codes are an important component in the quest for quantum fault tolerance. Dramatic recent progress on qLDPC codes has led to constructions which are asymptotically good, and which admit linear-time…
Utility-scale quantum computing requires quantum error correction (QEC) to protect quantum information against noise. Currently, superconducting hardware is a promising candidate for achieving fault tolerance due to its fast gate times and…
We introduce several new quantum algorithms for estimating homological invariants, specifically Betti numbers and persistent Betti numbers, of a simplicial complex given via a structured classical input. At the core of our algorithm lies…
Quantum error correction is necessary to perform large-scale quantum computation, but requires extremely large overheads in both space and time. High-rate quantum low-density-parity-check (qLDPC) codes promise a route to reduce qubit…
Quantum codes with low-weight stabilizers known as LDPC codes have been actively studied recently due to their simple syndrome readout circuits and potential applications in fault-tolerant quantum computing. However, all families of quantum…
We show that unrolled quantum groups at odd roots of unity give rise to relative modular categories. These are the main building blocks for the construction of 1+1+1-TQFTs extending CGP invariants, which are non-semisimple quantum…
We construct knot invariants categorifying the quantum knot variants for all representations of quantum groups. We show that these invariants coincide with previous invariants defined by Khovanov for sl_2 and sl_3 and by Mazorchuk-Stroppel…
We construct a family of constant-rate highly-symmetric self-dual qLDPC codes on high dimensional expanders. This is the first self-dual code constructed on high dimensional expanders and also the first such code with a rich (e.g.…
It is well-known that the cohomology ring has a richer structure than homology groups. However, until recently, the use of cohomology in persistence setting has been limited to speeding up of barcode computations. Some of the recently…
Quantum error correction is rapidly seeing first experimental implementations, but there is a significant gap between asymptotically optimal error-correcting codes and codes that are experimentally feasible. Quantum LDPC codes range from…
Knot and link invariants naturally arise from any braided Hopf algebra. We consider the computational complexity of the invariants arising from an elementary family of finite-dimensional Hopf algebras: quantum doubles of finite groups…
The homological product is a general-purpose recipe that forges new quantum codes from arbitrary classical or quantum input codes, often providing enhanced error-correcting properties. When the input codes are classical linear codes, it is…