Related papers: Approximate Quantum Codes From Long Wormholes
We investigate two sparse Sachdev-Ye-Kitaev (SYK) systems coupled by a bilinear term as a holographic quantum mechanical description of an eternal traversable wormhole in the low temperature limit. Each SYK system consists of $N$ Majorana…
We analyze the long time behavior of a quantum computer running a quantum error correction (QEC) code in the presence of a correlated environment. Starting from a Hamiltonian formulation of realistic noise models, and assuming that QEC is…
We study the encoding complexity for quantum error correcting codes with large rate and distance. We prove that random Clifford circuits with $O(n \log^2 n)$ gates can be used to encode $k$ qubits in $n$ qubits with a distance $d$ provided…
Quantum metrology aims to exploit many-body quantum states to achieve parameter-estimation precision beyond the standard quantum limit. For unitary parameter encoding generated by local Hamiltonians, such enhancement is characterized by…
In this paper we present several classes of asymptotically good concatenated quantum codes and derive lower bounds on the minimum distance and rate of the codes. We compare these bounds with the best-known bound of…
In adversarial settings, where attackers can deliberately and strategically corrupt quantum data, standard quantum error correction reaches its limits. It can only correct up to half the code distance and must output a unique answer.…
One central theme in quantum error-correction is to construct quantum codes that have a large minimum distance. In this paper, we first present a construction of classical codes based on certain class of polynomials. Through these classical…
It is well known that no quantum error correcting code of rate $R$ can correct adversarial errors on more than a $(1-R)/4$ fraction of symbols. But what if we only require our codes to *approximately* recover the message? We construct…
Bosonic codes with rotational symmetry are currently one of the best performing quantum error correcting codes. Little is known about error propagation and code distance for these rotation codes in contrast with qubit codes and Bosonic…
We derive necessary and sufficient conditions for the approximate correctability of a quantum code, generalizing the Knill-Laflamme conditions for exact error correction. Our measure of success of the recovery operation is the worst-case…
The low-energy subspace of a conformal field theory (CFT) can serve as a quantum error correcting code, with important consequences in holography and quantum gravity. We consider generic 1+1D CFT codes under extensive local dephasing…
We analyze the error correcting properties of the Sachdev-Ye-Kitaev model, with errors that correspond to erasures of subsets of fermions. We study the limit where the number of fermions erased is large but small compared to the total…
The problem of finding quantum error-correcting codes is transformed into the problem of finding additive codes over the field GF(4) which are self-orthogonal with respect to a certain trace inner product. Many new codes and new bounds are…
We construct a family of quantum low-density parity-check codes locally equivalent to higher-dimensional quantum hypergraph-product (QHP) codes. Similarly to QHP codes, the proposed codes have highly redundant sets of low-weight stabilizer…
In this paper, two classes of quantum MDS codes are constructed. The main tools are multiplicative structures on finite fields. Carefully choosing different cosets can make the corresponding generalized Reed-Solomon codes Hermitian…
It is commonly believed that logical states of quantum error-correcting codes have to be highly entangled such that codes capable of correcting more errors require more entanglement to encode a qubit. Here, we show that the validity of this…
Quantum synchronizable error-correcting codes are special quantum error-correcting codes that are designed to correct both the effect of quantum noise on qubits and misalignment in block synchronization. It is known that in principle such a…
We demonstrate that a high fidelity approximation to $| \Psi_b \rangle$, the quantum superposition over all bit strings within Hamming distance $b$ of the codewords of a dimension-$k$ linear code over $\mathbb{Z}_2^n$, can be efficiently…
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…
We study some general properties of coupled quantum systems. We consider simple interactions between two copies of identical Hamiltonians such as the SYK model, Pauli spin chains with random magnetic field and harmonic oscillators. Such…