[18] C. Daskalakis, A. Ilyas, V. Syrgkanis, and H. Zeng. Training gans with optimism. In Proceedings of the 6th International Conference on Learning Representations, 2018.
[19] C. Durr, M. Heiligman, P. Hoeyer, and M. Mhalla. Quantum query complexity of some graph problems. SIAM Journal on Computing, 35(6):1310-1328, 2006. URL http://doi.org/10.1137/050644719.
[20] A. Gilyén, Y. Su, G. H. Low, and N. Wiebe. Quantum singular value transformation and beyond: Exponential improvements for quantum matrix arithmetics. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pages 193-204, 2019. URL https://doi.org/10.1145/3313276.3316366.
[21] V. Giovannetti, S. Lloyd, and L. Maccone. Quantum random access memory. Physical Review Letters, 100(16):160501, 2008. URL https://doi.org/10.1103/PhysRevLett.100.160501.
[22] M. D. Grigoriadis and L. G. Khachiyan. A sublinear-time randomized approximation algorithm for matrix games. Operations Research Letters, 18(2):53-58, 1995. URL https://doi.org/10.1016/0167-6377(95)00032-0.
[23] L. Grover and T. Rudolph. Creating superpositions that correspond to efficiently integrable probability distributions, 2002. URL http://arxiv.org/abs/quant-ph/0208112.
[24] L. K. Grover. Synthesis of quantum superpositions by quantum computation. Physical Review Letters, 85(6):1334, 2000. URL https://doi.org/10.1103/PhysRevLett.85.1334.
[25] J. Haah. Product decomposition of periodic functions in quantum signal processing. Quantum, 3:190, 2019. URL https://doi.org/10.22331/q-2019-10-07-190.
[26] Y. Hamoudi. Preparing many copies of a quantum state in the black-box model. Physical Review A, 105(6):062440, 2022. URL https://doi.org/10.1103/PhysRevA.105.062440.
[27] M. P. Harrigan, K. J. Sung, M. Neeley, K. J. Satzinger, F. Arute, K. Arya, J. Atalaya, J. C. Bardin, R. Barends, S. Boixo, M. Broughton, B. B. Buckley, D. A. Buell, B. Burkett, N. Bushnell, Y. Chen, Z. Chen, Ben Chiaro, R. Collins, W. Courtney, S. Demura, A. Dunsworth, D. Eppens, A. Fowler, B. Foxen, C. Gidney, M. Giustina, R. Graff, S. Habegger, A. Ho, S. Hong, T. Huang, L. B. Ioffe, S. V. Isakov, E. Jeffrey, Z. Jiang, C. Jones, D. Kafri, K. Kechedzhi, J. Kelly, S. Kim, P. V. Klimov, A. N. Korotkov, F. Kostritsa, D. Landhuis, P. Laptev, M. Lindmark, M. Leib, O. Martin, J. M. Martinis, J. R. McClean, M. McEwen, A. Megrant, X. Mi, M. Mohseni, W. Mruczkiewicz, J. Mutus, O. Naaman, C. Neill, F. Neukart, M. Y. Niu, T. E. O'Brien, B. O'Gorman, E. Ostby, A. Petukhov, H. Putterman, C. Quintana, P. Roushan, N. C. Rubin, D. Sank, A. Skolik, V. Smelyanskiy, D. Strain, M. Streif, M. Szalay, A. Vainsencher, T. White, Z. J. Yao, P. Yeh, A. Zalcman, L. Zhou, H. Neven, D. Bacon, E. Lucero, E. Farhi, and R. Babbush. Quantum approximate optimization of non-planar graph problems on a planar superconducting processor. Nature Physics, 17(3):332-336, 2021. URL https://doi.org/10.1038/s41567-020-01105-y.
[28] A. W. Harrow, A. Hassidim, and S. Lloyd. Quantum algorithm for linear systems of equations. Physical Review Letters, 103(15):150502, 2009. URL https://doi.org/10.1103/PhysRevLett.103.150502.
[29] V. Havlíček, A. D. Córcoles, K. Temme, A. W. Harrow, A. Kandala, J. M. Chow, and J. M. Gambetta. Supervised learning with quantum-enhanced feature spaces. Nature, 567(7747): 209-212, 2019. URL https://doi.org/10.1038/s41586-019-0980-2.
[30] Y.-G. Hsieh, K. Antonakopoulos, and P. Mertikopoulos. Adaptive learning in continuous games: Optimal regret bounds and convergence to nash equilibrium. In Proceedings of the 34th Conference on Learning Theory, volume 134, pages 2388-2422, 2021. URL https://proceedings.mlr.press/v134/hsieh21a.html.