Quantum search of spatial regions
From MaRDI portal
Recommendations
Cited in
(49)- Quantum algorithm design: techniques and applications
- Faster search by lackadaisical quantum walk
- Quantum walks: a comprehensive review
- Spatial search using the discrete time quantum walk
- Quantum search with variable times
- Upper bounds on communication in terms of approximate rank
- On the hitting times of quantum versus random walks
- Quantum search in structured database using local adiabatic evolution and spectral methods
- Quantum walks can find a marked element on any graph
- Overview: recent development and applications of reduction and lackadaisicalness techniques for spatial search quantum walk in the near term
- Quantum search of matching on signed graphs
- Entanglement entropy distinguishes PT-symmetry and topological phases in a class of non-unitary quantum walks
- Generalizations of the distributed Deutsch-Jozsa promise problem
- On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity
- Quantum algorithms for algebraic problems
- Approximate locality for quantum systems on graphs
- Robust quantum spatial search
- Multi-query quantum sums
- Quantum Walk Based Search Algorithms
- Quantum search algorithms on the hypercube
- Quantum weakly nondeterministic communication complexity
- Quantum search in a possible three-dimensional complex subspace
- Near-optimal bounds on the bounded-round quantum communication complexity of disjointness
- Quantum-walk speedup of backtracking algorithms
- Multiparty quantum communication complexity of triangle finding
- scientific article; zbMATH DE number 2103521 (Why is no real title available?)
- Time-Space Complexity Advantages for Quantum Computing
- Classical algorithms from quantum and Arthur-Merlin communication protocols
- Quantum advantage for the LOCAL model in distributed computing
- scientific article; zbMATH DE number 7561760 (Why is no real title available?)
- Lackadaisical quantum walk for spatial search
- The complexity of quantum disjointness
- Quantum search on Hanoi network
- scientific article; zbMATH DE number 7650118 (Why is no real title available?)
- Odd-periodic Grover walks
- Bounds on oblivious multiparty quantum communication complexity
- Quantum walk search on a two-dimensional grid with extra edges
- Unbounded-error quantum query complexity
- Quantum thermal search: computing ground states via quantum mixing thermal operations
- Quantum walk search for exceptional configurations
- Upper bounds on communication in terms of approximate rank
- Parrondo's game on exceptional configurations of quantum walk search
- On the communication complexity of finding a king in a tournament
- Multi-target quantum walk search on Johnson graph
- A mathematical framework for maze solving using quantum walks
- Quantum procedures for nested search problems -- with applications in cryptanalysis
- Exponential separation of quantum and classical online space complexity
- Improvements to quantum search techniques for block-ciphers, with applications to AES
- Improved algorithms for quantum identification of Boolean oracles
This page was built for publication: Quantum search of spatial regions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3002757)
