Deterministic polynomial-time quantum algorithms for Simon's problem

DOI10.1007/S00037-003-0181-ZMaRDI QIDQ1762666zbMATH OpenOpenAlexFDO

Authors Takashi Mihara, S-C. Sung

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)

Recommendations

• scientific article; zbMATH DE number 1303028
• Quantum Circuits That Can Be Simulated Classically in Polynomial Time
• Quantum algorithms for Simon's problem over nonabelian groups
• Quantum algorithms for Simon's problem over general groups
• Automata, Languages and Programming
• Quantum and classical query complexities for generalized Simon's problem
• Polynomial-time algorithm for simulation of weakly interacting quantum Spin systems
• Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms
• A quasipolynomial-time algorithm for the quantum separability problem
• Quantum computers that can be simulated classically in polynomial time

Cited in

(8)

• Revisiting Deutsch-Jozsa algorithm
• scientific article; zbMATH DE number 1303028 (Why is no real title available?)
• Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms
• Quantum and classical query complexities for generalized Simon's problem
• Optimal separation in exact query complexities for Simon's problem
• Query complexity of generalized Simon's problem
• Polynomial-time algorithm for simulation of weakly interacting quantum Spin systems
• Quantum Circuits That Can Be Simulated Classically in Polynomial Time

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1762666)