F. Le Gall. Average-case quantum advantage with shallow circuits. in Proceedings of the 34th Computational Complexity Conference, 2019, pp. 21:1-21:20.
[2]
F. Le Gall. Powers of tensors and fast matrix multiplication. in Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, 2014, pp. 296–303.
[3]
F. Le Gall. Improved quantum algorithm for triangle finding via combinatorial arguments. in Proceedings of the 55th Annual IEEE Symposium on Foundations of Computer Science, 2014, pp. 216–225.
![[DOWNLOAD]](/ja/img/download_x2.jpg){kind=small}
