SearcharxivSearch

arXiv subjects

Kazuyuki Tanaka

Publications and source records attributed to Kazuyuki Tanaka.

At least 19 recordsLinked to original sources

Graph minor embedding can affect sampling degenerate ground states using quantum annealing

Quantum annealing, as currently implemented in hardware, cannot fairly sample all ground states. Graph minor embedding, which maps a problem to the hardware graph of quantum annealers, affects sampling all states. In this study, we demonstrate the influence of graph minor embedding on fair sampling of degenerate ground states. For two embedded models that introduce auxiliary variables, numerical simulations of Schrödinger evolution revealed that fairness varies significantly depending on the embedding, and the chain strength is related to ground-state fairness. Using perturbation theory, we found that chain strength determines the energy landscape around ground states, with flatter landscapes having higher probabilities of being obtained.

quant-ph

Uniformity Bias in Ground-State Sampling Induced by Replica Alignment in Quantum Monte Carlo for Quantum Annealing

Quantum annealing (QA) with a transverse field often fails to sample degenerate ground states fairly, limiting applicability to problems requiring diverse optimal solutions. Although Quantum Monte Carlo (QMC) is widely used to simulate QA, its ability to reproduce such unfair ground-state sampling remains unclear because stochastic and coherent quantum dynamics differ fundamentally. We quantitatively evaluate how accurately QMC reproduces the sampling bias in QA by comparing the final ground-state distributions from the QMC master equation and the Schrödinger equation. We find QMC tends to produce uniform ground-state probabilities, unlike QA's biased distribution, and that this uniformity bias strengthens as annealing proceeds. Our analysis reveals that this bias originates from replica alignment -- the dominance of configurations in which all Trotter replicas coincide -- caused by the energetic suppression and entropic reduction of kink configurations (replica mismatches). These findings clarify a fundamental limitation of discrete-time QMC in faithfully simulating QA dynamics, highlighting the importance of replica correlations and transition rules in achieving realistic ground-state sampling.

quant-ph

Relaxation-assisted reverse annealing on nonnegative/binary matrix factorization

Quantum annealing has garnered significant attention as meta-heuristics inspired by quantum physics for combinatorial optimization problems. Among its many applications, nonnegative/binary matrix factorization stands out for its complexity and relevance in unsupervised machine learning. The use of reverse annealing, a derivative procedure of quantum annealing to prioritize the search in a vicinity under a given initial state, helps improve its optimization performance in matrix factorization. This study proposes an improved strategy that integrates reverse annealing with a linear programming relaxation technique. Using relaxed solutions as the initial configuration for reverse annealing, we demonstrate improvements in optimization performance comparable to the exact optimization methods. Our experiments on facial image datasets show that our method provides better convergence than known reverse annealing methods. Furthermore, we investigate the effectiveness of relaxation-based initialization methods on randomized datasets, demonstrating a relationship between the relaxed solution and the optimal solution. This research underscores the potential of combining reverse annealing and classical optimization strategies to enhance optimization performance.

quant-ph

Quadratic Unconstrained Binary Formulation for Traffic Signal Optimization on Real-World Maps

The D-Wave quantum annealing machine can quickly find the optimal solution for quadratic unconstrained binary optimization (QUBO). One of the applications where the use of quantum annealing is desired is in problems requiring rapid calculations. One such application is the traffic signal optimization. Several studies have used quantum annealing; however, they are formulated in relatively unrealistic settings, such as only crossroads on a map. We propose a different formulation of QUBO that can also deal with T-junctions and multi-forked roads. The simulation of urban mobility (SUMO) was used to validate the efficiency of our approach and verify the feasibility of real-time control using geographical information data that were very similar to the real world. Our model could reduce the waiting time at red lights for vehicles. In addition, we compared our results with those of the Gurobi Optimizer to confirm whether the D-Wave machine could find the ground state. Unfortunately, our results show that the D-Wave machine could not find the optimal solution and was slower than the Gurobi Optimizer in computation time.

quant-ph

Comparing the effects of Boltzmann machines as associative memory in Generative Adversarial Networks between classical and quantum sampling

