3 papers
cs.DC2026
Color Complexity of Recolorable Graph Exploration: Upper and Lower Bounds via Block Structure
Shoma Hiraoka, Shunsuke Imori, Shota Takahashi +1
We study exploration of anonymous, port-free graphs by a single agent with no internal memory. To compensate for the lack of memory, the agent uses writable vertex colors as extern…
cs.DC2025
Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors
Shota Takahashi, Haruki Kanaya, Shoma Hiraoka +2
Recently, Böckenhauer, Frei, Unger, and Wehner (SIROCCO 2023) introduced a novel variant of the graph exploration problem in which a single memoryless agent must visit all nodes of…
quant-ph2024
Lazy Qubit Reordering for Accelerating Parallel State-Vector-based Quantum Circuit Simulation
Yusuke Teranishi, Shoma Hiraoka, Wataru Mizukami +2
This paper proposes two quantum operation scheduling methods for accelerating parallel state-vector-based quantum circuit simulation using multiple graphics processing units (GPUs)…