Quantum computation | Wikipedia audio article
Channel: wikipedia tts
Date: 2019-01-15

This is an audio version of the Wikipedia Article:
https://en.wikipedia.org/wiki/Quantum_computing


00:03:09 1 Basics
00:06:07 2 Principles of operation
00:16:16 3 Operation
00:19:07 4 Potential
00:19:15 4.1 Cryptography
00:21:48 4.2 Quantum search
00:24:18 4.3 Quantum simulation
00:24:53 4.4 Quantum annealing and adiabatic optimisation
00:25:31 4.5 Solving linear equations
00:25:55 4.6 Quantum supremacy
00:27:36 5 Obstacles
00:28:20 5.1 Quantum decoherence
00:31:25 6 Developments
00:31:35 6.1 Quantum computing models
00:32:47 6.2 Physical realizations
00:35:35 6.3 Timeline
00:50:51 7 Relation to computational complexity theory



Listening is a more natural way of learning, when compared to reading. Written language only began at around 3200 BC, but spoken language has existed long ago.

Learning by listening is a great way to:
- increases imagination and understanding
- improves your listening skills
- improves your own spoken accent
- learn while on the move
- reduce eye strain

Now learn the vast amount of general knowledge available on Wikipedia through audio (audio article). You could even learn subconsciously by playing the audio while you are sleeping! If you are planning to listen a lot, you could try using a bone conduction headphone, or a standard speaker instead of an earphone.

Listen on Google Assistant through Extra Audio:
https://assistant.google.com/services/invoke/uid/0000001a130b3f91
Other Wikipedia audio articles at:
https://www.youtube.com/results?search_query=wikipedia+tts
Upload your own Wikipedia articles through:
https://github.com/nodef/wikipedia-tts
Speaking Rate: 0.9914562960717304
Voice name: en-GB-Wavenet-D


"I cannot teach anybody anything, I can only make them think."
- Socrates


SUMMARY
=======
Quantum computing  is computing using quantum-mechanical phenomena, such as superposition and entanglement. A quantum computer is a device that performs quantum computing. Such a computer is completely different from binary digital electronic computers based on transistors and capacitors. Whereas common digital computing requires that the data be encoded into binary digits (bits), each of which is always in one of two definite states (0 or 1), quantum computation uses quantum bits or qubits, which can be in superpositions of states. A quantum Turing machine is a theoretical model of such a computer and is also known as the universal quantum computer.   The field of quantum computing was initiated by the work of Paul Benioff and  Yuri Manin in 1980, Richard Feynman in 1982, and David Deutsch in 1985.As of  2018, the development of actual quantum computers is still in its infancy, but experiments have been carried out in which quantum computational operations were executed on a very small number of quantum bits. Both practical and theoretical research continues, and many national governments and military agencies are funding quantum computing research in additional effort to develop quantum computers for civilian, business, trade, environmental and national security purposes, such as cryptanalysis. Noisy devices with a small number of qubits, also dubbed noisy intermediate-scale quantum (NISQ) devices by John Preskill, have been developed by a number of companies, including IBM, Intel, and Google.  IBM has made 5-qubit and 16-qubit quantum computing devices available to the public for experiments via the cloud on the IBM Q Experience. D-Wave Systems has been developing their own version of a quantum computer that uses annealing.Large-scale quantum computers would theoretically be able to solve certain problems much more quickly than any classical computers that use even the best currently known algorithms, like integer factorization using Shor's algorithm (which is a quantum algorithm) and the simulation of quantum many-body systems. There exist quantum algorithms, such as Simon's algorithm, that run faster than any possible probabilistic classical algorithm.
A classical computer could in principle (with exponential resources) simulate a quantum algorithm, as quantum computation does not violate the Church–Turing thesis. On the other hand, quantum computers may be able to efficiently solve problems which are not practically feasible on classical computers.
A recent review by Mikhail Dyakonov in IEEE Spectrum argues that practical quantum computers are not likely to be implemented. He says: "There is a tremendous gap between the rudimentary but very hard experiments that have been carried out with a few qubits and the extremely developed quantum-computing theory, which relies on manipulating thousands to millions of qubits to calculate anything useful. That gap is not likely to be closed anytime soon."