Quick Navigation
Topics
Open Quantum Systems Decoherence
Convex approximations of quantum channels
arXiv
Authors: Massimiliano F. Sacchi, Tito Sacchi
Year
2017
Paper ID
7538
Status
Preprint
Abstract Read
~2 min
Abstract Words
105
Citations
N/A
Abstract
We address the problem of optimally approximating the action of a desired and unavailable quantum channel Φ having at our disposal a single use of a given set of other channels \{Ψi \}. The problem is recast to look for the least distinguishable channel from Φ among the convex set sumi pi Ψi, and the corresponding optimal weights \{ pi \} provide the optimal convex mixing of the available channels \{Ψi \}. For single-qubit channels we study specifically the cases where the available convex set corresponds to covariant channels or to Pauli channels, and the desired target map is an arbitrary unitary transformation or a generalized damping channel.
Why This Paper Matters
- This paper contributes to the Open Quantum Systems & Decoherence research area in the Quantum Articles archive.
- It adds a 2017 reference point for readers tracking recent quantum research.
- We address the problem of optimally approximating the action of a desired and unavailable quantum channel Φ having at our disposal a single use of a given set of other channels Ψi.
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.