3 papers
quant-ph2026
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…
quant-ph2026
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…
cs.CL2025
QCoder Benchmark: Bridging Language Generation and Quantum Hardware through Simulator-Based Feedback
Taku Mikuriya, Tatsuya Ishigaki, Masayuki Kawarada +9
Large language models (LLMs) have increasingly been applied to automatic programming code generation. This task can be viewed as a language generation task that bridges natural lan…