Fetching the paper…
Reading the bibliography…
Rejection sampling is a well-known method to sample from a target distribution, given the ability to sample from a given distribution.
Various techniques used in connection with random digits
J. von Neumann · 1951
Earlier work this paper cites.
Equation of state calculations by fast computing machines
N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller · 1953
Earlier work this paper cites.
On building random variables of a given distribution
G. Letac · 1975
Earlier work this paper cites.
Non-uniform random variate generation
L. Devroye · 1986
Earlier work this paper cites.
The Graph Isomorphism Problem: Its Structural Complexity
J. Köbler, U. Schöning, and J. Toran · 1993
Earlier work this paper cites.
Quantum measurements and the Abelian Stabilizer Problem
A. Kitaev · 1995
Earlier work this paper cites.
A fast quantum mechanical algorithm for database search
L. K. Grover · 1996
Earlier work this paper cites.
Semidefinite programming
L. Vandenberghe and S. Boyd · 1996
Earlier work this paper cites.
Strengths and weaknesses of quantum computing
C. H. Bennett, E. Bernstein, G. Brassard, and U. Vazirani · 1997
Earlier work this paper cites.
Tight bounds on quantum searching
M. Boyer, G. Brassard, P. Hø yer, and A. Tapp · 1998
Earlier work this paper cites.
Quantum Algorithms Revisited
R. Cleve, A. Ekert, C. Macchiavello, and M. Mosca · 1998
Earlier work this paper cites.
On the power of quantum computation
U. Vazirani · 1998
Earlier work this paper cites.
Quantum lower bounds by quantum arguments
A. Ambainis · 2000
Earlier work this paper cites.
Quantum amplitude amplification and estimation
G. Brassard, P. Høyer, M. Mosca, and A. Tapp · 2000
Earlier work this paper cites.
Synthesis of quantum superpositions by quantum computation
L. K. Grover · 2000
Earlier work this paper cites.
Succinct quantum proofs for properties of finite groups
J. Watrous · 2000
Earlier work this paper cites.
Quantum fingerprinting
H. Buhrman, R. Cleve, J. Watrous, and R. de Wolf · 2001
Earlier work this paper cites.
Quantum algorithms for solvable groups
J. Watrous · 2001
Earlier work this paper cites.
Complexity measures and decision tree complexity: A survey
H. Buhrman and R. de Wolf · 2002
Cited alongside, same era.
Hidden Translation and Orbit Coset in Quantum Computing
K. Friedl, G. Ivanyos, F. Magniez, M. Santha, and P. Sen · 2002
Cited alongside, same era.
Creating superpositions that correspond to efficiently integrable probability distributions
L. K. Grover and T. Rudolph · 2002
Cited alongside, same era.
Adiabatic quantum state generation and statistical zero knowledge
D. Aharonov and A. Ta-Shma · 2003
Cited alongside, same era.
Quantum algorithms for some hidden shift problems
W. Dam, S. Hallgren, and L. Ip · 2003
Cited alongside, same era.
Quantum search on bounded-error inputs
P. Høyer, M. Mosca, and R. de Wolf · 2003
Cited alongside, same era.
Quantum copy-protection and quantum money
S. Aaronson · 2009
Later among the works it cites.
Eigenpath traversal by phase randomization
S. Boixo, E. Knill, and R. D. Somma · 2009
Later among the works it cites.
Quantum algorithm for linear systems of equations
A. W. Harrow, A. Hassidim, and S. Lloyd · 2009
Later among the works it cites.
D. Nagaj, P. Wocjan, and Y. Zhang · 2009
Later among the works it cites.
B. W. Reichardt · 2009
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Quantum computation and lattice problems
O. Regev · 2004
Cited alongside, same era.
Lattice problems in NP ∩ \cap coNP
D. Aharonov and O. Regev · 2005
Cited alongside, same era.
Efficient quantum algorithms for simulating sparse Hamiltonians
D. W. Berry, G. Ahokas, R. Cleve, and B. C. Sanders · 2005
Cited alongside, same era.
Quantum Arthur–Merlin games
C. Marriott and J. Watrous · 2005
Cited alongside, same era.
The complexity of the local Hamiltonian problem
J. Kempe, A. Kitaev, and O. Regev · 2006
Cited alongside, same era.
Negative weights make adversaries stronger
P. Høyer, T. Lee, and R. Špalek · 2007
Cited alongside, same era.
Approximating fractional time quantum evolution
L. Sheridan, D. Maslov, and M. Mosca · 2009
Later among the works it cites.
A full characterization of quantum advice
S. Aaronson and A. Drucker · 2010
Later among the works it cites.
A. Ambainis · 2010
Later among the works it cites.
Quantum algorithms for highly non-linear Boolean functions
M. Rötteler · 2010
Later among the works it cites.
A quantum-quantum Metropolis algorithm
M.-H. Yung and A. Aspuru-Guzik · 2010
Later among the works it cites.
Symmetry-assisted adversaries for quantum state generation
A. Ambainis, L. Magnin, M. Roetteler, and J. Roland · 2011
Closest in time.
Simulating Sparse Hamiltonians with Star Decompositions
A. M. Childs and R. Kothari · 2011
Closest in time.
Quantum query complexity of state conversion
T. Lee, R. Mittal, B. W. Reichardt, R. Špalek, and M. Szegedy · 2011
Closest in time.
Reflections for quantum query algorithms
B. W. Reichardt · 2011
Closest in time.
Contracting tensor networks and preparing PEPS on a quantum computer
M. Schwarz, K. Temme, and F. Verstraete · 2011
Closest in time.
K. Temme, T. J. Osborne, K. G. Vollbrecht, D. Poulin, and F. Verstraete · 2011
Closest in time.
E. Farhi, D. Gosset, A. Hassidim, A. Lutomirski, and P. Shor · 2012
Closest in time.