Weak Decays of Doubly Heavy Baryons: Bcc→BcV{\cal B}_{cc}\to {\cal B}_c V

The weak decays of a spin-$1/2$ doubly charm baryon (${\cal B}_{cc}$) to a spin-$1/2$ singly charm baryon (${\cal B}_c$) and a light vector meson ($V$) are studied under a phenomenological scheme. The contributions are classified into different topological diagrams, among which the short distance ones are calculated under the factorization hypothesis, and the long distance contributions are modelled as final-state interactions (FSIs) which are estimated with the one-particle-exchange model. In calculation the topological contributions tend to fall in a hierarchy. The branching fractions or decay widths are estimated, and it indicates that $\Xi_{cc}^+\to\Xi_c^+\pi^+\pi^-$ and $\Omega_{cc}^{+}\rightarrow\Xi_{c}^{+}K^-\pi^+$ can be used as candidate decays for searching $\Xi_{cc}^+$ and $\Omega_{cc}^+$. Some decays that are mainly activated by the long distance effects are found, observation on which in future experiments can help to understand the role of FSIs in charm baryon decays.Comment: 29 pages, 5 figures, 7 tables; version published in EPJ

A verifiable quantum key agreement protocol based on six-qubit cluster states

Quantum key agreement requires all participants to recover the shared key together, so it is crucial to resist the participant attack. In this paper, we propose a verifiable multi-party quantum key agreement protocol based on the six-qubit cluster states. A verifiable distributor who preserves some subsequences of the six-qubit cluster states is introduced into this protocol, thus the participants can not obtain the shared key in advance. Besides, the correctness and simultaneity of the shared key are guaranteed by the trusted design combiner and homomorphic hash function. Furthermore, the security analysis shows that the new protocol can resist the external and internal attacks.Comment: 9 pages, 2 figure

A quantum secret sharing scheme with verifiable function

In the $\left( {t,n} \right)$ threshold quantum secret sharing scheme, it is difficult to ensure that internal participants are honest. In this paper, a verifiable $\left( {t,n} \right)$ threshold quantum secret sharing scheme is designed combined with classical secret sharing scheme. First of all, the distributor uses the asymmetric binary polynomials to generate the shares and sends them to each participant. Secondly, the distributor sends the initial quantum state with the secret to the first participant, and each participant performs unitary operation that using the mutually unbiased bases on the obtained $d$ dimension single bit quantum state ($d$ is a large odd prime number). In this process, distributor can randomly check the participants, and find out the internal fraudsters by unitary inverse operation gradually upward. Then the secret is reconstructed after all other participants simultaneously public transmission. Security analysis show that this scheme can resist both external and internal attacks