Searcharxiv⌕ Search

arXiv subjects

Masayuki Ohzeki

Publications and source records attributed to Masayuki Ohzeki.

At least 91 records · Page 5Linked to original sources

Exploration of new chemical materials using black-box optimization with the D-wave quantum annealer

In materials informatics, searching for chemical materials with desired properties is challenging due to the vastness of the chemical space. Moreover, the high cost of evaluating properties necessitates a search with a few clues. In practice, there is also a demand for proposing compositions that are easily synthesizable. In the real world, such as in the exploration of chemical materials, it is common to encounter problems targeting black-box objective functions where formalizing the objective function in explicit form is challenging, and the evaluation cost is high. In recent research, a Bayesian optimization method has been proposed to formulate the quadratic unconstrained binary optimization (QUBO) problem as a surrogate model for black-box objective functions with discrete variables. Regarding this method, studies have been conducted using the D-Wave quantum annealer to optimize the acquisition function, which is based on the surrogate model and determines the next exploration point for the black-box objective function. In this paper, we address optimizing a black-box objective function containing discrete variables in the context of actual chemical material exploration. In this optimization problem, we demonstrate results obtaining parameters of the acquisition function by sampling from a probability distribution with variance can explore the solution space more extensively than in the case of no variance. As a result, we found combinations of substituents in compositions with the desired properties, which could only be discovered when we set an appropriate variance.

quant-ph↗

Individual subject evaluated difficulty of adjustable mazes generated using quantum annealing

In this paper, the maze generation using quantum annealing is proposed. We reformulate a standard algorithm to generate a maze into a specific form of a quadratic unconstrained binary optimization problem suitable for the input of the quantum annealer. To generate more difficult mazes, we introduce an additional cost function $Q_{update}$ to increase the difficulty. The difficulty of the mazes was evaluated by the time to solve the maze of 12 human subjects. To check the efficiency of our scheme to create the maze, we investigated the time-to-solution of a quantum processing unit, classical computer, and hybrid solver.

quant-ph↗

Exact solution of free entropy for matrix-valued geometric Brownian motion with non-commutative matrices via the replica method

Geometric Brownian motion (GBM) is a standard model in stochastic differential equations. In this study, we consider a matrix-valued GBM with non-commutative matrices. Introduction of non-commutative matrices into the matrix-valued GBM makes it difficult to obtain an exact solution because the existence of noise terms prevents diagonalization. However, we show that the replica method enables us to overcome this difficulty. We map the trace of the time evolution operator of the matrix-valued GBM with non-commutative matrices into the partition function of the isotropic Lipkin-Meshkov-Glick model used in quantum spin systems. Then, solving the eigenvalue problem of the isotropic Lipkin-Meshkov-Glick model, we obtain an analytical expression of the free entropy. Numerical simulation is consistent with our analytical result. Thus, our expression is the exact solution of the free entropy for the matrix-valued GBM with non-commutative matrices.

cond-mat.stat-mech↗

Hybrid Algorithm of Linear Programming Relaxation and Quantum Annealing

The demand for classical-quantum hybrid algorithms to solve large-scale combinatorial optimization problems using quantum annealing (QA) has increased. One approach involves obtaining an approximate solution using classical algorithms and refining it using QA. In previous studies, such variables were determined using molecular dynamics (MD) as a continuous optimization method. We propose a method that uses the simple continuous relaxation technique called linear programming (LP) relaxation. Our method demonstrated superiority through comparative experiments with the minimum vertex cover problem versus the previous MD-based approach. Furthermore, the hybrid approach of LP relaxation and simulated annealing showed advantages in accuracy and speed compared to solving with simulated annealing alone.

quant-ph↗

Virtual Screening of Chemical Space based on Quantum Annealing

