Lecture 20, Tues April 4: Shor, Quantum Fourier Transform Last time we started in on Shor’s algorithm, a quantum algorithm that can factor N into p×q in polynomial time by reducing the problem to per

First Page		Document Content
Date: 2018-08-26 18:23:30 Mathematical analysis Mathematics Mathematical logic Set theory Operator theory Code Inner model theory Partial differential equations Complex analysis Omega-regular language Differential forms on a Riemann surface		Lecture 20, Tues April 4: Shor, Quantum Fourier Transform Last time we started in on Shor’s algorithm, a quantum algorithm that can factor N into p×q in polynomial time by reducing the problem to per Add to Reading List Source URL: www.scottaaronson.com Download Document from Source Website File Size: 367,44 KB Share Document on Facebook

	Classifying Regular Languages by a Split Game Qiqi Yan∗ BASICS Laboratory, Department of Computer Science and Engineering, Shanghai Jiao Tong University, 200240, Shanghai, P.R. China DocID: 1qHjy - View Document
	Learning Regular Omega Languages Dana Angluin1? and Dana Fisman2?? 1 2 DocID: 1ohPd - View Document
	On the topological complexity of weakly recognizable tree languages Jacques Duparc1 and Filip Murlak2? 1 Universit´e de Lausanne, Switzerland DocID: 1guzu - View Document
	On Deciding Topological Classes of Deterministic Tree Languages Filip Murlak ? DocID: 1aAMh - View Document
	Languages vs. ω-Languages in Regular Infinite Games Namit Chaturvedi? , Jörg Olschewski?? , and Wolfgang Thomas Lehrstuhl Informatik 7, RWTH Aachen University, Germany {chaturvedi,olschewski,thomas}@automata.rwth-aache DocID: 1972x - View Document