Single-Round Deterministic Quantum Anonymous Veto Using Bell States

• URL: http://arxiv.org/abs/2509.15951v1
• Date: Fri, 19 Sep 2025 13:01:43 GMT
• Title: Single-Round Deterministic Quantum Anonymous Veto Using Bell States
• Authors: Ravi Sangwan, Harishankar Mishra, Henry Sukumar, Gudapati Naresh Raghava,
• Abstract summary: Quantum Anonymous Veto (QAV) protocols enable secure and anonymous decision-making.<n>Existing QAV schemes offer strong theoretical guarantees, but face limitations in practical implementation.<n>We propose a novel deterministic QAV protocol that achieves conclusive veto detection in a single round.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum Anonymous Veto (QAV) protocols enable secure and anonymous decision-making by allowing participants to detect the presence of a veto without revealing individual choices. While existing QAV schemes offer strong theoretical guarantees, they face significant limitations in practical implementation due to resource requirements, scalability issues, and the need for multipartite entanglement. In this work, we propose a novel deterministic QAV protocol that leverages only bipartite entanglement in the form of Bell states and achieves conclusive veto detection in a single round. Our approach eliminates the need for multi-qubit entangled states and iterative rounds, thereby significantly reducing experimental overhead and enhancing scalability. The protocol preserves critical properties such as voter anonymity, correctness, and verifiability, making it well-suited for implementation on near-term quantum devices. Furthermore, we outline a practical photonic realization based on polarization-path encoding and discrete-time quantum walks, demonstrating its feasibility within current quantum optical platforms. This work contributes a resource-efficient and experimentally viable alternative to existing QAV schemes, advancing the prospects of secure quantum decision-making in distributed systems.

Related papers

• Are Quantum Voting Protocols Practical? [0.0]
  Quantum voting protocols aim to offer ballot secrecy and publicly verifiable tallies using physical guarantees from quantum mechanics.<n>This article surveys whether such quantum voting protocols are practical.
  arXiv  Detail & Related papers  (2026-01-24T16:25:35Z)
• Design and Experimental Realization of Various Protocols for Secure Quantum Computation and Communication [2.06682776181122]
  A set of new schemes for quantum computation and communication have been either designed or experimentally realized.<n>A quantum anonymous voting (QAV) scheme has been experimentally implemented on IBM's quantum computer.<n>Two quantum key distribution protocols, coherent one-way (COW) and differential phase shift (DPS) are experimentally demonstrated.
  arXiv  Detail & Related papers  (2025-07-13T08:23:12Z)
• A Fully Device-Independent Ternary Quantum Key Distribution Protocol Based on the Impossible Colouring Game [0.59374762912328]
  We propose a quantum key distribution protocol based on the two-party Impossible Colouring pseudo-telepathy game.<n>The protocol harnesses Bell inequality violations that arise from contextuality in the Kochen-Specker theorem.<n>It operates within an adequate security framework and demonstrates an improved key generation rate compared to standard quantum key distribution schemes.
  arXiv  Detail & Related papers  (2025-05-21T14:52:31Z)
• Secure quantum ranging [4.420756503340444]
  We propose a quantum ranging protocol that combines quantum ranging with quantum position verification.<n>Our method achieves Heisenberg-limited precision in position estimation while simultaneously detecting potential cheaters.
  arXiv  Detail & Related papers  (2025-05-07T19:51:28Z)
• Single-Round Proofs of Quantumness from Knowledge Assumptions [41.94295877935867]
  A proof of quantumness is an efficiently verifiable interactive test that an efficient quantum computer can pass. Existing single-round protocols require large quantum circuits, whereas multi-round ones use smaller circuits but require experimentally challenging mid-circuit measurements. We construct efficient single-round proofs of quantumness based on existing knowledge assumptions.
  arXiv  Detail & Related papers  (2024-05-24T17:33:10Z)
• Retrieving non-linear features from noisy quantum states [11.289924445850328]
  In this paper, we analyze the feasibility and efficiency of extracting high-order moments from noisy states. We first show that there exists a quantum protocol capable of accomplishing this task if and only if the underlying noise channel is invertible. Our work contributes to a deeper understanding of how quantum noise could affect high-order information extraction and provides guidance on how to tackle it.
  arXiv  Detail & Related papers  (2023-09-20T15:28:18Z)
• Experimental Multi-state Quantum Discrimination in the Frequency Domain with Quantum Dot Light [40.96261204117952]
  In this work, we present the experimental realization of a protocol employing a time-multiplexing strategy to optimally discriminate among eight non-orthogonal states. The experiment was built on a custom-designed bulk optics analyser setup and single photons generated by a nearly deterministic solid-state source. Our work paves the way for more complex applications and delivers a novel approach towards high-dimensional quantum encoding and decoding operations.
  arXiv  Detail & Related papers  (2022-09-17T12:59:09Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Quantum anonymous veto: A set of new protocols [0.41998444721319217]
  We propose protocols for quantum anonymous veto (QAV) based on different types of quantum resources. The proposed schemes are analyzed for all the requirements of a valid QAV scheme. A trade-off between correctness and robustness of the probabilistic QAV schemes is observed.
  arXiv  Detail & Related papers  (2021-09-13T18:56:09Z)
• Experimental multi-state quantum discrimination through a Quantum network [63.1241529629348]
  We have experimentally implemented two discrimination schemes in a minimum-error scenario based on a receiver featured by a network structure and a dynamical processing of information. The first protocol achieves binary optimal discrimination, while the second one provides a novel approach to multi-state quantum discrimination, relying on the dynamical features of the network-like receiver.
  arXiv  Detail & Related papers  (2021-07-21T09:26:48Z)
• Einselection from incompatible decoherence channels [62.997667081978825]
  We analyze an open quantum dynamics inspired by CQED experiments with two non-commuting Lindblad operators. We show that Fock states remain the most robust states to decoherence up to a critical coupling.
  arXiv  Detail & Related papers  (2020-01-29T14:15:19Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.