Imaginarity of quantum channels: Refinement and Alternative

• URL: http://arxiv.org/abs/2405.06222v1
• Date: Fri, 10 May 2024 03:27:18 GMT
• Title: Imaginarity of quantum channels: Refinement and Alternative
• Authors: Xiangyu Chen, Qiang Lei,
• Abstract summary: We add strong monotonicity and convexity to the requirement of imaginarity measure of quantum channels to make the measure proper. We present three imaginarity measures of quantum channels via on the robustness, the trace norm and entropy, respectively.
• Score: 6.570066787107033
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: At present, quantum channels have been widely concerned, and many ways to quantify quantum channels have been proposed, which has led to the generation of many resource theories for quantum channels. We add strong monotonicity and convexity to the requirement of imaginarity measure of quantum channels to make the measure proper. We also introduce an alternative framework to simplify the process of verifying whether a quantifier is a proper measure. We present three imaginarity measures of quantum channels via on the robustness, the trace norm and entropy, respectively. Some properties are also given.

Related papers

• The multimode conditional quantum Entropy Power Inequality and the squashed entanglement of the extreme multimode bosonic Gaussian channels [53.253900735220796]
  Inequality determines the minimum conditional von Neumann entropy of the output of the most general linear mixing of bosonic quantum modes. Bosonic quantum systems constitute the mathematical model for the electromagnetic radiation in the quantum regime.
  arXiv  Detail & Related papers  (2024-10-18T13:59:50Z)
• Upper bounds on probabilities in channel measurements on qubit channels and their applications [0.0]
  We derive the upper bounds of the probability in a channel measurement for specific classes of quantum channels. These applications demonstrate the significance of the obtained upper bounds.
  arXiv  Detail & Related papers  (2024-06-21T14:25:12Z)
• Fundamental limitations on the recoverability of quantum processes [0.6990493129893111]
  We determine fundamental limitations on how well the physical transformation on quantum channels can be undone or reversed. We refine (strengthen) the quantum data processing inequality for quantum channels under the action of quantum superchannels. We also provide a refined inequality for the entropy change of quantum channels under the action of an arbitrary quantum superchannel.
  arXiv  Detail & Related papers  (2024-03-19T17:50:24Z)
• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• 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)
• Wasserstein Complexity of Quantum Circuits [10.79258896719392]
  Given a unitary transformation, what is the size of the smallest quantum circuit that implements it? This quantity, known as the quantum circuit complexity, is a fundamental property of quantum evolutions. We show that our new measure also provides a lower bound for the experimental cost of implementing quantum circuits.
  arXiv  Detail & Related papers  (2022-08-12T14:44:13Z)
• On quantum channel capacities: an additive refinement [0.0]
  Capacities of quantum channels are fundamental quantities in the theory of quantum information. Asymptotic regularization is generically necessary making the study of capacities notoriously hard. We prove additive quantities for quantum channel capacities that can be employed for quantum Shannon theorems.
  arXiv  Detail & Related papers  (2022-05-15T07:21:38Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• Depth-efficient proofs of quantumness [77.34726150561087]
  A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
  arXiv  Detail & Related papers  (2021-07-05T17:45:41Z)
• Characterizing quantum ensemble using geometric measure of quantum coherence [1.5630592429258865]
  We propose a quantumness quantifier for the quantum ensemble. It satisfies the necessary axioms of a bonafide measure of quantumness. We compute the quantumness of a few well-known ensembles.
  arXiv  Detail & Related papers  (2021-04-19T07:37:27Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)

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.