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:2211.05626 · AVS Quantum Science

Multiparameter estimation of continuous-time quantum walk Hamiltonians through machine learning

Ilaria Gianani, Claudia Benedetti

Published Feb 24, 2023• 5 citations
arXivHTMLPDF

Abstract

The characterization of the Hamiltonian parameters defining a quantum walk is of paramount importance when performing a variety of tasks, from quantum communication to computation. When dealing with physical implementations of quantum walks, the parameters themselves may not be directly accessible, and, thus, it is necessary to find alternative estimation strategies exploiting other observables. Here, we perform the multiparameter estimation of the Hamiltonian parameters characterizing a continuous-time quantum walk over a line graph with n-neighbor interactions using a deep neural network model fed with experimental probabilities at a given evolution time. We compare our results with the bounds derived from estimation theory and find that the neural network acts as a nearly optimal estimator both when the estimation of two or three parameters is performed.

DOI
10.1116/5.0137398

Related papers

Estimation of one-dimensional discrete-time quantum walk parameters by using machine learning algorithms

Parth Rajauria, Prateek Chawla, C. M. Chandrashekar

Estimation of the coin parameter(s) is an important part of the problem of implementing more robust schemes for quantum simulation using quantum walks. We present the estimation of the quantum coin parameter used for one-dimensional discrete-time quantum walk evolution using machine learning algorithms on their probability distributions. We show that the models we have implemented are able to estimate these evolution parameters to a good accuracy level. We also implement a deep learning model that is able to predict multiple parameters simultaneously. Since discrete-time quantum walks can be used as quantum simulators, these models become important when extrapolating the quantum walk parameters from the probability distributions of the quantum system that is being simulated.

arXiv:2007.04572•Jul 9, 2020•4 citations

Multiparameter function estimation for general Hamiltonians

Erfan Abbasgholinejad, Sean R. Muleady, Jacob Bringewatt +2 more

Estimation of physical parameters encoded in a Hamiltonian is a central task in quantum sensing and learning. While the ultimate precision limit for estimating a single parameter coupled to a single generator is well established, the corresponding bound for estimating a function of multiple parameters-each coupled to distinct and possibly non-commuting generators-remains unknown in general. Here, we derive the ultimate quantum limit and present an estimation protocol for any function of parameters in a general Hamiltonian that attains this bound. We show that, although the task is fundamentally a multiparameter problem, our tight bound reduces to an optimized single-parameter quantum Cramér-Rao bound, even for arbitrary generator sets. Our result unifies and extends previous works, providing a general framework for optimal function estimation in quantum systems.

quant-pharXiv:2605.04136•May 7, 2026•3 citations

Multiparameter quantum estimation of circulant networks

Maria Popovic, Silvia Cassina, Ilaria Gianani +1 more

Networks provide a natural description of interaction patterns, transport media, and communication architectures. Accurately characterizing their coupling structure is a key challenge in quantum technologies. We investigate the multiparameter quantum estimation of coupling strengths in circulant networks probed by continuous-time quantum walks. We derive the quantum Fisher information matrix, identify the optimal probe states and determine the ultimate precision allowed by quantum measurements, together with its scaling with the number of unknown couplings. We further analyze the precision achievable through position measurements of the walker, comparing the corresponding classical Cramér-Rao bounds for optimal and localized probe states with the quantum limit. Finally, we consider finite-resolution detection modeled by coarse-grained position measurements. Although coarse graining generally reduces estimation precision, we find that lower-resolution measurements can, in some instances, outperform other measurements with finer spatial resolution. Our results provide a systematic characterization of the fundamental and practical limits of coupling estimation in quantum-walk-based network inference.

arXiv:2611.13948•Nov 10, 2026•0 citations

Quantum parameter estimation with uncertainty quantification from continuous measurement data using neural network ensembles

Amanuel Anteneh

Abstract We show that ensembles of deep neural networks, called deep ensembles, can be used to perform quantum parameter estimation while also providing a means for quantifying uncertainty in parameter estimates, which is a key advantage of using Bayesian inference for parameter estimation that is lost when using existing machine learning methods. We show that optimizing for both accurate parameter estimates and well calibrated uncertainty estimates does not lead to degradation in the former as opposed to only optimizing for accuracy. We also show that the drift detection capabilities of these ensemble models can be used to detect drift in the experimental data used during inference. This approach is also shown to provide much faster inference time than both likelihood-based and likelihood-free Bayesian inference. These results suggest that such models could enable accurate, real-time parameter estimation with quantified uncertainty, making them promising candidates for deployment in experimental settings.

