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:2607.04669

Estimation of a sparse multi-qubit Hamiltonian via compressed sensing

Juntao Tu, Yuanlong Wang, Shuming Cheng, Shuixin Xiao, Zhibo Hou

quant-phSubmitted Jul 6, 2026• Announced Jul 7, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

Related papers

Estimation of many-body quantum Hamiltonians via compressive sensing

Alireza Shabani, Masoud Mohseni, Seth Lloyd +2 more

We develop an efficient and robust approach for quantum measurement of nearly sparse many-body quantum Hamiltonians based on the method of compressive sensing. This work demonstrates that with only $O(s\mathrm{ln}(d))$ experimental configurations, consisting of random local preparations and measurements, one can estimate the Hamiltonian of a $d$-dimensional system, provided that the Hamiltonian is nearly $s$ sparse in a known basis. The classical postprocessing is a convex optimization problem on the total Hilbert space which is generally not scalable. We numerically simulate the performance of this algorithm for three- and four-body interactions in spin-coupled quantum dots and atoms in optical lattices. Furthermore, we apply the algorithm to characterize Hamiltonian fine structure and unknown system-bath interactions.

arXiv:1002.1330•Physical Review A•Jul 11, 2011•78 citations

Compressing measurements in quantum dynamic parameter estimation

Easwar Magesan, Alexandre Cooper, Paola Cappellaro

We present methods that can provide an exponential savings in the resources required to perform dynamic parameter estimation using quantum systems. The key idea is to merge classical compressive sensing techniques with quantum control methods to significantly reduce the number of signal coefficients that are required for reconstruction of time-varying parameters with high fidelity. We show that incoherent measurement bases and, more generally, suitable random measurement matrices can be created by performing simple control sequences on the quantum system. Random measurement matrices satisfying the restricted isometry property can be used efficiently to reconstruct signals that are sparse in any basis. Because many physical processes are approximately sparse in some basis, these methods can benefit a variety of applications such as quantum sensing and magnetometry with nitrogen-vacancy centers.

arXiv:1308.0313•Physical Review A•Dec 23, 2013•17 citations

Efficient Measurement of Quantum Dynamics via Compressive Sensing

Alireza Shabani, Robert L. Kosut, Masoud Mohseni +5 more

The resources required to characterize the dynamics of engineered quantum systems--such as quantum computers and quantum sensors--grow exponentially with system size. Here we adapt techniques from compressive sensing to exponentially reduce the experimental configurations required for quantum process tomography. Our method is applicable to processes that are nearly sparse in a certain basis and can be implemented using only single-body preparations and measurements. We perform efficient, high-fidelity estimation of process matrices of a photonic two-qubit logic gate. The database is obtained under various decoherence strengths. Our technique is both accurate and noise robust, thus removing a key roadblock to the development and scaling of quantum technologies.

arXiv:0910.5498•Physical Review Letters•Mar 7, 2011•227 citations

Compressed Sensing Quantum State Tomography Assisted by Adaptive Design

Qi Yin, Guo‐Yong Xiang, Chuan‐Feng Li +1 more

The recently proposed compressed sensing (CS) method sheds light on quantum state tomography of multi-qubit systems with low rank, which greatly reduces the complexity of measurement and computation. However, the restricted isometry property requirement of CS is difficult to be promised or verified in practice, which makes this method probably assign unreasonable results. In regard to this problem, we adopt a two-step procedure and implement an adaptive strategy to update measurement operators based on the measurement results of the first step for CS, which not only serves as a way to verify the estimate but also improves the accuracy of tomography. Our numerical simulations manifest that our adaptive protocol can reduce about half of the infidelity of non-adaptive protocol and is still efficient even when the rank of the state is slightly high, which would greatly benefit multi-qubit state tomography in future experiments .

Chinese Physics Letters•Jul 1, 2018•3 citations

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

Chako Takahashi, Masayuki Ohzeki, Shuntaro Okada +3 more

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.

arXiv:1803.02081•Journal of the Physical Society of Japan•Jun 7, 2018•14 citations

Learning k -Body Hamiltonians via Compressed Sensing

Muzhou Ma, Steven T. Flammia, John P. Preskill +1 more

