A Lower Bound for Fourier Transform Computation in a Linear Model Over 2x2 Unitary Gates Using Matrix Entropy

First Page		Document Content
Date: 2013-10-17 19:33:28 Fourier analysis Digital signal processing Joseph Fourier Unitary operators Integral transforms Discrete Fourier transform Fourier transform Fourier series Vector space Mathematical analysis Algebra Mathematics		A Lower Bound for Fourier Transform Computation in a Linear Model Over 2x2 Unitary Gates Using Matrix Entropy Add to Reading List Source URL: cjtcs.cs.uchicago.edu Download Document from Source Website File Size: 148,59 KB Share Document on Facebook

	Frobenius Additive Fast Fourier Transform Wen-Ding Li Ming-Shing Chen Po-Chun Kuo DocID: 1xVYf - View Document
	Polynomials and the Fast Fourier Transform (FFT) DocID: 1xUw0 - View Document
	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 DocID: 1xTSU - View Document
	Lecture IX: Fourier transform Maxim Raginsky BME 171: Signals and Systems Duke University October 8, 2008 DocID: 1uYub - View Document
	QUALIFYING EXAMINATION Harvard University Department of Mathematics Tuesday August 30, 2011 (DayLet f be a differentiable function on R whose Fourier transform is bounded DocID: 1uS2D - View Document