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:quant-ph/0103127

Universal quantum processors with arbitrary radix n

Alexander Yu. Vlasov

Published Mar 22, 2001• 8 citations
arXivHTMLPDF

Abstract

Here is discussed the Hamiltonian approach to construction of deterministic universal (in approximate sense) programmable quantum circuits with qubits or any other quantum systems with dimension of Hilbert space is $n \ge 2$.

DOI
10.48550/arxiv.quant-ph/0103127

Related papers

Universal quantum processors with arbitrary radix n ? 2

Alexander Yu. Vlasov

Here is discussed the Hamiltonian approach to construction of deterministic universal (in approximate sense) programmable quantum circuits with qubits or any other quantum systems with dimension of Hilbert space is n ≥ 2.

Optical Fiber Communication Conference•Jan 1, 2001•8 citations

Infinite-Dimensional Programmable Quantum Processors

Martina Gschwendtner, Andreas Winter

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.

arXiv:2012.00736•PRX Quantum•Jul 13, 2021•10 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•7 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

UNIVERSALITY AND QUANTUM COMPUTING

Mika Hirvensalo

We briefly discuss the notions related to universal computation, especially in the context of quantum computing. The reader is assumed to have some previous knowledge on quantum computing.

WORLD SCIENTIFIC eBooks•Apr 1, 2004•0 citations

Quantum processors and controllers

Alexander Yu. Vlasov

In this paper is presented in abstract theory of quantum processors and controllers, special kind of quantum computational network defined on a composite quantum system with two parts: the controlling and controlled subsystems. Such approach formally differs from consideration of quantum control as some external influence on a system using some set of Hamiltonians or quantum gates. The model of programmed quantum controllers discussed in present paper is based on theory of universal deterministic quantum processors (programmable gate arrays). Such quantum devices may simulate arbitrary evolution of quantum system and so demonstrate an example of universal quantum control.

arXiv:quant-ph/0301147•IEEE International Workshop on Workload Characterization (WWC)•Apr 23, 2004•5 citations
Here is discussed the Hamiltonian approach to construction of deterministic universal (in approximate sense) programmable quantum circuits with qubits or any other quantum systems with dimension of Hilbert space is n≥2n \ge 2n≥2.
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.
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.
In this paper is presented in abstract theory of quantum processors and controllers, special kind of quantum computational network defined on a composite quantum system with two parts: the controlling and controlled subsystems. Such approach formally differs from consideration of quantum control as some external influence on a system using some set of Hamiltonians or quantum gates. The model of programmed quantum controllers discussed in present paper is based on theory of universal deterministic quantum processors (programmable gate arrays). Such quantum devices may simulate arbitrary evolution of quantum system and so demonstrate an example of universal quantum control.