HKHideyuki Kawashima

Hideyuki Kawashima

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Hideyuki Kawashima has a total of 8 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Two-Step Quantum Search Algorithm for Solving Traveling Salesman Problems

    by Rei Sato, Cui Gordon, Kazuhiro Saito, Hideyuki Kawashima, Tetsuro Nikuni, Shohei Watabe

    Quantum search algorithms, such as Grover's algorithm, are anticipated to efficiently solve constrained combinatorial optimization problems. However, applying these algorithms to the traveling salesman problem (TSP) on a quantum circuit presents a significant challenge. Existing quantum search algorithms for the TSP typically assume that an initial state—an equal superposition of all feasible solutions satisfying the problem's constraints—is pre-prepared. The query complexity of preparing this state using brute-force methods scales exponentially with the factorial growth of feasible solutions, creating a significant hurdle in designing quantum circuits for large-scale TSPs. To address this issue, we propose a two-step quantum search (TSQS) algorithm that employs two sets of operators. In the first step, all the feasible solutions are amplified into their equal superposition state. In the second step, the optimal solution state is amplified from this superposition state. The TSQS algorithm demonstrates greater efficiency compared to conventional search algorithms that employ a single oracle operator for finding a solution within the encoded space. Encoded in the higher-order unconstrained binary optimization (HOBO) representation, our approach significantly reduces the qubit requirements. This enables efficient initial state preparation through a unified circuit design, offering a quadratic speedup in solving the TSP without prior knowledge of feasible solutions.


  • Open Access

    WoundDie: Concurrency Control Protocol with Lightweight Priority Control

    by Kodai Doki, Takashi Hoshino, Hideyuki Kawashima

    Recent concurrency control protocols for database transactions employ priority control to deliver predictable latency. Conventional protocols either require complex data structures or provide incomplete priority control that has a parameter and does not ensure starvation-freedom. To address this issue, we propose a new protocol, WoundDie, which ensures starvation-freedom without parameters. Unlike conventional starvation-free protocols, it does not require complex data structures for locking, making it memory-efficient and easy to implement. Experimental results demonstrated that under a high contention workload, WoundDie exhibited tail latency that was 6.5 times lower than Polaris's best case and 80 times lower than its worst case.