⚛️ quantum physics

Semi-device-independent channel identification with communication matrices

This paper proposes a semi-device-independent framework for identifying and reconstructing quantum channels using communication matrices, demonstrating that informational completeness can be verified via matrix rank and that setup self-testing is achievable through information storability under trusted dimension assumptions.

Original author: Samgeeth Puliyil, Leevi Leppäjärvi, Mário Ziman

Published 2026-11-09

📖 4 min read🧠 Deep dive

CC BY 4.0

Original author: Samgeeth Puliyil, Leevi Leppäjärvi, Mário Ziman

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the author. For technical accuracy, refer to the original paper. Read full disclaimer

In the world of quantum technology, scientists are constantly trying to build machines that can process information in ways impossible for ordinary computers. To make these machines work, they must manipulate tiny particles of light or matter, guiding them through specific changes known as quantum channels. Think of a quantum channel as a specialized tunnel that transforms a particle's state as it passes through, much like a filter that changes the color or shape of a beam of light. Verifying that these tunnels work exactly as intended is critical. If a quantum computer is to solve complex problems, its internal gates must be precise; if they are faulty, the results are useless. However, checking these channels is notoriously difficult because the particles involved are fragile and the equipment used to measure them is often imperfect. Scientists need a way to confirm that their experimental setup is trustworthy without having to know every single detail about the machinery itself, a challenge that sits at the heart of modern quantum verification.

A team of researchers has developed a new method to solve this problem, offering a way to identify and characterize these quantum channels even when the experimental setup is not fully understood. Their approach relies on a concept called a communication matrix, which is essentially a table of numbers that records the statistics of sending quantum states through a channel and measuring the results. Instead of needing a complete blueprint of the devices preparing the states or the devices measuring them, the researchers showed that the structure of this statistical table alone holds the key. They found that by simply looking at the mathematical properties of this table, specifically its rank, they could determine if the setup was powerful enough to distinguish between any two different quantum channels. If the table has a certain level of complexity, it guarantees that the setup can tell any two channels apart, even if the scientists do not know the exact nature of the states or measurements being used.

The study goes further by showing that in many practical cases, the researchers can deduce even more about the setup directly from these statistics. They identified a specific quantity within the communication matrix, which they call information storability, that acts as a self-check mechanism. When this value reaches a maximum possible limit, it proves that the setup is using a specific, optimal type of measurement and state preparation, up to a harmless rotation or reflection of the system. This allows the scientists to "self-test" their equipment, confirming its reliability without needing an external, perfectly calibrated reference. Once the setup is verified in this way, it can be used to fully reconstruct the unknown quantum channel, a process known as tomography. This provides a semi-device-independent method, meaning it requires very few assumptions about the hardware, making it robust against the imperfections that plague real-world experiments.

The researchers also explored scenarios where they might have some extra information or resources to help them. They discovered that even if the setup is not fully capable of distinguishing every possible channel, it might still be sufficient if the scientists know beforehand that the channels being tested have a specific property, such as preserving the total energy of the system. By combining the statistical data with a known reference channel, they could verify whether an unknown channel possesses this property or if the setup is suitable for testing such channels. Furthermore, they demonstrated how to detect if a channel is "entanglement-breaking," a specific type of noise that destroys the delicate quantum connections between particles. This detection is possible by analyzing how the communication matrix can be broken down into simpler, non-negative components.

Ultimately, this work provides a practical toolkit for quantum engineers who need to certify their devices without the luxury of perfect knowledge. The paper establishes that full knowledge of the experimental setup is not always necessary to tell channels apart; knowing the setup is informationally complete is enough. However, to fully map out a channel's behavior, some knowledge of the setup is required, which can often be inferred from the statistics themselves. The authors clarify that while their method is powerful for identifying channels under limited assumptions, it does not replace established techniques that use perfectly calibrated equipment. Instead, it complements them by offering a way to verify and identify channels when the equipment is imperfect or when the goal is simply to ensure consistency rather than to build a perfect map. The findings are presented as rigorous mathematical proofs, offering a clear, operational criterion for when a quantum channel can be identified from the data it produces.

Technical Summary: Semi-device-independent Channel Identification with Communication Matrices

Problem Statement
The identification of unknown quantum channels is a fundamental task in quantum information processing, essential for characterizing gates, diagnosing noise, and verifying error models. Standard approaches, such as channel tomography, require complete knowledge of the experimental setup (specifically, the states prepared and measurements performed) to reconstruct the channel transformation. However, in many practical scenarios, full characterization of the setup is costly or unavailable. The paper addresses the question of whether one can differentiate between any two quantum channels or perform channel tomography with limited, or "semi-device-independent," information about the experimental setup. Specifically, the authors investigate whether the informational completeness of a setup and the full description of its states and measurements can be deduced directly from the observed measurement statistics (communication matrices) without prior trust in the device's internal calibration.

Methodology
The authors employ the communication matrix formalism within a prepare-and-measure scenario. In this framework, a set of $m$ prepared states $\{\varrho_j\}$ and a measurement $M$ with $n$ outcomes generate a stochastic matrix $C$ where elements are $C_{jk} = \text{tr}[\varrho_j M_k]$ . When a quantum channel $\Phi$ is introduced between preparation and measurement, the resulting matrix is $C'_{jk} = \text{tr}[\Phi(\varrho_j) M_k]$ .

The analysis relies on two primary quantities derived from these matrices:

Rank: The rank of the communication matrix is linked to the linear dimension of the subspace spanned by the states and the measurement effects.
Information Storability ( $\lambda_{\max}$ ): Defined as the sum of the maximum elements in each column of the matrix, this quantity relates to the maximum amount of information that can be stored and decoded in the theory.

The authors establish necessary and sufficient conditions for channel differentiation and tomography based on the properties of these matrices, specifically investigating whether these conditions can be verified solely from the statistics.

Key Contributions and Results

Differentiation vs. Tomography: The paper rigorously distinguishes between channel differentiation (distinguishing any two channels) and channel tomography (reconstructing a specific channel).
- Differentiation: A setup can differentiate between any two quantum channels if and only if the set of prepared states and the measurement are informationally complete (spanning the entire operator space).
- Tomography: To uniquely reconstruct a channel, informational completeness is necessary, but full knowledge of the setup description (the specific states and measurement operators) is also required to solve for the channel parameters.
Semi-Device-Independent Verification:
- Rank Criterion: The authors prove that if the dimension of the system ( $d$ ) is trusted, the rank of the communication matrix $C$ (without the channel) directly reveals the informational completeness of the setup. Specifically, $\text{rank}(C) = d^2$ if and only if both the states and measurements are informationally complete. This allows for the verification of the setup's ability to differentiate any two channels without prior calibration.
- Self-Testing via Information Storability: For a specific class of setups involving rank-1 measurements and their eigenstates, the authors show that if the information storability $\lambda_{\max}(C)$ saturates the bound ( $\lambda_{\max}(C) = d$ ), the setup can be self-tested. This means the states and measurements can be identified up to a unitary or antiunitary transformation (a "gauge" freedom). This provides a semi-device-independent method to characterize the setup sufficiently for channel identification up to this symmetry.
Extensions with Additional Resources:
- Unital Channels: The paper explores scenarios where the channel is known to be unital ( $\Phi(\mathbb{1}) = \mathbb{1}$ ). In this case, full informational completeness of the states is not strictly required; a subset of states linearly independent from the identity suffices, provided the measurement is informationally complete. The authors show how to verify this condition using a completely depolarizing channel as a reference resource.
- Entanglement-Breaking Channels: The authors provide a criterion to detect if a channel is entanglement-breaking. A channel is entanglement-breaking if and only if its communication matrix admits a non-negative factorization $C' = AB$ where the positive semidefinite (psd) ranks of $A$ and $B$ are bounded by the system dimension $d$ . If the setup is informationally complete, this condition becomes necessary and sufficient.
Limitations of Multiple Uses: The paper demonstrates that using a channel multiple times sequentially does not relax the requirement for informational completeness to differentiate between arbitrary channels.

Significance and Claims
The paper claims to provide a semi-device-independent operational criterion for channel identification. Its significance lies in offering a framework where the trust required in the experimental setup is minimized:

It allows users to verify if a setup is capable of differentiating any two channels simply by checking the rank of the communication matrix, without needing to know the exact physical implementation of the states or measurements.
It enables the self-testing of standard experimental setups (e.g., those using orthogonal bases) up to unitary/antiunitary freedom, allowing for channel characterization without full calibration.
It complements existing techniques like Gate Set Tomography (GST) and Shadow Process Tomography by focusing on identifiability under limited assumptions rather than optimal statistical efficiency or full self-consistent gate-set characterization.

The authors explicitly state that their framework is not a replacement for established tomography techniques when full calibration is available but is most useful when robustness to imperfect knowledge of devices is a central consideration. They also note that their results are derived for quantum theory and that while some inequalities may translate to other operational theories, the self-testing results based on maximal information storability are specific to quantum mechanics.

More like this