Related papers: No quantum Ramsey theorem for stabilizer codes
We introduce a class of multiqubit quantum states which generalizes graph states. These states correspond to an underlying mathematical hypergraph, i.e. a graph where edges connecting more than two vertices are considered. We derive a…
Perturbation theories provide valuable insights on quantum many-body systems. Systems of interacting particles, like electrons, are often treated perturbatively around exactly solvable Gaussian points. Systems of interacting qubits have…
We introduce and explicitly construct a quantum code we coin a "Pauli Manipulation Detection" code (or PMD), which detects every Pauli error with high probability. We apply them to construct the first near-optimal codes for two tasks in…
We analyze the quantum evolution represented by a time-dependent family of generalized Pauli channels. This evolution is provided by the random decoherence channels with respect to the maximal number of mutually unbiased bases. We derive…
We consider design of the quantum stabilizer codes via a two-step, low-complexity approach based on the framework of codeword-stabilized (CWS) codes. In this framework, each quantum CWS code can be specified by a graph and a binary code.…
In quantum coding theory, stabilizer codes are probably the most important class of quantum codes. They are regarded as the quantum analogue of the classical linear codes and the properties of stabilizer codes have been carefully studied in…
Given their potential for fault-tolerant operations, topological quantum states are currently the focus of intense activity. Of particular interest are topological quantum error correction codes, such as the surface and planar stabilizer…
We develop analytical and algorithmic techniques that enable efficient simulation of a broad class of noisy stabilizer circuits. We derive closed-form expressions of expectation values for tensor product of Paulis in circuits with…
The stable Ramsey's theorem for pairs has been the subject of numerous investigations in mathematical logic. We introduce a weaker form of it by restricting from the class of all stable colorings to subclasses of it that are non-null in a…
The quantum logic gates used in the design of a quantum computer should be both universal, meaning arbitrary quantum computations can be performed, and fault-tolerant, meaning the gates keep errors from cascading out of control. A number of…
Bell inequalities constitute a key tool in quantum information theory: they not only allow one to reveal nonlocality in composite quantum systems, but, more importantly, they can be used to certify relevant properties thereof. We provide a…
Typical studies of quantum error correction assume probabilistic Pauli noise, largely because it is relatively easy to analyze and simulate. Consequently, the effective logical noise due to physically realistic coherent errors is relatively…
Statistical verification of a quantum state aims to certify whether a given unknown state is close to the target state with confidence. So far, sample-optimal verification protocols based on local measurements have been found only for…
The Turaev-Viro invariant for a closed 3-manifold is defined as the contraction of a certain tensor network. The tensors correspond to tetrahedra in a triangulation of the manifold, with values determined by a fixed spherical category. For…
The class of entangled $N$-qubit states known as graph states, and the corresponding stabilizer groups of $N$-qubit Pauli observables, have found a wide range of applications in quantum information processing and the foundations of quantum…
We study, by means of the stabilizer formalism, a quantum error correcting code which is alternative to the standard block codes since it embeds a qubit into a qudit. The code exploits the non-commutative geometry of discrete phase space to…
The "noncommutative graphs" which arise in quantum error correction are a special case of the quantum relations introduced in [N. Weaver, Quantum relations, Mem. Amer. Math. Soc. 215 (2012), v-vi, 81-140]. We use this perspective to…
Protecting information in systems that have more than two basis states (qudits) not only offers a promising route for reducing the number of individual quantum locations that must be protected, while more accurately reflecting the structure…
Clifford codes can be understood as a generalization of stabilizer codes. To show the existence of a true Clifford code which is better than any stabilizer code is a well known open problem in the theory of Clifford codes. One of the main…
We generalize the stabilizer formalism for entanglement-assisted quantum error-correcting codes with noisy ebits (EAQECCs-Ne) from the binary case to the general $q$-ary case, where $q$ is a prime power. By leveraging the structure of the…