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

Does Anti-Parallel Spin contain more Information ?

Sibasish Ghosh A, Anirban Roy, Ujjwal Sen

Published Apr 18, 2000• 0 citations
OpenAlex

Abstract

We show that the Bloch vectors lying on any great circle is the largest set S(L) for which the parallel states |n, n> can always be exactly transformed into the anti-parallel states |n, -n>. Thus more information about the direction of the Bloch vector "n" is not extractable from |n, -n> than from |n, n> by any measuring strategy, for "n" belonging to S(L). Surprisingly, the largest set of Bloch vectors for which the corresponding qubits can be flipped is again S(L). We then show that probabilistic exact parallel to anti-parallel transformation is not possible if the corresponding anti-parallels span the whole Hilbert space of the two qubits. These considerations allow us to generalize a conjecture of Gisin and Popescu (Phys. Rev. Lett. 83, 432 (1999)).

Related papers

Antiparallel spin does not always contain more information

Sibasish Ghosh A, Anirban Roy, Ujjwal Sen

We show that the Bloch vectors lying on any great circle comprise the largest set ${S}_{L}$ for which the parallel states $|\stackrel{\ensuremath{\rightarrow}}{n},\stackrel{\ensuremath{\rightarrow}}{n}〉$ can always be exactly transformed into the antiparallel states $|\stackrel{\ensuremath{\rightarrow}}{n},\ensuremath{-}\stackrel{\ensuremath{\rightarrow}}{n}〉.$ Thus more information about $\stackrel{\ensuremath{\rightarrow}}{n}$ is not extractable from $|\stackrel{\ensuremath{\rightarrow}}{n},\ensuremath{-}\stackrel{\ensuremath{\rightarrow}}{n}〉$ than from $|\stackrel{\ensuremath{\rightarrow}}{n},\stackrel{\ensuremath{\rightarrow}}{n}〉$ by any measuring strategy, for $\stackrel{\ensuremath{\rightarrow}}{n}\ensuremath{\in}{S}_{L}.$ Surprisingly this most general transformation reduces to just a flip operation on the second particle. We also show here that a probabilistic exact parallel to antiparallel transformation is not possible if the corresponding antiparallel states span the whole Hilbert space of the two qubits. These considerations allow us to generalize a conjecture of Gisin and Popescu [Phys. Rev. Lett. $83,$ 432 (1999)].

arXiv:quant-ph/0004071•Physical Review A•Dec 8, 2000•13 citations

Estimation of pure qubits on circles

Samuel L. Braunstein, Sibasish Ghosh A, Simone Severini B

Gisin and Popescu [PRL, 83, 432 (1999)] have shown that more information about their direction can be obtained from a pair of anti-parallel spins compared to a pair of parallel spins, where the first member of the pair (which we call the pointer member) can point equally along any direction in the Bloch sphere. They argued that this was due to the difference in dimensionality spanned by these two alphabets of states. Here we consider similar alphabets, but with the first spin restricted to a fixed small circle of the Bloch sphere. In this case, the dimensionality spanned by the anti-parallel versus parallel alphabet is now equal. However, the anti-parallel alphabet is found to still contain more information in general. We generalize this to having N parallel spins and M anti-parallel spins. When the pointer member is restricted to a small circle these alphabets again span spaces of equal dimension, yet in general, more directional information can be found for sets with smaller |N-M| for any fixed total number of spins. We find that the optimal POVMs for extracting directional information in these cases can always be expressed in terms of the Fourier basis. Our results show that dimensionality alone cannot explain the greater information content in anti-parallel combinations of spins compared to parallel combinations. In addition, we describe an LOCC protocol which extract optimal directional information when the pointer member is restricted to a small circle and a pair of parallel spins are supplied.

arXiv:quant-ph/0412101•Journal of Physics A Mathematical and Theoretical•Feb 6, 2007•7 citations

Complete characterization of qubit masking

Xiao-Bin Liang, Bo Li, Shao-Ming Fei

We study the problem of information masking through nonzero linear operators that distribute information encoded in single qubits to the correlations between two qubits. It is shown that a nonzero linear operator cannot mask any nonzero measure set of qubit states. We prove that the maximal maskable set of states on the Bloch sphere with respect to any masker is the ones on a spherical circle. Any states on a spherical circle on the Bloch sphere are maskable, which also proves the conjecture on maskable qubit states given by Modi et al. [Phys. Rev. Lett. 120, 230501 (2018)]. we provide explicitly operational unitary maskers for all maskable sets. As applications, different protocols for secret sharing are introduced.

arXiv:1909.11244•Physical Review A•Sep 23, 2019•34 citations

Multi-Bloch vector representation of the qutrit

Paweł Kurzyński

An ability to describe quantum states directly by average values of measurement outcomes is provided by the Bloch vector. For an informationally complete set of measurements one can construct unique Bloch vector for any quantum state. However, not every Bloch vector corresponds to a quantum state. It seems that only for two-dimensional quantum systems it is easy to distinguish proper Bloch vectors from improper ones, i.e. the ones corresponding to quantum states from the other ones. I propose an alternative approach to the problem in which more than one vector is used. In particular, I show that a state of the qutrit can be described by the three qubit-like Bloch vectors.

arXiv:0912.3155•Quantum Information and Computation•May 1, 2011•19 citations

Information–disturbance tradeoff in sending direction information via antiparallel quantum spin

ShengLi Zhang, Xu‐Bo Zou, ChuanFeng Li +2 more

For sending unknown direction information, antiparallel spins contains more direction information than parallel spins(Gisin and Popescu, 1999, \textit{Phys. Rev. Lett.} 83, 432).In this paper, the optimal information-disturbance tradeoff bound for antiparallel spins is derived. The quantum measurements which attain the optimal tradeoff bound are obtained. This result can be of practical relevance for posing some general limits on Eve's eavesdropping process. Finally, we also present a comparison between the bound for antiparallel spins and the bound for parallel spins.

