Fetching the paper…
Reading the bibliography…
Perturbative gadgets are general techniques for reducing many-body spin interactions to two-body ones using perturbation theory.
Derivation of the brueckner many-body theory
J. Goldstone · 1957
Earlier work this paper cites.
Sur la théorie des perturbations des états liés
Claude Bloch · 1958
Earlier work this paper cites.
Relation between the Anderson and Kondo Hamiltonians
J. R. Schrieffer and P. A. Wolff · 1966
Earlier work this paper cites.
Quantum Theory of Many-Particle Systems
Alexander L. Fetter and John Dirk Walecka · 1971
Earlier work this paper cites.
Principles of Quantum Mechanics
R. Shankar · 1994
Earlier work this paper cites.
Topological quantum computation
R. Walter Ogburn and John Preskill · 1998
Earlier work this paper cites.
Topological quantum computation, 2001
Michael H. Freedman, Alexei Kitaev, Michael J. Larsen, and Zhenghan Wang · 2001
Earlier work this paper cites.
A one-way quantum computer
Robert Raussendorf and Hans J. Briegel · 2001
Earlier work this paper cites.
Persistent entanglement in arrays of interacting particles
Hans J. Briegel and Robert Raussendorf · 2001
Earlier work this paper cites.
The one-way quantum computer–a non-network model of quantum computation
Robert Raussendorf, Daniel Browne, and Hans Briegel · 2002
Earlier work this paper cites.
Classical and Quantum Computation
A. Kitaev, A. H. Shen, and M. N. Vyalyi · 2002
Earlier work this paper cites.
Fault-tolerant quantum computation by anyons
A. Yu. Kitaev · 2003
Earlier work this paper cites.
Measurement-based quantum computation on cluster states
Robert Raussendorf, Daniel E. Browne, and Hans J. Briegel · 2003
Earlier work this paper cites.
Long-range quantum entanglement in noisy cluster states
Robert Raussendorf, Sergey Bravyi, and Jim Harrington · 2005
Cited alongside, same era.
One-way quantum computation - a tutorial introduction, 2006
Dan E. Browne and Hans J. Briegel · 2006
Cited alongside, same era.
The Complexity of the Local Hamiltonian Problem
J. Kempe, A. Kitaev, and O. Regev · 2006
Cited alongside, same era.
The Complexity of Stoquastic Local Hamiltonian Problems
S. Bravyi, D. DiVincenzo, R. Oliveira, and B. Terhal · 2006
Cited alongside, same era.
Simple proof of equivalence between adiabatic quantum computation and the circuit model
Ari Mizel, Daniel A. Lidar, and Morgan Mitchell · 2007
Cited alongside, same era.
Adiabatic quantum computation is equivalent to standard quantum computation
Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, and Oded Regev · 2007
Nonperturbative Gadget for Topological Quantum Codes
Samuel A. Ocko and Beni Yoshida · 2011
Later among the works it cites.
Schrieffer-Wolff transformation for quantum many-body systems
S. Bravyi, D. DiVincenzo, and D. Loss · 2011
Later among the works it cites.
Adiabatic quantum simulation of quantum chemistry
Ryan Babbush, Peter J. Love, and Alán Aspuru-Guzik · 2014
Later among the works it cites.
Complexity classification of local hamiltonian problems
Toby S. Cubitt and Ashley Montanaro · 2014
Later among the works it cites.
Universal adiabatic quantum computation via the space-time circuit-to-hamiltonian construction
David Gosset, Barbara M. Terhal, and Anna Vershynina · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Adiabatic rotation, quantum search, and preparation of superposition states
M. Stewart Siu · 2007
Cited alongside, same era.
Non-abelian anyons and topological quantum computation
Chetan Nayak, Steven H. Simon, Ady Stern, Michael Freedman, and Sankar Das Sarma · 2008
Cited alongside, same era.
The complexity of quantum spin systems on a two-dimensional square lattice
R. Oliveira and B. Terhal · 2008
Cited alongside, same era.
S. Bravyi, D. DiVincenzo, D. Loss, and B. Terhal · 2008
Cited alongside, same era.
Perturbative gadgets at arbitrary orders
S. P. Jordan and E. Farhi · 2008
Cited alongside, same era.
J. D. Biamonte · 2008
Cited alongside, same era.
Hamiltonian gadgets with reduced resource requirements
Yudong Cao, Ryan Babbush, Jacob Biamonte, and Sabre Kais · 2015
Later among the works it cites.
Perturbative gadget without strong interactions
Yudong Cao and Daniel Nagaj · 2015
Later among the works it cites.
Adiabatic and hamiltonian computing on a 2d lattice with simple two-qubit interactions
Seth Lloyd and Barbara M Terhal · 2016
Later among the works it cites.
Nonperturbative embedding for highly nonlocal Hamiltonians
Yiğit Subaşı and Christopher Jarzynski · 2016
Later among the works it cites.
Efficient estimation of perturbative error with cellular automata
Yudong Cao and Sabre Kais · 2016
Later among the works it cites.
Combinatorial algorithms for perturbation theory and applications on quantum computing
Yudong Cao · 2016
Later among the works it cites.
Fermionic hamiltonians for quantum simulations: a general reduction scheme, Jun 2017
Panagiotis Kl. Barkoutsos, Nikolaj Moll, Peter W. J. Staar, Peter Mueller, Andreas Fuhrer, Stefan Filipp, Matthias Troyer, and Ivano Tavernelli · 2017
Closest in time.