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.00736 · PRX Quantum

Infinite-Dimensional Programmable Quantum Processors

Martina Gschwendtner, Andreas Winter

Published Jul 13, 2021• 7 citations
arXivHTMLPDF

Abstract

Programmable quantum processors for continuous-variable systems are defined, and investigated in view of their memory requirements, linking universal processors to their discrete counterparts, and deriving upper and lower bounds on the programmability of Gaussian transformations of Bosonic modes.
DOI
10.1103/prxquantum.2.030308

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

Programmable Continuous-Variable Photonic Quantum Computing in the Time Domain

Shuntaro Takeda

We report advances in time-domain continuous-variable photonic quantum computing, demonstrating a programmable quantum processor capable of processing non-Gaussian states and a programmable quantum light source that generates various non-Gaussian states with arbitrary temporal waveforms, both crucial for universal quantum computation.

European Conference on Optical Communication•Sep 28, 2025•0 citations

UNIVERSAL HYBRID QUANTUM PROCESSORS

Alexander Yu. Vlasov

A quantum processor (the programmable gate array) is a quantum network with a ˇxed structure. A space of states is represented as tensor product of data and program registers. Different unitary operations with the data register correspond to ®loaded ¯ programs without any changing or ®tuning¯ of network itself. Due to such property and undesirability of entanglement between program and data registers, universality of quantum processors is subject of rather strong restrictions. Universal ®stochastic¯ quantum gate arrays were developed by different authors. It was also proved, that ®deterministic¯ quantum processors with ˇnite-dimensional space of states may be universal only in approximate sense. In the present paper it is shown that, using hybrid system with continuous and discrete quantum variables, it is possible to suggest a design of strictly universal quantum processors. It is also shown that ®deterministic ¯ limit of speciˇc programmable ®stochastic ¯ U(1) gates (probability of success becomes unit for inˇnite program register), discussed by other authors, may be essentially the same kind of hybrid quantum systems used here.

•Jan 1, 2003•6 citations

Time-multiplexed programmable continuous-variable photonic quantum computing

Shuntaro Takeda

Photonic quantum computing has been dramatically scaled up recently by the promising approach of combining the continuous-variable" and time-multiplexing" schemes. We report on our recent development of time-multiplexed programmable continuous-variable photonic quantum computing, including a programmable loop-based quantum processor for single-mode multi-step Gaussian gates and a programmable time-multiplexed squeezed light source for initial state preparation. Our works pave the way to large-scale programmable continuous-variable quantum computing.

Quantum Communications and Quantum Imaging•Oct 3, 2023•0 citations

Programmable Continuous-Variable Photonic Quantum Computing in the Time Domain

Shuntaro Takeda

We report on our recent development of time-multiplexed programmable continuous-variable photonic quantum computing, including a programmable loop-based multi-mode quantum processor and a programmable squeezed light source. Our works pave the way to large-scale quantum computing. © 2024 The Author(s)

Conference on Lasers and Electro-Optics Pacific Rim (CLEO-PR)•Aug 4, 2024•0 citations

ALEPH-QP: Universal hybrid quantum processors

Alexander Yu. Vlasov

A quantum processor (the programmable gate array) is a quantum network with a fixed structure. A space of states is represented as tensor product of data and program registers. Different unitary operations with the data register correspond to "loaded" programs without any changing or "tuning" of network itself. Due to such property and undesirability of entanglement between program and data registers, universality of quantum processors is subject of rather strong restrictions. By different authors was developed universal "stochastic" quantum gate arrays. It was proved also, that "deterministic" quantum processors with finite-dimensional space of states may be universal only in approximate sense. In present paper is shown, that using hybrid system with continuous and discrete quantum variables, it is possible to suggest a design of strictly universal quantum processors. It is shown also that "deterministic" limit of specific programmable "stochastic" U(1) gates (probability of success becomes unit for infinite program register), discussed by other authors, may be essentially same kind of hybrid quantum systems used here.

arXiv:quant-ph/0205074•May 13, 2002•2 citations
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.
A quantum processor (the programmable gate array) is a quantum network with a ˇxed structure. A space of states is represented as tensor product of data and program registers. Different unitary operations with the data register correspond to ®loaded ¯ programs without any changing or ®tuning¯ of network itself. Due to such property and undesirability of entanglement between program and data registers, universality of quantum processors is subject of rather strong restrictions. Universal ®stochastic¯ quantum gate arrays were developed by different authors. It was also proved, that ®deterministic¯ quantum processors with ˇnite-dimensional space of states may be universal only in approximate sense. In the present paper it is shown that, using hybrid system with continuous and discrete quantum variables, it is possible to suggest a design of strictly universal quantum processors. It is also shown that ®deterministic ¯ limit of speciˇc programmable ®stochastic ¯ U(1) gates (probability of success becomes unit for inˇnite program register), discussed by other authors, may be essentially the same kind of hybrid quantum systems used here.
Photonic quantum computing has been dramatically scaled up recently by the promising approach of combining the continuous-variable" and time-multiplexing" schemes. We report on our recent development of time-multiplexed programmable continuous-variable photonic quantum computing, including a programmable loop-based quantum processor for single-mode multi-step Gaussian gates and a programmable time-multiplexed squeezed light source for initial state preparation. Our works pave the way to large-scale programmable continuous-variable quantum computing.
A quantum processor (the programmable gate array) is a quantum network with a fixed structure. A space of states is represented as tensor product of data and program registers. Different unitary operations with the data register correspond to "loaded" programs without any changing or "tuning" of network itself. Due to such property and undesirability of entanglement between program and data registers, universality of quantum processors is subject of rather strong restrictions. By different authors was developed universal "stochastic" quantum gate arrays. It was proved also, that "deterministic" quantum processors with finite-dimensional space of states may be universal only in approximate sense. In present paper is shown, that using hybrid system with continuous and discrete quantum variables, it is possible to suggest a design of strictly universal quantum processors. It is shown also that "deterministic" limit of specific programmable "stochastic" U(1) gates (probability of success becomes unit for infinite program register), discussed by other authors, may be essentially same kind of hybrid quantum systems used here.