8 citations · 15 across the 7 of their papers we have counts for
7 papers
Risk-Averse Best Arm Set Identification with Fixed Budget and Fixed Confidence
Shunta Nonaga, Koji Tabata, Yuta Mizuno +1
Decision making under uncertain environments in the maximization of expected reward while minimizing its risk is one of the ubiquitous problems in many subjects. Here, we introduce…
Enumeration algorithms for combinatorial problems using Ising machines: When should we stop exploring energy landscapes?
Yuta Mizuno, Mohammad Ali, Tamiki Komatsuzaki
Combinatorial problems such as combinatorial optimization and constraint satisfaction problems arise in decision-making across various fields of science and technology. In real-wor…
Can Constrained Quantum Annealing Be Effective in Noisy Quantum Annealers?
Ryoya Igata, Myonsok I, Yuya Seki +2
We investigate the performance of penalty-based quantum annealing (PQA) and constrained quantum annealing (CQA) in solving the graph partitioning problem under various noise models…
Low-Dimensional Projection of Reactive Islands in Chemical Reaction Dynamics Using a Supervised Dimensionality Reduction Method
Ryoichi Tanaka, Yuta Mizuno, Takuro Tsutsumi +3
Transition state theory is a standard framework for predicting the rate of a chemical reaction. Although the transition state theory has been successfully applied to numerous chemi…
A Quantum Algorithm for Dynamic Mode Decomposition Integrated with a Quantum Differential Equation Solver
Yuta Mizuno, Tamiki Komatsuzaki
We present a quantum algorithm that analyzes time series data simulated by a quantum differential equation solver. The proposed algorithm is a quantum version of the dynamic mode d…
Finding Optimal Pathways in Chemical Reaction Networks Using Ising Machines
Yuta Mizuno, Tamiki Komatsuzaki
Finding optimal pathways in chemical reaction networks is essential for elucidating and designing chemical processes, with significant applications such as synthesis planning and m…
A Note on Enumeration by Fair Sampling
Yuta Mizuno, Tamiki Komatsuzaki
This note describes an algorithm for enumerating all the elements in a finite set based on uniformly random sampling from the set. This algorithm can be used for enumeration by fai…