Quantum computing and polynomial equations over the finite field Z2 Christopher M. Dawson,1, 2, ∗ Henry L. Haselgrove,1, 3, † Andrew P. Hines,1, 2, ‡ Duncan Mortimer,1, 2, § Michael A. Nielsen,1, 4, ¶ and Tobias

First Page		Document Content
Quantum computer Quantum gate BQP Quantum circuit Hadamard transform Quantum error correction Gottesman–Knill theorem Quantum complexity theory Toffoli gate Theoretical computer science Quantum information science Applied mathematics		Quantum computing and polynomial equations over the finite field Z2 Christopher M. Dawson,1, 2, ∗ Henry L. Haselgrove,1, 3, † Andrew P. Hines,1, 2, ‡ Duncan Mortimer,1, 2, § Michael A. Nielsen,1, 4, ¶ and Tobias Add to Reading List Source URL: arxiv.org Download Document from Source Website File Size: 244,13 KB Share Document on Facebook

	Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of view DocID: 1xVR3 - View Document
	Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗ DocID: 1xUAX - View Document
	Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcs DocID: 1xUr4 - View Document
	Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingen DocID: 1xTuz - View Document
	CS 153 Current Topics in Theoretical Computer Science Spring 2016 DocID: 1vryF - View Document