Quantum Primitive for Output-Hiding Function Sharing: QKD and Joint Computation Applications

• URL: http://arxiv.org/abs/2606.28997v1
• Date: Sat, 27 Jun 2026 16:21:11 GMT
• Title: Quantum Primitive for Output-Hiding Function Sharing: QKD and Joint Computation Applications
• Abstract summary: Applications of the proposed primitive: Quantum Primitive for Output-Hiding Function Sharing are discussed.<n>These applications may be useful in domains such as; financial transactions, joint signaling or coordination decisions, and navigation systems, among others.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Applications of the proposed primitive: Quantum Primitive for Output-Hiding Function Sharing, are discussed for secure quantum communications and computation protocols. In particular, QKD applications provide notable enhanced security and efficiency properties relative to status-quo protocols. Additionally, we provide examples when parties may wish to encode joint functions, or decisions, which remain information-theoretically hidden from external parties and those internal to the quantum system, without additional private keys, hidden randomness, or classical communication. In particular these applications may be useful in domains such as; financial transactions, joint signaling or coordination decisions, and navigation systems, among others.

Related papers

• Quantum Primitive for Output-Hiding Function Sharing [0.0]
  A quantum information-theoretic primitive is introduced for determining a discrete-valued function that depends on multiple parties' local private inputs.<n>The primitive permits the parties to mutually learn each others' local inputs, and thereby determine function values.<n>The resulting function values are shared among the parties, but may remain information-theoretically hidden from any external observer.
  arXiv  Detail & Related papers  (2026-06-23T18:39:49Z)
• Implementation Challenges in Quantum Key Distribution [0.0]
  This study focuses on implementing and comparing two well-known QKD protocols, namely BB84 and E91, within an actual quantum computing environment.<n>By leveraging the properties of quantum superposition and quantum entanglement, the study illustrates how communicating parties can securely obtain a shared secret.
  arXiv  Detail & Related papers  (2026-02-02T00:30:44Z)
• Reinforcement Learning for Quantum Network Control with Application-Driven Objectives [53.03367590211247]
  Dynamic programming and reinforcement learning offer promising tools for optimizing control strategies.<n>We propose a novel RL framework that directly optimize non-linear, differentiable objective functions.<n>Our work comprises the first step towards non-linear objective function optimization in quantum networks with RL, opening a path towards more advanced use cases.
  arXiv  Detail & Related papers  (2025-09-12T18:41:10Z)
• Quantum Scheme for Private Set Intersection and Union Cardinality based on Quantum Homomorphic Encryption [8.715631190576067]
  A novel quantum private set intersection and union cardinality protocol is proposed, accompanied by the corresponding quantum circuits.<n>Based on quantum homomorphic encryption, the protocol allows the intersection and union cardinality of users' private sets to be computed on quantum-encrypted data.
  arXiv  Detail & Related papers  (2024-12-02T01:31:06Z)
• Towards efficient and secure quantum-classical communication networks [47.27205216718476]
  There are two primary approaches to achieving quantum-resistant security: quantum key distribution (QKD) and post-quantum cryptography (PQC) We introduce the pros and cons of these protocols and explore how they can be combined to achieve a higher level of security and/or improved performance in key distribution. We hope our discussion inspires further research into the design of hybrid cryptographic protocols for quantum-classical communication networks.
  arXiv  Detail & Related papers  (2024-11-01T23:36:19Z)
• Classical Verification of Quantum Learning [42.362388367152256]
  We develop a framework for classical verification of quantum learning. We propose a new quantum data access model that we call "mixture-of-superpositions" quantum examples. Our results demonstrate that the potential power of quantum data for learning tasks, while not unlimited, can be utilized by classical agents.
  arXiv  Detail & Related papers  (2023-06-08T00:31:27Z)
• 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)
• Multi-party Semi-quantum Secret Sharing Protocol based on Measure-flip and Reflect Operations [1.3812010983144802]
  Semi-quantum secret sharing (SQSS) protocols serve as fundamental frameworks in quantum secure multi-party computations. This paper proposes a novel SQSS protocol based on multi-particle GHZ states.
  arXiv  Detail & Related papers  (2021-09-03T08:52:17Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• 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)
• The QQUIC Transport Protocol: Quantum assisted UDP Internet Connections [11.223026257748657]
  Quantum key distribution, in 1984, is a commercialized secure communication method which enables two parties to produce shared random secret key by the nature of quantum mechanics. We propose QQUIC (Quantum assisted Quick Internet Connections) transport protocol, which modifies the famous QUIC transport protocol by employing the quantum key distribution instead of the original classical algorithms in the key exchanging stage.
  arXiv  Detail & Related papers  (2020-06-01T00:44:58Z)
• Genuine quantum networks: superposed tasks and addressing [68.8204255655161]
  We show how to make quantum networks, both standard and entanglement-based, genuine quantum. We provide them with the possibility of handling superposed tasks and superposed addressing.
  arXiv  Detail & Related papers  (2020-04-30T18:00:06Z)

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.