2025/10/04 by Samuel B. Steakley, Steakley, Samuel B., Elia Zanoni +3
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Mechanics and Applications #Quantum Physics (quant-ph)
paper · pdf · doi:10.48550/arxiv.2510.03622
openalex publication_date 2025/10/04 · openalex created_date 2025/10/09 · openalex updated_date 2026/07/28
Quantum resources exist in a hierarchy of multiple levels. At order zero, quantum states are transformed by linear maps (channels, or gates) in order to perform computations or simulate other states. At order one, gates and channels are transformed by linear maps (superchannels) in order to simulate other gates. To develop a full hierarchy of quantum resources, beyond those first two orders, and to account for the fact that quantum protocols can interconvert resources of different orders, we need a theoretical framework that addresses all orders in a uniform manner. We introduce a framework based on a system of types, which label the different kinds of objects that are present at different orders. We equip the framework with a parallel product operation that modifies and generalizes the tensor product so as to be operationally meaningful for maps of distinct and arbitrary orders. Finally, we introduce a family of convex cones that generalize the notion of complete positivity to all orders, with the aim of characterizing the objects that are physically admissible, facilitating an operational treatment of quantum objects at any order.