Deterministic polynomial-time quantum algorithms for Simon's problem
From MaRDI portal
Recommendations
- A quantum polynomial time algorithm in worst case for Simon's problem
- 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)- Polynomial-time algorithm for simulation of weakly interacting quantum Spin systems
- Optimal separation in exact query complexities for Simon's problem
- Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms
- Query complexity of generalized Simon's problem
- Revisiting Deutsch-Jozsa algorithm
- Quantum and classical query complexities for generalized Simon's problem
- Quantum Circuits That Can Be Simulated Classically in Polynomial Time
- A quantum polynomial time algorithm in worst case for Simon's problem
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)