The Computational Complexity of Linear Optics

First Page		Document Content
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		The Computational Complexity of Linear Optics Add to Reading List Source URL: theoryofcomputing.org Download Document from Source Website File Size: 867,75 KB Share Document on Facebook

	The Space ‟Just Above” BQP Adam Bouland Based on joint work with Scott Aaronson, Joseph Fitzsimons and Mitchell Lee arXiv: 1412:6507 ITCS ‘16 DocID: 1sxeE - View Document
	NP-complete Problems and Physical Reality arXiv:quant-ph/0502072v2 21 Feb 2005 Scott Aaronson∗ DocID: 1pr8U - View Document
	Limitations of Quantum Advice and One-Way Communication DocID: 1pojZ - View Document
	LA-URTheory Component of the Quantum Information Processing DocID: 1p9P7 - View Document
	c 2005 Cambridge University Press Combinatorics, Probability and Computing, 737–754. DOI: S0963548305007005 Printed in the United Kingdom Approximate Counting and Quantum Computation DocID: 1oB0X - View Document