Up to today computers base on the approximation of classical electrodynamics. Due to some scaling laws the processors got smaller and faster in the last decades. At some point, the behaviour is not classical anymore and other concepts and rules are required to describe the behaviour of the processors and the computing. For some domains the quantum mechanical behaviour permits quite different computation methods and secure cryptographic methods not available with classical computing.

Structures get so small, that a bit corresponds to one particle in an quantum mechanical eigenstate, quantum computing is done with the superposition of eigenstates of entangled states. A quantum bit is a two level quantum mechanical system. A classical bit has only the classical states 0 and 1, a quantum bit can bei in a superposition of both.

Quantum computing and cryptography is based on entangeled states, cryptography additionally on different and distant tools and a detection with a projection in eigenstates again on one computer, which determines immediately the state on the other computer. Bells inequality ensures, that any attempt to spy out the message destroys the message with such an attempt.

In solid state physics the quantum bits are typically achieved with nanostructure and pseudoparticles called quantum dots. The graphics represents a naive visualisation of a grid of nine quantum bits in a 5x5 matrix changing their states from time to time represented by the change of the opacity of each quantum bit. Opacity 0 and 1 represent the two eigenstates, a value between is related to a superposition of the two eigenstates and it represents a visualisation of the probability for an eigenstate if it would have been measured with a projection into this eigenstate.

Imperfections in the current technology are visualised with different coloures, shapes and sizes for each quantum bit and slightly irregular positioning within the matrix.