Table of Contents
Fetching ...

Semi-device-independent channel identification with communication matrices

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

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.

Semi-device-independent channel identification with communication matrices

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.

Paper Structure

This paper contains 11 sections, 12 theorems, 62 equations, 2 figures.

Key Result

Lemma 1

The radius of the biggest $d^2-1$ sphere that is completely contained within the set of Bloch vectors of all $d$-dimensional quantum states is $\frac{1}{\sqrt{d-1}}$.

Figures (2)

  • Figure 1: A schematic diagram for the prepare-and-measure scenario.
  • Figure 2: A schematic diagram for the prepare-and-measure scenario in the presence of a channel.

Theorems & Definitions (31)

  • Definition 1
  • Lemma 1
  • proof
  • Proposition 1
  • proof
  • Example 1
  • Proposition 2
  • proof
  • Example 2
  • Corollary 1
  • ...and 21 more