Superadditivity of the convex closure of the output entropy of a quantum channel

2006 ◽  
Vol 61 (6) ◽  
pp. 1186-1188 ◽  
Author(s):  
M E Shirokov
2005 ◽  
Vol 5 (1) ◽  
pp. 13-31
Author(s):  
M. Hayashi ◽  
H. Imai ◽  
K. Matsumoto ◽  
M.B. Ruskai ◽  
T. Shimono

An example is given of a qubit quantum channel which requires four inputs to maximize the Holevo capacity. The example is one of a family of channels which are related to 3-state channels. The capacity of the product channel is studied and numerical evidence presented which strongly suggests additivity. The numerical evidence also supports a conjecture about the concavity of output entropy as a function of entanglement parameters. However, an example is presented which shows that for some channels this conjecture does not hold for all input states. A numerical algorithm for finding the capacity and optimal inputs is presented and its relation to a relative entropy optimization discussed.


2016 ◽  
Vol 94 (2) ◽  
Author(s):  
Laleh Memarzadeh ◽  
Stefano Mancini

Author(s):  
Bernhard M¨uhlherr ◽  
Holger P. Petersson ◽  
Richard M. Weiss

This chapter presents some results about groups generated by reflections and the standard metric on a Bruhat-Tits building. It begins with definitions relating to an affine subspace, an affine hyperplane, an affine span, an affine map, and an affine transformation. It then considers a notation stating that the convex closure of a subset a of X is the intersection of all convex sets containing a and another notation that denotes by AGL(X) the group of all affine transformations of X and by Trans(X) the set of all translations of X. It also describes Euclidean spaces and assumes that the real vector space X is of finite dimension n and that d is a Euclidean metric on X. Finally, it discusses Euclidean representations and the standard metric.


Author(s):  
Daniel E. Jones ◽  
Gabriele Riccardi ◽  
Cristian Antonelli ◽  
Michael Brodsky
Keyword(s):  

2021 ◽  
Vol 12 (1) ◽  
Author(s):  
Bartosz Regula ◽  
Ryuji Takagi

AbstractQuantum channels underlie the dynamics of quantum systems, but in many practical settings it is the channels themselves that require processing. We establish universal limitations on the processing of both quantum states and channels, expressed in the form of no-go theorems and quantitative bounds for the manipulation of general quantum channel resources under the most general transformation protocols. Focusing on the class of distillation tasks — which can be understood either as the purification of noisy channels into unitary ones, or the extraction of state-based resources from channels — we develop fundamental restrictions on the error incurred in such transformations, and comprehensive lower bounds for the overhead of any distillation protocol. In the asymptotic setting, our results yield broadly applicable bounds for rates of distillation. We demonstrate our results through applications to fault-tolerant quantum computation, where we obtain state-of-the-art lower bounds for the overhead cost of magic state distillation, as well as to quantum communication, where we recover a number of strong converse bounds for quantum channel capacity.


Sign in / Sign up

Export Citation Format

Share Document