Papers › Range dependent Hamiltonian Algorithm for numerical QUBO formulation
Range dependent Hamiltonian Algorithm for numerical QUBO formulation
Hyunju Lee, Kyungtaek Jun
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
With the advent and development of quantum computers, various quantum algorithms that can solve linear equations and eigenvalues faster than classical computers have been developed. The Harrow-Hassidim-Lloyd algorithm is an algorithm that can solve linear equations in a gate model quantum computer. Still, it is constrained by the use of quantum RAM and the size limit of the matrix according to the total number of qubits in the quantum computer. Recently, Jun and Lee developed a QUBO model for solving linear systems and eigenvalue problems in the quantum computer. However, even though their model uses 2048 qubits, the number of qubits for variables that can be used for the problem is only 64. To solve this problem, we introduce an algorithm that can be used by dividing the size of the entire domain according to the number of qubits. We also form a QUBO model related to each subregion.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections