Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2511.14273

Semi-device-independent channel identification with communication matrices

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

quant-phSubmitted Nov 18, 2025• Announced Nov 19, 2025• 0 citations
arXivHTMLPDF

Abstract

We look into the task of differentiating between any two quantum channels and reconstructing them from the obtained measurement statistics with possibly limited information about the experimental set-up. We employ the communication matrix formalism where the measurement statistics of a prepare-and-measure scenario is represented as a stochastic communication matrix. In order to differentiate between any two quantum channels, the informational completeness of the set-up is both necessary and sufficient. On the other hand, if we want to uniquely characterize any quantum channel, in addition we also need to have a complete description of the set-up. We show that in many important cases we can deduce this information directly from the communication matrix of the set-up before applying the channel. Given that we trust the dimension of the system, we show that we can deduce the information completeness of the set-up directly from the rank of the communication matrix. Furthermore, we show that another quantity of the communication matrix, called the information storability, can be used to self-test the set-up (up to unitary or antiunitary freedom) for an important class of states and measurements. This provides us a semi-device-independent way to identify quantum channels from the prepare-and-measure statistics. Lastly, we consider scenarios where we might have some additional information about the channels or additional resources at our disposal which could help us relax some of the assumptions of the proposed scenario.

Related papers

Quantum correlations in prepare-and-measure scenarios and their semi-device-independent applications

Jonatan Bohr Brask, Nicolas Brunner, Jef Pauwels +2 more

A key aspect in quantum information is to understand the advantage offered by quantum systems over classical ones in communication tasks. In recent years, a fundamental approach to this problem has been developed, focusing on quantum correlations in prepare-and-measure scenarios. Inspired by the developments in Bell nonlocality and device-independent information processing, this line of research aims to characterize the possibilities and limits of quantum systems for communication, in particular to precisely capture the advantage they offer over classical systems. In addition to fundamental insights, these ideas also underpin the concept of semi-device-independent quantum information processing. Exploring trade-offs between security, performance and ease-of-implementation, this approach opens promising directions for novel quantum information processing technologies and devices. A number of protocols and proof-of-principle demonstrations have been reported in recent years, in particular for quantum randomness certification and key distribution. Here, we provide a comprehensive introduction to quantum prepare-and-measure correlations and semi-device independent applications.

quant-pharXiv:2603.23604•Mar 26, 2026•0 citations

Quantum prepare-and-measure scenarios: concepts and methods

A. de Oliveira Junior, Santiago Zamora, Jonatan Bohr Brask +2 more

Prepare-and-measure scenarios are among the simplest and most widely used settings for quantum communication. A sender prepares a physical system in one of several possible states, which a receiver then measures. Despite this simple structure, these scenarios offer a rich framework for exploring the differences between classical and quantum communication, revealing quantum advantages, and developing protocols for quantum cryptography and device certification. In this tutorial, we give a ground-up introduction to prepare-and-measure scenarios and the methods used to study them. We introduce different frameworks for constraining and characterising communication, with an emphasis on semi-device-independent approaches to quantum information. We also cover modern convex-optimisation techniques for characterising the correlations achievable in these scenarios and illustrate how these tools can be applied in practice. Our aim is to give newcomers the conceptual and technical foundations needed to approach the current literature and apply prepare-and-measure methods in their own research. We conclude with a discussion of open problems and directions for future work.

quant-pharXiv:2610.20725•Oct 16, 2026•0 citations

Information capacity of quantum communication under natural physical assumptions

Jef Pauwels, Stefano Pironio, Armin Tavakoli

The quantum prepare-and-measure scenario has been studied under various physical assumptions on the emitted states. Here, we first discuss how different assumptions are conceptually and formally related. We then identify one that can serve as a relaxation of all others, corresponding to a limitation on the one-shot accessible information of the state ensemble. This motivates us to study the optimal state discrimination probability of a source subject to these various physical assumptions. We derive general and tight bounds for states restricted by their quantum dimension, their vacuum component, an arbitrary uniform overlap, the magnitude of higher-dimensional signals and the experimenter's trust in their device. Our results constitute a first step towards a more unified picture of semi-device-independent quantum information processing.

arXiv:2405.07231•Quantum•Feb 18, 2025•9 citations

Semi-device-independent certification of high-dimensional quantum channels

Mengyan Li, Yanning Jia, Fenzhuo Guo +3 more

