The Road to Quantum Computing: Boson Sampling Nate Kinsey ECE 695 Quantum Photonics Spring 2014.

Slides:



Advertisements
Similar presentations
A Quantum Programming Language
Advertisements

New Evidence That Quantum Mechanics Is Hard to Simulate on Classical Computers Scott Aaronson Parts based on joint work with Alex Arkhipov.
The Computational Complexity of Linear Optics Scott Aaronson and Alex Arkhipov MIT vs.
Quantum Computing with Noninteracting Bosons
New Computational Insights from Quantum Optics Scott Aaronson.
Solving Hard Problems With Light Scott Aaronson (Assoc. Prof., EECS) Joint work with Alex Arkhipov vs.
New Computational Insights from Quantum Optics Scott Aaronson Based on joint work with Alex Arkhipov.
Quantum Computation and Quantum Information – Lecture 2
Space complexity [AB 4]. 2 Input/Work/Output TM Output.
1 Optimization Algorithms on a Quantum Computer A New Paradigm for Technical Computing Richard H. Warren, PhD Optimization.
Cove: A Practical Quantum Computer Programming Framework Matt Purkeypile Fall 2008.
Quantum random walks Andre Kochanke Max-Planck-Institute of Quantum Optics 7/27/2011.
Displaced-photon counting for coherent optical communication Shuro Izumi.
Quantum Computation and Error Correction Ali Soleimani.
An Algebraic Foundation for Quantum Programming Languages Andrew Petersen & Mark Oskin Department of Computer Science The University of Washington.
Engineering Models and Design Methods for Quantum State Machines.
Quantum Computing Joseph Stelmach.
Schrödinger’s Elephants & Quantum Slide Rules A.M. Zagoskin (FRS RIKEN & UBC) S. Savel’ev (FRS RIKEN & Loughborough U.) F. Nori (FRS RIKEN & U. of Michigan)
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
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.
Quantum Computation and Quantum Information – Lecture 2 Part 1 of CS406 – Research Directions in Computing Dr. Rajagopal Nagarajan Assistant: Nick Papanikolaou.
Quantum computing Alex Karassev. Quantum Computer Quantum computer uses properties of elementary particle that are predicted by quantum mechanics Usual.
By: Mike Neumiller & Brian Yarbrough
Single Photon Emitters and their use in Quantum Cryptography Presentation by: Bram Slachter Supervision: Dr. Ir. Caspar van der Wal.
Quantum Algorithms for Neural Networks Daniel Shumow.
QUANTUM ENTANGLEMENT AND IMPLICATIONS IN INFORMATION PROCESSING: Quantum TELEPORTATION K. Mangala Sunder Department of Chemistry IIT Madras.
Outline Main result Quantum computation and quantum circuits Feynman’s sum over paths Polynomials QuPol program “Quantum Polynomials” Quantum polynomials.
School of something FACULTY OF OTHER School of Physics and Astronomy FACULTY OF MATHEMATICAL AND PHYSICAL SCIENCES Nonlocality of a single particle Jacob.
Jian-Wei Pan Decoherence-free sub-space and quantum error-rejection Jian-Wei Pan Lecture Note 7.
Lecture note 8: Quantum Algorithms
An Introduction to Quantum Phenomena and their Effect on Computing Peter Shoemaker MSCS Candidate March 7 th, 2003.
Photon Efficiency Measures & Processing Dominic W. Berry University of Waterloo Alexander I. LvovskyUniversity of Calgary.
By Joseph Szatkowski and Cody Borgschulte. ● Uses phenomenon associated with quantum mechanics instead of electrical circuitry ● Quantum mechanics explains.
Quantum signal processing Aram Harrow UW Computer Science & Engineering
Bell Measurements and Teleportation. Overview Entanglement Bell states and Bell measurements Limitations on Bell measurements using linear devices Teleportation.
Nawaf M Albadia
Quantum Computing and Nuclear Magnetic Resonance Jonathan Jones EPS-12, Budapest, August Oxford Centre for Quantum Computation
Gang Shu  Basic concepts  QC with Optical Driven Excitens  Spin-based QDQC with Optical Methods  Conclusions.
Quantum Computing: An Overview for non-specialists Mikio Nakahara Department of Physics & Research Centre for Quantum Computing Kinki University, Japan.
Quantum Corby Ziesman Computing. Future of Computing? Transistor-based Computing –Move towards parallel architectures Biological Computing –DNA computing.
A SEMINAR ON Q UANTUM C OMPUTING Institute Of Engineering & Management (CSE 3 rd year batch) Submitted to- Submitted by- Mr. D.P.S. Rathor Sudhir.
Verification of BosonSampling Devices Scott Aaronson (MIT) Talk at Simons Institute, February 28, 2014.
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.
As if computers weren’t fast enough already…
IPQI-2010-Anu Venugopalan 1 qubits, quantum registers and gates Anu Venugopalan Guru Gobind Singh Indraprastha Univeristy Delhi _______________________________________________.
Quantum Computing: An Introduction Khalid Muhammad 1 History of Quantum Computing Bits and Qubits Problems with the Quantum Machine.
An Introduction to Quantum Computation Sandy Irani Department of Computer Science University of California, Irvine.
Quantum Computation Stephen Jordan. Church-Turing Thesis ● Weak Form: Anything we would regard as “computable” can be computed by a Turing machine. ●
Quantum Computers By Ryan Orvosh.
Suggestion for Optical Implementation of Hadamard Gate Amir Feizpour Physics Department Sharif University of Technology.
Quantum Computing: An Introduction
Beginner’s Guide to Quantum Computing Graduate Seminar Presentation Oct. 5, 2007.
Arnau Riera, Grup QIC, Dept. ECM, UB 16 de maig de 2009 Intoduction to topological order and topologial quantum computation.
Scott Aaronson (MIT) April 30, 2014
Complexity-Theoretic Foundations of Quantum Supremacy Experiments
Introduction to Quantum Computing Lecture 1 of 2
Ψ WHITFIELD GROUP Ψ WHITFIELD GROUP
Based on joint work with Alex Arkhipov
Quantum Information with Continuous Variables
A Ridiculously Brief Overview
3rd Lecture: QMA & The local Hamiltonian problem (CNT’D)
Qubit Recycling in Quantum Computation
OSU Quantum Information Seminar
Quantum Computing and the Quest for Quantum Computational Supremacy
Quantum computation with classical bits
Scott Aaronson (UT Austin) Papers and slides at
Linear Optical Quantum Computing
Quantum Computing Joseph Stelmach.
Presentation transcript:

