Area computation utilizing the quantum curvelet transform [electronic resource] / Evan Scot Petersen
- Author
- Petersen, Evan Scot
- Published
- [University Park, Pa.] : Pennsylvania State University, 2010.
- Physical Description
- 1 electronic document (42 pages)
- Additional Creators
- Hallgren, Sean and Schreyer Honors College
Access Online
- Summary
- In the past year, a lower bound was placed on the complexity of calculating the volume of an object by a randomized algorithm. Here, I take the first steps to show reason to believe a quantum computer may be able to break that lower bound through use of a quantum algorithm utilizing Yi-Kai Liu’s quantum curvelet transform. To do that, I take on a simpler, easier version of the problem and show reason to believe that a quantum computer could solve this in constant time through the use of various simulations of the algorithm at work. I also show some attempts to make alternative versions of the quantum curvelet transform and the problems associated with these particular methods. This paper also reinforces the work of Dr. Liu on his algorithms in the continuous case by demonstrating something similar to what he conjectured should work in the discrete case.
- Other Subject(s)
- Dissertation Note
- B.S. Pennsylvania State University 2010.
- Note
- Mode of access: World Wide Web.
Thesis supervisor: Sean Hallgren. - Reproduction Note
- Library holds archival microfiche negative and service copy. 1 fiche. (PSU Management Services, 2010).
- Technical Details
- The full text of the dissertation is available as a Adobe Acrobat .pdf file ; Adobe Acrobat Reader required to view the file.
View MARC record | catkey: 6352356