3 citations · 4 across the 4 of their papers we have counts for
4 papers · 1 filter
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…
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…
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…