arXiv:2509.10756•Journal of Physics B Atomic Molecular and Optical Physics•Oct 5, 2026•1 citation

Machine-Learning-Assisted Parameterization of Quantum Walk Algorithms

Parham Ghayour

Abstract Quantum walk algorithms constitute a central primitive in quantum computation, yet their practical performance often depends sensitively on the choice of execution parameters such as walk depth and initial state. Analytical parameter choices are typically conservative and instance-agnostic, which can lead to suboptimal behavior on specific problem instances. In this work, we propose a general framework for machine-learning-assisted parameterization of quantum walk algorithms, in which classical learning is used to adapt algorithmic parameters without modifying the underlying quantum decision logic. The machine learning component op erates exclusively as a classical control layer, preserving correctness guarantees while improving average-case performance. We demonstrate the framework through an application to the s–t connectivity problem, a canonical benchmark in graph algorithms and complexity theory. Classical simulations of discrete-time quantum walks on randomly generated sparse graphs show that ML-assisted pa rameter selection substantially improves success probability compared to fixed-parameter base lines, yielding multiplicative gains in average performance. These improvements are achieved despite only coarse prediction accuracy, highlighting the robustness of the approach. The results suggest a principled role for machine learning as an adaptive optimization layer in quantum algorithms, offering a practical path toward hybrid quantum–classical methods that enhance performance while maintaining theoretical soundness

•Dec 23, 2025•0 citations

Deep reinforcement learning for quantum multiparameter estimation

Valeria Cimini, Mauro Valeri, Emanuele Polino +6 more

Estimation of physical quantities is at the core of most scientific research, and the use of quantum devices promises to enhance its performances. In real scenarios, it is fundamental to consider that resources are limited, and Bayesian adaptive estimation represents a powerful approach to efficiently allocate, during the estimation process, all the available resources. However, this framework relies on the precise knowledge of the system model, retrieved with a fine calibration, with results that are often computationally and experimentally demanding. We introduce a model-free and deep-learning-based approach to efficiently implement realistic Bayesian quantum metrology tasks accomplishing all the relevant challenges, without relying on any a priori knowledge of the system. To overcome this need, a neural network is trained directly on experimental data to learn the multiparameter Bayesian update. Then the system is set at its optimal working point through feedback provided by a reinforcement learning algorithm trained to reconstruct and enhance experiment heuristics of the investigated quantum sensor. Notably, we prove experimentally the achievement of higher estimation performances than standard methods, demonstrating the strength of the combination of these two black-box algorithms on an integrated photonic circuit. Our work represents an important step toward fully artificial intelligence-based quantum metrology.

