Sparse quantum codes from quantum circuits

DOI10.1145/2746539.2746608MaRDI QIDQ2941522zbMATH OpenOpenAlexWikidataFDO

Authors Dave Morris Bacon, Aram W. Harrow, Jonathan Shi, Steven T. Flammia

Publication date 21 August 2015

Published in Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1411.3334

zbMATH Keywords

code distancegauge codeLDPCquantum error-correcting codesubsystem code

Mathematics Subject Classification ID

Quantum coding (general) (81P70)

Abstract: We describe a general method for turning quantum circuits into sparse quantum subsystem codes. The idea is to turn each circuit element into a set of low-weight gauge generators that enforce the input-output relations of that circuit element. Using this prescription, we can map an arbitrary stabilizer code into a new subsystem code with the same distance and number of encoded qubits but where all the generators have constant weight, at the cost of adding some ancilla qubits. With an additional overhead of ancilla qubits, the new code can also be made spatially local. Applying our construction to certain concatenated stabilizer codes yields families of subsystem codes with constant-weight generators and with minimum distance $d=n^{1-epsilon}$, where $epsilon=O(1/sqrtlogn)$. For spatially local codes in $D$ dimensions we nearly saturate a bound due to Bravyi and Terhal and achieve $d=n^{1-epsilon-1/D}$. Previously the best code distance achievable with constant-weight generators in any dimension, due to Freedman, Meyer and Luo, was $O(sqrtnlogn)$ for a stabilizer code.

Recommendations

• Sparse-Graph Codes for Quantum Error Correction
• Good approximate quantum LDPC codes from spacetime circuit Hamiltonians
• A note on the minimum distance of quantum LDPC codes
• Constructions of subsystem codes over finite fields
• EFFICIENT QUANTUM CIRCUITS FOR NON-QUBIT QUANTUM ERROR-CORRECTING CODES

Cites work

• Approximate distance oracles
• Approximate distance oracles with constant query time
• Automata, Languages and Programming
• Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
• Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
• Fast C-K-R partitions of sparse graphs
• Near-Linear Time Construction of Sparse Neighborhood Covers
• On approximate distance labels and routing schemes with affine stretch
• On sparse spanners of weighted graphs
• Ramsey partitions and proximity data structures
• Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
• Shortest-path queries in static networks

Cited in

(8)

• On quantum SPC product codes
• Holographic quantum error-correcting codes: toy models for the bulk/boundary correspondence
• Feedback iterative decoding of sparse quantum codes
• Sparse-Graph Codes for Quantum Error Correction
• Quantum codes from high-dimensional manifolds
• Good approximate quantum LDPC codes from spacetime circuit Hamiltonians
• A proposal for self-correcting stabilizer quantum memories in 3 dimensions (or slightly less)
• Towards local testability for quantum coding

Describes a project that uses

Uses Software

• Graphs

This page was built for publication: Sparse quantum codes from quantum circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2941522)