For searching a new chemical material which satisfies the target characteristic value, for example emission wavelength, many cut and trial of experiments/calculations are required since the chemical space is astronomically large (organic molecules generates >10^60 candidates). Extracting feature importance is a method to reduce the chemical space, and limiting the search space to those features leads to shorter development time. Quantum computer can generate sampling data faster than classical computers, and this property is utilized to extract feature importance. In this paper, quantum annealer was used as a sampler to make data for extracting feature importance of material properties. By screening the chemical space with feature importance, it was found that the chemical space can be reduced to less than 1 percent. This result suggests that the acceleration of material research can be achievable.

quant-ph↗

Efficient Algorithm for Binary Quadratic Problem by Column Generation and Quantum Annealing

We propose an efficient algorithm that combines column generation and quantum annealing to solve binary quadratic problems. Binary quadratic problems are difficult to solve because they are NP-hard. An attempt to solve binary quadratic problems efficiently by column generation has been studied, but it demands successively solving quadratic unconstrained binary optimization problems. We solve the bottleneck by using quantum annealing or simulated annealing. Our results demonstrate a good approximate solution obtained in 2.7 to 1000 times shorter computational time to use column generation and quantum annealing to solve binary quadratic problems than the existing fast solver.

cond-mat.dis-nn↗

Gibbs-Bogoliubov inequality on Nishimori line

The Gibbs-Bogoliubov inequality states that the free energy of a system is always lower than that calculated by a trial function. In this study, we show that a counterpart of the Gibbs-Bogoliubov inequality holds on the Nishimori line for Ising spin-glass models with Gaussian randomness. Our inequality states that the quenched free energy of a system is always lower than that calculated using a quenched trial function. The key component of the proof is the convexity of the pressure function $\mathbb{E}\left[\log Z_{} \right]$ with respect to the parameters along the Nishimori line, which differs from the conventional convexity with respect to the inverse temperature. When our inequality was applied to mean-field models, such as the Sherrington-Kirkpatrick model and $p$-spin model, the bound coincided with the replica-symmetric solution indicating that the equality holds.

cond-mat.stat-mech↗

Threshold theorem in quantum annealing with deterministic analog control errors

We investigate the effect of deterministic analog control errors in the time-dependent Hamiltonian on isolated quantum dynamics. Deterministic analog control errors are formulated as time-dependent operators in the Schrodinger equation. We give an upper bound on the distance between two states in time evolution with and without deterministic analog control errors. As a result, we prove that, if the strength of deterministic analog control errors is less than the inverse of computational time, the final state in quantum dynamics without deterministic analog control errors can be obtained through a constant-order number of measurements in quantum dynamics with deterministic analog control errors.

quant-ph↗

Mean-field theory is exact for Ising spin glass models with Kac potential in non-additive limit on Nishimori line

Recently, Mori [Phys. Rev. E 84, 031128 (2011)] has conjectured that the free energy of Ising spin glass models with the Kac potential in the non-additive limit, such as the power-law potential in the non-additive regime, is exactly equal to that of the Sherrington-Kirkpatrick model in the thermodynamic limit. In this study, we prove that his conjecture is true on the Nishimori line at any temperature in any dimension. One of the key ingredients of the proof is the use of the Gibbs-Bogoliubov inequality on the Nishimori line. We also consider the case in which the probability distribution of the interaction is symmetric, where his conjecture is true at any temperature in one dimension but is an open problem in the low-temperature regime in two or more dimensions.

cond-mat.dis-nn↗

Ising formulation of integer optimization problems for utilizing quantum annealing in iterative improvement strategy

Quantum annealing is a heuristic algorithm for searching the ground state of an Ising model. Heuristic algorithms aim to obtain near-optimal solutions with a reasonable computation time. Accordingly, many algorithms have so far been proposed. In general, the performance of heuristic algorithms strongly depends on the instance of the combinatorial optimization problem to be solved because they escape the local minima in different ways. Therefore, combining several algorithms to exploit their complementary strength is effective for obtaining highly accurate solutions for a wide range of combinatorial optimization problems. However, quantum annealing cannot be used to improve a candidate solution obtained by other algorithms because it starts from an initial state where all spin configurations are found with a uniform probability. In this study, we propose an Ising formulation of integer optimization problems to utilize quantum annealing in the iterative improvement strategy. Our formulation exploits the biased sampling of degenerated ground states in transverse magnetic field quantum annealing. We also analytically show that a first-order phase transition is successfully avoided for a fully connected ferromagnetic Potts model if the overlap between a ground state and a candidate solution exceeds a threshold. The proposed formulation is applicable to a wide range of integer optimization problems and enables us to hybridize quantum annealing with other optimization algorithms.

