Samuel J. Lomonaco, Jr. Dept. of Comp. Sci. & Electrical Engineering University of Maryland Baltimore County Baltimore, MD 21250

Slides:



Advertisements
Similar presentations
A Quantum Programming Language
Advertisements

How Much Information Is In Entangled Quantum States? Scott Aaronson MIT |
The Learnability of Quantum States Scott Aaronson University of Waterloo.
Quantum t-designs: t-wise independence in the quantum world Andris Ambainis, Joseph Emerson IQC, University of Waterloo.
How Much Information Is In A Quantum State? Scott Aaronson MIT |
Lower Bounds for Local Search by Quantum Arguments Scott Aaronson (UC Berkeley) August 14, 2003.
Pretty-Good Tomography Scott Aaronson MIT. Theres a problem… To do tomography on an entangled state of n qubits, we need exp(n) measurements Does this.
University of Queensland
1 If we modify the machine for the language from F12 p. 47 we can easily construct a machine for the language Observation Turing machine for the language.
Code-Breaking with a Quantum Computer Credit for ideas and examples: Prof. N. D. Mermin’s class Phys 681 / Comp Sci 483 “Quantum Computation” (A good class)
1 Optimization Algorithms on a Quantum Computer A New Paradigm for Technical Computing Richard H. Warren, PhD Optimization.
Adiabatic Evolution Algorithm Chukman So ( ) Steven Lee ( ) December 3, 2009 for CS C191 In this presentation we will talk about the quantum.
The Hidden Subgroup Problem. Problem of great importance in Quantum Computation Most Q.A. that run exponentially faster than their classical counterparts.
Boris Altshuler Columbia University Anderson Localization against Adiabatic Quantum Computation Hari Krovi, Jérémie Roland NEC Laboratories America.
Universal Optical Operations in Quantum Information Processing Wei-Min Zhang ( Physics Dept, NCKU )
Phase in Quantum Computing. Main concepts of computing illustrated with simple examples.
1 Polynomial Time Reductions Polynomial Computable function : For any computes in polynomial time.
Quantum Computation and Error Correction Ali Soleimani.
University of Queensland
1 Other Models of Computation. 2 Models of computation: Turing Machines Recursive Functions Post Systems Rewriting Systems.
EECS 598: Background in Theory of Computation Igor L. Markov and John P. Hayes
Quantum Computing Joseph Stelmach.
Fall 2004COMP 3351 Time Complexity We use a multitape Turing machine We count the number of steps until a string is accepted We use the O(k) notation.
1 Quantum NP Dorit Aharonov & Tomer Naveh Presented by Alex Rapaport.
Quantum Computing Lecture 1 Michele Mosca. l Course Outline
Simulating Physical Systems by Quantum Computers J. E. Gubernatis Theoretical Division Los Alamos National Laboratory.
Quantum computing Alex Karassev. Quantum Computer Quantum computer uses properties of elementary particle that are predicted by quantum mechanics Usual.
Quantum Computing David Dvorak CIS 492. Quantum Computing Overview What is it? How does it work? –The basics –Clarifying with examples Factoring Quantum.
The Limits of Adiabatic Quantum Algorithms
Chang-Kui Duan, Institute of Modern Physics, CUPT 1 Harmonic oscillator and coherent states Reading materials: 1.Chapter 7 of Shankar’s PQM.
Algorithms for a large sparse nonlinear eigenvalue problem Yusaku Yamamoto Dept. of Computational Science & Engineering Nagoya University.
Quantum Information Jan Guzowski. Universal Quantum Computers are Only Years Away From David’s Deutsch weblog: „For a long time my standard answer to.
Limits and Horizon of Computing Post silicon computing.
NP Complexity By Mussie Araya. What is NP Complexity? Formal Definition: NP is the set of decision problems solvable in polynomial time by a non- deterministic.
Implementation of Quantum Computing Ethan Brown Devin Harper With emphasis on the Kane quantum computer.
Quantum Computing MAS 725 Hartmut Klauck NTU
Quantum Computing MAS 725 Hartmut Klauck NTU
Ch ; Lecture 26 – Quantum description of absorption.
PROBABILISTIC COMPUTATION By Remanth Dabbati. INDEX  Probabilistic Turing Machine  Probabilistic Complexity Classes  Probabilistic Algorithms.
Quantum Computing Paola Cappellaro
1 Dorit Aharonov Hebrew Univ. & UC Berkeley Adiabatic Quantum Computation.
Quantum Cryptography Slides based in part on “A talk on quantum cryptography or how Alice outwits Eve,” by Samuel Lomonaco Jr. and “Quantum Computing”
A Study of Error-Correcting Codes for Quantum Adiabatic Computing Omid Etesami Daniel Preda CS252 – Spring 2007.
Section 5.5 The Real Zeros of a Polynomial Function.
8.4.2 Quantum process tomography 8.5 Limitations of the quantum operations formalism 量子輪講 2003 年 10 月 16 日 担当:徳本 晋
Quantum Computing Michael Larson. The Quantum Computer Quantum computers, like all computers, are machines that perform calculations upon data. Quantum.
1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 467 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 3524 Course.
Computer Theory Michael J. Watts
Mesoscopic Physics Introduction Prof. I.V.Krive lecture presentation Address: Svobody Sq. 4, 61022, Kharkiv, Ukraine, Rooms. 5-46, 7-36, Phone: +38(057)707.
The Kind of Stuff I Think About Scott Aaronson (MIT) LIDS Lunch, October 29, 2013 Abridged version of plenary talk at NIPS’2012.
1 Time Complexity We use a multitape Turing machine We count the number of steps until a string is accepted We use the O(k) notation.
Can small quantum systems learn? NATHAN WIEBE & CHRISTOPHER GRANADE, DEC
Adiabatic Quantum Computing Josh Ball with advisor Professor Harsh Mathur Problems which are classically difficult to solve may be solved much more quickly.
Quantum Computation Stephen Jordan. Church-Turing Thesis ● Weak Form: Anything we would regard as “computable” can be computed by a Turing machine. ●
CSE 421 Algorithms Richard Anderson Winter 2009 Lecture 4.
QUANTUM COMPUTERS, COMPUTING AND INFORMATION ALAN DURNEV, PHYSICS.
Quantum Computing Are We There Yet?
Quantum Computing Keith Kelley CS 6800, Theory of Computation.
NP-Completeness A problem is NP-complete if: It is in NP
Poomipat Phusayangkul
Other Models of Computation
For computer scientists
2nd Lecture: QMA & The local Hamiltonian problem
A Ridiculously Brief Overview
Computational Complexity
3rd Lecture: QMA & The local Hamiltonian problem (CNT’D)
Time Complexity We use a multitape Turing machine
Adiabatic Quantum Computation in Superconducting Circuit
Quantum Computation and Information Chap 1 Intro and Overview: p 28-58
Quantum computation with classical bits
Presentation transcript:

