Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1910.09551

Small quantum networks in the qudit stabilizer formalism

Miller, Daniel

Published Oct 21, 2019• 8 citations
arXivHTMLPDF

Abstract

How much noise can a given quantum state tolerate without losing its entanglement? For qudits of arbitrary dimension, I investigate this question for two noise models: Global white noise, where a depolarizing channel is applied to all qudits simultaneously, and local white noise, where a single qudit depolarizing channel is applied to every qudit individually. Using a unitary generalization of the Pauli group, I derive noise thresholds for stabilizer states, with an emphasis on graph states, and compare different entanglement criteria. The PPT and reduction criteria generally provide high noise thresholds, however, it is difficult to apply them in the case of local white noise. Entanglement criteria based on so-called sector lengths, on the other hand, provide coarse noise thresholds for both noise models. The only thing one has to know about a state to compute this threshold is the number of its full-weight stabilizers. In the special case of qubit graph states, I relate this question to a graph-theoretical puzzle and solve it for four important families of states. For Greenberger-Horne-Zeilinger states under local white noise, I obtain for the first time a noise threshold below which so-called semiseparability is ruled out.

DOI
10.48550/arxiv.1910.09551

Related papers

Noise robustness and threshold of many-body quantum magic

Fuchuan Wei, Zi-Wen Liu

Understanding quantum magic (i.e., nonstabilizerness) in many-body quantum systems is challenging but essential to the study of quantum computation and many-body physics. We investigate how noise affects magic properties in entangled many-body quantum states by quantitatively examining the magic decay under noise, with a primary aim being to understand the stability of magic associated with different kinds of entanglement structures. As a standard model, we study hypergraph states, a representative class of many-body magic states, subject to depolarizing noise. First, we show that interactions facilitated by high-degree gates are fragile to noise. In particular, the $\mathrm{C}^{n-1}Z$ state family exhibits a vanishing magic threshold of $Θ(1/n)$. Furthermore, we demonstrate efficiently preparable families of hypergraph states without local magic but with a non-vanishing magic threshold which signifies robust magic that is entirely embedded in global entanglement. We also discuss the qudit case based on the discrete Wigner formalism.

arXiv:2410.21215•Oct 28, 2024•0 citations

Necessary and sufficient criterion for k-separability of N-qubit noisy GHZ states

Xiaoyu Chen, Li-zhen Jiang, Zhu‐An Xu

A Multipartite entangled state has many different kinds of entanglements specified by the number of partitions. The most essential example of multipartite entanglement is the entanglement of multi-qubit Greenberger–Horne–Zeilinger (GHZ) state in white noise. We explicitly construct the entanglement witnesses for these states with stabilizer generators of the GHZ states. For an [Formula: see text] qubit GHZ state in white noise, we demonstrate the necessary and sufficient criterion of separability when it is divided into [Formula: see text] parties with [Formula: see text] for arbitrary [Formula: see text] and [Formula: see text]. The criterion covers more than a half of all kinds of partial entanglements for [Formula: see text]-qubit GHZ states in white noise. For the rest of multipartite entanglement problems, we present a method to obtain the sufficient conditions of separability. As an application, we consider [Formula: see text] qubit GHZ state as a codeword of the degenerate quantum code passing through depolarizing channel. We find that the output state is neither genuinely entangled nor fully separable when the quantum channel capacity reduces from positive to zero.

arXiv:1605.08496•International Journal of Quantum Information•Jun 1, 2018•10 citations

Error Thresholds for Arbitrary Pauli Noise

Johannes Bausch, Felix Leditzky

The error threshold of a one-parameter family of quantum channels is defined as the largest noise level such that the quantum capacity of the channel remains positive. This in turn guarantees the existence of a quantum error correction code for noise modeled by that channel. Discretizing the single-qubit errors leads to the important family of Pauli quantum channels; curiously, multipartite entangled states can increase the threshold of these channels beyond the so-called hashing bound, an effect termed superadditivity of coherent information. In this work, we divide the simplex of Pauli channels into one-parameter families and compute numerical lower bounds on their error thresholds. We find substantial increases of error thresholds relative to the hashing bound for large regions in the Pauli simplex corresponding to biased noise, which is a realistic noise model in promising quantum computing architectures. The error thresholds are computed on the family of graph states, a special type of stabilizer state. In order to determine the coherent information of a graph state, we devise an algorithm that exploits the symmetries of the underlying graph, resulting in a substantial computational speed-up. This algorithm uses tools from computational group theory and allows us to consider symmetric graph states on a large number of vertices. Our algorithm works particularly well for repetition codes and concatenated repetition codes (or cat codes), for which our results provide the first comprehensive study of superadditivity for arbitrary Pauli channels. In addition, we identify a novel family of quantum codes based on tree graphs. The error thresholds of these tree graph states outperform repetition and cat codes in large regions of the Pauli simplex, and hence form a new code family with desirable error correction properties.

arXiv:1910.00471•SIAM Journal on Computing•Jan 1, 2021•26 citations

