BQP - PDFSEARCH.IO - Document Search Engine

BQP
Results: 36

#	Item
21	Is Quantum Mechanics Falsifiable? A computational perspective on the foundations of Quantum Mechanics. Dorit Aharonov∗and Umesh Vazirani† June 19, 2012 arXiv:1206.3686v1 [quant-ph] 16 Jun 2012 Add to Reading List Source URL: arxiv.org Language: English - Date: 2012-06-18 20:15:58 Computational complexity theory Quantum complexity theory Models of computation Interactive proof system Quantum computer BQP IP Quantum algorithm Probabilistic Turing machine Theoretical computer science Applied mathematics Quantum information science
22	Institute for Quantum Information Findings – [removed]Quantum information science is an exciting emerging field that addresses how fundamental physical laws can be harnessed to dramatically improve the acquisition, tran Add to Reading List Source URL: www.iqi.caltech.edu Language: English - Date: 2007-06-05 13:11:43 Applied mathematics Quantum computer Quantum algorithm Quantum information BQP Quantum key distribution Qubit Quantum error correction Topological quantum computer Theoretical computer science Quantum information science Physics
23	1 Ph 219b/CS 219b Exercises Due: Wednesday 20 November[removed]Universal quantum gates I Add to Reading List Source URL: www.theory.caltech.edu Language: English - Date: 2013-11-03 21:18:53 Quantum gate Quantum circuit Quantum computer Toffoli gate Controlled NOT gate PP BQP Hadamard transform Qubit Theoretical computer science Quantum information science Applied mathematics
24	Research Statement Scott Aaronson January 6, 2007 Most of my research deals with two questions: first, what are the ultimate limits on what can feasibly be computed in the physical world? Second, how can studying those l Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2007-01-11 00:07:45 Computational complexity theory Quantum information science Models of computation Quantum algorithm PP Quantum computer QMA BQP Hidden subgroup problem Theoretical computer science Applied mathematics Quantum complexity theory
25	Classical simulation complexity of extended Clifford circuits arXiv:1305.6190v1 [quant-ph] 27 May[removed]Richard Jozsa1 and Maarten Van den Nest2 Add to Reading List Source URL: arxiv.org Language: English - Date: 2013-05-27 20:17:13 Quantum information science Complexity classes Models of computation Circuit complexity Quantum computer Quantum circuit Gottesman–Knill theorem Quantum error correction BQP Theoretical computer science Applied mathematics Computational complexity theory
26	Research Statement Scott Aaronson January 6, 2007 Most of my research deals with two questions: first, what are the ultimate limits on what can feasibly be computed in the physical world? Second, how can studying those l Add to Reading List Source URL: scottaaronson.com Language: English - Date: 2007-01-11 00:07:45 Computational complexity theory Quantum information science Models of computation Quantum algorithm PP Quantum computer QMA BQP Hidden subgroup problem Theoretical computer science Applied mathematics Quantum complexity theory
27	Quantum Computing in Complexity Theory and Theory of Computation Austin Mohr Southern Illinois University at Carbondale Carbondale, IL[removed]E-mail: [removed] Add to Reading List Source URL: www.austinmohr.com Language: English - Date: 2010-05-16 22:23:52 Complexity classes BQP Quantum computer NP Low Bounded-error probabilistic polynomial Quantum algorithm PP Time complexity Theoretical computer science Computational complexity theory Applied mathematics
28	The Computational Complexity of Linear Optics Add to Reading List Source URL: theoryofcomputing.org Language: English - Date: 2013-02-09 04:40:42 Quantum complexity theory Analysis of algorithms Linear algebra Quantum computer PP Time complexity BQP Bounded-error probabilistic polynomial Randomized algorithm Theoretical computer science Computational complexity theory Applied mathematics
29	INFORMATION TECHNOLOGY THE LIMITSOF Add to Reading List Source URL: www.ime.usp.br Language: English - Date: 2013-04-30 09:54:41 Complexity classes Quantum information science Mathematical optimization Quantum algorithm Quantum computer P versus NP problem NP-complete NP BQP Theoretical computer science Applied mathematics Computational complexity theory
30	PEPS and Postselection The computational complexity of PEPS Add to Reading List Source URL: www.mpq.mpg.de Language: English - Date: 2014-05-30 09:02:45 PostBQP PP QMA Computational complexity theory Quantum computer BQP Density matrix renormalization group Oracle machine PEPS Theoretical computer science Applied mathematics Quantum complexity theory