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:2103.09932

Entanglement trimming in stabilizer formalism

Changchun Zhong, Yat Wong, Liang Jiang

Published Mar 17, 2021• 0 citations
arXivHTMLPDF

Abstract

Suppose in a quantum network, there are $n$ qubits hold by Alice, Bob and Charlie, denoted by systems $A$, $B$ and $C$, respectively. We require the qubits to be described by a stabilizer state and assume the system $A$ is entangled with the combined system $BC$. An interesting question to ask is when it is possible to transfer all the entanglement to system $A$ and $B$ by local operation on $C$ and classical communication to $AB$, namely \textit{entanglement trimming}. We find a necessary and sufficient condition and prove constructively for this entanglement trimming, which we name it as "the bigger man principle". This principle is then extended to qudit with square-free dimension and continuous variable stabilizer states.

DOI
10.48550/arxiv.2103.09932

Related papers

Conditions for a Class of Entanglement Transformations

Michael A. Nielsen

Suppose Alice and Bob jointly possess a pure state, $|\ensuremath{\psi}〉$. Using local operations on their respective systems and classical communication it may be possible for Alice and Bob to transform $|\ensuremath{\psi}〉$ into another joint state $|\ensuremath{\varphi}〉$. This Letter gives necessary and sufficient conditions for this process of entanglement transformation to be possible. These conditions reveal a partial ordering on the entangled states and connect quantum entanglement to the algebraic theory of majorization. As a consequence, we find that there exist essentially different types of entanglement for bipartite quantum systems.

arXiv:quant-ph/9811053•Physical Review Letters•Jul 12, 1999•1,036 citations

Multipartite unlockable bound entanglement in the stabilizer formalism

Guoming Wang, Mingsheng Ying

We find an interesting relationship between multipartite bound entangled states and the stabilizer formalism. We prove that, if a set of commuting operators from the generalized Pauli group on $n$ qudits satisfy certain constraints, then the maximally mixed state over the subspace stabilized by them is an unlockable bound entangled state. Moreover, the properties of this state, such as symmetry under permutations of parties, undistillability, and unlockability, can be easily explained from the stabilizer formalism without tedious calculation. In particular, the four-qubit Smolin state [Smolin, Phys. Rev. A 63, 032306 (2001)] and its recent generalization to even numbers of qubits [Bandyopadhyay et al., Phys. Rev. A 71, 062317 (2005); Augusiak et al., ibid 73, 012318 (2006)] can be viewed as special examples of our results. Finally, we extend our results to arbitrary multipartite systems in which the dimensions of all parties may be different.

arXiv:quant-ph/0703033•Physical Review A•May 24, 2007•18 citations

Entanglement in the stabilizer formalism

David A. Fattal, Toby S. Cubitt, Y. Yamamoto +2 more

We define a multi-partite entanglement measure for stabilizer states, which can be computed efficiently from a set of generators of the stabilizer group. Our measure applies to qubits, qudits and continuous variables.

arXiv:quant-ph/0406168•Jun 23, 2004•69 citations

Small quantum networks in the qudit stabilizer formalism

Miller, Daniel

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.

arXiv:1910.09551•Oct 21, 2019•8 citations

Entanglement and swap of quantum states in two qubits

IkutoTakaya, IshizakaSatoshi

Suppose that two distant parties Alice and Bob share an entangled state ρAB, and they want to exchange the subsystems of ρAB by local operations and classical communication (LOCC). In general, this...

Quantum Information and Computation•Sep 1, 2015•0 citations

Position-Based Quantum Cryptography: Impossibility and Constructions

Harry Buhrman, Nishanth Chandran, Serge Fehr +4 more

In this work, we study position-based cryptography in the quantum setting. The aim is to use the geographical position of a party as its only credential. On the negative side, we show that if adversaries are allowed to share an arbitrarily large entangled quantum state, the task of secure position-verification is impossible. To this end, we prove the following very general result. Assume that Alice and Bob hold respectively subsystems $A$ and $B$ of a (possibly) unknown quantum state $|\psi\rangle \in {\cal H}_A \otimes {\cal H}_B$. Their goal is to calculate and share a new state $|\varphi\rangle = U|\psi\rangle$, where $U$ is a fixed unitary operation. The question that we ask is how many rounds of mutual communication are needed. It is easy to achieve such a task using two rounds of classical communication, whereas, in general, it is impossible with no communication at all. Surprisingly, in case Alice and Bob share enough entanglement to start with and we allow an arbitrarily small failure probability, we show that the same task can be done using a single round of classical communication in which Alice and Bob exchange two classical messages. Actually, we prove that a relaxed version of the task can be done with no communication at all, where the task is to compute instead a state $|\varphi'\rangle$ that coincides with $|\varphi\rangle = U|\psi\rangle$ up to local operations on $A$ and on $B$, which are determined by classical information held by Alice and Bob. The one-round scheme for the original task then follows as a simple corollary. We also show that these results generalize to more players. As a consequence, we show a generic attack that breaks any position-verification scheme. On the positive side, we show that if adversaries do not share any entangled quantum state but can compute arbitrary quantum operations, secure position-verification is achievable. Jointly, these results suggest the interesting question whether secure position-verification is possible in case of a bounded amount of entanglement. Our positive result can be interpreted as resolving this question in the simplest case, where the bound is set to zero. In models where secure position-verification is achievable, it has a number of interesting applications. For example, it enables secure communication over an insecure channel without having any preshared key, with the guarantee that only a party at a specific location can learn the content of the conversation. More generally, we show that in settings where secure position-verification is achievable, other position-based cryptographic schemes are possible as well, such as secure position-based authentication and position-based key agreement.

