Quantum computing – Facts and folklore

Authors:
Mika Hirvensalo
Affiliations:
TUCS – Turku Centre for Computer Science and, Department of Mathematics, University of Turku, FIN-20014 Turku, Finland (E-mail: mikhirve@utu.fi)
Venue:
Natural Computing: an international journal
Year:
2002

Citing 4
Cited 1

A fast quantum mechanical algorithm for database search

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Strengths and Weaknesses of Quantum Computing

SIAM Journal on Computing
Quantum computing

Quantum computing
Quantum Lower Bounds by Polynomials

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science

Gaussian quantum-behaved particle swarm optimization approaches for constrained engineering design problems

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We represent and analyze two important quantumalgorithms – Finding the hidden subgroup and Grover search. As theanalysis goes on, we mention some pieces of ``Fact'' and ``Folklore''associated to quantum computing.