PPT-A Maze-Solving Algorithm Using Quantum Computing

Scott Pakin 6 March 2018 Jefferson Laboratory Computing Round Table Quantum Computing LAUR1730456 6Mar2018 Quantum Annealing A quantum annealer exploits quantum effects to heuristically compute . Troy Mahon. What is a Maze?. “An . intricate, usually confusing network of interconnecting . pathways…” (the Free Dictionary). Many different kinds. Not all mazes can be solved the same way. Brief History. …using the Incomprehensible to solve the Intractable …. Dave McMahon. dave@nxtgenug.net. @. mcmahond. http://davemcmahon81.wordpress.com . Your Speaker. 15 years in Software Industry. 9 years Software Systems Architect at Ridgian. Starter. Can you think of any games you have played which involve a maze?. Here is an example of a numerical maze:. http://. www.roundgames.com/game/Maze+And+Math. How do you think these mazes . were created?. Raman Veerappan. EPS 109 Final Project. Introduction. Goals. To examine various maze solving algorithms using MATLAB determine which algorithms are most effective for which mazes. Two main algorithms examined. By Clara Bryant. How a Human solves a Maze. Greek Myth of the Minotaur. Greek hero Theseus is given string to find his way through and back out of the maze. String and chalk method to solve a maze. Mark the places you’ve visited already . Khalid Muhammad. 1. History of Quantum Computing. Bits and Qubits. Problems with the Quantum Machine. Who Introduced the Idea?. Khalid Muhammad. 1. Introduction to Quantum Computing. Soviet scientist Yuri . Background. Take an image of a maze and convert to a matrix. Limitation on . the . appearance of the maze. Use of Brownian motion inefficient to solve mazes. A second matrix as a copy of the maze that will store where the particle has been and walls. By: Roshan Kathir, Javakar Jeyanathan, Theodore Egube. What is Quantum Computing?. Computing using quantum mechanics. Very powerful technology to allow extremely fast computing . Uses . qubits . instead of bits. and particle physics. NPQI, Argonne. 28 March 2018. A quantum computer can simulate efficiently any physical process that occurs in Nature.. (Maybe. We don’t actually know for sure.). particle collision. Cynthia Lee. CS106B. Today’s topics:. Previous lectures:. Introduction to recursion with Factorial. Mechanics of recursion: looking at the stack frames. Classic, widely-used CS algorithm example: Binary Search. The Quantum Computer. Quantum computers, like all computers, are machines that perform calculations upon data.. Quantum computers use the principles of superposition and entanglement from the field of quantum mechanics to aid in the performance of these calculations. Programming Abstractions Cynthia Lee CS106X Today’s topics: Previous lectures: Introduction to recursion with Factorial Mechanics of recursion: looking at the stack frames Classic, widely-used CS algorithm example: Binary Search Cynthia Lee. CS106B. Today’s topics:. Previous lectures:. Introduction to recursion with Factorial. Mechanics of recursion: looking at the stack frames. Classic, widely-used CS algorithm example: Binary Search. Jordan Simo Kaptue. MRI. Quantum-based MRI could be used to look at single molecules or groups of molecules instead of the entire body, giving clinicians a far more accurate picture.. gold nanoparticles can be “programmed” to build up only in .