Fetching the paper…
Reading the bibliography…
We consider the task of estimating the expectation value of an $n$-qubit tensor product observable $O_1\otimes O_2\otimes \cdots \otimes O_n$ in the output state of a shallow quantum circuit.
Problems and results on 3-chromatic hypergraphs and some related questions
Paul Erdős and László Lovász · 1973
Earlier work this paper cites.
Approximate inclusion-exclusion
Nathan Linial and Noam Nisan · 1990
Earlier work this paper cites.
Inclusion-exclusion: Exact and approximate
Jeff Kahn, Nathan Linial, and Alex Samorodnitsky · 1996
Earlier work this paper cites.
Bounds for small-error and zero-error quantum algorithms
Harry Buhrman, Richard Cleve, Ronald De Wolf, and Christof Zalka · 1999
Earlier work this paper cites.
Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations
Daniel Gottesman and Isaac L Chuang · 1999
Earlier work this paper cites.
Quantum lower bounds by polynomials
Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, and Ronald De Wolf · 2001
Earlier work this paper cites.
Efficient classical simulation of slightly entangled quantum computations
Guifré Vidal · 2003
Earlier work this paper cites.
Adptive quantum computation, constant depth quantum circuits and Arthur-Merlin games
Barbara M Terhal and David P DiVincenzo · 2004
Earlier work this paper cites.
Classical simulation of limited-width cluster-state quantum computation
Nadav Yoran and Anthony J Short · 2006
Earlier work this paper cites.
On the simulation of quantum circuits
Richard Jozsa · 2006
Earlier work this paper cites.
Accuracy threshold for postselected quantum computation
Panos Aliferis, Daniel Gottesman, and John Preskill · 2007
Earlier work this paper cites.
Simulating quantum computation by contracting tensor networks
Igor L Markov and Yaoyun Shi · 2008
Earlier work this paper cites.
Ronald de Wolf · 2008
Earlier work this paper cites.
Simulating quantum computers with probabilistic methods
Maarten Van den Nest · 2009
Earlier work this paper cites.
The density-matrix renormalization group in the age of matrix product states
Ulrich Schollwöck · 2011
Earlier work this paper cites.
A variational eigenvalue solver on a photonic quantum processor
Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J Love, and Jeremy L O ’Brien · 2014
Cited alongside, same era.
A quantum approximate optimization algorithm
Edward Farhi, Jeffrey Goldstone, and Sam Gutmann · 2014
Cited alongside, same era.
The theory of variational hybrid quantum-classical algorithms
Jarrod R McClean, Jonathan Romero, Ryan Babbush, and Alán Aspuru-Guzik · 2016
Cited alongside, same era.
Combinatorics and complexity of partition functions
Alexander Barvinok · 2016
Cited alongside, same era.
Average-case complexity versus approximate simulation of commuting quantum computations
Michael J Bremner, Ashley Montanaro, and Dan J Shepherd · 2016
Cited alongside, same era.
Computing the partition function of a polynomial on the boolean cube
Alexander Barvinok · 2017
Later among the works it cites.
Quantum computing in the NISQ era and beyond
John Preskill · 2018
Later among the works it cites.
Practical quantum error mitigation for near-future applications
Suguru Endo, Simon Benjamin, and Ying Li · 2018
Later among the works it cites.
Recovering noise-free quantum observables
Matthew Otten and Stephen Gray · 2018
Later among the works it cites.
Low-cost error mitigation by symmetry verification
X Bonet-Monroig, R Sagastizabal, M Singh, and TE O’Brien · 2018
Later among the works it cites.
Approximation algorithms for complex-valued ising models on bounded degree graphs
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Abhinav Kandala, Antonio Mezzacapo, Kristan Temme, Maika Takita, Markus Brink, Jerry M. Chow, and Jay M. Gambetta · 2017
Cited alongside, same era.
Error mitigation for short-depth quantum circuits
Kristan Temme, Sergey Bravyi, and Jay M Gambetta · 2017
Cited alongside, same era.
Efficient variational quantum simulator incorporating active error minimization
Ying Li and Simon C Benjamin · 2017
Cited alongside, same era.
The complexity of approximating complex-valued Ising and Tutte partition functions
Leslie Ann Goldberg and Heng Guo · 2017
Cited alongside, same era.
Local hamiltonians whose ground states are hard to approximate
Lior Eldar and Aram W Harrow · 2017
Cited alongside, same era.
Breaking the 49-qubit barrier in the simulation of quantum circuits
Edwin Pednault, John A Gunnels, Giacomo Nannicini, Lior Horesh, Thomas Magerlein, Edgar Solomonik, and Robert Wisnieff · 2017
Cited alongside, same era.
Simulation of low-depth quantum circuits as complex undirected graphical models
Sergio Boixo, Sergei V Isakov, Vadim N Smelyanskiy, and Hartmut Neven · 2017
Cited alongside, same era.
Ryan L Mann and Michael J Bremner · 2018
Later among the works it cites.
Characterizing quantum supremacy in near-term devices
Sergio Boixo, Sergei V Isakov, Vadim N Smelyanskiy, Ryan Babbush, Nan Ding, Zhang Jiang, Michael J Bremner, John M Martinis, and Hartmut Neven · 2018
Later among the works it cites.
Ground-state energy estimation of the water molecule on a trapped ion quantum computer
Yunseong Nam, Jwo-Sy Chen, Neal C Pisenti, Kenneth Wright, Conor Delaney, Dmitri Maslov, Kenneth R Brown, Stewart Allen, Jason M Amini, Joel Apisdorf, et al · 2019
Closest in time.
Quantum machine learning in feature Hilbert spaces
Maria Schuld and Nathan Killoran · 2019
Closest in time.
Supervised learning with quantum-enhanced feature spaces
Vojtěch Havlíček, Antonio D Córcoles, Kristan Temme, Aram W Harrow, Abhinav Kandala, Jerry M Chow, and Jay M Gambetta · 2019
Closest in time.
Extending the computational reach of a noisy superconducting quantum processor
Abhinav Kandala, Kristan Temme, Antonio D Corcoles, Antonio Mezzacapo, Jerry M Chow, and Jay M Gambetta · 2019
Closest in time.
Establishing the quantum supremacy frontier with a 281 Pflop/s simulation
Benjamin Villalonga, Dmitry Lyakh, Sergio Boixo, Hartmut Neven, Travis S Humble, Rupak Biswas, Eleanor G Rieffel, Alan Ho, and Salvatore Mandrà · 2019
Closest in time.
On the complexity and verification of quantum random circuit sampling
Adam Bouland, Bill Fefferman, Chinmay Nirkhe, and Umesh Vazirani · 2019
Closest in time.