Fetching the paper…
Reading the bibliography…
The partition function and free energy of a quantum many-body system determine its physical properties in thermal equilibrium.
L. Stockmeyer, “The complexity of approximate counting,” in Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing
1983
Earlier work this paper cites.
M. F. Hutchinson, “A stochastic estimator of the trace of the influence matrix for Laplacian smoothing splines,” Communications in Statistics-Simulation and Computation
1989
Earlier work this paper cites.
World scientific, 1993
M. Suzuki, Quantum Monte Carlo methods in condensed matter physics · 1993
Earlier work this paper cites.
S. Lloyd, “Universal quantum simulators,” Science
1996
Earlier work this paper cites.
P. Alimonti and V. Kann, “Hardness of approximating problems on cubic graphs,” in Italian Conference on Algorithms and Complexity
1997
Earlier work this paper cites.
E. Knill and R. Laflamme, “Power of one bit of quantum information,” Physical Review Letters
1998
Earlier work this paper cites.
S. Arora, D. Karger, and M. Karpinski, “Polynomial time approximation schemes for dense instances of NP-hard problems,” Journal of computer and system sciences
1999
Earlier work this paper cites.
USA: American Mathematical Society, 2002
A. Y. Kitaev, A. H. Shen, and M. N. Vyalyi, Classical and Quantum Computation · 2002
Earlier work this paper cites.
G. Brassard, P. Høyer, M. Mosca, and A. Tapp, “Quantum amplitude amplification and estimation,” in Quantum computation and information
2002
Earlier work this paper cites.
D. Bertsimas and S. Vempala, “Solving convex programs by random walks,” Journal of the ACM (JACM)
2004
Earlier work this paper cites.
S. Aaronson and D. Gottesman, “Improved simulation of stabilizer circuits,” Physical Review A
2004
Earlier work this paper cites.
C. Marriott and J. Watrous, “Quantum arthur–merlin games,” computational complexity
2005
Earlier work this paper cites.
J. Kempe, A. Kitaev, and O. Regev, “The complexity of the local hamiltonian problem,” Siam journal on computing
2006
Earlier work this paper cites.
S. Bravyi, D. P. Divincenzo, R. I. Oliveira, and B. M. Terhal, “The complexity of stoquastic local Hamiltonian problems,” arXiv preprint quant-ph/0606140
2006
Earlier work this paper cites.
Y.-K. Liu, “Consistency of local density matrices is qma-complete,” in Approximation, randomization, and combinatorial optimization. algorithms and techniques
2006
Earlier work this paper cites.
I. Dinur, “The PCP theorem by gap amplification,” Journal of the ACM (JACM)
2007
Earlier work this paper cites.
PhD thesis, Imperial College of Science, Technology and Medicine, 2008
F. G. S. L. Brandão, Entanglement Theory and the Quantum Simulation of Many-Body Physics · 2008
Earlier work this paper cites.
2008
Earlier work this paper cites.
C. Dankert, R. Cleve, J. Emerson, and E. Livine, “Exact and approximate unitary 2-designs and their application to fidelity estimation,” Physical Review A
2009
Earlier work this paper cites.
D. Poulin and P. Wocjan, “Sampling from the thermal quantum gibbs state and evaluating partition functions with a quantum computer,” Phys. Rev. Lett
2009
Cited alongside, same era.
D. Štefankovič, S. Vempala, and E. Vigoda, “Adaptive simulated annealing: A near-optimal connection between sampling and counting,” Journal of the ACM (JACM)
2009
Cited alongside, same era.
B. Brown, S. T. Flammia, and N. Schuch, “Computational difficulty of computing the density of states,” Physical review letters
2011
Cited alongside, same era.
2011
Cited alongside, same era.
USA: Cambridge University Press, 10th ed., 2011
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition · 2011
A. N. Chowdhury and R. D. Somma, “Quantum algorithms for gibbs sampling and hitting-time estimation,” Quant. Inf. Comp
2017
Later among the works it cites.
G. H. Low and I. L. Chuang, “Optimal hamiltonian simulation by quantum signal processing,” Physical review letters
2017
Later among the works it cites.
T. S. Cubitt, A. Montanaro, and S. Piddock, “Universal quantum Hamiltonians,” Proceedings of the National Academy of Sciences
2018
Later among the works it cites.
Cambridge University Press, 2018
J. Watrous, The Theory of Quantum Information · 2018
Later among the works it cites.
D. Gosset and J. Smolin, “A compressed classical description of quantum states,” in 14th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2019)
2019
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.
S. Gharibian and J. Kempe, “Approximation algorithms for QMA-complete problems,” SIAM Journal on Computing
2012
Cited alongside, same era.
Springer Science & Business Media, 2012
M. Grötschel, L. Lovász, and A. Schrijver, Geometric algorithms and combinatorial optimization · 2012
Cited alongside, same era.
F. G. Brandao and A. W. Harrow, “Product-state approximations to quantum ground states,” in Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing
2013
Cited alongside, same era.
Springer Science & Business Media, 2013
R. Bhatia, Matrix analysis · 2013
Cited alongside, same era.
R. D. Somma and S. Boixo, “Spectral gap amplification,” SIAM Journal on Computing
2013
Cited alongside, same era.
Y. Yoshida and Y. Zhou, “Approximation schemes via sherali-adams hierarchy for dense constraint satisfaction problems and assignment problems,” in Proceedings of the 5th Conference on Innovations in Theoretical Computer Science
2014
Cited alongside, same era.
R. Koenig and J. A. Smolin, “How to efficiently select an arbitrary Clifford group element,” Journal of Mathematical Physics
2014
Cited alongside, same era.
A. Gilyén, Y. Su, G. H. Low, and N. Wiebe, “Quantum singular value transformation and beyond: Exponential improvements for quantum matrix arithmetics,” in ACM Symposium on Theory of Computing 2019
2019
Later among the works it cites.
G. H. Low and I. L. Chuang, “Hamiltonian Simulation by Qubitization,” Quantum
2019
Later among the works it cites.
A. W. Harrow, S. Mehraban, and M. Soleimanifar, “Classical algorithms, correlation decay, and complex zeros of partition functions of quantum many-body systems,” in Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
2020
Later among the works it cites.
2020
Later among the works it cites.
H.-Y. Huang, R. Kueng, and J. Preskill, “Predicting many properties of a quantum system from very few measurements,” Nature Physics
2020
Later among the works it cites.
J. van Apeldoorn, A. Gilyén, S. Gribling, and R. de Wolf, “Quantum SDP-Solvers: Better upper and lower bounds,” Quantum
2020
Later among the works it cites.
S. Aaronson and P. Rall, “Quantum approximate counting, simplified,” Symposium on Simplicity in Algorithms
2020
Later among the works it cites.
E. Crosson and A. W. Harrow, “Rapid mixing of path integral Monte Carlo for 1D stoquastic Hamiltonians,” Quantum
2021
Closest in time.
A. N. Chowdhury, R. D. Somma, and Y. Subasi, “Computing partition functions in the one-clean-qubit model,” Phys. Rev. A
2021
Closest in time.
2021
Closest in time.
2021
Closest in time.
R. A. Meyer, C. Musco, C. Musco, and D. P. Woodruff, “Hutch++: Optimal stochastic trace estimation,” in Symposium on Simplicity in Algorithms (SOSA)
2021
Closest in time.
S. Bravyi and D. Maslov, “Hadamard-free circuits expose the structure of the Clifford group,” IEEE Transactions on Information Theory
2021
Closest in time.