Parameter Estimation with Reluctant Quantum Walks: a Maximum Likelihood approach
Demosthenes Ellinas, Peter D. Jarvis, Matthew Pearce

TL;DR
This paper develops a maximum likelihood estimation method for a parameter in quantum walks, analyzing the probability distribution of displacements and introducing a 'reluctant walker' behavior to estimate the parameter robustly.
Contribution
It provides an analytic framework for parameter estimation in quantum walks using likelihood peakedness and return probabilities, a novel approach in quantum walk theory.
Findings
Likelihood sharply peaked at displacement ratio d/k for large k
Reluctant walker behavior enables robust parameter estimation
Analytic probability distribution for quantum walk displacements
Abstract
The parametric maximum likelihood estimation problem is addressed in the context of quantum walk theory for quantum walks on the lattice of integers. A coin action is presented, with the real parameter to be estimated identified with the angular argument of an orthogonal reshuffling matrix. We provide analytic results for the probability distribution for a quantum walker to be displaced by units from its initial position after steps. For large, we show that the likelihood is sharply peaked at a displacement determined by the ratio , which is correlated with the reshuffling parameter . We suggest that this `reluctant walker' behaviour provides the framework for maximum likelihood estimation analysis, allowing for robust parameter estimation of via return probabilities of closed evolution loops and quantum measurements of the position of quantum…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum-Dot Cellular Automata · Quantum Information and Cryptography
