Science, volume 14, pages 636-647, 2012. URL https://hal.archives-ouvertes.fr/hal-00678197.
[3] I. Anagnostides, C. Daskalakis, G. Farina, M. Fishelson, N. Golowich, and T. Sandholm. Near-optimal no-regret learning for correlated equilibria in multi-player general-sum games. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, pages 736-749, 2022. URL https://doi.org/10.1145/3519935.3520031.
[4] S. Arora, E. Hazan, and S. Kale. The multiplicative weights update method: a meta-algorithm and applications. Theory of Computing, 8(6):121-164, 2012. URL https://doi.org/10.4086/toc.2012.v008a006.
[5] D. W. Berry, A. M. Childs, R. Cleve, R. Kothari, and R. D. Somma. Simulating Hamiltonian dynamics with a truncated Taylor series. Physical Review Letters, 114(9):090502, 2015. URL https://doi.org/10.1103/PhysRevLett.114.090502.
[6] A. Bouland, Y. M. Getachew, Y. Jin, A. Sidford, and K. Tian. Quantum speedups for zero-sum games via improved dynamic Gibbs sampling. In Proceedings of the 40th International Conference on Machine Learning, volume 202, pages 2932-2952, 2023. URL https://proceedings.mlr.press/v202/bouland23a.html.
[7] F. G. Brandão and K. M. Svore. Quantum speed-ups for solving semidefinite programs. In Proceedings of the 58th Annual Symposium on Foundations of Computer Science, pages 415-426, 2017. URL https://doi.org/10.1109/FOCS.2017.45.
[8] F. G. S. L. Brandão, A. Kaleb, T. Li, C. Y.-Y. Lin, K. M. Svore, and X. Wu. Quantum SDP solvers: Large speed-ups, optimality, and applications to quantum learning. In Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, volume 132, pages 27:1-27:14, 2019. URL https://doi.org/10.4230/LIPics.ICALP.2019.27.
[9] G. Brassard, P. Høyer, M. Mosca, and A. Tapp. Quantum amplitude amplification and estimation. Quantum Computation and Information, 305:53-74, 2002. URL https://doi.org/10.1090/conm/305/05215.
[10] Y. Carmon, Y. Jin, A. Sidford, and K. Tian. Variance reduction for matrix games. In Advances in Neural Information Processing Systems, volume 32, pages 11377-11388, 2019. URL https://proceedings.neurips.cc/paper/2019/file/6c442e0e996fa84f344a14927703a8c1-Paper.pdf.
[11] N. Cesa-Bianchi and G. Lugosi. Prediction, Learning, and Games. Cambridge University Press, 2006. URL https://doi.org/10.1017/CBO9780511546921.
[12] X. Chen and X. Deng. Settling the complexity of two-player nash equilibrium. In Proceedings of the 47th Annual Symposium on Foundations of Computer Science, pages 261-272, 2006. URL https://doi.org/10.1109/FOCS.2006.69.
[13] X. Chen, E. Hazan, T. Li, Z. Lu, X. Wang, and R. Yang. Adaptive online learning of quantum states, 2022. URL https://arxiv.org/abs/2206.00220.
[14] Y. Chen and X. Wang. More practical and adaptive algorithms for online quantum state learning, 2020. URL https://arxiv.org/abs/2006.01013.
[15] A. M. Childs and N. Wiebe. Hamiltonian simulation using linear combinations of unitary operations. Quantum Information and Computation, 12(11-12):901-924, 2012. URL https://doi.org/10.26421/QIC12.11-12-1.
[16] C. Daskalakis, P. W. Goldberg, and C. H. Papadimitriou. The complexity of computing a nash equilibrium. SIAM Journal on Computing, 39(1):195-259, 2009. URL http://epubs.siam.org/doi/10.1137/070699652.
[17] C. Daskalakis, A. Deckelbaum, and A. Kim. Near-optimal no-regret algorithms for zero-sum games. Games and Economic Behavior, 92:327-348, 2015. URL https://doi.org/10.1016/j.geb.2014.01.003.