We study the problem of learning a $k$-body Hamiltonian with $M$ unknown Pauli terms that are not necessarily geometrically local. We propose a protocol that learns the Hamiltonian to precision $ε$ with total evolution time ${\mathcal{O}}(M^{1/2+1/p}/ε)$ up to logarithmic factors, where the error is quantified by the $\ell^p$-distance between Pauli coefficients. Our learning protocol uses only single-qubit control operations and a GHZ state initial state, is non-adaptive, is robust against SPAM errors, and performs well even if $M$ and $k$ are not precisely known in advance or if the Hamiltonian is not exactly $M$-sparse. Methods from the classical theory of compressed sensing are used for efficiently identifying the $M$ terms in the Hamiltonian from among all possible $k$-body Pauli operators. We also provide a lower bound on the total evolution time needed in this learning task, and we discuss the operational interpretations of the $\ell^1$ and $\ell^2$ error metrics. In contrast to most previous works, our learning protocol requires neither geometric locality nor any other relaxed locality conditions.

arXiv:2410.18928•IEEE Transactions on Information Theory•Aug 6, 2026•1 citation
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.
We develop an efficient and robust approach for quantum measurement of nearly sparse many-body quantum Hamiltonians based on the method of compressive sensing. This work demonstrates that with only O(sln(d))O(s\mathrm{ln}(d))O(sln(d)) experimental configurations, consisting of random local preparations and measurements, one can estimate the Hamiltonian of a ddd-dimensional system, provided that the Hamiltonian is nearly sss sparse in a known basis. The classical postprocessing is a convex optimization problem on the total Hilbert space which is generally not scalable. We numerically simulate the performance of this algorithm for three- and four-body interactions in spin-coupled quantum dots and atoms in optical lattices. Furthermore, we apply the algorithm to characterize Hamiltonian fine structure and unknown system-bath interactions.
We present methods that can provide an exponential savings in the resources required to perform dynamic parameter estimation using quantum systems. The key idea is to merge classical compressive sensing techniques with quantum control methods to significantly reduce the number of signal coefficients that are required for reconstruction of time-varying parameters with high fidelity. We show that incoherent measurement bases and, more generally, suitable random measurement matrices can be created by performing simple control sequences on the quantum system. Random measurement matrices satisfying the restricted isometry property can be used efficiently to reconstruct signals that are sparse in any basis. Because many physical processes are approximately sparse in some basis, these methods can benefit a variety of applications such as quantum sensing and magnetometry with nitrogen-vacancy centers.
The resources required to characterize the dynamics of engineered quantum systems--such as quantum computers and quantum sensors--grow exponentially with system size. Here we adapt techniques from compressive sensing to exponentially reduce the experimental configurations required for quantum process tomography. Our method is applicable to processes that are nearly sparse in a certain basis and can be implemented using only single-body preparations and measurements. We perform efficient, high-fidelity estimation of process matrices of a photonic two-qubit logic gate. The database is obtained under various decoherence strengths. Our technique is both accurate and noise robust, thus removing a key roadblock to the development and scaling of quantum technologies.
The recently proposed compressed sensing (CS) method sheds light on quantum state tomography of multi-qubit systems with low rank, which greatly reduces the complexity of measurement and computation. However, the restricted isometry property requirement of CS is difficult to be promised or verified in practice, which makes this method probably assign unreasonable results. In regard to this problem, we adopt a two-step procedure and implement an adaptive strategy to update measurement operators based on the measurement results of the first step for CS, which not only serves as a way to verify the estimate but also improves the accuracy of tomography. Our numerical simulations manifest that our adaptive protocol can reduce about half of the infidelity of non-adaptive protocol and is still efficient even when the rank of the state is slightly high, which would greatly benefit multi-qubit state tomography in future experiments .
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.
We study the problem of learning a kkk-body Hamiltonian with MMM unknown Pauli terms that are not necessarily geometrically local. We propose a protocol that learns the Hamiltonian to precision εεε with total evolution time O(M1/2+1/p/ε){\mathcal{O}}(M^{1/2+1/p}/ε)O(M1/2+1/p/ε) up to logarithmic factors, where the error is quantified by the ℓp\ell^pℓp-distance between Pauli coefficients. Our learning protocol uses only single-qubit control operations and a GHZ state initial state, is non-adaptive, is robust against SPAM errors, and performs well even if MMM and kkk are not precisely known in advance or if the Hamiltonian is not exactly MMM-sparse. Methods from the classical theory of compressed sensing are used for efficiently identifying the MMM terms in the Hamiltonian from among all possible kkk-body Pauli operators. We also provide a lower bound on the total evolution time needed in this learning task, and we discuss the operational interpretations of the ℓ1\ell^1ℓ1 and ℓ2\ell^2ℓ2 error metrics. In contrast to most previous works, our learning protocol requires neither geometric locality nor any other relaxed locality conditions.