Related papers: Lee Weight for Nonbinary Quantum Error Correction
We present a quantum error correcting code that is invariant under the conditional time evolution between spontaneous emissions and which can correct for one general error. The code presented here generalizes previous error correction codes…
Quantum computation must be performed in a fault-tolerant manner to be realizable in practice. Recent progress has uncovered quantum error-correcting codes with sparse connectivity requirements and constant qubit overhead. Existing schemes…
We evaluate quantum gravity corrections to the standard model Higgs potential $V(\phi)$ a la Coleman-Weinberg and examine the stability question of $V(\phi)$ at scales of Planck mass $M_{\rm Pl}$. We compute the gravity one-loop corrections…
A quantum error-correcting code is defined to be a unitary mapping (encoding) of k qubits (2-state quantum systems) into a subspace of the quantum state space of n qubits such that if any t of the qubits undergo arbitrary decoherence, not…
We calculate the error threshold for the linear optics quantum computing proposal by Knill, Laflamme and Milburn [Nature 409, pp. 46--52 (2001)] under an error model where photon detectors have efficiency <100% but all other components --…
We show in this paper that a strong and easy connection exists between quantum error correction and Lattice Gauge Theories (LGT) by using the Gauge symmetry to construct an efficient error-correcting code for Abelian LGTs. We identify the…
We introduce a convergent iterative algorithm for finding the optimal coding and decoding operations for an arbitrary noisy quantum channel. This algorithm does not require any error syndrome to be corrected completely, and hence also finds…
We present a generalization of quantum error correction to infinite-dimensional Hilbert spaces. The generalization yields new classes of quantum error correcting codes that have no finite-dimensional counterparts. The error correction…
To perform reliable quantum computation, quantum error correction is indispensable. In certain cases, continuous covariance symmetry of the physical system can make exact error correction impossible. In this work we study the approximate…
Quantum simulations of Lattice Gauge Theories (LGTs) are often formulated on an enlarged Hilbert space containing both physical and unphysical sectors in order to retain a local Hamiltonian. We provide simple fault-tolerant procedures that…
We introduce the concept of quantum weight as a fundamental property of insulating states of matter that is encoded in the ground-state static structure and measures quantum fluctuation in electrons' center of mass. We find a sum rule that…
In multiparameter quantum metrology, the weighted-arithmetic-mean error of estimation is often used as a scalar cost function to be minimized during design optimization. However, other types of mean error can reveal different facets of…
The Gilbert-Varshamov bound (non-constructively) establishes the existence of binary codes of distance $1/2 -\epsilon$ and rate $\Omega(\epsilon^2)$ (where an upper bound of $O(\epsilon^2\log(1/\epsilon))$ is known). Ta-Shma [STOC 2017]…
We propose an error correction coding algorithm for continuous quantum variables. We use this algorithm to construct a highly efficient 5-wavepacket code which can correct arbitrary single wavepacket errors. We show that this class of…
In this note we show that the weight enumerators of a real quantum error correcting code with $ X $ and $ Z $ exactly transversal must satisfy certain identities. One consequence of these identities is that if the code is error detecting…
While quantum computers are naturally well-suited to implementing linear operations, it is less clear how to implement nonlinear operations on quantum computers. However, nonlinear subroutines may prove key to a range of applications of…
In order to solve the problem of non-ideal training sets (i.e., the less-complete or over-complete sets) and implement one-iteration learning, a novel efficient quantum perceptron algorithm based on unitary weights is proposed, where the…
The error correcting capabilities of the Calderbank-Shor-Steane [[7,1,3]] quantum code, together with a fault-tolerant syndrome extraction by means of several ancilla states, have been numerically studied. A simple probability expression to…
Threshold theorems for fault-tolerant quantum computing assume that errors are of certain types. But how would one detect whether errors of the "wrong" type occur in one's experiment, especially if one does not even know what type of error…
The Learning-With-Errors (LWE) problem is a fundamental computational challenge with implications for post-quantum cryptography and computational learning theory. Here we propose a quantum-classical hybrid algorithm with Ising model to…