Nested Quantum Walks Andrew M. Childs Stacey Jeffery Robin Kothari Frederic Magniez QIP 2014 arXiv:1210.1199 arXiv:1302.7316 arXiv:1210.1199 SODA 2013.

Slides:



Advertisements
Similar presentations
Quantum Search of Spatial Regions Scott Aaronson (UC Berkeley) Joint work with Andris Ambainis (U. Latvia)
Advertisements

Efficient Discrete-Time Simulations of Continuous- Time Quantum Query Algorithms QIP 2009 January 14, 2009 Santa Fe, NM Rolando D. Somma Joint work with.
Analysis of Algorithms CS Data Structures Section 2.6.
Robust Randomness Expansion Upper and Lower Bounds Matthew Coudron, Thomas Vidick, Henry Yuen arXiv:
CS-2852 Data Structures LECTURE 11 Andrew J. Wozniewicz Image copyright © 2010 andyjphoto.com.
Rumor Routing in Sensor Networks David Braginsky and Deborah Estrin Presented By Tu Tran 1.
Numbers
Lower Bounds for Collision and Distinctness with Small Range By: Andris Ambainis {medv, Mar 17, 2004.
Quasi-isometric Representation of Three Dimensional Triangulated Surfaces Project Summary.
Even faster point set pattern matching in 3-d Niagara University and SUNY - Buffalo Laurence Boxer Research partially supported by a.
Algorithmic Complexity 2 Fawzi Emad Chau-Wen Tseng Department of Computer Science University of Maryland, College Park.
Christian Sohler 1 University of Dortmund Testing Expansion in Bounded Degree Graphs Christian Sohler University of Dortmund (joint work with Artur Czumaj,
Quantum Algorithms II Andrew C. Yao Tsinghua University & Chinese U. of Hong Kong.
Tree edit distance1 Tree Edit Distance.  Minimum edits to transform one tree into another Tree edit distance2 TED.
Presented by: Martyna Kowalczyk CSCI 658
Generalized Quantum Arthur-Merlin Games Hirotada Kobayashi (NII) Francois Le Gall (U. Tokyo) Harumichi Nishimura (Nagoya U.) June 19,
Efficient Distance Computation between Non-Convex Objects By Sean Quinlan Presented by Sean Augenstein and Nicolas Lee.
Selective Sampling on Probabilistic Labels Peng Peng, Raymond Chi-Wing Wong CSE, HKUST 1.
Succinct Representations of Trees
Real Time Motion Planning. Introduction  What is Real time Motion Planning?  What is the need for real time motion Planning?  Example scenarios in.
Skip Lists Mrutyunjay. Introduction ▪ Linked Lists Benefits & Drawbacks: – Benefits: – Easy Insert and Deletes, implementations. – Drawbacks: – Hard to.
Writing Advanced SQL Queries BKF05 Liz Lucchese. Agenda  SQL revealed  What is it and why should I care?  Advanced query interface  So, how do I use.
Schoology Setup for Parents LTISD Learning Management System Access.
Quantum Homomorphic Encryption
Xiang Zhang, Feng Pan, Wei Wang, and Andrew Nobel VLDB2008 Mining Non-Redundant High Order Correlations in Binary Data.
Quantum random walks and quantum algorithms Andris Ambainis University of Latvia.
Facility Location in Dynamic Geometric Data Streams Christiane Lammersen Christian Sohler.
1 / 41 Convex Hulls in 3-space Jason C. Yang. 2 / 41 Problem Statement Given P: set of n points in 3-space Return: –Convex hull of P: CH (P) –Smallest.
Discrete Mathematics Lecture 7. 2 Analysis of Algorithms Analyzing an algorithm Time complexity Space complexity Time complexity Running time needed by.
Coherent Hierarchical Culling: Hardware Occlusion Queries Made Useful Jiri Bittner 1, Michael Wimmer 1, Harald Piringer 2, Werner Purgathofer 1 1 Vienna.
Improving the Performance Competitive Ratios of Transactional Memory Contention Managers Gokarna Sharma Costas Busch Louisiana State University, USA WTTM.
Computing Boolean Functions: Exact Quantum Query Algorithms and Low Degree Polynomials Alina Dubrovska, Taisia Mischenko-Slatenkova University of Latvia.
1 Weekly Slippage Report Current (Start / Finish) vs. Last Week Comparison Microsoft Project Users Group  Introduction  Current (Start / Finish) vs.
Span Programs, and-or trees, and effective resistance stacey jeffery shelby kimmel.
Search by quantum walk and extended hitting time Andris Ambainis, Martins Kokainis University of Latvia.
NP ⊆ PCP(n 3, 1) Theory of Computation. NP ⊆ PCP(n 3,1) What is that? NP ⊆ PCP(n 3,1) What is that?
Lecture 15: Query Optimization. Very Big Picture Usually, there are many possible query execution plans. The optimizer is trying to chose a good one.
By Purva Gawde For Advanced Operating Systems Instructor: Mikhail Nesterenko.
Fulfillment Deep Dive Presented by: Grant Baker Implementation Consultant November 10 th, 2015.
FAST-PPR: Personalized PageRank Estimation for Large Graphs Peter Lofgren (Stanford) Joint work with Siddhartha Banerjee (Stanford), Ashish Goel (Stanford),
Journal of Computational and Applied Mathematics Volume 253, 1 December 2013, Pages 14–25 Reporter : Zong-Dian Lee A hybrid quantum inspired harmony search.
10-1 人生与责任 淮安工业园区实验学校 连芳芳 “ 自我介绍 ” “ 自我介绍 ” 儿童时期的我.
Dynamic Covering and Cleaning Problems Yaniv Altshuler.
On the analysis of indexing schemes
Stochastic Streams: Sample Complexity vs. Space Complexity
Turing Machines Space bounds Reductions Complexity classes
Time Series Filtering Time Series
Yahoo Mail Customer Support Number
Most Effective Techniques to Park your Manual Transmission Car
How do Power Car Windows Ensure Occupants Safety
عناصر المثلثات المتشابهة Parts of Similar Triangles
تکنیک های فروش. تکنیک های فروش آیا فروش همان بازاریابی است؟ نقطه شروع کانون توجه وسیله نقطه پایان سود آوری با تامین رضایت مشتری آمیزه بازاریابی نیازهای.
Random Sampling over Joins Revisited
مفاهیم بهره وري.
القيادة.
Heapsort and d-Heap Neil Tang 02/11/2010
THANK YOU!.
Thank you.
Thank you.
CS 188: Artificial Intelligence
Classical Algorithms from Quantum and Arthur-Merlin Communication Protocols Lijie Chen MIT Ruosong Wang CMU.
CS223 Advanced Data Structures and Algorithms
How to test a Quantum Computer
Query Optimization.
Time Series Filtering Time Series
Print the following triangle, using nested loops
Heapsort and d-Heap Neil Tang 02/14/2008
Quantum Search Beyond Grover
Efficient Aggregation over Objects with Extent
Presentation transcript:

Nested Quantum Walks Andrew M. Childs Stacey Jeffery Robin Kothari Frederic Magniez QIP 2014 arXiv: arXiv: arXiv: SODA 2013 With arXiv: , ICALP 2013 arXiv: arXiv:

Quantum Algorithmica

Quantum Algorithmica

Anatomy of a Quantum Walk Setup Update Checking Quantum Walk Algorithm

Our First Result: Efficient Nested Checking Update Setup

Application to Triangle Finding

Aside: Query Complexity

Application to Triangle Finding

Second Contribution: Nested Updates Setup Checking Update

Application to k-Distinctness (k>2) (6, 2, 12, 7, 2, 4, 1, 5, 11, 4, 5, 2, 9, 7, 6)

Application to k-Distinctness (k>2)

arXiv: arXiv: Summary of Results

Random Walks

Recipe for Quantum Walk Upper Bound

Example: 2-Distinctness

3-Distinctness Attempt

c c cc

Recipe for Quantum Walk with Nested Update

Recap arXiv: arXiv: Thanks QIP Freaks!