Pages that link to "Item:Q1762666"
From MaRDI portal
The following pages link to Deterministic polynomial-time quantum algorithms for Simon's problem (Q1762666):
Displaying 8 items.
- Polynomial-time algorithm for simulation of weakly interacting quantum Spin systems (Q1006295) (← links)
- Optimal separation in exact query complexities for Simon's problem (Q1672002) (← links)
- Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms (Q1700378) (← links)
- Query complexity of generalized Simon's problem (Q2051810) (← links)
- Revisiting Deutsch-Jozsa algorithm (Q2216118) (← links)
- Quantum and classical query complexities for generalized Simon's problem (Q2672650) (← links)
- Quantum Circuits That Can Be Simulated Classically in Polynomial Time (Q3149866) (← links)
- (Q4249527) (← links)