首页/论文/2001.03715

arXiv 2001.037152020-01-27quant-phcs.LG

Derivation of QUBO formulations for sparse estimation

Saitama University（埼玉大学）；Fujitsu Laboratories Ltd.（富士通实验室有限公司）

Tomohiro Yokota, Makiko Konoshima, Hirotaka Tamura, Jun Ohkubo

备注：: 5 pages, 2 figures
发表信息：: J. Phys. Soc. Jpn. 89, 034801 (2020)
DOI：: 10.7566/JPSJ.89.034801

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

英文摘要相关论文

英文摘要：

We propose a quadratic unconstrained binary optimization (QUBO) formulation of the l1-norm, which enables us to perform sparse estimation of Ising-type annealing methods such as quantum annealing. The QUBO formulation is derived using the Legendre transformation and the Wolfe theorem, which have recently been employed to derive the QUBO formulations of ReLU-type functions. It is shown that a simple application of the derivation method to the l1-norm case results in a redundant variable. Finally a simplified QUBO formulation is obtained by removing the redundant variable.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

稀疏QUBO公式用于通过基于网络的等式和不等式约束分解实现高效嵌入

Sparse QUBO Formulation for Efficient Embedding via Network-Based Decomposition of Equality and Inequality Constraints

The University of Tokyo（东京大学）

通过基于网络的分解方法，将等式和不等式约束转化为稀疏QUBO模型，从而提高量子退火器中嵌入效率和求解性能。

2026-01-26quant-ph

Quantum Annealing Learning Search for solving QUBO problems

In this paper we present a novel strategy to solve optimization problems within a hybrid quantum-classical scheme based on quantum annealing, with a particular focus on QUBO problems. The proposed algorithm is based on an iterative structure where the representation of an objective function into the annealer architecture is learned and already visited solutions are penalized by a tabu-inspired search. The result is a heuristic search equipped with a learning mechanism to improve the encoding of the problem into the quantum architecture. We prove the convergence of the algorithm to a global opt…

2019-08-13quant-ph

用于采样二元稀疏编码QUBO问题的量子退火与脉冲神经形态计算的比较

Comparing Quantum Annealing and Spiking Neuromorphic Computing for Sampling Binary Sparse Coding QUBO Problems

Los Alamos National Laboratory, CCS-3 Information Sciences（洛斯阿拉莫斯国家实验室，CCS-3信息科学部门）；Harvard University, T.H. Chan School of Public Health（哈佛大学，T.H. Chan公共卫生学院）

本研究针对二元稀疏编码QUBO问题，分别在D-Wave量子退火器和Intel Loihi 2脉冲神经形态处理器上求解，并引入迭代反向退火等方法优化，验证了两类计算的适用性且迭代反向量子退火表现最优。

2025-05-14cs.CVcs.DMcs.ET

Quantum Sparse Coding

The ultimate goal of any sparse coding method is to accurately recover from a few noisy linear measurements, an unknown sparse vector. Unfortunately, this estimation problem is NP-hard in general, and it is therefore always approached with an approximation method, such as lasso or orthogonal matching pursuit, thus trading off accuracy for less computational complexity. In this paper, we develop a quantum-inspired algorithm for sparse coding, with the premise that the emergence of quantum computers and Ising machines can potentially lead to more accurate estimations compared to classical approx…

2022-09-08quant-phstat.ML

Adiabatic Quantum Feature Selection for Sparse Linear Regression

Indian Institute of Technology Hyderabad（印度理工学院海得拉巴分校）；TCS Research（塔塔咨询服务研究院）

