DeepAI AI Chat
Log In Sign Up

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.


page 1

page 2

page 3

page 4


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 ...

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...

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

We prove that the known formulae for computing the optimal number of max...

Quantum computing with classical bits

A bit-quantum map relates probabilistic information for Ising spins or c...

Entanglement-based quantum private comparison protocol with bit-flipping

Quantum private comparison (QPC), whose security is based on the laws of...

On relating one-way classical and quantum communication complexities

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

Investigating the usefulness of Quantum Blur

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