arXiv:2209.00671•Advanced Photonics•Feb 6, 2023•58 citations
The characterization of the Hamiltonian parameters defining a quantum walk is of paramount importance when performing a variety of tasks, from quantum communication to computation. When dealing with physical implementations of quantum walks, the parameters themselves may not be directly accessible, and, thus, it is necessary to find alternative estimation strategies exploiting other observables. Here, we perform the multiparameter estimation of the Hamiltonian parameters characterizing a continuous-time quantum walk over a line graph with n-neighbor interactions using a deep neural network model fed with experimental probabilities at a given evolution time. We compare our results with the bounds derived from estimation theory and find that the neural network acts as a nearly optimal estimator both when the estimation of two or three parameters is performed.
Estimation of the coin parameter(s) is an important part of the problem of implementing more robust schemes for quantum simulation using quantum walks. We present the estimation of the quantum coin parameter used for one-dimensional discrete-time quantum walk evolution using machine learning algorithms on their probability distributions. We show that the models we have implemented are able to estimate these evolution parameters to a good accuracy level. We also implement a deep learning model that is able to predict multiple parameters simultaneously. Since discrete-time quantum walks can be used as quantum simulators, these models become important when extrapolating the quantum walk parameters from the probability distributions of the quantum system that is being simulated.
Estimation of physical parameters encoded in a Hamiltonian is a central task in quantum sensing and learning. While the ultimate precision limit for estimating a single parameter coupled to a single generator is well established, the corresponding bound for estimating a function of multiple parameters-each coupled to distinct and possibly non-commuting generators-remains unknown in general. Here, we derive the ultimate quantum limit and present an estimation protocol for any function of parameters in a general Hamiltonian that attains this bound. We show that, although the task is fundamentally a multiparameter problem, our tight bound reduces to an optimized single-parameter quantum Cramér-Rao bound, even for arbitrary generator sets. Our result unifies and extends previous works, providing a general framework for optimal function estimation in quantum systems.
Networks provide a natural description of interaction patterns, transport media, and communication architectures. Accurately characterizing their coupling structure is a key challenge in quantum technologies. We investigate the multiparameter quantum estimation of coupling strengths in circulant networks probed by continuous-time quantum walks. We derive the quantum Fisher information matrix, identify the optimal probe states and determine the ultimate precision allowed by quantum measurements, together with its scaling with the number of unknown couplings. We further analyze the precision achievable through position measurements of the walker, comparing the corresponding classical Cramér-Rao bounds for optimal and localized probe states with the quantum limit. Finally, we consider finite-resolution detection modeled by coarse-grained position measurements. Although coarse graining generally reduces estimation precision, we find that lower-resolution measurements can, in some instances, outperform other measurements with finer spatial resolution. Our results provide a systematic characterization of the fundamental and practical limits of coupling estimation in quantum-walk-based network inference.
Abstract We show that ensembles of deep neural networks, called deep ensembles, can be used to perform quantum parameter estimation while also providing a means for quantifying uncertainty in parameter estimates, which is a key advantage of using Bayesian inference for parameter estimation that is lost when using existing machine learning methods. We show that optimizing for both accurate parameter estimates and well calibrated uncertainty estimates does not lead to degradation in the former as opposed to only optimizing for accuracy. We also show that the drift detection capabilities of these ensemble models can be used to detect drift in the experimental data used during inference. This approach is also shown to provide much faster inference time than both likelihood-based and likelihood-free Bayesian inference. These results suggest that such models could enable accurate, real-time parameter estimation with quantified uncertainty, making them promising candidates for deployment in experimental settings.
Abstract Quantum walk algorithms constitute a central primitive in quantum computation, yet their practical performance often depends sensitively on the choice of execution parameters such as walk depth and initial state. Analytical parameter choices are typically conservative and instance-agnostic, which can lead to suboptimal behavior on specific problem instances. In this work, we propose a general framework for machine-learning-assisted parameterization of quantum walk algorithms, in which classical learning is used to adapt algorithmic parameters without modifying the underlying quantum decision logic. The machine learning component op erates exclusively as a classical control layer, preserving correctness guarantees while improving average-case performance. We demonstrate the framework through an application to the s–t connectivity problem, a canonical benchmark in graph algorithms and complexity theory. Classical simulations of discrete-time quantum walks on randomly generated sparse graphs show that ML-assisted pa rameter selection substantially improves success probability compared to fixed-parameter base lines, yielding multiplicative gains in average performance. These improvements are achieved despite only coarse prediction accuracy, highlighting the robustness of the approach. The results suggest a principled role for machine learning as an adaptive optimization layer in quantum algorithms, offering a practical path toward hybrid quantum–classical methods that enhance performance while maintaining theoretical soundness
Estimation of physical quantities is at the core of most scientific research, and the use of quantum devices promises to enhance its performances. In real scenarios, it is fundamental to consider that resources are limited, and Bayesian adaptive estimation represents a powerful approach to efficiently allocate, during the estimation process, all the available resources. However, this framework relies on the precise knowledge of the system model, retrieved with a fine calibration, with results that are often computationally and experimentally demanding. We introduce a model-free and deep-learning-based approach to efficiently implement realistic Bayesian quantum metrology tasks accomplishing all the relevant challenges, without relying on any a priori knowledge of the system. To overcome this need, a neural network is trained directly on experimental data to learn the multiparameter Bayesian update. Then the system is set at its optimal working point through feedback provided by a reinforcement learning algorithm trained to reconstruct and enhance experiment heuristics of the investigated quantum sensor. Notably, we prove experimentally the achievement of higher estimation performances than standard methods, demonstrating the strength of the combination of these two black-box algorithms on an integrated photonic circuit. Our work represents an important step toward fully artificial intelligence-based quantum metrology.