On contraction coefficients, partial orders and approximation of capacities for quantum channels

• URL: http://arxiv.org/abs/2011.05949v4
• Date: Mon, 14 Nov 2022 16:06:11 GMT
• Title: On contraction coefficients, partial orders and approximation of capacities for quantum channels
• Authors: Christoph Hirche, Cambyse Rouz\'e, Daniel Stilck Fran\c{c}a
• Abstract summary: We revisit the notion of contraction coefficients of quantum channels, which provide sharper and specialized versions of the data processing inequality. A concept closely related to data processing is partial orders on quantum channels.
• Score: 2.9005223064604073
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The data processing inequality is the most basic requirement for any meaningful measure of information. It essentially states that distinguishability measures between states decrease if we apply a quantum channel and is the centerpiece of many results in information theory. Moreover, it justifies the operational interpretation of most entropic quantities. In this work, we revisit the notion of contraction coefficients of quantum channels, which provide sharper and specialized versions of the data processing inequality. A concept closely related to data processing is partial orders on quantum channels. First, we discuss several quantum extensions of the well-known less noisy ordering and relate them to contraction coefficients. We further define approximate versions of the partial orders and show how they can give strengthened and conceptually simple proofs of several results on approximating capacities. Moreover, we investigate the relation to other partial orders in the literature and their properties, particularly with regard to tensorization. We then examine the relation between contraction coefficients with other properties of quantum channels such as hypercontractivity. Next, we extend the framework of contraction coefficients to general f-divergences and prove several structural results. Finally, we consider two important classes of quantum channels, namely Weyl-covariant and bosonic Gaussian channels. For those, we determine new contraction coefficients and relations for various partial orders.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Process tensor distinguishability measures [0.0]
  We analyze two classes of distinguishability measures commonly used in general applications of quantum combs. We show that the first class, called Choi divergences, does not satisfy an important data processing inequality, while the second one, which we call generalized divergences, does.
  arXiv  Detail & Related papers  (2024-07-22T15:19:36Z)
• Contraction of Private Quantum Channels and Private Quantum Hypothesis Testing [5.211732144306638]
  We study contraction coefficient for hockey-stick divergence under privacy constraints. We also show how private quantum channels provide fairness and Holevo information stability in quantum learning settings.
  arXiv  Detail & Related papers  (2024-06-26T18:00:03Z)
• Quantum Doeblin coefficients: A simple upper bound on contraction coefficients [3.2634122554914002]
  Contraction coefficients give a quantitative strengthening of the data processing inequality. It is often challenging to calculate these coefficients. We discuss a quantum generalization of Doeblin coefficients.
  arXiv  Detail & Related papers  (2024-04-30T18:00:06Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• 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)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Bounding quantum capacities via partial orders and complementarity [9.010643838773476]
  We give operationally motivated bounds on several quantum capacities, including the quantum capacity and private capacity of a quantum channel and the one-way distillable entanglement and private key of a quantum state. Our bounds help to further understand the interplay between different capacities, as they give operational limitations on superadditivity and the difference between capacities in terms of the information-theoretic properties of the complementary channel or state.
  arXiv  Detail & Related papers  (2022-02-23T18:53:51Z)
• Experimental violations of Leggett-Garg's inequalities on a quantum computer [77.34726150561087]
  We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems. Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
  arXiv  Detail & Related papers  (2021-09-06T14:35:15Z)
• 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)
• Quantum Statistical Complexity Measure as a Signalling of Correlation Transitions [55.41644538483948]
  We introduce a quantum version for the statistical complexity measure, in the context of quantum information theory, and use it as a signalling function of quantum order-disorder transitions. We apply our measure to two exactly solvable Hamiltonian models, namely: the $1D$-Quantum Ising Model and the Heisenberg XXZ spin-$1/2$ chain. We also compute this measure for one-qubit and two-qubit reduced states for the considered models, and analyse its behaviour across its quantum phase transitions for finite system sizes as well as in the thermodynamic limit by using Bethe ansatz.
  arXiv  Detail & Related papers  (2020-02-05T00:45:21Z)

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.