Hybrid quantum systems with different particle species are fundamental in quantum materials and quantum information science. In this work, we establish a rigorous theoretical framework proving that, given access to an unknown spin-boson type Hamiltonian, our algorithm achieves Heisenberg-limited estimation for all coupling parameters up to error
ε with a total evolution time
O(ε−1) using only
O(polylog(ε−1)) measurements. It is also robust against small state preparation and measurement errors. In addition, we provide an alternative algorithm based on distributed quantum sensing, which significantly reduces the evolution time per measurement. To validate our method, we demonstrate its efficiency in hybrid Hamiltonian learning and spectrum learning, with broad applications in AMO, condensed matter and high energy physics. Our results provide a scalable and robust framework for precision Hamiltonian characterization in hybrid quantum platforms.
The Learning-With-Errors (LWE) problem is a fundamental computational challenge with implications for post-quantum cryptography and computational learning theory. Here we propose a quantum-classical hybrid algorithm with Ising model to address LWE, transforming it into the Shortest Vector Problem and using variable qubits to encode lattice vectors into an Ising Hamiltonian. By identifying low-energy Hamiltonian levels, the solution is extracted, making the method suitable for noisy intermediate-scale quantum devices. The required number of qubits is less than m(m + 1), where m is the number of samples. Our heuristic algorithm’s time complexity depends on the specific quantum eigensolver used to find low-energy levels, and the performance when using the Quantum Approximate Optimization Algorithm is investigated. We validate the algorithm by solving a 2-dimensional LWE problem on a 5-qubit quantum device, demonstrating its potential for solving meaningful LWE instances on near-term quantum devices. Evaluating the security of post-quantum cryptography is critically important to ensure resilience against quantum attacks. In this paper, the authors study a complex computational task at the heart of post-quantum cryptography with a hybrid quantum-classical algorithm, heuristically finding some advantages.
Abstract A hybrid quantum–classical algorithm is a computational scheme in which quantum circuits are used to extract information that is then processed by a classical routine to guide subsequent quantum operations. These algorithms are especially valuable in the noisy intermediate-scale quantum era, where quantum resources are constrained and classical optimization plays a central role. Here, we improve the performance of a hybrid algorithm through principled, information-theoretic optimization. We focus on Quantum Likelihood Estimation (QLE)–-a hybrid algorithm designed to identify the Hamiltonian governing a quantum system by iteratively updating a weight distribution based on measurement outcomes and Bayesian inference. While QLE already achieves convergence using quantum measurements and Bayesian inference, its efficiency can vary greatly depending on the choice of parameters at each step. We propose an optimization strategy that dynamically selects the initial state, measurement basis, and evolution time in each iteration to maximize the mutual information between the measurement outcome and the true Hamiltonian. This approach builds upon the information-theoretic framework recently developed in Te’eni et al (2024 arXiv:2409.15549), and leverages mutual information as a guiding cost function for parameter selection. Our implementation employs a simulated annealing routine to minimize the conditional von Neumann entropy, thereby maximizing information gain in each iteration. The results demonstrate that our optimized version significantly reduces the number of iterations required for convergence, thus proposing a practical method for accelerating Hamiltonian learning in quantum systems. Finally, we propose a general scheme that extends our approach to solve a broader family of quantum learning problems.