相关论文: Graph state basis for Pauli Channels
We construct an explicit quantum coding scheme which achieves a communication rate not less than the coherent information when used to transmit quantum information over a noisy quantum channel. For Pauli and erasure channels we also present…
Graph theory is important in information theory. We introduce a quantization process on graphs and apply the quantized graphs in quantum information. The quon language provides a mathematical theory to study such quantized graphs in a…
In this work we improve the quantum communication rates of various quantum channels of interest using permutation-invariant quantum codes. We focus in particular on parametrized families of quantum channels and aim to improve bounds on…
In the context of measurement-based quantum computation a way of maintaining the coherence of a graph state is to measure its stabilizer operators. Aside from performing quantum error correction, it is possible to exploit the information…
Graph states are multi-particle entangled states that correspond to mathematical graphs, where the vertices of the graph take the role of quantum spin systems and edges represent Ising interactions. They are many-body spin states of…
Entanglement and entanglement-assisted are useful resources to enhance the mutual information of the Pauli channels, when the noise on consecutive uses of the channel has some partial correlations. In this paper, We study quantum…
Fathoming out quantum state space is a challenging endeavor due to its exponentially growing dimensionality. At the expense of being bound in its expressiveness, the discrete and finite subspace of graph states is easier to investigate via…
An expression is derived characterizing the set of admissible rate pairs for simultaneous transmission of classical and quantum information over a given quantum channel, generalizing both the classical and quantum capacities of the channel.…
We introduce and investigate a data access model (approximate sample and query) that is satisfiable by the preparation and measurement of block encoded states, as well as in contexts such as classical quantum circuit simulation or Pauli…
Quantum graph states are critical resources for various quantum algorithms, and also determine essential interconnections in distributed quantum computing. There are two schemes for generating graph states probabilistic scheme and…
Originally motivated by the (fold-)transversal related initialisation of logical surface code $|Y\rangle$ states from [arXiv:1603.02286, arXiv:2302.07395, arXiv:2302.12292], which was then explicitly extended to the fold-transversal $S$…
Graph states are generalized from qubits to collections of $n$ qudits of arbitrary dimension $D$, and simple graphical methods are used to construct both additive and nonadditive quantum error correcting codes. Codes of distance 2…
Graph states are a key resource for a number of applications in quantum information theory. Due to the inherent noise in noisy intermediate-scale quantum (NISQ) era devices, it is important to understand the effects noise has on the…
By using highly entangled states, quantum metrology guarantees precision impossible with classical measurements. Unfortunately such states can be very susceptible to noise, and it is a great challenge of the field to maintain quantum…
Graph states are entangled states that are essential for quantum information processing. As experimental advances enable the realization of large-scale graph states, efficient fidelity estimation methods are crucial for assessing their…
Variational hybrid quantum-classical algorithms are promising candidates for near-term implementation on quantum computers. In these algorithms, a quantum computer evaluates the cost of a gate sequence (with speedup over classical cost…
We investigate a quantum coding for quantum communication over a PD (partially degradable) degradable quantum channel. For a PD channel, the degraded environment state can be expressed from the channel output state up to a degrading map. PD…
We propose a method to calculate the purity of reduced states of graph states entirely within the stabilizer formalism, using only the stabilizer generators for a given state. We apply this method to find the Concentratable Entanglement of…
Graph states are the main computational building blocks of measurement-based computation and a useful tool for error correction in the gate model architecture. The graph states form a class of quantum states which are eigenvectors for the…
A set of Pauli stings is well characterized by the graph that encodes its commutatitivity structure, i.e., by its frustration graph. This graph provides a natural interface between graph theory and quantum information, which we explore in…