Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2012.00717 · Quantum

Programmability of covariant quantum channels

Martina Gschwendtner, Andreas Blühm, Andreas Winter

Published Jun 29, 2021• 29 citations
arXivHTMLPDF

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.

DOI
10.22331/q-2021-06-29-488

Related papers

Approximate Programmable Quantum Processors in Infinite Dimensions

Martina Gschwendtner, Andreas Winter

A universal programmable quantum processor uses program quantum states to apply an arbitrary quantum channel to an input state. We generalize the concept of a finite-dimensional programmable quantum processor to infinite dimensions assuming an energy constraint on the input and output of the target quantum channels. Upper and lower bounds for the required program dimension, to approximately implement energy-limited quantum channels, are provided. In particular, we consider the implementation of Gaussian channels. Due to their practical relevance, we investigate the resource requirements for gauge covariant Gaussian channels. Additionally, we give upper and lower bounds for the program dimension of a processor implementing all Gaussian unitary channels.

•Dec 1, 2020•0 citations

Quantum Programmable Reflections

Eddie Schoute, Dmitry Grinko, Yiğit Subaşı +1 more

Similar to a classical processor, which is an algorithm for reading a program and executing its instructions on input data, a universal programmable quantum processor is a fixed quantum channel that reads a quantum program $\lvertψ_{U}\rangle$ that causes the processor to approximately apply an arbitrary unitary $U$ to a quantum data register. The present work focuses on a class of simple programmable quantum processors for implementing reflection operators, i.e. $U = e^{i π\lvertψ\rangle\langleψ\rvert}$ for an arbitrary pure state $\lvertψ\rangle$ of finite dimension $d$. Unlike quantum programs that assume query access to $U$, our program takes the form of independent copies of the state to be reflected about $\lvertψ_U\rangle = \lvertψ\rangle^{\otimes n}$. We then identify the worst-case optimal algorithm among all processors of the form $\text{tr}_{\text{Program}}[V (\lvertϕ\rangle\langleϕ\rvert \otimes (\lvertψ\rangle\langleψ\rvert)^{\otimes n}) V^\dagger]$ where the algorithm $V$ is a unitary linear combination of permutations. By generalizing these algorithms to processors for arbitrary-angle rotations, $e^{i α\lvertψ\rangle\langleψ\rvert}$ for $α\in \mathbb R$, we give a construction for a universal programmable processor with better scaling in $d$. For programming reflections, we obtain a tight analytical lower bound on the program dimension by bounding the Holevo information of an ensemble of reflections applied to an entangled probe state. The lower bound makes use of a block decomposition of the uniform ensemble of reflected states with respect to irreps of the partially transposed permutation matrix algebra, and two representation-theoretic conjectures based on extensive numerical evidence.

arXiv:2411.03648•Nov 6, 2024•7 citations

Implementation of quantum maps by programmable quantum processors

Mark S. Hillery, Mário Ziman, Vladimír Bužek

A quantum processor is a device with a data register and a program register. The input to the program register determines the operation, which is a completely positive linear map, that will be performed on the state in the data register. We develop a mathematical description for these devices, and apply it to several different examples of processors. The problem of finding a processor that will be able to implement a given set of mappings is also examined, and it is shown that, while it is possible to design a finite processor to realize the phase-damping channel, it is not possible to do so for the amplitude-damping channel.

arXiv:quant-ph/0205050•Physical Review A•Oct 4, 2002•43 citations

Approximate programmable quantum processors

Mark S. Hillery, Mário Ziman, Vladimír Bužek

A quantum processor is a programmable quantum circuit in which both the data and the program, which specifies the operation that is carried out on the data, are quantum states. We study the situation in which we want to use such a processor to approximate a set of unitary operators to a specified level of precision. We measure how well an operation is performed by the process fidelity between the desired operation and the operation produced by the processor. We show how to find the program for a given processor that produces the best approximation of a particular unitary operation. We also place bounds on the dimension of the program space that is necessary to approximate a set of unitary operators to a specified level of precision.

arXiv:quant-ph/0510161•Physical Review A•Feb 24, 2006•35 citations

Multi-output programmable quantum processor

Ya‐Fei Yu, Jian Feng, Mingsheng Zhan

By combining telecloning and the programmable quantum gate array presented by Nielsen and Chuang [Phys. Rev. Lett. 79, 321 (1997)], we propose a programmable quantum processor which can be programmed to implement a restricted set of operations with several identical data outputs. The outputs are approximately transformed versions of input data. The processor successes with certain probability.

arXiv:quant-ph/0209069•Physical Review A•Nov 19, 2002•22 citations

Convex optimization of programmable quantum computers

Leonardo Banchi, Jason L. Pereira, Seth Lloyd +1 more

