A new model of quantum computation is considered, in which the connections between gates are programmed by the state of a quantum register. This new model of computation is shown to be more powerful than the usual quantum computation, e.g. in achieving the programmability of permutations of N different unitary channels with 1 use instead of N uses per channel. For this task, a new elemental resource is needed, the quantum switch, which can be programmed to switch the order of two channels with a single use of each one
Classical computation is modular. It exploits plug n' play architectures which allow us to use pre-f...
In an ordinary quantum algorithm the gates are applied in a fixed order on the systems. The introduc...
Simulating quantum mechanical evolutions in general is difficult on classical computers because the ...
Includes bibliographical references (pages 36-37)Quantum computers will be capable of new modes of c...
Quantum computation has attracted much attention, among other things, due to its potentialities to s...
© 2018 Author(s). In this paper we propose a model of a programmable quantum processing device reali...
Research in quantum computation is looking for the consequences of having information encoding, proc...
Modern classical computing devices, except of simplest calculators, have von Neumann architecture, i...
Almost all computational tasks in the modem computer can be designed from basic building blocks. The...
The goal of the presented paper is to provide an introduction to the basic computational models used...
Quantum computation is a subject born out of the combination between physics and computer science. I...
The implementation of a quantum computer requires the realization of a large number of N-qubit unita...
Unlike fixed designs, programmable circuit designs support an infinite number of operators. The func...
The quantum circuit model is the most widely used model of quantum computation. It provides both a f...
Classical computation is modular. It exploits plug n' play architectures which allow us to use pre-f...
Classical computation is modular. It exploits plug n' play architectures which allow us to use pre-f...
In an ordinary quantum algorithm the gates are applied in a fixed order on the systems. The introduc...
Simulating quantum mechanical evolutions in general is difficult on classical computers because the ...
Includes bibliographical references (pages 36-37)Quantum computers will be capable of new modes of c...
Quantum computation has attracted much attention, among other things, due to its potentialities to s...
© 2018 Author(s). In this paper we propose a model of a programmable quantum processing device reali...
Research in quantum computation is looking for the consequences of having information encoding, proc...
Modern classical computing devices, except of simplest calculators, have von Neumann architecture, i...
Almost all computational tasks in the modem computer can be designed from basic building blocks. The...
The goal of the presented paper is to provide an introduction to the basic computational models used...
Quantum computation is a subject born out of the combination between physics and computer science. I...
The implementation of a quantum computer requires the realization of a large number of N-qubit unita...
Unlike fixed designs, programmable circuit designs support an infinite number of operators. The func...
The quantum circuit model is the most widely used model of quantum computation. It provides both a f...
Classical computation is modular. It exploits plug n' play architectures which allow us to use pre-f...
Classical computation is modular. It exploits plug n' play architectures which allow us to use pre-f...
In an ordinary quantum algorithm the gates are applied in a fixed order on the systems. The introduc...
Simulating quantum mechanical evolutions in general is difficult on classical computers because the ...