Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1803.02081 · Journal of the Physical Society of Japan

Statistical-Mechanical Analysis of Compressed Sensing for Hamiltonian Estimation of Ising Spin Glass

Chako Takahashi, Masayuki Ohzeki, Shuntaro Okada, Masayoshi Terabe, Shinichiro Taguchi, Kazuyuki Tanaka

Published Jun 7, 2018• 14 citations
arXivHTMLPDF

Abstract

Several powerful machines, such as the D-Wave 2000Q, dedicated to solving combinatorial optimization problems through the Ising-model formulation have been developed. To input problems into the machines, the unknown parameters on the Ising model must be determined, and this is necessarily a nontrivial task. It could be beneficial to construct a method to estimate the parameters of the Ising model from several pairs of values of the energy and spin configurations. In the present paper, we propose a simple method employing the $L_1$-norm minimization, which is based on the concept of the compressed sensing. Moreover, we analyze the typical performance of our proposed method of the Hamiltonian estimation by using the replica method. We also compare our analytical results through several numerical experiments using the alternating direction method of multipliers.

DOI
10.7566/jpsj.87.074001

Related papers

Quantum annealing: next-generation computation and how to implement it when information is missing

Masayuki Ohzeki, Chako Takahashi, Shuntaro Okada +3 more

Recently, several powerful machines dedicated to solving combinatorial optimization problems through the Ising-model formulation have appeared. The trigger for the paradigm shift to a specialized machine for solving optimization problems was the D-Wave machine, which implements quantum annealing. Quantum annealing employs quantum fluctuations to find an optimal solution to an optimization problem with discrete variables. In particular, we input the optimization problem in the form of the Ising Hamiltonian, which is a specialized form of the quadratic unconstrained binary optimization problem. However, when we employ quantum annealing for a practical optimization problem, there are several issues. One typical issue is absence of the detailed form of the cost function, which characterizes the optimization problem. To input problems into specialized machines for solving an optimization problem, it is necessary to determine the unknown parameters within the Ising model. We propose a method to estimate the unknown parameters in the Ising Hamiltonian using compressed sensing. Furthermore, we analyze the theoretical limitations of our proposed method by employing the replica method, which is a sophisticated tool in statistical mechanics.

Nonlinear Theory and Its Applications IEICE•Jan 1, 2018•13 citations

Compressed sensing based on QUBO formulation

Kazue Kudo

Abstract Ising machines efficiently solve the combinatorial optimization problems described by the Ising model or the quadratic unconstrained binary optimization (QUBO) formulation. A hybrid method based on the QUBO formulation for compressed sensing is proposed. The proposed method comprises alternative steps of discrete and continuous optimization. In the discrete optimization step, the objective function is described by the QUBO formulation. Successful examples obtained via the proposed method are demonstrated. The performance of the proposed method depends highly on the initial conditions.

Journal of Physics Conference Series•Mar 1, 2022•1 citation

Estimation of a sparse multi-qubit Hamiltonian via compressed sensing

Juntao Tu, Yuanlong Wang, Shuming Cheng +2 more

Hamiltonian estimation is an effective approach in studying the structure and dynamical evolution of quantum systems. The difficulty in estimating the Hamiltonian is that an $N$-qubit Hamiltonian has $4^N-1$ unknown parameters, requiring exponentially many equations for information extraction. In this paper we develop a method based on compressed sensing to estimate the Hamiltonian of a multi-qubit system. We identify a problem where as $N$ increases, the common sufficient condition (Restricted Isometry Property) for compressed sensing often fails, obstructing the application of compressed sensing in ($N\geq 3$)-qubit Hamiltonian estimation. To solve this problem, we propose a ``scale transformation" technique to restore RIP and ensure a compressive estimation of a $k$-sparse Hamiltonian using only $O(k\log(4^N/k))$ equations. In the numerical examples, we estimate the Hamiltonians of two 6- and 30-qubit systems, demonstrating the effectiveness of the method.

quant-pharXiv:2607.04669•Jul 7, 2026•0 citations

L0 regularization-based compressed sensing with quantum–classical hybrid approach

Toru Aonishi, Kazushi Mimura, Masato Okada +1 more