quant-ph↗

Threshold theorem in isolated quantum dynamics with stochastic control errors

We investigate the effect of stochastic control errors in the time-dependent Hamiltonian on isolated quantum dynamics. The control errors are formulated as time-dependent stochastic noise in the Schrodinger equation. For a class of stochastic control errors, we establish a threshold theorem that provides a sufficient condition to obtain the target state, which should be determined in noiseless isolated quantum dynamics, as a relation between the number of measurements and noise strength. The theorem guarantees that if the sum of the noise strengths is less than the inverse of computational time, the target state can be obtained through a constant-order number of measurements. If the opposite is true, the number of measurements to guarantee obtaining the target state increases exponentially with computational time. Our threshold theorem can be applied to any isolated quantum dynamics such as quantum annealing and adiabatic quantum computation.

quant-ph↗

Travel time optimization on multi-AGV routing by reverse annealing

Quantum annealing has been actively researched since D-Wave Systems produced the first commercial machine in 2011. Controlling a large fleet of automated guided vehicles is one of the real-world applications utilizing quantum annealing. In this study, we propose a formulation to control the traveling routes to minimize the travel time. We validate our formulation through simulation in a virtual plant and authenticate the effectiveness for faster distribution compared to a greedy algorithm that does not consider the overall detour distance. Furthermore, we utilize reverse annealing to maximize the advantage of the D-Wave's quantum annealer. Starting from relatively good solutions obtained by a fast greedy algorithm, reverse annealing searches for better solutions around them. Our reverse annealing method improves the performance compared to standard quantum annealing alone and performs up to 10 times faster than the strong classical solver, Gurobi. This study extends a use of optimization with general problem solvers in the application of multi-AGV systems and reveals the potential of reverse annealing as an optimizer.

quant-ph↗

Sparse Signal Reconstruction with QUBO Formulation in l0-regularized Linear Regression

An l0-regularized linear regression for a sparse signal reconstruction is implemented based on the quadratic unconstrained binary optimization (QUBO) formulation. In this method, the signal values are quantized and expressed as bit sequences. By transforming l0-norm to a quadratic form of these bits, the fully quadratic objective function is provided and optimized by the solver specialized for QUBO, such as the quantum annealer. Numerical experiments with a commercial quantum annealer show that the proposed method performs slightly better than conventional methods based on orthogonal matching pursuit (OMP) and the least absolute shrinkage and selection operator (LASSO) under several limited conditions.

cs.IT↗

Benchmark of quantum-inspired heuristic solvers for quadratic unconstrained binary optimization

Recently, inspired by quantum annealing, many solvers specialized for unconstrained binary quadratic programming problems have been developed. For further improvement and application of these solvers, it is important to clarify the differences in their performance for various types of problems. In this study, the performance of four quadratic unconstrained binary optimization problem solvers, namely D-Wave Hybrid Solver Service (HSS), Toshiba Simulated Bifurcation Machine (SBM), Fujitsu DigitalAnnealer (DA), and simulated annealing on a personal computer, was benchmarked. The problems used for benchmarking were instances of real problems in MQLib, instances of the SAT-UNSAT phase transition point of random not-all-equal 3-SAT(NAE 3-SAT), and the Ising spin glass Sherrington-Kirkpatrick (SK) model. Concerning MQLib instances, the HSS performance ranked first; for NAE 3-SAT, DA performance ranked first; and regarding the SK model, SBM performance ranked first. These results may help understand the strengths and weaknesses of these solvers.

quant-ph↗

Mirror-symmetry-protected dynamical quantum phase transitions in topological crystalline insulators

