Efficient discrete-time simulations of continuous-time quantum query algorithms
From MaRDI portal
Publication:5172735
DOI10.1145/1536414.1536471zbMath1304.68051arXiv0811.4428OpenAlexW2084565809MaRDI QIDQ5172735
Michele Mosca, Rolando Somma, David Yonge-Mallo, Richard Cleve
Publication date: 4 February 2015
Published in: Proceedings of the forty-first annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0811.4428
Related Items (8)
On the relationship between continuous- and discrete-time quantum walk ⋮ EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS ⋮ Nonlinear quantum search using the Gross–Pitaevskii equation ⋮ Floating point representations in quantum circuit synthesis ⋮ Nonadiabatic quantum search algorithm with analytical success rate ⋮ Ancilla-approximable quantum state transformations ⋮ Exponentially more precise quantum simulation of fermions in second quantization ⋮ How quantum is the speedup in adiabatic unstructured search?
This page was built for publication: Efficient discrete-time simulations of continuous-time quantum query algorithms