Engineering holography with stabilizer graph codes
@inproceedings{Munne2022EngineeringHW, title={Engineering holography with stabilizer graph codes}, author={Gerard Angles Munn'e and Valentin Kasper and Felix Huber}, year={2022} }
The discovery of holographic codes established a surprising connection between quantum error correction and the AdS/CFT correspondence. Recent technological progress in artificial quantum systems renders the experimental realization of such holographic codes now within reach. Formu-lating the hyperbolic pentagon code in terms of a stabilizer graph code, we propose an experimental implementation that is tailored to systems with long-range interactions. We show how to obtain encoding and decoding…
Figures from this paper
References
SHOWING 1-10 OF 43 REFERENCES
Calderbank-Shor-Steane holographic quantum error-correcting codes
- Computer SciencePhysical Review A
- 2018
The self-dual Calderbank-Shor-Steane (CSS) heptagon holographic code is introduced, based on the 7-qubit Steane code, to expand the class of holographic quantum error-correcting codes by developing the notion of block perfect tensors.
Decoding holographic codes with an integer optimization decoder
- Computer Science
- 2020
A most likely error Pauli error decoding algorithm for stabilizer codes based on general purpose integer optimization is developed and numerical evidence for thresholds against Pauli errors for bulk qubits is found.
Holographic quantum error-correcting codes: toy models for the bulk/boundary correspondence
- Computer Science
- 2015
That bulk logical operators can be represented on multiple boundary regions mimics the Rindlerwedge reconstruction of boundary operators from bulk operators, realizing explicitly the quantum error-correcting features of AdS/CFT recently proposed in [1].
Fault-Tolerant Logical Gates in Holographic Stabilizer Codes Are Severely Restricted
- Computer SciencePRX Quantum
- 2021
It is shown that the set of transversally implementable logical operations is contained in the Clifford group for sufficiently localized logical subsystems, and it is argued that this restriction naturally arises in any stabilizer subsystem code that comes close to capturing certain properties of holography.
Quantum information scrambling: from holography to quantum simulators
- PhysicsThe European Physical Journal C
- 2022
In this review, we present the ongoing developments in bridging the gap between holography and experiments. To this end, we discuss information scrambling and models of quantum teleportation via…
Holographic tensor network models and quantum error correction: a topical review
- PhysicsQuantum Science and Technology
- 2021
Recent progress in studies of holographic dualities, originally motivated by insights from string theory, has led to a confluence with concepts and techniques from quantum information theory. A…
Quantum error correction via codes over GF(4)
- Computer Science, PhysicsProceedings of IEEE International Symposium on Information Theory
- 1997
In the present paper the problem of finding quantum-error-correcting codes is transformed into one of finding additive codes over the field GF(4) which are self-orthogonal with respect to a certain trace inner product.
Graph concatenation for quantum codes
- Computer Science
- 2009
Graphs are closely related to quantum error-correcting codes: every stabilizer code is locally equivalent to a graph code and every codeword stabilized code can be described by a graph and a…
Quantum error-correction codes and absolutely maximally entangled states
- Computer SciencePhysical Review A
- 2020
In this network, it is shown how corrections arise to the Ryu-Takayanagi formula in the case of entangled input state, and that the bound on the entanglement entropy of the boundary state is saturated for absolutely maximally entangled input states.
Graph states and local unitary transformations beyond local Clifford operations
- Mathematics
- 2016
This work focuses on non-Clifford operations and finds for certain transformations a graphical description in terms of weighted hypergraphs that leads to the indentification of hypergraph states that are locally equivalent to graph states.