The Road to Quantum Computing: Boson Sampling Nate Kinsey ECE 695 Quantum Photonics Spring 2014

A Quantum leap for computing Quantum computing is the next frontier for electronics Enables solution of exponential problems in polynomial time ▫Searching ▫Prime factorization Simulation of quantum systems Understanding quantum phenomenon D-Wave One Quantum Computer, D-Wave Inc. 2

Fragile by Nature QC derives its power from the superposition quantum states Quantum states are subject to de- coherence De-coherence limits the ability to perform operations ▫Error correction? ▫3-bit has been demonstrated Difficult to entangle many qubits ▫Current record is 14 qubits [2] [1] T. Monz, “14-qubit entanglement: creation and coherence” Phys. Rev. Lett [2] G. Waldherr, “Quantum Error correction in a solid-state hybrid spin register” Nature,

Another solution? Generalized QC is proving difficult to realize (i.e. Shor, Q. Turing, etc) Can we use what we know about the quantum world to assist computation? 4

General Idea of Boson Sampling The idea of boson sampling was proposed in 2011 [1]. ▫Uses photons Similar to a Galton board, which samples from the binomial distribution. By engineering the peg sizes and locations a desired system can be modeled. The response is governed by quantum photon statistics. [1] S. Aaronson and A. Arkhipov, “The Computational complexity of Linear Optics,” Proc. ACM Symposium,

Where is this useful? Boson sampling is primarily focused on determining unitary matrix transformations. The observed output from a unitary transformation is defined by the permanent of the matrix. ▫Output from a large linear optical network (more details to come) The permanent is exponentially hard to solve and is limited to ~ 20 variables for current systems. [1] S. Aaronson and A. Arkhipov, “The Computational complexity of Linear Optics,” Proc. ACM Symposium,

Quick Review of QBS 7 C. Gerry andP. Knights Introductory Quantum Optics, Cambridge University Press, 2005.

Quick Review of QBS 8 C. Gerry andP. Knights Introductory Quantum Optics, Cambridge University Press, 2005.

Two Photon Interference 9 C. Gerry andP. Knights Introductory Quantum Optics, Cambridge University Press, 2005.

Two Photon Interference 10 C. Gerry andP. Knights Introductory Quantum Optics, Cambridge University Press, 2005.

Boson Sampling Comprised of many beam splitters and delay lines (pegs/spaces on the Galton board) Also uses many input channels We consider an input state I, the probability of state O is defined by the permanent of the unitary transformation U. [1] M. Tillmann, et al. “Experimental Boson Sampling,” Nature Photonics,

Boson Sampling Quick example: 12 [1] M. Tillmann, et al. “Experimental Boson Sampling,” Nature Photonics, 2013.

Experimental Boson Sampling After the first description of boson sampling by Aaronson and Arkhipov four groups conducted experiments. ▫M. Tillmann, Nature Photonics ▫J. Spring, Science ▫A. Crespi, Nature Photonics ▫M. Broome, Science They were coordinated and released simultaneously across Science and Nature in

Experimental Boson Sampling M=6 input and output (36 element matrix) Complex elements of the unitary matrix Λ were sampled (Λ ij =t ij e iφ ij ) ▫Insert at port i and detect at port j ▫This determines the magnitude of the matrix element |t ij | 2 ▫Insert two photons i 1 and i 2 and observing at j 1 and j 2 determines complex angle φ (relative phase shift). 14

Experimental Boson Sampling 15 Completed for 3 and four photon excitation Blue values: predicted probability of output from experimentally determined Λ ij Red values: experimentally measured probabilities of given output

Experimental Boson Sampling 16 Additionally, studied response of an ideal boson sampling machine. They found that the experimental deviation was larger than expected ▫Not sampling from distribution of network ▫Distinguishability of photons ▫Bunched emission Despite this, a good agreement was found with predictions Technique is robust

Outlook for Boson Sampling The benefit of boson sampling is that its requirements are more relaxed that those of generalized QC. ▫Some believe that it would be nearly as difficult to scale single photons sources to the necessary level However, boson sampling is the only known way to make permanents show up as amplitudes, which is an important function for computer science. Additionally, for large scale boson sampling systems, they are impossible to model on a classical computer. ▫Thus, they are a unique window into a complex quantum world (simulation) without the need for general QC. 17

Conclusions Boson sampling is a near term method for enabling quantum assisted computation Can model complex systems to determine the unitary matrix transformation (i.e. Permanents) Enables unique access into complex quantum interactions that would only be able to be investigated with a general QC 18