Quick Navigation
Topics
Entanglement Theory Quantum Correlations
Quantum computation over the butterfly network
arXiv
Authors: Akihito Soeda, Yoshiyuki Kinjo, Peter S. Turner, Mio Murao
Year
2010
Paper ID
10764
Status
Preprint
Abstract Read
~2 min
Abstract Words
163
Citations
N/A
Abstract
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 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.
Why This Paper Matters
- This paper contributes to the Entanglement Theory & Quantum Correlations research area in the Quantum Articles archive.
- It adds a 2010 reference point for readers tracking recent quantum research.
- In order to investigate distributed quantum computation under restricted network resources, we introduce a quantum computation task over the butterfly network where both...
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.