Related papers: Complex abelian varieties and quantum error correc…
We describe all polarizations for all abelian varieties over a finite field in a fixed isogeny class corresponding to a squarefree Weil polynomial, when one variety in the isogeny class admits a canonical liftings to characteristic zero,…
Clifford algebras are naturally associated with quadratic forms. These algebras are Z_2-graded by construction. However, only a Z_n-gradation induced by a choice of a basis, or even better, by a Chevalley vector space isomorphism Cl(V) <->…
A quantum error correction (QEC) code uses $N_{\rm c}$ quantum bits to construct one "logical" quantum bits of better quality than the original "physical" ones. QEC theory predicts that the failure probability $p_L$ of logical qubits…
Quantum error-correcting codes can be used to protect qubits involved in quantum computation. This requires that logical operators acting on protected qubits be translated to physical operators (circuits) acting on physical quantum states.…
Abelian codes and complementary dual codes form important classes of linear codes that have been extensively studied due to their rich algebraic structures and wide applications. In this paper, a family of abelian codes with complementary…
We study special subvarieties, i.e., subvarieties containing a dense subset of CM points, of the moduli space $A_5$ of principally polarized abelian varieties of dimension five, generically contained in the locus of intermediate Jacobians…
We establish an exact noise-model-derived characterization of quantum error correction under diagonal local phase noise. Under uniform locality, the maximal logical dimension under t-local phase errors equals Aq(n,2t+1), the classical q-ary…
We discuss a method to adapt the codeword stabilized (CWS) quantum code framework to the problem of finding asymmetric quantum codes. We focus on the corresponding Pauli error models for amplitude damping noise and phase damping noise. In…
The Clifford hierarchy is a nested sequence of sets of quantum gates that can be fault-tolerantly performed using gate teleportation within standard quantum error correction schemes. The groups of Pauli and Clifford gates constitute the…
The toric code is a simple and exactly solvable example of topological order realising Abelian anyons. However, it was shown to support non-local lattice defects, namely twists, which exhibit non-Abelian anyonic behaviour [1]. Motivated by…
The non-local interactions in several quantum device architectures allow for the realization of more compact quantum encodings while retaining the same degree of protection against noise. Anticipating that short to medium-length codes will…
The Gottesman-Kitaev-Preskill (GKP) encoding of a qubit into a bosonic mode is a promising bosonic code for quantum computation due to its tolerance for noise and all-Gaussian gate set. We present a toolkit for phase-space description and…
Polar codes are constructed for arbitrary channels by imposing an arbitrary quasigroup structure on the input alphabet. Just as with "usual" polar codes, the block error probability under successive cancellation decoding is…
It is well known that the discrete analogue of a lattice is a linear code which is a vector subspace of Hamming space $\mathbb{F}^n$. The set $\mathbb{F}$ is a finite field and $n \in \mathbb{Z}_{>0}$. Our attempt is to construct a class of…
We present a general framework of quantum error-correcting codes (QECCs) as a subspace of a complex Hilbert space and the corresponding error models. Then we illustrate how QECCs can be constructed using techniques from algebraic coding…
We study the rationality properties of the moduli space $\mathcal{A}_g$ of principally polarised abelian $g$-folds over $\mathbb{Q}$ and apply the results to arithmetic questions. In particular we show that any principally polarised abelian…
The Gottesman-Knill theorem holds that operations from the Clifford group, when combined with preparation and detection of qubit states in the computational basis, are insufficient for universal quantum computation. Indeed, any measurement…
Continuous variable measurement-based quantum computation on cluster states has in recent years shown great potential for scalable, universal, and fault-tolerant quantum computation when combined with the Gottesman-Kitaev-Preskill (GKP)…
Kuga and Satake associate with every polarized complex K3 surface (X,L) a complex abelian variety called the Kuga-Satake abelian variety of (X,L). We use this construction to define morphisms between moduli spaces of polarized K3 surface…
We review some of the recent efforts in devising and engineering bosonic qubits for superconducting devices, with emphasis on the Gottesman-Kitaev-Preskill (GKP) qubit. We present some new results on decoding repeated GKP error correction…