Quantum computation over the butterfly network

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

12 pages, 12 figures, the second version has been significantly expanded, and author ordering changed and the third version is

Scientific paper

10.1103/PhysRevA.84.012333

In order to investigate distributed quantum computation under restricted network resources, we introduce a quantum computation task over the butterfly network where both quantum and classical communications are limited. We consider deterministically performing a two-qubit global unitary operation on two unknown inputs given at different nodes, with outputs at two distinct nodes. By using a particular resource setting introduced by M. Hayashi [Phys. Rev. A \textbf{76}, 040301(R) (2007)], which is capable of performing a swap operation by adding two maximally entangled qubits (ebits) between the two input nodes, we show that unitary operations can be performed without adding any entanglement resource, if and only if the unitary operations are locally unitary equivalent to controlled unitary operations. Our protocol is optimal in the sense that the unitary operations cannot be implemented if we relax the specifications of any of the channels. We also construct protocols for performing controlled traceless unitary operations with a 1-ebit resource and for performing global Clifford operations with a 2-ebit resource.

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

Quantum computation over the butterfly network 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 Quantum computation over the butterfly network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum computation over the butterfly network will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-422805

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