Dynamical quantum phase transitions (DQPTs) are topologically characterized in quantum quench dynamics in topological systems. In this paper, we study Loschmidt amplitudes and DQPTs in quantum quenches in mirror-symmetric topological phases. Based on the topological classification of mirror-symmetric insulators, we show that mirror symmetry creates symmetry-protected DQPTs. If mirror symmetry is present, topologically robust DQPTs can occur in quantum quenches, even in high-dimensional time-reversal invariant systems. Then, we also show that symmetry-protected DQPTs occur in quenches in two-dimensional chiral-symmetric systems with mirror symmetry. Mirror-symmetry-protected DQPTs can be easily captured by a reduced rate function. Moreover, we introduce dynamical topological order parameters for mirror-symmetry-protected DQPTs. Finally, we demonstrate DQPTs using lattice models for a time-reversal invariant topological crystalline insulator and a higher-order topological insulator.

cond-mat.mes-hall↗

Combinatorial Black-box Optimization for Vehicle Design Problem

Black-box optimization minimizes an objective function without derivatives or explicit forms. Such an optimization method with continuous variables has been successful in the fields of machine learning and material science. For discrete variables, the Bayesian optimization of combinatorial structure (BOCS) is a powerful tool for solving black-box optimization problems. A surrogate model used in BOCS is the quadratic unconstrained binary optimization (QUBO) form. Because of the approximation of the objective function to the QUBO form in BOCS, BOCS can expand the possibilities of using D-Wave quantum annealers, which can generate near-optimal solutions of QUBO problems by utilizing quantum fluctuation. We demonstrate the use of BOCS and its variant for a vehicle design problem, which cannot be described in the QUBO form. As a result, BOCS and its variant slightly outperform the random search, which randomly calculates the objective function.

cond-mat.stat-mech↗

Kernel-based framework to estimate deformations of pneumothorax lung using relative position of anatomical landmarks

In video-assisted thoracoscopic surgeries, successful procedures of nodule resection are highly dependent on the precise estimation of lung deformation between the inflated lung in the computed tomography (CT) images during preoperative planning and the deflated lung in the treatment views during surgery. Lungs in the pneumothorax state during surgery have a large volume change from normal lungs, making it difficult to build a mechanical model. The purpose of this study is to develop a deformation estimation method of the 3D surface of a deflated lung from a few partial observations. To estimate deformations for a largely deformed lung, a kernel regression-based solution was introduced. The proposed method used a few landmarks to capture the partial deformation between the 3D surface mesh obtained from preoperative CT and the intraoperative anatomical positions. The deformation for each vertex of the entire mesh model was estimated per-vertex as a relative position from the landmarks. The landmarks were placed in the anatomical position of the lung's outer contour. The method was applied on nine datasets of the left lungs of live Beagle dogs. Contrast-enhanced CT images of the lungs were acquired. The proposed method achieved a local positional error of vertices of 2.74 mm, Hausdorff distance of 6.11 mm, and Dice similarity coefficient of 0.94. Moreover, the proposed method could estimate lung deformations from a small number of training cases and a small observation area. This study contributes to the data-driven modeling of pneumothorax deformation of the lung.

cs.CV↗

Stochastic dynamics without detailed balance condition connecting simple gradient method and Hamiltonian Monte Carlo

Sampling occupies an important position in theories of various scientific fields, and Markov chain Monte Carlo (MCMC) provides the most common technique of sampling. In the progress of MCMC, a huge number of studies have aimed the acceleration of convergence to the target distribution. Hamiltonian Monte Carlo (HMC) is such a variant of MCMC. In the recent development of MCMC, another approach based on the violation of the detailed balance condition has attracted much attention. Historically, these two approaches have been proposed independently, and their relationship has not been clearly understood. In this paper, the two approaches are seamlessly understood in the framework of generalized Monte Carlo method that violates the detailed balance condition. Furthermore we propose an efficient Monte Carlo method based on our framework.

cond-mat.stat-mech↗