Related papers: Logical operator tradeoff for local quantum codes
Haah's cubic code is the prototypical type-II fracton topological order. It instantiates the no string-like operator property that underlies the favorable scaling of its code distance and logical energy barrier. Previously, the cubic code…
A leading twist expansion in terms of bilocal operators is proposed for the structure functions of deeply inelastic scattering near the elastic limit $x \to 1$, which is also applicable to a range of other hard quasi-elastic processes.…
The local bounded commuting projection operators of nonstandard finite element de Rham complexes in two and three dimensions are constructed systematically. The assumptions of the main result are mild and can be verified. For three…
Practical quantum computing will require error rates that are well below what is achievable with physical qubits. Quantum error correction offers a path to algorithmically-relevant error rates by encoding logical qubits within many physical…
The topological surface code is a leading candidate for harnessing long-range entanglement to protect logical quantum information against errors, and teleportation of logical states is desirable for robust quantum information processing.…
Local decoders, also known as cellular-automaton decoders, offer a promising path toward real-time quantum error correction by replacing centralized classical decoding, with inherent hardware constraints, by a natively parallel and…
We present a comprehensive and self-contained simplified review of the quantum computing scheme of Phys. Rev. Lett. 98, 190504 (2007), which features a 2-D nearest neighbor coupled lattice of qubits, a threshold error rate approaching 1%,…
Geometrically local quantum codes, which are error correction codes embedded in $\mathbb{R}^D$ with checks acting only on qubits within a fixed spatial distance, have garnered significant interest. Recently, it has been demonstrated how to…
The family of hyperbolic surface codes is one of the rare families of quantum LDPC codes with non-zero rate and unbounded minimum distance. First, we introduce a family of hyperbolic color codes. This produces a new family of quantum LDPC…
Implementing nonlocal unitary operators is an important and hard question in quantum computing and cryptography. We show that any bipartite nonlocal unitary operator of Schmidt rank three on the $(d_A \times d_B)$-dimensional system is…
Quantum error-correcting codes with high encoding rate are good candidates for large-scale quantum computers as they use physical qubits more efficiently than codes of the same distance that encode only a few logical qubits. Some logical…
The problem of construction of projection operators on eigen-subspaces of symmetry operators is considered. This problem arises in many approximate methods for solving time-independent and time-dependent quantum problems, and its solution…
We study how well topological quantum codes can tolerate coherent noise caused by systematic unitary errors such as unwanted $Z$-rotations. Our main result is an efficient algorithm for simulating quantum error correction protocols based on…
Qubit shuttling has become an indispensable ingredient for scaling leading quantum computing platforms, including semiconductor spin, neutral-atom, and trapped-ion qubits, enabling both crosstalk reduction and tighter integration of control…
The two-dimensional color code is an alternative to the toric code that encodes more logical qubits while maintaining crucial features of the $\mathbb{Z}_2\times\mathbb{Z}_2$ toric code in the long wavelength limit. However its short range…
Instead of a quantum computer where the fundamental units are 2-dimensional qubits, we can consider a quantum computer made up of d-dimensional systems. There is a straightforward generalization of the class of stabilizer codes to…
We show that no stabilizer codes over any local dimension can support a non-trivial area operator for any bipartition of the physical degrees of freedom even if certain code subalgebras contain non-trivial centers. This conclusion also…
We prove that 3-query linear locally correctable codes over the Reals of dimension $d$ require block length $n>d^{2+\lambda}$ for some fixed, positive $\lambda >0$. Geometrically, this means that if $n$ vectors in $R^d$ are such that each…
Error correcting codes protect quantum information and form the basis of fault tolerant quantum computing. Leading proposals for fault-tolerant quantum computation require codes with an exceedingly rare property, a transverse non-Clifford…
Traditional stabilizer codes operate over prime power local-dimensions. In this work we extend the stabilizer formalism using the local-dimension-invariant setting to import stabilizer codes from these standard local-dimensions to other…