Efficient Quantum Voting with Information-Theoretic Security

• URL: http://arxiv.org/abs/2112.14242v1
• Date: Tue, 28 Dec 2021 18:10:44 GMT
• Title: Efficient Quantum Voting with Information-Theoretic Security
• Authors: Emil T. Khabiboulline, Juspreet Singh Sandhu, Marco Ugo Gambetta, Mikhail D. Lukin, Johannes Borregaard
• Abstract summary: We show that the use of quantum networks can enable information-theoretic security for the desirable aspects of a distributed voting scheme. In our approach, ballot information is encoded in quantum states that enable an exponential reduction in communication complexity.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Ensuring security and integrity of elections constitutes an important challenge with wide-ranging societal implications. Classically, security guarantees can be ensured based on computational complexity, which may be challenged by quantum computers. We show that the use of quantum networks can enable information-theoretic security for the desirable aspects of a distributed voting scheme in a resource-efficient manner. In our approach, ballot information is encoded in quantum states that enable an exponential reduction in communication complexity compared to classical communication. In addition, we provide an efficient and secure anonymous queuing protocol. As a result, our scheme only requires modest quantum memories with size scaling logarithmically with the number of voters. This intrinsic efficiency together with certain noise-robustness of our protocol paves the way for its physical implementation in realistic quantum networks.

Related papers

• Provably Robust Training of Quantum Circuit Classifiers Against Parameter Noise [49.97673761305336]
  Noise remains a major obstacle to achieving reliable quantum algorithms.<n>We present a provably noise-resilient training theory and algorithm to enhance the robustness of parameterized quantum circuit classifiers.
  arXiv  Detail & Related papers  (2025-05-24T02:51:34Z)
• Authenticated Sublinear Quantum Private Information Retrieval [12.91566002502802]
  This paper introduces a novel lower bound on communication complexity using quantum relative entropy and mutual information. By leveraging Uhlmann's lemma and quantum Pinsker inequalities, the authors establish tighter bounds for information-theoretic security.
  arXiv  Detail & Related papers  (2025-04-05T03:30:04Z)
• Pseudorandom quantum authentication [0.8204952610951527]
  We introduce the pseudorandom quantum authentication scheme (PQAS) It is an efficient method for quantum states that relies solely on the existence of pseudorandom unitaries (PRUs)
  arXiv  Detail & Related papers  (2025-01-01T20:46:37Z)
• Towards efficient and secure quantum-classical communication networks [47.27205216718476]
  There are two primary approaches to achieving quantum-resistant security: quantum key distribution (QKD) and post-quantum cryptography (PQC) We introduce the pros and cons of these protocols and explore how they can be combined to achieve a higher level of security and/or improved performance in key distribution. We hope our discussion inspires further research into the design of hybrid cryptographic protocols for quantum-classical communication networks.
  arXiv  Detail & Related papers  (2024-11-01T23:36:19Z)
• Experimental coherent-state quantum secret sharing with finite pulses [15.261941167557849]
  Quantum secret sharing (QSS) plays a significant role in quantum communication. We propose a three-user QSS protocol based on phase-encoding technology. Our protocol achieves secure key rates ranging from 432 to 192 bps.
  arXiv  Detail & Related papers  (2024-10-08T09:01:06Z)
• Guarantees on the structure of experimental quantum networks [105.13377158844727]
  Quantum networks connect and supply a large number of nodes with multi-party quantum resources for secure communication, networked quantum computing and distributed sensing. As these networks grow in size, certification tools will be required to answer questions regarding their properties. We demonstrate a general method to guarantee that certain correlations cannot be generated in a given quantum network.
  arXiv  Detail & Related papers  (2024-03-04T19:00:00Z)
• Privacy-preserving quantum federated learning via gradient hiding [5.543544712471747]
  This paper presents innovative quantum protocols with quantum communication designed to address the privacy problem. In contrast to previous works that leverage expressive variational quantum circuits or differential privacy techniques, we consider gradient information concealment using quantum states. We propose two distinct FL protocols, one based on private inner-product estimation and the other on incremental learning.
  arXiv  Detail & Related papers  (2023-12-07T17:16:30Z)
• Robust and efficient verification of graph states in blind measurement-based quantum computation [52.70359447203418]
  Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
  arXiv  Detail & Related papers  (2023-05-18T06:24:45Z)
• Secure Key from Quantum Discord [22.97866257572447]
  We show how to make use of discord to analyze security in a specific quantum cryptography protocol. Our method is robust against imperfections in qubit sources and qubit measurements as well as basis misalignment due to quantum channels.
  arXiv  Detail & Related papers  (2023-04-12T14:21:49Z)
• NEQRX: Efficient Quantum Image Encryption with Reduced Circuit Complexity [2.7985570786346745]
  We propose an efficient implementation scheme for a quantum image encryption algorithm combining the generalized affine transform and logistic map. We achieve a remarkable 50% reduction in cost while maintaining security and efficiency.
  arXiv  Detail & Related papers  (2022-04-14T10:15:23Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• The Computational and Latency Advantage of Quantum Communication Networks [70.01340727637825]
  This article summarises the current status of classical communication networks. It identifies some critical open research challenges that can only be solved by leveraging quantum technologies.
  arXiv  Detail & Related papers  (2021-06-07T06:31:02Z)
• Delegating Multi-Party Quantum Computations vs. Dishonest Majority in Two Quantum Rounds [0.0]
  Multi-Party Quantum Computation (MPQC) has attracted a lot of attention as a potential killer-app for quantum networks. We present a composable protocol achieving blindness and verifiability even in the case of a single honest client.
  arXiv  Detail & Related papers  (2021-02-25T15:58:09Z)
• Entanglement transfer, accumulation and retrieval via quantum-walk-based qubit-qudit dynamics [50.591267188664666]
  Generation and control of quantum correlations in high-dimensional systems is a major challenge in the present landscape of quantum technologies. We propose a protocol that is able to attain entangled states of $d$-dimensional systems through a quantum-walk-based it transfer & accumulate mechanism. In particular, we illustrate a possible photonic implementation where the information is encoded in the orbital angular momentum and polarization degrees of freedom of single photons.
  arXiv  Detail & Related papers  (2020-10-14T14:33:34Z)
• Quantum noise protects quantum classifiers against adversaries [120.08771960032033]
  Noise in quantum information processing is often viewed as a disruptive and difficult-to-avoid feature, especially in near-term quantum technologies. We show that by taking advantage of depolarisation noise in quantum circuits for classification, a robustness bound against adversaries can be derived. This is the first quantum protocol that can be used against the most general adversaries.
  arXiv  Detail & Related papers  (2020-03-20T17:56:14Z)

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.