Cookies help us deliver our services. By using our services, you agree to our use of cookies. Learn more
 

High-performance Computer Systems for Research, Education & Industry!

 
 

The universal quantum machine is the Holy Grail of computer science. The emphasis is on "universal". We can already build a so-called adiabatic quantum computer with about 2000 qubits as the company D-Wave demonstrated. www.dwavesys.com/d-wave-two-system

However, this quantum computer is limited on certain optimization, as for example, the trucker’s problem, where the shortest continuous path between N locations has to be found.

NOVARION works on new technologies, which the Turing machines should replace with Universal Quantum machines. These technologies use not semiconductors to further miniaturize the electronic circuits, but super conductors and optical wave guides which avoid interactions with the information carrying elementary particles.

Such Universal Quantum machines should in future not only be capable of rendering quantum algorithms, but also significantly faster compute conventional deterministic algorithms. A comparison of the performance of conventional semiconductor as well as quantum technology currently under development by the year 2025 is roughly as follows:

Halbleiter VS Supraleiter
Semiconductor vs. Superconductor, Georg Gesek

In the following, the theoretical model of a Universal Quantum machine by George Gesek is explained.

Universal Quantum Machine
Universal Quantum machine, Georg Gesek

The universal quantum machine (UQM) works analog to the non-deterministic Turing machine (NDTM) as also the UQM allows not just distinct functions between a certain set of input and output, but also ambiguous relations. From one and the same input set therefore different output sets can derive, which makes the result of a UQM partly unpredictable. Between the sets of input and output lies an algorithm which includes therefore so called quantum relations.

Differently to the Turing machine the quantum register (upper area in the figure) cannot be dated up with classical information. This is, because we need to make an interaction with the quantum machine in order to make an input. But in the quantum register there are merely stored quantum states, which would be destroyed by such an effort.

Therefore, the quantum machine not only uses the classical read-write-tape (located at the bottom of the figure) for the output of the calculation result, but also for the return of values stored in the registry as well as for the inclusion of the input data. To perform quantum algorithms at all, this classic and therefore deterministic data sets must be transferred first by a suitable physical process ("imposement', i.e. introduction) to quantum states, the so-called qubits. These qubits are stored on an own tape (in the figure the "QBIT-TIE"). In that manner the classical bits become super positioned qubits, which can be directly read, written, and processed by the quantum register. The operation here is analog to the Turing machine, just instead of classical algorithms, quantum algorithms come into action and instead of data is stored on classical bits, and the information resides at qubits. The quantum register is capable of the entanglement of qubits and the qubit-tie provides super positioning of states.

To emit a calculation result on the quantum machine, it is not enough now just to read the output of the read-write-tape, but the inverse process to the imposement has to be done before, namely a measurement of the qubits (represented by the instrument symbols in the figure). This measurement includes the stochastic effect, that of the superposed states which occur in a qubit, according to inherent probabilities, which in turn result from the previous algorithm, and result in more or less random classical output quantities, the bits. This output bits are equally written like by the Turing machine on the classical memory tape and are available either as a result, or as a classical cache for the algorithm of the Universal Quantum machine. It is apparent therefore that the UQM is capable to perform both, classical as well as quantum algorithms and thus enables it to emulate an entire Turing machine. In fact most of the known quantum algorithms, like the one by Shore, use both classical and quantum functions, which are alternately composed.

 
     
Site Notice  |  Terms of useGeneral terms and conditionsprivacy policy | © Novarion Systems GmbH 2019

Fields marked with * are required.
×
 
×