Quantum Alice and Silent Bob: Qubit-based Quantum Key Recycling with almost no classical communication

• URL: http://arxiv.org/abs/2003.11799v1
• Date: Thu, 26 Mar 2020 08:59:49 GMT
• Title: Quantum Alice and Silent Bob: Qubit-based Quantum Key Recycling with almost no classical communication
• Authors: Daan Leermakers and Boris Skoric
• Abstract summary: We show that it is possible to put the message entirely in qubits without increasing the number of qubits. We introduce a prepare-and-measure QKR protocol where the communication from Alice to Bob consists entirely of qubits.
• Score: 2.355458445741348
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We answer an open question about Quantum Key Recycling (QKR): Is it possible to put the message entirely in the qubits without increasing the number of qubits? We show that this is indeed possible. We introduce a prepare-and-measure QKR protocol where the communication from Alice to Bob consists entirely of qubits. As usual, Bob responds with an authenticated one-bit accept/reject classical message. Compared to Quantum Key Distribution (QKD), QKR has reduced round complexity. Compared to previous qubit-wise QKR protocols, our scheme has far less classical communication. We provide a security proof in the universal composability framework and find that the communication rate is asymptotically the same as for QKD with one-way postprocessing.

Related papers

• Quantum circuit compression using qubit logic on qudits [0.0]
  We present qubit logic on qudits (QLOQ), a compression scheme in which the qubits from a hardware agnostic circuit are divided into groups of various sizes. We show that arbitrary qubit-logic unitaries can in principle be implemented with significantly fewer two-level (qubit) physical entangling gates in QLOQ than in qubit encoding.
  arXiv  Detail & Related papers  (2024-11-06T12:49:32Z)
• Quantum advantage in a unified scenario and secure detection of resources [55.2480439325792]
  We consider a single task to study different approaches of having quantum advantage. We show that the optimal success probability in the overall process for a qubit communication might be higher than that for a cbit communication.
  arXiv  Detail & Related papers  (2023-09-22T23:06:20Z)
• Prior Entanglement Exponentially Improves One-Server Quantum Private Information Retrieval for Quantum Messages [60.889483085250355]
  We find an exponential gap in the communication complexities between the presence and absence of prior entanglement. We propose an efficient one-server one-round QPIR protocol with prior entanglement.
  arXiv  Detail & Related papers  (2023-04-11T10:34:53Z)
• 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)
• Quantum Semantic Communications for Resource-Efficient Quantum Networking [52.3355619190963]
  This letter proposes a novel quantum semantic communications (QSC) framework exploiting advancements in quantum machine learning and quantum semantic representations. The proposed framework achieves approximately 50-75% reduction in quantum communication resources needed, while achieving a higher quantum semantic fidelity.
  arXiv  Detail & Related papers  (2022-05-05T03:49:19Z)
• Quantum cryptography with classical communication: parallel remote state preparation for copy-protection, verification, and more [125.99533416395765]
  Many cryptographic primitives are two-party protocols, where one party, Bob, has full quantum computational capabilities, and the other party, Alice, is only required to send random BB84 states to Bob. We show how such protocols can generically be converted to ones where Alice is fully classical, assuming that Bob cannot efficiently solve the LWE problem. This means that all communication between (classical) Alice and (quantum) Bob is classical, yet they can still make use of cryptographic primitives that would be impossible if both parties were classical.
  arXiv  Detail & Related papers  (2022-01-31T18:56:31Z)
• Computation-aided classical-quantum multiple access to boost network communication speeds [61.12008553173672]
  We quantify achievable quantum communication rates of codes with computation property for a two-sender cq-MAC. We show that it achieves the maximum possible communication rate (the single-user capacity), which cannot be achieved with conventional design.
  arXiv  Detail & Related papers  (2021-05-30T11:19:47Z)
• Trusted center verification model and classical channel remote state preparation [0.0]
  The classical channel remote state preparation (ccRSP) is an important two-party primitive in quantum cryptography. We consider a general verification protocol where the verifier or the trusted center first sends quantum states to the prover, and then the prover and the verifier exchange a constant round of classical messages. We show that the first quantum message transmission cannot be replaced with an (even approximate) ccRSP protocol while keeping the information-theoretical soundness unless BQP is contained in AM.
  arXiv  Detail & Related papers  (2020-08-11T23:16:04Z)
• Qubit-based Unclonable Encryption with Key Recycling [2.355458445741348]
  We re-visit Gottesman's Unclonable Encryption as introduced by Gottesman in 2003. We introduce a qubit-based prepare-and-measure Unclonable Encryption scheme with re-usable keys. We provide a security proof based on the diamond norm distance, taking noise into account.
  arXiv  Detail & Related papers  (2020-04-08T16:08: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.