# Quantum computer facts for kids

A **quantum computer** is a model of how to build a computer. The idea is that quantum computers can use certain phenomena from quantum mechanics, such as superposition and entanglement, to perform operations on data. The basic principle behind quantum computation is that quantum properties can be used to represent data and perform operations on it. A theoretical model is the quantum Turing machine, also known as the universal quantum computer.

The idea of quantum computing is still very new. Experiments have been done. In these, a very small number of operations were done on qubits (**qu**antum **bit**). Both practical and theoretical research continues with interest, and many national government and military funding agencies support quantum computing research to develop quantum computers for both civilian and military purposes, such as cryptanalysis.

Today's computers, called "classical" computers, store information in binary; each bit is either on or off. Quantum computation use qubits, which, in addition to being possibly on or off, can be both on and off, which is a way of describing superposition, until a measurement is made. The state of a piece of data on a normal computer is known with certainty, but quantum computation uses probabilities. Only very simple quantum computers have been built, although larger designs have been invented. Quantum computation uses a special type of physics, quantum physics.

If large-scale quantum computers can be built, they will be able to solve some problems much more quickly than any computer that exists today (such as Shor's algorithm). Quantum computers are different from other computers such as DNA computers and traditional computers based on transistors. Some computing architectures such as optical computers may use classical superposition of electromagnetic waves. Without quantum mechanical resources such as entanglement, people think that an exponential advantage over classical computers is not possible. Quantum computers cannot perform functions that are not theoretically computable by classical computers, in other words they do not alter the Church-Turing thesis. They would, however, be able to do many things much more quickly and efficiently.

*Kiddle Encyclopedia.*