Related papers: Fidelity Lower Bounds for Stabilizer and CSS Quant…
We introduce a purely graph-theoretical object, namely the coding clique, to construct quantum errorcorrecting codes. Almost all quantum codes constructed so far are stabilizer (additive) codes and the construction of nonadditive codes,…
We derive a simple and general relation between the fidelity of quantum motion, characterizing the stability of quantum dynamics with respect to arbitrary static perturbation of the unitary evolution propagator, and the integrated time…
The stability of quantum systems to perturbations of the Hamiltonian is studied. This stability is quantified by the fidelity. Dependence of fidelity on the initial state as well as on the dynamical properties of the system is considered.…
We initiate the study of quantum Locally Testable Codes (qLTCs). We provide a definition together with a simplification, denoted sLTCs, for the special case of stabilizer codes, together with some basic results using those definitions. The…
As in classical coding theory, quantum analogues of low-density parity-check (LDPC) codes have offered good error correction performance and low decoding complexity by employing the Calderbank-Shor-Steane (CSS) construction. However,…
In fault-tolerant quantum computing, quantum algorithms are implemented through quantum circuits capable of error correction. These circuits are typically constructed based on specific quantum error correction codes, with consideration…
In this work, we explore a new approach to designing both algorithms and error detection codes for preparing approximate ground states of molecules. We propose a classical algorithm to find the optimal stabilizer state by using excitations…
In this paper, we prove a lower bound on the soundness of quantum locally testable codes under the distance balancing construction of Evra et al. arXiv:2004.07935 [quant-ph]. Our technical contribution is that the new soundness of the…
Fidelity is a fundamental measure for the closeness of two quantum states, which is important both from a theoretical and a practical point of view. Yet, in general, it is difficult to give good estimates of fidelity, especially when one…
With the continued scaling of quantum processors, holistic benchmarks are essential for extensively evaluating device performance. Layer fidelity is a benchmark well-suited to assessing processor performance at scale. Key advantages of this…
We propose a scheme for detecting and correcting faults in any Clifford circuit. The scheme is based on the observation that the set of all possible outcome bit-strings of a Clifford circuit is a linear code, which we call the outcome code.…
Soon after the dawn of quantum error correction, DiVincenzo and Peres observed that stabilizer codewords could give rise to simple proofs of quantumness via contextuality. This discovery can be recast in the language of nonlocal games:…
The stabilizer code is the most general algebraic construction of quantum error-correcting codes proposed so far. A stabilizer code can be constructed from a self-orthogonal subspace of a symplectic space over a finite field. We propose a…
Surface codes based on stabilizer circuits may pave the way for large scale fault-tolerant quantum computation. The surface code uses only single- and two-qubit gates and the error threshold falls close to 1% for a large range of errors.…
We construct rotated logical states by applying rotation operators to stabilizer states, extending the logical basis and modifying stabilizer generators. Rotation operators affect the effective code distance $d_R$, which decays…
Spatially-coupled LDPC codes are known to have excellent asymptotic properties. Much less is known regarding their finite-length performance. We propose a scaling law to predict the error probability of finite-length spatially-coupled…
We present analytic estimates of the performances of various approximate quantum error correction schemes for the generalized amplitude damping (GAD) qubit channel. Specifically, we consider both stabilizer and nonadditive quantum codes.…
We analyze and study the effects of locality on the fault-tolerance threshold for quantum computation. We analytically estimate how the threshold will depend on a scale parameter r which estimates the scale-up in the size of the circuit due…
We propose a nonuniform quantized decoder for polar codes. The design metric of the quantizers is to minimize the distortion incurred by quantization. The quantizers are obtained via dynamic programming and the optimality of the quantizer…
Efficiently realizing logical operations on general stabilizer codes remains a long-standing challenge in fault tolerant quantum computing. While code surgery provides a general framework with provable guarantees by joint logical…