Linear regression is a popular machine learning approach to learn and predict real valued outputs or dependent variables from independent variables or features. In many real world problems, its beneficial to perform sparse linear regression to identify important features helpful in predicting the dependent variable. It not only helps in getting interpretable results but also avoids overfitting when the number of features is large, and the amount of data is small. The most natural way to achieve this is by using `best subset selection' which penalizes non-zero model parameters by adding $\ell_0…

2021-06-04cs.LGquant-phstat.ML

QuAnt: Quantum Annealing with Learnt Couplings

Universität Siegen（锡根大学）；Max Planck Institute for Informatics（马克斯·普朗克信息学研究所）；Aalto University（阿尔托大学）

Modern quantum annealers can find high-quality solutions to combinatorial optimisation objectives given as quadratic unconstrained binary optimisation (QUBO) problems. Unfortunately, obtaining suitable QUBO forms in computer vision remains challenging and currently requires problem-specific analytical derivations. Moreover, such explicit formulations impose tangible constraints on solution encodings. In stark contrast to prior work, this paper proposes to learn QUBO forms from data through gradient backpropagation instead of deriving them. As a result, the solution encodings can be chosen flex…

2022-10-13cs.CVcs.LGquant-ph

更多相关论文收起更多论文

A QUBO formulation for top-$τ$ eigencentrality nodes

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. In this work we lay the foundations for solving the eigencentrality problem of ranking the importance of the nodes of a network with scores from the eigenvector of the network, using quantum computational paradigms such as quantum annealing and gate-based quantum computing. The problem is…

2022-07-10quant-ph

Testing a QUBO Formulation of Core-periphery Partitioning on a Quantum Annealer

We propose a new kernel that quantifies success for the task of computing a core-periphery partition for an undirected network. Finding the associated optimal partitioning may be expressed in the form of a quadratic unconstrained binary optimization (QUBO) problem, to which a state-of-the-art quantum annealer may be applied. We therefore make use of the new objective function to (a) judge the performance of a quantum annealer, and (b) compare this approach with existing heuristic core-periphery partitioning methods. The quantum annealing is performed on the commercially available D-Wave machin…

2022-01-05cs.SIphysics.data-anquant-ph

通过排序网络实现排列问题的紧凑QUBO公式

Succinct QUBO formulations for permutation problems by sorting networks

Budapest University of Technology and Economics（布达佩斯技术与经济大学）

本文提出一种使用排序网络的紧凑QUBO公式，仅需O(n log²n)个二进制变量，优于传统排列矩阵编码，同时支持排列操作和顺序检查。

2026-03-13cs.DSquant-ph

通过提取半对称性来降低QUBO密度

Reducing QUBO Density by Factoring Out Semi-Symmetries

本文提出通过识别并提取QUBO矩阵中的半对称性至辅助量子比特来降低矩阵密度，理论上保持能谱不变，实验证明该方法能将QAOA电路深度和耦合数减少45%，并优化量子退火性能。

2024-12-27quant-ph

一种紧凑的QUBO编码用于计算逻辑公式的演示：在密码学构造中

A compact QUBO encoding of computational logic formulae demonstrated on cryptography constructions

Eötvös Loránd University（厄特沃什·罗兰大学）；Groq Inc.（格罗克公司）；Wigner Research Center for Physics（维格纳物理研究中心）

本文提出一种紧凑QUBO编码方法，用于密码学算法，通过减少逻辑变量数量提升效率，展示在AES、MD5等算法中的应用效果。

2026-04-15cs.CRmath-phmath.MP

量子图像去噪：一个基于 Boltzmann 机、QUBO 和量子退火的框架

Quantum Image Denoising: A Framework via Boltzmann Machines, QUBO, and Quantum Annealing

Johns Hopkins University（约翰斯·霍普金斯大学）；NASA Ames Research Center（美国国家航空航天局艾姆斯研究中心）；Research Institute of Advanced Computer Science, USRA（大学空间研究协会高级计算机科学研究所）；NEC Corporation（日本电气股份有限公司）；National Institute of Advanced Industrial Science and Technology (AIST)（日本产业技术综合研究所）

提出基于RBM与QUBO的二值图像去噪框架，给出惩罚参数最优选择及稳健修正，并在D-Wave Advantage和经典启发式近似上验证。

2023-08-18cond-mat.dis-nncs.CVeess.IV

Degeneracy Engineering for Classical and Quantum Annealing: A Case Study of Sparse Linear Regression in Collider Physics

Classical and quantum annealing are computing paradigms that have been proposed to solve a wide range of optimization problems. In this paper, we aim to enhance the performance of annealing algorithms by introducing the technique of degeneracy engineering, through which the relative degeneracy of the ground state is increased by modifying a subset of terms in the objective Hamiltonian. We illustrate this novel approach by applying it to the example of $\ell_0$-norm regularization for sparse linear regression, which is in general an NP-hard optimization problem. Specifically, we show how to cas…

2022-09-12hep-exhep-phquant-ph

量子退火器的噪声动力学：利用闲置量子比特估计有效噪声

Noise Dynamics of Quantum Annealers: Estimating the Effective Noise Using Idle Qubits

本文提出在D-Wave量子退火芯片的闲置区域嵌入随机QUBO作为噪声指示器，通过三台设备的实验验证了闲置量子比特可有效估计系统当前噪声水平并反映解质量的长期趋势。

2023-02-18cs.ETmath.COquant-ph

迈向近似优化中的量子缩放优势

Toward quantum scaling advantage in approximate optimization

Wrocław University of Science and Technology（弗罗茨瓦夫理工大学）；Quantumz.io Sp. z o.o.（Quantumz.io有限责任公司）；University of Gdańsk（格但斯克大学）；Polish Academy of Sciences（波兰科学院）

研究在近似优化中量子缩放优势，用模拟分岔机（SBM）重新审视相关发现，其源于量子动力学，与量子退火有共同特征，获得可比或更优缩放，明确当前量子退火器优势不明显及未来量子设备可实现优势的问题类。

2026-07-13physics.comp-phquant-ph

Minor-embedding heuristics for large-scale annealing processors with sparse hardware graphs of up to 102,400 nodes

Minor embedding heuristics have become an indispensable tool for compiling problems in quadratically unconstrained binary optimization (QUBO) into the hardware graphs of quantum and CMOS annealing processors. While recent embedding heuristics have been developed for annealers of moderate size (about 2000 nodes) the size of the latest CMOS annealing processor (with 102,400 nodes) poses entirely new demands on the embedding heuristic. This raises the question, if recent embedding heuristics can maintain meaningful embedding performance on hardware graphs of increasing size. Here, we develop an i…

2020-04-08cs.ETquant-ph