Quantum state sharing of an arbitrary m-particle state using Einstein–Podolsky–Rosen pairs and application in quantum voting

In this paper, we propose a scheme where Alice shares an arbitrary m-particle unknown state with her agents, Bob and Charlie. Alice starts by distributing 2m Einstein–Podolsky–Rosen pairs with her agents and performs m joint three-particle Greenberger–Horne–Zeilinger state measurements on her particles. Bob, who acts as the controller, performs a product measurement [Formula: see text] on his m qubit states while Charlie retrieves the original state by performing unitary operations on his m particles. Subsequently, we demonstrate our proposed scheme’s feasibility by applying it in electronic voting by sharing an arbitrary single-particle state.

Glueball relevant study on isoscalars from Nf = 2 lattice QCD

We perform a glueball-relevant study on isoscalars based on anisotropic Nf = 2 lattice QCD gauge configurations. In the scalar channel, we identify the ground state obtained through gluonic operators to be a single-particle state through its dispersion relation. When qq operator is included, we find the mass of this state does not change, and the qq operator couples very weakly to this state. So this state is most likely a glueball state. For pseudoscalars, along with the exiting lattice results, our study implies that both the conventional qq state η2 (or η' in flavor SU(3)) and a heavier glueball-like state with a mass of roughly 2.6 GeV exist in the spectrum of lattice QCD with dynamical quarks.

ALMOST PERFECT TELEPORTATION USING 4-PARTITE ENTANGLED STATES

In a recent paper N. Ba An (Phys. Rev. A68, 022321 (2003)) proposed a scheme to teleport a single particle state, which is superposition of coherent states |α〉 and |-α〉 using a 4-partite state, a beam splitter, and phase shifters and concluded that the probability for successful teleportation is only 1/4 in the limit |α| → 0 and 1/2 in the limit |α| → ∞. In this paper, we modify this scheme and find that an almost perfect success can be achieved if |α|2 is appreciable. For example, for |α|2 = 5, the minimum of average fidelity for teleportation, which is the minimum of sum of the product of probability for occurrence of any case and the corresponding fidelity evaluated for an arbitrary chosen information state, is 0.9999.