Tips, Expertise, Articles and Advice from the Pro's for Your Website or Blog to Succeed
I intend to write a series of articles on Quantum Computing. In this first installment, we will cover a few basics, recent speed achievements, and the considerations of Quantum Computing in the economy.
The dictionary definition of the word 'Quantum' is:
Grover’s Algorithm is related to searching an unstructured database with entries. Classical algorithms for searching n entries will be O(n) queries. The Grover's algorithm (Quantum Algorithm ) requires only the order of square root of n. Bohmian mechanics based nonlocal hidden quantum computer can perform the search in the order of the cube root of n queries.
The algorithm is implemented in Q#. Q# is Microsoft's quantum computing language. The driver's class is written in C#. A Q# project and solution are created in Visual Studio Code. Visual Studio Code is used to open the project. The project will have two files, Driver.cs (C# driver class) and QuantumCode.qs (Q# ). The Operations.qs is renamed as QuantumCode.qs.
Last month, I reported on a leaked announcement that Google had proved “quantum supremacy”, which is a concrete illustration of a use case where a quantum computer succeeds in a computation that a classical supercomputer cannot achieve in any reasonable timescale.
Earlier this month, Google’s quantum computing lab seemed to announce that they had proved “quantum supremacy” before the paper was pulled from public view again. This leak was presumably accidental, as the underlying research has been accepted for publication by Nature, but is still under embargo.
You might also like: An Introduction to Quantum Computing
For the uninitiated, quantum supremacy is the concrete illustration that a quantum computer can complete a computation that a classical supercomputer cannot achieve (or would take prohibitively long to do). In this case, Google’s researchers used a quantum computer with 53 qubits (hold on if you’re unfamiliar with this term, I’ll explain it shortly) to perform a calculation that took three minutes but would take Summit, the world’s most powerful classical supercomputer, 10,000 years to achieve.