Certifying high-dimensional quantum channels is essential for ensuring the reliability of quantum communication protocols. Existing certification schemes often rely on fully trusted internal devices, which is difficult to achieve in realistic scenarios. Here, we propose a semi-device-independent framework for certifying channel properties directly from observed statistics, assuming only that the system dimension is known. By explicitly incorporating the full set of structural constraints inherent to Choi states, our approach exploits the Choi-Jamiołkowski isomorphism for rigorous certification of quantum channels. The entanglement dimensionality of quantum channels is first certified by introducing a witness and numerically determining its Schmidt-number-dependent bounds. This certification method reproduces known analytical benchmarks and is applied to dephasing and depolarizing noise channels, thereby confirming its validity. To provide a more complete assessment of channel performance, the entanglement fidelity of quantum channels is also certified using a hierarchy of semidefinite programming relaxations based on localizing matrices. Lower bounds on the entanglement fidelity are obtained that are compatible with either the full set of observed statistics or a single witness value.

quant-pharXiv:2602.07823•Physical Review A•Feb 10, 2026•0 citations

Characterization-free classification and identification of the environment between two quantum players

Masahito Hayashi, Longyang Cao, Baichu Yu +1 more

Identifying the causal structure of quantum channels is essential for verifying quantum networks and certifying quantum resources. We introduce a characterization-free protocol enabling two isolated players, Alice and Bob, to identify the definite-order strategy adopted by an unknown environment mediating their channels. Without assuming knowledge of their devices or the environment, the players infer the causal order solely from input-output statistics by testing Markovian conditions that we prove are necessary and sufficient for each strategy class. Remarkably, we prove that, under an explicit generic-sampling condition, a randomly selected binary measure-and-prepare setting retains exact-distribution identifiability with probability one. In the optical experiment, we use a reduced-randomness construction in which several preparation states are kept fixed. Nevertheless, the Markov-condition-based procedure yields the expected causal-order and memory-presence classification for every tested process realization and setting. This observation suggests that the randomization assumptions of the general theorem may be relaxed. Our results provide an operational framework for causal inference in quantum networks.

quant-pharXiv:2602.20997•Feb 25, 2026•0 citations

Semi-device-independent self-testing of unitary operations

Rajdeep Paul, Prabuddha Roy, A. K. Pan

We present a hitherto unexplored semi-device-independent (SDI) self-testing protocol designed to certify unitary operations within a variant of prepare-measure framework. We consider a communication game which we refer to as a variant of $3$-bit prepare-measure random access code (PMRAC) involving two parties, Alice and Bob, who share a prior two-qubit quantum state. Alice encodes her message by applying unitary operations on her subsystem and sends it to Bob. To decode the message, Bob performs a measurement on the whole system. We demonstrate that the optimal quantum advantage of the variant of $3$-bit PMRAC over the classical bound enables the self-testing of Alice's unitary operations and Bob's measurements. The derivation of the optimal quantum success probability is fully analytical. The approach is so elegant that it can be generalized for any arbitrary $n$-bit PMRAC and may also be extended to other prepare-measure communication games.

