paper-with-me

Papers

A regression algorithm for accelerated lattice QCD that exploits sparse inference on the D-Wave quantum annealer

2019-11-14 · Nga T. T. Nguyen, Garrett T. Kenyon, Boram Yoon

We propose a regression algorithm that utilizes a learned dictionary optimized for sparse inference on a D-Wave quantum annealer. In this regression algorithm, we concatenate the independent and dependent variables as a combined vector, and encode the high-order correlations between them into a dictionary optimized for sparse reconstruction. On a test dataset, the dependent variable is initialized to its average value and then a sparse reconstruction of the combined vector is obtained in which the dependent variable is typically shifted closer to its true value, as in a standard inpainting or denoising task. Here, a quantum annealer, which can presumably exploit a fully entangled initial state to better explore the complex energy landscape, is used to solve the highly non-convex sparse coding optimization problem. The regression algorithm is demonstrated for a lattice quantum chromodynamics simulation data using a D-Wave 2000Q quantum annealer and good prediction performance is achieved. The regression test is performed using six different values for the number of fully connected logical qubits, between 20 and 64. The scaling results indicate that a larger number of qubits gives better prediction accuracy.

📄 PDF Abstract BibTeX arXiv:1911.06267

Code (0)

등록된 구현이 없습니다.

Tasks

Denoisingregression

Methods 이 논문이 사용한 방법론

Test 설명 없음

Similar Papers 제목 키워드 기반

Sparse Linear Regression and Lattice Problems

2024-02-22 · Aparna Gupte, Neekon Vafa, Vinod Vaikuntanathan

Sparse linear regression (SLR) is a well-studied problem in statistics where one is given a design matrix $X\in\mathbb{R}^{m\times n}$ and a response vector $y=X\theta^*+w$ for a $k$-sparse vector $\theta^*$ (that is, $\…

regression

Prediction and compression of lattice QCD data using machine learning algorithms on quantum annealer

2021-12-03 · Boram Yoon, Chia Cheng Chang, Garrett T. Kenyon, Nga T. T. Nguyen 외

We present regression and compression algorithms for lattice QCD data utilizing the efficient binary optimization ability of quantum annealers. In the regression algorithm, we encode the correlation between the input and…

BIG-bench Machine Learningregression

Accelerated Block Coordinate Proximal Gradients with Applications in High Dimensional Statistics

2017-10-15 · Tsz Kit Lau, Yuan YAO

Nonconvex optimization problems arise in different research fields and arouse lots of attention in signal processing, statistics and machine learning. In this work, we explore the accelerated proximal gradient method and…

BIG-bench Machine LearningregressionVocal Bursts Intensity Prediction

Accelerated Sparse Subspace Clustering

2017-10-31 · Abolfazl Hashemi, Haris Vikalo

State-of-the-art algorithms for sparse subspace clustering perform spectral clustering on a similarity matrix typically obtained by representing each data point as a sparse combination of other points using either basis …

Clustering

GPU-Accelerated Forward-Backward algorithm with Application to Lattice-Free MMI

2021-10-22 · Lucas Ondel, Léa-Marie Lam-Yee-Mui, Martin Kocour, Caio Filippo Corro 외

We propose to express the forward-backward algorithm in terms of operations between sparse matrices in a specific semiring. This new perspective naturally leads to a GPU-friendly algorithm which is easy to implement in J…

GPU