Pages that link to "Item:Q6168468"
From MaRDI portal
The following pages link to Quantum Speedups for Dynamic Programming on n-Dimensional Lattice Graphs (Q6168468):
Displaying 7 items.
- Quantum lattice enumeration and tweaking discrete pruning (Q1633464) (← links)
- Fast quantum subroutines for the simplex method (Q2061891) (← links)
- Quantum algorithms for variants of average-case lattice problems via filtering (Q2170094) (← links)
- A dynamic programming approach for distributing quantum circuits by bipartite graphs (Q2684320) (← links)
- Estimating quantum speedups for lattice sieves (Q2692396) (← links)
- Quantum time complexity and algorithms for pattern matching on labeled graphs (Q6111593) (← links)
- Classification and transformations of quantum circuit decompositions for permutation operations (Q6629254) (← links)