Quantum Computing Preethika Kumar

Slides:



Advertisements
Similar presentations
Improved Simulation of Stabilizer Circuits Scott Aaronson (UC Berkeley) Joint work with Daniel Gottesman (Perimeter)
Advertisements

University of Queensland
Quantum Walks, Quantum Gates, and Quantum Computers Andrew Hines P.C.E. Stamp [Palm Beach, Gold Coast, Australia]
Three-qubit quantum error correction with superconducting circuits
Local Hamiltonians in Quantum Computation Funding: Slovak Research and Development Agency, contract No. APVV , European Project QAP 2004-IST- FETPI-15848,
Quantum Computing MAS 725 Hartmut Klauck NTU
1 Optimization Algorithms on a Quantum Computer A New Paradigm for Technical Computing Richard H. Warren, PhD Optimization.
Adiabatic Quantum Computation with Noisy Qubits Mohammad Amin D-Wave Systems Inc., Vancouver, Canada.
Quantum Error Correction Joshua Kretchmer Gautam Wilkins Eric Zhou.
Advanced Computer Architecture Laboratory EECS Fall 2001 Quantum Logic Circuits John P. Hayes EECS Department University of Michigan, Ann Arbor,
Quantum Error Correction SOURCES: Michele Mosca Daniel Gottesman Richard Spillman Andrew Landahl.
Chien Hsing James Wu David Gottesman Andrew Landahl.
Quantum Error Correction and Fault Tolerance Daniel Gottesman Perimeter Institute.
Universal Optical Operations in Quantum Information Processing Wei-Min Zhang ( Physics Dept, NCKU )
Quantum Error Correction Michele Mosca. Quantum Error Correction: Bit Flip Errors l Suppose the environment will effect error (i.e. operation ) on our.
Gate robustness: How much noise will ruin a quantum gate? Aram Harrow and Michael Nielsen, quant-ph/0212???
An Algebraic Foundation for Quantum Programming Languages Andrew Petersen & Mark Oskin Department of Computer Science The University of Washington.
University of Queensland
Review from last lecture: A Simple Quantum (3,1) Repetition Code
The Integration Algorithm A quantum computer could integrate a function in less computational time then a classical computer... The integral of a one dimensional.
UNIVERSITY OF NOTRE DAME Xiangning Luo EE 698A Department of Electrical Engineering, University of Notre Dame Superconducting Devices for Quantum Computation.
Dirac Notation and Spectral decomposition Michele Mosca.
Error-correcting the IBM qubit error-correcting the IBM qubit panos aliferis IBM.
From Atoms to Quantum Computers: the classical and quantum faces of nature Antonio H. Castro Neto Dartmouth College, November 2003.
Anuj Dawar.
分子・レーザー相互作用を使っ た 量子情報処理 大槻幸義 ( 東北大院理. & JST-CREST)
In Search of a Magic Bottle of Error-Be-Gone Dave Bacon Caltech Department of Physics Institute for Quantum Information Decoherence errosol.
An Arbitrary Two-qubit Computation in 23 Elementary Gates or Less Stephen S. Bullock and Igor L. Markov University of Michigan Departments of Mathematics.
A Fault-tolerant Architecture for Quantum Hamiltonian Simulation Guoming Wang Oleg Khainovski.
Experimental Realization of Shor’s Quantum Factoring Algorithm ‡ ‡ Vandersypen L.M.K, et al, Nature, v.414, pp. 883 – 887 (2001) M. Steffen 1,2,3, L.M.K.
Technion – Israel Institute of Technology Department of Electrical Engineering High Speed Digital Systems Lab Written by: Haim Natan Benny Pano Supervisor:
ROM-based computations: quantum versus classical B.C. Travaglione, M.A.Nielsen, H.M. Wiseman, and A. Ambainis.
Autonomous Quantum Error Correction Joachim Cohen QUANTIC.
Classical Versus Quantum. Goal: Fast, low-cost implementation of useful algorithms using standard components (gates) and design techniques Classical Logic.
Quantum Error Correction Jian-Wei Pan Lecture Note 9.
Paraty - II Quantum Information Workshop 11/09/2009 Fault-Tolerant Computing with Biased-Noise Superconducting Qubits Frederico Brito Collaborators: P.
Quantum systems for information technology, ETHZ
Quantum Computers: Fundamentals, Applications and Implementation Ben Feldman, Harvard University Big Techday Conference June 14, 2013 Image: Introduction.
Matt Reed Yale University Boston, MA - February 28, 2012
Gerousis Toward Nano-Networks and Architectures C. Gerousis and D. Ball Department of Physics, Computer Science and Engineering Christopher Newport University.
Quantum Control Synthesizing Robust Gates T. S. Mahesh
Quantum Computing MAS 725 Hartmut Klauck NTU
1 hardware of quantum computer 1. quantum registers 2. quantum gates.
1 Dorit Aharonov Hebrew Univ. & UC Berkeley Adiabatic Quantum Computation.
Classical Control for Quantum Computers Mark Whitney, Nemanja Isailovic, Yatish Patel, John Kubiatowicz U.C. Berkeley.
A Study of Error-Correcting Codes for Quantum Adiabatic Computing Omid Etesami Daniel Preda CS252 – Spring 2007.
1 Figure 4.29 The use of fixed bias (constant V GS ) can result in a large variability in the value of I D. Devices 1 and 2 represent extremes among units.
Quantum Computing: An Overview for non-specialists Mikio Nakahara Department of Physics & Research Centre for Quantum Computing Kinki University, Japan.
S. E. Thompson EEL Quantum cellular Automata Quantum Cellular Automata (QCA) refers to any one of several models of quantum computation, which have.
Panos aliferis IBM Jan. 09 quantum computing hardware with highly biased noise.
Copyright© 2012, D-Wave Systems Inc. 1 Quantum Boltzmann Machine Mohammad Amin D-Wave Systems Inc.
IPQI-2010-Anu Venugopalan 1 qubits, quantum registers and gates Anu Venugopalan Guru Gobind Singh Indraprastha Univeristy Delhi _______________________________________________.
Optimization of Quantum Circuits for Interaction Distance in
An Introduction to Quantum Computation Sandy Irani Department of Computer Science University of California, Irvine.
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.
Simulation and Design of Stabilizer Quantum Circuits Scott Aaronson and Boriska Toth CS252 Project December 10, X X +Z Z +ZI +IX
Quantum Shift Register Circuits Mark M. Wilde arXiv: National Institute of Standards and Technology, Wednesday, June 10, 2009 To appear in Physical.
Quantum Bits (qubit) 1 qubit probabilistically represents 2 states
Digital Decode & Correction Logic
BASIS Foundation Summer School 2018 "Many body theory meets quantum information" Simulation of many-body physics with existing quantum computers Walter.
Outline Device & setup Initialization and read out
Quantum Computing Dorca Lee.
Introduction to Quantum logic (2)
Bayesian Deep Learning on a Quantum Computer
Quantum Computing: the Majorana Fermion Solution
Improving Quantum Circuit Dependability
Linear Optical Quantum Computing
Determining the capacity of any quantum computer to perform a useful computation Joel Wallman Quantum Resource Estimation June 22, 2019.
Presentation transcript:

