Pages that link to "Item:Q3002804"
From MaRDI portal
The following pages link to Discrete-query quantum algorithm for NAND trees (Q3002804):
Displaying 8 items.
- Challenges of adiabatic quantum evaluation of NAND trees (Q264902) (← links)
- A strong direct product theorem for quantum query complexity (Q354645) (← links)
- Green's function approach for quantum graphs: an overview (Q521776) (← links)
- Quantum algorithm design: techniques and applications (Q1730317) (← links)
- Asymptotic behavior of quantum walks with spatio-temporal coin fluctuations (Q1757889) (← links)
- Intricacies of quantum computational paths (Q1952642) (← links)
- Disordered quantum walks in one lattice dimension (Q2851741) (← links)
- EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS (Q2971052) (← links)
