Results 61 to 70 of about 22,651 (215)

Minor-Embedding in Adiabatic Quantum Computation: I. The Parameter Setting Problem [PDF]

, 2008
We show that the NP-hard quadratic unconstrained binary optimization (QUBO) problem on a graph $G$ can be solved using an adiabatic quantum computer that implements an Ising spin-1/2 Hamiltonian, by reduction through minor-embedding of $G$ in the quantum
Choi, Vicky
core   +2 more sources

Flexible methods for species distribution modeling with small samples

Ecography, EarlyView.
Species distribution models (SDMs) predict where species live or could potentially live and are a key resource for ecological research and conservation decision‐making. However, current SDM methods often perform poorly for rare or inadequately sampled species, which include most species on earth, as well as most of those of the greatest conservation ...
Brian S. Maitner, Robert L. Richards, Ben S. Carlson, John M. Drake, Cory Merow   +4 more
wiley   +1 more source

Speedup of high-order unconstrained binary optimization using quantum $${{\mathbb{Z}}}_{2}$$ Z 2 lattice gauge theory

Communications Physics
An important and difficult problem in optimization is the high-order unconstrained binary optimization, which can represent many optimization problems more efficiently than quadratic unconstrained binary optimization, but how to quickly solve it has ...
Bi-Ying Wang, Xiaopeng Cui, Qingguo Zeng, Yemin Zhan, Man-Hong Yung, Yu Shi   +5 more
doaj   +1 more source

End‐to‐End Portfolio Optimization with Hybrid Quantum Annealing

Advanced Quantum Technologies, EarlyView.
This works presents a hybrid quantum‐classical framework for portfolio optimization that combines quantum assisted asset selection and rebalancing with classical weight allocation. The approach processes real market data, embeds it into Quadratic Unconstrained Binary Optimization formulations, and evaluates performance within a unified workflow ...
Sai Nandan Morapakula, Sangram Deshpande, Rakesh Yata, Rushikesh Ubale, Uday Wad, Kazuki Ikeda   +5 more
wiley   +1 more source

Embedding Equality Constraints of Optimization Problems into a Quantum Annealer

Algorithms, 2019
Quantum annealers such as D-Wave machines are designed to propose solutions for quadratic unconstrained binary optimization (QUBO) problems by mapping them onto the quantum processing unit, which tries to find a solution by measuring the parameters of a ...
Tomas Vyskocil, Hristo Djidjev
doaj   +1 more source

Addressing ecological challenges from a quantum computing perspective

Methods in Ecology and Evolution, EarlyView.
Abstract With increased access to data and the advent of computers, the use of statistical tools and numerical simulations is becoming commonplace for ecologists. These approaches help improve our understanding of ecological phenomena and their underlying mechanisms in increasingly complex environments.
Maxime Clenet, Maxime Dion, F. Guillaume Blanchet   +2 more
wiley   +1 more source

An Integrated Programming and Development Environment for Adiabatic Quantum Optimization

, 2014
Adiabatic quantum computing is a promising route to the computational power afforded by quantum information processing. The recent availability of adiabatic hardware has raised challenging questions about how to evaluate adiabatic quantum optimization ...
Bennink, Ryan S., Billings, Jay J., D'Azevedo, Ed F., Humble, Travis S., Klymko, Christine F., McCaskey, Alex J., Seddiqi, Hadayat, Sullivan, Blair D.   +7 more
core   +1 more source

Solving Standard and Generalized EMPM Eigenvalue Problems: A QUBO Approach for the D-Wave Quantum Annealer [PDF]

EPJ Web of Conferences
Within the Equation of Motion Phonon Method (EMPM) framework, we address the computation of the ground-state eigenpair of nuclear Hamiltonians by reformulating the eigenvalue problem as a Quadratic Unconstrained Binary Optimization (QUBO).
De Gregorio G., De Lucia C., Martone A., D’Aniello F.A., Mastroianni A., Nunziata G., Knapp F., Iudice N. Lo, Veselý P.   +8 more
doaj   +1 more source

GPS: A New TSP Formulation for Its Generalizations Type QUBO

Mathematics, 2022
We propose a new Quadratic Unconstrained Binary Optimization (QUBO) formulation of the Travelling Salesman Problem (TSP), with which we overcame the best formulation of the Vehicle Routing Problem (VRP) in terms of the minimum number of necessary ...
Saul Gonzalez-Bermejo, Guillermo Alonso-Linaje, Parfait Atchade-Adelomou   +2 more
doaj   +1 more source

Computing Skinning Weights via Convex Duality

Computer Graphics Forum, EarlyView.
We present an alternate optimization method to compute bounded biharmonic skinning weights. Our method relies on a dual formulation, which can be optimized with a nonnegative linear least squares setup. Abstract We study the problem of optimising for skinning weights through the lens of convex duality.
J. Solomon, O. Stein
wiley   +1 more source