Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Computational Complexity

Deterministic polynomial-time quantum algorithms for Simon?s problem

Takashi Mihara, Shao Chin Sung

Published Dec 1, 2003• 14 citations
Publisher
DOI
10.1007/s00037-003-0181-z

Related papers

A Quantum Polynomial Time Algorithm in Worst Case for Simon’s Problem

Takashi Mihara, Shao Chin Sung

Lecture notes in computer science•Jan 1, 1998•4 citations

An exact quantum polynomial-time algorithm for Simon's problem

Gilles Brassard, Peter Høyer

We investigate the power of quantum computers when they are required to return an answer that is guaranteed to be correct after a time that is upper-bounded by a polynomial in the worst case. We show that a natural generalization of Simon's problem can be solved in this way, whereas previous algorithms required quantum polynomial time in the expected sense only, without upper bounds on the worst-case running time. This is achieved by generalizing both Simon's and Grover's algorithms and combining them in a novel way. It follows that there is a decision problem that can be solved in exact quantum polynomial time, which would require expected exponential time on any classical bounded-error probabilistic computer if the data is supplied as a black box.

arXiv:quant-ph/9704027•Israel Symposium on Theory and Computing Systems (ISTCS)•Nov 22, 2002•294 citations

Deterministic Approximate Counting for Degree-2 Polynomial Threshold Functions

Servedio, Rocco

We give a deterministic algorithm for approximately computing the fraction of Boolean assignments that satisfy a degree-2 polynomial threshold function. Given a degree-2 input polynomial p(x1, . . . , xn) and a parameter > 0, the algorithm approximates Prx∼{−1,1}n [p(x) ≥ 0] to within an additive ± in time poly(n, 2 ). Note that it is NP-hard to determine whether the above probability is nonzero, so any sort of multiplicative approximation is almost certainly impossible even for efficient randomized algorithms. This is the first deterministic algorithm for this counting problem in which the running time is polynomial in n for = o(1). For “regular” polynomials p (those in which no individual variable’s influence is large compared to the sum of all n variable influences) our algorithm runs in poly(n, 1/ ) time. The algorithm also runs in poly(n, 1/ ) time to approximate Prx∼N(0,1)n [p(x) ≥ 0] to within an additive ± , for any degree-2 polynomial p. As an application of our counting result, we give a deterministic FPT multiplicative (1± )-approximation algorithm to approximate the k-th absolute moment Ex∼{−1,1}n [|p(x)|] of a degree-2 polynomial. The algorithm’s running time is of the form poly(n) · f(k, 1/ ). ∗anindya@math.ias.edu. Research supported by Templeton Foundation Grant 21674 and NSF CCF-1149843. †ilias.d@ed.ac.uk. Some of this work was done while the author was at UC Berkeley supported by a Simons Fellowship. ‡rocco@cs.columbia.edu. Supported by NSF grants CNS-0716245, CCF-0915929, and CCF-1115703. ISSN 1433-8092 Electronic Colloquium on Computational Complexity, Report No. 172 (2013)

•Jan 1, 2014•1 citation

Polynomial time quantum computation with advice

Harumichi Nishimura, Tomoyuki Yamakami

arXiv:quant-ph/0305100•Information Processing Letters•Mar 20, 2004•54 citations

Polynomial Time Quantum Algorithm for Search Problem and Its Application

Satoshi Iriyama, Masanori Ohya

Lecture notes in computer science•Jan 1, 2014•0 citations

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

Chien-Yuan Chen, Chih-Cheng Hsueh

Simon's algorithm can determine whether the function f is bijective or periodic by using the polynomial-function evaluations. Simon's algorithm is more efficient than classical algorithms which require exponential function evaluations. In this paper, we assume that the range of the periodic function is a known subgroup. We further find an integer b orthogonal to the range. According to b, we can construct a quantum algorithm to determine whether f is bijective or periodic in only one function evaluation.

Computational intelligence•Jul 2, 2007•0 citations
We investigate the power of quantum computers when they are required to return an answer that is guaranteed to be correct after a time that is upper-bounded by a polynomial in the worst case. We show that a natural generalization of Simon's problem can be solved in this way, whereas previous algorithms required quantum polynomial time in the expected sense only, without upper bounds on the worst-case running time. This is achieved by generalizing both Simon's and Grover's algorithms and combining them in a novel way. It follows that there is a decision problem that can be solved in exact quantum polynomial time, which would require expected exponential time on any classical bounded-error probabilistic computer if the data is supplied as a black box.
We give a deterministic algorithm for approximately computing the fraction of Boolean assignments that satisfy a degree-2 polynomial threshold function. Given a degree-2 input polynomial p(x1, . . . , xn) and a parameter > 0, the algorithm approximates Prx∼{−1,1}n [p(x) ≥ 0] to within an additive ± in time poly(n, 2 ). Note that it is NP-hard to determine whether the above probability is nonzero, so any sort of multiplicative approximation is almost certainly impossible even for efficient randomized algorithms. This is the first deterministic algorithm for this counting problem in which the running time is polynomial in n for = o(1). For “regular” polynomials p (those in which no individual variable’s influence is large compared to the sum of all n variable influences) our algorithm runs in poly(n, 1/ ) time. The algorithm also runs in poly(n, 1/ ) time to approximate Prx∼N(0,1)n [p(x) ≥ 0] to within an additive ± , for any degree-2 polynomial p. As an application of our counting result, we give a deterministic FPT multiplicative (1± )-approximation algorithm to approximate the k-th absolute moment Ex∼{−1,1}n [|p(x)|] of a degree-2 polynomial. The algorithm’s running time is of the form poly(n) · f(k, 1/ ). ∗anindya@math.ias.edu. Research supported by Templeton Foundation Grant 21674 and NSF CCF-1149843. †ilias.d@ed.ac.uk. Some of this work was done while the author was at UC Berkeley supported by a Simons Fellowship. ‡rocco@cs.columbia.edu. Supported by NSF grants CNS-0716245, CCF-0915929, and CCF-1115703. ISSN 1433-8092 Electronic Colloquium on Computational Complexity, Report No. 172 (2013)
Simon's algorithm can determine whether the function f is bijective or periodic by using the polynomial-function evaluations. Simon's algorithm is more efficient than classical algorithms which require exponential function evaluations. In this paper, we assume that the range of the periodic function is a known subgroup. We further find an integer b orthogonal to the range. According to b, we can construct a quantum algorithm to determine whether f is bijective or periodic in only one function evaluation.