Efficient quantum-circuit simulation of classical control of computational order

Understand this faster with AI
Quantum Physics arXiv:2611.17454 (quant-ph) [Submitted on 12 Nov 2026] Title:Efficient quantum-circuit simulation of classical control of computational order Authors:Raphaël Mothe, Jessica Bavaresco View a PDF of the paper titled Efficient quantum-circuit simulation of classical control of computational order, by Rapha\"el Mothe and Jessica Bavaresco View PDF Abstract:We show that quantum circuits with classical control of computational order admit an efficient simulation by fixed-order quantum circuits: any such transformation acting on $N$ independent quantum channels can be deterministically, exactly, and universally simulated using at most $N^2$ queries. We generalize these constructions to extended, bipartite quantum channels and quantum instruments, and demonstrate that they can be implemented catalytically, without consuming the additional $N^2-N$ queries required for the simulation. In the case of quantum circuits with quantum control of computational order, we prove a similar simulation result, but restricted to unitary input channels (hence non-universal). These results show the limitations of the computational power of these classes of transformations in the studied scenarios. Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2611.17454 [quant-ph] (or arXiv:2611.17454v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2611.17454 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Raphaël Mothe [view email] [v1] Thu, 12 Nov 2026 19:25:12 UTC (2,179 KB) Full-text links: Access Paper: View a PDF of the paper titled Efficient quantum-circuit simulation of classical control of computational order, by Rapha\"el Mothe and Jessica BavarescoView PDFTeX Source view license Current browse context: quant-ph new | recent | 2026-11 References & Citations INSPIRE HEP SciXGoogle 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?)
Tags
Source Information
Discussion
0 professional contributions
Sign in to join this professional discussion.
Be the first to add a constructive contribution.
