Quantum error-correcting codes associated with graphs

Abstract

We present a construction scheme for quantum error correcting codes. The basic ingredients are a graph and a finite abelian group, from which the code can explicitly be obtained. We prove necessary and sufficient conditions for the graph such that the resulting code corrects a certain number of errors. This allows a simple verification of the 1-error correcting property of fivefold codes in any dimension. As new examples we construct a large class of codes saturating the singleton bound, as well as a tenfold code detecting 3 errors.

8 pages revtex, 5 figures

Cited by in corpus (197)

• Area laws for the entanglement entropy - a review
• Measurement-based quantum computation with cluster states
• Multi-party entanglement in graph states
• Experimental entanglement of six photons in graph states
• Graph States for Quantum Secret Sharing
• Multipartite entanglement, quantum-error-correcting codes, and entangling power of quantum evolutions
• Valence Bond Solids for Quantum Computation
• Entanglement purification and quantum error correction
• Stability of macroscopic entanglement under decoherence
• Fundamentals of Quantum Information Theory
• Open-System Dynamics of Entanglement
• Most quantum states are too entangled to be useful as computational resources
• Experimental Analysis of a 4-Qubit Cluster State
• Novel schemes for measurement-based quantum computation
• Contextuality in Measurement-based Quantum Computation
• Measurement-based quantum computation beyond the one-way model
• Bell Inequalities for Graph States
• Experimental demonstration of topological error correction
• Multiparticle entanglement purification for graph states
• Quantitative entanglement witnesses
• Quantum information splitting using multi-partite cluster states
• Experimental realization of one-way quantum computing with two-photon four-qubit cluster states
• Nonlocality of cluster states of qubits
• Entanglement properties of multipartite entangled states under the influence of decoherence
• Popescu-Rohrlich correlations as a unit of nonlocality
• Quantum Hypergraph States
• Fast simulation of stabilizer circuits using a graph state representation
• Experimental demonstration of graph-state quantum secret sharing
• Genuinely multipartite entangled states and orthogonal arrays
• Index theory of one dimensional quantum walks and cellular automata
• Stabilizer states and Clifford operations for systems of arbitrary dimensions, and modular arithmetic
• Unified derivations of measurement-based schemes for quantum computation
• Multiparticle entanglement purification for two-colorable graph states
• Realization and characterization of a 2-photon 4-qubit linear cluster state
• Experimental demonstration of a graph state quantum error-correction code
• Quantum autoencoders to denoise quantum data
• Experimental Entanglement and Nonlocality of a Two-Photon Six-Qubit Cluster State
• Error protected qubits in a silicon photonic chip
• All Maximally Entangled Four Qubits States
• Quantum Error Correcting Codes Using Qudit Graph States
• Prospects for measurement-based quantum computing with solid state spins
• Tema Con Variazioni: Quantum Channel Capacity
• Distributing Graph States Over Arbitrary Quantum Networks
• Graphs, Quadratic Forms, and Quantum Codes
• Correlations, spectral gap, and entanglement in harmonic quantum systems on generic lattices
• Graph States as a Resource for Quantum Metrology
• Experimental Realization of a Controlled-NOT Gate with Four-Photon Six-Qubit Cluster States
• On the Classification of All Self-Dual Additive Codes over GF(4) of Length up to 12
• Catalysis and activation of magic states in fault tolerant architectures
• Graphical Nonbinary Quantum Error-Correcting Codes
• Entanglement Witnesses for Graph States: General Theory and Examples
• On measurement-based quantum computation with the toric code states
• General framework for verifying pure quantum states in the adversarial scenario
• Efficient Verification of Hypergraph States
• Standard Form of Qudit Stabilizer Groups
• Potential and limits to cluster state quantum computing using probabilistic gates
• Open-system dynamics of graph-state entanglement
• Distillation of multipartite entanglement by complementary stabilizer measurements
• Two-setting Bell Inequalities for Graph States
• Nonadditive quantum error-correcting code
• Entangled graphs: Bipartite entanglement in multi-qubit systems
• Six-qubit two-photon hyperentangled cluster states: characterization and application to quantum computation
• Quantum computational webs
• Large-scale quantum networks based on graphs
• On $[[n,n-4,3]{]}_q$ Quantum MDS Codes for odd prime power $q$
• Optical generation of matter qubit graph states
• Approximate quantum error correction for generalized amplitude damping errors
• Detecting multipartite entanglement structure with minimal resources
• Entanglement Purification of Any Stabilizer State
• Multipartite entanglement in four-qubit cluster-class states
• Optimal preparation of graph states
• Quantum Router with Network Coding
• Photonic resource state generation from a minimal number of quantum emitters
• Optimal quantum state reconstruction for cold trapped ions
• Noisy entanglement evolution for graph states
• Local unitary versus local Clifford equivalence of stabilizer and graph states
• Optimal verification of stabilizer states
• Photonic graph state generation from quantum dots and color centers for quantum communications
• Mapping graph state orbits under local complementation
• Greenberger-Horne-Zeilinger paradoxes from qudit graph states
• Entanglement in eight-qubit graph states
• Solutions of modular bootstrap constraints from quantum codes
• Securing quantum networking tasks with multipartite Einstein-Podolsky-Rosen steering
• Effective noise channels for encoded quantum systems
• A Resource Efficient Source of Multi-photon Polarization Entanglement
• Stability of encoded macroscopic quantum superpositions
• On Self-Dual Quantum Codes, Graphs, and Boolean Functions
• Growth of graph states in quantum networks
• Quantum error correction codes and absolutely maximally entangled states
• Natural three-qubit interactions in one-way quantum computing
• Deterministic generation of multidimensional photonic cluster states using time-delay feedback
• Synthesis of and compilation with time-optimal multi-qubit gates
• Entanglement-assisted codeword stabilized quantum codes
• Minimal resources for linear optical one-way computing
• Graphical description of the action of Clifford operators on stabilizer states
• Deterministic generation of entangled photonic cluster states from quantum dot molecules
• Graph states and local unitary transformations beyond local Clifford operations
• Hard limits on the postselectability of optical graph states
• Graph Concatenation for Quantum Codes
• Identification of networking quantum teleportation on 14-qubit IBM universal quantum computer
• Characterization of entanglement on superconducting quantum computers of up to 414 qubits
• Macroscopic bound entanglement in thermal graph states
• Non-Additive Quantum Codes from Goethals and Preparata Codes
• Topological graph states and quantum error correction codes
• Robust Self-Testing of Multiparticle Entanglement
• Measurement based quantum communication with resource states generated by entanglement purification
• A scheme for tunable quantum phase gate and effective preparation of graph-state entanglement
• Demonstration of a programmable source of two-photon multiqubit entangled states
• Local complementation rule for continuous-variable four-mode unweighted graph states
• Directed Graph Representation of Half-Rate Additive Codes over GF(4)
• On Strong Monogamy Conjecture in Four-Qubit System
• Graph-theoretical optimization of fusion-based graph state generation
• Location of quantum information in additive graph codes
• Derandomizing quantum circuits with measurement based unitary designs
• On Weak Odd Domination and Graph-based Quantum Secret Sharing
• Generalized Graph States Based on Hadamard Matrices
• Geometric measure of entanglement of multi-qubit graph states and its detection on a quantum computer
• Quantum Error-Correcting Codes over Mixed Alphabets
• Transformations of Stabilizer States in Quantum Networks
• Measuring the parity of an $N$-qubit state
• Noisy Stabilizer Formalism
• A direct approach to fault-tolerance in measurement-based quantum computation via teleportation
• Arboreal Bound Entanglement
• Qudit hypergraph states and their properties
• Compact set of invariants characterizing graph states of up to eight qubits
• Entanglement of graph states up to 8 qubits
• Entropic uncertainty relations and the stabilizer formalism
• Applications of Universal Parity Quantum Computation
• Experimental Test of Bell inequalities with Six-Qubit Graph States
• Complexity of Graph State Preparation
• Analysis of quantum error correction with symmetric hypergraph states
• Calculating Concentratable Entanglement in Graph States
• Symmetric hypergraph states: Entanglement quantification and robust Bell nonlocality
• Graph states in phase space
• A generic framework for genuine multipartite entanglement detection
• Graph state basis for Pauli Channels
• Interference in discrete Wigner functions
• Scalable Bell inequalities for graph states of arbitrary prime local dimension and self-testing
• Parity Quantum Computing as YZ-Plane Measurement-Based Quantum Computing
• Some Ulam's reconstruction problems for quantum states
• Coherent driving of direct and indirect excitons in a quantum dot molecule
• Generalized Concatenation for Quantum Codes
• Parafermion stabilizer codes
• Quantum stabilizer codes and beyond
• How to correct small quantum errors
• On the error analysis of quantum repeaters with encoding
• Geometric properties of evolutionary graph states and their detection on a quantum computer
• Classical spin systems and the quantum stabilizer formalism: general mappings and applications
• Multipartite entanglement and quantum error identification in $D$-dimensional cluster states
• Construction of optimal resources for concatenated quantum protocols
• Rank Reduction for the Local Consistency Problem
• Scheme for constructing graphs associated with stabilizer quantum codes
• Entanglement of multi-qubit states representing directed networks and its detection with quantum computing
• Exclusivity structures and graph representatives of local complementation orbits
• Percolation in quantum computation and communication
• Interlace Polynomials: Enumeration, Unimodality, and Connections to Codes
• Quantum Random State Generation with Predefined Entanglement Constraint
• Shaded Tangles for the Design and Verification of Quantum Programs (Extended Abstract)
• Scalable noncontextuality inequalities and certification of multiqubit quantum systems
• A New Model for Fractons, Fluxons, and Freeons
• Engineering holography with stabilizer graph codes
• Identifying non-k-separability of a class of N-qubit complete graph states using correlation tensors
• Shaded tangles for the design and verification of quantum circuits
• Stabilizer states and local realism
• Topos logic in measurement-based quantum computation
• Determining X-chains in graph states
• Universal graph representation of stabilizer codes
• A unifying primary framework for quantum graph neural networks from quantum graph states
• Clifford Manipulations of Stabilizer States: A graphical rule book for Clifford unitaries and measurements on cluster states, and application to photonic quantum computing
• Learning quantum graph states with product measurements
• Tensor Rank and Other Multipartite Entanglement Measures of Graph States
• Demonstration of teleportation across a quantum network code
• Monogamy Relations for Multiqubit Systems
• Non-symmetric GHZ states: weighted hypergraph and controlled-unitary graph representations
• Small quantum networks in the qudit stabilizer formalism
• Generation of frequency-bin-encoded dual-rail cluster states via time-frequency multiplexing of microwave photonic qubits
• Robustness of Bell Violation of Graph States to Qubit Loss
• The Study of Entangled States in Quantum Computation and Quantum Information Science
• From Graph States to Two-Graph States
• Entanglement-assisted codeword stabilized quantum codes with imperfect ebits
• Dissipative engineering a tripartite Greenberger-Horne-Zeilinger state for neutral atoms
• Studies of properties of bipartite graphs with quantum programming
• Logic Functions and Quantum Error Correcting Codes
• On the relation between a graph code and a graph state
• Maximally nonlocal subspaces
• Experimental generation of tripartite telecom photons via an atomic ensemble and a nonlinear waveguide
• Bounds on the number of time steps for simulating arbitrary interaction graphs
• Hierarchical Generation and Design of Tree-Codes for Resource-Efficient Loss-Tolerant Quantum Communications
• Fluxon-based generation of graph states in Josephson qubits
• Separable Operations, Graph Codes and the Location of Quantum Information
• Stabilizer Quantum Codes: A Unified View based on Forney-style Factor Graphs
• Efficient tomography of microwave photonic cluster states
• Maximally symmetric stabilizer MUBs in even prime-power dimensions
• Protecting Information Against Computational Errors and Quantum Erasures via Concatenation
• Geometric Graph-Theoretic Aspects of Quantum Stabilizer Codes
• Phase Transitions and Noise Robustness of Quantum Graph States
• Hybrid Reward-Driven Reinforcement Learning for Efficient Quantum Circuit Synthesis