arXiv:1106.6170•Journal of Physics A Mathematical and Theoretical•May 13, 2010•5 citations

Optimal asymmetric cloning machine on a great circle using no-signalling condition

Samir Kunkri, Md. Manirul Ali, Geetu Narang +1 more

Assuming the condition of no superluminal signalling, we got an upper bound on the quality of all asymmetric $ 1\to 2$ cloning machines, acting on qubits whose Bloch vectors lie on a great circle. Then we constructed an $ 1\to 2$ cloning machine, which asymmetrically clone all qubits corresponding to this great circle, and this machine matches with that upper bound, and hence this is optimal one.

arXiv:quant-ph/0211169•Nov 26, 2002•1 citation
We show that the Bloch vectors lying on any great circle is the largest set S(L) for which the parallel states |n, n> can always be exactly transformed into the anti-parallel states |n, -n>. Thus more information about the direction of the Bloch vector "n" is not extractable from |n, -n> than from |n, n> by any measuring strategy, for "n" belonging to S(L). Surprisingly, the largest set of Bloch vectors for which the corresponding qubits can be flipped is again S(L). We then show that probabilistic exact parallel to anti-parallel transformation is not possible if the corresponding anti-parallels span the whole Hilbert space of the two qubits. These considerations allow us to generalize a conjecture of Gisin and Popescu (Phys. Rev. Lett. 83, 432 (1999)).
We show that the Bloch vectors lying on any great circle comprise the largest set SL{S}_{L}SL​ for which the parallel states $|\stackrel{\ensuremath{\rightarrow}}{n},\stackrel{\ensuremath{\rightarrow}}{n}〉$ can always be exactly transformed into the antiparallel states $|\stackrel{\ensuremath{\rightarrow}}{n},\ensuremath{-}\stackrel{\ensuremath{\rightarrow}}{n}〉.$ Thus more information about $\stackrel{\ensuremath{\rightarrow}}{n}$ is not extractable from $|\stackrel{\ensuremath{\rightarrow}}{n},\ensuremath{-}\stackrel{\ensuremath{\rightarrow}}{n}〉$ than from $|\stackrel{\ensuremath{\rightarrow}}{n},\stackrel{\ensuremath{\rightarrow}}{n}〉$ by any measuring strategy, for $\stackrel{\ensuremath{\rightarrow}}{n}\ensuremath{\in}{S}_{L}.$ Surprisingly this most general transformation reduces to just a flip operation on the second particle. We also show here that a probabilistic exact parallel to antiparallel transformation is not possible if the corresponding antiparallel states span the whole Hilbert space of the two qubits. These considerations allow us to generalize a conjecture of Gisin and Popescu [Phys. Rev. Lett. 83,83,83, 432 (1999)].
Gisin and Popescu [PRL, 83, 432 (1999)] have shown that more information about their direction can be obtained from a pair of anti-parallel spins compared to a pair of parallel spins, where the first member of the pair (which we call the pointer member) can point equally along any direction in the Bloch sphere. They argued that this was due to the difference in dimensionality spanned by these two alphabets of states. Here we consider similar alphabets, but with the first spin restricted to a fixed small circle of the Bloch sphere. In this case, the dimensionality spanned by the anti-parallel versus parallel alphabet is now equal. However, the anti-parallel alphabet is found to still contain more information in general. We generalize this to having N parallel spins and M anti-parallel spins. When the pointer member is restricted to a small circle these alphabets again span spaces of equal dimension, yet in general, more directional information can be found for sets with smaller |N-M| for any fixed total number of spins. We find that the optimal POVMs for extracting directional information in these cases can always be expressed in terms of the Fourier basis. Our results show that dimensionality alone cannot explain the greater information content in anti-parallel combinations of spins compared to parallel combinations. In addition, we describe an LOCC protocol which extract optimal directional information when the pointer member is restricted to a small circle and a pair of parallel spins are supplied.
We study the problem of information masking through nonzero linear operators that distribute information encoded in single qubits to the correlations between two qubits. It is shown that a nonzero linear operator cannot mask any nonzero measure set of qubit states. We prove that the maximal maskable set of states on the Bloch sphere with respect to any masker is the ones on a spherical circle. Any states on a spherical circle on the Bloch sphere are maskable, which also proves the conjecture on maskable qubit states given by Modi et al. [Phys. Rev. Lett. 120, 230501 (2018)]. we provide explicitly operational unitary maskers for all maskable sets. As applications, different protocols for secret sharing are introduced.
An ability to describe quantum states directly by average values of measurement outcomes is provided by the Bloch vector. For an informationally complete set of measurements one can construct unique Bloch vector for any quantum state. However, not every Bloch vector corresponds to a quantum state. It seems that only for two-dimensional quantum systems it is easy to distinguish proper Bloch vectors from improper ones, i.e. the ones corresponding to quantum states from the other ones. I propose an alternative approach to the problem in which more than one vector is used. In particular, I show that a state of the qutrit can be described by the three qubit-like Bloch vectors.
For sending unknown direction information, antiparallel spins contains more direction information than parallel spins(Gisin and Popescu, 1999, \textit{Phys. Rev. Lett.} 83, 432).In this paper, the optimal information-disturbance tradeoff bound for antiparallel spins is derived. The quantum measurements which attain the optimal tradeoff bound are obtained. This result can be of practical relevance for posing some general limits on Eve's eavesdropping process. Finally, we also present a comparison between the bound for antiparallel spins and the bound for parallel spins.