Related papers: Graph Concatenation for Quantum Codes
In this work, we present a novel method to express the stabilizer of a k-uniform complete hypergraph state as a linear combination of local operators. Quantum hypergraph states generalize graph states and exhibit properties that are not…
Quantum error-correcting codes with good parameters can be constructed by evaluating polynomials at the roots of the polynomial trace. In this paper, we propose to evaluate polynomials at the roots of trace-depending polynomials (given by a…
Implementing robust quantum error correction (QEC) is imperative for harnessing the promise of quantum technologies. We introduce a framework that takes {\it any} classical code and explicitly constructs the corresponding QEC code. Our…
We introduce tile codes, a simple yet powerful way of constructing quantum codes that are local on a planar 2D-lattice. Tile codes generalize the usual surface code by allowing for a bit more flexibility in terms of locality and stabilizer…
The de Bruijn graph, its sequences, and their various generalizations, have found many applications in information theory, including many new ones in the last decade. In this paper, motivated by a coding problem for emerging memory…
We introduce and study a mathematical framework for a broad class of regularization functionals for ill-posed inverse problems: Regularization Graphs. Regularization graphs allow to construct functionals using as building blocks linear…
Topological quantum error-correcting codes are defined by geometrically local checks on a two-dimensional lattice of quantum bits (qubits), making them particularly well suited for fault-tolerant quantum information processing. Here, we…
The most efficient automated way to construct a large class of quantum photonic experiments is via abstract representation of graphs with certain properties. While new directions were explored using Artificial intelligence and SAT solvers…
We show that within any quantum stabilizer code there lurks a classical binary linear code with similar error-correcting capabilities, thereby demonstrating new connections between quantum codes and classical codes. Using this result --…
We construct a bosonic quantum field on a general quantum graph. Consistency of the construction leads to the calculation of the total scattering matrix of the graph. This matrix is equivalent to the one already proposed using generalized…
We formulate a bounded distance decoding strategy applicable to all stabilizer codes including both CSS and non-CSS code-families. The framework emerges out of the local Clifford equivalence between arbitrary stabilizer states and graph…
In a balanced graph decomposition, every vertex of the host graph appears in the same number of blocks. We propose the use of colored loops as a framework for unifying various other types of local balance conditions in graph decompositions.…
Graph states are quantum states that can be described by a stabilizer formalism and play an important role in quantum information processing. We consider the action of local unitary operations on graph states and hypergraph states. We focus…
Quantum computers have the potential to provide exponential speedups over their classical counterparts. Quantum principles are being applied to fields such as communications, information processing, and artificial intelligence to achieve…
Graph compositions generalize both integer compositions and partitions of a finite set. We develop formulas, generating functions and recurrence relations for composition counting functions for several families of graphs.
An m-uniform quantum state on n qubits is an entangled state in which every m-qubit subsystem is maximally mixed. Starting with an m-uniform state realized as the graph state associated with an m-regular graph, and a classical [n,k,d \ge…
Quantum synchronizable codes are quantum error correcting codes that can correct not only Pauli errors but also errors in block synchronization. The code can be constructed from two classical cyclic codes $\mathcal{C}$, $\mathcal{D}$…
A range of quantum algorithms, especially those leveraging variational parameterization and circuit-based optimization, are being studied as alternatives for solving classically intractable combinatorial optimization problems (COPs).…
Quantum convolutional code was introduced recently as an alternative way to protect vital quantum information. To complete the analysis of quantum convolutional code, I report a way to decode certain quantum convolutional codes based on the…
Chord diagrams on circles and their intersection graphs (also known as circle graphs) have been intensively studied, and have many applications to the study of knots and knot invariants, among others. However, chord diagrams on more general…