Running summarizing tools on a new article

Check the paper below, then start its synthesis.


Efficient quantum-circuit simulation of classical control of computational order

Raphaël Mothe, Jessica Bavaresco

License: CC BY 4.0

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.

Submitted to arXiv on 12 Nov. 2026