Dynamical analysis of Grover’s search algorithm in arbitrarily high-dimensional search spaces

Jin, Wenliang

doi:10.1007/s11128-015-1164-0

Cited by 9 publications

(1 citation statement)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This relationship between the structure of the information associated with the problem and the structure of the unitary operators employed in the quantum algorithm is what enables us to solve the restricted problem more efficiently in this computational model. It may prove fruitful to explore the relationship between the error cancellation observed here and how the perturbations related to Grover's problem mutually cancel in arbitrarily high-dimensional search spaces [24].…”

Section: Discussionmentioning

confidence: 96%

Quantum computation with coherent spin states and the close Hadamard problem

Adcock

Hoyer

Sanders

2016

Quantum Inf Process

View full text Add to dashboard Cite

We study a model of quantum computation based on the continuously-parameterized yet finitedimensional Hilbert space of a spin system. We explore the computational powers of this model by analyzing a pilot problem we refer to as the close Hadamard problem. We prove that the close Hadamard problem can be solved in the spin system model with arbitrarily small error probability in a constant number of oracle queries. We conclude that this model of quantum computation is suitable for solving certain types of problems. The model is effective for problems where symmetries between the structure of the information associated with the problem and the structure of the unitary operators employed in the quantum algorithm can be exploited.

show abstract

Section: Discussionmentioning

confidence: 96%