Application
Accuracy and Minor Embedding in Subqubo Decomposition with Fully Connected Large Problems: a Case Study About the Number Partitioning Problem

Here, we study the ability of the quantum hardware to solve the number partitioning problem, a well-known NP-hard optimization model that poses some challenges typical of those encountered in real-world applications. 

INDUSTRY : Cross-industry
DISCIPLINE : Optimization