Supermaps between channels of any type
- URL: http://arxiv.org/abs/2410.01389v1
- Date: Wed, 2 Oct 2024 09:56:26 GMT
- Title: Supermaps between channels of any type
- Authors: Robert Allen, Dominic Verdon,
- Abstract summary: We show that deterministic supermaps between channels of any type can be realised using simple circuits.
Channels include POVMs, quantum instruments, classically controlled families of quantum channels, classical channels, quantum multimeters, and more.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Supermaps between quantum channels (completely positive trace-preserving (CPTP) maps of matrix algebras) were introduced in [Chiribella et al., EPL 83(3) (2008)]. In this work we generalise to supermaps between channels of any type; by channels we mean CPTP maps of finite-dimensional C*-algebras. Channels include POVMs, quantum instruments, classically controlled families of quantum channels, classical channels, quantum multimeters, and more. We show that deterministic supermaps between channels of any type can be realised using simple circuits, recovering the previous realisation theorems of [Chiribella et al., EPL 83(3) (2008)] (for deterministic supermaps between quantum channels) and [Bluhm et al. (2024)] (for deterministic supermaps between quantum multimeters) as special cases. To prove this realisation theorem we use the graphical calculus of the 2-category of finite-dimensional 2-Hilbert spaces; the paper includes an accessible and elementary introduction to this graphical calculus, and no prior knowledge of category theory is expected of the reader.
Related papers
- 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) - Weyl channels for multipartite systems [42.37986459997699]
Quantum channels describe unitary and non-unitary evolution of quantum systems.
We show that these channels are completely characterized by elements drawn of finite cyclic groups.
arXiv Detail & Related papers (2023-10-17T02:45:47Z) - Information capacity analysis of fully correlated multi-level amplitude
damping channels [0.9790236766474201]
We investigate some of the information capacities of the simplest member of multi-level Amplitude Damping Channel, a qutrit channel.
We find the upper bounds of the single-shot classical capacities and calculate the quantum capacities associated with a specific class of maps.
arXiv Detail & Related papers (2023-05-08T06:10:56Z) - Axiomatic Approach to Quantum Superchannels [0.0]
Quantum superchannels are maps whose input and output are quantum channels.
We motivate and define superchannels on the operator system spanned by quantum channels.
arXiv Detail & Related papers (2022-10-01T20:56:57Z) - Quantum Supermaps are Characterized by Locality [0.6445605125467572]
We provide a new characterisation of quantum supermaps in terms of an axiom that refers only to sequential and parallel composition.
We do so by providing a simple definition of locally-applicable transformation on a monoidal category.
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) - Pauli component erasing quantum channels [58.720142291102135]
We propose a family of quantum maps that preserve or completely erase the components of a multi-qubit system.
For the corresponding channels, it is shown that the preserved components can be interpreted as a finite vector subspace.
We show that the obtained family of channels forms a semigroup and derive its generators.
arXiv Detail & Related papers (2022-05-12T00:11:43Z) - The platypus of the quantum channel zoo [12.4245398967236]
We study a simple, low-dimensional family of quantum channels with exotic quantum information-theoretic features.
We generalize the qutrit channel in two ways, and the resulting channels and their capacities display similarly rich behavior.
arXiv Detail & Related papers (2022-02-16T23:54:07Z) - 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) - Using Quantum Metrological Bounds in Quantum Error Correction: A Simple
Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates.
Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
arXiv Detail & Related papers (2020-04-24T17:58:10Z) - From a quantum theory to a classical one [117.44028458220427]
We present and discuss a formal approach for describing the quantum to classical crossover.
The method was originally introduced by L. Yaffe in 1982 for tackling large-$N$ quantum field theories.
arXiv Detail & Related papers (2020-04-01T09:16:38Z) - PBS-Calculus: A Graphical Language for Coherent Control of Quantum
Computations [77.34726150561087]
We introduce the PBS-calculus to represent and reason on quantum computations involving coherent control of quantum operations.
We equip the language with an equational theory, which is proved to be sound and complete.
We consider applications like the implementation of controlled permutations and the unrolling of loops.
arXiv Detail & Related papers (2020-02-21T16:15:58Z)
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.