Operator Imprecision and Scaling of Shor's Algorithm (2008)
Hill, C. Ray, Viamontes, George F.
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 cited as evidence that...
IS QUANTUM SEARCH PRACTICAL? (2008)
C Omputing, George F. Viamontes, Igor L. Markov, P. Hayes
Gauging a quantum algorithm’s practical significance requires weighing it against the best conventional techniques applied to useful instances of the same problem. The authors show that several...
C Omputing, George F. Viamontes, Igor L. Markov, P. Hayes
Gauging a quantum algorithm’s practical significance requires weighing it against the best conventional techniques applied to useful instances of the same problem. The authors show that several...
Abstract Checking Equivalence of Quantum Circuits and States (2008)
George F. Viamontes, Igor L. Markov, John P. Hayes, Lockheed Martin Atl
Among the post-CMOS technologies currently under investigation, quantum computing (QC) holds a special place. QC offers not only extremely small size and low power, but also exponential speed-ups for...
Abstract Is Quantum Search Practical? (2007)
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 lead to useful...
Checking Equivalence of Quantum Circuits and States (2007)
Viamontes, George F., Markov, Igor L., Hayes, John P.
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 the related...
George F. Viamontes, Professor John, P. Hayes, Steve Plaza, Smita Krishnaswamy, Jin Hu, ...
To my family and friends ii ACKNOWLEDGEMENTS I would like to thank many people who were instrumental in helping me finish my Ph.D. My advisors John Hayes and Igor Markov provided me with excellent...
Accurate Reliability Evaluation and Enhancement via Probabilistic Transfer Matrices (2005)
Krishnaswamy, Smita, Viamontes, George F., Markov, Igor L., Hayes, John P.
Soft errors are an increasingly serious problem for logic circuits. To estimate the effects of soft errors on such circuits, we develop a general computational framework based on probabilistic...
Accurate Reliability Evaluation and Enhancement via Probabilistic Transfer Matrices (2005)
Krishnaswamy, Smita, Viamontes, George F., Markov, Igor L., Hayes, John P.
Soft errors are an increasingly serious problem for logic circuits. To estimate the effects of soft errors on such circuits, we develop a general computational framework based on probabilistic...
Accurate Reliability Evaluation and Enhancement via Probabilistic Transfer Matrices (2005)
Smita Krishnaswamy, George F. Viamontes, Igor L. Markov, John P. Hayes
Soft errors are an increasingly serious problem for logic circuits. To estimate the effects of soft errors on such circuits, we develop a general computational framework based on probabilistic...
Accurate Reliability Evaluation and Enhancement via Probabilistic Transfer Matrices (2005)
Smita Krishnaswamy, George F. Viamontes, Igor L. Markov, John P. Hayes
Soft errors are an increasingly serious problem for logic circuits. To estimate the effects of soft errors on such circuits, we develop a general computational framework based on probabilistic...
Graph-Based Simulation of Quantum Computation in the Density Matrix Representation (2005)
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 methods appear in the...
Is Quantum Search Practical? (2004)
Viamontes, George F., Markov, Igor L., Hayes, John P.
Quantum algorithms and circuits can, in principle, outperform the best non-quantum (classical) techniques for some hard computational problems. However, this does not necessarily lead to useful...
Graph-based simulation of quantum computation in the density matrix representation (2004)
Viamontes, George F., Markov, Igor L., Hayes, John P.
Quantum-mechanical phenomena are playing an increasing role in information processing, as transistor sizes approach the nanometer level, and quantum circuits and data encoding methods appear in the...
High-Performance QuIDD-based Simulation of Quantum Circuits (2004)
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 vectors modeling qubit states grow exponentially with the number of qubits....
Improving Gate-Level Simulation of Quantum Circuits (2003)
Viamontes, George F., Markov, Igor L., Hayes, John P.
Simulating quantum computation on a classical computer is a difficult problem. The matrices representing quantum gates, and the vectors modeling qubit states grow exponentially with an increase in...
Improving Gate-Level Simulation of Quantum Circuits (2003)
Viamontes, George F., Markov, Igor L., Hayes, John P.
Simulating quantum computation on a classical computer is a difficult problem. The matrices representing quantum gates, and the vectors modeling qubit states grow exponentially with an increase in...
Gate-level simulation of quantum circuits (2003)
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 with an increase in...
Gate-level simulation of quantum circuits (2003)
George F. Viamontes, Manoj Rajagopalan, Igor L. Markov, John P. Hayes
Abstract — Simulating quantum computation on a classical computer is a difficult problem. The matrices representing quantum gates, and vectors modeling qubit states grow exponentially with an...
Gate-Level Simulation of Quantum Circuits (2003)
George F. Viamontes, Manoj Rajagopalan, Igor L. Markov, John P. Hayes
Introduction Richard Feynman observed in the early 1980s that simulating quantum processes on classical hardware seems to require super-polynomial (in the number of qubits) memory and time....
Gate-Level Simulation of Quantum Circuits (2002)
Viamontes, George F., Rajagopalan, Manoj, Markov, Igor L., Hayes, John P.
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 as critical as...