2011 Student Research Conference:
24th Annual Student Research Conference

Quantum Computing: Quantum Gates and the Quantum Fourier Transform
Travis E. Grider
Dr. Eduardo Velasco, Faculty Mentor

The purpose of quantum computation is to perform certain computational tasks using 1 and 2-bit quantum gates which use quantum bits (Qbits) which, when applied to certain computational problems, can greatly reduce the computing time compared to a classical computer. Whereas with a classical bit (Cbit), which can only take a value of 0 or 1, the state of a quantum bit is a linear superposition of the two states with complex coefficients. This allows a Qbit to contain more information than a Cbit ever could. The Quantum Fourier Transform is a super-fast version of the classical Fast Fourier Transform, built from a collection of quantum gates, used, among other things, to factor products of large prime numbers, a natural problem with practical applications. We programmed a classical computer to mimic these gates to demonstrate some algorithms used to solve interesting computational problems.

Keywords: Quantum, Computer, Fourier

Computer Science

Presentation Type: Oral Paper

Session: 27-2
Location: MG 1096
Time: 1:30

Add to Custom Schedule

   SRC Privacy Policy