Self-testing Quantum Supermaps

Technical Summary: Self-testing Quantum Supermaps

Problem Statement
The characterization and certification of quantum resources are central to quantum information science. While "self-testing"—the device-independent identification of quantum states, measurements, and channels based solely on observed correlations and network structure—has been established for these fundamental resources, it has not previously been extended to quantum supermaps. Quantum supermaps are higher-order operations that map completely positive (CP) maps to CP maps. They include quantum combs (operations acting on channels in a fixed causal order, such as Grover's algorithm) and causally indefinite processes (operations where the causal order of channels is not well-defined, such as the quantum switch). The challenge lies in identifying these complex structures without assumptions about the internal workings of the devices involved, particularly given that supermaps act on other quantum operations rather than just static states.

Methodology
The authors propose a framework for self-testing quantum supermaps by leveraging the Choi-Jamiołkowski isomorphism generalized to higher-order operations. The core strategy involves:

1. Reference Channel Construction: Defining a reference quantum channel, $J(\bar{W})$, by inserting Swap gates into every slot of the target supermap $\bar{W}$.
2. Channel Self-Testing: Utilizing existing self-testing methods for quantum channels (which rely on self-testing the Choi state of the channel and the input states) to certify the reference channel $J(\bar{W})$.
3. Rigidity Derivation: Translating the rigidity of the reference channel back to the supermap itself. The authors identify two distinct levels of certification depending on the network connectivity assumptions of the experiment:
   • Approach A (Single Black Box per Slot): If each slot of the supermap accepts a single uncharacterized black box, the supermap can only be identified up to local embedding combs. This accounts for potential memory effects or internal wiring within the black box that cannot be distinguished from the target operation without further assumptions.
   • Approach B (Multiple Independent Black Boxes): If the network structure allows for multiple independent black boxes to be inserted into each slot (specifically accessing the input and output systems of a slot independently), the supermap can be identified up to local injection and extraction maps. This stronger assumption effectively treats the "Swap" operations as independent wires, allowing for a more precise characterization similar to standard channel self-testing.

Key Contributions and Results
The paper provides the first formal definition and explicit self-tests for quantum supermaps, demonstrating the framework through four specific examples:

1. Identity 1-Comb: The authors show how to self-test the identity comb (which maps any channel to itself) up to local embedding combs. This serves as a foundational reference, analogous to the identity channel in standard self-testing.
2. Bit-Flip Error-Correcting Comb: Using the stronger network connectivity assumption (Approach B), they provide a self-test for a comb that detects and corrects bit-flip errors, outputting a classical register indicating the correction.
3. Grover's Algorithm Comb: The paper presents the first self-test of a quantum algorithmic comb. They demonstrate how to self-test the M-slot comb corresponding to Grover's search algorithm (operating on $N=2^n$ elements with $M=O(\sqrt{N})$ queries) up to local maps. This involves constructing specific Bell inequalities to certify the Choi state of the algorithm's diffusion operator.
4. Quantum Switch: The authors provide the first self-test of a causally indefinite quantum process. By applying both approaches, they certify the quantum switch (a supermap that coherently controls the order of two operations).
   • Under the stronger connectivity assumption, the switch is identified up to local maps.
   • Under the single-box assumption, it is identified up to local embedding combs.
   • Crucially, the authors argue that because local operations and embedding combs preserve causal definiteness, a physical process that self-tests to the quantum switch must be causally indefinite. This offers a new, device-independent method to certify causal indefiniteness without relaxing the black-box assumption on the parties' operations (unlike previous approaches that required trusted quantum inputs).

Significance and Claims
The paper claims to extend the paradigm of device-independent certification to the realm of higher-order quantum operations. Its primary significance lies in:

• Generalization: Establishing that supermaps can be self-tested, bridging the gap between static resource certification and dynamic process certification.
• Algorithmic Certification: Providing the first device-independent certification of a specific quantum algorithm (Grover's) as a higher-order process.
• Causal Indefiniteness: Offering a rigorous, device-independent proof of causal indefiniteness for the quantum switch. The authors emphasize that this certification relies on specific network connectivity assumptions (e.g., independent access to slot inputs/outputs) but does not require trusting the internal mechanisms of the devices.
• Framework Flexibility: The work highlights the subtle interplay between network structure assumptions and the precision of self-testing, showing that stronger connectivity leads to stronger rigidity statements (local maps vs. embedding combs).

The authors note that their results currently assume perfect experimental statistics and that extending these findings to robust, noisy settings is a necessary future step. They also leave open the question of whether this approach can be generalized to all extremal supermaps, though they suggest a path forward based on recent results regarding the self-testing of multipartite qubit states.