Fetching the paper…
Reading the bibliography…
In this paper we consider the scalability of Multi-Angle QAOA with respect to the number of QAOA layers.
T. Hogg, Quantum search heuristics, Physical Review A 61
2000
Earlier work this paper cites.
2000
Earlier work this paper cites.
J. Håstad, Some optimal inapproximability results, J. ACM 48
2001
Earlier work this paper cites.
2004
Earlier work this paper cites.
2014
Earlier work this paper cites.
2017
Earlier work this paper cites.
2018
Earlier work this paper cites.
Z. Wang, S. Hadfield, Z. Jiang, and E. G. Rieffel, Quantum approximate optimization algorithm for maxcut: A fermionic view, Phys. Rev. A 97
2018
Earlier work this paper cites.
2018
Earlier work this paper cites.
J. Choi and J. Kim, A tutorial on quantum approximate optimization algorithm (qaoa): Fundamentals and applications, in 2019 International Conference on Information and Communication Technology Convergence (ICTC) (2019) pp. 138–142
2019
Earlier work this paper cites.
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
Earlier work this paper cites.
A. Bärtschi and S. Eidenbenz, Grover mixers for qaoa: Shifting complexity from mixer design to state preparation, in 2020 IEEE International Conference on Quantum Computing and Engineering (QCE) (IEEE, 2020) pp. 72–82
2020
Earlier work this paper cites.
Z. Wang, N. C. Rubin, J. M. Dominy, and E. G. Rieffel, x y xy mixers: Analytical and numerical results for the quantum alternating operator ansatz, Phys. Rev. A 101
2020
Earlier work this paper cites.
L. Zhou, S.-T. Wang, S. Choi, H. Pichler, and M. D. Lukin, Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices, Physical Review X 10
2020
Earlier work this paper cites.
S. Hadfield, On the representation of boolean and real functions as hamiltonians for quantum computing, ACM Transactions on Quantum Computing 2
2021
Earlier work this paper cites.
K. Marwaha, Local classical max-cut algorithm outperforms p = 2 p=2 qaoa on high-girth regular graphs, Quantum 5
2021
Earlier work this paper cites.
J. Sun, X. Yuan, T. Tsunoda, V. Vedral, S. C. Benjamin, and S. Endo, Mitigating realistic noise in practical noisy intermediate-scale quantum devices, Phys. Rev. Appl. 15
2021
Cited alongside, same era.
S. Dasgupta and T. S. Humble, Stability of noisy quantum computing devices (2021), arXiv:2105.09472
2021
Cited alongside, same era.
R. Herrman, J. Ostrowski, T. S. Humble, and G. Siopsis, Lower bounds on circuit depth of the quantum approximate optimization algorithm, Quantum Information Processing 20
2021
Cited alongside, same era.
X. Lee, Y. Saito, D. Cai, and N. Asai, Parameters fixing strategy for quantum approximate optimization algorithm, in 2021 IEEE International Conference on Quantum Computing and Engineering (QCE) (2021) pp. 10–16
2021
Cited alongside, same era.
R. Herrman, P. C. Lotshaw, J. Ostrowski, T. S. Humble, and G. Siopsis, Multi-angle quantum approximate optimization algorithm, Scientific Reports 12
2022
Later among the works it cites.
K. Shi, R. Herrman, R. Shaydulin, S. Chakrabarti, M. Pistoia, and J. Larson, Multiangle qaoa does not always need all its angles, 2022 IEEE/ACM 7th Symposium on Edge Computing (SEC) , 414 (2022)
2022
Later among the works it cites.
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
Later among the works it cites.
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
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. Wang, E. Fontana, M. Cerezo, K. Sharma, A. Sone, L. Cincio, and P. J. Coles, Noise-induced barren plateaus in variational quantum algorithms, Nature communications 12
2021
Cited alongside, same era.
2021
Cited alongside, same era.
A. Galda, X. Liu, D. Lykov, Y. Alexeev, and I. Safro, Transferability of optimal qaoa parameters between random graphs, 2021 IEEE International Conference on Quantum Computing and Engineering (QCE) , 171 (2021)
2021
Cited alongside, same era.
S. H. Sack and M. Serbyn, Quantum annealing initialization of the quantum approximate optimization algorithm, Quantum 5
2021
Cited alongside, same era.
F. G. Fuchs, K. O. Lye, H. Møll Nilsen, A. J. Stasik, and G. Sartor, Constraint preserving mixers for the quantum approximate optimization algorithm, Algorithms 15
2022
Cited alongside, same era.
L. Zhu, H. L. Tang, G. S. Barron, F. A. Calderon-Vargas, N. J. Mayhall, E. Barnes, and S. E. Economou, Adaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computer, Phys. Rev. Res. 4
2022
Cited alongside, same era.
J. Basso, E. Farhi, K. Marwaha, B. Villalonga, and L. Zhou, The quantum approximate optimization algorithm at high depth for maxcut on large-girth regular graphs and the sherrington-kirkpatrick model, in 17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022) , Vol. 232 (2022) pp. 7:1–7:21
2022
Cited alongside, same era.
J. Basso, D. Gamarnik, S. Mei, and L. Zhou, Performance and limitations of the qaoa at constant levels on large sparse hypergraphs and spin glass models, in 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) (2022) pp. 335–343
2022
Cited alongside, same era.
2022
Later among the works it cites.
2023
Closest in time.
D. Lykov, J. Wurtz, C. Poole, M. Saffman, T. Noel, and Y. Alexeev, Sampling frequency thresholds for the quantum advantage of the quantum approximate optimization algorithm, npj Quantum Information 9
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
Z. Zhou, Y. Du, X. Tian, and D. Tao, Qaoa-in-qaoa: Solving large-scale maxcut problems on small quantum machines, Phys. Rev. Appl. 19
2023
Closest in time.
2023
Closest in time.
J. Li, M. Alam, and S. Ghosh, Large-scale quantum approximate optimization via divide-and-conquer, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 42
2023
Closest in time.
2023
Closest in time.
S. H. Sack, R. A. Medina, R. Kueng, and M. Serbyn, Recursive greedy initialization of the quantum approximate optimization algorithm with guaranteed improvement, Physical Review A 107
2023
Closest in time.