Results 31 to 40 of about 1,190 (203)
Mapping Quantum Circuits to Modular Architectures with QUBO
2023 IEEE International Conference on Quantum Computing and Engineering (QCE), 2023 Submitted to IEEE QCE ...
Medina Bandić +10 more
openalex +5 more sources
Market Graph Clustering via QUBO and Digital Annealing [PDF]
Journal of Risk and Financial Management, 2021 We present a novel technique for cardinality-constrained index-tracking, a common task in the financial industry. Our approach is based on market graph models. We model our reference indices as market graphs and express the index-tracking problem as a quadratic K-medoids clustering problem.
Seo Woo Hong +3 more
openaire +4 more sources
Applying Ising Machines to Multi-objective QUBOs
Proceedings of the Companion Conference on Genetic and Evolutionary Computation, 2023 Multi-objective optimisation problems involve finding solutions with varying trade-offs between multiple and often conflicting objectives. Ising machines are physical devices that aim to find the absolute or approximate ground states of an Ising model.
Mayowa Ayodele +4 more
openaire +5 more sources
A QUBO formulation for top-τ eigencentrality nodes
PLOS ONE, 2022 The efficient calculation of the centrality or “hierarchy” of nodes in a network has gained great relevance in recent years due to the generation of large amounts of data. The eigenvector centrality (aka eigencentrality) is quickly becoming a good metric for centrality due to both its simplicity and fidelity.
Prosper D. Akrobotu +3 more
openaire +4 more sources
QUBO transformation using Eigenvalue Decomposition
, 2021 Quadratic Unconstrained Binary Optimization (QUBO) is a general-purpose modeling framework for combinatorial optimization problems and is a requirement for quantum annealers. This paper utilizes the eigenvalue decomposition of the underlying Q matrix to alter and improve the search process by extracting the information from dominant eigenvalues and ...
Verma, Amit, Lewis, Mark
openaire +2 more sources
A QUBO formulation for the Tree Containment problem
Theoretical Computer Science, 2023 Phylogenetic (evolutionary) trees and networks are leaf-labeled graphs that are widely used to represent the evolutionary relationships between entities such as species, languages, cancer cells, and viruses. To reconstruct and analyze phylogenetic networks, the problem of deciding whether or not a given rooted phylogenetic network embeds a given rooted
Dinneen, Michael J. +2 more
openaire +3 more sources
HUBO formulations for solving the eigenvalue problem
Results in Control and Optimization, 2023 Solving the eigenvalue problem is particularly important in almost all fields of science and engineering. With the development of quantum computers, multiple algorithms have been proposed for this purpose.
Kyungtaek Jun, Hyunju Lee
doaj +1 more source
Optimizing Heat Treatment Schedules via QUBO Formulation
Applied SciencesQuadratic Unconstrained Binary Optimization (QUBO) is the problem of finding binary variable assignments that minimize a given quadratic objective function.
Ikuto Nakatsukasa +3 more
doaj +1 more source
PLoS ONE, 2022 The most advanced D-Wave Advantage quantum annealer has 5000+ qubits, however, every qubit is connected to a small number of neighbors. As such, implementation of a fully-connected graph results in an order of magnitude reduction in qubit count.
Alexander Teplukhin +4 more
doaj +1 more source
On good encodings for quantum annealer and digital optimization solvers
Scientific Reports, 2023 Several optimization solvers inspired by quantum annealing have been recently developed, either running on actual quantum hardware or simulating it on traditional digital computers.
Alberto Ceselli, Marco Premoli
doaj +1 more source