Back to News
quantum-computing

Self-testing Quantum Supermaps

arXiv Quantum Physics
Loading...
3 min read
0 likes
⚡ Quantum Brief
--> Quantum Physics arXiv:2606.25124 (quant-ph) [Submitted on 23 Jun 2026] Title:Self-testing Quantum Supermaps Authors:Victor Barizien, Cyril Branciard, Alastair A. Abbott, Jean-Daniel Bancal, Pavel Sekatski View a PDF of the paper titled Self-testing Quantum Supermaps, by Victor Barizien and 4 other authors View PDF HTML (experimental) Abstract:By certifying quantum operations from measurement statistics directly, without any assumption on the internal workings of the devices involved, self-testing enables a uniquely reliable identification of quantum objects. While such device-independent characterization has been shown to be possible for states, measurements and channels, it has so far not been extended to quantum supermaps -- operations
AI Audio Summary
0:00 / 0:00
Click to play
Self-testing Quantum Supermaps

Summarize this article with:

Quantum Physics arXiv:2606.25124 (quant-ph) [Submitted on 23 Jun 2026] Title:Self-testing Quantum Supermaps Authors:Victor Barizien, Cyril Branciard, Alastair A. Abbott, Jean-Daniel Bancal, Pavel Sekatski View a PDF of the paper titled Self-testing Quantum Supermaps, by Victor Barizien and 4 other authors View PDF HTML (experimental) Abstract:By certifying quantum operations from measurement statistics directly, without any assumption on the internal workings of the devices involved, self-testing enables a uniquely reliable identification of quantum objects. While such device-independent characterization has been shown to be possible for states, measurements and channels, it has so far not been extended to quantum supermaps -- operations that act on quantum channels themselves and can combine them in either a well-defined causal order or also, remarkably, in an indefinite causal order. Here we show that quantum supermaps can be identified device-independently. Specifically, we obtain two levels of certification, depending on the network structure of the experiment: when each slot of the supermap accepts a single uncharacterized black box, identification up to local embedding combs is obtained; when several black boxes are inserted within each slot, identification up to local extracting and injecting maps is achieved. We illustrate our approach on four examples -- the identity comb, a bit-flip error-correcting comb, the comb describing Grover's algorithm, and the quantum switch -- providing in particular the first self-test of both a quantum algorithmic comb and a causally indefinite quantum process. Notably, in the latter case, this provides a new way to certify causal indefiniteness in a device-independent manner. Comments: Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2606.25124 [quant-ph] (or arXiv:2606.25124v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2606.25124 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Victor Barizien [view email] [v1] Tue, 23 Jun 2026 19:54:13 UTC (616 KB) Full-text links: Access Paper: View a PDF of the paper titled Self-testing Quantum Supermaps, by Victor Barizien and 4 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-06 References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Read Original

Tags

quantum-networking
quantum-algorithms

Source Information

Source: arXiv Quantum Physics