Towards the simulation of higher-order quantum resources: a general type-theoretic approach

• URL: http://arxiv.org/abs/2510.03622v1
• Date: Sat, 04 Oct 2025 02:07:54 GMT
• Title: Towards the simulation of higher-order quantum resources: a general type-theoretic approach
• Authors: Samuel B. Steakley, Elia Zanoni, Carlo Maria Scandolo,
• Abstract summary: We develop a theoretical framework that addresses all orders in a uniform manner.<n>We introduce a family of convex cones that generalize the notion of complete positivity to all orders.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Higher-order transformations of bidirectional quantum processes [37.129018407842445]
  Bidirectional devices are devices for which the roles of the input and output ports can be exchanged.<n>Recently, it has been shown that quantum devices can, in principle, be used in ways that are incompatible with a definite input-output direction.
  arXiv  Detail & Related papers  (2026-01-31T18:39:36Z)
• Quantum channels, complex Stiefel manifolds, and optimization [45.9982965995401]
  We establish a continuity relation between the topological space of quantum channels and the quotient of the complex Stiefel manifold. The established relation can be applied to various quantum optimization problems.
  arXiv  Detail & Related papers  (2024-08-19T09:15:54Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [88.57261102552016]
  The anticipated applications of quantum computers span across science and industry.<n>We present a survey of several potential application areas of quantum algorithms.<n>We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Is there a finite complete set of monotones in any quantum resource theory? [39.58317527488534]
  We show that there does not exist a finite set of resource monotones which completely determines all state transformations. We show that totally ordered theories allow for free transformations between all pure states.
  arXiv  Detail & Related papers  (2022-12-05T18:28:36Z)
• Quantum Supermaps are Characterized by Locality [0.20482269513546453]
  We provide a new characterisation of quantum supermaps in terms of an axiom that refers only to sequential and parallel composition.<n>We do so by providing a simple definition of locally-applicable transformation on a monoidal category.<n>In our main technical contribution, we use this diagrammatic representation to show that locally-applicable transformations on quantum channels are in one-to-one correspondence with deterministic quantum supermaps.
  arXiv  Detail & Related papers  (2022-05-19T20:36:33Z)
• No-signalling constrains quantum computation with indefinite causal structure [45.279573215172285]
  We develop a formalism for quantum computation with indefinite causal structures. We characterize the computational structure of higher order quantum maps. We prove that these rules, which have a computational and information-theoretic nature, are determined by the more physical notion of the signalling relations between the quantum systems.
  arXiv  Detail & Related papers  (2022-02-21T13:43:50Z)
• Entanglement catalysis for quantum states and noisy channels [41.94295877935867]
  We investigate properties of entanglement and its role for quantum communication. For transformations between bipartite pure states, we prove the existence of a universal catalyst. We further develop methods to estimate the number of singlets which can be established via a noisy quantum channel.
  arXiv  Detail & Related papers  (2022-02-10T18:36:25Z)
• Stochastic approximate state conversion for entanglement and general quantum resource theories [41.94295877935867]
  An important problem in any quantum resource theory is to determine how quantum states can be converted into each other. Very few results have been presented on the intermediate regime between probabilistic and approximate transformations. We show that these bounds imply an upper bound on the rates for various classes of states under probabilistic transformations. We also show that the deterministic version of the single copy bounds can be applied for drawing limitations on the manipulation of quantum channels.
  arXiv  Detail & Related papers  (2021-11-24T17:29:43Z)
• Stochastic emulation of quantum algorithms [0.0]
  We introduce higher-order partial derivatives of a probability distribution of particle positions as a new object that shares basic properties of quantum mechanical states needed for a quantum algorithm. We prove that the propagation via the map built from those universal maps reproduces up to a prefactor exactly the evolution of the quantum mechanical state. We implement several well-known quantum algorithms, analyse the scaling of the needed number of realizations with the number of qubits, and highlight the role of destructive interference for the cost of emulation.
  arXiv  Detail & Related papers  (2021-09-16T07:54:31Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Quantum circuits with classical versus quantum control of causal order [0.0]
  It is known that quantum supermaps which respect a definite, predefined causal order between their input operations correspond to fixed-order quantum circuits. Here we identify two new types of circuits that naturally generalise the fixed-order case. We show that quantum circuits with quantum control of causal order can only generate "causal" correlations, compatible with a well-defined causal order.
  arXiv  Detail & Related papers  (2021-01-21T19:00:06Z)
• QUANTIFY: A framework for resource analysis and design verification of quantum circuits [69.43216268165402]
  QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits. It is based on Google Cirq and is developed with Clifford+T circuits in mind. For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
  arXiv  Detail & Related papers  (2020-07-21T15:36:25Z)
• Genuine quantum networks: superposed tasks and addressing [68.8204255655161]
  We show how to make quantum networks, both standard and entanglement-based, genuine quantum. We provide them with the possibility of handling superposed tasks and superposed addressing.
  arXiv  Detail & Related papers  (2020-04-30T18:00:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.