Abstract L0-regularization-based compressed sensing (L0-RBCS) has the potential to outperform L1-regularization-based compressed sensing (L1-RBCS), but the optimization in L0-RBCS is difficult because it is a combinatorial optimization problem. To perform optimization in L0-RBCS, we propose a quantum–classical hybrid system consisting of a quantum machine and a classical digital processor. The coherent Ising machine (CIM) is a suitable quantum machine for this system because this optimization problem can only be solved with a densely connected network. To evaluate the performance of the CIM-classical hybrid system theoretically, a truncated Wigner stochastic differential equation (W-SDE) is introduced as a model for the network of degenerate optical parametric oscillators, and macroscopic equations are derived by applying statistical mechanics to the W-SDE. We show that the system performance in principle approaches the theoretical limit of compressed sensing and this hybrid system may exceed the estimation accuracy of L1-RBCS in actual situations, such as in magnetic resonance imaging data analysis.

arXiv:2102.11412•Quantum Science and Technology•May 12, 2022•17 citations

An Ensemble Approach for Compressive Sensing with Quantum

Ramin Ayanzadeh, Milton Halem, Tim Finin

We leverage the idea of a statistical ensemble to improve the quality of quantum annealing based binary compressive sensing. Since executing quantum machine instructions on a quantum annealer can result in an excited state, rather than the ground state of the given Hamiltonian, we use different penalty parameters to generate multiple distinct quadratic unconstrained binary optimization (QUBO) functions whose ground state(s) represent a potential solution of the original problem. We then employ the attained samples from minimizing all corresponding (different) QUBOs to estimate the solution of the problem of binary compressive sensing. Our experiments, on a D-Wave 2000Q quantum processor, demonstrated that the proposed ensemble scheme is notably less sensitive to the calibration of the penalty parameter that controls the trade-off between the feasibility and sparsity of recoveries.

arXiv:2006.04682•Jun 8, 2020•0 citations

An Ensemble Approach for Compressive Sensing with Quantum Annealers

Ramin Ayanzadeh, Milton Halem, Tim Finin

We leverage the idea of a statistical ensemble to improve the quality of quantum annealing based binary compressive sensing. Since executing quantum machine instructions on a quantum annealer can result in an excited state, rather than the ground state of the given Hamiltonian, we use different penalty parameters to generate multiple distinct quadratic unconstrained binary optimization (QUBO) functions whose ground state(s) represent a potential solution of the original problem. We then employ the attained samples from minimizing all corresponding (different) QUBOs to estimate the solution of the problem of binary compressive sensing. Our experiments, on a D-Wave 2000Q quantum processor, demonstrated that the proposed ensemble scheme is notably less sensitive to the calibration of the penalty parameter that controls the trade-off between the feasibility and sparsity of recoveries.

