حساب كمومي

كرة بلوخ هي أحد تمثيلات الكيوبت، الوحدة الأساسية للحوسبة الكمومية.

الحساب الكمومي

(بالإنجليزية: Quantum computing)‏ هو أي وسيلة تعتمد على مبادئ ميكانيكا الكم وظواهره، مثل حالة التراكب الكمي والتشابك الكمي، للقيام بمعالجة البيانات. في الحواسيب التقليدية، تكون كمية البيانات مقاسة بالبت : أما في الحاسوب الكمي فتقاس كمية البيانات بالكيوبت qubit (اختصارا ل Quantum bits). المبدأ الأساسي للحوسبة الكمية هي القدرة على الاستفادة من الخواص الكمية للجسيمات لتمثيل البيانات ومعالجتها، إضافة لاستخدام قواعد ميكانيكا الكم لبناء وتنفيذ التعليمات والعمليات على هذه البيانات.

التاريخ

منذ ظهور أول حاسوب(ميكانيكي) في العام 1941 حدثت العديد من الاكتشافات والاختراعات الفيزيائية التي غيرت وجه عالم الحواسيب وصنعت منها الأجهزة الحديثة والمتطورة التي نراها اليوم.أهم هذه الاختراعات والاكتشافات الفيزيائية هي: الأنابيب المفرغة، الترانزستورات والدوائر المتكاملة.

تطورت الحواسيب في اتجاهات مختلفة فهي الآن صغيرة الحجم، خفيفة الوزن، جميلة المظهر، وفوق ذلك ذات إمكانيات متطورة وكفاءة عالية بالمقارنة مع الحواسيب القديمة كالذي يظهر في الشكل 1.1 والتي كانت ذات أحجام كبيرة (في حجم غرفة تقريباً) واستخدمت تكنولوجيا الأنابيب المفرغة الإلكترونية مما اكسبها كفاءة متدنية جدا بالمقارنة مع أي حاسوب شخصي في أيامنا هذه.

