4 citations · 4 across the 6 of their papers we have counts for
4 papers · 2 filters
Solving Differential Equations Using Continuous-Variable Quantum Annealing
Kazuki Miyanishi, Soshun Naito, Asuka Koura +3
Most existing quantum annealing approaches are formulated for qubit-based architectures. Consequently, applying them to continuous-variable optimization problems requires discretiz…
Efficient equivalence checking of Clifford-U circuits with shared single-qubit unitaries
Daisuke Sakamoto, Soshun Naito, Yusei Mori +1
Quantum circuit equivalence checking asks whether two circuits implement the same unitary. It guarantees compiler correctness and safe optimization, yet most existing approaches sc…
Sparse QUBO Formulation for Efficient Embedding via Network-Based Decomposition of Equality and Inequality Constraints
Kohei Suda, Soshun Naito, Yoshihiko Hasegawa
Quantum annealing is a promising approach for solving combinatorial optimization problems. However, its performance is often limited by the overhead of additional qubits required f…
Network-Based Quantum Computing: an efficient design framework for many-small-node distributed fault-tolerant quantum computing
Soshun Naito, Yasunari Suzuki, Yuuki Tokunaga
In fault-tolerant quantum computing, a large number of physical qubits are required to construct a single logical qubit, and a single quantum node may be able to hold only a small…