We investigate the quantum effect on machine learning (ML) models exemplified by the Generative Adversarial Network (GAN), which is a promising deep learning framework. In the general GAN framework the generator maps uniform noise to a fake image. In this study, we utilize the Associative Adversarial Network (AAN), which consists of a standard GAN and an associative memory. Further, we set a Boltzmann Machine (BM), which is an undirected graphical model that learns low-dimensional features extracted from a discriminator, as the memory. Owing to difficulty calculating the BM's log-likelihood gradient, it is necessary to approximate it by using the sample mean obtained from the BM, which has tentative parameters. To calculate the sample mean, a Markov Chain Monte Carlo (MCMC) is often used. In a previous study, this was performed using a quantum annealer device, and the performance of the "Quantum" AAN was compared to that of the standard GAN. However, its better performance than the standard GAN is not well understood. In this study, we introduce two methods to draw samples: classical sampling via MCMC and quantum sampling via quantum Monte Carlo (QMC) simulation, which is quantum simulation on the classical computer. Then, we compare these methods to investigate whether quantum sampling is advantageous. Specifically, calculating the discriminator loss, the generator loss, inception score and Fréchet inception distance, we discuss the possibility of AAN. We show that the AANs trained by both MCMC and QMC are more stable during training and produce more varied images than the standard GANs. However, the results indicate no difference in sampling by QMC simulation compared to that by MCMC.

cond-mat.dis-nn

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

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

Teacher-student learning for a binary perceptron with quantum fluctuations

We analysed the generalisation performance of a binary perceptron with quantum fluctuations using the replica method. An exponential number of local minima dominate the energy landscape of the binary perceptron. Local search algorithms often fail to identify the ground state of a binary perceptron. In this study, we considered the teacher-student learning method and computed the generalisation error of a binary perceptron with quantum fluctuations. Due to the quantum fluctuations, we can efficiently find robust solutions that have better generalisation performance than the classical model. We validated our theoretical results through quantum Monte Carlo simulations. We adopted the replica symmetry (RS) ansatz assumption and static approximation. The RS solutions are consistent with our simulation results, except for the relatively low strength of the transverse field and high pattern ratio. These deviations are caused by the violation of ergodicity and static approximation. After accounting for the deviation between the RS solutions and numerical results, the enhancement of generalisation performance with quantum fluctuations holds.

cond-mat.dis-nn

Mean field analysis of reverse annealing for code-division multiple-access multiuser detection

We evaluate the typical ARA performance of the CDMA multiuser detection by means of statistical mechanics using the replica method. At first, we consider the oracle cases where the initial candidate solution is randomly generated with a fixed fraction of the original signal in the initial state. In the oracle cases, the first-order phase transition can be avoided or mitigated by ARA if we prepare for the proper initial candidate solution. We validate our theoretical analysis with quantum Monte Carlo simulations. The theoretical results to avoid the first-order phase transition are consistent with the numerical results. Next, we consider the practical cases where we prepare for the initial candidate solution obtained by commonly used algorithms. We show that the practical algorithms can exceed the threshold to avoid the first-order phase transition. Finally, we test the performance of ARA with the initial candidate solution obtained by the practical algorithm. In this case, the ARA can not avoid the first-order phase transition even if the initial candidate solution exceeds the threshold to avoid the first-order phase transition.

cond-mat.dis-nn

Benchmark test of Black-box optimization using D-Wave quantum annealer

