Secure two-party quantum evaluation of unitaries against specious adversaries

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We describe how any two-party quantum computation, specified by a unitary which simultaneously acts on the registers of both parties, can be privately implemented against a quantum version of classical semi-honest adversaries that we call specious. Our construction requires two ideal functionalities to garantee privacy: a private SWAP between registers held by the two parties and a classical private AND-box equivalent to oblivious transfer. If the unitary to be evaluated is in the Clifford group then only one call to SWAP is required for privacy. On the other hand, any unitary not in the Clifford requires one call to an AND-box per R-gate in the circuit. Since SWAP is itself in the Clifford group, this functionality is universal for the private evaluation of any unitary in that group. SWAP can be built from a classical bit commitment scheme or an AND-box but an AND-box cannot be constructed from SWAP. It follows that unitaries in the Clifford group are to some extent the easy ones. We also show that SWAP cannot be implemented privately in the bare model.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Secure two-party quantum evaluation of unitaries against specious adversaries does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Secure two-party quantum evaluation of unitaries against specious adversaries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Secure two-party quantum evaluation of unitaries against specious adversaries will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-562297

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.