Corpus ID: 237563124

Quantum Lego: Building Quantum Error Correction Codes from Tensor Networks

@inproceedings{Cao2021QuantumLB,
  title={Quantum Lego: Building Quantum Error Correction Codes from Tensor Networks},
  author={ChunJun Cao and Brad Lackey},
  year={2021}
}
  • ChunJun Cao, Brad Lackey
  • Published 16 September 2021
  • Physics
We introduce a flexible and graphically intuitive framework that constructs complex quantum error correction codes from simple codes or states, generalizing code concatenation. More specifically, we represent the complex code constructions as tensor networks built from the tensors of simple codes or states in a modular fashion. Using a set of local moves known as operator pushing, one can derive properties of the more complex codes, such as transversal non-Clifford gates, by tracing the flow of… Expand
Local tensor-network codes
Tensor-network codes enable the construction of large stabilizer codes out of tensors describing smaller stabilizer codes. An application of tensor-network codes was an efficient and exact decoderExpand
Hyper-Invariant MERA: Approximate Holographic Error Correction Codes with Power-Law Correlations
We consider a class of holographic tensor networks that are efficiently contractible variational ansatze, manifestly (approximate) quantum error correction codes, and can support power-lawExpand
Magic State Distillation from Entangled States
Magic can be distributed non-locally in many-body entangled states, such as the low energy states of condensed matter systems. Using the Bravyi-Kitaev magic state distillation protocol, we find thatExpand
Constructing k-local parent Lindbladians for matrix product density operators
Matrix product density operators (MPDOs) are an important class of states with interesting properties. Consequently, it is important to understand how to prepare these states experimentally. OneExpand

References

SHOWING 1-10 OF 73 REFERENCES
Parallel decoding of multiple logical qubits in tensor-network codes.
TLDR
It is shown that, by using the parallel decoding scheme, the complexity is also linear in k, the number of logical qubits, which allows us to exactly contract tensor networks corresponding to codes with up to half a million qubits. Expand
Approximate Bacon-Shor Code and Holography
We construct an explicit and solvable toy model for the AdS/CFT correspondence in the form of an approximate quantum error correction code with a non-trivial center in the code subalgebra.Expand
Branching MERA codes: a natural extension of polar codes
TLDR
A new class of circuits for constructing efficiently decodable error-correction codes, based on a recently discovered contractible tensor network, is introduced, and the relation between classical and quantum error correction and the graphical calculus of tensor networks is described more in-depth. Expand
Holographic quantum error-correcting codes: toy models for the bulk/boundary correspondence
A bstractWe propose a family of exactly solvable toy models for the AdS/CFT correspondence based on a novel construction of quantum error-correcting codes with a tensor network structure. OurExpand
Majorana dimers and holographic quantum error-correcting codes
Holographic quantum error-correcting codes have been proposed as toy models that describe key aspects of the AdS/CFT correspondence. In this work, we introduce a versatile framework of MajoranaExpand
A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes
We study properties of stabilizer codes that permit a local description on a regular D-dimensional lattice. Specifically, we assume that the stabilizer group of a code (the gauge group for subsystemExpand
Continuous Symmetries and Approximate Quantum Error Correction
Quantum error correction and symmetry arise in many areas of physics, including many-body systems, metrology in the presence of noise, fault-tolerant computation, and holographic quantum gravity.Expand
Magic-state distillation with low overhead
We propose a new family of error detecting stabilizer codes with an encoding rate 1/3 that permit a transversal implementation of the pi/8-rotation $T$ on all logical qubits. The new codes are usedExpand
Tensor Networks and Quantum Error Correction
TLDR
A new family of quantum codes and decoding algorithms that generalize and improve upon quantum polar codes and successive cancellation decoding in a natural way are proposed. Expand
Operator quantum error-correcting subsystems for self-correcting quantum memories
The most general method for encoding quantum information is not to encode the information into a subspace of a Hilbert space, but to encode information into a subsystem of a Hilbert space. RecentlyExpand
...
1
2
3
4
5
...