Jordan products of quantum channels and their compatibility

Mark Girard, Martin Plávala, Jamie SikoraNature Communications 2021 · DOI

TL;DR

This paper explores the concept of "compatibility" between quantum channels, a notion crucial for understanding how multiple quantum operations can be orchestrated. The authors establish a deep connection between channel compatibility and the fundamental quantum state marginal problem, and introduce a novel generalization of the Jordan product for quantum channels, providing new tools and sufficient conditions for compatibility.

What Problem Does This Paper Address?

In quantum information processing, we often deal with sequences of operations. Sometimes, we might want to perform multiple operations simultaneously, but then later choose to use the output of only one of them, discarding the others. This is the essence of "channel compatibility." For example, imagine you have two quantum sensors, and you want to be able to process the data from either sensor, but not both simultaneously. This paper tackles the problem of determining when such a scenario is possible. Specifically, it investigates:

  • The relationship between channel compatibility and the quantum state marginal problem: This is a long-standing problem in quantum theory concerning whether a set of marginal quantum states (states of subsystems) can arise from a single joint quantum state.
  • The compatibility of measure-and-prepare channels: These are a specific type of quantum channel that are "entanglement-breaking." The paper asks if compatible measure-and-prepare channels always have a compatibilizing channel of the same type.
  • Generalizing the Jordan product to quantum channels: The Jordan product is a mathematical tool used for studying compatibility of quantum measurements. The authors extend this to channels, aiming to find new conditions for compatibility.

Methods

The paper employs a multi-pronged approach:

  • Equivalence to the Quantum State Marginal Problem: The authors demonstrate a rigorous mathematical equivalence between the problem of determining channel compatibility and the quantum state marginal problem. This means that any problem solvable by one can be translated into a problem solvable by the other.
  • Semidefinite Programming (SDP): The core of the paper involves formulating channel compatibility and its various notions (like Jordan compatibility) as semidefinite programming feasibility problems. SDPs are a powerful class of optimization problems that can be solved efficiently, providing a concrete computational framework for these questions.
  • Choi Representations: The paper heavily utilizes the Choi representation of quantum channels. This is a standard technique that maps a quantum channel to a quantum state, allowing channel properties to be analyzed using the well-developed theory of quantum states.
  • Jordan Product Generalization: A novel aspect is the generalization of the Jordan product of matrices to quantum channels. This involves defining a new operation that, when applied to two channels, yields a sufficient condition for their compatibility.
  • Numerical Analysis: The authors numerically test their findings for specific families of quantum channels (partially dephasing-depolarizing channels) to explore the regions of compatibility.

Datasets

Not discussed in the paper.

Key Insights and Ideas

  • Deep Link to State Marginal Problem: The most significant insight is the direct equivalence between channel compatibility and the quantum state marginal problem. This provides a powerful new perspective and a unified framework for studying both.
  • Measure-and-Prepare Channels are Not Always "Self-Compatibly-Generatable": A surprising result is that compatible measure-and-prepare channels do not necessarily have a compatibilizing channel of the same type. This highlights a subtlety in how these channels can be combined.
  • Jordan Product as a Compatibility Tool: The generalization of the Jordan product to quantum channels offers a new sufficient condition for compatibility. This product, and its generalized forms, are shown to have interesting properties and connections to channel compatibility.
  • SDP as a Universal Framework: The paper demonstrates that various notions of channel compatibility can be elegantly formulated as semidefinite programs, providing a unified computational approach.

Key Results

  • Equivalence: The quantum channel marginal problem is shown to be equivalent to the quantum state marginal problem.
  • Measure-and-Prepare Channels: A counterexample is provided showing that compatible measure-and-prepare channels do not necessarily possess a measure-and-prepare compatibilizer.
  • Jordan Product: A generalized Jordan product for quantum channels is introduced, and sufficient conditions for compatibility are derived based on its properties.
  • SDP Formulations: Channel compatibility and Jordan compatibility are formulated as semidefinite programs.
  • Numerical Results: Regions of compatibility for partially dephasing-depolarizing channels are numerically explored, illustrating the interplay between different notions of compatibility.

Limitations and Future Work

  • Conjecture on Jordan Compatibility: The paper conjectures that for channels with the same input and output spaces, compatibility is equivalent to Jordan compatibility. This remains an open problem.
  • Computational Complexity: The computational complexity of determining channel compatibility is suggested to be QMA-hard, similar to the quantum state marginal problem, but this requires further investigation.
  • Generalization to Other Quantum Objects: The authors suggest extending the study of compatibility to other quantum objects like quantum strategies, combs, or channels in other generalized probabilistic theories.
  • Connection to Cryptography: The potential relationship between channel compatibility and cryptographic security is highlighted as an area for future research.

Summary updated

Abstract

Given two quantum channels, we examine the task of determining whether they are compatible-meaning that one can perform both channels simultaneously but, in the future, choose exactly one channel whose output is desired (while forfeiting the output of the other channel). Here, we present several results concerning this task. First, we show it is equivalent to the quantum state marginal problem, i.e., every quantum state marginal problem can be recast as the compatibility of two channels, and vice versa. Second, we show that compatible measure-and-prepare channels (i.e., entanglement-breaking channels) do not necessarily have a measure-and-prepare compatibilizing channel. Third, we extend the notion of the Jordan product of matrices to quantum channels and present sufficient conditions for channel compatibility. These Jordan products and their generalizations might be of independent interest. Last, we formulate the different notions of compatibility as semidefinite programs and numerically test when families of partially dephasing-depolarizing channels are compatible.
BibTeX
@inproceedings{girard2021jordan,
  author = {Mark Girard and Martin Plávala and Jamie Sikora},
  title = {{Jordan products of quantum channels and their compatibility}},
  booktitle = {Nature Communications},
  year = {2021},
  doi = {10.1038/s41467-021-22275-0},
}
Figure