{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T17:27:50Z","timestamp":1758475670794},"reference-count":0,"publisher":"Rinton Press","issue":"15&16","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["QIC"],"published-print":{"date-parts":[[2016,11]]},"abstract":"<jats:p>The coherence power of a quantum channel, that is, its maximum ability to increase the coherence of input states, is a fundamental concept within the framework of the resource theory of coherence. In this note we discuss various possible definitions of coherence power and coherence rate and their basic properties. Then we prove that the coherence power of a unitary operator acting on a qubit, computed with respect to the l1-coherence measure, can be calculated by maximizing its coherence gain over pure incoherent states. We proceed to show that this result fails in the general case, that is, the maximal coherence gain is found when acting on a state with non-vanishing coherence in the case of the l1-coherence and dimension N &gt; 2, the relative entropy of coherence and the geometric measure of coherence.<\/jats:p>","DOI":"10.26421\/qic16.15-16-2","type":"journal-article","created":{"date-parts":[[2021,2,25]],"date-time":"2021-02-25T02:02:10Z","timestamp":1614218530000},"page":"1282-1294","source":"Crossref","is-referenced-by-count":9,"title":["A note on coherence power of n-dimensional unitary operators"],"prefix":"10.26421","volume":"16","author":[{"given":"Maria","family":"Garcia-Diaz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dario","family":"Egloff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin B.","family":"Plenio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"10955","published-online":{"date-parts":[[2016,11]]},"container-title":["Quantum Information and Computation"],"original-title":[],"deposited":{"date-parts":[[2021,2,25]],"date-time":"2021-02-25T02:02:12Z","timestamp":1614218532000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rintonpress.com\/journals\/doi\/QIC16.15-16-2.html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11]]},"references-count":0,"journal-issue":{"issue":"15&16","published-online":{"date-parts":[[2016,11]]},"published-print":{"date-parts":[[2016,11]]}},"URL":"https:\/\/doi.org\/10.26421\/qic16.15-16-2","relation":{},"ISSN":["1533-7146","1533-7146"],"issn-type":[{"value":"1533-7146","type":"print"},{"value":"1533-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11]]}}}