Quantum Voting Scheme Based on Locally Indistinguishable Orthogonal Product States
We propose a quantum voting scheme based on locally indistinguishable orthogonal product states. In this scheme, voting information is encoded as a sequence of orthogonal product states. Different particles of a same orthogonal product state are transmitted separately, which can ensure the security of the message since these orthogonal product states come from a set that cannot be perfectly distinguished by local operations and classical communication (LOCC). Even if an attacker obtains these particles, no effective information can be obtained. Compared with entangled states, orthogonal product states are more convenient and cheaper to prepare. Security analysis and efficiency analysis show that our scheme can resist known quantum attacks and has high efficiency.
KeywordsQuantum voting scheme Orthogonal product states Local operations and classical communication
This work is supported by Shandong Provincial Natural Science Foundation (No. ZR2019MF023) and SDUST Research Fund.
- 5.Grover, L.K.: A fast quantum mechanical algorithm for database search. Twenty-Eighth ACM Symposium on Theory of Computing, 212–219 (1996)Google Scholar
- 6.Hillery, M.: Quantum voting and privacy ptotection: first steps. Int. Soc. Opt. Eng., 2006 (2006)Google Scholar
- 10.Yi, Z., He, G.Q., Zeng, G.H.: Quantum voting protocol using two-mode squeezed states. Acta Phys. Sin. 58(5), 3166–3172 (2009)Google Scholar
- 12.Yu, S.X., Oh, C.H.: Detecting the local indistinguishability of maximally entangled states. arXiv:1502.01274v1 [quant-ph] (2015)
- 32.Fan, Y.J., Huang, X., Wang, Z., Xia, J.W., Li, Y.X.: Global Mittag-Leffler synchronization of delayed fractional-order memristive neural networks. Advances in Difference Equations, 338 (2018)Google Scholar