Fetching the paper…
Reading the bibliography…
Combinatorial optimization on near-term quantum devices is a promising path to demonstrating quantum advantage.
1903
Earlier work this paper cites.
1906
Earlier work this paper cites.
1907
Earlier work this paper cites.
1908
Earlier work this paper cites.
1909
Earlier work this paper cites.
1910
Earlier work this paper cites.
1912
Earlier work this paper cites.
R. J. Bartlett, S. A. Kucharski, and J. Noga, “Alternative coupled-cluster ansätze ii. the unitary coupled-cluster method,” Chemical physics letters , vol. 155, no. 1, pp. 133–140, 1989. [Online]. Available: https://doi.org/10.1016/S0009-2614(89)87372-5
1989
Earlier work this paper cites.
M. J. Powell, “A direct search optimization method that models the objective and constraint functions by linear interpolation,” in Advances in optimization and numerical analysis . Springer, 1994, pp. 51–67. [Online]. Available: https://doi.org/10.1007/978-94-015-8330-5_4
1994
Earlier work this paper cites.
M. J. D. Powell, “Direct search algorithms for optimization calculations,” Acta Numerica , vol. 7, pp. 287–336, Jan. 1998. [Online]. Available: https://doi.org/10.1017/S0962492900002841
1998
Earlier work this paper cites.
H. Jeong, B. Tombor, R. Albert, Z. N. Oltvai, and A.-L. Barabási, “The large-scale organization of metabolic networks,” Nature , vol. 407, no. 6804, pp. 651–654, 2000. [Online]. Available: https://doi.org/10.1038/35036627
2000
Earlier work this paper cites.
2001
Earlier work this paper cites.
E. Jones, T. Oliphant, P. Peterson et al. , “SciPy: Open source scientific tools for Python,” 2001–, [Online.]. [Online]. Available: http://www.scipy.org/
2001
Earlier work this paper cites.
2005
Earlier work this paper cites.
2005
Earlier work this paper cites.
2006
Earlier work this paper cites.
M. E. Newman, “Modularity and community structure in networks,” Proceedings of the national academy of sciences , vol. 103, no. 23, pp. 8577–8582, 2006. [Online]. Available: https://doi.org/10.1073/pnas.0601602103
2006
Earlier work this paper cites.
U. Brandes, D. Delling, M. Gaertler, R. Görke, M. Hoefer, Z. Nikoloski, and D. Wagner, “Maximizing modularity is hard,” arXiv preprint arXiv:physics/0608255 , 2006. [Online]. Available: https://arxiv.org/abs/physics/0608255
2006
Earlier work this paper cites.
2007
Earlier work this paper cites.
2007
Earlier work this paper cites.
2007
Earlier work this paper cites.
2008
Earlier work this paper cites.
2008
Earlier work this paper cites.
2009
Earlier work this paper cites.
2010
Earlier work this paper cites.
2010
Earlier work this paper cites.
M. C. Nascimento and A. C. De Carvalho, “Spectral methods for graph clustering–a survey,” European Journal of Operational Research , vol. 211, no. 2, pp. 221–231, 2011. [Online]. Available: https://doi.org/10.1016/j.ejor.2010.08.012
2010
Earlier work this paper cites.
2011
Cited alongside, same era.
2011
Cited alongside, same era.
P. Erdös and A. Rényi, “On the evolution of random graphs,” in The structure and dynamics of networks . Princeton University Press, 2011, pp. 38–82. [Online]. Available: https://doi.org/10.1515/9781400841356.38
2011
Cited alongside, same era.
2011
Cited alongside, same era.
G. Nannicini, “Performance of hybrid quantum-classical variational heuristics for combinatorial optimization,” Physical Review E , vol. 99, no. 1, p. 013304, 2019. [Online]. Available: https://doi.org/10.1103/PhysRevE.99.013304
2019
Later among the works it cites.
S. Khairy, R. Shaydulin, L. Cincio, Y. Alexeev, and P. Balaprakash, “Learning to optimize variational quantum circuits to solve combinatorial problems,” Proceedings of the Thirty-Forth AAAI Conference on Artificial Intelligence (AAAI-20) , 2019. [Online]. Available: https://doi.org/10.1609/aaai.v34i03.5616
2019
Later among the works it cites.
H. R. Grimsley, S. E. Economou, E. Barnes, and N. J. Mayhall, “An adaptive variational algorithm for exact molecular simulations on a quantum computer,” Nature communications , vol. 10, no. 1, pp. 1–9, 2019. [Online]. Available: https://doi.org/10.1038/s41467-019-10988-2
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2011
Cited alongside, same era.
2012
Cited alongside, same era.
2012
Cited alongside, same era.
2014
Cited alongside, same era.
A. Peruzzo, J. McClean, P. Shadbolt, M.-H. Yung, X.-Q. Zhou, P. J. Love, A. Aspuru-Guzik, and J. L. O’brien, “A variational eigenvalue solver on a photonic quantum processor,” Nature communications , vol. 5, p. 4213, 2014. [Online]. Available: https://doi.org/10.1038/ncomms5213
2014
Cited alongside, same era.
R. Orús, “A practical introduction to tensor networks: Matrix product states and projected entangled pair states,” Annals of Physics , vol. 349, pp. 117–158, 2014. [Online]. Available: https://doi.org/10.1016/j.aop.2014.06.013
2014
Cited alongside, same era.
A. Buluç, H. Meyerhenke, I. Safro, P. Sanders, and C. Schulz, “Recent advances in graph partitioning,” Algorithm engineering , pp. 117–158, 2016. [Online]. Available: https://doi.org/10.1007/978-3-319-49487-6_4
2016
Cited alongside, same era.
A. M. Niklasson, S. M. Mniszewski, C. F. Negre, M. J. Cawkwell, P. J. Swart, J. Mohd-Yusof, T. C. Germann, M. E. Wall, N. Bock, E. H. Rubensson et al. , “Graph-based linear scaling electronic structure theory,” The Journal of Chemical Physics , vol. 144, no. 23, p. 234101, 2016. [Online]. Available: https://doi.org/10.1063/1.4952650
2016
Cited alongside, same era.
2019
Later among the works it cites.
R. Shaydulin, H. Ushijima-Mwesigwa, I. Safro, S. Mniszewski, and Y. Alexeev, “Network community detection on small quantum computers,” Advanced Quantum Technologies , vol. 2, no. 9, p. 1900029, 2019. [Online]. Available: https://dx.doi.org/10.1002/qute.201900029
2019
Later among the works it cites.
A. Kandala, K. Temme, A. D. Córcoles, A. Mezzacapo, J. M. Chow, and J. M. Gambetta, “Error mitigation extends the computational reach of a noisy quantum processor,” Nature , vol. 567, no. 7749, pp. 491–495, 2019. [Online]. Available: https://doi.org/10.1038/s41586-019-1040-7
2019
Later among the works it cites.
M. Ganzhorn, D. Egger, P. Barkoutsos, P. Ollitrault, G. Salis, N. Moll, M. Roth, A. Fuhrer, P. Mueller, S. Woerner, I. Tavernelli, and S. Filipp, “Gate-efficient simulation of molecular eigenstates on a quantum computer,” Phys. Rev. Applied , vol. 11, p. 044092, Apr 2019. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevApplied.11.044092
2019
Later among the works it cites.
“Qiskit: An open-source framework for quantum computing,” 2019. [Online]. Available: https://doi.org/10.5281/zenodo.2562111
2019
Later among the works it cites.
S. Hudson, J. Larson, S. M. Wild, and D. Bindel, “libEnsemble users manual,” 2019. [Online]. Available: https://buildmedia.readthedocs.org/media/pdf/libensemble/latest/libensemble.pdf
2019
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,” Physical Review X , vol. 10, no. 2, p. 021067, 2020. [Online]. Available: https://doi.org/10.1103/PhysRevX.10.021067
2020
Later among the works it cites.
P. K. Barkoutsos, G. Nannicini, A. Robert, I. Tavernelli, and S. Woerner, “Improving variational quantum optimization using CVaR,” Quantum , vol. 4, p. 256, Apr. 2020. [Online]. Available: https://doi.org/10.22331/q-2020-04-20-256
2020
Later among the works it cites.
C. F. Negre, H. Ushijima-Mwesigwa, and S. M. Mniszewski, “Detecting multiple communities using quantum annealing on the D-Wave system,” Plos one , vol. 15, no. 2, p. e0227538, 2020. [Online]. Available: https://doi.org/10.1371/journal.pone.0227538
2020
Later among the works it cites.
B. T. Gard, L. Zhu, G. S. Barron, N. J. Mayhall, S. E. Economou, and E. Barnes, “Efficient symmetry-preserving state preparation circuits for the variational quantum eigensolver algorithm,” npj Quantum Information , vol. 6, no. 1, pp. 1–9, 2020. [Online]. Available: https://doi.org/10.1038/s41534-019-0240-1
2020
Later among the works it cites.
I. G. Ryabinkin, R. A. Lang, S. N. Genin, and A. F. Izmaylov, “Iterative Qubit Coupled Cluster Approach with Efficient Screening of Generators,” Journal of Chemical Theory and Computation , vol. 16, no. 2, pp. 1055–1063, 2020. [Online]. Available: https://doi.org/10.1021/acs.jctc.9b01084
2020
Later among the works it cites.
R. A. Lang, I. G. Ryabinkin, and A. F. Izmaylov, “Unitary transformation of the electronic hamiltonian with an exact quadratic truncation of the baker-campbell-hausdorff expansion,” Journal of Chemical Theory and Computation , vol. 17, no. 1, pp. 66–78, 2020. [Online]. Available: https://doi.org/10.1021/acs.jctc.0c00170
2020
Later among the works it cites.
D. Claudino, J. Wright, A. J. McCaskey, and T. S. Humble, “Benchmarking adaptive variational quantum eigensolvers,” Frontiers in Chemistry , vol. 8, p. 1152, 2020. [Online]. Available: https://www.frontiersin.org/article/10.3389/fchem.2020.606863
2020
Later among the works it cites.
Y. S. Yordanov, D. R. M. Arvidsson-Shukur, and C. H. W. Barnes, “Efficient quantum circuits for quantum computational chemistry,” Physical Review A , vol. 102, no. 6, 2020. [Online]. Available: https://doi.org/10.1103/PhysRevA.102.062612
2020
Later among the works it cites.
2021
Closest in time.
2021
Closest in time.
H. Ushijima-Mwesigwa, R. Shaydulin, C. F. Negre, S. M. Mniszewski, Y. Alexeev, and I. Safro, “Multilevel combinatorial optimization across quantum architectures,” ACM Transactions on Quantum Computing , vol. 2, no. 1, pp. 1–29, 2021. [Online]. Available: https://doi.org/10.1145/3425607
2021
Closest in time.
H. L. Tang, V. Shkolnikov, G. S. Barron, H. R. Grimsley, N. J. Mayhall, E. Barnes, and S. E. Economou, “Qubit-ADAPT-VQE: An Adaptive Algorithm for Constructing Hardware-Efficient Ansätze on a Quantum Processor,” PRX Quantum , vol. 2, no. 2, p. 020310, 2021. [Online]. Available: https://doi.org/10.1103/PRXQuantum.2.020310
2021
Closest in time.
N. Moll, P. Barkoutsos, L. S. Bishop, J. M. Chow, A. Cross, D. J. Egger, S. Filipp, A. Fuhrer, J. M. Gambetta, M. Ganzhorn et al. , “Quantum optimization using variational algorithms on near-term quantum devices,” Quantum Science and Technology , vol. 3, no. 3, p. 030503, 2018. [Online]. Available: https://iopscience.iop.org/article/10.1088/2058-9565/aab822/meta
2058
Closest in time.
M. Cerezo and P. J. Coles, “Higher order derivatives of quantum neural networks with barren plateaus,” Quantum Science and Technology , vol. 6, no. 3, p. 035006, 2021. [Online]. Available: https://iopscience.iop.org/article/10.1088/2058-9565/abf51a/pdf
2058
Closest in time.
M. Streif and M. Leib, “Training the quantum approximate optimization algorithm without access to a quantum processing unit,” Quantum Science and Technology , vol. 5, no. 3, p. 034008, May 2020. [Online]. Available: https://doi.org/10.1088/2058-9565/ab8c2b
2058
Closest in time.
J. Romero, R. Babbush, J. R. McClean, C. Hempel, P. J. Love, and A. Aspuru-Guzik, “Strategies for quantum computing molecular energies using the unitary coupled cluster ansatz,” Quantum Science and Technology , vol. 4, no. 1, p. 014008, 2018. [Online]. Available: https://iopscience.iop.org/article/10.1088/2058-9565/aad3e4
2058
Closest in time.
S. Sim, J. Romero, J. F. Gonthier, and A. A. Kunitsa, “Adaptive pruning-based optimization of parameterized quantum circuits,” Quantum Science and Technology , vol. 6, no. 2, p. 025019, 2021. [Online]. Available: https://iopscience.iop.org/article/10.1088/2058-9565/abe107/pdf
2058
Closest in time.