Download to read offline
![Quantum
23.02.2021
13
Quantum Computing Basics
Photon
It is the quantum of the
electromagnetic field
including electromagnetic
radiation such as light and
radio waves, and the force
carrier for the
electromagnetic force (even
when static via virtual
particles). The invariant mass
of the photon is zero; it
always moves at the speed of
light in a vacuum.
Phonon
Is a collective excitation in a
periodic, elastic arrangement
of atoms or molecules in
condensed matter,
specifically in solids and
some liquids. Often
designated a quasiparticle,[1]
it represents an excited state
in the quantum mechanical
quantization of the modes of
vibrations of elastic structures
of interacting particles.
Plasmon
Is a quantum of plasma
oscillation. Just as light (an
optical oscillation) consists of
photons, the plasma
oscillation consists of
plasmons. The plasmon can
be considered as a
quasiparticle since it arises
from the quantization of
plasma oscillations, just like
phonons are quantizations of
mechanical vibrations.
Magnon
Is a quasiparticle, a collective
excitation of the electrons'
spin structure in a crystal
lattice. In the equivalent wave
picture of quantum
mechanics, a magnon can be
viewed as a quantized spin
wave.](https://image.slidesharecdn.com/ti8mquantumcomputingbasics-210223120224/85/Quantum-Computing-Basics-13-320.jpg)
![Quantum
23.02.2021
14
Quantum Computing Basics
Quant of the angular
momentum
Is the rotational equivalent of
linear momentum. It is an
important quantity in physics
because it is a conserved
quantity—the total angular
momentum of a closed
system remains constant.
Gluon
Is an elementary particle that
acts as the exchange particle
(or gauge boson) for the
strong force between quarks.
It is analogous to the
exchange of photons in the
electromagnetic force
between two charged
particles.[6] In layman's
terms, they "glue" quarks
together, forming hadrons
such as protons and
neutrons.
Graviton (maybe)
s the hypothetical quantum of
gravity, an elementary
particle that mediates the
force of gravity. There is no
complete quantum field
theory of gravitons due to an
outstanding mathematical
problem with renormalization
in general relativity. In string
theory, believed to be a
consistent theory of quantum
gravity, the graviton is a
massless state of a
fundamental string.](https://image.slidesharecdn.com/ti8mquantumcomputingbasics-210223120224/85/Quantum-Computing-Basics-14-320.jpg)
Uploaded byChristian Waha
Quantum Computing Basics
The document provides an overview of quantum computing basics, including: - Types of quantum computers such as quantum annealers, analog quantum computers, and universal quantum computers. - Key concepts such as qubits, the smallest unit of quantum information that can be in a superposition of states, and common physical implementations like ions and photons. - Challenges like errors that can occur and approaches to error correction using techniques like Shor's code and topological quantum codes. - An example of Schrodinger's cat thought experiment that illustrates the strange nature of quantum superposition.
More Related Content
Similar to Quantum Computing Basics
![Getting Started with Apache Spark: Big Data Made Simple [Free Meetup]](https://cdn.slidesharecdn.com/ss_thumbnails/apachesparkgettingstarted-260203175547-8361bcc3-thumbnail.jpg?width=640&height=640&fit=bounds)
Quantum Computing Basics
- 1. Quantum Computing Basics ChristianWaha / Technical Fellow Zürich, 2020 ti&m
- 2. ti8m.com ti&m AG Zürich Buckhauserstrasse 24 CH-8048Zürich +41 44 497 75 00 Bern Monbijoustrasse 68 CH-3007 Bern +41 44 497 75 00 Frankfurt am Main Schaumainkai 91 D-60596 Frankfurt am Main +49 69 66 77 41 395 About me Wir digitalisieren Ihr Unternehmen. Christian Waha – Technical Fellow Some Facts: Technical Fellow @ti&m AG Microsoft Most Valuable Professional Microsoft Regional Director LEGO Serious Play Certified Facilitator Linkedin Learning Trainer Azure Meetup Munich Organizer
- 3. 23.02.2021 3 Du möchtest… … Teilder nächsten IT-Revolution sein? … Dich mit modernster Technologie beschäftigen? … mit uns etwas Neues aufbauen? … in einer Firma mit starken Werten und Kultur arbeiten? Dann suchen wir genau Dich! Bewirb Dich auf eine unserer offenen Cloud Stellen: Cloud Architekt (Azure, Google Cloud Platform, AWS) Cloud Ingenieur (Azure, Google Cloud Platform, AWS) Microsoft Azure Solution Engineer Sende Deine Bewerbungsunterlagen direkt an christian.waha@ti8m.ch. Wir freuen uns auf Dich! Mehr Infos auf www.ti8m.ch Wir suchen Dich als Cloud Experten!
- 4. Buzzwords I willneed to talk about 23.02.2021 4 Quantum Computing Basics
- 5. Agenda 23.02.2021 5 Quantum Computing Basics •Buzzwords • Quantum Computer Concepts • Quantum variants • Qubit • Outlook
- 6. Quantum Computer 23.02.2021 6 Quantum ComputingBasics Is the study of a non-classical model of computation. Whereas traditional models of computing such as the Turing machine or Lambda calculus rely on "classical" representations of computational memory, a quantum computation could transform the memory into a quantum superposition of possible classical states. A quantum computer is a device that could perform such computation.
- 7. 23.02.2021 7 Kapiteltitel (kurz) /Folientitel (kurz)
- 8. Quantum Computers 23.02.2021 8 Quantum ComputingBasics Google Quantum Computer
- 9. Quantum Computers 23.02.2021 9 Quantum ComputingBasics Lockhead Martin
- 10. Types of QuantumComputers 23.02.2021 10 Quantum Computing Basics • Quantum Annealer The quantum annealer is least powerful and most restrictive form of quantum computers. It is the easiest to build, yet can only perform one specific function. The consensus of the scientific community is that quantum annealer has no known advantages over conventional computing. Applications: Optimization Problems. Generality: Restrictive. Computational Power: Same as traditional computers • Analog Quantum The analog quantum computer will be able to simulate complex quantum interactions that are intraceable for any known conventional machine, or combinations of these machines. It is conejctured that the analog quantum computer will contain somewhere between 50 to 100 Qubits. Applications: Quantum Chemistry, Material Science, Optimization Problems, Sampling, Quantum Dynamics. Generality: Partial. Computational Power: High Difficulty Level Difficulty Level Based on IBM Research Based on IBM Research
- 11. Types of QuantumComputers 23.02.2021 11 Quantum Computing Basics • Universal Quantum The universal quantum computer is the most powerful, the most general and the hardest to build, posing a number of difficult technical challenges. Current estimates indicate that this machine will comprise more than 1.000.000 physical qubits Applications: Secure Computing, Machine Learning, Cryptography, Quantum Chemistry, Material Science, Optimization Problems, Sampling, Searching. Generality: Complete with known speed up. Computational Power: Very High Difficulty Level Based on IBM Research
- 12. Quantum 23.02.2021 12 Quantum Computing Basics Inphysics, a quantum (plural quanta) is the minimum amount of any physical entity (physical property) involved in an interaction. The fundamental notion that a physical property may be "quantized" is referred to as "the hypothesis of quantization“. This means that the magnitude of the physical property can take on only discrete values consisting of integer multiples of one quantum. For example, a photon is a single quantum of light (or of any other form of electromagnetic radiation). Similarly, the energy of an electron bound within an atom is quantized and can exist only in certain discrete values.
- 13. Quantum 23.02.2021 13 Quantum Computing Basics Photon Itis the quantum of the electromagnetic field including electromagnetic radiation such as light and radio waves, and the force carrier for the electromagnetic force (even when static via virtual particles). The invariant mass of the photon is zero; it always moves at the speed of light in a vacuum. Phonon Is a collective excitation in a periodic, elastic arrangement of atoms or molecules in condensed matter, specifically in solids and some liquids. Often designated a quasiparticle,[1] it represents an excited state in the quantum mechanical quantization of the modes of vibrations of elastic structures of interacting particles. Plasmon Is a quantum of plasma oscillation. Just as light (an optical oscillation) consists of photons, the plasma oscillation consists of plasmons. The plasmon can be considered as a quasiparticle since it arises from the quantization of plasma oscillations, just like phonons are quantizations of mechanical vibrations. Magnon Is a quasiparticle, a collective excitation of the electrons' spin structure in a crystal lattice. In the equivalent wave picture of quantum mechanics, a magnon can be viewed as a quantized spin wave.
- 14. Quantum 23.02.2021 14 Quantum Computing Basics Quantof the angular momentum Is the rotational equivalent of linear momentum. It is an important quantity in physics because it is a conserved quantity—the total angular momentum of a closed system remains constant. Gluon Is an elementary particle that acts as the exchange particle (or gauge boson) for the strong force between quarks. It is analogous to the exchange of photons in the electromagnetic force between two charged particles.[6] In layman's terms, they "glue" quarks together, forming hadrons such as protons and neutrons. Graviton (maybe) s the hypothetical quantum of gravity, an elementary particle that mediates the force of gravity. There is no complete quantum field theory of gravitons due to an outstanding mathematical problem with renormalization in general relativity. In string theory, believed to be a consistent theory of quantum gravity, the graviton is a massless state of a fundamental string.
- 15. Qubit 23.02.2021 15 Quantum Computing Basics Inquantum computing, a qubit or quantum bit (sometimes qbit) is the basic unit of quantum information—the quantum version of the classical binary bit physically realized with a two-state device. A qubit is a two-state (or two-level) quantum-mechanical system, one of the simplest quantum systems displaying the peculiarity of quantum mechanics. Examples include: the spin of the electron in which the two levels can be taken as spin up and spin down; or the polarization of a single photon in which the two states can be taken to be the vertical polarization and the horizontal polarization. In a classical system, a bit would have to be in one state or the other. However, quantum mechanics allows the qubit to be in a coherent superposition of both states/levels simultaneously, a property which is fundamental to quantum mechanics and quantum computing.
- 16. Qubit 23.02.2021 16 Quantum Computing Basics 0 1 ClassicBit Quantum Bit 0 1 Bloch Sphere
- 17. Qubit – whatis necessary 23.02.2021 17 Quantum Computing Basics The five basic criterias 1. The system needs to have defined Qubits and have ti be scaleable. This means it can be enhanced with so much Qubits as you want. 2. It must be possibel to dissect in a pure state. (minimum State ) 3. The system need to be in a avilable effectual Coherence time. 4. The system needs to allow to implement universal sets of Quantum logic gates. Example: all 1-Qubit Gates and an additional CNOT Gate 5. It needs to be possible to target and measure single Qubits The two additional Criterias on Quantum communication are: 1. It must be possible to transform local Qubits in moving Qubits and vis versa. 2. An exchange of moving Qubits must be possible between remote locations
- 18. Qubit – howto measure 23.02.2021 18 Quantum Computing Basics • Ions in Ion traps Maximum at the moment with 20 Qubits • Electrons in Quantumdots (Spinqubit*, Chargequbit) • SQUIDs Maximum at the moment with 10 Qubits • Photons very good eligable for moving Qubits • Nuclear spin in molecule or solid materials
- 19. Qubit – Errors 23.02.2021 19 QuantumComputing Basics Limitations: • Collaps of the wave, at the moment of the measurement destroys the Qubit but delivers the state • The No-Cloning-Theorem prohibit to copy the state of the qubit • Because Qubits, can other than classical bits, represent a continuum on states, can errors also evolving Possible Errortypes: • No Error • Bit-Flip (change of the State) • Phase (change of the Prefix) • Bit-Phase (combination of both)
- 20. Qubit – Errorcorrection 23.02.2021 20 QuantumComputing Basics Bit-Flip-Code Sign-Flip-Code Shor-Code
- 21. Qubit – Errorcorrection- Models 23.02.2021 21 Quantum Computing Basics • Peter Shors 9-qubit-code decrypts 1 logical Qubit into 9 physical Qubits and can correct any error on a single Qubit • Steane Code decrypts 1 logical Qubit into 7 physical Qubits • Laflamme Code decrypts 1 logical Qubit into 5 physical Qubits • CSS Codes (Calderbank, Shor, Steane) • Additive Codes • Topological Quantum Codes
- 22. Schrödinger's cat 23.02.2021 22 Quantum ComputingBasics a cat, a flask of poison, and a radioactive source are placed in a sealed box. If an internal monitor (e.g. Geiger counter) detects radioactivity (i.e. a single atom decaying), the flask is shattered, releasing the poison, which kills the cat. The Copenhagen interpretation of quantum mechanics implies that after a while, the cat is simultaneously alive and dead. Yet, when one looks in the box, one sees the cat either alive or dead, not both alive and dead. This poses the question of when exactly quantum superposition ends and reality collapses into one possibility or the other.
- 23. Quantum entanglement 23.02.2021 23 Quantum ComputingBasics The Power of Quantum Computing is based on: Quantum entanglement is a label for the observed physical phenomenon that occurs when a pair or group of particles is generated, interact, or share spatial proximity in a way such that the quantum state of each particle of the pair or group cannot be described independently of the state of the others, even when the particles are separated by a large distance. In this state, called an equal superposition, there are equal probabilities of measuring either product state. In other words, there is no way to tell if the first qubit has value “0” or “1” and likewise for the second qubit.
- 24. Power of QuantumComputer 23.02.2021 24 Quantum Computing Basics 0 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 0 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 1 0 0 0 1 0 0 1 1 0 1 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 0 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 1 0 0 0 1 0 0 1 1 0 1 0 0000 0000 0001 0010 0011 0001 0001 0010 0011 0100 0010 0010 0011 0100 0101 0011 0011 0100 0101 0110 0100 0100 0101 0110 0111 0101 0101 0110 0111 1000 0110 0110 0111 1000 1001 0111 0111 1000 1001 1010 1000 1000 1001 1010 1011 1001 1001 1010 1011 1100
- 25. Power of QuantumComputer Quantum Computing Basics
- 26. Quantum Programming –Instruction Sets 23.02.2021 26 Quantum Computing Basics cQASM cQASM , also known as common QASM, is a hardware-agnostic QASM which guarantees the interoperability between all the quantum compilation and simulation tools. It was introduced by the QCA Lab at TUDelft. Quil Quil is an instruction set architecture for quantum computing that first introduced a shared quantum/classical memory model. It was introduced by Robert Smith, Michael Curtis, and William Zeng in A Practical Quantum Instruction Set Architecture. Many quantum algorithms (including quantum teleportation, quantum error correction, simulation, and optimization algorithms) require a shared memory architecture. OpenQASM OpenQASM is the intermediate representation introduced by IBM for use with Qiskit and the IBM Q Experience. Blackbird Blackbird is a quantum instruction set and intermediate representation used by Xanadu and Strawberry Fields. It is designed to represent continuous-variable quantum programs that can run on photonic quantum hardware.
- 27. Quantum Programming –SDKs 23.02.2021 27 Quantum Computing Basics SDKs with access to quantum processors • Ocean • ProjectQ • Qiskit • Forest SDKs based on simulators • Quantum Development Kit • Cirq • Strawberry Fields SDKs in development • t|ket>
- 28. Quantum Programming –Languages 23.02.2021 28 Quantum Computing Basics Imperative languages • QCL • Quantum pseudocode • Q# • Q|SI> • Q language • qGCL • QMASM Functional languages • QFC and QPL • QML • LIQUi|> • Quantum lambda calculi • Quipper
- 29. Quantum Programming –Algorithm 23.02.2021 29 Quantum Computing Basics Algorithms based on the quantum Fourier transform • Deutsch–Jozsa algorithm • Bernstein–Vazirani algorithm • Simon's algorithm • Quantum phase estimation algorithm • Shor's algorithm • Hidden subgroup problem • Boson sampling problem • Estimating Gauss sums • Fourier fishing and Fourier checking Algorithms based on amplitude amplification • Grover's algorithm • Quantum counting Algorithms based on quantum walks • Element distinctness problem • Triangle-finding problem • Formula evaluation • Group commutativity BQP-complete problems • Computing knot invariants • Quantum simulation • Solving a linear systems of equations Hybrid quantum/classical algorithms • QAOA • Variational quantum eigensolver
- 30. Quantum cryptography 23.02.2021 30 Quantum ComputingBasics The problem with currently popular algorithms is that their security relies on one of three hard mathematical problems: the integer factorization problem, the discrete logarithm problem or the elliptic-curve discrete logarithm problem. All of these problems can be easily solved on a sufficiently powerful quantum computer running Shor's algorithm.
- 31. Quantum Computer Aproaches QuantumComputing Basics P-NP Forrelation-Problem Recommendation Problem
- 32. Timeline – QuantumComputing 23.02.2021 32 IBM realized first 7 Qubit Computer University of Insbruck build first 8 Qubit Quantum Register University of Innsbruck almost doubled the amount of Qubits 2009 November 2008 2011 1990 IBM allowed access to ist Quantum Computer 2015 today Go Live for real Quantum Computers 2035 Google showed it’s 45 Qubit Quantum Computer October 2019 Yale University build first 2 Qubit Quantum Computer
- 33. Quantum Computers Basics Q&A ChristianWaha / Technical Fellow Zürich, Mai 2020 ti&m 2019
- 34. 23.02.2021 34 Du möchtest… … Teilder nächsten IT-Revolution sein? … Dich mit modernster Technologie beschäftigen? … mit uns etwas Neues aufbauen? … in einer Firma mit starken Werten und Kultur arbeiten? Dann suchen wir genau Dich! Bewirb Dich auf eine unserer offenen Cloud Stellen: Cloud Architekt (Azure, Google Cloud Platform, AWS) Cloud Ingenieur (Azure, Google Cloud Platform, AWS) Microsoft Azure Solution Engineer Sende Deine Bewerbungsunterlagen direkt an christian.waha@ti8m.ch. Wir freuen uns auf Dich! Mehr Infos auf www.ti8m.ch Wir suchen Dich als Cloud Experten!
- 35. ti8m.com ti&m AG Zürich Buckhauserstrasse 24 CH-8048Zürich +41 44 497 75 00 Bern Monbijoustrasse 68 CH-3007 Bern +41 44 497 75 00 Frankfurt am Main Schaumainkai 91 D-60596 Frankfurt am Main +49 69 66 77 41 395 Herzlichen Dank! Wir digitalisieren Ihr Unternehmen. Christian Waha – Technical Fellow