In solving optimization problems, objective functions generally need to be minimized or maximized. However, objective functions cannot always be formulated explicitly in a mathematical form for complicated problem settings. Although several regression techniques infer the approximate forms of objective functions, they are at times expensive to evaluate. Optimal points of "black-box" objective functions are computed in such scenarios, while effectively using a small number of clues. Recently, an efficient method by use of inference by sparse prior for a black-box objective function with binary variables has been proposed. In this method, a surrogate model was proposed in the form of a quadratic unconstrained binary optimization (QUBO) problem, and was iteratively solved to obtain the optimal solution of the black-box objective function. In the present study, we employ the D-Wave 2000Q quantum annealer, which can solve QUBO by driving the binary variables by quantum fluctuations. The D-Wave 2000Q quantum annealer does not necessarily output the ground state at the end of the protocol due to freezing effect during the process. We investigate effects from the output of the D-Wave quantum annealer in performing black-box optimization. We demonstrate a benchmark test by employing the sparse Sherrington-Kirkpatrick (SK) model as the black-box objective function, by introducing a parameter controlling the sparseness of the interaction coefficients. Comparing the results of the D-Wave quantum annealer to those of the simulated annealing (SA) and semidefinite programming (SDP), our results by the D-Wave quantum annealer and SA exhibit superiority in black-box optimization with SDP. On the other hand, we did not find any advantage of the D-Wave quantum annealer over the simulated annealing. As far as in our case, any effects by quantum fluctuation are not found.

cond-mat.stat-mech

Assessment of image generation by quantum annealer

Quantum annealing was originally proposed as an approach for solving combinatorial optimisation problems using quantum effects. D-Wave Systems has released a production model of quantum annealing hardware. However, the inherent noise and various environmental factors in the hardware hamper the determination of optimal solutions. In addition, the freezing effect in regions with weak quantum fluctuations generates outputs approximately following a Gibbs--Boltzmann distribution at an extremely low temperature. Thus, a quantum annealer may also serve as a fast sampler for the Ising spin-glass problem, and several studies have investigated Boltzmann machine learning using a quantum annealer. Previous developments have focused on comparing the performance in the standard distance of the resulting distributions between conventional methods in classical computers and sampling by a quantum annealer. In this study, we focused on the performance of a quantum annealer as a generative model. To evaluate its performance, we prepared a discriminator given by a neural network trained on an a priori dataset. The evaluation results show a higher performance of quantum annealing compared with the classical approach for Boltzmann machine learning.

cond-mat.dis-nn

A two-stage data-analysis method for total-reflection high-energy positron diffraction (TRHEPD)

Total-reflection high-energy positron diffraction (TRHEPD) is a novel experimental method for the determination of surface structure, which has been extensively developed at the Slow Positron Facility, Institute of Materials Structure Science, High Energy Accelerator Research Organization (KEK). In this paper, a two-stage data-analysis method is proposed. The data analysis is based on an inverse problem in which the atomic positions of a surface structure are determined from the experimental diffraction data (rocking curves). The relevant forward problem is solved by the numerical solution of the partial differential equation for quantum scattering of the positron. In the present two-stage method, the first stage is a grid-based global search and the second stage is a local search for the unique candidate for the atomic arrangement. The numerical problem is solved on a supercomputer

cond-mat.mtrl-sci

Adaptive Thouless--Anderson--Palmer equation for higher-order Markov random fields

The adaptive Thouless--Anderson--Palmer (TAP) mean-field approximation is one of the advanced mean-field approaches, and it is known as a powerful accurate method for Markov random fields (MRFs) with quadratic interactions (pairwise MRFs). In this study, an extension of the adaptive TAP approximation for MRFs with many-body interactions (higher-order MRFs) is developed. We show that the adaptive TAP equation for pairwise MRFs is derived by naive mean-field approximation with diagonal consistency. Based on the equivalence of the approximate equation obtained from the naive mean-field approximation with diagonal consistency and the adaptive TAP equation in pairwise MRFs, we formulate approximate equations for higher-order Boltzmann machines, which is one of simplest higher-order MRFs, via the naive mean-field approximation with diagonal consistency.

cond-mat.dis-nn

A simple relation between frustration and transition points in diluted spin glasses

We investigate a possible relation between frustration and phase-transition points in spin glasses. The relation is represented as a condition of the number of frustrated plaquettes in the lattice at phase-transition points at zero temperature and was reported to provide very close points to the phase-transition points for several lattices. Although there has been no proof of the relation, the good correspondence in several lattices suggests the validity of the relation and some important role of frustration in the phase transitions. To examine the relation further, we present a natural extension of the relation to diluted lattices and verify its effectiveness for bond-diluted square lattices. We then confirm that the resulting points are in good agreement with the phase-transition points in a wide range of dilution rate. Our result supports the suggestion from the previous work for non-diluted lattices on the importance of frustration to the phase transition of spin glasses.

