What is the origin, and its uses of Quantum Computing
Ashutosh K.
Ex banker, Now self-employed, MD &CEO of Kumar Group of companies, Author of many books.
QUANTUM COMPUTING- A TECHNOLOGY REVOLUTION.
?It is a surprise that many of the technologies which are already invented in the early part of the 20th ?century. But it remained in Text Book and academic discussions. Progress made but slow and not at a level that is astonishing.
Recognizing the very people and organizations who, over several decades, cumulatively laid the foundations of quantum computing is key to understanding the wider potential of this area. Among these, Quantum Computing is one of them. Quantum mechanics was advanced between 1900 and 1925 and became a foundation that started with chemistry, condensed matter physics, and rested at an end in technologies ranging from computer chips to LED lighting. This new idea is very innovative and useful for several areas, but some of the simplest systems could not make scientists able to model with quantum mechanics. A simulating system of even a few dozen interacting particles involves more computing power than any conventional computer will take over thousands of years.
?A myriad of inventions has been taking place in computer technologies at an accelerated pace during the last two years. ?Quantum computing is possibly the technology needing the greatest typical example on the part of developers. Quantum computers were proposed in the 1980s by?Richard Feynman?and?Yuri Manin. The insight behind quantum computing is restricted from one of the supreme discomfitures of physics as an amazing scientific improvement faced with an inability to perfect even simple systems.
It is also claimed that Quantum computing began?in 1980 by physicist Paul Benioff proposed a quantum mechanical model of the Turing machine. But there was no headway found.
?Why use quantum computers
This is very vital to know why do we need it. We have several ways to realize that quantum mechanics is hard to simulate. The quantum theory can be construed as a matter, at a quantum level, is in a multitude of possible configurations. Unlike classical probability theory, these many configurations of the quantum state can be, which can be hypothetically observed that, may interfere with each other like waves. This interfering thwarts the use of statistical sampling to obtain the quantum state configurations. It may be possible if we track?every possible?configuration a quantum system could be in to comprehend the quantum evolution.
?DIFFICULTIES IN ITS USE INITIALLY BUT MADE POSSIBLE BY GREAT EFFORTS
DIFFICULTIES
Just imagine a system of electrons where electrons can be in any of?240240?configurations. To accumulate the quantum state of the electrons in a conventional computer memory would need enormous memory of?130130?GB. It was accessible in but on few computers. If we allowed the particles to be in any of?4141?positions, it would need twice as many configurations at?241241?which require above?260260?GB of memory to store the quantum state. Thus only ?increasing the number of positions have limitations ?if we want to store the state conventionally would quickly exceed memory capacities of the world's most powerful machines. At a few hundred electrons the memory required to store the system exceeds the number of particles in the universe; thus no possibility ?with our conventional computers to ever simulate their quantum dynamics. But in nature, such systems willingly evolve in time according to quantum mechanical laws to simulate their evolution with conventional computing power.
This thought led an early vision of quantum computing. ?Precisely, if quantum dynamics are impossible to simulate, certainly ?we ?would not succeed ?to build hardware offering quantum effects as fundamental operations. It was explored by finding answer to various observations. Like, could we simulate systems of interacting particles by means of a system that achieve exactly the same laws administer them naturally? Such ?observation provided answer which ?led to the genesis of quantum computing.
?
?
?
?
SUCCESS
The foundational core of quantum computing is to store information in quantum states of matter and to use quantum gate operations to compute that information, by connecting and learning to "program" quantum interference. Though it was hard an ?early illustration of programming interference to solve a problem was done by?Peter Shor?in 1994 for a problem known as factoring. Solving factoring guides a solu ion to break many of our public key cryptosystems underlying the security of present ?e-commerce , ?including RSA and Elliptic Curve Cryptography. After that, ?rapid ?and effective quantum computer algorithms have been developed for many of our hard classical tasks, like, simulating physical systems in chemistry, physics, and materials science, probing an unordered database, solving systems of linear equations, and machine learning.
?
USE OF SOME TOOLS ?TO PERFORM QUANTUM COMPUTING
Designing a quantum program to harness interference though look like a daunting task, now many techniques and tools, helping in ?Quantum Development, have been presented to make quantum programming and algorithm development more manageable. A slew of basic strategies that can be used to manipulate quantum interference to be useful for computing, and also assuring that the solution could not be lost. Quantum programming is a distinct art form of classical programming requiring very different tools to understand and express quantum algorithmic thinking. Really, in the absence of general tools to assist a quantum developer in managing the art of quantum programming, quantum algorithmic development though hard.
,Important Milestones In The History Of Quantum Computing?
(1905)???Widely adored scientist defines the photoelectric effect, focusing ?light on certain materials can role ?to release electrons from the material and that light itself consists of individual quantum particles or photons.
领英推荐
(1924)???????A term coined quantum mechanics by ?Max Born
(1925?)???????the first theoretically self-governing and logically consistent formulation of quantum mechanics or matrix machine was invented by?Werner Heisenberg, Max Born, and Pascual Jordan.
(1925 to 1927)????Werner Heisenberg ?and ?Neil Borg change the?Copenhagen interpretation,?treated as the earliest ?interpretations of quantum mechanics which is being ?as one of the most commonly taught.
(1930)???Paul Dirac issues?The Principles of Quantum Mechanics, a textbook to be taken as ?a standard reference book till date.
(1935)??Albert Einstein, Boris Podolsky, and Nathan Rosen gave importance to the counterintuitive nature of quantum superpositions and remarked the description of physical reality given by quantum mechanics is imperfect. However, after deliberating quantum superposition with Albert Einstein and criticizing the Copenhagen interpretation of quantum mechanics, develops a thought experiment in which a cat (forever known as Schr?dinger’s cat) is simultaneously dead and alive. ?Schr?dinger also coined ?the term “quantum entanglement”
(1944) Richard Feynman, a junior staff member at Los Alamos, organized a contest between human computers and the Los Alamos IBM facility, with both performing a calculation for the plutonium bomb. For two days, the human computers kept up with the machines. “But on the third day,” recalled an observer, “the punched-card machine operation began to move decisively ahead, as the people performing the hand computing could not sustain their initial fast pace, while the machines did not tire and continued at their steady pace” The momentum started by Nobel Prize-winner?
Richard Feynman assertions “nature isn't classical, dammit, and if you want to make a simulation of nature, you'd better make it quantum mechanical.” This hinted at the need of developing a quantum computer, leading to present days several efforts made for?making it practicable.
(1981)??Stipulating physics with computers, Richard Feynman of the California Institute of Technology contends that a quantum computer had the potential to simulate physical phenomena that a classical computer could not simulate
(1992) the Deutsch–Jozsa algorithm is the best example of a quantum algorithm that is more and mor.
e rapidly compared to ?any possible deterministic classical algorithm
(1994)??The National Institute of Standards and Technology arranges the first US government-sponsored conference on quantum computing
(2002)????The first version of the Quantum Computation Roadmap was published describing involving key quantum computing researchers.
(2011)???The first commercially presented quantum computer is offered by D-Wave Systems
(2012)???1QB Information Technologies (1QBit), the first dedicated quantum computing software company incorporated.
(2018)?????The?National Quantum Initiative Act?became law by President Donald Trump, launching the goals and priorities for a 10-year plan to accelerate the development of quantum information science and technology applications in the United States
(2019)????Google assets that it has reached quantum supremacy by performing a series of operations in 200 seconds that would take a supercomputer about 10,000 years to complete;?IBM rejoins by signifying it could take 2.5 days instead of 10,000 years, stressing techniques a supercomputer may use to maximize computing speed.
?CONCLUSION
The tough competition?began for quantum supremacy to being able to demonstrate a practical quantum device that can solve a problem that no classical computer can solve in any feasible amount of time. Speed and sustainability will be decisive as a ?measure jump to the next stage of computing.
Industries are turning to quantum computing as a potential path for business ventures, and even some of the world's most difficult to solve computer science problems have been addressed using quantum computers. With the development of new quantum algorithms, methods of analysis, ways of usage, and even computers themselves, the sky has been marked as the limit for quantum computing.