Related papers: Erasure Thresholds for Hyperbolic and Semi-Hyperbo…
An $[n,k]$ code $\mathcal{C}$ is said to be locally recoverable in the presence of a single erasure, and with locality parameter $r$, if each of the $n$ code symbols of $\mathcal{C}$ can be recovered by accessing at most $r$ other code…
We demonstrate that Standard Model vacuum stability exhibits extreme sensitivity to the Higgs quartic coupling: a mere 3\% enhancement represents the critical threshold separating metastability from absolute stability with UV Landau poles.…
We identify type-preserving representations $\phi: \pi_1(\Sigma)\to \mathrm{PSL}(2,\mathbb{R})$ of the fundamental group of every punctured surface $\Sigma = \Sigma_{g,p}$ that are not Fuchsian yet send all non-peripheral simple closed…
Several applications require the super-resolution of noisy images and the preservation of geometrical and texture features. State-of-the-art super-resolution methods do not account for noise and generally enhance the output image's…
We introduce a new tiling algorithm for hyperbolic 3-manifolds. We use it to compute the maximal cusp area matrix; this completely characterizes the space of all embedded and disjoint cusp neighborhoods. As another application of our work,…
We study the code obtained by concatenating the standard single-mode Gottesman-Kitaev-Preskill (GKP) code with the surface code. We show that the noise tolerance of this surface-GKP code with respect to (Gaussian) displacement errors…
This paper studies the performance of block coding on an additive white Gaussian noise channel under different power limitations at the transmitter. Lower bounds are presented for the minimum error probability of codes satisfying maximal…
Classical simulations of noisy stabilizer circuits are often used to estimate the threshold of a quantum error-correcting code. Physical noise sources are efficiently approximated by random insertions of Pauli operators. For a single qubit,…
Topological color codes defined by the 4.8.8 semiregular lattice feature geometrically local check operators and admit transversal implementation of the entire Clifford group, making them promising candidates for fault-tolerant quantum…
Laboratory hardware is rapidly progressing towards a state where quantum error-correcting codes can be realised. As such, we must learn how to deal with the complex nature of the noise that may occur in real physical systems. Single qubit…
Erasures, or errors with known locations, are a more favorable type of error for quantum error-correcting codes than Pauli errors. Converting physical noise into erasures can significantly improve the performance of quantum error…
Credibility building activities in computational research include verification and validation, reproducibility and replication, and uncertainty quantification. Though orthogonal to each other, they are related. This paper presents…
Polar codes were introduced in 2009 and proven to achieve the symmetric capacity of any binary-input discrete memoryless channel under low-complexity successive cancellation decoding. In this thesis, we construct cyclic polar codes based on…
Edge detection (ED) remains a fundamental task in computer vision, yet its performance is often hindered by the ambiguous nature of non-edge pixels near object boundaries. The widely adopted Weighted Binary Cross-Entropy (WBCE) loss treats…
We prove the convergence of hyperbolic approximations for several classes of higher-order PDEs, including the Benjamin-Bona-Mahony, Korteweg-de Vries, Gardner, Kawahara, and Kuramoto-Sivashinsky equations, provided a smooth solution of the…
We consider a surface code suffering decoherence due to coupling to a bath of bosonic modes at finite temperature and study the time available before the unavoidable breakdown of error correction occurs as a function of coupling and bath…
The surface code is a prominent topological error-correcting code exhibiting high fault-tolerance accuracy thresholds. Conventional schemes for error correction with the surface code place qubits on a planar grid and assume native CNOT…
Boundary integral equations are an efficient and accurate tool for the numerical solution of elliptic boundary value problems. The solution is expressed as a layer potential; however, the error in its evaluation grows large near the…
Real quantum computers will be subject to complicated, qubit-dependent noise, instead of simple noise such as depolarizing noise with the same strength for all qubits. We can do quantum error correction more effectively if our decoding…
We explain how to optimize finite-length LDPC codes for transmission over the binary erasure channel. Our approach relies on an analytic approximation of the erasure probability. This is in turn based on a finite-length scaling result to…