Locality, communication, and interconnect length in multicomputers
SIAM Journal on Computing
Experimental quantum cryptography
Journal of Cryptology - Eurocrypt '90
A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
SIAM Journal on Computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Quantum vs. classical communication and computation
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Quantum lower bounds by quantum arguments
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Quantum computation and quantum information
Quantum computation and quantum information
Quantum Lower Bounds by Polynomials
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
A Better Lower Bound for Quantum Algorithms Searching an Ordered List
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Area penalty for sublinear signal propagation delay on chip
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Irreversibility and heat generation in the computing process
IBM Journal of Research and Development
Logical reversibility of computation
IBM Journal of Research and Development
IEEE Transactions on Information Theory
Quantum Kolmogorov complexity based on classical descriptions
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
The laws ofp hysics imposes limits on increases in computing power. Two ofthe se limits are interconnect wires in multicomputers and thermodynamic limits to energy dissipation in conventional irreversible technology. Quantum computing is a new computational technology that promises to eliminate problems ofl atency and wiring associated with parallel computers and the rapidly approaching ultimate limits to computing power imposed by the fundamental thermodynamics. Moreover, a quantum computer will be able to exponentially improve known classical algorithms for factoring, and quadratically improve every classical algorithm for searching an unstructured list, as well as give various speedups in communication complexity, by exploiting unique quantum mechanical features. Finally, a quantum computer may be able to simulate quantum mechanical systems, something which seems out ofthe question for classical computers, thus reaching the ultimate goal ofrep lacing actual quantum mechanical experiments with simulated ones. On the downside, for some problems quantum mechanical computers cannot significantly improve the performance of classical computers.