Related papers: Homomorphic Logical Measurements
The dipole formalism provides a powerful framework from which parton showers can be constructed. In a recent paper, we proposed a dipole shower with improved colour accuracy and in this paper we show how it can be further improved. After an…
We introduce a new topological quantum code, the three-dimensional subsystem toric code (3D STC), which is a generalization of the stabilizer toric code. The 3D STC can be realized by measuring geometrically-local parity checks of weight at…
This article proposes a topological method that extracts hierarchical structures of various amorphous solids. The method is based on the persistence diagram (PD), a mathematical tool for capturing shapes of multiscale data. The input to the…
Surface codes are a promising method of quantum error correction and the basis of many proposed quantum computation implementations. However, their efficient decoding is still not fully explored. Recently, approaches based on machine…
Unlike the surface code, quantum low-density parity-check (QLDPC) codes can have a finite encoding rate, potentially lowering the error correction overhead. However, finite-rate QLDPC codes have nonlocal stabilizers, making it difficult to…
Topologically-ordered phases are stable to local perturbations, and topological quantum error-correcting codes enjoy thresholds to local errors. We connect the two notions of stability by constructing classical statistical mechanics models…
Stabilizer codes are a simple and successful class of quantum error-correcting codes. Yet this success comes in spite of some harsh limitations on the ability of these codes to fault-tolerantly compute. Here we introduce a new metric for…
Holding a shell in their hands, one can apply six loads: three by pulling and shearing, and three by bending and twisting. Here, it is shown that the shell resists exactly three load cases and comply with the other three, provided the shell…
Theoretical frameworks used to qualitatively and quantitatively describe nuclear dynamics in solids are often based on the harmonic approximation. However, this approximation is known to become inaccurate or to break down completely in many…
A series of third- and fifth-order hybrid compact least-squares central weighted essentially non-oscillatory schemes are proposed and applied to curvilinear structured grids for the finite volume method. In smooth regions, compact…
Quantum error correction (QEC) entails the encoding of quantum information into a QEC code space, measuring error syndromes to properly locate and identify errors, and, if necessary, applying a proper recovery operation. Here we compare…
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 present novel homomorphic encryption schemes for integer arithmetic, intended for use in secure single-party computation in the cloud. These schemes are capable of securely computing only low degree polynomials homomorphically, but this…
We propose a least-squares phase-stepping algorithm (LS-PSA) consisting of only 14 steps for high-quality optical plate testing. Optical plate testing produces an infinite number of simultaneous fringe patterns due to multiple reflections.…
Running quantum algorithms on real hardware is essential for understanding their strengths and limitations, especially in the noisy intermediate scale quantum (NISQ) era. Herein we focus on the practical aspect of quantum computational…
Symmetry is at the heart of modern physics. Phases of matter are classified by symmetry breaking, topological phases are characterized by non-local symmetries, and point group symmetries are critical to our understanding of crystalline…
We study variants of Shor's code that are adept at handling single-axis correlated idling errors, which are commonly observed in many quantum systems. By using the repetition code structure of the Shor's code basis states, we calculate the…
Demonstrating subthreshold scaling of a surface-code quantum memory on hardware whose native connectivity does not match the code remains a central challenge. We address this on IBM heavy-hex superconducting processors by co-designing the…
We expand the class of holographic quantum error correcting codes by developing the notion of block perfect tensors, a wider class that includes previously defined perfect tensors. The relaxation of this constraint opens up a range of other…
Quantum computation holds the promise of solving certain complex problems exponentially faster than classical computers. However, the high prevalent noise in current quantum devices impedes the accurate execution of even basic algorithms.…