Related papers: Poincar\'e Duality and Multiplicative Structures o…
Multiplication over binary fields is a crucial operation in quantum algorithms designed to solve the discrete logarithm problem for elliptic curve defined over $GF(2^n)$. In this paper, we present an algorithm for constructing quantum…
We introduce a general framework for weak transversal gates -- probabilistic implementation of logical unitaries realized by local physical unitaries -- and propose a novel partially fault-tolerant quantum computing architecture that…
Vast numbers of qubits will be needed for large-scale quantum computing due to the overheads associated with error correction. We present a scheme for low-overhead fault-tolerant quantum computation based on quantum low-density parity-check…
The method of intersection spaces associates rational Poincar\'e complexes to singular stratified spaces. For a conifold transition, the resulting cohomology theory yields the correct count of all present massless 3-branes in type IIB…
A binary extended 1-perfect code $\mathcal C$ folds over its kernel via the Steiner quadruple systems associated with its codewords. The resulting folding, proposed as a graph invariant for $\mathcal C$, distinguishes among the 361…
Encoding quantum information in a quantum error correction (QEC) code offers protection against decoherence and enhances the fidelity of qubits and gate operations. One of the fundamental challenges of QEC is to construct codes with…
We study relative differential and integral forms on families of supermanifolds and their cohomology. We prove a relative Poincar\'e--Verdier duality and show that it relates the cohomology of differential and integral forms, admitting a…
The assumed hardness of the Linear Code Equivalence problem (LCE) lies at the core of the security of the LESS signature scheme and other signature schemes with advanced functionalities. The LCE problem asks to determine whether two linear…
We prove that $p$-adic geometric pro-\'etale cohomology of smooth partially proper rigid analytic varieties over $p$-adic fields seen in the category of Topological Vector Spaces satisfies a Poincar\'e duality as we have conjectured. This…
Sum-rank codes are an important class of codes which can be utilized for linear network coding, space-time coding and distributed storage. They can not only reduce the size of network alphabet but also detect and correct more errors. Based…
Robust quantum computation with d-level quantum systems (qudits) poses two requirements: fast, parallel quantum gates and high fidelity two-qudit gates. We first describe how to implement parallel single qudit operations. It is by now well…
Here we prove a Poincar\'e-Verdier duality theorem for the o-minimal sheaf cohomology with definably compact supports of definably normal, definably locally compact spaces in an arbitrary o-minimal structure.
In this paper, we propose new coupled codes constructed by overlapping circular spatially-coupled low-density parity-check (SC-LDPC) codes, which show better asymptotic and finite-length decoding performance compared to the conventional…
Characterizing multiloop topologies is an important step towards developing novel methods at high perturbative orders in quantum field theory. In this article, we exploit the Loop-Tree Duality (LTD) formalism to analyse multiloop topologies…
The challenge of quantum computing is to combine error resilience with universal computation. Diagonal gates such as the transversal $T$ gate play an important role in implementing a universal set of quantum operations. This paper…
We initiate the study of multiplicative structures on cones and show that cones of Floer continuation maps fit naturally in this framework. We apply this to give a new description of the multiplicative structure on Rabinowitz Floer homology…
We expose a strong connection between good $2$-query locally testable codes (LTCs) and high dimensional expanders. Here, an LTC is called good if it has constant rate and linear distance. Our emphasis in this work is on LTCs testable with…
A new approach to efficient quantum computation with probabilistic gates is proposed and analyzed in both a local and non-local setting. It combines heralded gates previously studied for atom or atom-like qubits with logical encoding from…
We initiate the study of the duality theory of locally recoverable codes, with a focus on the applications. We characterize the locality of a code in terms of the dual code, and introduce a class of invariants that refine the classical…
We expand the toolbox of (co)homological methods in computational topology by applying the concept of persistence to sheaf cohomology. Since sheaves (of modules) combine topological information with algebraic information, they allow for…