[1] G. F. Viamontes, "Efficient Quantum Circuit Simulation,"

[2] G. F. Viamontes, I. L. Markov, J. P. Hayes, "Checking Equivalence of Quantum Circuits and States," in

[3] G. F. Viamontes, I. L. Markov, J. P. Hayes, "Graph-based simulation of quantum computation in the density matrix representation,"

[4] G. F. Viamontes, I. L. Markov, J. P. Hayes, "Improving Gate-Level Simulation of Quantum Circuits,"

[5] G. F. Viamontes, M. Rajagopalan, I. L. Markov, J. P. Hayes, "Gate-Level Simulation of Quantum Circuits,"

[6] P. E. Black et al., "Quantum compiling and simulation," http://hissa.nist.gov/~black/Quantum/

[7] libquantum, http://www.enyo.de/libquantum/

[8] S. Aaronson and D. Gottesman, "Improved Simulation of Stabilizer Circuits," to appear in

[9] G. Vidal, "Efficient classical simulation of slightly entangled quantum computations,"

[10] L. G. Valiant, "Quantum computers that can be simulated classically in polynomial time," in

[11] G. F. Viamontes, I. L. Markov, J. P. Hayes, "Is Quantum Search Practical?"

Copyright © 2004, 2005, 2006, 2007 George F. Viamontes, Igor L. Markov, John P. Hayes, and The Regents of the University of Michigan. All rights reserved.