Communication-Optimal Blind Quantum Protocols
- URL: http://arxiv.org/abs/2510.07112v2
- Date: Sat, 18 Oct 2025 15:56:34 GMT
- Title: Communication-Optimal Blind Quantum Protocols
- Authors: Ethan Davies, Alastair Kay,
- Abstract summary: In this paper, we consider a single step of the protocol, where Alice conveys to Bob whether or not he should implement a specific gate.<n>We use an entropy-bounding technique to quantify the minimum number of qubits that Alice must send so that Bob cannot learn anything about the gate being implemented.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: A user, Alice, wants to get server Bob to implement a quantum computation for her. However, she wants to leave him blind to what she's doing. What are the minimal communication resources Alice must use in order to achieve information-theoretic security? In this paper, we consider a single step of the protocol, where Alice conveys to Bob whether or not he should implement a specific gate. We use an entropy-bounding technique to quantify the minimum number of qubits that Alice must send so that Bob cannot learn anything about the gate being implemented. We provide a protocol that saturates this bound. In this optimal protocol, the states that Alice sends may be entangled. For Clifford gates, we prove that it is sufficient for Alice to send separable states.
Related papers
- Blackbox Model Provenance via Palimpsestic Membership Inference [96.73342141272549]
Let's say Alice trains an open-weight language model and Bob uses a blackbox derivative of Alice's model to produce text.<n>Can Alice prove that Bob is using her model, either by querying Bob's derivative model or from the text alone?<n>We use test statistics that capture correlation between Bob's model or text and the ordering of training examples in Alice's training run.
arXiv Detail & Related papers (2025-10-22T17:30:39Z) - Quantum advantage in a unified scenario and secure detection of resources [49.1574468325115]
We consider a single communication task to study different approaches of observing quantum advantage.<n>In our task, there are three parties - the Manager, Alice, and Bob.<n>We show that the goal of the task can be achieved when Alice sends a qubit.
arXiv Detail & Related papers (2023-09-22T23:06:20Z) - Identifying the value of a random variable unambiguously: Quantum versus classical approaches [44.99833362998488]
Quantum resources may provide advantage over their classical counterparts.
We construct such a task based on a game, mediated by Referee and played between Alice and Bob.
We show that if Alice sends limited amount of classical information then the game cannot be won while the quantum analogue of the limited amount of classical information' is sufficient for winning the game.
arXiv Detail & Related papers (2022-11-16T20:28:49Z) - 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) - Non-interactive XOR quantum oblivious transfer: optimal protocols and
their experimental implementations [0.0]
Oblivious transfer (OT) is an important cryptographic primitive.
We present an optimal protocol, which outperforms classical protocols.
We optically implement both the unreversed and the reversed protocols, and cheating strategies, noting that the reversed protocol is easier to implement.
arXiv Detail & Related papers (2022-09-22T20:28:39Z) - Two quantum algorithms for communication between spacelike separated
locations [0.7614628596146599]
We argue that superluminal communication is possible through state discrimination in a higher-dimensional Hilbert space using ancilla qubits.
We propose two quantum algorithms through state discrimantion for communication between two observers Alice and Bob.
arXiv Detail & Related papers (2022-09-16T06:54:22Z) - 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) - Quantum secure direct communication with private dense coding using
general preshared quantum state [59.99354397281036]
We study secure direct communication by using a general preshared quantum state and a generalization of dense coding.
For a practical application, we propose a concrete protocol and derive an upper bound of information leakage.
arXiv Detail & Related papers (2021-12-30T16:12:07Z) - A device-independent protocol for XOR oblivious transfer [0.0]
Oblivious transfer is a cryptographic primitive where Alice has two bits and Bob wishes to learn some function of them.
In this work we give a fully device-independent quantum protocol for XOR oblivious transfer.
arXiv Detail & Related papers (2020-06-11T17:59:46Z) - Superadditivity of channel capacity through quantum fields [0.0]
We study the scenario where a sender, Alice, causes information-carrying disturbances in a quantum field.
We find that the channel capacity between Alice and a receiver, Bob, is enhanced by Bob placing detectors not only inside but also outside the causal future of Alice's encoding operation.
arXiv Detail & Related papers (2020-02-11T00:53:34Z)
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.