Quantum Computers Gates, circuits and programming.

Slides:



Advertisements
Similar presentations
Quantum Computation and Quantum Information – Lecture 3
Advertisements

University of Queensland
Quantum Computing MAS 725 Hartmut Klauck NTU
Quantum Packet Switching A. Yavuz Oruç Department of Electrical and Computer Engineering University of Maryland, College Park.
QUANTUM COMPUTATION AND QUANTUM INFORMATION GROVER'S ALGORITHM Igor Ilijašević1 / 26.
Quantum Phase Estimation using Multivalued Logic.
1 Welcome to the presentation on Computational Capabilities with Quantum Computer By Anil Kumar Javali.
Grover. Part 2. Components of Grover Loop The Oracle -- O The Hadamard Transforms -- H The Zero State Phase Shift -- Z O is an Oracle H is Hadamards H.
An Algebraic Foundation for Quantum Programming Languages Andrew Petersen & Mark Oskin Department of Computer Science The University of Washington.
University of Queensland
Superposition, Entanglement, and Quantum Computation Aditya Prasad 3/31/02.
Engineering Models and Design Methods for Quantum State Machines.
Quantum Computing Joseph Stelmach.
Anuj Dawar.
Quantum Mechanics from Classical Statistics. what is an atom ? quantum mechanics : isolated object quantum mechanics : isolated object quantum field theory.
Quantum Computing Lecture 1 Michele Mosca. l Course Outline
Introduction to Quantum logic (2) Yong-woo Choi.
Quantum Algorithms Preliminaria Artur Ekert. Computation INPUT OUTPUT Physics Inside (and outside) THIS IS WHAT OUR LECTURES WILL.
ROM-based computations: quantum versus classical B.C. Travaglione, M.A.Nielsen, H.M. Wiseman, and A. Ambainis.
CSEP 590tv: Quantum Computing Dave Bacon June 29, 2005 Today’s Menu Administrivia Complex Numbers Bra’s Ket’s and All That Quantum Circuits.
Debasis Sadhukhan M.Sc. Physics, IIT Bombay. 1. Basics of Quantum Computation. 2. Quantum Circuits 3. Quantum Fourier Transform and it’s applications.
Quantum Error Correction Jian-Wei Pan Lecture Note 9.
QUANTUM ENTANGLEMENT AND IMPLICATIONS IN INFORMATION PROCESSING: Quantum TELEPORTATION K. Mangala Sunder Department of Chemistry IIT Madras.
Alice and Bob’s Excellent Adventure
Quantum Computers Algorithms and applications. Simulating classical operations 2/41 Dušan Gajević.
Cove: A Practical Quantum Computer Programming Framework Matt Purkeypile Doctorate of Computer Science Dissertation Defense June 26, 2009.
October 1 & 3, Introduction to Quantum Computing Lecture 1 of 2 Introduction to Quantum Computing Lecture 1 of 2
Solving mutual exclusion by using entangled Qbits Mohammad Rastegari proff: Dr.Rahmani.
Quantum Computer Simulation Alex Bush Matt Cole James Hancox Richard Inskip Jan Zaucha.
1 hardware of quantum computer 1. quantum registers 2. quantum gates.
Abstraction of Deutsch Algorithm and Its Implementation on QCL.
You Did Not Just Read This or did you?. Quantum Computing Dave Bacon Department of Computer Science & Engineering University of Washington Lecture 3:
Quantum Computing Paola Cappellaro
Syntax and Semantics CIS 331 Syntax: the form or structure of the expressions, statements, and program units. Semantics: the meaning of the expressions,
ELE 523E COMPUTATIONAL NANOELECTRONICS
Cove: A Practical Quantum Computer Programming Framework Matt Purkeypile (DCS3) Winter 2009.
8.4.2 Quantum process tomography 8.5 Limitations of the quantum operations formalism 量子輪講 2003 年 10 月 16 日 担当:徳本 晋
Communicating Quantum Processes Simon Gay Department of Computing Science University of Glasgow Rajagopal Nagarajan Department of Computer Science University.
Quantum Programming Languages By Steve Franchak. What are QPL’s? A set of programming languages that use high- level constructs to express quantum algorithms.
IPQI-2010-Anu Venugopalan 1 qubits, quantum registers and gates Anu Venugopalan Guru Gobind Singh Indraprastha Univeristy Delhi _______________________________________________.
Quantum Computers The basics. Introduction 2/47 Dušan Gajević.
An Introduction to Quantum Computation Sandy Irani Department of Computer Science University of California, Irvine.
What is a quantum computer? A quantum computer is any device for computation that makes use of quantum mechanical phenomena to perform operations on data,
Quantum Computation Stephen Jordan. Church-Turing Thesis ● Weak Form: Anything we would regard as “computable” can be computed by a Turing machine. ●
Final Project for Phys 642: An Introduction to Quantum Information and Quantum Computing Fall 2013 Implementing a Computer Simulation of Shor’s Quantum.
Quantum Computer Simulation Alex Bush Matt Cole James Hancox Richard Inskip Jan Zaucha.
1 An Introduction to Quantum Computing Sabeen Faridi Ph 70 October 23, 2007.
Beginner’s Guide to Quantum Computing Graduate Seminar Presentation Oct. 5, 2007.
Intro to Quantum Algorithms SUNY Polytechnic Institute Chen-Fu Chiang Fall 2015.
Quantum Shift Register Circuits Mark M. Wilde arXiv: National Institute of Standards and Technology, Wednesday, June 10, 2009 To appear in Physical.
Richard Cleve DC 3524 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 667 / Phys 767 C&O 481 / C&O 681 Lecture.
Postulates of Quantum Mechanics
Introduction to Quantum Computing Lecture 1 of 2
Complex Analysis in Quantum Computing
Lecture on Linear Algebra
Quantum Computing Dorca Lee.
A Ridiculously Brief Overview
Chap 4 Quantum Circuits: p
Introduction to Quantum logic (2)
OSU Quantum Information Seminar
Quantum Computation and Information Chap 1 Intro and Overview: p 28-58
Quantum computation with classical bits
Improving Quantum Circuit Dependability
Quantum Computation – towards quantum circuits and algorithms
Quantum Computing Joseph Stelmach.
Matt Purkeypile January 2008
Presentation transcript:

