Can the quantum switch be deterministically simulated?

Can the quantum switch be deterministically simulated?

by Jessica Bavaresco

Formal & Physical Sciences Physics PHPhysicsPHQQuantum physics (quantum mechanics and quantum field theory)
🎙 Jessica Bavaresco 👥 2K 📅 April 3, 2026 ⏱ 57 min 👁 143 📄 original study 🧭 2026-08-15
Available in: English (current) Français

Keywords

quantum switchindefinite causal ordersimulationquery complexitysemidefinite programming

Summary

The seminar by Jessica Bavaresco addresses whether the quantum switch, a higher-order transformation with indefinite causal order, can be deterministically simulated by quantum circuits using additional calls to the input channels. The talk introduces the formalism of higher-order operations and explains the quantum switch’s action. The main results prove an exponential separation in query complexity: the quantum switch acting on two n-qubit channels cannot be simulated by any quantum circuit using k calls to one channel and one to the other if k < 2^n. Even with one extra call to both channels, simulation remains impossible. The results are extended to probabilistic and approximate simulations, with upper bounds on success probability. The proofs involve semidefinite programming and computer-assisted techniques. The talk also discusses a known simulation for unitary channels and highlights the robustness of the impossibility results.

137 words

Critical Evaluation

Value of the Information & Strength of the Argument

The talk provides a clear and rigorous presentation of the problem and results. The argumentation is solid, based on formal proofs and semidefinite programming. The speaker carefully explains the formalism and the significance of the results, including the exponential separation in query complexity. The use of computer-assisted proofs adds to the rigor. The presentation is well-structured, with a logical flow from background to results.

Scientific Rigor, Source Quality, Title Accuracy

The talk is based on a published paper in Nature Communications (Nat. Commun. 16, 10216 (2025)) and arXiv:2409.18202. The speaker cites relevant literature on higher-order operations and the quantum switch. The title accurately reflects the content. The presentation is scientifically rigorous, with clear definitions and proofs. The description provides a link to the seminar series website, but no additional sources are given.

141 words

Title / Content Match

The title accurately reflects the content, which focuses on the deterministic simulation of the quantum switch.

Quality & Reliability

8/10

The talk presents original research published in Nature Communications, with rigorous mathematical proofs and computer-assisted verification. The speaker is a CNRS researcher, and the work is collaborative with established researchers. The presentation is technical and precise, with clear definitions and proofs.

Key Moments

Markers derived by PSI from the transcript: the creator did not define chapters.

Cited Sources

Concurring Sources

  • Nature Communications paper — Published version of the presented work.
  • arXiv preprint — Preprint of the paper.

Contribution & Novelties

The talk presents original results on the impossibility of deterministic simulation of the quantum switch with limited extra copies, establishing an exponential separation in query complexity. This is a significant contribution to the understanding of indefinite causal order and quantum computation.

Pour aller plus loin :

  • Quantum switch — Overview of the quantum switch concept.
  • Indefinite causal order — Background on indefinite causal order in quantum mechanics.
  • Semidefinite programming — Mathematical tool used in the proofs.

76 words

Radar Profile

The radar profile shows high scores in information quality and technical level, with slightly lower scores in quantity and reliability. This indicates a technically deep and rigorous presentation, though the audience may need a strong background in quantum information.

Reliability 8/10