Title: “Efficient Simulation of Quantum Circuits” Speaker: George F. Viamontes, University of Michigan Date/Time: Monday, June 12, 2006, 10:00 – 11:00 am Location: Building 980, Room 95 (Sandia NM) Brief Abstract: Quantum circuits have become one of the most popular models for quantum computers. They have generated a great deal of interest since quantum computers can in principle perform certain computations asymptotically faster than classical (i.e. non-quantum) computers. More importantly, quantum circuits can model any quantum mechanical phenomenon, not just specialized applications of quantum computers. As a result, simulation of quantum circuits are of great use from a general scientific computing perspective. Recent work has produced three major algorithms which can simulate non-trivial classes of quantum circuits, using asymptotically as much memory and runtime resources as an actual quantum computer. Furthermore, unlike other quantum mechanical simulation techniques, these algorithms are exact in that no approximations of the systems are made to ease the computational resource requirements of simulation. In this talk, these algorithms will be described with particular emphasis on one algorithm that makes use of the Quantum Information Decision Diagram (QuIDD) data structure which we have developed. The benefits provided by efficient, exact simulation of quantum circuits to the field of quantum computing and general simulation of quantum mechanical systems will also be discussed.CSRI POC: Erik DeBenedictis, (505) 284-4017 |