Fetching the paper…
Reading the bibliography…
Variational quantum algorithms (VQAs) are a broad class of algorithms with many applications in science and industry.
T. Hogg and D. Portnov, “Quantum optimization,”
2000
Earlier work this paper cites.
G. Vidal, “Efficient classical simulation of slightly entangled quantum computations,”
2003
Earlier work this paper cites.
I. V. Oseledets, “Tensor-train decomposition,”
2011
Earlier work this paper cites.
U. Schollwöck, “The density-matrix renormalization group in the age of matrix product states,”
2011
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,”
2014
Earlier work this paper cites.
E. Farhi, J. Goldstone, and S. Gutmann, “A quantum approximate optimization algorithm,”
2014
Earlier work this paper cites.
R. Orús, “A practical introduction to tensor networks: Matrix product states and projected entangled pair states,”
2014
Earlier work this paper cites.
L. Grasedyck, M. Kluge, and S. Kramer, “Variants of alternating least squares tensor completion in the tensor train format,”
2015
Earlier work this paper cites.
M. Steinlechner, “Riemannian optimization for high-dimensional tensor completion,”
2016
Earlier work this paper cites.
H. Li, Z. Xu, G. Taylor, C. Studer, and T. Goldstein, “Visualizing the loss landscape of neural nets,”
2018
Earlier work this paper cites.
J. R. McClean, S. Boixo, V. N. Smelyanskiy, R. Babbush, and H. Neven, “Barren plateaus in quantum neural network training landscapes,”
2018
Earlier work this paper cites.
P. K. Barkoutsos, J. F. Gonthier, I. Sokolov, N. Moll, G. Salis, A. Fuhrer, M. Ganzhorn, D. J. Egger, M. Troyer, A. Mezzacapo
2018
Earlier work this paper cites.
R. Shaydulin, I. Safro, and J. Larson, “Multistart methods for quantum approximate optimization,” in
2019
Earlier work this paper cites.
L. Yuan, Q. Zhao, L. Gui, and J. Cao, “High-order tensor completion via gradient-based optimization under tensor train format,”
2019
Earlier work this paper cites.
Y. Pang, T. Hao, A. Dugad, Y. Zhou, and E. Solomonik, “Efficient 2D tensor network simulation of quantum systems,” in
2020
Cited alongside, same era.
M. Cerezo, A. Arrasmith, R. Babbush, S. C. Benjamin, S. Endo, K. Fujii, J. R. McClean, K. Mitarai, X. Yuan, L. Cincio
2021
Cited alongside, same era.
2021
Cited alongside, same era.
J. Lee, A. B. Magann, H. A. Rabitz, and C. Arenz, “Progress toward favorable landscapes in quantum combinatorial optimization,”
2021
Cited alongside, same era.
Z. He and Z. Zhang, “High-dimensional uncertainty quantification via tensor regression with rank determination and adaptive sampling,”
2021
P. Niroula, R. Shaydulin, R. Yalovetzky, P. Minssen, D. Herman, S. Hu, and M. Pistoia, “Constrained quantum optimization for extractive summarization on a trapped-ion quantum computer,”
2022
Later among the works it cites.
2023
Later among the works it cites.
D. Herman, C. Googin, X. Liu, Y. Sun, A. Galda, I. Safro, M. Pistoia, and Y. Alexeev, “Quantum computing for finance,”
2023
Later among the works it cites.
Z. He, R. Shaydulin, S. Chakrabarti, D. Herman, C. Li, Y. Sun, and M. Pistoia, “Alignment between initial state and mixer improves QAOA performance for constrained optimization,”
2023
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.
J. Wurtz and D. Lykov, “Fixed-angle conjectures for the quantum approximate optimization algorithm on regular MaxCut graphs,”
2021
Cited alongside, same era.
T. Hao, R. Shaydulin, M. Pistoia, and J. Larson, “Exploiting in-constraint energy in constrained variational quantum optimization,” in
2022
Cited alongside, same era.
X. Liu, A. Angone, R. Shaydulin, I. Safro, Y. Alexeev, and L. Cincio, “Layer VQE: A variational approach for combinatorial optimization on noisy quantum computers,”
2022
Cited alongside, same era.
2022
Cited alongside, same era.
J. Kim and Y. Oz, “Quantum energy landscape and circuit optimization,”
2022
Cited alongside, same era.
2022
Cited alongside, same era.
C. Ibrahim, D. Lykov, Z. He, Y. Alexeev, and I. Safro, “Constructing optimal contraction trees for tensor network quantum circuit simulation,” in
2022
Cited alongside, same era.
2023
Later among the works it cites.
R. Shaydulin, P. C. Lotshaw, J. Larson, J. Ostrowski, and T. S. Humble, “Parameter transfer for quantum approximate optimization of weighted MaxCut,”
2023
Later among the works it cites.
T. Hao, K. Liu, and S. Tannu, “Enabling high performance debugging for variational quantum algorithms using compressed sensing,” in
2023
Later among the works it cites.
2023
Later among the works it cites.
2023
Later among the works it cites.
A. Chertkov, G. Ryzhakov, and I. Oseledets, “Black box approximation in the tensor train format initialized by ANOVA decomposition,”
2023
Later among the works it cites.
D. Herman, R. Shaydulin, Y. Sun, S. Chakrabarti, S. Hu, P. Minssen, A. Rattew, R. Yalovetzky, and M. Pistoia, “Constrained optimization via quantum zeno dynamics,”
2023
Later among the works it cites.
S. H. Sureshbabu, D. Herman, R. Shaydulin, J. Basso, S. Chakrabarti, Y. Sun, and M. Pistoia, “Parameter setting in quantum approximate optimization of weighted problems,”
2024
Closest in time.
A. Pérez-Salinas, H. Wang, and X. Bonet-Monroig, “Analyzing variational quantum landscapes with information content,”
2024
Closest in time.