Private Product Computation using Quantum Entanglement

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/31/2023

On the Capacity of Secure K-user Product Computation over a Quantum MAC

Inspired by a recent study by Christensen and Popovski on secure 2-user ...
research
12/15/2020

Further factorization of x^n-1 over finite fields (II)

Let F_q be a finite field with q elements. Let n be a positive integer w...
research
12/13/2018

Entanglement-assisted quantum error-correcting codes over arbitrary finite fields

We prove that the known formulae for computing the optimal number of max...
research
06/15/2018

Quantum computing with classical bits

A bit-quantum map relates probabilistic information for Ising spins or c...
research
11/19/2019

Entanglement-based quantum private comparison protocol with bit-flipping

Quantum private comparison (QPC), whose security is based on the laws of...
research
07/24/2021

On relating one-way classical and quantum communication complexities

Let f: X × Y →{0,1,} be a partial function and μ be a distribution with ...
research
11/27/2021

Investigating the usefulness of Quantum Blur

Though some years remain before quantum computation can outperform conve...

Please sign up or login with your details

Forgot password? Click here to reset