Programmability of covariant quantum channels

Abstract

A programmable quantum processor uses the states of a program register to specify one element of a set of quantum channels which is applied to an input register. It is well-known that such a device is impossible with a finite-dimensional program register for any set that contains infinitely many unitary quantum channels (Nielsen and Chuang's No-Programming Theorem), meaning that a universal programmable quantum processor does not exist. The situation changes if the system has symmetries. Indeed, here we consider group-covariant channels. If the group acts irreducibly on the channel input, these channels can be implemented exactly by a programmable quantum processor with finite program dimension (via teleportation simulation, which uses the Choi-Jamiolkowski state of the channel as a program). Moreover, by leveraging the representation theory of the symmetry group action, we show how to remove redundancy in the program and prove that the resulting program register has minimum Hilbert space dimension. Furthermore, we provide upper and lower bounds on the program register dimension of a processor implementing all group-covariant channels approximately.

arXiv comment24 pages, 2 figures, published version, added Remark 13, expanded Section 3.1 and Example 23 significantly

References in corpus (31)

• Mixed State Entanglement and Quantum Error Correction
• General Benchmarks for Quantum Repeaters
• Fundamental Limits of Repeaterless Quantum Communications
• Entanglement Measures under Symmetry
• Programmable quantum gate arrays
• Aspects of generic entanglement
• Extending Noether's theorem by quantifying the asymmetry of quantum states
• Fundamentals of Quantum Information Theory
• A Sharp Fannes-type Inequality for the von Neumann Entropy
• Tight uniform continuity bounds for quantum entropies: conditional entropy, relative entropy distance and energy constraints
• Asymptotic teleportation scheme as a universal programmable quantum processor
• Converse bounds for private communication over quantum channels
• Counterexample to an additivity conjecture for output purity of quantum channels
• Separability properties of tripartite states with UxUxU-symmetry
• Fundamental limits to quantum channel discrimination
• Storing quantum dynamics in quantum states: stochastic programmable gate for U(1) operations
• On the dimension of subspaces with bounded Schmidt rank
• Probabilistic implementation of universal quantum processors
• Reexamination of optimal quantum state estimation of pure states
• Efficient universal programmable quantum measurements
• Implementation of quantum maps by programmable quantum processors
• Realization schemes for quantum instruments in finite dimensions
• Optimal universal programming of unitary gates
• Optimization and learning of quantum programs
• Convex optimization of programmable quantum computers
• Approximate programmable quantum processors
• Structure of irreducibly covariant quantum channels for finite groups
• Resource Quantification for the No-Programming Theorem
• Optimality of programmable quantum measurements
• Choi states, symmetry-based quantum gate teleportation, and stored-program quantum computing
• Robustness of Noether's principle: Maximal disconnects between conservation laws and symmetries in quantum theory

Cited by in corpus (9)

• Theory for Equivariant Quantum Neural Networks
• Covariant catalysis requires correlations and good quantum reference frames degrade little
• Linear programming with unitary-equivariant constraints
• Infinitesimal reference frames suffice to determine the asymmetry properties of a quantum system
• Storage and retrieval of von Neumann measurements
• Random covariant quantum channels
• Fundamental limitations on the recoverability of quantum processes
• Preservation of entanglement in local noisy channels
• Quantum Advantage in Storage and Retrieval of Isometry Channels