Related papers: Private Product Computation using Quantum Entanglement

Private Product Computation using Quantum Entanglement

URL: http://arxiv.org/abs/2305.05993v2
Date: Fri, 27 Oct 2023 09:50:25 GMT
Title: Private Product Computation using Quantum Entanglement
Authors: Ren\'e B{\o}dker Christensen and Petar Popovski
Abstract summary: We show that a pair of entangled qubits can be used to compute a product privately. We give a concrete way to realize this product for arbitrary finite fields of prime order.
Score: 41.129633382222366
License: http://creativecommons.org/licenses/by/4.0/
Abstract: In this work, we show that a pair of entangled qubits can be used to compute a product privately. More precisely, two participants with a private input from a finite field can perform local operations on a shared, Bell-like quantum state, and when these qubits are later sent to a third participant, the third participant can determine the product of the inputs, but without learning more about the individual inputs. We give a concrete way to realize this product computation for arbitrary finite fields of prime order.

Related papers

Scalable Private Partition Selection via Adaptive Weighting [66.09199304818928]
In a private set union, users hold subsets of items from an unbounded universe. The goal is to output as many items as possible from the union of the users' sets while maintaining user-level differential privacy. We propose an algorithm for this problem, MaximumDegree (MAD), which adaptively reroutes weight from items with weight far above the threshold needed for privacy to items with smaller weight.
arXiv Detail & Related papers (2025-02-13T01:27:11Z)
A bound on the quantum value of all compiled nonlocal games [49.32403970784162]
A cryptographic compiler converts any nonlocal game into an interactive protocol with a single computationally bounded prover. We establish a quantum soundness result for all compiled two-player nonlocal games.
arXiv Detail & Related papers (2024-08-13T08:11:56Z)
Universal quantum computing with qubits embedded in trapped-ion qudits [0.70224924046445]
Recent developments in qudit-based quantum computing open interesting possibilities for scaling quantum processors without increasing the number of physical information carriers. We propose a method for compiling quantum circuits in the case, where qubits are embedded into qudits of experimentally relevant dimensionalities.
arXiv Detail & Related papers (2023-02-06T17:54:09Z)
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)
Three-party secure semiquantum summation without entanglement among quantum user and classical users [15.220708214434984]
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.
arXiv Detail & Related papers (2022-05-15T01:22:10Z)
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)
Ability of unbounded pairs of observers to achieve quantum advantage in random access codes with a single pair of qubits [0.0]
Complications in preparing and preserving quantum correlations stimulate recycling of a single quantum resource. We consider a scenario involving multiple independent pairs of observers acting with unbiased inputs on a single pair of spatially separated qubits sequentially.
arXiv Detail & Related papers (2021-01-04T20:33:04Z)
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)
Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
arXiv Detail & Related papers (2020-04-14T11:05:26Z)

This list is automatically generated from the titles and abstracts of the papers in this site.