cond-mat.dis-nn

Fair Sampling by Simulated Annealing on Quantum Annealer

Conventional quantum annealing does not sample all ground states fairly. We demonstrate that fair sampling can be achieved by performing simulated annealing on a quantum annealer. We discuss the problems that occur when implementing this method and propose an alternative way to overcome them. We numerically verify the fair sampling ability of our method in a small-scale toy model.

quant-ph

Difference between quantum annealing by imaginary-time and real-time Schrödinger equation of Grover's search

We confirmed the annealing time of Grover's search which is required to obtain desired success probability for quantum annealing by the imaginary-time and the real-time Schrödinger equation with two kinds of schedulings; one linearly decreases the quantum fluctuation and the other tunes the evolution rate of the Hamiltonian based on the adiabatic condition. With linear scheduling, the required annealing time for quantum annealing by the imaginary-time Schrödinger equation is of order $\log N$, which is very different from $O(N)$ required for the quantum annealing by the real-time Schrödinger equation. With the scheduling based on the adiabatic condition, the required annealing time is of order $\sqrt{N}$, which is identical to the annealing time for quantum annealing by the real-time Schrödinger equation. Although the scheduling based on the adiabatic condition is optimal for the quantum annealing by the real-time Schrödinger equation, it is inefficient for the quantum annealing by the imaginary-time Schrödinger equation. This result implies that the optimal scheduling for the quantum annealing by the imaginary-time and the real-time Schrödinger equation is very different, and the efficient scheduling considered with the quantum Monte Carlo methods, which is based on imaginary-time Schrödinger equation, is not necessarily effective to improve the performance of quantum annealing by the real-time Schrödinger equation. We discuss the efficient scheduling for quantum annealing by the imaginary-time Schrödinger equation with respect to the exponential decay of excited states.

quant-ph

Efficient quantum and simulated annealing of Potts models using a half-hot constraint

The Potts model is a generalization of the Ising model with $Q>2$ components. In the fully connected ferromagnetic Potts model, a first-order phase transition is induced by varying thermal fluctuations. Therefore, the computational time required to obtain the ground states by simulated annealing exponentially increases with the system size. This study analytically confirms that the transverse magnetic-field quantum annealing induces a first-order phase transition. This result implies that quantum annealing does not exponentially accelerate the ground-state search of the ferromagnetic Potts model. To avoid the first-order phase transition, we propose an iterative optimization method using a half-hot constraint that is applicable to both quantum and simulated annealing. In the limit of $Q \to \infty$, a saddle point equation under the half-hot constraint is identical to the equation describing the behavior of the fully connected ferromagnetic Ising model, thus confirming a second-order phase transition. Furthermore, we verify the same relation between the fully connected Potts glass model and the Sherrington--Kirkpatrick model under assumptions of static approximation and replica symmetric solution. The proposed method is expected to obtain low-energy states of the Potts models with high efficiency using Ising-type computers such as the D-Wave quantum annealer and the Fujitsu Digital Annealer.

quant-ph

Development of data-analysis software for total-reflection high-energy positron diffraction (TRHEPD)

The present paper reports on the recent activity of the data analysis software development for total-reflection high-energy positron diffraction (TRHEPD), a novel experimental technique for surface structure determination. Experiments using TRHEPD are being conducted intensively at the Slow Positron Facility, Institute of Materials Structure Science, High Energy Accelerator Research Organization, revealing surface structure of interest. The data analysis software provides a solution to the inverse problem in which the atomic positions of a surface structure are determined from the experimental diffraction data (rocking curve). The forward problem is solved by the numerical solution of the partial differential equation in the quantum scattering problem. A technical demonstration with a test problem was carried out to confirm the software functioned as expected. Since the analysis method has a general mathematical foundation, it is also applicable to other experiments, such as X-ray or electron diffraction experiments.

cond-mat.mtrl-sci