Samuel J. Lomonaco, Jr. Dept. of Comp. Sci. & Electrical Engineering University of Maryland Baltimore County Baltimore, MD WebPage: Simons Algorithm: A Benchmork for the D-Wave Computer

The D-Wave Computer is based on the adiabatic model. Different Models of Q. Computation Gate Model Quantum Turing Machine Measurement Based Q. Comp. Adiabatic Model Topological Q. Comp.

Basic Quantum MechanicsIf Basic Quantum Mechanics: If is a quantum system in state is a Hamiltonian of as a function of time. Then Then evolves via Schroedingers eq Adiabatic ApproximationIf Adiabatic Approximation: If started in lowest En. State of changes slowly Then Then remains in L.E.S. of

Adiabatic Quantum Computation Select simple Hamiltonian with easily prepared L.E.S. Design a Hamiltonian whose L.E.S. provides answer to chosen problem P. Construct a q. system with Hamiltonian Start in state Slowly change the parameter until system reaches state Measure the state

Question ??? Question: Question: Is D-Wave Computer a Quantum Computer ??? Or is it simply computing according to the laws of classical physics ??? Aaronson & Vazirani Most likely NOT. Because system qubits decohere much faster than instruction execution time

Question ??? But the D-Wave is based on the adiabatic approximation. So it is the decoherence of the L.E.S. that is the central issue. Key Question scale Key Question: Does the time complexity of D- Wave scale like a quantum computer, or like a classical one? Question: Question: Is D-Wave Computer a Quantum Computer ???

Simons Algorithm But Simons quantum algorithm solves the above problem in polytime !!! Theorem Theorem: (Simon) All classical algorithms take at least exponential time to solve the above problem. Given a 2-to-1 function with unknown period, i.e., such that for all, find the period. Simons Problem: Simons Problem: Let be n-D vector space over the finite field.

Proposed Project Run Simons algorithm on the D-Wave to see how the algorithm scales. If the above plot shows that T(n) is bounded above by a polynomial, then the D-Wave is most likely a quantum computer. If not, then the D-Wave is most likely another classical computer. Plot of Computation Time Number of qubits ??? ? ?

Weird !