Pages that link to "Item:Q3581597"

The following pages link to Quantum verification of matrix products (Q3581597):

Displaying 32 items.

• Quantum walks can find a marked element on any graph (Q262276) (← links)
• Improving quantum query complexity of Boolean matrix multiplication using graph collision (Q334915) (← 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)
• Quantum algorithms for matching problems (Q839634) (← links)
• The quantum query complexity of the determinant (Q976107) (← 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 walks with memory on cycles (Q1782644) (← links)
• Quantum search with variable times (Q1959400) (← links)
• Efficient quantum circuits for Szegedy quantum walks (Q2362658) (← links)
• Efficiently correcting matrix products (Q2408920) (← links)
• On the hitting times of quantum versus random walks (Q2429358) (← links)
• Szegedy quantum walks with memory on regular graphs (Q2677576) (← links)
• Search on vertex-transitive graphs by lackadaisical quantum walk (Q2681709) (← links)
• Three-state quantum walk on the Cayley graph of the dihedral group (Q2687204) (← links)
• Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems (Q2701384) (← links)
• Efficiently Correcting Matrix Products (Q2942613) (← links)
• Quantum Complexity of Boolean Matrix Multiplication and Related Problems (Q2944887) (← links)
• Quantum Walk Based Search Algorithms (Q3502631) (← links)
• Probability distributions for Markov chain based quantum walks (Q4603660) (← links)
• The quantum walk search algorithm: factors affecting efficiency (Q4623131) (← links)
• (Q5009621) (← links)
• Quantum Random Walks – New Method for Designing Quantum Algorithms (Q5448636) (← links)
• Quantum Walks with Multiple or Moving Marked Locations (Q5448675) (← links)
• (Q5743491) (← links)
• Quantum Walks on Two-Dimensional Grids with Multiple Marked Locations (Q5895059) (← links)
• Improvement of quantum walks search algorithm in single-marked vertex graph (Q6096899) (← links)
• Quantum algorithm for lexicographically minimal string rotation (Q6151147) (← links)
• Theoretical computer science: computational complexity (Q6602263) (← links)
• Recovering the original simplicity: succinct and exact quantum algorithm for the welded tree problem (Q6647776) (← links)