Quantum Computing 1 - Quantum computer and qubit

In 1994, Peter Shor showed that quantum computing enabled us to factorize a big integer into prime numbers. It is quite important discovery because the current cryptographic system is based on prime factorization. When a classical computer calculates it, it finds the answer by checking each number step by step. It takes a lot of time, and it is a virtually impossible if the number is large.

Traveling salesman problem is also known as a weak point of classical computers. It is the following question; “Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?” If the number of cities is , all routes are . A classical computer has to calculate a huge amount of routes when is large. A quantum computer is one of major candidates to solve these kinds of issue.

A unit of calculation by quantum computation is a qubit stands for a quantum bit. It is very different from a classical bit.

A qubit represents a state.

We express states as and like classical bits, and . If you observe a state as , it is impossible to be . In this case, each state is independent. 2 qubits are represented by

A qubit can be a superposition.

A superposition is written by

Here, and are complex numbers. They satisfy the following equation.

In other words, a qubit can have infinite states.

Calculation is transition of states.

If you change into , it is called transition from the initial state () to the final state (). It is equivalent to the following operation.

Reference