Architectures for Scalable Quantum Computation

Introduction Classical computers represent the realization of (sub) Turing machines and are limited by classical physical laws. Therefore, some computational problems are either difficult to solve or difficult to process (w.t.t. resources). In order to solve these problems, super computational model was designed and named quantum computer [1]. Quantum computation is based on the law of quantum mechanics and is superior to classical computation in terms of complexity.

Quantum computation is studying a theoretical computation system (quantum computer) that manipulates data directly using quantum mechanical phenomena such as overlap and entanglement. Quantum computers are different from transistor based binary digital computers. Conventional digital computing requires that each numerical value always encode data in binary numbers (bits) in one of two determined states (0 or 1). Quantum Turing machine is a theoretical model of such a computer, also known as a general quantum computer. The field of quantum computing was launched by Paul Benioff and Yuri Manin in 1980, by Richard Feynman in 1982, and by David Deutsch in 1985. Spin quantum bits of quantum computers are also used for quantum space time. 1968

Quantum computation uses quantum mechanics components to analyze data. Quantum computers use quantum bits (qubit) instead of binary numbers (bits) to store information. Thus, a classical computer data point has zero or one state, but the qubit has "superposition" of states, ie multiple values ​​at the same time. As a result, the quantum computer stores a large amount of data and can use less energy than conventional computers. Several quantum processors are 100 million times faster than existing quantum processors

Quantum computation is a computational phenomenon involving superposition with electronic or similar quantum particles and calculation of entanglement and signal processing. Like binary bits (0 and 1), a qubit is a unit of quantum information. Qubit is determined by the superposition and entanglement described above. The design, architecture, and mechanism for qubit processing and reading are still evolving and becoming more sophisticated. Likewise, qubits can be 0 and 1 at the same time. Since you can display many values ​​at the same time, you can handle many operations simultaneously (unlike multithreading of conventional computers). So it can move all the routes at the same time and you can find the shortest route in the first step