Publications
Distributed Complexity of $P_k$-freeness: Decision and Certification.
Masayuki Miyamoto
To appear in ISAAC 2025
[arXiv:2410.20353]
Quantum Merlin-Arthur proof systems for synthesizing quantum states.
Hugo Delavenne, François Le Gall, Yupan Liu and Masayuki Miyamoto
Quantum 9, 1688 (2025). [DOI]
[arXiv:2303.01877]
Distributed Merlin-Arthur Synthesis of Quantum States and Its Applications.
François Le Gall, Masayuki Miyamoto and Harumichi Nishimura
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023), pp. 63:1--63:15, 2023. [DOI]
Also presented as a contributed talk at TQC 2023.
[arXiv:2210.01389]
Distributed Quantum Interactive Proofs.
François Le Gall, Masayuki Miyamoto and Harumichi Nishimura
Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023), pp. 42:1–42:21, 2023. [DOI]
Brief announcement in Proceedings of the 36th International Symposium on Distributed Computing (DISC 2022), pp. 48:1–48:3, 2022. [DOI]
[arXiv:2210.01390]
Lower Bounds for Induced Cycle Detection in Distributed Computing.
François Le Gall and Masayuki Miyamoto
Proceedings of the 32nd International Symposium on Algorithms and Computation (ISAAC 2021), pp. 58:1-58:19, 2021. [DOI]
[arXiv:2110.00741]
Quantum Speedup for the Minimum Steiner Tree Problem.
Masayuki Miyamoto, Masakazu Iwamura, Koichi Kise and François Le Gall
Proceedings of the 26th International Computing and Combinatorics Conference (COCOON 2020), pp. 234-245, 2020. [DOI]
Also presented as a poster at AQIS 2019.
[arXiv:1904.03581]