The resource theory of coherence for quantum channels

• URL: http://arxiv.org/abs/2006.15443v1
• Date: Sat, 27 Jun 2020 20:58:27 GMT
• Title: The resource theory of coherence for quantum channels
• Authors: F. H. Kamin, F. T. Tabesh, S. Salimi, and F. Kheirandish
• Abstract summary: We show that basis-dependent quantum asymmetric discord can never be more than the $mathcalQI$ REC for any quantum channels. For qubit channels, the relative entropy of coherence (REC) can be equivalent to the REC of their corresponding Choi states.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We define the quantum-incoherent relative entropy of coherence ($\mathcal{QI}$ REC) of quantum channels in the framework of the resource theory by using the Choi-Jamiolkowsky isomorphism. Coherence-breaking channels are introduced as free operations and their corresponding Choi states as free states. We also show the relationship between the coherence of channel and the quantum discord and find that basis-dependent quantum asymmetric discord can never be more than the $\mathcal{QI}$ REC for any quantum channels. {Also}, we prove the $\mathcal{QI}$ REC is decreasing for any divisible quantum incoherent channel and we also claim it can be considered as the quantumness of quantum channels. Moreover, we demonstrate that for qubit channels, the relative entropy of coherence (REC) can be equivalent to the REC of their corresponding Choi states and the basis-dependent quantum symmetric discord can never exceed the coherence.

Related papers

• Generalized Quantum Stein's Lemma and Reversibility of Quantum Resource Theories for Classical-Quantum Channels [8.921166277011347]
  We extend the recent proof of the Generalized Quantum Stein's Lemma by Hayashi and Yamasaki to classical-quantum (c-q) channels.<n>We analyze the composite hypothesis testing problem of testing a c-q channel $mathcalEotimes n$ against a sequence of sets of c-q channels.
  arXiv  Detail & Related papers  (2025-09-16T17:34:37Z)
• The quantum uncertainty relations of quantum channels [0.0]
  The uncertainty relation reveals the intrinsic difference between the classical world and the quantum world. We derive the quantum uncertainty relation for quantum channels with respect to the relative entropy of coherence.
  arXiv  Detail & Related papers  (2024-08-17T03:26:34Z)
• Separable Power of Classical and Quantum Learning Protocols Through the Lens of No-Free-Lunch Theorem [70.42372213666553]
  The No-Free-Lunch (NFL) theorem quantifies problem- and data-independent generalization errors regardless of the optimization process. We categorize a diverse array of quantum learning algorithms into three learning protocols designed for learning quantum dynamics under a specified observable. Our derived NFL theorems demonstrate quadratic reductions in sample complexity across CLC-LPs, ReQu-LPs, and Qu-LPs. We attribute this performance discrepancy to the unique capacity of quantum-related learning protocols to indirectly utilize information concerning the global phases of non-orthogonal quantum states.
  arXiv  Detail & Related papers  (2024-05-12T09:05:13Z)
• A note on Wigner-Yanase skew information-based uncertainty of quantum channels [11.738923802183306]
  variance of quantum channels involving a mixed state gives a hybrid of classical and quantum uncertainties. We seek certain decomposition of variance into classical and quantum parts in terms of the Wigner-Yanase skew information.
  arXiv  Detail & Related papers  (2023-12-20T06:41:02Z)
• Correlation measures of a quantum state and information characteristics of a quantum channel [0.0]
  We discuss the interconnections between basic correlation measures of a bipartite quantum state and basic information characteristics of a quantum channel. We describe properties of the (unoptimized and optimized) quantum discord in infinite bipartite systems.
  arXiv  Detail & Related papers  (2023-04-11T17:58:13Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Faithfulness and sensitivity for ancilla-assisted process tomography [0.0]
  A system-ancilla bipartite state capable of containing the complete information of an unknown quantum channel acting on the system is called faithful. We complete the proof of the equivalence and introduce the generalization of faithfulness to various classes of quantum channels.
  arXiv  Detail & Related papers  (2022-06-13T04:19:22Z)
• Extendibility limits the performance of quantum processors [5.949779668853555]
  We introduce the resource theory of unextendibility, which is associated with the inability of extending quantum entanglement in a given quantum state to multiple parties. We derive non-asymptotic, upper bounds on the rate at which quantum communication or entanglement preservation is possible by utilizing an arbitrary quantum channel a finite number of times. We show that the bounds obtained are significantly tighter than previously known bounds for quantum communication over both the depolarizing and erasure channels.
  arXiv  Detail & Related papers  (2021-08-06T14:17:08Z)
• Creating and destroying coherence with quantum channels [62.997667081978825]
  We study optimal ways to create a large amount of quantum coherence via quantum channels. correlations in multipartite systems do not enhance the ability of a quantum channel to create coherence. We show that a channel can destroy more coherence when acting on a subsystem of a bipartite state.
  arXiv  Detail & Related papers  (2021-05-25T16:44:13Z)
• Coherent control and distinguishability of quantum channels via PBS-diagrams [59.94347858883343]
  We introduce a graphical language for coherent control of general quantum channels inspired by practical quantum optical setups involving polarising beam splitters (PBS) We characterise the observational equivalence of purified channels in various coherent-control contexts, paving the way towards a faithful representation of quantum channels under coherent control.
  arXiv  Detail & Related papers  (2021-03-02T22:56:25Z)
• Quantum Channel State Masking [78.7611537027573]
  Communication over a quantum channel that depends on a quantum state is considered when the encoder has channel side information (CSI) and is required to mask information on the quantum channel state from the decoder. A full characterization is established for the entanglement-assisted masking equivocation region, and a regularized formula is given for the quantum capacity-leakage function without assistance.
  arXiv  Detail & Related papers  (2020-06-10T16:18:03Z)
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
  We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates. Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
  arXiv  Detail & Related papers  (2020-04-24T17:58:10Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.