We propose a set of protocols for quantum anonymous veto (QAV) broadly categorized under the probabilistic, iterative, and deterministic schemes. The schemes are based upon different types of quantum resources. Specifically, they may be viewed as single photon-based, bipartite and multipartite entangled states-based, orthogonal state-based and conjugate coding-based. The set of the proposed schemes is analyzed for all the requirements of a valid QAV scheme (e.g., privacy, verifiability, robustness, binding, eligibility and correctness). The proposed schemes are observed to be more efficient in comparison to the existing QAV schemes and robust up to the moderate decoherence rate. In addition, a trade-off between correctness and robustness of the probabilistic QAV schemes is observed. Further, the multipartite dense coding based deterministic QAV scheme is most efficient scheme among the set of schemes proposed here. A bipartite entanglement based iterative scheme employing dense coding is yet another efficient and practical scheme. The intrinsic connections between dining cryptographer-net with anonymous veto-net is also explored in the process of designing new protocols.

中文翻译：

---

量子匿名否决：一组新协议

我们提出了一组量子匿名否决（QAV）协议，大致分为概率、迭代和确定性方案。这些方案基于不同类型的量子资源。具体而言，它们可以被视为基于单光子、基于二分和多分纠缠态、基于正交态和基于共轭编码。针对有效 QAV 方案的所有要求（例如，隐私、可验证性、鲁棒性、绑定、合格性和正确性）分析所提议方案的集合。与现有的 QAV 方案相比，所提出的方案被观察到更有效，并且对中等退相干率具有鲁棒性。此外，观察到概率 QAV 方案的正确性和鲁棒性之间的权衡。更远，基于多方密集编码的确定性 QAV 方案是此处提出的一组方案中最有效的方案。采用密集编码的基于二分纠缠的迭代方案是另一种有效且实用的方案。在设计新协议的过程中，还探讨了餐饮密码学家网络与匿名否决网络之间的内在联系。