Proceedings of the forty-first annual ACM symposium on Theory of computing

64 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Optimal Hamiltonian Simulation by Quantum Signal Processing. (2016, unknown): “Though this suggests a naive additive lower bound Ω1⁄2τ þ log ð1=εÞ= log log ð1=εÞ [18], the best algorithms to date approach these factors multiplicatively with either linear scaling in time Oðτ= ffiffi ε p Þ [14] or sublogarithmic scaling in error O1⁄2τ log ðτ=εÞ= log log ðτ=εÞ [17,21].”
Exponentially more precise quantum simulation of fermions in second quantization (2015, methodology): “ous amplitude amplification to make the algorithm from [30, 31] deterministic, whereas prior versions had relied on probabilistic measurement of ancilla qubits.”