Related papers: Solving the homogeneous Bethe-Salpeter equation wi…
Quantum annealing is a heuristic algorithm for solving combinatorial optimization problems, and D-Wave Systems Inc. has developed hardware for implementing this algorithm. The current version of the D-Wave quantum annealer can solve…
The Bethe-Salpeter formalism in the instantaneous approximation for the interaction kernel entering into the Bethe-Salpeter equation represents a reasonable framework for the description of bound states within relativistic quantum field…
With the increasing popularity of quantum computing and in particular quantum annealing, there has been growing research to evaluate the meta-heuristic for various problems in linear algebra: from linear least squares to matrix and tensor…
Quantum annealing has the potential to find low energy solutions of NP-hard problems that can be expressed as quadratic unconstrained binary optimization problems. However, the hardware of the quantum annealer manufactured by D-Wave…
In this work we investigate the capabilities of a hybrid quantum-classical procedure to explore the solution space using the D-Wave $2000Q^{TM}$ Quantum Annealer device. Here we study the ability of the Quantum hardware to solve the Number…
We assess the performance of D-wave quantum solvers for solving the stable set problem in a graph, one of the most studied NP-hard problems. We perform computations on some instances from the literature with up to 125 vertices and compare…
In this paper, two kinds of the exact singular solutions are obtained by the improved homogeneous balance (HB) method and a nonlinear transformation. The two exact solutions show that special singular wave patterns exists in the classical…
We propose a new method for solving binary optimization problems under inequality constraints using a quantum annealer. To deal with inequality constraints, we often use slack variables, as in previous approaches. When we use slack…
Quantum annealers of D-Wave Systems, Inc., offer an efficient way to compute high quality solutions of NP-hard problems. This is done by mapping a problem onto the physical qubits of the quantum chip, from which a solution is obtained after…
Given an undirected graph, the stable set problem asks to determine the cardinality of the largest subset of pairwise non-adjacent vertices. This value is called the stability number of the graph, and its computation is an NP-hard problem.…
Harnessing the full power of nascent quantum processors requires the efficient management of a limited number of quantum bits with finite lifetime. Hybrid algorithms leveraging classical resources have demonstrated promising initial results…
Quantum annealing and D-Wave quantum annealer attracted considerable attention for their ability to solve combinatorial optimization problems. In order to solve other type of optimization problems, it is necessary to apply certain kinds of…
We develop an advanced method of solving homogeneous and inhomogeneous Bethe-Salpeter equations by using the expansion over the complete set of 4-dimensional spherical harmonics. We solve Bethe-Salpeter equations for bound and scattering…
The numerical solution of partial differential equations by discretization techniques is ubiquitous in computational physics. In this work we benchmark this approach in the quantum realm by solving the heat equation for a square plate…
The Bethe-Salpeter equation (BSE) is the key equation in many-body perturbation theory based on Green's functions to access response properties. Within the $GW$ approximation to the exchange-correlation kernel, the BSE has been successfully…
The Bethe-Salpeter equation (BSE) for bound states in scalar theories is reformulated and solved in terms of a generalized spectral representation directly in Minkowski space. This differs from the conventional approach, where the BSE is…
Within the formalism of relativistic quantum field theory an adequate framework for the description of two-particle bound states, such as, for instance, all conventional (i.e., non-exotic) mesons, is provided by the Poincar\'e-covariant…
This work studies the problem of maximizing a higher degree real homogeneous multivariate polynomial over the unit sphere. This problem is equivalent to finding the leading eigenvalue of the associated symmetric tensor of higher order,…
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…
We propose a novel method using a quantum annealer -- an analog quantum computer based on the principles of quantum adiabatic evolution -- to solve the Graph Isomorphism problem, in which one has to determine whether two graphs are…