Quantum Computing Preethika Kumar

“Classical” Computing: MOSFET

CMOS Limitations (Wave-Particle Duality)

In the Quantum World….. Bits become qubits: “0”, “1” or “both” Unitary matrices become quantum gates: We have a universal set of gates Probability of measuring|0 Probability of measuring|1 I Junction I

Schrödinger Equation Newton’s Law of the Little World Hamiltonian: 2n  2n non-diagonal matrix

Typical Quantum Circuit X S H H Z

Single Qubit Hamiltonian bias tunneling

Single Qubit Hamiltonian bias tunneling

Two Qubit System A B  |00 |01 |10 |11 00| 01| 10| 11|

Some Potential Challenges No Cloning Theorem - moving quantum data (fan-out) - quantum error correction (redundancy) Measurements collapse quantum states - closed quantum systems (coupling with environment) - quantum error correction (syndromes) Architectural layouts: limited interactions - gate operations - moving quantum data

Research: Quantum Gates (Reducing the Hamiltonian) B  |00 |01 |10 |11 00| 01| 10| 11| Goal: Find system parameters (mathematical solution) Constraints: - Minimize control circuitry (closed system) - Fixed system parameters (design)

Research: “Controlled” Gates (Reducing the Hamiltonian) |00 |01 |10 |11 00| 01| 10| 11| Similar to Fix A’s state – large A – can neglect effect of A. |00 |01 |10 |11 00| 01| 10| 11|

Controlled- Hadamard Gate Barenco, et al., PRA 52, 3457 (1995) Bias Pulse on Target Time T e max min Parameters : T = 7 ns  = 25 MHz  = 35.9 MHz min = 60.9 MHz max = 10.0 GHz

Research: Gates in Linear Nearest Neighbor Architectures (LNNA) 1 2 C Want to do gate operations on qubit B |0 B 1 2 Method 1: Fix adjacent qubits (A and C) in the |0 state Method 2: Shut off the couplings (of qubit B with A and C) A B 1 2 C

Research: Gates in LNNA B C = Pulse 1 Pulse 2 A B C U A B C U A B C U

Research: Gates in LNNA B 1 2 C A = 0 A =  B = ? B =  C = 0 C =  Approach will be used to implement controlled-unitary operations

Research: Mirror Inverse Operations

Research: Mirror Inverse Operations

Research: Mirror Inverse Operations

Research: Mirror Inverse Operations

Current Research Adiabatic Quantum Computing - optimization problems - hardware exists (DWave Systems) Quantum Neural Networks - designing QNNs (exploit quantum phenomena) - using QNNs for different applications to calculate parameters Fault-tolerant Quantum Computing - gate design without decoding