Deterministic polynomial-time quantum algorithms for Simon's problem

Authors:
Takashi Mihara;Shao Chin Sung
Affiliations:
Department of Management Science, Kyushu Tokai University, 9-1-1, Toroku, Kumamoto, 862-8652, Japan;School of Information Science, Japan Advanced Institute of Science and Technology, 1-1 Asahidai Tatsunokuchi Nomi, Ishikawa, 923-1292, Japan
Venue:
Computational Complexity
Year:
2004

Citing 6
Cited 1

A fast quantum mechanical algorithm for database search

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Quantum Complexity Theory

SIAM Journal on 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
Introduction to Coding Theory

Introduction to Coding Theory
An Exact Quantum Polynomial-Time Algorithm for Simon's Problem

ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)

Constant-time solution to Simon's decision problem with the known subgroup range in quantum computer

CI '07 Proceedings of the Third IASTED International Conference on Computational Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

D. R. Simon stated a problem, so-called Simon's problem, whose computational complexity is in the class BQPφ but not in BPPφ, where φ is the function or oracle given in the problem. This result indicates that BPP may be strictly included in its quantum counterpart, BQP. Later, G. Brassard and P. Høyer showed that Simon's problem and its extended version can be solved by a deterministic polynomial time quantum algorithm. That is, these problems are in the class EQPφ. In this paper, we show that Simon's problem and its extended version can be deterministically solved in a simpler and more concrete way than that proposed by G. Brassard and P. Høyer.