Adversarial quantum teleportation

1. Problem Statement

Quantum teleportation (QTP) is a fundamental protocol for transmitting quantum information using pre-shared entanglement and classical communication. In experimental demonstrations, success is typically claimed if the average fidelity ($f$) of the teleported state exceeds a specific threshold ($f_{th}$).

• The Controversy: Historically, thresholds such as $f_{th} = 1/2$ and $f_{th} = 2/3$ have been proposed (e.g., by Braunstein & Kimble, and Grosshans & Grangier) to distinguish "quantum" teleportation from classical strategies. However, the justification for these specific values has often been based on intuition or specific assumptions rather than a rigorous, general framework.
• The Gap: There is a lack of a formal, adversarial framework that explains why these specific thresholds exist. Specifically, it is unclear what classical "cheating" strategies (spoofing) an adversary could employ to mimic quantum teleportation, and at what fidelity level such spoofing becomes impossible.

2. Methodology

The authors propose a rigorous adversarial framework to derive fidelity thresholds. They model quantum teleportation as a multi-party protocol involving four agents:

1. C (Certifier/Verifier): Creates the input state and measures the final output to verify fidelity.
2. D (Entanglement Supplier): Provides the entangled resource (ebit).
3. A (Sender): Performs the Bell-state measurement (BSM) and sends classical bits.
4. B (Receiver): Applies corrections based on A's bits to reconstruct the state.

Key Methodological Steps:

• Adversarial Modeling: The authors define specific "cheating" protocols where agents A and/or B attempt to spoof teleportation using only classical resources (random bits, local operations, and no quantum entanglement) while pretending to use quantum resources.
• Circuit Representation: They represent the standard QTP and various cheating strategies using explicit quantum circuit diagrams.
  • Honest Protocol ($\wp_0$): Standard teleportation.
  • Cheating Protocols:
    • $\wp_{A1}$: A measures one qubit and "trashes" (discards) the other, replacing it with a random bit.
    • $\wp_{A2}$: A trashes both qubits and replaces them with random bits.
    • $\wp_{B}$: B trashes the received qubit and replaces it with $|0\rangle$, applying corrections based only on A's first bit.
    • $\wp_{AB}$: Both A and B collaborate to cheat.
• Mathematical Formalism: The authors use linear operators, unitary gates (Hadamard, CNOT), and partial traces to mathematically describe the state evolution in both honest and cheating scenarios. They calculate the fidelity ($f$) between the target state and the reconstructed state for each scenario.
• Threshold Derivation: The threshold $f_{th}$ is defined as the maximum average fidelity achievable by a cheating strategy. If an experimental fidelity exceeds this $f_{th}$, a certificate is issued proving that quantum resources were necessarily used.

3. Key Contributions

1. Adversarial Justification of Thresholds: The paper provides the first rigorous derivation showing that the historical thresholds of $1/2$ and $2/3$ are not arbitrary but are the exact maximum fidelities achievable by specific classical cheating strategies.
2. Operational Certificates: The authors introduce a system of "Certificates" (e.g., Certificate 3, 4, 5) that can be issued based on whether the observed fidelity exceeds the calculated adversarial threshold for specific cheating models.
3. Generalization to Multi-Qubit States: Unlike previous works focusing solely on isolated qubits, this framework analyzes teleportation of entangled qubits (where the input qubit is entangled with ancillary qubits held by C). This reveals that fidelity depends on the specific state parameters (polar angle $\theta$), necessitating the use of average fidelity for robust certification.
4. Circuit-Based Analysis: The use of explicit quantum circuits to model "trashing" (discarding qubits) and "random-bit generation" provides a clear, visual, and mathematical tool for analyzing quantum information protocols beyond teleportation.

4. Results

The authors calculated the fidelity thresholds for various cheating scenarios:

• Honest Protocol ($\wp_0$):

  • In the ideal case, the fidelity is 1.
  • This serves as the baseline for perfect quantum teleportation.

• Sender Cheats ($\wp_{A1}, \wp_{A2}$):

  • Scenario: A discards quantum information and sends random classical bits.
  • Result: The maximum average fidelity achievable by the adversary is $f_{th} = 1/2$.
  • Implication: If an experiment achieves $f > 1/2$, it certifies that the sender (A) must have used quantum resources (Certificate 3). This explains the origin of the $1/2$ threshold proposed by Braunstein and Kimble.

• Receiver Cheats ($\wp_{B}$):

  • Scenario: B discards the received qubit and reconstructs a state based on partial information.
  • Result:
    • For specific input states, the fidelity can vary.
    • However, if the input state is chosen uniformly at random (averaged over the Bloch sphere) and the adversary is restricted to specific post-selection strategies (similar to the Grosshans-Grangier condition), the average fidelity threshold is $2/3$.
  • Implication: This explains the origin of the $2/3$ threshold. It represents the limit where a receiver cannot fake teleportation without quantum resources, assuming specific averaging conditions.

• Both Cheat ($\wp_{AB}$):

  • Result: The average fidelity threshold is $3/8$ (0.375) for general states, but under specific post-selection conditions similar to the $2/3$ case, the bound aligns with the receiver-cheating scenario.

• State Dependence:

  • The paper demonstrates that for entangled inputs, the instantaneous fidelity depends on the polar angle ($\theta$) of the state rotation.
  • $f(\theta) = \frac{1}{2} - \frac{1}{4}\sin^2\theta$.
  • This dependence confirms that average fidelity is the only robust metric for certification, as it is blind to the specific state preparation details.

5. Significance

• Foundational Clarity: The paper resolves long-standing debates about quantum teleportation benchmarks by grounding them in game-theoretic adversarial models. It proves that $1/2$ and $2/3$ are not just heuristic numbers but are the precise limits of classical spoofing.
• Practical Certification: The framework offers a practical method for experimentalists to certify quantum devices. By comparing experimental fidelity against these derived adversarial thresholds, one can issue a certificate guaranteeing the use of quantum resources, even in the presence of potential cheating or noise.
• Broader Applicability: The methodology of modeling protocols with "cheating" agents and deriving thresholds via circuit analysis is applicable to other quantum information tasks, such as quantum logic gates, entanglement swapping, and distributed quantum computing.
• Future Outlook: As quantum networks and the quantum internet develop, the ability to rigorously certify that a device is performing a quantum task (rather than a classical simulation) is critical. This paper provides the theoretical bedrock for such certification standards.

In summary, this work transforms the concept of "fidelity thresholds" from empirical rules into mathematically derived limits based on the capabilities of classical adversaries, providing a robust operational framework for the certification of quantum technologies.