'Classical algorithm' presentation slideshows

Richard Cleve DC 2117 cleve@cs.uwaterloo

591 views • 49 slides

Introduction to Quantum Information Processing QIC 710 / CS 667 / PH 767 / CO 681 / AM 871

533 views • 45 slides

Boris Altshuler Columbia University

647 views • 30 slides

Richard Cleve DC 653 cleve@cs.uwaterloo

Introduction to Quantum Information Processing CS 467 / CS 667 Phys 667 / Phys 767 C&O 481 / C&O 681. Richard Cleve DC 653 cleve@cs.uwaterloo.ca. Lecture 3 (2005). Course website. Available at: http://www.cs.uwaterloo.ca/~cleve. Contents. Recap: states, unitary ops, measurements

432 views • 29 slides

Recap (I)

367 views • 24 slides

The Computational Complexity of Linear Optics

Barriers in Quantum Computing (And How to Smash Them Through Closer Interactions Between Classical and Quantum CS) Day.

308 views • 22 slides

The Computational Complexity of Linear Optics

The Computational Complexity of Linear Optics. vs. Scott Aaronson and Alex Arkhipov MIT. The Extended Church-Turing Thesis (ECT) Everything feasibly computable in the physical world is feasibly computable by a (probabilistic) Turing machine.

339 views • 20 slides

Richard Cleve DC 653 cleve@cs.uwaterloo Course web site at: cs.uwaterloo/~cleve

332 views • 20 slides

The Computational Complexity of Linear Optics

The Computational Complexity of Linear Optics. vs. Scott Aaronson and Alex Arkhipov MIT. The Extended Church-Turing Thesis (ECT) Everything feasibly computable in the physical world is feasibly computable by a (probabilistic) Turing machine.

225 views • 20 slides

Scott Aaronson UT Austin (and Scientific Adviser to QC Ware)

Quantum Supremacy and its Applications (!). HELLO HILBERT SPACE. Scott Aaronson UT Austin (and Scientific Adviser to QC Ware) Q2B, Mountain View, CA, December 12, 2018 Papers and slides at www.scottaaronson.com. QUANTUM SUPREMACY. | ?.

205 views • 19 slides

Quantum Processing Simulation

586 views • 14 slides

Quantum Computing and the Quest for Quantum Computational Supremacy

Quantum Computing and the Quest for Quantum Computational Supremacy. Scott Aaronson ( University of Texas at Austin) SparkCognition, January 22, 2019.

174 views • 11 slides

New Evidence That Quantum Mechanics Is Hard to Simulate on Classical Computers

157 views • 10 slides