Fetching the paper…
Reading the bibliography…
We embed 1-layer QAOA circuits into the larger class of parameterized Instantaneous Quantum Polynomial circuits to produce an improved variational quantum algorithm for solving combinatorial optimization problems.
A. McLachlan, A variational solution of the time-dependent schrodinger equation, Mol. Phys. 8
1964
Earlier work this paper cites.
D. Sherrington and S. Kirkpatrick, Solvable model of a spin-glass, Phys. Rev. Lett. 35
1975
Earlier work this paper cites.
J. Dormand and P. Prince, A family of embedded runge-kutta formulae, J. Comput. Appl. Math. 6
1980
Earlier work this paper cites.
G. Parisi, A sequence of approximated solutions to the s-k model for spin glasses, J. Phys. A Math. Theor. 13
1980
Earlier work this paper cites.
R. Fletcher, Practical Methods of Optimization (John Wiley & Sons, New York, NY, USA, 1987)
1987
Earlier work this paper cites.
E. Farhi, J. Goldstone, S. Gutmann, J. Lapan, A. Lundgren, and D. Preda, Science 292
2001
Earlier work this paper cites.
S. Anders, M. B. Plenio, W. Dür, F. Verstraete, and H.-J. Briegel, Ground-state approximation for strongly interacting spin systems in arbitrary spatial dimension, Phys. Rev. Lett. 97
2006
Earlier work this paper cites.
S. Anders, H. J. Briegel, and W. Dür, A variational method based on weighted graph states, New J. Phys. 9
2007
Earlier work this paper cites.
L. Hartmann, J. Calsamiglia, W. Dür, and H. J. Briegel, Weighted graph states and applications to spin chains, lattices and gases, J. Phys. B-At. Mol. Opt. 40
2007
Earlier work this paper cites.
2007
Earlier work this paper cites.
A. D. K. Plato, O. C. Dahlsten, and M. B. Plenio, Random circuits by measurements on weighted graph states, Phys. Rev. A 78
2008
Earlier work this paper cites.
R. Hübener, C. Kruszynska, L. Hartmann, W. Dür, F. Verstraete, J. Eisert, and M. B. Plenio, Phys. Rev. A 79
2009
Earlier work this paper cites.
D. Shepherd and M. J. Bremner, Temporally unstructured quantum computation, Proc. Math. Phys. Eng. Sci. 465
2009
Earlier work this paper cites.
R. Hübener, C. Kruszynska, L. Hartmann, W. Dür, M. B. Plenio, and J. Eisert, Tensor network methods with graph enhancement, Phys. Rev. B 84
2011
Earlier work this paper cites.
D. Panchenko, The sherrington-kirkpatrick model: An overview, J. Stat. Phys. 149
2012
Earlier work this paper cites.
2014
Earlier work this paper cites.
2015
Earlier work this paper cites.
M. J. Bremner, A. Montanaro, and D. J. Shepherd, Average-case complexity versus approximate simulation of commuting quantum computations, Phys. Rev. Lett. 117
2016
Cited alongside, same era.
M. Benedetti, J. Realpe-Gómez, R. Biswas, and A. Perdomo-Ortiz, Phys. Rev. A 94
2016
Cited alongside, same era.
Z. Jiang, E. G. Rieffel, and Z. Wang, Near-optimal quantum circuit for grover’s unstructured search using a transverse field, Phys. Rev. A 95
2017
Cited alongside, same era.
M. J. Bremner, A. Montanaro, and D. J. Shepherd, Achieving quantum supremacy with sparse and noisy commuting quantum computations, Quantum 1
2017
Cited alongside, same era.
Z. Wang, S. Hadfield, Z. Jiang, and E. G. Rieffel, Quantum approximate optimization algorithm for maxcut: A fermionic view, Phys. Rev. A 97
2018
Cited alongside, same era.
L. Bittel and M. Kliesch, Training variational quantum algorithms is np-hard, Phys. Rev. Lett. 127
2021
Later among the works it cites.
J. Lee, A. B. Magann, H. A. Rabitz, and C. Arenz, Phys. Rev. A 104
2021
Later among the works it cites.
M. P. Harrigan, K. J. Sung, M. Neeley, K. J. Satzinger, F. Arute, K. Arya, J. Atalaya, J. C. Bardin, et al. , Quantum approximate optimization of non-planar graph problems on a planar superconducting processor, Nature Physics 17
2021
Later among the works it cites.
R. Babbush, J. R. McClean, M. Newman, C. Gidney, S. Boixo, and H. Neven, Focus beyond quadratic speedups for error-corrected quantum advantage, PRX Quantum 2
2021
Later among the works it cites.
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, IEEE Transactions on Quantum Engineering 3
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2018
Cited alongside, same era.
D. Litinski, A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery, Quantum 3
2019
Cited alongside, same era.
2019
Cited alongside, same era.
X. Yuan, S. Endo, Q. Zhao, Y. Li, and S. C. Benjamin, Theory of variational quantum simulation, Quantum 3
2019
Cited alongside, same era.
S. McArdle, T. Jones, S. Endo, Y. Li, S. C. Benjamin, and X. Yuan, Npj Quantum Inf. 5
2019
Cited alongside, same era.
G. Aleksandrowicz, T. Alexander, P. Barkoutsos, L. Bello, Y. Ben-Haim, D. Bucher, F. J. Cabrera-Hernández, J. Carballo-Franquis, et al. , Qiskit: An Open-source Framework for Quantum Computing (2019)
2019
Cited alongside, same era.
A. Montanari, Optimization of the sherrington-kirkpatrick hamiltonian, in 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) (2019) pp. 1417–1433
2019
Cited alongside, same era.
2022
Closest in time.
S. Ebadi, A. Keesling, M. Cain, T. T. Wang, H. Levine, D. Bluvstein, G. Semeghini, A. Omran, et al. , Quantum optimization of maximum independent set using rydberg atom arrays, Science 376
2022
Closest in time.
R. Herrman, P. C. Lotshaw, J. Ostrowski, T. S. Humble, and G. Siopsis, Multi-angle quantum approximate optimization algorithm, Sci. Rep. 12
2022
Closest in time.
K. Shi, R. Herrman, R. Shaydulin, S. Chakrabarti, M. Pistoia, and J. Larson, Multiangle qaoa does not always need all its angles, in 2022 IEEE/ACM 7th Symposium on Edge Computing (SEC) (2022) pp. 414–419
2022
Closest in time.
M. Chalupnik, H. Melo, Y. Alexeev, and A. Galda, Augmenting qaoa ansatz with multiparameter problem-independent layer, in 2022 IEEE International Conference on Quantum Computing and Engineering (QCE) (2022) pp. 97–103
2022
Closest in time.
P. M. Schindler, T. Guaita, T. Shi, E. Demler, and J. I. Cirac, Variational ansatz for the ground state of the quantum sherrington-kirkpatrick model, Phys. Rev. Lett. 129
2022
Closest in time.
S. Leontica, github.com/LeonQu4nt/iqp_optimisation (2022)
2022
Closest in time.
2022
Closest in time.
E. Farhi, J. Goldstone, S. Gutmann, and L. Zhou, The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size, Quantum 6
2022
Closest in time.
2023
Closest in time.
P. Díez-Valle, D. Porras, and J. J. García-Ripoll, Quantum approximate optimization algorithm pseudo-boltzmann states, Phys. Rev. Lett. 130
2023
Closest in time.
Quantinuum H2, https://www.quantinuum.com/ Experiments performed between February 14 and March 16 2023
2023
Closest in time.