Quantum private comparison via cavity QED

• URL: http://arxiv.org/abs/2205.04011v1
• Date: Mon, 9 May 2022 02:37:06 GMT
• Title: Quantum private comparison via cavity QED
• Authors: Tian-Yu Ye
• Abstract summary: The proposed protocol adopts two-atom product states rather than entangled states as the initial quantum resource. The qubit efficiency of the proposed protocol is as high as 50%.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The first quantum private comparison (QPC) protocol via cavity quantum electrodynamics (QED) is proposed in this paper by making full use of the evolution law of atom via cavity QED, where the third party (TP) is allowed to misbehave on his own but cannot conspire with either of the two users. The proposed protocol adopts two-atom product states rather than entangled states as the initial quantum resource, and only needs single-atom measurements for two users. Both the unitary operations and the quantum entanglement swapping operation are not necessary for the proposed protocol. The proposed protocol can compare the equality of one bit from each user in each round comparison with one two-atom product state. The proposed protocol can resist both the outside attack and the participant attack. Particularly, it can prevent TP from knowing two users' secrets. Furthermore, the qubit efficiency of the proposed protocol is as high as 50%.

Related papers

• 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)
• Semiquantum private comparison via cavity QED [8.62421338326666]
  We design the first semiquantum private comparison (SQPC) protocol which is realized via cavity quantum electrodynamics (QED) With the help of a semi-honest third party (TP), the proposed protocol can compare the equality of private inputs from two semiquantum parties who only have limited quantum capabilities.
  arXiv  Detail & Related papers  (2023-09-23T02:02:21Z)
• Quantum Two-Way Communication Protocol Beyond Superdense Coding [36.25599253958745]
  We introduce a generalization of one-way superdense coding to two-way communication protocols for transmitting classical bits by using entangled quantum pairs. The proposed protocol gives a 50% increase in both data rate and energy efficiency compared to the classical protocol.
  arXiv  Detail & Related papers  (2023-09-06T08:48:07Z)
• Multi-party quantum private comparison of size relationship with two third parties based on d-dimensional Bell states [5.12433745864982]
  The proposed MQPC protocol is adaptive forthe case that users want to compare the size relationship of their private integers under the control of two supervisors. The proposed MQPC protocol can be used in the strange user environment, because there are not any communication and pre-shared key between each pair of users.
  arXiv  Detail & Related papers  (2022-10-25T01:15:04Z)
• A novel multi-party semiquantum private comparison protocol of size relationship with d-dimensional single-particle states [0.0]
  This protocol requires the help of one quantum third party (TP) and one classical TP. Neither quantum entanglement swapping nor unitary operations are necessary for implementing this protocol.
  arXiv  Detail & Related papers  (2022-08-30T16:35:55Z)
• 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)
• Measure-resend semi-quantum private comparison without entanglement [0.0]
  Our protocol allows two classical users to compare the equality of their private secrets under the help of a quantum third party. The quantum TP is semi-honest in the sense that he is allowed to misbehave on his own but cannot conspire with either of users.
  arXiv  Detail & Related papers  (2022-05-13T00:43:05Z)
• 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)
• 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)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)

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.