PIRSA:11070063

Video URL

https://pirsa.org/11070063

Super-polynomial Speed-up for a Quantum Computer on Boolean Trees

Kimmel, S. (2011). Super-polynomial Speed-up for a Quantum Computer on Boolean Trees. Perimeter Institute for Theoretical Physics. https://pirsa.org/11070063

Kimmel, Shelby. Super-polynomial Speed-up for a Quantum Computer on Boolean Trees. Perimeter Institute for Theoretical Physics, Jul. 20, 2011, https://pirsa.org/11070063 

          @misc{ scivideos_PIRSA:11070063,
            doi = {10.48660/11070063},
            url = {https://pirsa.org/11070063},
            author = {Kimmel, Shelby},
            keywords = {},
            language = {en},
            title = {Super-polynomial Speed-up for a Quantum Computer on Boolean Trees},
            publisher = {Perimeter Institute for Theoretical Physics},
            year = {2011},
            month = {jul},
            note = {PIRSA:11070063 see, \url{https://scivideos.org/index.php/pirsa/11070063}}
          }

Shelby Kimmel Massachusetts Institute of Technology (MIT)

Talk numberPIRSA:11070063
DOI10.48660/11070063
Source RepositoryPIRSA
Collection
Talk Type Conference

Abstract

We can prove that for certain problems, quantum computers do better than classical computers. I will introduce the query complexity framework, which lets us compare classical and quantum computers, and then describe a problem where quantum computers do better than classical. The problem I will discuss is evaluating boolean trees with a promise on the input.