Turing machines
Our traditional computers are called deterministic Turing machines, which are named after the British mathematician and computer scientist Alan Mathison Turing (1912-1954). Turing machines can process data which are stored in their bits. These can alternatively contain one of two symbols, 0 or 1. These symbols are converted by means of algorithms into others. Each algorithm consists of a sequence of functions, which are sequentially processed (calculated).
Here you may learn more about Turing machines.
Here you can configure your own state-of-the-art version of Turing machines by NOVARION.
Quantum machines
Our future computers will be Quantum machines. We are working on the development of this fascinating technology. Quantum machines are capable of processing information directly, which is stored in qubits. They can overlay multiple symbols at the same time, which is called super position. For example 0 overlaid with 1. These Quantum states are converted by means of quantum algorithms into others. Quantum states can be even combined in a way that they become dependent upon each other, which is called entanglement. In general a quantum algorithm is a combination of functions and relations. But the concrete result can only be obtained by a measurement of the qubits. This creates a definite result of the quantum machine which we understand as classical information.
Here you may learn more about Quantum machines.
Here you can configure your first systems using quantum algorithms by NOVARION or obtain an offer for a quantum security assessment.