Fetching the paper…
Reading the bibliography…
Current gate-based quantum computers have the potential to provide a computational advantage if algorithms use quantum hardware efficiently.
S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, Optimization by simulated annealing, Science 220
1983
Earlier work this paper cites.
D. H. Rothman, Large near-surface anomalies, seismic… (Ph.D. thesis, Stanford University, 1985)
1985
Earlier work this paper cites.
L. N. Trefethen and D. Bau, Numerical linear algebra (SIAM (Society for Industrial and Applied Mathematics) Philadelphia, 1997)
1997
Earlier work this paper cites.
T. Kadowaki and H. Nishimori, Quantum annealing in the transverse Ising model, Phys. Rev. E 58
1998
Earlier work this paper cites.
P. Berman and M. Karpinski, On some tighter inapproximability results (extended abstract), in Automata, Languages and Programming , edited by J. Wiedermann, P. van Emde Boas, and M. Nielsen (Springer Berlin Heidelberg, Berlin, Heidelberg, 1999) pp. 200–209
1999
Earlier work this paper cites.
C. Helmberg, Semidefinite programming for combinatorial optimization (2000)
2000
Earlier work this paper cites.
E. Farhi, J. Goldstone, S. Gutmann, J. Lapan, A. Lundgren, and D. Preda, A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem, Science 292
2001
Earlier work this paper cites.
J. Håstad, Some optimal inapproximability results, J. ACM 48
2001
Earlier work this paper cites.
2005
Earlier work this paper cites.
A. Weiße, G. Wellein, A. Alvermann, and H. Fehske, The kernel polynomial method, Rev. Mod. Phys. 78
2006
Earlier work this paper cites.
2006
Earlier work this paper cites.
G. Vidal, Class of quantum many-body states that can be efficiently simulated, Phys. Rev. Lett. 101
2008
Earlier work this paper cites.
2010
Earlier work this paper cites.
J. Noble, M. Lubasch, and U. Jentschura, Generalized Householder transformations for the complex symmetric eigenvalue problems, Eur. Phys. J. Plus 128
2013
Earlier work this paper cites.
G. Kochenberger, J.-K. Hao, F. Glover, M. Lewis, Z. Lü, H. Wang, and Y. Wang, The unconstrained binary quadratic programming problem: a survey, J. Comb. Optim. 28
2014
Earlier work this paper cites.
A. Lucas, Ising formulations of many NP problems, Front. Phys. 2
2014
Earlier work this paper cites.
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, Nat. Commun. 5
2014
Earlier work this paper cites.
2014
Earlier work this paper cites.
R. Orús, A practical introduction to tensor networks: Matrix product states and projected entangled pair states, Ann. of Phys. 349
2014
Earlier work this paper cites.
D. Wecker, M. B. Hastings, and M. Troyer, Progress towards practical quantum variational algorithms, Phys. Rev. A 92
2015
Earlier work this paper cites.
M. Lubasch, J. I. Fuks, H. Appel, A. Rubio, J. I. Cirac, and M.-C. Bañuls, Systematic construction of density functionals based on matrix product state computations, New J. of Phys. 18
2016
Earlier work this paper cites.
J. Noble, M. Lubasch, J. Stevens, and U. Jentschura, Diagonalization of complex symmetric matrices: Generalized Householder reflections, iterative deflation and implicit shifts, Comput. Phys. Commun. 221
2017
Earlier work this paper cites.
J. Romero, J. P. Olson, and A. Aspuru-Guzik, Quantum autoencoders for efficient compression of quantum data, Quantum Sci. Technol. 2
2017
Earlier work this paper cites.
B. Korte and J. Vygen, Combinatorial Optimization: Theory and Algorithms , 6th ed. (Springer Publishing Company, Incorporated, 2018)
2018
Cited alongside, same era.
N. Moll, P. Barkoutsos, L. S. Bishop, J. M. Chow, A. Cross, D. J. Egger, S. Filipp, A. Fuhrer, J. M. Gambetta, M. Ganzhorn, and et al., Quantum optimization using variational algorithms on near-term quantum devices, Quantum Sci. Technol. 3
2018
Cited alongside, same era.
2018
Cited alongside, same era.
K. Mitarai, M. Negoro, M. Kitagawa, and K. Fujii, Quantum circuit learning, Phys. Rev. A 98
2018
Cited alongside, same era.
M. Lubasch, P. Moinier, and D. Jaksch, Multigrid renormalization, J. Comput. Phys. 372
S. Fernández-Lorenzo, D. Porras, and J. J. García-Ripoll, Hybrid quantum–classical optimization with cardinality constraints and applications to finance, Quantum Sci. Technol. 6
2021
Closest in time.
2021
Closest in time.
P. Díez-Valle, D. Porras, and J. J. García-Ripoll, Quantum variational optimization: The role of entanglement and problem hardness, Phys. Rev. A 104
2021
Closest in time.
M. P. Harrigan, K. J. Sung, M. Neeley, K. J. Satzinger, F. Arute, K. Arya, J. Atalaya, J. C. Bardin, R. Barends, S. Boixo, and et al., Quantum approximate optimization of non-planar graph problems on a planar superconducting processor, Nat. Phys. 17
2021
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2018
Cited alongside, same era.
M. Benedetti, E. Lloyd, S. Sack, and M. Fiorentini, Parameterized quantum circuits as machine learning models, Quantum Sci. Technol. 4
2019
Cited alongside, same era.
F. Glover, G. Kochenberger, and Y. Du, Quantum Bridge Analytics I: a tutorial on formulating and using QUBO models, 4OR 17
2019
Cited alongside, same era.
2019
Cited alongside, same era.
Y. Ge, J. Tura, and J. I. Cirac, Faster ground state preparation and high-precision ground energy estimation with fewer qubits, J. Math. Phys. 60
2019
Cited alongside, same era.
M. Schuld, V. Bergholm, C. Gogolin, J. Izaac, and N. Killoran, Evaluating analytic gradients on quantum hardware, Phys. Rev. A 99
2019
Cited alongside, same era.
S. Hadfield, Z. Wang, B. O’Gorman, E. Rieffel, D. Venturelli, and R. Biswas, From the quantum approximate optimization algorithm to a quantum alternating operator ansatz, Algorithms 12
2019
Cited alongside, same era.
H. R. Grimsley, S. E. Economou, E. Barnes, and N. J. Mayhall, An adaptive variational algorithm for exact molecular simulations on a quantum computer, Nat. Commun. 10
2019
Cited alongside, same era.
M. Benedetti, M. Fiorentini, and M. Lubasch, Hardware-efficient variational quantum algorithms for time evolution, Phys. Rev. Research 3
2021
Closest in time.
2021
Closest in time.
A. Çakan, J. I. Cirac, and M. C. Bañuls, Approximating the long time average of the density operator: Diagonal ensemble, Phys. Rev. B 103
2021
Closest in time.
J. M. Pino, J. M. Dreiling, C. Figgatt, J. P. Gaebler, S. A. Moses, M. S. Allman, C. H. Baldwin, M. Foss-Feig, D. Hayes, K. Mayer, C. Ryan-Anderson, and B. Neyenhuis, Demonstration of the trapped-ion quantum CCD computer architecture, Nature 592
2021
Closest in time.
A. Mari, T. R. Bromley, and N. Killoran, Estimating the gradient and higher-order derivatives on quantum hardware, Phys. Rev. A 103
2021
Closest in time.
2021
Closest in time.
2021
Closest in time.
2021
Closest in time.
C. Cao and X. Wang, Noise-assisted quantum autoencoder, Phys. Rev. Applied 15
2021
Closest in time.
2021
Closest in time.
2021
Closest in time.
A. Skolik, J. R. McClean, M. Mohseni, P. van der Smagt, and M. Leib, Layerwise learning for quantum neural networks, Quantum Mach. Intell. 3
2021
Closest in time.
2021
Closest in time.
2021
Closest in time.
2021
Closest in time.
J. J. García-Ripoll, Quantum-inspired algorithms for multivariate analysis: from interpolation to partial differential equations, Quantum 5
2021
Closest in time.
J. I. Cirac, D. Pérez-García, N. Schuch, and F. Verstraete, Matrix product states and projected entangled pair states: Concepts, symmetries, theorems, Rev. Mod. Phys. 93
2021
Closest in time.