Pages that link to "Item:Q2642314"
From MaRDI portal
The following pages link to Quantum complexity of testing group commutativity (Q2642314):
Displaying 17 items.
- Quantum walks can find a marked element on any graph (Q262276) (← links)
- On the relationship between continuous- and discrete-time quantum walk (Q625458) (← links)
- A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs (Q835643) (← links)
- A note on the search for \(k\) elements via quantum walk (Q1675772) (← links)
- Quantum algorithm design: techniques and applications (Q1730317) (← links)
- Quantum walks: a comprehensive review (Q1757875) (← links)
- Quantum search with variable times (Q1959400) (← links)
- Efficient quantum circuits for Szegedy quantum walks (Q2362658) (← links)
- On the hitting times of quantum versus random walks (Q2429358) (← links)
- Szegedy quantum walks with memory on regular graphs (Q2677576) (← links)
- Models in quantum computing: a systematic review (Q2687125) (← links)
- Quantum algorithms for algebraic problems (Q3077033) (← links)
- Quantum Walk Based Search Algorithms (Q3502631) (← links)
- Testing commutativity of a group and the power of randomization (Q5169624) (← links)
- Quantum Algorithms for a Set of Group Theoretic Problems (Q5261611) (← links)
- Quantum Random Walks – New Method for Designing Quantum Algorithms (Q5448636) (← links)
- Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond (Q6172035) (← links)
