9 citations · 13 across the 5 of their papers we have counts for
6 papers
Operator Imprecision and Scaling of Shor's Algorithm
C. Ray Hill, George F. Viamontes
Shor's algorithm (SA) is a quantum algorithm for factoring integers. Since SA has polynomial complexity while the best classical factoring algorithms are sub-exponential, SA is cit…
Checking Equivalence of Quantum Circuits and States
George F. Viamontes, Igor L. Markov, John P. Hayes
Quantum computing promises exponential speed-ups for important simulation and optimization problems. It also poses new CAD problems that are similar to, but more challenging, than…
Is Quantum Search Practical?
George F. Viamontes, Igor L. Markov, John P. Hayes
Quantum algorithms and circuits can, in principle, outperform the best non-quantum (classical) techniques for some hard computational problems. However, this does not necessarily l…
Graph-based simulation of quantum computation in the density matrix representation
George F. Viamontes, Igor L. Markov, John P. Hayes
Quantum-mechanical phenomena are playing an increasing role in information processing, as transistor sizes approach the nanometer level, and quantum circuits and data encoding meth…
Improving Gate-Level Simulation of Quantum Circuits
George F. Viamontes, Igor L. Markov, John P. Hayes
Simulating quantum computation on a classical computer is a difficult problem. The matrices representing quantum gates, and the vectors modeling qubit states grow exponentially wit…
Gate-Level Simulation of Quantum Circuits
George F. Viamontes, Manoj Rajagopalan, Igor L. Markov +1
While thousands of experimental physicists and chemists are currently trying to build scalable quantum computers, it appears that simulation of quantum computation will be at least…