| Quantum supremacy is the experimental demonstration of a quantum computer's dominance and advantage over a classical, binary computer. To confirm that quantum supremacy has been achieved, a quantum computer must quickly and successfully solve a problem that is too complex for a classical computer to solve. Computer scientists hope that quantum supremacy will lead to the cracking of Shor's algorithm -- a currently impossible calculation that is the basis of most modern cryptography -- as well as advantages in drug development, weather forecasts, stock trades and material designs. The concept of supremacy is important because if quantum computing becomes the norm, it will make current encryption standards useless. Many experts believe that if a computer is able to prove quantum supremacy, it will be the most disruptive advancement in technology since the Intel 4004 microprocessor was invented in 1971. Proving quantum supremacy While the problem that will first exemplify quantum supremacy could be any problem that computer scientists want, it is expected that they will prove supremacy with a problem known as random circuit sampling. This problem requires a computer to correctly sample from the possible outputs of a random quantum circuit. Classical computers do not possess any fast algorithms to generate these samples; therefore, as the array of possible samples increases, classical computers become overwhelmed. If a quantum computer can efficiently pull samples in this instance, then it will prove quantum supremacy. The U.S. and China have been the most focused on investing in quantum projects along with organizations and businesses such as Google, Microsoft, IBM, Lockheed Martin and Alibaba. Google has developed a 72-qubit quantum processor -- called Bristlecone -- which they claim will achieve quantum supremacy by the end of 2019. |
No comments:
Post a Comment