Robustness of Fixed Points of Quantum Channels and Application to Approximate Quantum Markov Chains

• URL: http://arxiv.org/abs/2405.01532v1
• Date: Thu, 2 May 2024 17:59:19 GMT
• Title: Robustness of Fixed Points of Quantum Channels and Application to Approximate Quantum Markov Chains
• Authors: Robert Salzmann, Bjarne Bergh, Nilanjana Datta,
• Abstract summary: Given a quantum channel and a state which satisfy a fixed point equation approximately, can one find a new channel and a state, which are respectively close to the original ones, such that they satisfy an exact fixed point equation? We affirmatively answer the question, under fairly general assumptions on these structures, through a compactness argument.
• Score: 8.056359341994941
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Given a quantum channel and a state which satisfy a fixed point equation approximately (say, up to an error $\varepsilon$), can one find a new channel and a state, which are respectively close to the original ones, such that they satisfy an exact fixed point equation? It is interesting to ask this question for different choices of constraints on the structures of the original channel and state, and requiring that these are also satisfied by the new channel and state. We affirmatively answer the above question, under fairly general assumptions on these structures, through a compactness argument. Additionally, for channels and states satisfying certain specific structures, we find explicit upper bounds on the distances between the pairs of channels (and states) in question. When these distances decay quickly (in a particular, desirable manner) as $\varepsilon\to 0$, we say that the original approximate fixed point equation is rapidly fixable. We establish rapid fixability, not only for general quantum channels, but also when the original and new channels are both required to be unitary, mixed unitary or unital. In contrast, for the case of bipartite quantum systems with channels acting trivially on one subsystem, we prove that approximate fixed point equations are not rapidly fixable. In this case, the distance to the closest channel (and state) which satisfy an exact fixed point equation can depend on the dimension of the quantum system in an undesirable way. We apply our results on approximate fixed point equations to the question of robustness of quantum Markov chains (QMC) and establish the following: For any tripartite quantum state, there exists a dimension-dependent upper bound on its distance to the set of QMCs, which decays to zero as the conditional mutual information of the state vanishes.

Related papers

• Resolvability of classical-quantum channels [54.825573549226924]
  We study the resolvability of classical-quantum channels in two settings, for the channel output generated from the worst input, and form the fixed independent and identically distributed (i.i.d.) input. For the fixed-input setting, while the direct part follows from the known quantum soft covering result, we exploit the recent alternative quantum Sanov theorem to solve the strong converse.
  arXiv  Detail & Related papers  (2024-10-22T05:18:43Z)
• Joint State-Channel Decoupling and One-Shot Quantum Coding Theorem [16.05946478325466]
  We propose a joint state-channel decoupling approach to obtain a one-shot error exponent bound without smoothing. We establish a one-shot error exponent bound for quantum channel coding given by a sandwiched R'enyi coherent information.
  arXiv  Detail & Related papers  (2024-09-23T15:59:16Z)
• Tightening continuity bounds on entropies and bounds on quantum capacities [15.2292571922932]
  We prove a tight uniform continuity bound for the Shannon entropy in terms of both the local- and total variation distances. We also obtain a uniform continuity bound for the von Neumann entropy in terms of both the operator norm- and trace distances.
  arXiv  Detail & Related papers  (2023-10-26T11:50:01Z)
• Normal quantum channels and Markovian correlated two-qubit quantum errors [77.34726150561087]
  We study general normally'' distributed random unitary transformations. On the one hand, a normal distribution induces a unital quantum channel. On the other hand, the diffusive random walk defines a unital quantum process.
  arXiv  Detail & Related papers  (2023-07-25T15:33:28Z)
• Wasserstein Quantum Monte Carlo: A Novel Approach for Solving the Quantum Many-Body Schr\"odinger Equation [56.9919517199927]
  "Wasserstein Quantum Monte Carlo" (WQMC) uses the gradient flow induced by the Wasserstein metric, rather than Fisher-Rao metric, and corresponds to transporting the probability mass, rather than teleporting it. We demonstrate empirically that the dynamics of WQMC results in faster convergence to the ground state of molecular systems.
  arXiv  Detail & Related papers  (2023-07-06T17:54:08Z)
• Quantum soft-covering lemma with applications to rate-distortion coding, resolvability and identification via quantum channels [7.874708385247353]
  We prove a one-shot quantum covering lemma in terms of smooth min-entropies. We provide new upper bounds on the unrestricted and simultaneous identification capacities of quantum channels.
  arXiv  Detail & Related papers  (2023-06-21T17:53:22Z)
• Quantum Stabilizer Channel for Thermalization [0.0]
  We study the problem of quantum thermalization via discrete interactions with thermalized systems. We find a channel that solves a fixed point condition using the Choi matrix approach that is in general non-trace-preserving.
  arXiv  Detail & Related papers  (2022-09-14T17:43:21Z)
• Canonically consistent quantum master equation [68.8204255655161]
  We put forth a new class of quantum master equations that correctly reproduce the state of an open quantum system beyond the infinitesimally weak system-bath coupling limit. Our method is based on incorporating the knowledge of the reduced steady state into its dynamics.
  arXiv  Detail & Related papers  (2022-05-25T15:22:52Z)
• Computable lower bounds on the entanglement cost of quantum channels [8.37609145576126]
  A class of lower bounds for the entanglement cost of any quantum state was recently introduced in [arXiv:2111.02438]. Here we extend their definitions to point-to-point quantum channels, establishing a lower bound for the quantum entanglement cost of any channel. This leads to a bound that is computable as a semidefinite program and that can outperform previously known lower bounds.
  arXiv  Detail & Related papers  (2022-01-23T13:05:36Z)
• Q-Match: Iterative Shape Matching via Quantum Annealing [64.74942589569596]
  Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP) This paper proposes Q-Match, a new iterative quantum method for QAPs inspired by the alpha-expansion algorithm. Q-Match can be applied for shape matching problems iteratively, on a subset of well-chosen correspondences, allowing us to scale to real-world problems.
  arXiv  Detail & Related papers  (2021-05-06T17:59:38Z)
• 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.