InterJournal Complex Systems, 86
Status: Accepted
Manuscript Number: [86]
Submission Date: 972003
Simulation of factoring on a quantum computer architecture
Author(s): Kevin Obenland , Alvin Despain

Subject(s): CX.09

Category: Brief Article


Quantum computation has generated a lot of interest in the past few years, mostly due to the discovery of a quantum algorithm to factor numbers in polynomial time. A quantum computer can represent an exponentially large number of simultaneous states with a non-exponential number of bits. Because of this, operations in a quantum computer have the potential of solving exponentially difficult problems in polynomial time.

One of the challenges of quantum computation is that these exponential states are probabilistic and only a single state can be observed. Quantum algorithms must therefore produce a single answer which is a summation or property of the exponential internal states.

In this paper we present results of simulations of four different error models on three different networks which solve the factorization problem. We perform our simulations at the quantum gate level. Simulating at the gate level will allow us to determine the feasibility of large scale networks at minimal cost before expensive apparatus is built. Simulations also allow us to observe the intermediate states of the network, unlike a real quantum system where the quantum behavior breaks down on observation. This also allows the introduction of errors at each stage of the network. Understanding how errors affect the results of the computation at the gate level will help determine the fidelity to which quantum gates must be constructed.

Retrieve Manuscript
Submit referee report/comment

Public Comments: