Fetching the paper…
Reading the bibliography…
Architectures for quantum computing based on neutral atoms have risen to prominence as candidates for both near and long-term applications.
L. Banchi, M. Fingerhuth, T. Babej, C. Ing, and J. M. Arrazola, Molecular docking with Gaussian Boson Sampling, Science Advances 6
1902
Earlier work this paper cites.
R. M. Karp, Reducibility among combinatorial problems, in Complexity of Computer Computations: Proceedings of a symposium on the Complexity of Computer Computations , edited by R. E. Miller, J. W. Thatcher, and J. D. Bohlinger (Springer US, Boston, MA, 1972) pp. 85–103
1972
Earlier work this paper cites.
F. S. Kuhl, G. M. Crippen, and D. K. Friesen, A combinatorial algorithm for calculating ligand binding, Journal of Computational Chemistry 5
1984
Earlier work this paper cites.
F. P. Kelly, Loss Networks, The Annals of Applied Probability 1
1991
Earlier work this paper cites.
G. Louth, M. Mitzenmacher, and F. Kelly, Computational complexity of loss networks, Theoretical Computer Science 125
1994
Earlier work this paper cites.
R. Eberhart and J. Kennedy, A new optimizer using particle swarm theory, MHS’95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science MHS-95, 10.1109/mhs.1995.494215
1995
Earlier work this paper cites.
D. A. Gschwend, A. C. Good, and I. D. Kuntz, Molecular docking towards drug discovery, Journal of Molecular Recognition: An Interdisciplinary Journal 9
1996
Earlier work this paper cites.
P. K. Agarwal, M. van Kreveld, and S. Suri, Label placement by maximum independent set in rectangles, Computational Geometry 11
1998
Earlier work this paper cites.
J. Håstad, Clique is hard to approximate within n 1 − ϵ n^{1-\epsilon} , Acta Mathematica 182
1999
Earlier work this paper cites.
I. M. Bomze, M. Budinich, P. M. Pardalos, and M. Pelillo, The maximum clique problem, in Handbook of combinatorial optimization (Springer, 1999) pp. 1–74
1999
Earlier work this paper cites.
S. Butenko, Maximum independent set and related problems, with applications (University of Florida, 2003)
2003
Earlier work this paper cites.
S. Eubank, H. Guclu, V. S. Anil Kumar, M. V. Marathe, A. Srinivasan, Z. Toroczkai, and N. Wang, Modelling disease outbreaks in realistic urban social networks, Nature 429
2004
Earlier work this paper cites.
R. Fisman and S.-J. Wei, Tax rates and tax evasion: Evidence from “missing imports” in china, Journal of Political Economy 112
2004
Earlier work this paper cites.
V. Boginski, S. Butenko, and P. M. Pardalos, Statistical analysis of financial networks, Computational Statistics & Data Analysis 48
2005
Earlier work this paper cites.
A. Schrijver, On the history of combinatorial optimization (till 1960), in Discrete Optimization , Handbooks in Operations Research and Management Science, Vol. 12, edited by K. Aardal, G. Nemhauser, and R. Weismantel (Elsevier, 2005) pp. 1–68
2005
Earlier work this paper cites.
S. Butenko and W. Wilhelm, Clique-detection models in computational biochemistry and genomics, European Journal of Operational Research 173
2006
Cited alongside, same era.
W. Wu, H. Du, X. Jia, Y. Li, and S. C.-H. Huang, Minimum connected dominating sets and maximal independent sets in unit disk graphs, Theoretical Computer Science 352
2006
Cited alongside, same era.
A. Bandyopadhyay and D. Gamarnik, Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models, Random Structures and Algorithms 33
2008
Cited alongside, same era.
M. Depolli, J. Konc, K. Rozman, R. Trobec, and D. Janežič, Exact parallel maximum clique algorithm for general and protein graphs, Journal of Chemical Information and Modeling 53
2013
Cited alongside, same era.
T. Albash and D. A. Lidar, Adiabatic quantum computation, Rev. Mod. Phys. 90
2018
Later among the works it cites.
M. H. Amin, E. Andriyash, J. Rolfe, B. Kulchytskyy, and R. Melko, Quantum boltzmann machine, Phys. Rev. X 8
2018
Later among the works it cites.
R. V. A. Gainanov Damir N., Mladenovic NENAD, Maximum independent set in planning freight railway transportation, Frontiers of Engineering Management 5
2018
Later among the works it cites.
H. Levine, A. Keesling, G. Semeghini, A. Omran, T. T. Wang, S. Ebadi, H. Bernien, M. Greiner, V. Vuletić , H. Pichler, and M. D. Lukin, Parallel implementation of high-fidelity multiqubit gates with neutral atoms, Physical Review Letters 123
2019
Later among the works it cites.
C. Gorgulla, A. Boeszoermenyi, Z.-F. Wang, P. D. Fischer, P. W. Coote, K. M. Padmanabha Das, Y. S. Malets, D. S. Radchenko, Y. S. Moroz, D. A. Scott, K. Fackeldey, M. Hoffmann, I. Iavniuk, G. Wagner, and H. Arthanari, An open-source drug discovery platform enables ultra-large virtual screens, Nature 580
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2014
Cited alongside, same era.
G. Aloi, M. Di Felice, V. Loscrì, P. Pace, and G. Ruggeri, Spontaneous smartphone networks as a user-centric solution for the future internet, IEEE Communications Magazine 52
2014
Cited alongside, same era.
A. Barvinok, Theory of Computing 11
2015
Cited alongside, same era.
R. Pastor-Satorras, C. Castellano, P. Van Mieghem, and A. Vespignani, Epidemic processes in complex networks, Rev. Mod. Phys. 87
2015
Cited alongside, same era.
J. F. Monserrat, G. Mange, V. Braun, H. Tullberg, G. Zimmermann, and Ömer Bulakci, METIS research advances towards the 5g mobile and wireless system definition, EURASIP Journal on Wireless Communications and Networking 2015
2015
Cited alongside, same era.
I. Florescu, M. C. Mariani, H. E. Stanley, and F. G. Viens, Handbook of high-frequency trading and modeling in finance , Vol. 9 (John Wiley & Sons, 2016)
2016
Cited alongside, same era.
2016
Cited alongside, same era.
2017
Cited alongside, same era.
2020
Later among the works it cites.
F. Flachsenberg, A. Meyder, K. Sommer, P. Penner, and M. Rarey, A consistent scheme for gradient-based optimization of protein–ligand poses, Journal of Chemical Information and Modeling 60
2020
Later among the works it cites.
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
Later among the works it cites.
D. S. Wild, D. Sels, H. Pichler, C. Zanoci, and M. D. Lukin, Quantum sampling algorithms for near-term devices, Physical Review Letters 127
2021
Later among the works it cites.
M. Streif, S. Yarkoni, A. Skolik, F. Neukart, and M. Leib, Beating classical heuristics for the binary paint shop problem with the quantum approximate optimization algorithm, Physical Review A 104
2021
Later among the works it cites.
S. Ebadi, A. Keesling, M. Cain, T. T. Wang, H. Levine, D. Bluvstein, G. Semeghini, A. Omran, J.-G. Liu, R. Samajdar, X.-Z. Luo, B. Nash, X. Gao, B. Barak, E. Farhi, S. Sachdev, N. Gemelke, L. Zhou, S. Choi, H. Pichler, S.-T. Wang, M. Greiner, V. Vuletic, and M. D. Lukin, Quantum optimization of maximum independent set using rydberg atom arrays, Science 0
2022
Closest in time.
X. Gao, E. R. Anschuetz, S.-T. Wang, J. I. Cirac, and M. D. Lukin, Enhancing generative models via quantum correlations, Physical Review X 12
2022
Closest in time.
B. Alberts, R. Heald, A. Johnson, D. Morgan, M. Raff, K. Roberts, and P. Walter, Molecular Biology of the Cell: Seventh International Student Edition with Registration Card (WW Norton & Company, 2022)
2022
Closest in time.
2023
Closest in time.
M.-T. Nguyen, J.-G. Liu, J. Wurtz, M. D. Lukin, S.-T. Wang, and H. Pichler, Quantum optimization with arbitrary connectivity using rydberg atom arrays, PRX Quantum 4
2023
Closest in time.