Researcher profile

Yuya Seki

Yuya Seki contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
7works
0followers
5topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

7 published item(s)

preprint2026arXiv

Improving FMQA via Initial Training Data Design Considering Marginal Bit Coverage in One-Hot Encoding

Factorization machine with quadratic-optimization annealing (FMQA) is a black-box optimization method that combines a factorization machine (FM) surrogate with QUBO-based search by an Ising machine. When FMQA is applied to integer or discretized continuous variables via one-hot encoding, uniform random initial sampling can leave many binary variables never active in the initial training data, and the corresponding FM parameters receive no direct gradient updates from the observed responses. We address this by designing the initial training data to achieve complete marginal bit coverage, namely, ensuring that every binary variable obtained by one-hot encoding takes the value one at least once. We use two space-filling sampling methods, Latin hypercube sampling (LHS) and the Sobol' sequence, yielding LHS-FMQA and Sobol'-FMQA. On the human-powered aircraft wing-shape optimization benchmark with 17 and 32 design variables, both proposed methods achieved numerically higher mean final cruising speeds than the baseline FMQA, with the advantage more pronounced on the 32-variable problem.

preprint2022arXiv

Black-box optimization for integer-variable problems using Ising machines and factorization machines

Black-box optimization has potential in numerous applications such as hyperparameter optimization in machine learning and optimization in design of experiments. Ising machines are useful for binary optimization problems because variables can be represented by a single binary variable of Ising machines. However, conventional approaches using an Ising machine cannot handle black-box optimization problems with non-binary values. To overcome this limitation, we propose an approach for integer-variable black-box optimization problems by using Ising/annealing machines and factorization machines in cooperation with three different integer-encoding methods. The performance of our approach is numerically evaluated with different encoding methods using a simple problem of calculating the energy of the hydrogen molecule in the most stable state. The proposed approach can calculate the energy using any of the integer-encoding methods. However, one-hot encoding is useful for problems with a small size.

preprint2021arXiv

Improving the accuracy of the energy estimation by combining quantum annealing with classical computation

Quantum chemistry calculations are important applications of quantum annealing. For practical applications in quantum chemistry, it is essential to estimate a ground state energy of the Hamiltonian with chemical accuracy. However, there are no known methods to guarantee the accuracy of the estimation of the energy calculated by quantum annealing. Here, we propose a way to improve the accuracy of the estimate of the ground state energy by combining quantum annealing with classical computation. In our scheme, before running the QA, we need a pre-estimation of the energies of the ground state and first excited state with some error bars (corresponding to possible estimation error) by performing classical computation with some approximations. We show that, if an expectation value and variance of the energy of the state after the QA are smaller than certain threshold values (that we can calculate from the pre-estimation), the QA provides us with a better estimate of the ground state energy than that of the pre-estimation. Since the expectation value and variance of the energy can be experimentally measurable by the QA, our results pave the way for accurate estimation of the ground state energy with the QA.

preprint2021arXiv

Preparing ground states of the XXZ model using the quantum annealing with inductively coupled superconducting flux qubits

Preparing ground states of Hamiltonians is important in the condensed matter physics and the quantum chemistry. The interaction Hamiltonians typically contain not only diagonal but also off-diagonal elements. Although quantum annealing provides a way to prepare a ground state of a Hamiltonian, we can only use the Hamiltonian with Ising interaction by using currently available commercial quantum annealing devices. In this work, we propose a quantum annealing for the XXZ model, which contains both Ising interaction and energy-exchange interaction, by using inductively coupled superconducting flux qubits. The key idea is to use a recently proposed spin-lock quantum annealing where the qubits are driven by microwave fields. As long as the rotating wave approximation is valid, the inductive coupling between the superconducting flux qubits produces the desired Hamiltonian in the rotating frame, and we can use such an interaction for the quantum annealing while the microwave fields driving play a role of the transverse fields. To quantify the performance of our scheme, we implement numerical simulations, and show that we can prepare ground states of the two-dimensional Heisenberg model with a high fidelity.

preprint2020arXiv

Direct estimation of the energy gap between the ground state and excited state with quantum annealing

Quantum chemistry is one of the important applications of quantum information technology. Especially, an estimation of the energy gap between a ground state and excited state of a target Hamiltonian corresponding to a molecule is essential. In the previous approach, an energy of the ground state and that of the excited state are estimated separately, and the energy gap can be calculated from the subtraction between them. Here, we propose a direct estimation of the energy gap between the ground state and excited state of the target Hamiltonian with quantum annealing. The key idea is to combine a Ramsey type measurement with the quantum annealing. This provides an oscillating signal with a frequency of the energy gap, and a Fourier transform of the signal let us know the energy gap. Based on typical parameters of superconducting qubits, we numerically investigate the performance of our scheme when we estimate an energy gap between the ground state and first excited state of the Hamiltonian. We show robustness against non-adiabatic transitions between the ground state and first-excited state. Our results pave a new way to estimate the energy gap of the Hamiltonian for quantum chemistry.

preprint2020arXiv

Quantum annealing with capacitive-shunted flux qubits

Quantum annealing (QA) provides us with a way to solve combinatorial optimization problems. In the previous demonstration of the QA, a superconducting flux qubit (FQ) was used. However, the flux qubits in these demonstrations have a short coherence time such as tens of nano seconds. For the purpose to utilize quantum properties, it is necessary to use another qubit with a better coherence time. Here, we propose to use a capacitive-shunted flux qubit (CSFQ) for the implementation of the QA. The CSFQ has a few order of magnitude better coherence time than the FQ used in the QA. We theoretically show that, although it is difficult to perform the conventional QA with the CSFQ due to the form and strength of the interaction between the CSFQs, a spin-lock based QA can be implemented with the CSFQ even with the current technology. Our results pave the way for the realization of the practical QA that exploits quantum advantage with long-lived qubits.

preprint2019arXiv

Enhancing quantum annealing performance by a degenerate two-level system

Quantum annealing is an innovative idea and method for avoiding the increase of the calculation cost of the combinatorial optimization problem. Since the combinatorial optimization problems are ubiquitous, quantum annealing machine with high efficiency and scalability will give an immeasurable impact on many fields. However, the conventional quantum annealing machine may not have a high success probability for finding the solution because the energy gap closes exponentially as a function of the system size. To propose an idea for finding high success probability is one of the most important issues. Here we show that a degenerate two-level system provides the higher success probability than the conventional spin-1/2 model in a weak longitudinal magnetic field region. The physics behind this is that the quantum annealing in this model can be reduced into that in the spin-1/2 model, where the effective longitudinal magnetic field may open the energy gap, which suppresses the Landau--Zener tunneling providing leakage of the ground state. We also present the success probability of the $Λ$-type system, which may show the higher success probability than the conventional spin-1/2 model.