IEEE International Geoscience and Remote Sensing Symposium (IGARSS)•Sep 26, 2020•18 citations
Several powerful machines, such as the D-Wave 2000Q, dedicated to solving combinatorial optimization problems through the Ising-model formulation have been developed. To input problems into the machines, the unknown parameters on the Ising model must be determined, and this is necessarily a nontrivial task. It could be beneficial to construct a method to estimate the parameters of the Ising model from several pairs of values of the energy and spin configurations. In the present paper, we propose a simple method employing the L1L_1L1​-norm minimization, which is based on the concept of the compressed sensing. Moreover, we analyze the typical performance of our proposed method of the Hamiltonian estimation by using the replica method. We also compare our analytical results through several numerical experiments using the alternating direction method of multipliers.
Recently, several powerful machines dedicated to solving combinatorial optimization problems through the Ising-model formulation have appeared. The trigger for the paradigm shift to a specialized machine for solving optimization problems was the D-Wave machine, which implements quantum annealing. Quantum annealing employs quantum fluctuations to find an optimal solution to an optimization problem with discrete variables. In particular, we input the optimization problem in the form of the Ising Hamiltonian, which is a specialized form of the quadratic unconstrained binary optimization problem. However, when we employ quantum annealing for a practical optimization problem, there are several issues. One typical issue is absence of the detailed form of the cost function, which characterizes the optimization problem. To input problems into specialized machines for solving an optimization problem, it is necessary to determine the unknown parameters within the Ising model. We propose a method to estimate the unknown parameters in the Ising Hamiltonian using compressed sensing. Furthermore, we analyze the theoretical limitations of our proposed method by employing the replica method, which is a sophisticated tool in statistical mechanics.
Abstract Ising machines efficiently solve the combinatorial optimization problems described by the Ising model or the quadratic unconstrained binary optimization (QUBO) formulation. A hybrid method based on the QUBO formulation for compressed sensing is proposed. The proposed method comprises alternative steps of discrete and continuous optimization. In the discrete optimization step, the objective function is described by the QUBO formulation. Successful examples obtained via the proposed method are demonstrated. The performance of the proposed method depends highly on the initial conditions.
Hamiltonian estimation is an effective approach in studying the structure and dynamical evolution of quantum systems. The difficulty in estimating the Hamiltonian is that an NNN-qubit Hamiltonian has 4N−14^N-14N−1 unknown parameters, requiring exponentially many equations for information extraction. In this paper we develop a method based on compressed sensing to estimate the Hamiltonian of a multi-qubit system. We identify a problem where as NNN increases, the common sufficient condition (Restricted Isometry Property) for compressed sensing often fails, obstructing the application of compressed sensing in (N≥3N\geq 3N≥3)-qubit Hamiltonian estimation. To solve this problem, we propose a ``scale transformation" technique to restore RIP and ensure a compressive estimation of a kkk-sparse Hamiltonian using only O(klog⁡(4N/k))O(k\log(4^N/k))O(klog(4N/k)) equations. In the numerical examples, we estimate the Hamiltonians of two 6- and 30-qubit systems, demonstrating the effectiveness of the method.
Abstract L0-regularization-based compressed sensing (L0-RBCS) has the potential to outperform L1-regularization-based compressed sensing (L1-RBCS), but the optimization in L0-RBCS is difficult because it is a combinatorial optimization problem. To perform optimization in L0-RBCS, we propose a quantum–classical hybrid system consisting of a quantum machine and a classical digital processor. The coherent Ising machine (CIM) is a suitable quantum machine for this system because this optimization problem can only be solved with a densely connected network. To evaluate the performance of the CIM-classical hybrid system theoretically, a truncated Wigner stochastic differential equation (W-SDE) is introduced as a model for the network of degenerate optical parametric oscillators, and macroscopic equations are derived by applying statistical mechanics to the W-SDE. We show that the system performance in principle approaches the theoretical limit of compressed sensing and this hybrid system may exceed the estimation accuracy of L1-RBCS in actual situations, such as in magnetic resonance imaging data analysis.
We leverage the idea of a statistical ensemble to improve the quality of quantum annealing based binary compressive sensing. Since executing quantum machine instructions on a quantum annealer can result in an excited state, rather than the ground state of the given Hamiltonian, we use different penalty parameters to generate multiple distinct quadratic unconstrained binary optimization (QUBO) functions whose ground state(s) represent a potential solution of the original problem. We then employ the attained samples from minimizing all corresponding (different) QUBOs to estimate the solution of the problem of binary compressive sensing. Our experiments, on a D-Wave 2000Q quantum processor, demonstrated that the proposed ensemble scheme is notably less sensitive to the calibration of the penalty parameter that controls the trade-off between the feasibility and sparsity of recoveries.
We leverage the idea of a statistical ensemble to improve the quality of quantum annealing based binary compressive sensing. Since executing quantum machine instructions on a quantum annealer can result in an excited state, rather than the ground state of the given Hamiltonian, we use different penalty parameters to generate multiple distinct quadratic unconstrained binary optimization (QUBO) functions whose ground state(s) represent a potential solution of the original problem. We then employ the attained samples from minimizing all corresponding (different) QUBOs to estimate the solution of the problem of binary compressive sensing. Our experiments, on a D-Wave 2000Q quantum processor, demonstrated that the proposed ensemble scheme is notably less sensitive to the calibration of the penalty parameter that controls the trade-off between the feasibility and sparsity of recoveries.