Video URL
https://pirsa.org/11070063Super-polynomial Speed-up for a Quantum Computer on Boolean Trees
APA
Kimmel, S. (2011). Super-polynomial Speed-up for a Quantum Computer on Boolean Trees. Perimeter Institute for Theoretical Physics. https://pirsa.org/11070063
MLA
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
BibTex
@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/pirsa/11070063}} }
Shelby Kimmel Massachusetts Institute of Technology (MIT)
Source RepositoryPIRSA
Collection
Talk Type
Conference