Fetching the paper…
Reading the bibliography…
We consider two combinatorial problems.
The detection of defective members of large populations
R. Dorfman · 1943
Earlier work this paper cites.
Optimal multiple quantum statistical hypothesis testing
V. P. Belavkin · 1975
Earlier work this paper cites.
A “pretty good” measurement for distinguishing quantum states
P. Hausladen and W. Wootters · 1994
Earlier work this paper cites.
Group testing problems with sequences in experimental molecular biology
M. Farach, S. Kannan, E. Knill, and S. Muthukrishnan · 1997
Earlier work this paper cites.
Quantum oracle interrogation: Getting all information for almost half the price
W. van Dam · 1998
Earlier work this paper cites.
A limit on the speed of quantum computation in determining parity
E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser · 1998
Earlier work this paper cites.
How many functions can be distinguished with k quantum queries?, 1999
E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser · 1999
Earlier work this paper cites.
Survey of binary Krawtchouk polynomials
I. Krasikov and S. Litsyn · 1999
Earlier work this paper cites.
Combinatorial Group Testing and Its Applications
D. Du and F. Hwang · 2000
Earlier work this paper cites.
Quantum lower bounds by polynomials
R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf · 2001
Cited alongside, same era.
On quantum detection and the square-root measurement
Y. C. Eldar and G. D. Forney, Jr · 2001
Cited alongside, same era.
A lower bound for testing juntas
H. Chockler and D. Gutfreund · 2004
Cited alongside, same era.
Learning functions of k relevant variables
E. Mossel, R. O’Donnell, and R. Servedio · 2004
Cited alongside, same era.
What’s hot and what’s not: tracking most frequent items dynamically
G. Cormode and S. Muthukhrishan · 2005
Cited alongside, same era.
On the power of Ambainis lower bounds
S. Zhang · 2005
Cited alongside, same era.
Combinatorial algorithms for compressed sensing
Quantum algorithms for learning and testing juntas
A. Atici and R. A. Servedio · 2007
Later among the works it cites.
On the distinguishability of random quantum states
A. Montanaro · 2007
Later among the works it cites.
Explicit non-adaptive combinatorial group testing schemes
E. Porat and A. Rothschild · 2008
Later among the works it cites.
Testing juntas nearly optimally
E. Blais · 2009
Later among the works it cites.
Pattern matching with don’t cares and few errors
R. Clifford, K. Efremenko, E. Porat, and A. Rothschild · 2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
G. Cormode and S. Muthukhrishan · 2006
Cited alongside, same era.
All quantum adversary methods are equivalent
R. Špalek and M. Szegedy · 2006
Cited alongside, same era.
K. Iwama, H. Nishimura, R. Raymond, and J. Teruyama · 2010
Later among the works it cites.
Reconstructing strings from substrings with quantum queries, 2012
R. Cleve, K. Iwama, F. Le Gall, H. Nishimura, S. Tani, J. Teruyama, and S. Yamashita · 2012
Closest in time.
Query-Efficient Computation in Property Testing and Learning Theory
D. García Soriano · 2012
Closest in time.