Efficient discrete-time simulations of continuous-time quantum query algorithms.
Richard CleveDaniel GottesmanMichele MoscaRolando D. SommaDavid L. Yonge-MalloPublished in: STOC (2009)
Keyphrases
- data structure
- computationally expensive
- optimization problems
- database
- markov processes
- computational cost
- computationally intensive
- theoretical analysis
- indexing structure
- response time
- query expansion
- computationally efficient
- skewed data
- database queries
- markov chain
- worst case
- computational complexity
- information retrieval