4 papers
Quantum Approximate Counting with Additive Error: Hardness and Optimality
Mason L. Rhodes, Sam Slezak, Anirban Chowdhury +1
Quantum counting is the task of determining the dimension of the subspace of states that are accepted by a quantum verifier circuit. It is the quantum analog of counting the number…
Search on Vertex-Transitive Graphs by Lackadaisical Quantum Walk
Mason L. Rhodes, Thomas G. Wong
The lackadaisical quantum walk is a discrete-time, coined quantum walk on a graph with a weighted self-loop at each vertex. It uses a generalized Grover coin and the flip-flop shif…
Search by Lackadaisical Quantum Walk with Nonhomogeneous Weights
Mason L. Rhodes, Thomas G. Wong
The lackadaisical quantum walk, which is a quantum walk with a weighted self-loop at each vertex, has been shown to speed up dispersion on the line and improve spatial search on th…
Quantum Walk Search on the Complete Bipartite Graph
Mason L. Rhodes, Thomas G. Wong
The coined quantum walk is a discretization of the Dirac equation of relativistic quantum mechanics, and it is the basis of many quantum algorithms. We investigate how it searches…