A Multiparty Quantum Private Equality Comparison scheme relying on $\ket{ GHZ_{ 3 } }$ states

• URL: http://arxiv.org/abs/2407.05386v1
• Date: Sun, 7 Jul 2024 14:21:22 GMT
• Title: A Multiparty Quantum Private Equality Comparison scheme relying on $\ket{ GHZ_{ 3 } }$ states
• Authors: Theodore Andronikos, Alla Sirokofskich,
• Abstract summary: This paper introduces an innovative entanglement-based protocol that accomplishes multiparty quantum private comparison. It is made possible because the protocol uses only GHZ3 triplets, irrespective of the number of millionaires. The protocol is information-theoretically secure, preventing outside parties from learning about fortunes or inside players from knowing each other's secret numbers.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper introduces an innovative entanglement-based protocol that accomplishes multiparty quantum private comparison leveraging maximally entangled GHZ3 triplets. The primary motivation is the design of a protocol that can be executed by contemporary quantum computers. This is made possible because the protocol uses only GHZ3 triplets, irrespective of the number of millionaires. While more complex multi-particle entangled states are possible, they are challenging to produce with existing quantum apparatus, leading to extended preparation time and complexity, particularly in scenarios involving numerous participants. By relying on GHZ3 states, which are the easiest to produce after Bell states, we avoid these drawbacks, and take a step towards the practical implementation of the protocol. An important quantitative characteristic of this protocol is that the required quantum resources are linear both in the number of millionaires and the volume of information to be compared. A notable aspect of the protocol is its suitability for both parallel and sequential execution. Although the execution of the quantum part of the protocol is envisioned to take place completely in parallel, it is also possible to be implemented sequentially. So, if the quantum resources do not suffice for the execution of the protocol in one go, it is possible to partition the millionaires into smaller groups and process these groups sequentially. Notably, our protocol involves two third parties; Trent is now accompanied by Sophia. This dual setup allows simultaneous processing of all n millionaires' fortunes. Implementation-wise, uniformity is ensured as all millionaires use similar private quantum circuits composed of Hadamard and CNOT gates. Lastly, the protocol is information-theoretically secure, preventing outside parties from learning about fortunes or inside players from knowing each other's secret numbers.

Related papers

• A distributed and parallel $(k, n)$ QSS scheme with verification capability [0.0]
  This article introduces a novel Quantum Secret Sharing scheme with $( k, n )$ threshold and endowed with verification capability. The primary novelty of the new protocol lies in its ability to operate completely parallelly in a fully distributed setup.
  arXiv  Detail & Related papers  (2024-10-24T11:12:38Z)
• A Quantum Detectable Byzantine Agreement Protocol using only EPR pairs [0.0]
  This paper introduces a new quantum protocol for Detectable Byzantine Agreement. It uses only EPR pairs, and, in particular, $Psi + $ pairs.
  arXiv  Detail & Related papers  (2023-06-19T10:15:17Z)
• Quantum Repeater for W states [0.0]
  We introduce a quantum repeater protocol to efficiently distribute three-qubit W states over arbitrary distances. We show that the protocol allows one to deal with errors resulting from imperfect channels or state preparation, and noisy operations.
  arXiv  Detail & Related papers  (2023-04-13T18:01:22Z)
• Multi-User Entanglement Distribution in Quantum Networks Using Multipath Routing [55.2480439325792]
  We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing. The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
  arXiv  Detail & Related papers  (2023-03-06T18:06:00Z)
• Conference key agreement in a quantum network [67.410870290301]
  Quantum conference key agreement (QCKA) allows multiple users to establish a secure key from a shared multi-partite entangled state. In a quantum network, this protocol can be efficiently implemented using a single copy of a N-qubit Greenberger-Horne-Zeilinger (GHZ) state to distil a secure N-user conference key bit.
  arXiv  Detail & Related papers  (2022-07-04T18:00:07Z)
• A lightweight three-user secure quantum summation protocol without a third party based on single-particle states [0.0]
  A lightweight three-user secure quantum summation protocol is put forward by using single-particle states. This protocol only requires single-particle states rather than quantum entangled states as the initial quantum resource. Security analysis proves that this protocol is secure against both the outside attacks and the participant attacks.
  arXiv  Detail & Related papers  (2022-04-03T04:58:24Z)
• 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)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Entangled state generation via quantum walks with multiple coins [2.471925498075058]
  Entanglement swapping provides an efficient method to generate entanglement in quantum communication protocols. We propose a novel scheme to generate entangled state including two-qubit entangled state, two-qudit entangled state, three-qubit GHZ state and three-qudit GHZ state between several designate parties via the model of quantum walks with multiple coins.
  arXiv  Detail & Related papers  (2020-11-03T11:39:40Z)
• Gaussian conversion protocols for cubic phase state generation [104.23865519192793]
  Universal quantum computing with continuous variables requires non-Gaussian resources. The cubic phase state is a non-Gaussian state whose experimental implementation has so far remained elusive. We introduce two protocols that allow for the conversion of a non-Gaussian state to a cubic phase state.
  arXiv  Detail & Related papers  (2020-07-07T09:19:49Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.