Introduce to Quantum Computing and Quantum Computer - Couverture souple

Lian, Han-xiong

Couverture souple

ISBN 10 : 1663222819 ISBN 13 : 9781663222817

Editeur : iUniverse, 2021

Synopsis

Recently (2020,06), according to the Financial Times, Google researcher Stephen Foley claimed "Big moment! Google claims to have researced quantum supremacy, taking 3 mins to do a calculation classical computer would take 10,000 years to do". After 10 years or more, the commercial quantum computers will come to the era of information explosion that we are now in. And the power of quantum computer is far greater than our imagination. Quantum computers use qubits |0> and |1> to process information, where, |1> represent up-spin electron, and |0> represents the down spin electron. Meanwhile, the up-spin electrons and the down-spin electrons are interdependent, forming a quantum entangled state or quantum superposition state. Therefore, the superposition state of quantum can be expressed as (a|1> + b|0>) = (|00>+|01>+|10>+|11>). That is, two qubits has 4 states, which is 2^n times larger than the traditional number of bits ("0" and "1"), where n is the number of contained electrons. This means that the computing speed of quantum computers are 2^n times faster than traditional computers. Not only this, the "0" and "1" codes of traditional computers are processed along one time axis, and quantum computers can be calculated using Shor's parallel algorithm, that is, each quantum in a quantum computer has an independent time axis, n quanta can be processed in parallel on their own time axis. In other words, for n quanta, there will be n time axes processing at the same time. In this way, quantum computers are much faster than traditional computers. In other words, the information that quantum computers can process is much larger than that of traditional computers.

Détails de l'édition

• Éditeur: iUniverse
• Date d'édition: 2021
• Langue: anglais
• ISBN 10: 1663222819
• ISBN 13: 9781663222817
• Reliure: Broché
• Nombre de pages: 712
• Coordonnées du fabricant: non disponible
• Personne responsable: non disponible