Quantum Simulation
Alvin M. Despain, Defense Advanced Research Projects Agency, Arlington, VA
Kevin Obenland, University of Southern California, Los Angeles, CA
Description:
The field of Quantum Computation has generated a great deal of interest
lately due to the discovery of a quantum algorithm which can perform prime
factorization efficiently, thereby threatening public key encryption
systems. A quantum computer works by using the exponential nature of quantum
systems to perform an exponential amount of work in a polynomial amount of
time. Even though only small quantum computers have been demonstrated, there
are several promising proposed implementations. The presence of errors in
any implementation will threaten the usefulness of a quantum computation.
Through simulation of errors in quantum circuits we hope to gain insight
into the feasibility of quantum computation. We are studying circuits which
implement the prime factorization algorithm as well as error correction
circuits. Because of the exponential nature of a quantum computer,
simulating one requires a large amount of memory and processing resources.
Parallel simulation allows us to study circuits of greater size than would
be possible on single processor machines.
Assigned Site/System: NAVO T3E
CTA: Computational Electronics and Nanoelectronics