Fetching the paper…
Reading the bibliography…
A frequent starting point of quantum computation platforms are two-state quantum systems, i.e., qubits.
E. L. Hahn, Spin Echoes, Physical Review 80
1950
Earlier work this paper cites.
H. Y. Carr and E. M. Purcell, Effects of Diffusion on Free Precession in Nuclear Magnetic Resonance Experiments, Physical Review 94
1954
Earlier work this paper cites.
S. Meiboom and D. Gill, Modified Spin-Echo Method for Measuring Nuclear Relaxation Times, Review of Scientific Instruments 29
1958
Earlier work this paper cites.
Z. Michalewicz, A survey of constraint handling techniques in evolutionary computation methods, in Proceedings of the 4th Annual Conference on Evolutionary Programming (MIT Press, 1995) pp. 135–155
1995
Earlier work this paper cites.
D. Pisinger, A minimal algorithm for the bounded knapsack problem, in Integer Programming and Combinatorial Optimization , edited by E. Balas and J. Clausen (Springer Berlin Heidelberg, Berlin, Heidelberg, 1995) pp. 95–109
1995
Earlier work this paper cites.
A. E. Smith and D. W. Coit, Constraint-handling techniques - penalty functions, in Handbook of Evolutionary Computation , edited by T. Bäck, D. B. Fogel, and Z. Michalewicz (IOP Publishing, 1997) Chap. C5
1997
Earlier work this paper cites.
L. Viola and S. Lloyd, Dynamical suppression of decoherence in two-state quantum systems, Phys. Rev. A 58
1998
Earlier work this paper cites.
G. Nemhauser and L. Wolsey, Integer and Combinatorial Optimization (John Wiley & Sons, Inc., 1999)
1999
Earlier work this paper cites.
L. Viola, E. Knill, and S. Lloyd, Dynamical Decoupling of Open Quantum Systems, Phys. Rev. Lett. 82
1999
Earlier work this paper cites.
A. Jain and S. Meeran, Deterministic job-shop scheduling: Past, present and future, European Journal of Operational Research 113
1999
Earlier work this paper cites.
P. Giorda, P. Zanardi, and S. Lloyd, Universal quantum control in irreducible state-space sectors: Application to bosonic and spin-boson systems, Phys. Rev. A 68
2003
Earlier work this paper cites.
S. Mertens, The Easiest Hard Problem: Number Partitioning, arXiv:cond-mat/0310317 (2003)
2003
Earlier work this paper cites.
D. Marx, Graph colouring problems and their applications in scheduling, Period. Polytech. Electr. Eng. 48
2004
Earlier work this paper cites.
N. Hansen, The CMA Evolution Strategy: A Comparing Review, in Towards a New Evolutionary Computation. Studies in Fuzziness and Soft Computing , Vol. 192, edited by Lozano, Larrañaga, Inza, and Bengoetxea (2006)
2006
Earlier work this paper cites.
D.-S. Chen, R. G. Batson, and Y. Dang, Applied Integer Programming: Modeling and Solution (John Wiley & Sons, Inc., 2009)
2009
Earlier work this paper cites.
R. E. Korf, Objective functions for multi-way number partitioning, in Third Annual Symposium on Combinatorial Search (2010)
2010
Earlier work this paper cites.
O. Titiloye and A. Crispin, Graph coloring with a distributed hybrid quantum annealing algorithm, in Agent and Multi-Agent Systems: Technologies and Applications , edited by J. O’Shea, N. T. Nguyen, K. Crockett, R. J. Howlett, and L. C. Jain (Springer Berlin Heidelberg, 2011) pp. 553–562
2011
Earlier work this paper cites.
E. Mezura-Montes and C. A. Coello Coello, Constraint-handling in nature-inspired numerical optimization: Past, present and future, Swarm and Evolutionary Computation 1
2011
Earlier work this paper cites.
2012
Earlier work this paper cites.
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. Dogra, Arvind, and K. Dorai, Determining the parity of a permutation using an experimental nmr qutrit, Phys. Let. A 378
2014
Earlier work this paper cites.
Y. N. Dauphin, R. Pascanu, C. Gulcehre, K. Cho, S. Ganguli, and Y. Bengio, Identifying and attacking the saddle point problem in high-dimensional non-convex optimization, in Proceedings of the 27th International Conference on Neural Information Processing Systems - Volume 2 , NIPS’14 (MIT Press, Cambridge, MA, USA, 2014) p. 2933–2941
2014
Earlier work this paper cites.
H. Strobel, W. Muessel, D. Linnemann, T. Zibold, D. B. Hume, L. Pezzè, A. Smerzi, and M. K. Oberthaler, Fisher information and entanglement of non-Gaussian spin states, Science 345
2014
Cited alongside, same era.
A. Choromanska, M. Henaff, M. Mathieu, G. Ben Arous, and Y. LeCun, The Loss Surfaces of Multilayer Networks, in Proceedings of the Eighteenth International Conference on Artificial Intelligence and Statistics , Proceedings of Machine Learning Research, Vol. 38, edited by G. Lebanon and S. V. N. Vishwanathan (PMLR, San Diego, California, USA, 2015) pp. 192–204
2015
Cited alongside, same era.
P. Hauke, L. Bonnes, M. Heyl, and W. Lechner, Probing entanglement in adiabatic quantum optimization with trapped ions, Frontiers in Physics 3
2015
Cited alongside, same era.
R. L. Rardin, Optimization in operations research , 2nd ed. (Pearson, Upper Saddle River, NJ, 2016)
2016
Cited alongside, same era.
W. Lavrijsen, A. Tudor, J. Müller, C. Iancu, and W. de Jong, Classical optimizers for noisy intermediate-scale quantum devices, in 2020 IEEE International Conference on Quantum Computing and Engineering (QCE) (2020) pp. 267–277
2020
Later among the works it 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, Phys. Rev. X 10
2020
Later among the works it cites.
Y. Wang, Z. Hu, B. C. Sanders, and S. Kais, Qudits and High-Dimensional Quantum Computing, Frontiers in Physics 8
2020
Later among the works it cites.
M. Willsch, D. Willsch, F. Jin, H. D. Raedt, and K. Michielsen, Benchmarking the quantum approximate optimization algorithm, Quantum Information Processing 19
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2016
Cited alongside, same era.
2016
Cited alongside, same era.
R. Vujanic, P. Esfahani, P. Goulart, S. Mariethoz, and M. Morari, A decomposition method for large scale milps, with performance guarantees and a power system application, Automatica 67
2016
Cited alongside, same era.
W.-Y. Ku and J. C. Beck, Mixed integer programming models for job shop scheduling: A computational analysis, Computers and Operations Research 73
2016
Cited alongside, same era.
Z. W. Zhang Jiang, Eleanor G. Rieffel, Near-optimal quantum circuit for grover’s unstructured search using a transverse field, Phy. Rev. A 95
2017
Cited alongside, same era.
J. Han, J. Park, and K. Lee, Optimal scheduling for electric vehicle charging under variable maximum charging power, Energies 10
2017
Cited alongside, same era.
G. Cornuéjols, J. Peña, and R. Tütüncü, Optimization Methods in Finance , 2nd ed. (Cambridge University Press, 2018)
2018
Cited alongside, same era.
S. Lloyd, Quantum approximate optimization is computationally universal, arXiv:1812.11075 (2018)
2018
Cited alongside, same era.
2020
Later among the works it cites.
2020
Later among the works it cites.
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
Later among the works it cites.
C. Moussa, H. Calandra, and V. Dunjko, To quantum or not to quantum: towards algorithm selection in near-term quantum optimization, Quantum Science and Technology 5
2020
Later among the works it cites.
2021
Later among the works it cites.
2021
Later among the works it cites.
J. R. McClean, M. P. Harrigan, M. Mohseni, N. C. Rubin, Z. Jiang, S. Boixo, V. N. Smelyanskiy, R. Babbush, and H. Neven, Low-depth mechanisms for quantum optimization, PRX Quantum 2
2021
Later among the works it cites.
2021
Later among the works it cites.
2021
Later among the works it cites.
A. Morvan, V. V. Ramasesh, M. S. Blok, J. Kreikebaum, K. O’Brien, L. Chen, B. K. Mitchell, R. K. Naik, D. I. Santiago, and I. Siddiqi, Qutrit randomized benchmarking, Phys. Rev. Let. 126
2021
Later among the works it cites.
S. R. Cohen and J. D. Thompson, Quantum computing with circular rydberg atoms, PRX Quantum 2
2021
Later among the works it cites.
V. Kasper, D. González-Cuadra, A. Hegde, A. Xia, A. Dauphin, F. Huber, E. Tiemann, M. Lewenstein, F. Jendrzejewski, and P. Hauke, Universal quantum computation and quantum error correction with ultracold atomic mixtures, Quantum Science and Technology 7
2021
Later among the works it cites.
A. Periwal, E. S. Cooper, P. Kunkel, J. F. Wienand, E. J. Davis, and M. Schleier-Smith, Programmable interactions and emergent geometry in an array of atom clouds, Nature (London) 600
2021
Later among the works it cites.
J. C. Halimeh, H. Lang, J. Mildenberger, Z. Jiang, and P. Hauke, Gauge-symmetry protection using single-body terms, PRX Quantum 2
2021
Later among the works it cites.
Dalyac, Constantin, Henriet, Loïc, Jeandel, Emmanuel, Lechner, Wolfgang, Perdrix, Simon, Porcheron, Marc, and Veshchezerova, Margarita, Qualifying quantum approaches for hard industrial optimization problems. a case study in the field of smart-charging of electric vehicles, EPJ Quantum Technol. 8
2021
Later among the works it cites.
G. Anikeeva, O. Marković, V. Borish, J. A. Hines, S. V. Rajagopal, E. S. Cooper, A. Periwal, A. Safavi-Naeini, E. J. Davis, and M. Schleier-Smith, Number partitioning with grover’s algorithm in central spin systems, PRX Quantum 2
2021
Later among the works it cites.
S. Yarkoni, E. Raponi, T. Bäck, and S. Schmitt, Quantum Annealing for Industry Applications: Introduction and Review, Reports on Progress in Physics 85
2022
Closest in time.
M. Shibata, https://github.com/CyberAgentAILab/cmaes (2022)
2022
Closest in time.