Three-party secure semiquantum summation without entanglement among quantum user and classical users

• URL: http://arxiv.org/abs/2205.08319v1
• Date: Sun, 15 May 2022 01:22:10 GMT
• Title: Three-party secure semiquantum summation without entanglement among quantum user and classical users
• Authors: Jia-Li, Hu, Tian-Yu Ye
• Abstract summary: A three-party secure semiquantum summation protocol can calculate the modulo 2 addition of the private bits from one quantum participant and two classical participants. This protocol needs none of quantum entanglement swapping, the unitary operation or a pre-shared private key.
• Score: 15.220708214434984
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, a three-party secure semiquantum summation protocol, which can calculate the modulo 2 addition of the private bits from one quantum participant and two classical participants, is constructed by only using single qubits as the initial quantum resource. This protocol needs none of quantum entanglement swapping, the unitary operation or a pre-shared private key. This protocol only requires the quantum participant to perform the Z basis measurements, the X basis measurements and the Bell basis measurements. Compared with the existing only semiquantum summation protocol (Int J Theor Phys, 60 (2021) 3478), this protocol has better performance in quantum measurements for quantum participant; moreover, it may also have higher qubit efficiency.

Related papers

• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• 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)
• Oblivious Quantum Computation and Delegated Multiparty Quantum Computation [61.12008553173672]
  We propose a new concept, oblivious computation quantum computation, where secrecy of the input qubits and the program to identify the quantum gates are required. Exploiting quantum teleportation, we propose a two-server protocol for this task. Also, we discuss delegated multiparty quantum computation, in which, several users ask multiparty quantum computation to server(s) only using classical communications.
  arXiv  Detail & Related papers  (2022-11-02T09:01:33Z)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• Semiquantum secret sharing by using x-type states [4.397981844057195]
  A semiquantum secret sharing protocol based on x-type states is proposed. It can accomplish the goal that only when two classical communicants cooperate together can they extract the shared secret key of a quantum communicant. Detailed security analysis turns out that this protocol is completely robust against an eavesdropper.
  arXiv  Detail & Related papers  (2022-08-03T08:58:45Z)
• 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)
• 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)
• 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)
• 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)
• Experimental characterisation of unsharp qubit observables and sequential measurement incompatibility via quantum random access codes [0.0]
  We report an experimental implementation of unsharp qubit measurements in a sequential communication protocol. The protocol involves three parties; the first party prepares a qubit system, the second party performs operations which return a classical and quantum outcome, and the latter is measured by the third party.
  arXiv  Detail & Related papers  (2020-01-14T13:37:04Z)

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.