Entanglement detection under coherent noise: Greenberger-Horne-Zeilinger-like states

You Zhou

Entanglement is an essential resource in many quantum information tasks and the entanglement witness is a widely used tool for its detection. In experiments the prepared state generally deviates from the target state due to some noise. Normally the white-noise model is applied to quantifying such a derivation and at the same time reveals the robustness of the witness. However, there may exist other kinds of noise, in which the coherent noise can dramatically ``rotate'' the prepared state. In this way, coherent noise is likely to lead to a failure of detection, even though the underlying state is actually entangled. In this work, we propose an efficient entanglement detection protocol for $N$-partite Greenberger-Horne-Zeilinger (GHZ)--like states. The protocol can eliminate the effect of coherent noise and at the same time feedback the corresponding noise parameters, which are beneficial to further improvements of the experiment system. In particular, we consider two experiment-relevant coherent noise models; one is from the unconscious phase accumulation on $N$ qubits, and the other is from the rotation on the control qubit. The protocol effectively realizes a family of entanglement witnesses by postprocessing the measurement results from $N+2$ local measurement settings, which adds only one more setting than the original witness specialized for the GHZ state. Moreover, by considering the trade-off between the detection efficiency and the white-noise robustness, we further reduce the number of local measurements to three without altering the performance under the coherent noise. Our protocol can enhance entanglement detection under coherent noises and act as a benchmark for state-of-the-art quantum devices.

arXiv:1907.11495•Physical Review A•Jan 2, 2020•17 citations

Entanglement detection in the stabilizer formalism

Géza Tóth, Otfried Gühne

We investigate how stabilizer theory can be used for constructing sufficient conditions for entanglement. First, we show how entanglement witnesses can be derived for a given state, provided some stabilizing operators of the state are known. These witnesses require only a small effort for an experimental implementation and are robust against noise. Second, we demonstrate that also nonlinear criteria based on uncertainty relations can be derived from stabilizing operators. These criteria can sometimes improve the witnesses by adding nonlinear correction terms. All our criteria detect states close to Greenberger-Horne-Zeilinger states, cluster and graph states. We show that similar ideas can be used to derive entanglement conditions for states which do not fit the stabilizer formalism, such as the three-qubit $W$ state. We also discuss connections between the witnesses and some Bell inequalities.

arXiv:quant-ph/0501020•Physical Review A•Aug 29, 2005•281 citations

Tripartite entanglement in qudit stabilizer states and application in quantum error correction

Shiang Yong Looi, Robert B. Griffiths

Consider a stabilizer state on $n$ qudits, each of dimension $D$ with $D$ being a prime or squarefree integer, divided into three mutually disjoint sets or parts. Generalizing a result of Bravyi et al. [J. Math. Phys. 47, 062106 (2006)] for qubits ($D=2$), we show that up to local unitaries, the three parts of the state can be written as tensor product of unentangled signle-qudit states, maximally entangled Einstein-Podolsky-Rosen (EPR) pairs, and tripartite Greenberger-Horne-Zeilinger (GHZ) states. We employ this result to obtain a complete characterization of the properties of a class of channels associated with stabilizer error-correcting codes, along with their complementary channels.

