scientific article; zbMATH DE number 1303028

MaRDI QIDQ4249527zbMATH OpenFDO

Authors Takashi Mihara, S-C. Sung

Publication date 17 June 1999

zbMATH Keywords

quantum algorithmquantum Turing machine

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Deterministic polynomial-time quantum algorithms for Simon's problem
• Automata, Languages and Programming
• Quantum Circuits That Can Be Simulated Classically in Polynomial Time
• Quantum and classical query complexities for generalized Simon's problem
• Quantum algorithms for Simon's problem over nonabelian groups
• Polynomial-time algorithm for simulation of weakly interacting quantum Spin systems
• Quantum algorithms for Simon's problem over general groups
• A quasipolynomial-time algorithm for the quantum separability problem
• Simulation and the exact complexity of Grover's search algorithm
• Quantum computers that can be simulated classically in polynomial time

Cited in

(4)

• Polynomial-time algorithm for simulation of weakly interacting quantum Spin systems
• Deterministic polynomial-time quantum algorithms for Simon's problem
• Almost-everywhere superiority for quantum polynomial time
• Quantum Circuits That Can Be Simulated Classically in Polynomial Time

This page was built for publication:

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