Measure-resend semi-quantum private comparison without entanglement
- URL: http://arxiv.org/abs/2205.06408v1
- Date: Fri, 13 May 2022 00:43:05 GMT
- Title: Measure-resend semi-quantum private comparison without entanglement
- Authors: Tian-Yu Ye, Chong-Qiang Ye
- Abstract summary: 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.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In this paper, we successfully design the semi-quantum private comparison
(SQPC) protocol with the measure-resend characteristic by using two-particle
product states as the initial prepared quantum resource which allows two
classical users to compare the equality of their private secrets under the help
of a quantum third party (TP). 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.
Both the output correctness and the security against the outside attack and the
participant attack can be guaranteed. Compared with the previous SQPC
protocols, the advantage of our protocol lies in that it only employs
two-particle product states as the initial prepared quantum resource, only
requires TP to perform single-photon measurements and does not need quantum
entanglement swapping. Our protocol can be realized with current quantum
technologies.
Related papers
- Non-unitary Coupled Cluster Enabled by Mid-circuit Measurements on Quantum Computers [37.69303106863453]
We propose a state preparation method based on coupled cluster (CC) theory, which is a pillar of quantum chemistry on classical computers.
Our approach leads to a reduction of the classical computation overhead, and the number of CNOT and T gates by 28% and 57% on average.
arXiv Detail & Related papers (2024-06-17T14:10:10Z) - 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) - A Feasible Semi-quantum Private Comparison Based on Entanglement
Swapping of Bell States [5.548873288570182]
We propose a feasible semi-quantum private comparison protocol based on entanglement swapping of Bell states.
Security analysis shows that our protocol is resilient to both external and internal attacks.
Our proposed approach showcases the potential applications of entanglement swapping in the field of semi-quantum cryptography.
arXiv Detail & Related papers (2023-05-12T13:28:44Z) - Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical.
We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more.
Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
arXiv Detail & Related papers (2023-03-02T14:18:17Z) - 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) - Semiquantum private comparison based on Bell states without quantum measurements from the classical user [4.4053348026380235]
We propose a novel semiquantum private comparison protocol based on Bell states.
TP is assumed to be semi-honest in the sense that she may take all possible attacks to steal users' private inputs except conspiring with anyone.
Our protocol can take advantage over previous SQPC protocols based on Bell states in qubit efficiency.
arXiv Detail & Related papers (2022-05-10T14:32:53Z) - Quantum private comparison via cavity QED [0.0]
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%.
arXiv Detail & Related papers (2022-05-09T02:37:06Z) - 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.