Fetching the paper…
Reading the bibliography…
Variational Quantum Eigensolver (VQE) is a promising algorithm for near-term quantum machines.
1907
Earlier work this paper cites.
1908
Earlier work this paper cites.
P. Jordan and E. P. Wigner, About the pauli exclusion principle, Z. Phys. 47
1928
Earlier work this paper cites.
L. Ford and D. Fulkerson, Maximal flow through a network., (1954)
1954
Earlier work this paper cites.
Z. Baranyai, On the factorization of the complete uniform hypergraphs, Infinite and finite sets (1974)
1974
Earlier work this paper cites.
A. Brouwer and A. Schrijver, Uniform hypergraphs, Packing and Covering in Combinatorics (A. Schrijver, ed.) , 39 (1979)
1979
Earlier work this paper cites.
E. Cohen, Approximate max-flow on small depth networks, SIAM Journal on Computing 24
1995
Earlier work this paper cites.
N. Deo and P. Micikevicius, On one-factorization of complete 3-uniform hypergraphs, Congressus Numerantium , 153 (2002)
2002
Earlier work this paper cites.
A. Aspuru-Guzik, A. D. Dutoi, P. J. Love, and M. Head-Gordon, Simulated quantum computation of molecular energies, Science 309
2005
Cited alongside, same era.
R. F. Bailey and B. Stevens, Hamiltonian decompositions of complete k-uniform hypergraphs, Discrete Mathematics 310
2010
Cited alongside, same era.
J. D. Whitfield, J. Biamonte, and A. Aspuru-Guzik, Simulation of electronic structure hamiltonians using quantum computers, Molecular Physics 109
2011
Cited alongside, same era.
A. Madry, Navigating central path with electrical flows: From flows to matchings, and back, in 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (IEEE, 2013) pp. 253–262
2013
Cited alongside, same era.
Y. T. Lee, S. Rao, and N. Srivastava, A new approach to computing maximum flows using electrical flows, in Proceedings of the forty-fifth annual ACM symposium on Theory of computing (ACM, 2013) pp. 755–764
2018
Later among the works it cites.
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2013
Cited alongside, same era.
A. Peruzzo, J. McClean, P. Shadbolt, M.-H. Yung, X.-Q. Zhou, P. J. Love, A. Aspuru-Guzik, and J. L. O’brien, A variational eigenvalue solver on a photonic quantum processor, Nature communications 5
2014
Cited alongside, same era.
P. Bartlett, Lecture 2: The max-flow min-cut theorem (2015)
2015
Cited alongside, same era.
D. Kang and J. Payor, Flow rounding, arXiv preprint arXiv:1507.08139 (2015)
2015
Cited alongside, same era.
U. Tamm, Applications of baranyai’s theorem in information theory,
Cited in the paper.
E. W. Weisstein, Baranyai’s theorem. From MathWorld—A Wolfram Web Resource
Cited in the paper.
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
D. Eisenstat, Find unique compositions of k-distinct-element subsets for a set of n elements , Stack Overflow, uRL:https://stackoverflow.com/a/25902878 (version: 2019-08-06), https://stackoverflow.com/a/25902878
2019
Closest in time.