Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This paper introduces a unified double categorical framework using port graphs to describe various quantum computation models and their interconversions. By formally linking horizontal wires (quantum information) with vertical wires (classical control), it provides rigorous semantics for gadgets that translate between architectures like the circuit model and measurement-based approaches. This theoretical advancement clarifies how classical affine operations can simulate non-affine functions within specific quantum paradigms, offering a structured language for future hardware interoperability research.
Sources coveringarXiv, AI Alignment Forum, Latent Space, The Verge
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Double categories for adaptive quantum computation

arXiv3 min read

arXiv:2510.25915v2 Announce Type: replace Abstract: Quantum computation admits several models that emphasize different computational primitives and forms of classical control. We develop a unified double categorical framework for describing these models and the conversions between them. The syntax is provided by double port graphs, whose horizontal wires carry quantum information and whose vertical wires carry classical information and control. For each set of port labels, these graphs form a double category, and this construction is functorial in the label set. The semantics is given by the one-object double category of adaptive instruments. Its associated horizontal and vertical monoidal categories recover, respectively, quantum channels and stochastic maps. An assignment of an adaptive instrument to each primitive label therefore extends canonically to a double functor on labeled double port graphs, providing their computational semantics. We apply this framework to prominent models of quantum computation, including the circuit model, measurement-based quantum computation, quantum computation with magic states, and measurement-based Pauli computation. Gadget constructions from quantum computing that implement conversions between these models become double functors. Finally, we show that the interaction between quantum operations and affine classical control in measurement-based Pauli computation realizes every Boolean function in the vertical direction, thereby providing the non-affine classical operations required for its simulation of the circuit model.

Abstract:Quantum computation admits several models that emphasize different computational primitives and forms of classical control. We develop a unified double categorical framework for describing these models and the conversions between them. The syntax is provided by double port graphs, whose horizontal wires carry quantum information and whose vertical wires carry classical information and control. For each set of port labels, these graphs form a double category, and this construction is functorial in the label set. The semantics is given by the one-object double category of adaptive instruments. Its associated horizontal and vertical monoidal categories recover, respectively, quantum channels and stochastic maps. An assignment of an adaptive instrument to each primitive label therefore extends canonically to a double functor on labeled double port graphs, providing their computational semantics. We apply this framework to prominent models of quantum computation, including the circuit model, measurement-based quantum computation, quantum computation with magic states, and measurement-based Pauli computation. Gadget constructions from quantum computing that implement conversions between these models become double functors. Finally, we show that the interaction between quantum operations and affine classical control in measurement-based Pauli computation realizes every Boolean function in the vertical direction, thereby providing the non-affine classical operations required for its simulation of the circuit model.

Quantum Physics (quant-ph); Category Theory (math.CT)

arXiv:2510.25915 [quant-ph]

(or arXiv:2510.25915v2 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2510.25915 Focus to learn more arXiv-issued DOI via DataCite

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.

Full text under the publisher's open licence · 301 words

Related coverage