arXiv:1009.2490•SIAM Journal on Computing•Jan 1, 2014•115 citations
Suppose in a quantum network, there are nnn qubits hold by Alice, Bob and Charlie, denoted by systems AAA, BBB and CCC, respectively. We require the qubits to be described by a stabilizer state and assume the system AAA is entangled with the combined system BCBCBC. An interesting question to ask is when it is possible to transfer all the entanglement to system AAA and BBB by local operation on CCC and classical communication to ABABAB, namely \textit{entanglement trimming}. We find a necessary and sufficient condition and prove constructively for this entanglement trimming, which we name it as "the bigger man principle". This principle is then extended to qudit with square-free dimension and continuous variable stabilizer states.
Suppose Alice and Bob jointly possess a pure state, $|\ensuremath{\psi}〉$. Using local operations on their respective systems and classical communication it may be possible for Alice and Bob to transform $|\ensuremath{\psi}〉$ into another joint state $|\ensuremath{\varphi}〉$. This Letter gives necessary and sufficient conditions for this process of entanglement transformation to be possible. These conditions reveal a partial ordering on the entangled states and connect quantum entanglement to the algebraic theory of majorization. As a consequence, we find that there exist essentially different types of entanglement for bipartite quantum systems.
We find an interesting relationship between multipartite bound entangled states and the stabilizer formalism. We prove that, if a set of commuting operators from the generalized Pauli group on nnn qudits satisfy certain constraints, then the maximally mixed state over the subspace stabilized by them is an unlockable bound entangled state. Moreover, the properties of this state, such as symmetry under permutations of parties, undistillability, and unlockability, can be easily explained from the stabilizer formalism without tedious calculation. In particular, the four-qubit Smolin state [Smolin, Phys. Rev. A 63, 032306 (2001)] and its recent generalization to even numbers of qubits [Bandyopadhyay et al., Phys. Rev. A 71, 062317 (2005); Augusiak et al., ibid 73, 012318 (2006)] can be viewed as special examples of our results. Finally, we extend our results to arbitrary multipartite systems in which the dimensions of all parties may be different.
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.
In this work, we study position-based cryptography in the quantum setting. The aim is to use the geographical position of a party as its only credential. On the negative side, we show that if adversaries are allowed to share an arbitrarily large entangled quantum state, the task of secure position-verification is impossible. To this end, we prove the following very general result. Assume that Alice and Bob hold respectively subsystems AAA and BBB of a (possibly) unknown quantum state ∣ψ⟩∈HA⊗HB|\psi\rangle \in {\cal H}_A \otimes {\cal H}_B∣ψ⟩∈HA​⊗HB​. Their goal is to calculate and share a new state ∣φ⟩=U∣ψ⟩|\varphi\rangle = U|\psi\rangle∣φ⟩=U∣ψ⟩, where UUU is a fixed unitary operation. The question that we ask is how many rounds of mutual communication are needed. It is easy to achieve such a task using two rounds of classical communication, whereas, in general, it is impossible with no communication at all. Surprisingly, in case Alice and Bob share enough entanglement to start with and we allow an arbitrarily small failure probability, we show that the same task can be done using a single round of classical communication in which Alice and Bob exchange two classical messages. Actually, we prove that a relaxed version of the task can be done with no communication at all, where the task is to compute instead a state ∣φ′⟩|\varphi'\rangle∣φ′⟩ that coincides with ∣φ⟩=U∣ψ⟩|\varphi\rangle = U|\psi\rangle∣φ⟩=U∣ψ⟩ up to local operations on AAA and on BBB, which are determined by classical information held by Alice and Bob. The one-round scheme for the original task then follows as a simple corollary. We also show that these results generalize to more players. As a consequence, we show a generic attack that breaks any position-verification scheme. On the positive side, we show that if adversaries do not share any entangled quantum state but can compute arbitrary quantum operations, secure position-verification is achievable. Jointly, these results suggest the interesting question whether secure position-verification is possible in case of a bounded amount of entanglement. Our positive result can be interpreted as resolving this question in the simplest case, where the bound is set to zero. In models where secure position-verification is achievable, it has a number of interesting applications. For example, it enables secure communication over an insecure channel without having any preshared key, with the guarantee that only a party at a specific location can learn the content of the conversation. More generally, we show that in settings where secure position-verification is achievable, other position-based cryptographic schemes are possible as well, such as secure position-based authentication and position-based key agreement.