Deterministic polynomial-time quantum algorithms for Simon's problem

DOI10.1007/s00037-003-0181-zzbMath1085.68045OpenAlexW2013387886MaRDI QIDQ1762666

Shao Chin Sung, Takashi Mihara

Publication date: 11 February 2005

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00037-003-0181-z

zbMATH Keywords

Quantum computerSimon's problemdeterministic quantum algorithmextended Simon's problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Quantum computation (81P68) Complexity of computation (including implicit computational complexity) (03D15)

Related Items (5)

Optimal separation in exact query complexities for Simon's problem ⋮ Quantum and classical query complexities for generalized Simon's problem ⋮ Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms ⋮ Revisiting Deutsch-Jozsa algorithm ⋮ Query complexity of generalized Simon's problem

This page was built for publication: Deterministic polynomial-time quantum algorithms for Simon's problem