Optimal Quantum Likelihood Estimation

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 (NISQ) 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 [A. Te'eni et al. Oracle problems as communication tasks and optimization of quantum algorithms, 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.

6 pages, 1 figure

References in corpus (22)

• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Hybrid quantum-classical algorithms and quantum error mitigation
• Mathematical Foundation of Quantum Annealing
• Mitigating measurement errors in multi-qubit experiments
• Experimental Quantum Hamiltonian Learning
• Hamiltonian Learning and Certification Using Quantum Resources
• Mitigation of readout noise in near-term quantum devices by classical post-processing based on detector tomography
• Robust Online Hamiltonian Learning
• Quantum versus Classical Annealing of Ising Spin Glasses
• Quantum Annealing: An Overview
• Performance of hybrid quantum/classical variational heuristics for combinatorial optimization
• Determining a local Hamiltonian from a single eigenstate
• Hybrid quantum-classical algorithms in the noisy intermediate-scale quantum era and beyond
• Hybrid quantum-classical algorithms for approximate graph coloring
• Quantum Hamiltonian Learning Using Imperfect Quantum Resources
• Learning Quantum Hamiltonians from Single-qubit Measurements
• Surrogate-based optimization for variational quantum algorithms
• Analytical solution for nonadiabatic quantum annealing to arbitrary Ising spin Hamiltonian
• The advantage of quantum control in many-body Hamiltonian learning
• Active Learning of Quantum System Hamiltonians yields Query Advantage
• Faster variational quantum algorithms with quantum kernel-based surrogate models
• Surrogate-guided optimization in quantum networks

Cited by in corpus (1)

• Oracle problems as communication tasks and optimization of quantum algorithms