حاليا تجرى الأبحاث على كلا الجانبين : البرمجيات والمكونات الصلبة للحواسيب. فحتى هذه اللحظة ما زال علينا حمل حواسيب محمولة تزن عدة كيلوغرامات، استخدام لوحة المفاتيح، إعادة تكرار الأوامر والإجابة على أسئلة بسيطة يطرحها الحاسوب. (الشكل 1.2 يظهر حاسوباً تقليدياً من النوع المعروف باسم الحاسبات الشخصية. ولكن معضلات أخرى ما زالت موجودة. مثلاً البنوك، كبرى الشركات، وحتى الحكومات دائماً في حالة قلق من اختراق بياناتها المحوسبة وكسر سريتها، مما يكلفها أمولا طائلة للتشديد من سرية المعلومات، ولكن قراصنة الحاسوب أيضا يتطورون يوما عن يوم. تحليل الأرقام الكبيرة إلى عواملها الأولية

يمثل تحدياً آخر لعلماء الرياضيات. فمثلاً لتحليل رقم يتكون من 230 رقماً ستتطلب هذه العملية وقتاً يقاس بملايين السنين عن طريق أحدث الحواسيب الكلاسيكية. حواسيب الكم ربما تمثل حلاً لمثل هذه المعضلات. أو بمعنى آخر نستطيع القول أن حواسيب الكم أعلى كفاءة من الحواسيب الكلاسيكية. إذن؛ ما هي حواسيب الكم؟ كيف تختلف عن الحواسيب الكلاسيكية؟ وما المتوقع منها بالضبط؟.

في العام 1994 اعلن عالم الرياضيات بيتر شور عن اكتشافه لخوارزمية بسيطة لتحليل الأرقام إلى مكوناتها الأولية

بواسطة آلة حاسوبية تقوم على أسس فيزياء الكم. ومنذ ذلك الوقت مانفكت الأبحاث محاولةً تحقيق هذه الآلة (حاسوب الكم). لذا لابد أن يتكون الحاسوب الكمي من مكونات إلكترونية صغيرة جداً تماثل الذرات المنفردة حجماً. وبالتالي ستخضع هذه المكونات ذات الأحجام الصغيرة جدا لقوانين ميكانيكا الكم موفيةً بذلك الشرط اللازم لعمليات الحاسوب الكمي. ولهذا السبب يعتبر الحاسوب الكمي جزءاً من تكنولوجيا النانو الحديثة والتي تتعامل مع الأنظمة التي تحتوي علي مكونات نانوية الأبعاد (أجهزة ذات حجم ~ 1 نانو متر =10–9 متر).

بينما وحدة المعلومات في الحواسيب الكلاسيكية هي البت، تعتبر البت الكمية هي الوحدة النظيرة من المعلومات في الكمبيوتر الكمي. بت واحدة تعادل احدي حالتين 0 او1 واللذان يمثلان النظام الثنائي الذي تتعامل معه الحواسيب الكلاسيكية. بينما البت الكمية تستطيع أن تمثل بالإضافة إلى هاتان الحالتان حالة التراكب الكمي المكونة منهما معا، وبالتالي فان زوجاً من البت الكمية بستطيع أن يمثل أي تراكب كمي من الحالات الأربعة : I0,0>, I0,1>, I1,0> or I1,1> حيث نستخدم طريقة ديراك لتمثيل الحالة الكمية

. بالعموم فان الحاسوب الكمي المكون من n بت كمية يمكن أن يكون أي تراكب اعتباطياً من 2n حالة مختلفة متواجدين آنيا، بينما في الحواسيب العادية n عدد من البتات يعني n حالة محددة ولا توجد أي حالات متزامنة آنياً. وهذا يعكس القوة الحوسبية الكبيرة التي تقدمها الحواسيب الكمية بالمقارنة مع الحواسيب الكلاسيكية.

الحواسيب الكمية ما زالت تحت البحث وما زال الجدل قائماً حول ما إذا كان إيجاد مثل هذه الحواسيب علي أرض الواقع في المستقبل ممكناً أو لا.وعلي كل حال فإن العمل علي الحواسيب الكمية يستطيع إثراء فيزياء الكم الأساسية وفي الوقت نفسه يستطيع إثراء الأبحاث علي مستوي القياس النانوي. في وقت قريب تم بناء حاسوب كمي صغير يتكون من سبعة بتات كمية مثلت بواسطة سبعة مغازل نووية (nuclear spins) خمسة منها من نويات الفلور واثنان من نويات الكربون -13 (انظر الشكل1.3) في معامل آي بي إم وستانفورد.

بشكل مماثل لقضيب مغنطيسي يشير إلى الشمال أو الجنوب يستطيع كل مغزل أن يمثل الأرقام الثنائية “0” أو “1” أو كلاهما معاً (انظر إلى الأسهم السوداء في الشكل 1.3). ويمكن التحكم في ذلك عن طريق مجالات مغنطيسية وموجات الراديو(تقنية الرنين المغنطيسي النووي). بواسطة حاسوب السبع بتات الكمية هذا أمكن الاستفادة من ميزة الحوسبة الكمية الفريدة -ألا وهي قابلية التراكب- لقياس الأعداد الأولية المكونة للرقم 15 ألا وهي 3و 5. ولكن تحليل الأعداد الكبيرة إلى عواملها الأولية يتطلب حاسوباً ذو عدد أكبر من البتات الكمية، ويبقى هذا تحدياً لبناء حاسوب كمي حقيقى كبير.

آلة تورنغ

آلة تورنغ والتي وضعها آلان تورنغ في ثلاثينيات القرن العشرين، هي آلة نظرية تتألف من شريط لانهائي الطول مُقسم إلى مربّعات صغيرة، كل من هذه المربّعات يَحمل الرمز 1 أو 0 أو يبقى فارغاً. يقوم جهاز (قراءة/كتابة) بقراءة هذه الرموز والفراغات وهذا ما يعطي الآلة التعليمات لتقوم بعملٍ ما. الآن في آلة تورنغ الكمومية الفرق أنّ الشريط ورأس (القراءة/كتابة) يوجد في حالةٍ كمومية وهذا يعني أنّ الرموز على الشريط يمكن أن تكون 0 أو 1 أو حالة مُختلطة من 0 والـ 1. بعبارة أخرى الرموز تكون 1 و0 (وكل النقط بينهما) في نفس الوقت. فبينما تقوم آلة تورنغ العادية بتنفيذ عملية واحدة في وقت واحد، تقوم آلة تورنغ الكمومية بتنفيذ العديد من العمليات في نفس الوقت. تعمل حواسيب اليوم –كآلة تورنغ- بمعالجة البيتات الموجودة في حالتين 0 أو 1. الحواسيب الكمومية ليست مُقيّدة بحالتين فهي تُرمز المعلومات على شكل بيتات كمومية أو اختصاراً (qubits) والتي يمكن أن توجد في الحالة المختلطة. يمكن تمثّيل البتات الكمومية عبر: ذرّات، أيونات، فوتونات أو إلكترونات والأجهزة التي تتحكّم بها والتي تعمل معاً فتصبح ذاكرة أو معالج. لأنّ الحواسيب الكمومية تحوي هذه الحالات المُتعددة وبنفس الوقت، فهي تملك القدرة على أن تكون أقوى بملايين المرات من الحواسيب الفائقة الموجودة اليوم.

التحكم بالحواسيب الكمومية

يتحكم علماء الحواسيب بالأجزاء المجهرية التي تتصرف كبتات كمومية في الحواسيب الكمومية مستخدمين أجهزة تحكم

لاقط الأيونات: يستخدم حقل ضوئي أو مغناطيسي (أو مزيج من الاثنين) لالتقاط الأيونات.
اللاقطات الضوئية: تستخدم الأمواج الضوئية لتتحكم بالجزيئات.
النقط الكمومية: تصنع من مواد نصف ناقلة وتستخدم لتحوي الإلكترونات وتتلاعب بها.
أنصاف نواقل مشوبة: تحوي الإلكترونات باستخدامها ذرات “غير مطلوبة” موجودة في المواد نصف الناقلة.
دارات فائقة النقل: تسمح للإلكترونات أن تتدفق من دون أي مقاومة تقريبًا وعند درجات حرارة منخفضة.

ـــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــ

Quantum computing is changing the future of IT as we know it | The ...

Quantum computing

From Wikipedia,

Jump to navigation Jump to search

This article’s tone or style may not reflect the encyclopedic tone used on Wikipedia. See Wikipedia’s guide to writing better articles for suggestions. (November 2019) (Learn how and when to remove this template message)

Quantum computer based on superconducting qubits developed by IBM Research in Zürich, Switzerland. The qubits in the device shown here will be cooled to under 1 kelvin using a dilution refrigerator.

Quantum computing is the use of quantum-mechanical phenomena such as superposition and entanglement to perform computation. A quantum computer, implemented theoretically or physically, is used to perform such computation.^[1]^:I-5 There are currently two main approaches to physically implementing a quantum computer: analog and digital. Analog approaches are further divided into quantum simulation, quantum annealing, and adiabatic quantum computation. Digital quantum computers use quantum logic gates to do computation. Both approaches use quantum bits or qubits.^[1]^:2–13

Quantum computing began in the early 1980s, when physicist Paul Benioff proposed a quantum mechanical model of the Turing machine.^[2] Richard Feynman and Yuri Manin later suggested that a quantum computer had the potential to simulate things that a classical computer could not.^[3]^[4] In 1994, Peter Shor developed a quantum algorithm for factoring integers that had the potential to decrypt RSA-encrypted communications.^[5] Despite ongoing experimental progress since the late 1990s, most researchers believe that “fault-tolerant quantum computing [is] still a rather distant dream”.^[6] On 23 October 2019, Google AI, in partnership with the U.S. National Aeronautics and Space Administration (NASA), published a paper in which they claimed to have achieved quantum supremacy.^[7] While some have disputed this claim, it is still a significant milestone in the history of quantum computing.^[8]

Quantum computing is modeled by quantum circuits. Quantum circuits are based on the quantum bit, or “qubit“, which is somewhat analogous to the bit in classical computation. Qubits can be in a 1 or 0 quantum state, or they can be in a superposition of the 1 and 0 states. However, when qubits are measured the result is always either a 0 or a 1; the probabilities of these two outcomes depend on the quantum state that they were in immediately prior to the measurement. Computation is performed by manipulating qubits with quantum logic gates, which are somewhat analogous to classical logic gates.

The field of quantum computing is a subfield of quantum information science, which includes quantum cryptography and quantum communication.

Quantum operations

The Bloch sphere is a representation of a qubit, the fundamental building block of quantum computers.

The prevailing model of quantum computation describes the computation in terms of a network of quantum logic gates.^[9]

A memory consisting of ${\textstyle n}$ bits of information has ${\textstyle 2^{n}}$ possible states. A vector representing all memory states thus has ${\textstyle 2^{n}}$ entries (one for each state). This vector is viewed as a probability vector and represents the fact that the memory is to be found in a particular state.

In the classical view, one entry would have a value of 1 (i.e. a 100% probability of being in this state) and all other entries would be zero. In quantum mechanics, probability vectors are generalized to density operators. This is the technically rigorous mathematical foundation for quantum logic gates, but the intermediate quantum state vector formalism is usually introduced first because it is conceptually simpler. This article focuses on the quantum state vector formalism for simplicity.

We begin by considering a simple memory consisting of only one bit. This memory may be found in one of two states: the zero state or the one state. We may represent the state of this memory using Dirac notation so that

|0\rangle :={\begin{pmatrix}1\\0\end{pmatrix}};\quad |1\rangle :={\begin{pmatrix}0\\1\end{pmatrix}}

A quantum memory may then be found in any quantum superposition ${\textstyle |\psi \rangle }$ of the two classical states ${\textstyle |0\rangle }$ and ${\textstyle |1\rangle }$ :

|\psi \rangle :=\alpha \,|0\rangle +\beta \,|1\rangle ={\begin{pmatrix}\alpha \\\beta \end{pmatrix}};\quad |\alpha |^{2}+|\beta |^{2}=1.

In general, the coefficients ${\textstyle \alpha }$ and ${\textstyle \beta }$ are complex numbers. In this scenario, one qubit of information is said to be encoded into the quantum memory. The state ${\textstyle |\psi \rangle }$ is not itself a probability vector but can be connected with a probability vector via a measurement operation. If the quantum memory is measured to determine if the state is ${\textstyle |0\rangle }$ or ${\textstyle |1\rangle }$ (this is known as a computational basis measurement), the zero state would be observed with probability ${\textstyle |\alpha |^{2}}$ and the one state with probability ${\textstyle |\beta |^{2}}$ . The numbers ${\textstyle \alpha }$ and ${\textstyle \beta }$ are called quantum amplitudes.

The state of this one-qubit quantum memory can be manipulated by applying quantum logic gates, analogous to how classical memory can be manipulated with classical logic gates. One important gate for both classical and quantum computation is the NOT gate, which can be represented by a matrix

X:={\begin{pmatrix}0&1\\1&0\end{pmatrix}}.

Mathematically, the application of such a logic gate to a quantum state vector is modelled with matrix multiplication. Thus ${\textstyle X|0\rangle =|1\rangle }$ and ${\textstyle X|1\rangle =|0\rangle }$ .

The mathematics of single qubit gates can be extended to operate on multiqubit quantum memories in two important ways. One way is simply to select a qubit and apply that gate to the target qubit whilst leaving the remainder of the memory unaffected. Another way is to apply the gate to its target only if another part of the memory is in a desired state. These two choices can be illustrated using another example. The possible states of a two-qubit quantum memory are

|00\rangle :={\begin{pmatrix}1\\0\\0\\0\end{pmatrix}};\quad |01\rangle :={\begin{pmatrix}0\\1\\0\\0\end{pmatrix}};\quad |10\rangle :={\begin{pmatrix}0\\0\\1\\0\end{pmatrix}};\quad |11\rangle :={\begin{pmatrix}0\\0\\0\\1\end{pmatrix}}.

The CNOT gate can then be represented using the following matrix:

CNOT:={\begin{pmatrix}1&0&0&0\\0&1&0&0\\0&0&0&1\\0&0&1&0\end{pmatrix}}.

As a mathematical consequence of this definition, ${\textstyle CNOT|00\rangle =|00\rangle }$ , ${\textstyle CNOT|01\rangle =|01\rangle }$ , ${\textstyle CNOT|10\rangle =|11\rangle }$ , and ${\textstyle CNOT|11\rangle =|10\rangle }$ . In other words, the CNOT applies a NOT gate ( ${\textstyle X}$ from before) to the second qubit if and only if the first qubit is in the state ${\textstyle |1\rangle }$ . If the first qubit is ${\textstyle |0\rangle }$ , nothing is done to either qubit.

In summary, a quantum computation can be described as a network of quantum logic gates and measurements. Any measurement can be deferred to the end of a quantum computation, though this deferment may come at a computational cost. Because of this possibility of deferring a measurement, most quantum circuits depict a network consisting only of quantum logic gates and no measurements. More information can be found in the following articles: universal quantum computer, Shor’s algorithm, Grover’s algorithm, Deutsch–Jozsa algorithm, amplitude amplification, quantum Fourier transform, quantum gate, quantum adiabatic algorithm and quantum error correction.

Any quantum computation can be represented as a network of quantum logic gates from a fairly small family of gates. A choice of gate family that enables this construction is known as a universal gate set. One common such set includes all single-qubit gates as well as the CNOT gate from above. This means any quantum computation can be performed by executing a sequence of single-qubit gates together with CNOT gates. Though this gate set is infinite, it can be replaced with a finite gate set by appealing to the Solovay-Kitaev theorem.

Potential applications

Cryptography

Integer factorization, which underpins the security of public key cryptographic systems, is believed to be computationally infeasible with an ordinary computer for large integers if they are the product of few prime numbers (e.g., products of two 300-digit primes).^[10] By comparison, a quantum computer could efficiently solve this problem using Shor’s algorithm to find its factors. This ability would allow a quantum computer to break many of the cryptographic systems in use today, in the sense that there would be a polynomial time (in the number of digits of the integer) algorithm for solving the problem. In particular, most of the popular public key ciphers are based on the difficulty of factoring integers or the discrete logarithm problem, both of which can be solved by Shor’s algorithm. In particular, the RSA, Diffie–Hellman, and elliptic curve Diffie–Hellman algorithms could be broken. These are used to protect secure Web pages, encrypted email, and many other types of data. Breaking these would have significant ramifications for electronic privacy and security.

However, other cryptographic algorithms do not appear to be broken by those algorithms.^[11]^[12] Some public-key algorithms are based on problems other than the integer factorization and discrete logarithm problems to which Shor’s algorithm applies, like the McEliece cryptosystem based on a problem in coding theory.^[11]^[13] Lattice-based cryptosystems are also not known to be broken by quantum computers, and finding a polynomial time algorithm for solving the dihedral hidden subgroup problem, which would break many lattice based cryptosystems, is a well-studied open problem.^[14] It has been proven that applying Grover’s algorithm to break a symmetric (secret key) algorithm by brute force requires time equal to roughly 2^n/2 invocations of the underlying cryptographic algorithm, compared with roughly 2ⁿ in the classical case,^[15] meaning that symmetric key lengths are effectively halved: AES-256 would have the same security against an attack using Grover’s algorithm that AES-128 has against classical brute-force search (see Key size).

Quantum cryptography could potentially fulfill some of the functions of public key cryptography. Quantum-based cryptographic systems could, therefore, be more secure than traditional systems against quantum hacking.^[16]

Quantum search

Besides factorization and discrete logarithms, quantum algorithms offering a more than polynomial speedup over the best known classical algorithm have been found for several problems,^[17] including the simulation of quantum physical processes from chemistry and solid state physics, the approximation of Jones polynomials, and solving Pell’s equation. No mathematical proof has been found that shows that an equally fast classical algorithm cannot be discovered, although this is considered unlikely.^[18] However, quantum computers offer polynomial speedup for some problems. The most well-known example of this is quantum database search, which can be solved by Grover’s algorithm using quadratically fewer queries to the database than that are required by classical algorithms. In this case, the advantage is not only provable but also optimal, it has been shown that Grover’s algorithm gives the maximal possible probability of finding the desired element for any number of oracle lookups. Several other examples of provable quantum speedups for query problems have subsequently been discovered, such as for finding collisions in two-to-one functions and evaluating NAND trees.

Problems that can be addressed with Grover’s algorithm have the following properties:

There is no searchable structure in the collection of possible answers,
The number of possible answers to check is the same as the number of inputs to the algorithm, and
There exists a boolean function which evaluates each input and determines whether it is the correct answer

For problems with all these properties, the running time of Grover’s algorithm on a quantum computer will scale as the square root of the number of inputs (or elements in the database), as opposed to the linear scaling of classical algorithms. A general class of problems to which Grover’s algorithm can be applied^[19] is Boolean satisfiability problem. In this instance, the database through which the algorithm is iterating is that of all possible answers. An example (and possible) application of this is a password cracker that attempts to guess the password or secret key for an encrypted file or system. Symmetric ciphers such as Triple DES and AES are particularly vulnerable to this kind of attack.^{[citation needed]} This application of quantum computing is a major interest of government agencies.^[20]

Quantum simulation

Since chemistry and nanotechnology rely on understanding quantum systems, and such systems are impossible to simulate in an efficient manner classically, many believe quantum simulation will be one of the most important applications of quantum computing.^[21] Quantum simulation could also be used to simulate the behavior of atoms and particles at unusual conditions such as the reactions inside a collider.^[22]

Quantum annealing and adiabatic optimization

Quantum annealing or Adiabatic quantum computation relies on the adiabatic theorem to undertake calculations. A system is placed in the ground state for a simple Hamiltonian, which is slowly evolved to a more complicated Hamiltonian whose ground state represents the solution to the problem in question. The adiabatic theorem states that if the evolution is slow enough the system will stay in its ground state at all times through the process.

Solving linear equations

The Quantum algorithm for linear systems of equations, or “HHL Algorithm”, named after its discoverers Harrow, Hassidim, and Lloyd, is expected to provide speedup over classical counterparts.^[23]

Quantum supremacy

John Preskill has introduced the term quantum supremacy to refer to the hypothetical speedup advantage that a quantum computer would have over a classical computer in a certain field.^[24] Google announced in 2017 that it expected to achieve quantum supremacy by the end of the year though that did not happen. IBM said in 2018 that the best classical computers will be beaten on some practical task within about five years and views the quantum supremacy test only as a potential future benchmark.^[25] Although skeptics like Gil Kalai doubt that quantum supremacy will ever be achieved,^[26]^[27] in October 2019, a Sycamore processor created in conjunction with Google AI Quantum was reported to have achieved quantum supremacy,^[28] with calculations more than 3,000,000 times as fast as those of Summit, generally considered the world’s fastest computer.^[29] Bill Unruh doubted the practicality of quantum computers in a paper published back in 1994.^[30] Paul Davies argued that a 400-qubit computer would even come into conflict with the cosmological information bound implied by the holographic principle.^[31]

Obstacles

There are a number of technical challenges in building a large-scale quantum computer.^[32] Physicist David DiVincenzo has listed the following requirements for a practical quantum computer:^[33]

Scalable physically to increase the number of qubits
Qubits that can be initialized to arbitrary values
Quantum gates that are faster than decoherence time
Universal gate set
Qubits that can be read easily

Sourcing parts for quantum computers is also very difficult. Many quantum computers, like those constructed by Google and IBM, need Helium-3, a nuclear research byproduct, and special superconducting cables that are only made by a single company in Japan.^[34]

Quantum decoherence

One of the greatest challenges involved with constructing quantum computers is controlling or removing quantum decoherence. This usually means isolating the system from its environment as interactions with the external world cause the system to decohere. However, other sources of decoherence also exist. Examples include the quantum gates, and the lattice vibrations and background thermonuclear spin of the physical system used to implement the qubits. Decoherence is irreversible, as it is effectively non-unitary, and is usually something that should be highly controlled, if not avoided. Decoherence times for candidate systems in particular, the transverse relaxation time T₂ (for NMR and MRI technology, also called the dephasing time), typically range between nanoseconds and seconds at low temperature.^[35] Currently, some quantum computers require their qubits to be cooled to 20 millikelvins in order to prevent significant decoherence.^[36]

As a result, time-consuming tasks may render some quantum algorithms inoperable, as maintaining the state of qubits for a long enough duration will eventually corrupt the superpositions.^[37]

These issues are more difficult for optical approaches as the timescales are orders of magnitude shorter and an often-cited approach to overcoming them is optical pulse shaping. Error rates are typically proportional to the ratio of operating time to decoherence time, hence any operation must be completed much more quickly than the decoherence time.

As described in the Quantum threshold theorem, if the error rate is small enough, it is thought to be possible to use quantum error correction to suppress errors and decoherence. This allows the total calculation time to be longer than the decoherence time if the error correction scheme can correct errors faster than decoherence introduces them. An often cited figure for the required error rate in each gate for fault-tolerant computation is 10⁻³, assuming the noise is depolarizing.

Meeting this scalability condition is possible for a wide range of systems. However, the use of error correction brings with it the cost of a greatly increased number of required qubits. The number required to factor integers using Shor’s algorithm is still polynomial, and thought to be between L and L², where L is the number of qubits in the number to be factored; error correction algorithms would inflate this figure by an additional factor of L. For a 1000-bit number, this implies a need for about 10⁴ bits without error correction.^[38] With error correction, the figure would rise to about 10⁷ bits. Computation time is about L² or about 10⁷ steps and at 1 MHz, about 10 seconds.

A very different approach to the stability-decoherence problem is to create a topological quantum computer with anyons, quasi-particles used as threads and relying on braid theory to form stable logic gates.^[39]^[40]

Physicist Mikhail Dyakonov has expressed skepticism of quantum computing as follows:

“So the number of continuous parameters describing the state of such a useful quantum computer at any given moment must be… about 10³⁰⁰… Could we ever learn to control the more than 10³⁰⁰ continuously variable parameters defining the quantum state of such a system? My answer is simple. No, never.“^[41]

Developments

Quantum computing models

There are a number of quantum computing models, distinguished by the basic elements in which the computation is decomposed. The four main models of practical importance are:

Quantum gate array (computation decomposed into a sequence of few-qubit quantum gates)
One-way quantum computer (computation decomposed into a sequence of one-qubit measurements applied to a highly entangled initial state or cluster state)
Adiabatic quantum computer, based on quantum annealing (computation decomposed into a slow continuous transformation of an initial Hamiltonian into a final Hamiltonian, whose ground states contain the solution)^[42]
Topological quantum computer^[43] (computation decomposed into the braiding of anyons in a 2D lattice)

The quantum Turing machine is theoretically important but the physical implementation of this model is not feasible. All four models of computation have been shown to be equivalent; each can simulate the other with no more than polynomial overhead.

Physical realizations

For physically implementing a quantum computer, many different candidates are being pursued, among them (distinguished by the physical system used to realize the qubits):

Superconducting quantum computing^[44]^[45] (qubit implemented by the state of small superconducting circuits (Josephson junctions)
Trapped ion quantum computer (qubit implemented by the internal state of trapped ions)
Optical lattices (qubit implemented by internal states of neutral atoms trapped in an optical lattice)
Quantum dot computer, spin-based (e.g. the Loss-DiVincenzo quantum computer^[46]) (qubit given by the spin states of trapped electrons)
Quantum dot computer, spatial-based (qubit given by electron position in double quantum dot)^[47]
Coupled Quantum Wire (qubit implemented by a pair of Quantum Wires coupled by a Quantum Point Contact)^[48]^[49]^[50]
Nuclear magnetic resonance quantum computer (NMRQC) implemented with the nuclear magnetic resonance of molecules in solution, where qubits are provided by nuclear spins within the dissolved molecule and probed with radio waves
Solid-state NMR Kane quantum computers (qubit realized by the nuclear spin state of phosphorus donors in silicon)
Electrons-on-helium quantum computers (qubit is the electron spin)
Cavity quantum electrodynamics (CQED) (qubit provided by the internal state of trapped atoms coupled to high-finesse cavities)
Molecular magnet^[51] (qubit given by spin states)
Fullerene-based ESR quantum computer (qubit based on the electronic spin of atoms or molecules encased in fullerenes)
Linear optical quantum computer (qubits realized by processing states of different modes of light through linear elements e.g. mirrors, beam splitters and phase shifters)^[52]
Diamond-based quantum computer^[53]^[54]^[55] (qubit realized by the electronic or nuclear spin of nitrogen-vacancy centers in diamond)
Bose-Einstein condensate-based quantum computer^[56]
Transistor-based quantum computer – string quantum computers with entrainment of positive holes using an electrostatic trap
Rare-earth-metal-ion-doped inorganic crystal based quantum computers^[57]^[58] (qubit realized by the internal electronic state of dopants in optical fibers)
Metallic-like carbon nanospheres based quantum computers^[59]

A large number of candidates demonstrates that quantum computing, despite rapid progress, is still in its infancy.

Relation to computability and complexity theory

Computability theory

Any computational problem solvable by a classical computer is also solvable by a quantum computer.^[60] Intuitively, this is because it is believed that all physical phenomena, including the operation of classical computers, can be described using quantum mechanics, which underlies the operation of quantum computers.

Conversely, any problem solvable by a quantum computer is also solvable by a classical computer, or more formally any quantum computer can be simulated by a Turing machine. In other words, quantum computers provide no additional power over classical computers in terms of computability. This means that quantum computers cannot solve undecidable problems like the halting problem and the existence of quantum computers does not disprove the Church–Turing thesis.^[61]

Computational complexity theory

While quantum computers cannot solve any problems that classical computers cannot already solve, it is suspected that they can solve many problems faster than classical computers. For instance, it is known that quantum computers can efficiently factor integers, while this is not believed to be the case for classical computers. However, the capacity of quantum computers to accelerate classical algorithms has rigid upper bounds, and the overwhelming majority of classical calculations cannot be accelerated by the use of quantum computers.^[62]

The class of problems that can be efficiently solved by a quantum computer with bounded error is called BQP, for “bounded error, quantum, polynomial time”. More formally, BQP is the class of problems that can be solved by a polynomial-time quantum Turing machine with error probability of at most 1/3. As a class of probabilistic problems, BQP is the quantum counterpart to BPP (“bounded error, probabilistic, polynomial time”), the class of problems that can be efficiently solved by probabilistic Turing machines with bounded error.^[63] It is known that BPP $\subseteq$ BQP and widely suspected, but not proven, that BQP $\nsubseteq$ BPP, which intuitively would mean that quantum computers are more powerful than classical computers in terms of time complexity.^[64]

The suspected relationship of BQP to several classical complexity classes.^[65]

The exact relationship of BQP to P, NP, and PSPACE is not known. However, it is known that P $\subseteq$ BQP $\subseteq$ PSPACE; that is, the class of problems that can be efficiently solved by quantum computers includes all problems that can be efficiently solved by deterministic classical computers but does not include any problems that cannot be solved by classical computers with polynomial space resources. It is further suspected that BQP is a strict superset of P, meaning there are problems that are efficiently solvable by quantum computers that are not efficiently solvable by deterministic classical computers. For instance, integer factorization and the discrete logarithm problem are known to be in BQP and are suspected to be outside of P. On the relationship of BQP to NP, little is known beyond the fact that some NP problems are in BQP (integer factorization and the discrete logarithm problem are both in NP, for example). It is suspected that NP $\nsubseteq$ BQP; that is, it is believed that there are efficiently checkable problems that are not efficiently solvable by a quantum computer. As a direct consequence of this belief, it is also suspected that BQP is disjoint from the class of NP-complete problems (if an NP-complete problem were in BQP, then it follows from NP-hardness that all problems in NP are in BQP).^[66]

The relationship of BQP to the basic classical complexity classes can be summarized as:

{\mathsf {P\subseteq BPP\subseteq BQP\subseteq PP\subseteq PSPACE}}

It is also known that BQP is contained in the complexity class #P (or more precisely in the associated class of decision problems P^#P),^[66] which is a subclass of PSPACE.

It has been speculated that further advances in physics could lead to even faster computers. For instance, it has been shown that a non-local hidden variable quantum computer based on Bohmian Mechanics could implement a search of an N-item database in at most $O({\sqrt[{3}]{N}})$ steps, a slight speedup over Grover’s algorithm, which runs in $O({\sqrt {N}})$ steps (however, neither search method would allow quantum computers to solve NP-Complete problems in polynomial time).^[67] Theories of quantum gravity, such as M-theory and loop quantum gravity, may allow even faster computers to be built. However, defining computation in such theories is an open problem due to the problem of time, i.e., within these physical theories there is currently no obvious way to describe what it means for an observer to submit input to a computer at one point in time and then receive output at a later point in time.^[68]^[69]