Quantum computing for smart grid applications
Computational complexities in modern power systems are reportedly increasing daily, and it
is anticipated that traditional computers might be inadequate to provide the computation …
is anticipated that traditional computers might be inadequate to provide the computation …
Efficient combinatorial optimization by quantum-inspired parallel annealing in analogue memristor crossbar
M Jiang, K Shan, C He, C Li - Nature Communications, 2023 - nature.com
Combinatorial optimization problems are prevalent in various fields, but obtaining exact
solutions remains challenging due to the combinatorial explosion with increasing problem …
solutions remains challenging due to the combinatorial explosion with increasing problem …
GPU-accelerated scalable solver with bit permutated cyclic-min algorithm for quadratic unconstrained binary optimization
A wide range of combinatorial optimization problems can be reduced to the Ising model, and
equivalently the quadratic unconstrained binary optimization (QUBO) problem. Thus, in …
equivalently the quadratic unconstrained binary optimization (QUBO) problem. Thus, in …
Dual-matrix domain wall: A novel technique for generating permutations by QUBO and Ising models with quadratic sizes
The Ising model is defined by an objective function using a quadratic formula of qubit
variables. The problem of an Ising model aims to determine the qubit values of the variables …
variables. The problem of an Ising model aims to determine the qubit values of the variables …
QUBO Decision Tree: Annealing machine extends decision tree splitting
K Yawata, Y Osakabe, T Okuyama… - … on knowledge graph …, 2022 - ieeexplore.ieee.org
This paper proposes an extension of regression trees by quadratic unconstrained binary
optimization (QUBO). Regression trees are very popular prediction models that are trainable …
optimization (QUBO). Regression trees are very popular prediction models that are trainable …
Diverse adaptive bulk search: a framework for solving QUBO problems on multiple GPUs
Quadratic Unconstrained Binary Optimization (QUBO) is a combinatorial optimization to find
an optimal binary solution vector that minimizes the energy value defined by a quadratic …
an optimal binary solution vector that minimizes the energy value defined by a quadratic …
Neuromorphic swarm on rram compute-in-memory processor for solving qubo problem
Combinatorial optimization problems prevail in engineering and industry. Some are NP-hard
and thus become difficult to solve on edge devices due to limited power and computing …
and thus become difficult to solve on edge devices due to limited power and computing …
High‐throughput FPGA implementation for quadratic unconstrained binary optimization
Quadratic unconstrained binary optimization (QUBO) is a combinatorial optimization
problem. Since various NP‐hard problems such as the traveling salesman problem can be …
problem. Since various NP‐hard problems such as the traveling salesman problem can be …
Solving the sparse QUBO on multiple GPUs for simulating a quantum annealer
Quadratic Unconstraint Binary Optimization (QUBO) is a combinatorial optimization problem
such that an n*n upper triangle matrix W is given and the objective is to find an n-bit vector X …
such that an n*n upper triangle matrix W is given and the objective is to find an n-bit vector X …
Fully-pipelined architecture for simulated annealing-based QUBO solver on the FPGA
The main contribution of this work is to propose a new fully-pipelined architecture for the
QUBO solver on the FPGA. For the fully-pipelined architecture, we propose two local search …
QUBO solver on the FPGA. For the fully-pipelined architecture, we propose two local search …