Quantum verification of matrix products
From MaRDI portal
Publication:3581597
DOI10.1145/1109557.1109654zbMath1192.81056arXivquant-ph/0409035OpenAlexW2951698954MaRDI QIDQ3581597
Publication date: 16 August 2010
Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0409035
Related Items
Efficient quantum circuits for Szegedy quantum walks ⋮ A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs ⋮ Quantum algorithms for matching problems ⋮ Improving quantum query complexity of Boolean matrix multiplication using graph collision ⋮ Efficiently correcting matrix products ⋮ A note on the search for \(k\) elements via quantum walk ⋮ Efficiently Correcting Matrix Products ⋮ Quantum Complexity of Boolean Matrix Multiplication and Related Problems ⋮ Szegedy quantum walks with memory on regular graphs ⋮ Quantum Walk Based Search Algorithms ⋮ Improvement of quantum walks search algorithm in single-marked vertex graph ⋮ Search on vertex-transitive graphs by lackadaisical quantum walk ⋮ On the relationship between continuous- and discrete-time quantum walk ⋮ Quantum algorithm for lexicographically minimal string rotation ⋮ Three-state quantum walk on the Cayley graph of the dihedral group ⋮ On the hitting times of quantum versus random walks ⋮ Probability distributions for Markov chain based quantum walks ⋮ Unnamed Item ⋮ Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems ⋮ Quantum search with variable times ⋮ The quantum walk search algorithm: factors affecting efficiency ⋮ Quantum algorithm design: techniques and applications ⋮ Quantum walks: a comprehensive review ⋮ The quantum query complexity of the determinant ⋮ Quantum walks with memory on cycles ⋮ Quantum Random Walks – New Method for Designing Quantum Algorithms ⋮ Quantum Walks with Multiple or Moving Marked Locations ⋮ Quantum Walks on Two-Dimensional Grids with Multiple Marked Locations ⋮ Unnamed Item ⋮ Quantum walks can find a marked element on any graph
