Quantum computation: Enhancement of Shor's Algorithm
quantum, physics, algorithms, shor's, wavelet transform, 2005
Project details
In quantum computation we compute with a new set of rules. It allows no copying of data but allows exponential parallelization. This helps converting the exponential problems into polynomial ones. Shor's algorithm, stands as the best example to understand the power of quantum parallelization. It breaks the old security locks of RSA. In this project I specifically worked on how wavelet transform can enhance Shor's algorithm. Other thing I explored is applications of DJ algorithm.
Reflections: My undergrad in Information and Communication technology allowed me to study a wide variety of topics ranging from Radio Frequency to Globalization to Modern Algebra. My liking for Maths and curiosity to try one more new topic made me choose my B.Tech thesis project at Physical Research Laboratories, Ahmedabad. So, I worked on Quantum Computing, which is an exciting new way of looking at computing as unitary matrix transformations. The work was to create theoretical algorithms and allowed one to often fall into thinking about deeper philosophical meanings. Nobody understood it much, and I realized I am comfortable with ambiguity. And now I realize, designing for people is dealing with lot of ambiguity. Trying to read what's on the mind of user is equally hard as measuring a quantum bit.
People
- Faculty guide: Dr. Prasantha Panigrahi
- Pallavi Damera
Links
- Done at: Physical Research Laboratoy
- Under-graduate Institute:DAIICT