We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 13
Quantum Computing
Name :- Sakshi Kumari
Class Roll No. :- 41 Roll No. :- 214596 Registration No. :- 20BZVGCS041/20 Overview • What is Quantum Computing? • What is Quantum? • History of Quantum Computing • How a Quantum Computer Would Work? • What can a quantum computer do that a classical computer can’t? • What is required to build a quantum computer? • Challenges To Quantum Computing • If It’s So Complex, Why Is Everyone After Quantum Computing? What Is “Quantum”?
• A classical binary bit is always in one of two states—0 or 1—while a
quantum bit or qubit exists in both of its possible states at once, a condition known as a superposition. • An operation on a qubit thus exploits its quantum weirdness by allowing many computations to be performed in parallel. • A two-qubit system would perform the operation on 4 values, a three- qubit system on 8 and so forth. What Is “Quantum”? • Many quantum algorithms are non-deterministic; they find many different solutions in parallel, only one of which can be measured, so they provide the correct solution with only a certain known probability. • Running the calculation several times will increase the chances of finding the correct answer but also may reduce quantum computing's speed advantage. What Is “Quantum”? History of Quantum Computing
• Quantum computing tends to trace its roots back to a 1959 speech by
Richard P. Feynman in which he spoke about the idea of exploiting quantum effects to create more powerful computers. • This speech is also generally considered the starting point of nanotechnology. • In 1984, David Deutsch was at a computation theory conference and began to wonder about the possibility of designing a computer that was based exclusively on quantum rules, then published his breakthrough paper a few months later. • With this, the race began to exploit his idea. History of Quantum Computing • In 1994, AT&T's Peter Shor devised an algorithm that could use only 6 qubits to perform some basic factorizations ... more cubits the more complex the numbers requiring factorization became, of course. • The first, a 2-qubit quantum computer in 1998, could perform trivial calculations before losing decoherence after a few nanoseconds. • In 2000, teams successfully built both a 4-qubit and a 7-qubit quantum computer. • Research on the subject is still very active, although some physicists and engineers express concerns over the difficulties involved in upscaling these experiments to full-scale computing systems. How a Quantum Computer Would Work? • A quantum computer, would store information as either a 1, 0, or a quantum superposition of the two states. Such a “quantum bit,” called a qubit, allows for far greater flexibility than the binary system. • Specifically, a quantum computer would be able to perform calculations on a far greater order of magnitude than traditional computers a concept which has serious concerns and applications in the realm of cryptography & encryption. • A quantum computer, on the other hand, could factor the numbers in a reasonable period of time What can a quantum computer do that a classical computer can't? • Factoring large numbers, for starters. • Multiplying two large numbers is easy for any computer. • But calculating the factors of a very large (say, 500-digit) number, on the other hand, is considered impossible for any classical computer. • In 1994, a mathematician from the Massachusetts Institute of Technology (MIT) Peter Shor, who was working at AT&T at the time, unveiled that if a fully working quantum computer was available, it could factor large numbers easily. What is required to build a quantum computer? • We need qubits that behave the way we want them to. • These qubits could be made of photons, atoms, electrons, molecules or perhaps something else. • Scientists at IQC are researching a large array of them as potential bases for quantum computers. • But qubits are notoriously tricky to manipulate, since any disturbance causes them to fall out of their quantum state (or "decohere"). Challenges To Quantum Computing Decoherence • One of the biggest challenges is to remove quantum decoherence. • Decoherence in a layman's language could be understood as the loss of information to the environment. The decoherence of the qubits occurs when the system interacts with the surrounding in a thermodynamically irreversible manner. • So, the system needs to be carefully isolated. Freezing the qubits is one of the ways to prevent decoherence. Challenges To Quantum Computing Interference • During the computation phase of a quantum calculation, the slightest disturbance in a quantum system (say a stray photon or wave of EM radiation) causes the quantum computation to collapse, a process known as de-coherence. • A quantum computer must be totally isolated from all external interference during the computation phase. • Some success has been achieved with the use of qubits in intense magnetic fields, with the use of ions. If It's So Complex, Why Is Everyone After Quantum Computing? • A fully functional quantum computer would require around a million atoms. And right now, we are at a mere thousand. • But, what would happen if we reach that limit or even its half? • Genome sequencing or Tracking weather patterns. • Second, the modern day encryption systems are entirely based on the limitations of the regular computers. • Quantum computing won't be of changing your lives in day to day operations, but a quantum communication network would definitely provide a better and secure network.