%ToC#392.bib; v004a008; Farhi, Goldstone, Gutmann
% last modified: acr 12-22-08
%
% #1
@inproceedings{1334209,
 author = {Andris Ambainis and Andrew M. Childs and Ben W. Reichardt and Robert {\v{S}}palek and Shengyu Zhang},
 title = {Any \uppercase{AND-OR} Formula of Size \uppercase{N} can be Evaluated in time $N^{1/2 + o(1)}$ on a Quantum Computer},
 booktitle = {Proc. 48th FOCS},
 year = {2007},
 pages = {363--372},
 doi = {10.1109/FOCS.2007.57},
 publisher = {IEEE Computer Society},
  }

% #2
@article{1032081,
 author = {Howard Barnum and Michael Saks},
 title = {\uppercase{A} lower bound on the quantum query complexity of read-once functions},
 journal = {J. Comput. System Sci.},
 volume = {69},
 number = {2},
 year = {2004},
 issn = {0022-0000},
 pages = {244--258},
 doi = {10.1016/j.jcss.2004.02.002},
 }

% #3
@article{264407,
 author = {Charles H. Bennett and Ethan Bernstein and Gilles Brassard and Umesh Vazirani},
 title = {Strengths and Weaknesses of Quantum Computing},
 journal = {SIAM J. Comput.},
 volume = {26},
 number = {5},
 year = {1997},
 issn = {0097-5397},
 pages = {1510--1523},
 doi = {10.1137/S0097539796300933},
 publisher = {SIAM},
 address = {Philadelphia, PA, USA},
 }

% # 4
@MISC{childs-2007,
  author = {Andrew M. Childs and Richard Cleve and Stephen P. Jordan and David Yeung},
  title = {Discrete-query quantum algorithm for \uppercase{NAND} trees},
  url = {http://www.citebase.org/abstract?id=oai:arXiv.org:quant-ph/0702160},
  year = {2007},
  eprint    = "quant-ph/0702160",
}

% #5
@MISC{cleve-2007,
  author = {Richard Cleve and Dmitry Gavinsky and David L. Yeung},
  title = {Quantum Algorithms for Evaluating \uppercase{MIN-MAX} Trees},
  url = {http://www.citebase.org/abstract?id=oai:arXiv.org:0710.5794},
  year = {2007},
  eprint    = "arXiv:0710.5794",
}

   % # 7
@Article{Farhi:1996na,
     author    = {Farhi, Edward and Gutmann, Sam},
     title     = "An Analog Analogue of a Digital Quantum Computation",
      journal = {Phys. Rev. A},
      volume = {57},
      pages = {2403},
     year      = "1998",
     doi    = "10.1103/PhysRevA.57.2403 ",
}
   % #8
@Article{Farhi:1997jm,
     author    = {Farhi, Edward and Gutmann, Sam},
     title     = {Quantum Computation and Decision Trees},
      journal = {Phys. Rev. A},
       year      = {1998},
      pages = {915} ,
      volume = {58} ,
     doi  = "10.1103/PhysRevA.58.915 ",
}
% #9
@ARTICLE{mochon-2007-75,
  author = {Carlos Mochon},
  title = {Hamiltonian Oracles},
  journal = {Phys. Rev. A},
  volume = {75},
  pages = {042313},
  doi = {10.1103/PhysRevA.75.042313},
  year = {2007}
}
% #10
@inbook{Newton1982,
author = {Roger G. Newton},
title = {Scattering Theory of Waves and Particles},
chapter = {6 and 7},
edition = {second},
publisher = {Springer-Verlag},
address = {New York},
year = {1982}
}
% #11
@inproceedings{reichardt-2007,
  author = {Ben W. Reichardt and Robert {\v{S}}palek},
  title = {Span-program-based quantum algorithm for evaluating formulas},
  booktitle = {Proc. 40th STOC},
  year = {2008},
  publisher = {ACM},
  pages = {103--112},
  doi = {10.1145/1374376.1374394},
}
% # 12
@inproceedings{SW86,
author={Michael Saks and Avi Wigderson},
title={Probabilistic boolean trees and the
complexity of evaluating game trees},
booktitle={Proc. 27th FOCS},
 publisher = {IEEE Computer Society},
pages={29--38},
year={1986}
}
% #13
@article{miklos:1995a,
author = {Miklos Santha},
title = {On the {Monte Carlo} {Boolean} decision tree complexity of read-once formulae},
journal ={Random Structures Algorithms},
volume = {6},
number = {1},
pages = {75--87},
year = {1995},
doi = {10.1002/rsa.3240060108},
}
% # 14
@ARTICLE{snir:dec,
    author = {Marc Snir},
    title = {Lower bounds on probabilistic decision trees},
    journal = {Theoret. Comput. Sci.},
    volume = 38,
    pages = {69--82},
    year = {1985},
    doi={10.1016/0304-3975(85)90210-5}
   }