arXiv:1107.1761•Physical Review A•Nov 7, 2011•21 citations
How much noise can a given quantum state tolerate without losing its entanglement? For qudits of arbitrary dimension, I investigate this question for two noise models: Global white noise, where a depolarizing channel is applied to all qudits simultaneously, and local white noise, where a single qudit depolarizing channel is applied to every qudit individually. Using a unitary generalization of the Pauli group, I derive noise thresholds for stabilizer states, with an emphasis on graph states, and compare different entanglement criteria. The PPT and reduction criteria generally provide high noise thresholds, however, it is difficult to apply them in the case of local white noise. Entanglement criteria based on so-called sector lengths, on the other hand, provide coarse noise thresholds for both noise models. The only thing one has to know about a state to compute this threshold is the number of its full-weight stabilizers. In the special case of qubit graph states, I relate this question to a graph-theoretical puzzle and solve it for four important families of states. For Greenberger-Horne-Zeilinger states under local white noise, I obtain for the first time a noise threshold below which so-called semiseparability is ruled out.
Understanding quantum magic (i.e., nonstabilizerness) in many-body quantum systems is challenging but essential to the study of quantum computation and many-body physics. We investigate how noise affects magic properties in entangled many-body quantum states by quantitatively examining the magic decay under noise, with a primary aim being to understand the stability of magic associated with different kinds of entanglement structures. As a standard model, we study hypergraph states, a representative class of many-body magic states, subject to depolarizing noise. First, we show that interactions facilitated by high-degree gates are fragile to noise. In particular, the Cn−1Z\mathrm{C}^{n-1}ZCn−1Z state family exhibits a vanishing magic threshold of Θ(1/n)Θ(1/n)Θ(1/n). Furthermore, we demonstrate efficiently preparable families of hypergraph states without local magic but with a non-vanishing magic threshold which signifies robust magic that is entirely embedded in global entanglement. We also discuss the qudit case based on the discrete Wigner formalism.
A Multipartite entangled state has many different kinds of entanglements specified by the number of partitions. The most essential example of multipartite entanglement is the entanglement of multi-qubit Greenberger–Horne–Zeilinger (GHZ) state in white noise. We explicitly construct the entanglement witnesses for these states with stabilizer generators of the GHZ states. For an [Formula: see text] qubit GHZ state in white noise, we demonstrate the necessary and sufficient criterion of separability when it is divided into [Formula: see text] parties with [Formula: see text] for arbitrary [Formula: see text] and [Formula: see text]. The criterion covers more than a half of all kinds of partial entanglements for [Formula: see text]-qubit GHZ states in white noise. For the rest of multipartite entanglement problems, we present a method to obtain the sufficient conditions of separability. As an application, we consider [Formula: see text] qubit GHZ state as a codeword of the degenerate quantum code passing through depolarizing channel. We find that the output state is neither genuinely entangled nor fully separable when the quantum channel capacity reduces from positive to zero.
The error threshold of a one-parameter family of quantum channels is defined as the largest noise level such that the quantum capacity of the channel remains positive. This in turn guarantees the existence of a quantum error correction code for noise modeled by that channel. Discretizing the single-qubit errors leads to the important family of Pauli quantum channels; curiously, multipartite entangled states can increase the threshold of these channels beyond the so-called hashing bound, an effect termed superadditivity of coherent information. In this work, we divide the simplex of Pauli channels into one-parameter families and compute numerical lower bounds on their error thresholds. We find substantial increases of error thresholds relative to the hashing bound for large regions in the Pauli simplex corresponding to biased noise, which is a realistic noise model in promising quantum computing architectures. The error thresholds are computed on the family of graph states, a special type of stabilizer state. In order to determine the coherent information of a graph state, we devise an algorithm that exploits the symmetries of the underlying graph, resulting in a substantial computational speed-up. This algorithm uses tools from computational group theory and allows us to consider symmetric graph states on a large number of vertices. Our algorithm works particularly well for repetition codes and concatenated repetition codes (or cat codes), for which our results provide the first comprehensive study of superadditivity for arbitrary Pauli channels. In addition, we identify a novel family of quantum codes based on tree graphs. The error thresholds of these tree graph states outperform repetition and cat codes in large regions of the Pauli simplex, and hence form a new code family with desirable error correction properties.
Entanglement is an essential resource in many quantum information tasks and the entanglement witness is a widely used tool for its detection. In experiments the prepared state generally deviates from the target state due to some noise. Normally the white-noise model is applied to quantifying such a derivation and at the same time reveals the robustness of the witness. However, there may exist other kinds of noise, in which the coherent noise can dramatically ``rotate'' the prepared state. In this way, coherent noise is likely to lead to a failure of detection, even though the underlying state is actually entangled. In this work, we propose an efficient entanglement detection protocol for NNN-partite Greenberger-Horne-Zeilinger (GHZ)--like states. The protocol can eliminate the effect of coherent noise and at the same time feedback the corresponding noise parameters, which are beneficial to further improvements of the experiment system. In particular, we consider two experiment-relevant coherent noise models; one is from the unconscious phase accumulation on NNN qubits, and the other is from the rotation on the control qubit. The protocol effectively realizes a family of entanglement witnesses by postprocessing the measurement results from N+2N+2N+2 local measurement settings, which adds only one more setting than the original witness specialized for the GHZ state. Moreover, by considering the trade-off between the detection efficiency and the white-noise robustness, we further reduce the number of local measurements to three without altering the performance under the coherent noise. Our protocol can enhance entanglement detection under coherent noises and act as a benchmark for state-of-the-art quantum devices.
We investigate how stabilizer theory can be used for constructing sufficient conditions for entanglement. First, we show how entanglement witnesses can be derived for a given state, provided some stabilizing operators of the state are known. These witnesses require only a small effort for an experimental implementation and are robust against noise. Second, we demonstrate that also nonlinear criteria based on uncertainty relations can be derived from stabilizing operators. These criteria can sometimes improve the witnesses by adding nonlinear correction terms. All our criteria detect states close to Greenberger-Horne-Zeilinger states, cluster and graph states. We show that similar ideas can be used to derive entanglement conditions for states which do not fit the stabilizer formalism, such as the three-qubit WWW state. We also discuss connections between the witnesses and some Bell inequalities.
Consider a stabilizer state on nnn qudits, each of dimension DDD with DDD being a prime or squarefree integer, divided into three mutually disjoint sets or parts. Generalizing a result of Bravyi et al. [J. Math. Phys. 47, 062106 (2006)] for qubits (D=2D=2D=2), we show that up to local unitaries, the three parts of the state can be written as tensor product of unentangled signle-qudit states, maximally entangled Einstein-Podolsky-Rosen (EPR) pairs, and tripartite Greenberger-Horne-Zeilinger (GHZ) states. We employ this result to obtain a complete characterization of the properties of a class of channels associated with stabilizer error-correcting codes, along with their complementary channels.