Quantum Computers Gates, circuits and programming

Quantum gates 2/27 Dušan Gajević

Quantum gates The same way classical gates manipulate only a few bits at a time, quantum gates manipulate only a few qubits at a time – Usually represented as unitary matrices we already saw Circuit representation Wires depict qubits …boxes and different symbols depict operations on qubits …inheritence of classical computing – it is better to think of qubits as particles and gates as physical processes applied to those particles 3/27 Dušan Gajević

Pauli-X gate Acts on a single qubit – Acting on pure states becomes a classical NOT gate Dirac notationMatrix representationCircuit representation Dirac notation… …is obviously more convenient for calculus 4/27 Dušan Gajević

Pauli-X gate – Acting on a general qubit state – It is its own inverse 5/27 Dušan Gajević

Hadamard gate Acts on a single qubit – Corresponding to the Hadamard transform we already saw – One of the most important gates for quantum computing Dirac notationUnitary matrixCircuit representation …obviously, no classical equivalent 6/27 Dušan Gajević

An interesting example Hadamard gate Acting on pure states… …gives a balanced superposition… …both states, if measured, give either 0 or 1 with equal probability 7/27 Dušan Gajević

Hadamard gate – Applying another Hadamard gate to the first result to the second result 8/27 Dušan Gajević

Hadamard gate The example gives an answer to the question asked before – why state of the system has to be specified with complex amplitudes and cannot be specified with probabilities only Both states give equal probabilities when measured… …but when Hadamard transformation is applied it produces two different states 9/27 Dušan Gajević

Pauli-Y gate Acts on a single qubit Dirac notationMatrix representationCircuit representation …another gate with no classical equivalent 10/27 Dušan Gajević

CNOT gate Controlled NOT gate Acts on two qubits – Classical gate operation Matrix representationCircuit representation 11/27 Dušan Gajević

CNOT gate – Example of acting on a superposition 12/27 Dušan Gajević

Toffoli gate Also called Controlled Controlled NOT Acts on three qubits – Classical gate operation Matrix representationCircuit representation 13/27 Dušan Gajević

Quantum circuits 14/27 Dušan Gajević

Universal set of quantum gates There is more than one universal set of gates for classical computing What about quantum computing, is there a universal set of gates to which any quantum operation possible can be reduced to? 15/27 Dušan Gajević

Universal set of quantum gates No, but any unitary transformation can be approximated to arbitrary accuracy using a universal gate set – For example (H, S, T, CNOT) Hadamard gatePhase gateπ/8 gateCNOT gate 16/27 Dušan Gajević

Quantum circuits The same way classical gates can be arranged to form a classical circuit, quantum gates can be arranged to form a quantum circuit Quantum circuit is the most commonly used model to describe a quantum algorithm Unlike classical circuits, the same number of wires is going throughout the circuit …as said before, inheritence of classical computing – usually it does not reflect the actual implementation 17/27 Dušan Gajević

Quantum programming 18/27 Dušan Gajević

There is already a number of programming languages adapted for quantum computing – but there is no actual quantum computer for algorithms to be executed on The purpose of quantum programming languages is to provide a tool for researchers, not a tool for programmers QCL is an example of such language Quantum programming 19/27 Dušan Gajević

QCL (Quantum Computation Language) Quantum programming C-like syntax allows combining of quantum and classical code 20/27 Dušan Gajević

Comes with its own interpreter and quantum system simulator QCL Shell environment Start interpreter… …with a 4 qubit quantum heap (32 if omitted) Numeric simulator …there is no assumption about the quantum computer implementation 21/27 Dušan Gajević

Example of interpreter interactive use QCL Initial quantum state Qubits allocated/Quantum heap total Resulting state Global quantum register definition Quantum operator 22/27 Dušan Gajević

Example of initialization and measurement within interpreter QCL Reinitializations have no effect on allocations 23/27 Dušan Gajević

QCL Examples of quantum registers, expressions and references Reference definitions have no effect on quantum heap 24/27 Dušan Gajević

QCL Example of operator definition 25/27 Dušan Gajević

– Newly defined operator usage QCL QCL allows inverse execution Force interactive use… …or interpreter will execute file content and exit Toffoli gate is its own inverse 26/27 Dušan Gajević

References University of California, Berkeley, Qubits and Quantum Measurement and Entanglement, lecture notes, Michael A. Nielsen, Isaac L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, Cambridge, UK, Colin P. Williams, Explorations in Quantum Computing, Springer, London, Samuel L. Braunstein, Quantum Computation Tutorial, electronic document University of York, York, UK Bernhard Ömer, A Procedural Formalism for Quantum Computing, electronic document, Technical University of Vienna, Vienna, Austria, Artur Ekert, Patrick Hayden, Hitoshi Inamori, Basic Concepts in Quantum Computation, electronic document, Centre for Quantum Computation, University of Oxford, Oxford, UK, Wikipedia, the free encyclopedia, /27 Dušan Gajević