Abstract A fundamental model of quantum computation is the programmable quantum gate array. This is a quantum processor that is fed by a program state that induces a corresponding quantum operation on input states. While being programmable, any finite-dimensional design of this model is known to be nonuniversal, meaning that the processor cannot perfectly simulate an arbitrary quantum channel over the input. Characterizing how close the simulation is and finding the optimal program state have been open questions for the past 20 years. Here, we answer these questions by showing that the search for the optimal program state is a convex optimization problem that can be solved via semidefinite programming and gradient-based methods commonly employed for machine learning. We apply this general result to different types of processors, from a shallow design based on quantum teleportation, to deeper schemes relying on port-based teleportation and parametric quantum circuits.

arXiv:1905.01316•npj Quantum Information•May 19, 2020•40 citations
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.
A universal programmable quantum processor uses program quantum states to apply an arbitrary quantum channel to an input state. We generalize the concept of a finite-dimensional programmable quantum processor to infinite dimensions assuming an energy constraint on the input and output of the target quantum channels. Upper and lower bounds for the required program dimension, to approximately implement energy-limited quantum channels, are provided. In particular, we consider the implementation of Gaussian channels. Due to their practical relevance, we investigate the resource requirements for gauge covariant Gaussian channels. Additionally, we give upper and lower bounds for the program dimension of a processor implementing all Gaussian unitary channels.
Similar to a classical processor, which is an algorithm for reading a program and executing its instructions on input data, a universal programmable quantum processor is a fixed quantum channel that reads a quantum program ∣ψU⟩\lvertψ_{U}\rangle∣ψU​⟩ that causes the processor to approximately apply an arbitrary unitary UUU to a quantum data register. The present work focuses on a class of simple programmable quantum processors for implementing reflection operators, i.e. U=eiπ∣ψ⟩⟨ψ∣U = e^{i π\lvertψ\rangle\langleψ\rvert}U=eiπ∣ψ⟩⟨ψ∣ for an arbitrary pure state ∣ψ⟩\lvertψ\rangle∣ψ⟩ of finite dimension ddd. Unlike quantum programs that assume query access to UUU, our program takes the form of independent copies of the state to be reflected about ∣ψU⟩=∣ψ⟩⊗n\lvertψ_U\rangle = \lvertψ\rangle^{\otimes n}∣ψU​⟩=∣ψ⟩⊗n. We then identify the worst-case optimal algorithm among all processors of the form trProgram[V(∣ϕ⟩⟨ϕ∣⊗(∣ψ⟩⟨ψ∣)⊗n)V†]\text{tr}_{\text{Program}}[V (\lvertϕ\rangle\langleϕ\rvert \otimes (\lvertψ\rangle\langleψ\rvert)^{\otimes n}) V^\dagger]trProgram​[V(∣ϕ⟩⟨ϕ∣⊗(∣ψ⟩⟨ψ∣)⊗n)V†] where the algorithm VVV is a unitary linear combination of permutations. By generalizing these algorithms to processors for arbitrary-angle rotations, eiα∣ψ⟩⟨ψ∣e^{i α\lvertψ\rangle\langleψ\rvert}eiα∣ψ⟩⟨ψ∣ for α∈Rα\in \mathbb Rα∈R, we give a construction for a universal programmable processor with better scaling in ddd. For programming reflections, we obtain a tight analytical lower bound on the program dimension by bounding the Holevo information of an ensemble of reflections applied to an entangled probe state. The lower bound makes use of a block decomposition of the uniform ensemble of reflected states with respect to irreps of the partially transposed permutation matrix algebra, and two representation-theoretic conjectures based on extensive numerical evidence.
A quantum processor is a device with a data register and a program register. The input to the program register determines the operation, which is a completely positive linear map, that will be performed on the state in the data register. We develop a mathematical description for these devices, and apply it to several different examples of processors. The problem of finding a processor that will be able to implement a given set of mappings is also examined, and it is shown that, while it is possible to design a finite processor to realize the phase-damping channel, it is not possible to do so for the amplitude-damping channel.
A quantum processor is a programmable quantum circuit in which both the data and the program, which specifies the operation that is carried out on the data, are quantum states. We study the situation in which we want to use such a processor to approximate a set of unitary operators to a specified level of precision. We measure how well an operation is performed by the process fidelity between the desired operation and the operation produced by the processor. We show how to find the program for a given processor that produces the best approximation of a particular unitary operation. We also place bounds on the dimension of the program space that is necessary to approximate a set of unitary operators to a specified level of precision.
Abstract A fundamental model of quantum computation is the programmable quantum gate array. This is a quantum processor that is fed by a program state that induces a corresponding quantum operation on input states. While being programmable, any finite-dimensional design of this model is known to be nonuniversal, meaning that the processor cannot perfectly simulate an arbitrary quantum channel over the input. Characterizing how close the simulation is and finding the optimal program state have been open questions for the past 20 years. Here, we answer these questions by showing that the search for the optimal program state is a convex optimization problem that can be solved via semidefinite programming and gradient-based methods commonly employed for machine learning. We apply this general result to different types of processors, from a shallow design based on quantum teleportation, to deeper schemes relying on port-based teleportation and parametric quantum circuits.