Quantum public key distribution reinvented
ACM SIGACT News
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On the Power of Quantum Computation
SIAM Journal on Computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Strengths and Weaknesses of Quantum Computing
SIAM Journal on Computing
Explorations in quantum computing
Explorations in quantum computing
A framework for fast quantum mechanical algorithms
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Complexity theory retrospective II
Feynman Lectures on Computation
Feynman Lectures on Computation
Relationships Between Quantum and Classical Space-Bounded Complexity Classes
COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity
Quantum computing and phase transitions in combinatorial search
Journal of Artificial Intelligence Research
Introduction to Recent Quantum Algorithms
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Modeling quantum computing in Haskell
Haskell '03 Proceedings of the 2003 ACM SIGPLAN workshop on Haskell
Toward a quantum process algebra
Proceedings of the 1st conference on Computing frontiers
Simulation and verification II: simulating quantum computing: quantum express
Proceedings of the 35th conference on Winter simulation: driving innovation
Communicating quantum processes
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Towards scalable flow and context sensitive pointer analysis
Proceedings of the 42nd annual Design Automation Conference
ACM SIGACT News
Types and typechecking for Communicating Quantum Processes
Mathematical Structures in Computer Science
Quantum programming languages: survey and bibliography
Mathematical Structures in Computer Science
A quantum no-key protocol for secure data communication
Proceedings of the 43rd annual Southeast regional conference - Volume 2
Five deep questions in computing
Communications of the ACM - 50th anniversary issue: 1958 - 2008
Evolving blackbox quantum algorithms using genetic programming
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Binary Neuro-Fuzzy Classifiers Trained by Nonlinear Quantum Circuits
WILF '07 Proceedings of the 7th international workshop on Fuzzy Logic and Applications: Applications of Fuzzy Sets Theory
A review of procedures to evolve quantum algorithms
Genetic Programming and Evolvable Machines
Quantum Testers for Hidden Group Properties
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Neurofuzzy networks with nonlinear quantum learning
IEEE Transactions on Fuzzy Systems
Toward a quantum-inspired linear genetic programming model
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
IEEE Computational Intelligence Magazine
Quantum versus evolutionary systems: total versus sampled search
ICES'03 Proceedings of the 5th international conference on Evolvable systems: from biology to hardware
Other complexity classes and measures
Algorithms and theory of computation handbook
On the computational security of quantum algorithms for transformation of information
Cybernetics and Systems Analysis
A novel re-ranking approach inspired by quantum measurement
ECIR'11 Proceedings of the 33rd European conference on Advances in information retrieval
Investigating query-drift problem from a novel perspective of photon polarization
ICTIR'11 Proceedings of the Third international conference on Advances in information retrieval theory
A new approach belonging to EDAs: quantum-inspired genetic algorithm with only one chromosome
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
Quantum Testers for Hidden Group Properties
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Quantum walks: a comprehensive review
Quantum Information Processing
Natural Computing: an international journal
Theoretical Computer Science
| Hi-index | 0.00 |
Richard Feynman's observation that certain quantum mechanical effects cannot be simulated efficiently on a computer led to speculation that computation in general could be done more efficiently if it used these quantum effects. This speculation proved justified when Peter Shor described a polynomial time quantum algorithm for factoring intergers.In quantum systems, the computational space increases exponentially with the size of the system, which enables exponential parallelism. This parallelism could lead to exponentially faster quantum algorithms than possible classically. The catch is that accessing the results, which requires measurement, proves tricky and requires new nontraditional programming techniques.The aim of this paper is to guide computer scientists through the barriers that separate quantum computing from conventional computing. We introduce basic principles of quantum mechanics to explain where the power of quantum computers comes from and why it is difficult to harness. We describe quantum cryptography, teleportation, and dense coding. Various approaches to exploiting the power of quantum parallelism are explained. We conclude with a discussion of quantum error correction.