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

N-particle N-level singlet states: Properties and applications

Adán Cabello

Published Mar 22, 2002• 0 citations
OpenAlex

Abstract

Three apparently unrelated problems which have no solution using classical tools are described: the ``N-strangers'', ``secret sharing'', and ``liar detection'' problems. A solution for each of them is proposed. Common to the three solutions is the use of quantum states of total spin zero of N spin-(N+1)/2 particles.

Related papers

N -Particle N -Level Singlet States: Some Properties and Applications

Adán Cabello

Three apparently unrelated problems which have no solution using classical tools are described: the "N-strangers," "secret sharing," and "liar detection" problems. A solution for each of them is proposed. Common to all three solutions is the use of quantum states of total spin zero of N spin-(N-1)/2 particles.

arXiv:quant-ph/0203119•Physical Review Letters•Aug 19, 2002•119 citations

ON THE PROBLEM OF DISCRETE QUANTUM NUMBERS FOR THREE PARTICLE STATES

Andrzej Szymacha, J. Werle

A procedure for finding the discrete quantum numbers that, as previously noted, can replace continuous quantum numbers in a representation for systems of three particles of arbitrary mass and spin values is outlined. (D.C.W.)

•Jan 1, 1963•0 citations

Supersinglets

Adán Cabello

Supersinglets |S N (d) 〉 are states of total spin zero of N particles of d levels. Some applications of the |S N (N) 〉 and |S N (2) 〉 states are described. The |S N (N) 〉 states can be used to solve three problems that have no classical solution: The ‘N strangers,’ ‘secret sharing,’ and ‘liar detection’ problems. The |S N (2) 〉 (with N even) states can be used to encode qubits in decoherence-free subspaces.

Journal of Modern Optics•Jan 1, 2003•3 citations

Single-particle entanglement

S. J. van Enk

I give a simple argument that demonstrates that the state $\ensuremath{\mid}0⟩\ensuremath{\mid}1⟩+\ensuremath{\mid}1⟩\ensuremath{\mid}0⟩$, with $\ensuremath{\mid}0⟩$ denoting a state with 0 particles (or photons) and $\ensuremath{\mid}1⟩$ a one-particle state, is entangled in spite of recent claims to the contrary. I also discuss viewpoints on the old controversy about whether the above state can be said to display single-particle or single-photon nonlocality.

arXiv:quant-ph/0507189•Physical Review A•Dec 29, 2005•212 citations

Supersinglets

Adán Cabello

Supersinglets |S N (d) 〉 are states of total spin zero of N particles of d levels. Some applications of the |S N (N) 〉 and |S N (2) 〉 states are described. The |S N (N) 〉 states can be used to solve three problems that have no classical solution: The ‘N strangers,’ ‘secret sharing,’ and ‘liar detection’ problems. The |S N (2) 〉 (with N even) states can be used to encode qubits in decoherence-free subspaces.

arXiv:quant-ph/0306074•Journal of Modern Optics•Apr 1, 2003•59 citations

Quantum circuit and Byzantine generals problem

Chia-Hung Chien, Tein-Sheng Lin, Chin-Yung Lu +2 more

This paper designs quantum circuit to detect the fault components in the Byzantine generals problem. This circuit is verification circuit that can investigate the equivalence of quantum input particles. In this problem, reach agreement and liar detection are two major issues. In the quantum field, quantum secret sharing can support a special correlation among sharing party. By using this relation, quantum circuit can detect the behavior of the traitor to obtain the consistence of the Byzantine agreement. In regard to the performance, quantum solution can obtain little message exchange and more tolerant faulty components. Furthermore, the proposed circuit is scalable.

IEEE International Conference on Nanotechnology (IEEE-NANO)•Aug 1, 2012•2 citations
Three apparently unrelated problems which have no solution using classical tools are described: the N-strangers'', secret sharing'', and ``liar detection'' problems. A solution for each of them is proposed. Common to the three solutions is the use of quantum states of total spin zero of N spin-(N+1)/2 particles.
I give a simple argument that demonstrates that the state $\ensuremath{\mid}0⟩\ensuremath{\mid}1⟩+\ensuremath{\mid}1⟩\ensuremath{\mid}0⟩$, with $\ensuremath{\mid}0⟩$ denoting a state with 0 particles (or photons) and $\ensuremath{\mid}1⟩$ a one-particle state, is entangled in spite of recent claims to the contrary. I also discuss viewpoints on the old controversy about whether the above state can be said to display single-particle or single-photon nonlocality.
This paper designs quantum circuit to detect the fault components in the Byzantine generals problem. This circuit is verification circuit that can investigate the equivalence of quantum input particles. In this problem, reach agreement and liar detection are two major issues. In the quantum field, quantum secret sharing can support a special correlation among sharing party. By using this relation, quantum circuit can detect the behavior of the traitor to obtain the consistence of the Byzantine agreement. In regard to the performance, quantum solution can obtain little message exchange and more tolerant faulty components. Furthermore, the proposed circuit is scalable.