Fetching the paper…
Reading the bibliography…
The optimization of the power consumption of antenna networks is a problem with a potential impact in the field of telecommunications.
1911
Earlier work this paper cites.
F. Barahona, On the computational complexity of ising spin glass models, Journal of Physics A: Mathematical and General 15
1982
Earlier work this paper cites.
F. Barahona, M. Grötschel, M. Jünger, and G. Reinelt, An application of combinatorial optimization to statistical physics and circuit layout design, Operations Research 36
1988
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.
E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, Quantum computation by adiabatic evolution (2000), arXiv:quant-ph/0001106 [quant-ph]
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.
T. Hogg, Adiabatic quantum computing for random satisfiability problems, Phys. Rev. A 67
2003
Earlier work this paper cites.
2004
Earlier work this paper cites.
M. W. Johnson, M. H. S. Amin, S. Gildert, T. Lanting, F. Hamze, N. Dickson, R. Harris, A. J. Berkley, J. Johansson, P. Bunyk, E. M. Chapple, C. Enderud, J. P. Hilton, K. Karimi, E. Ladizinsky, N. Ladizinsky, T. Oh, I. Perminov, C. Rich, M. C. Thom, E. Tolkacheva, C. J. S. Truncik, S. Uchaikin, J. Wang, B. Wilson, and G. Rose, Quantum annealing with manufactured spins, Nature 473
2011
Earlier work this paper cites.
2012
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, Journal of Combinatorial Optimization 28
2014
Earlier work this paper cites.
A. Lucas, Ising formulations of many NP problems, Frontiers in Physics 2
2014
Earlier work this paper cites.
S. Boixo, T. F. Rønnow, S. V. Isakov, Z. Wang, D. Wecker, D. A. Lidar, J. M. Martinis, and M. Troyer, Evidence for quantum annealing with more than one hundred qubits, Nature Physics 10
2014
Earlier work this paper cites.
2014
Earlier work this paper cites.
2014
Earlier work this paper cites.
E. G. Rieffel, D. Venturelli, B. O’Gorman, M. B. Do, E. M. Prystay, and V. N. Smelyanskiy, A case study in programming a quantum annealer for hard operational planning problems, Quantum Information Processing 14
2015
Earlier work this paper cites.
2016
Earlier work this paper cites.
T. Albash and D. A. Lidar, Adiabatic quantum computation, Rev. Mod. Phys. 90
2018
Earlier work this paper cites.
F. G. S. L. Brandao, M. Broughton, E. Farhi, S. Gutmann, and H. Neven, For Fixed Control Parameters the Quantum Approximate Optimization Algorithm’s Objective Function Value Concentrates for Typical Instances (2018)
2018
Earlier work this paper cites.
J. Preskill, Quantum Computing in the NISQ era and beyond, Quantum 2
2018
Earlier work this paper cites.
2019
Earlier work this paper cites.
G. G. Guerreschi and A. Y. Matsuura, Qaoa for max-cut requires hundreds of qubits for quantum speed-up, Scientific Reports 9
2019
Cited alongside, same era.
J. Clark, T. West, J. Zammit, X. Guo, L. Mason, and D. Russell, Towards real time multi-robot routing using quantum computing technologies, in Proceedings of the International Conference on High Performance Computing in Asia-Pacific Region , HPC Asia 2019 (Association for Computing Machinery, New York, NY, USA, 2019) p. 111–119
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.
E. R. MacQuarrie, C. Simon, S. Simmons, and E. Maine, The emerging commercial landscape of quantum computing, Nature Reviews Physics 2
2020
Cited alongside, same era.
Y. Chai, Y.-J. Han, Y.-C. Wu, Y. Li, M. Dou, and G.-P. Guo, Shortcuts to the quantum approximate optimization algorithm, Phys. Rev. A 105
2022
Later among the works it cites.
P. Chandarana, N. N. Hegade, K. Paul, F. Albarrán-Arriagada, E. Solano, A. del Campo, and X. Chen, Digitized-counterdiabatic quantum approximate optimization algorithm, Phys. Rev. Res. 4
2022
Later among the works it cites.
2022
Later among the works it cites.
2023
Closest in time.
G. Colucci, S. Linde, and F. Phillipson, Power network optimization: A quantum approach, IEEE Access PP
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2020
Cited alongside, same era.
M. E. S. Morales, J. D. Biamonte, and Z. Zimborás, On the universality of the quantum approximate optimization algorithm, Quantum Information Processing 19
2020
Cited alongside, same era.
V. Akshay, H. Philathong, M. E. S. Morales, and J. D. Biamonte, Reachability deficits in quantum approximate optimization, Phys. Rev. Lett. 124
2020
Cited alongside, same era.
P. Virtanen, R. Gommers, T. E. Oliphant, M. Haberland, T. Reddy, D. Cournapeau, E. Burovski, P. Peterson, W. Weckesser, J. Bright, S. J. van der Walt, M. Brett, J. Wilson, K. J. Millman, N. Mayorov, A. R. J. Nelson, E. Jones, R. Kern, E. Larson, C. J. Carey, İ. Polat, Y. Feng, E. W. Moore, J. VanderPlas, D. Laxalde, J. Perktold, R. Cimrman, I. Henriksen, E. A. Quintero, C. R. Harris, A. M. Archibald, A. H. Ribeiro, F. Pedregosa, P. van Mulbregt, and SciPy 1.0 Contributors, SciPy 1.0: Fundamental Algorithms for Scientific Computing in Python, Nature Methods 17
2020
Cited alongside, same era.
J. Wurtz and P. Love, Maxcut quantum approximate optimization algorithm performance guarantees for p > 1 p>1 , Phys. Rev. A 103
2021
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, and P. J. Coles, Variational quantum algorithms, Nature Reviews Physics 3
2021
Cited alongside, same era.
Egger, Daniel J. and Mareček, Jakub and Woerner, Stefan, Warm-starting quantum optimization, Quantum 5
2021
Cited alongside, same era.
2021
Cited alongside, same era.
2023
Closest in time.
H. Jing, Y. Wang, and Y. Li, Data-driven quantum approximate optimization algorithm for power systems, Communications Engineering 2
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
S. Rainjonneau, I. Tokarev, S. Iudin, S. Rayaprolu, K. Pinto, D. Lemtiuzhnikova, M. Koblan, E. Barashov, M. Kordzanganeh, M. Pflitsch, and A. Melnikov, Quantum algorithms applied to satellite mission planning for earth observation, IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing 16
2023
Closest in time.
T. Yoshioka, K. Sasada, Y. Nakano, and K. Fujii, Fermionic quantum approximate optimization algorithm, Phys. Rev. Res. 5
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
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, Phys. Rev. A 107
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
Qiskit contributors, Qiskit: An open-source framework for quantum computing (2023)
2023
Closest in time.
2023
Closest in time.
Y. Kim, A. Eddins, S. Anand, K. X. Wei, E. van den Berg, S. Rosenblatt, H. Nayfeh, Y. Wu, M. Zaletel, K. Temme, and A. Kandala, Evidence for the utility of quantum computing before fault tolerance, Nature 618
2023
Closest in time.