quant-pharXiv:2604.19911•Physical Review A•Apr 23, 2026•1 citation
We look into the task of differentiating between any two quantum channels and reconstructing them from the obtained measurement statistics with possibly limited information about the experimental set-up. We employ the communication matrix formalism where the measurement statistics of a prepare-and-measure scenario is represented as a stochastic communication matrix. In order to differentiate between any two quantum channels, the informational completeness of the set-up is both necessary and sufficient. On the other hand, if we want to uniquely characterize any quantum channel, in addition we also need to have a complete description of the set-up. We show that in many important cases we can deduce this information directly from the communication matrix of the set-up before applying the channel. Given that we trust the dimension of the system, we show that we can deduce the information completeness of the set-up directly from the rank of the communication matrix. Furthermore, we show that another quantity of the communication matrix, called the information storability, can be used to self-test the set-up (up to unitary or antiunitary freedom) for an important class of states and measurements. This provides us a semi-device-independent way to identify quantum channels from the prepare-and-measure statistics. Lastly, we consider scenarios where we might have some additional information about the channels or additional resources at our disposal which could help us relax some of the assumptions of the proposed scenario.
A key aspect in quantum information is to understand the advantage offered by quantum systems over classical ones in communication tasks. In recent years, a fundamental approach to this problem has been developed, focusing on quantum correlations in prepare-and-measure scenarios. Inspired by the developments in Bell nonlocality and device-independent information processing, this line of research aims to characterize the possibilities and limits of quantum systems for communication, in particular to precisely capture the advantage they offer over classical systems. In addition to fundamental insights, these ideas also underpin the concept of semi-device-independent quantum information processing. Exploring trade-offs between security, performance and ease-of-implementation, this approach opens promising directions for novel quantum information processing technologies and devices. A number of protocols and proof-of-principle demonstrations have been reported in recent years, in particular for quantum randomness certification and key distribution. Here, we provide a comprehensive introduction to quantum prepare-and-measure correlations and semi-device independent applications.
Prepare-and-measure scenarios are among the simplest and most widely used settings for quantum communication. A sender prepares a physical system in one of several possible states, which a receiver then measures. Despite this simple structure, these scenarios offer a rich framework for exploring the differences between classical and quantum communication, revealing quantum advantages, and developing protocols for quantum cryptography and device certification. In this tutorial, we give a ground-up introduction to prepare-and-measure scenarios and the methods used to study them. We introduce different frameworks for constraining and characterising communication, with an emphasis on semi-device-independent approaches to quantum information. We also cover modern convex-optimisation techniques for characterising the correlations achievable in these scenarios and illustrate how these tools can be applied in practice. Our aim is to give newcomers the conceptual and technical foundations needed to approach the current literature and apply prepare-and-measure methods in their own research. We conclude with a discussion of open problems and directions for future work.
The quantum prepare-and-measure scenario has been studied under various physical assumptions on the emitted states. Here, we first discuss how different assumptions are conceptually and formally related. We then identify one that can serve as a relaxation of all others, corresponding to a limitation on the one-shot accessible information of the state ensemble. This motivates us to study the optimal state discrimination probability of a source subject to these various physical assumptions. We derive general and tight bounds for states restricted by their quantum dimension, their vacuum component, an arbitrary uniform overlap, the magnitude of higher-dimensional signals and the experimenter's trust in their device. Our results constitute a first step towards a more unified picture of semi-device-independent quantum information processing.
Certifying high-dimensional quantum channels is essential for ensuring the reliability of quantum communication protocols. Existing certification schemes often rely on fully trusted internal devices, which is difficult to achieve in realistic scenarios. Here, we propose a semi-device-independent framework for certifying channel properties directly from observed statistics, assuming only that the system dimension is known. By explicitly incorporating the full set of structural constraints inherent to Choi states, our approach exploits the Choi-Jamiołkowski isomorphism for rigorous certification of quantum channels. The entanglement dimensionality of quantum channels is first certified by introducing a witness and numerically determining its Schmidt-number-dependent bounds. This certification method reproduces known analytical benchmarks and is applied to dephasing and depolarizing noise channels, thereby confirming its validity. To provide a more complete assessment of channel performance, the entanglement fidelity of quantum channels is also certified using a hierarchy of semidefinite programming relaxations based on localizing matrices. Lower bounds on the entanglement fidelity are obtained that are compatible with either the full set of observed statistics or a single witness value.
Identifying the causal structure of quantum channels is essential for verifying quantum networks and certifying quantum resources. We introduce a characterization-free protocol enabling two isolated players, Alice and Bob, to identify the definite-order strategy adopted by an unknown environment mediating their channels. Without assuming knowledge of their devices or the environment, the players infer the causal order solely from input-output statistics by testing Markovian conditions that we prove are necessary and sufficient for each strategy class. Remarkably, we prove that, under an explicit generic-sampling condition, a randomly selected binary measure-and-prepare setting retains exact-distribution identifiability with probability one. In the optical experiment, we use a reduced-randomness construction in which several preparation states are kept fixed. Nevertheless, the Markov-condition-based procedure yields the expected causal-order and memory-presence classification for every tested process realization and setting. This observation suggests that the randomization assumptions of the general theorem may be relaxed. Our results provide an operational framework for causal inference in quantum networks.
We present a hitherto unexplored semi-device-independent (SDI) self-testing protocol designed to certify unitary operations within a variant of prepare-measure framework. We consider a communication game which we refer to as a variant of 333-bit prepare-measure random access code (PMRAC) involving two parties, Alice and Bob, who share a prior two-qubit quantum state. Alice encodes her message by applying unitary operations on her subsystem and sends it to Bob. To decode the message, Bob performs a measurement on the whole system. We demonstrate that the optimal quantum advantage of the variant of 333-bit PMRAC over the classical bound enables the self-testing of Alice's unitary operations and Bob's measurements. The derivation of the optimal quantum success probability is fully analytical. The approach is so elegant that it can be generalized for any arbitrary nnn-bit PMRAC and may also be extended to other prepare-measure communication games.