Adversary lower bounds in the Hamiltonian oracle model

Strengths and Weaknesses of Quantum Computing

Charles H. Bennett, Ethan Bernstein, Gilles Brassard, and Umesh Vazirani · 1997

Earlier work this paper cites.

Analog analogue of a digital quantum computation

Edward Farhi and Sam Gutmann · 1998

Earlier work this paper cites.

Quantum Decision Trees and Semidefinite Programming

Howard Barnum, Michael Saks, and Mario Szegedy · 2003

Earlier work this paper cites.

Lower bounds for randomized and quantum query complexity using kolmogorov arguments

Sophie Laplante and Frederic Magniez · 2003

Earlier work this paper cites.

Lower bounds on quantum query complexity

Peter Høyer and Robert Špalek · 2005

Cited alongside, same era.

On the power of ambainis lower bounds

Original

Shengyu Zhang · 2005

Cited alongside, same era.

Polynomial degree vs. quantum query complexity

Andris Ambainis · 2006

Cited alongside, same era.

All quantum adversary methods are equivalent

Robert Špalek and Mario Szegedy · 2006

Cited alongside, same era.

A Quantum Algorithm for the Hamiltonian NAND Tree

Edward Farhi, Jeffrey Goldstone, and Sam Gutmann · 2007

Later among the works it cites.

Negative weights make adversaries stronger

Peter Hoyer, Troy Lee, and Robert Špalek · 2007

Later among the works it cites.

Hamiltonian oracles

Carlos Mochon · 2007

Later among the works it cites.