Related papers: Poincar\'e Duality and Multiplicative Structures o…
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…
We analyse recently proposed physical implementations of a quantum computer based on polar molecules. A set of general requirements for a molecular system is presented, which would provide an optimal combination of quantum gate times,…
Quantum information science strives to leverage the quantum-mechanical nature of our universe in order to achieve large improvements in certain information processing tasks. In deep-space optical communications, current receivers for the…
It is conjectured that quantum computers are able to solve certain problems more quickly than any deterministic or probabilistic computer. A quantum computer exploits the rules of quantum mechanics to speed up computations. However, it is a…
We find that scattering amplitudes in massive scalar QCD can manifest the duality between color and kinematics at loop-level. Specifically we construct the one-loop integrands for four-point scattering between two distinct massive scalars,…
Schur-Weyl duality is a ubiquitous tool in quantum information. At its heart is the statement that the space of operators that commute with the tensor powers of all unitaries is spanned by the permutations of the tensor factors. In this…
Quantum error correction codes with non-local connections such as quantum low-density parity-check (qLDPC) incur lower overhead and outperform surface codes on large-scale devices. These codes are not applicable on current superconducting…
Semiconductor spin qubits are a promising platform for large-scale quantum computing, but have yet to take full advantage of the broad class of quantum low-density parity check (QLDPC) codes, which promise high encoding rates and efficient…
We prove a duality theorem for Cohen--Macaulay simplicial complexes. This is a generalisation of Poincar\'e Duality, framed in the language of combinatorial sheaves. Our treatment is self-contained and accessible for readers with a working…
Quantum low-density parity-check (QLDPC) codes with asymptotically non-zero rates are prominent candidates for achieving fault-tolerant quantum computation, primarily due to their syndrome-measurement circuit's low operational depth.…
Quantum error-correcting codes with asymptotically lower overheads than the surface code require nonlocal connectivity. Leveraging multilayer routing and long-range coupling capabilities in superconducting qubit hardware, we develop…
We prove a duality relation for the moduli of the family of curves connecting two sets and the family of surfaces separating the sets, in the setting of a complete metric space equipped with a doubling measure and supporting a Poincar\'e…
The primary purpose of this paper concerns the relation of (compact) generalized manifolds to finite Poincar\'{e} duality complexes (PD complexes). The problem is that an arbitrary generalized manifold $X$ is always an ENR space, but it is…
We show that the tensor product of two random linear codes is robustly testable with high probability. This implies that one can obtain pairs of linear codes such that their product and the product of their dual codes are simultaneously…
We construct cup and cap products in intersection (co)homology with field coefficients. The existence of the cap product allows us to give a new proof of Poincare duality in intersection (co)homology which is similar in spirit to the usual…
We prove a Poincar\'e duality for arithmetic $p$-adic pro-\'etale cohomology of smooth dagger curves over finite extensions of ${\mathbf Q}_p$. We deduce it, via the Hochschild-Serre spectral sequence, from geometric comparison theorems…
Category theory unifies mathematical concepts, aiding comparisons across structures by incorporating objects and morphisms, which capture their interactions. It has influenced areas of computer science such as automata theory, functional…
Quantum error correction is an indispensable ingredient for scalable quantum computing. In this Perspective we discuss a particular class of quantum codes called low-density parity-check (LDPC) quantum codes. The codes we discuss are…
This is a comprehensive review on fault-tolerant topological quantum computation with the surface codes. The basic concepts and useful tools underlying fault-tolerant quantum computation, such as universal quantum computation, stabilizer…
The gauge field formalism, or operator-valued cochain formalism, has recently emerged as a powerful framework for describing quantum Calderbank-Shor-Steane (CSS) codes. In this work, we extend this framework to construct a broad class of…