betaFeedback

WorksPhysics and Astronomy

Multiparameter quantum estimation of circulant networks

Abstract

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.

Introduction

Many physical systems of interest can be represented as networks. Examples are photonic lattices, spin networks, and quantum communication architectures [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11]. The functionality of these systems is largely determined by the coupling strengths between their nodes, which govern transport, communication, and information-processing capabilities. Accurately characterizing such couplings is therefore essential for the control, simulation, and practical implementation of networked quantum systems.

A natural approach is to probe the network through the dynamics of a quantum system evolving on its nodes and infer the couplings from the resulting measurement statistics. Within this framework, the inference of coupling strengths can be formulated as a Hamiltonian estimation problem [12, 13, 14, 15] and analysed using the tools of multiparameter quantum estimation theory [16, 17, 18, 19, 20, 21]. Estimating several couplings simultaneously is generally harder than estimating them individually, since the optimal probe states and measurements associated with different parameters may be incompatible [22, 23, 24, 25, 26, 27, 28, 29]. Consequently, determining the ultimate precision bounds of network inference results in a genuinely multiparameter problem. Multiparameter quantum estimation has been applied to the characterization of quantum Hamiltonians and networked quantum systems, ranging from quantum sensing to Hamiltonian learning and interacting many-body systems [30, 31, 32, 33, 34, 35, 36]. Despite its broad applicability, exact results remain available only for a limited number of models. This motivates the search for physically relevant systems that admit an analytical treatment while remaining relevant to realistic multiparameter estimation scenarios.

In this work, we focus on circulant graphs, a broad class of networks characterized by discrete translational symmetry. Circulant topologies encompass a wide range of physically relevant structures, interpolating between nearest-neighbour tight-binding models and weighted complete graphs with all-to-all interactions [37, 38]. At the same time, they provide a realistic description of distance-dependent couplings while remaining analytically tractable. Each vertex of the graph is identified with a basis state of the system while the network topology specifies the couplings between basis states. The resulting Hamiltonian governs the dynamics of quantum excitations across the network. The coherent propagation of a quantum state on such networks is naturally described within the framework of continuous-time quantum walks (QWs), which have become a versatile tool for the study of quantum transport [39, 40, 41, 42, 43, 44, 45], quantum algorithms [46, 47, 48, 49, 50, 51, 52] and fundamental phenomena such as quantum-to-classical transitions and decoherence [53, 54, 55, 56, 57, 58, 59]. Their dynamics directly encodes the underlying network structure and therefore provides a natural probe for the reconstruction and estimation of coupling strengths [60, 61, 62].

Here, we apply multiparameter quantum estimation theory to determine the fundamental precision limits for inferring the couplings of circulant networks, from measurements performed on a continuous-time quantum walk. We derive analytical expressions for the quantum Fisher information matrix for an arbitrary interaction range and show that the weak compatibility condition is always satisfied, implying that the quantum Cramér-Rao bound is attainable throughout the class of models considered. We further characterize the optimal probe states, analyse the scaling of the quantum bound with the number of estimated couplings, and derive analytical expressions for the Fisher information associated with experimentally accessible position measurements. Finally, for the specific case of first- and second-neighbour couplings, we investigate the impact of finite detector resolution through coarse-grained measurements, identifying both symmetry-induced losses of information and regimes in which lower-resolution measurements can outperform other coarse-grained measurement schemes of higher spatial resolution.

The paper is organized as follows: In Sec. II we introduce continuous-time quantum walks on circulant graphs and review the multiparameter estimation framework adopted throughout the work. In Sec. III we present analytical results about the quantum Fisher information matrix, the scaling of the quantum Cramér–Rao bound with the number of estimated parameters, and the characterization of optimal probe states. In Sec. IV we specialize the analysis to the two-parameter problem corresponding to first- and second-neighbour couplings, and study both ideal and realistic measurement strategies. Finally, Sec. V summarizes the main results and discusses future perspectives.

Methods

Let G(V,E)G(V,E) be a graph with vertex set VV and edge set EE. The Hilbert space is spanned by the orthonormal position basis {∣v⟩}v=1n\{|v\rangle\}_{v=1}^{n}, where each basis state is associated with a graph vertex and n=∣V∣n = |V| denotes the number of vertices. We consider continuous-time quantum-walk dynamics generated by the Hamiltonian

H=−∑(u,v)∈Ejuv(∣u⟩⟨v∣+∣v⟩⟨u∣)+∑v∈Vϵv∣v⟩⟨v∣,(1)H = - \sum_{(u,v)\in E} j_{uv} \left(|u\rangle\langle v| + |v\rangle\langle u|\right) + \sum_{v\in V} \epsilon_v |v\rangle\langle v|, \tag*{(1)}

where ϵv\epsilon_v is the on-site energy at vertex vv, and juvj_{uv} is the coupling strength between two connected vertices (u,v)(u,v). We assume symmetric couplings juv=jvuj_{uv}=j_{vu}, with juv∈Rj_{uv}\in\mathbb{R} and homogeneous on-site energies, ϵv=ϵ\epsilon_v=\epsilon. The coupling strengths {juv}\{j_{uv}\} encode the structure of the underlying network and constitute the parameters to be estimated. Our objective is to characterize how accurately these parameters can be inferred from measurements performed on the evolving quantum walk.

Circulant graphs

parameters can be inferred from measurements performed on the evolving quantum walk. Throughout this work, we consider unitary evolutions of pure states, generated by Eq. (1), with time-evolution operator Ut=e−itHU_t=e^{-itH}. In the following, we introduce the class of circulant graphs, review the relevant concepts of multiparameter quantum estimation theory, and discuss how experimental constraints affect the achievable estimation precision.

A circulant graph is a regular graph whose adjacency structure is invariant under a cyclic permutation of its vertices. We consider circulant graphs where each vertex is connected up to its KK-th neighbours. Increasing KK modifies the topology, from the simple cycle graph with only nearest-neighbour interactions, to the complete graph representing an all-to-all network, as shown in Figure 1. The coupling strengths associated with interactions at distance α\alpha are denoted jαj_\alpha (α=1,…,K\alpha=1,\ldots,K).

Figure 1. Circulant graphs with n=8n = 8 vertices. The interaction range between vertices can be increased while maintaining cyclic symmetry, starting from nearest-neighbour couplings j1j_1 in (a), to second-neighbour interactions in (b), and up to a complete graph with fourth-neighbour interactions in (c).

Any circulant matrix can be expressed as A=∑α=1ncασnα−1\mathbf{A}=\sum_{\alpha=1}^{n}c_\alpha\boldsymbol{\sigma}_n^{\alpha-1}, where {cα}\{c_\alpha\} are the elements of its first row. σn\boldsymbol{\sigma}_n is the n×nn\times n forward cyclic shift matrix, that generates the required circulant structure, defined via its elements (σn)kj=δk,j−2(modn)+1(\sigma_n)_{kj}=\delta_{k,j-2\pmod{n}+1}, with k,j=1,…,nk,j=1,\ldots,n. The powers σnα\sigma_n^\alpha generate jump operators that cyclically translate the walker by α\alpha sites in the counter-clockwise direction and σn0=In\sigma_n^0=\mathbb{I}_n is the identity matrix. With this definition each row of A\mathbf{A} is obtained from the previous one by a cyclic right-shift [38].

The QW Hamiltonian H\mathbf{H} inherits the circulant structure of the underlying graph and can thus be written in the general form H=ϵIn−∑α=1n−1jασnα\mathbf{H}=\epsilon\mathbb{I}_n-\sum_{\alpha=1}^{n-1}j_\alpha\sigma_n^\alpha. We set the energy offset ϵ\epsilon to zero without loss of generality. Requiring H\mathbf{H} to be real and symmetric, implies jα=jn−αj_\alpha=j_{n-\alpha} ∀α=1,…,K\forall\alpha=1,\ldots,K, so that the model up to KK-th neighbours (with K≤⌊n−12⌋K\le\left\lfloor\frac{n-1}{2}\right\rfloor) takes the form:

H(K)=−∑α=1Kjα(σnα+σnn−α)=∑α=1KjαHα,(2)\mathbf{H}(K)=-\sum_{\alpha=1}^{K}j_\alpha\left(\sigma_n^\alpha+\sigma_n^{n-\alpha}\right)=\sum_{\alpha=1}^{K}j_\alpha\mathbf{H}_\alpha, \tag*{(2)}

where Hα=−(σnα+σnn−α)\mathbf{H}_\alpha=-\left(\sigma_n^\alpha+\sigma_n^{n-\alpha}\right) denotes the contribution associated with couplings between vertices at distance α\alpha. The complete graph with an odd number of vertices is recovered from Eq. (2) by setting K=(n−1)/2K=(n-1)/2. For even, an additional contribution Hn/2=−σnn/2\mathbf{H}_{n/2}=-\sigma_n^{n/2} corresponding to the unique vertex opposite to each site, must be included. It follows that

Hcompl=H(⌊n−12⌋)−Ieven(n)jn/2σnn/2,(3)\mathbf{H}_{\mathrm{compl}}=\mathbf{H}\left(\left\lfloor\frac{n-1}{2}\right\rfloor\right)-\mathbb{I}_{\mathrm{even}}(n)j_{n/2}\sigma_n^{n/2}, \tag*{(3)}

where Ieven(n)I_{\mathrm{even}}(n) is the indicator function that returns 11 if nn is even and 00 otherwise. Since the powers σnα\sigma_n^\alpha are also circulant matrices, the Hamiltonian remains circulant for any interaction range. As such, it is diagonalized by the Fourier matrix, and its eigenvalues are [38, 63]

ϵk=−2∑α=1Kjαcos⁡(2πkαn)if K≤⌊n−12⌋.(4)\epsilon_k=-2\sum_{\alpha=1}^{K}j_\alpha\cos\left(\frac{2\pi k\alpha}{n}\right)\quad\text{if }K\le\left\lfloor\frac{n-1}{2}\right\rfloor. \tag*{(4)}

whereas for the complete graph with even nn,

ϵk=−2∑α=1n−22jαcos⁡(2πkαn)−jn2(−1)kif K=n2.(5)\epsilon_k=-2\sum_{\alpha=1}^{\frac{n-2}{2}}j_\alpha\cos\left(\frac{2\pi k\alpha}{n}\right)-j_{\frac{n}{2}}(-1)^k\quad\text{if }K=\frac{n}{2}. \tag*{(5)}

The eigenvalue index spans k=0,1,…,n−1k=0,1,\ldots,n-1. The eigenvectors of H\mathbf{H} are the columns of the Fourier matrix [38],

∣ϵk⟩=1n∑v=1ne2πin(v−1)k∣v⟩,k=0,…,n−1(6)|\epsilon_k\rangle=\frac{1}{\sqrt{n}}\sum_{v=1}^{n}e^{\frac{2\pi i}{n}(v-1)k}|v\rangle,\qquad k=0,\ldots,n-1 \tag*{(6)}

and they form an orthonormal basis, satisfying ⟨ϵk∣ϵj⟩=δkj\langle\epsilon_k|\epsilon_j\rangle=\delta_{kj}. The Hamiltonian spectrum is degenerate, with ϵk=ϵn−k\epsilon_k=\epsilon_{n-k}. For even nn, the eigenstates ∣ϵ0⟩|\epsilon_0\rangle and ∣ϵn/2⟩|\epsilon_{n/2}\rangle are the only real non-degenerate eigenvectors, while the remaining eigenvectors are degenerate and form (n−2)/2(n-2)/2 complex conjugate pairs of states. For odd nn, only the ground eigenstate ∣ϵ0⟩|\epsilon_0\rangle is non-degenerate, and the remaining eigenvectors form (n−1)/2(n-1)/2 complex conjugate pairs.

Multiparameter estimation

Consider a system whose state depends on a vector of unknown parameters j=(j1,j2,…,jK)T\mathbf{j}=(j_1,j_2,\ldots,j_K)^T. Local multiparameter estimation theory provides fundamental bounds on the precision with which these parameters can be estimated from measurement outcomes. The precision of an estimator j^=(j^1,j^2,…,j^K)\hat{\mathbf{j}}=(\hat{j}_1,\hat{j}_2,\ldots,\hat{j}_K) is quantified by its covariance matrix Cov⁡(j^)\operatorname{Cov}(\hat{\mathbf{j}}), with elements Cov⁡(j^)α,β=⟨(j^α−jα)(j^β−jβ)⟩\operatorname{Cov}(\hat{\mathbf{j}})_{\alpha,\beta}=\langle(\hat{j}_\alpha-j_\alpha)(\hat{j}_\beta-j_\beta)\rangle, where the average is taken over the conditional probability distribution p(x∣j)p(x|\mathbf{j}) associated with measurement outcomes. The multiparameter classical Cramér–Rao (CCR) bound provides the matrix inequality

Cov⁡(j^)≥1MFC−1,(7)\operatorname{Cov}(\hat{\mathbf{j}})\ge\frac{1}{M}F_C^{-1}, \tag*{(7)}

where MM is the number of experimental repetitions and FCF_C denotes the classical Fisher information (FI) matrix, whose elements are

(FC)α,β=∑x1p(x∣j)∂p(x∣j)∂jα∂p(x∣j)∂jβ.(8)(F_C)_{\alpha,\beta}=\sum_x\frac{1}{p(x|\mathbf{j})}\frac{\partial p(x|\mathbf{j})}{\partial j_\alpha}\frac{\partial p(x|\mathbf{j})}{\partial j_\beta}. \tag*{(8)}

FCF_C depends explicitly on the measurement strategy through the conditional probabilities p(x∣j)p(x|\mathbf{j}) of measuring outcome xx when the vector of parameters is fixed to j\mathbf{j}. The matrix inequality Eq. (7) can be cast into a scalar bound by introducing a positive weight matrix WW such that Tr⁡(WCov⁡(j^))≥Tr⁡(WFC−1)/M\operatorname{Tr}(W\operatorname{Cov}(\hat{\mathbf{j}}))\ge\operatorname{Tr}(WF_C^{-1})/M, which allows different parameters to be weighted according to their relative importance. In this work, we assume equal weights and set W=IW=I, so that the relevant figure of merit becomes

References

  1. [1]A. Aspuru-Guzik and P. Walther, Photonic quantum simulators, Nature Physics 8, 285 (2012).
  2. [2]T. Ozawa, H. M. Price, A. Amo, N. Goldman, M. Hafezi, L. Lu, M. C. Rechtsman, D. Schuster, J. Simon, O. Zilberberg, and I. Carusotto, Topological photonics, Rev. Mod. Phys. 91, 015006 (2019).DOI
  3. [3]N. H. Valencia, A. Ma, S. Goel, S. Leedumrongwatthanakun, F. Graffitti, A. Fedrizzi, W. McCutcheon, and M. Malik, A large-scale reconfigurable multiplexed quantum photonic network, Nature Photonics 20, 202 (2026).
  4. [4]M. Christandl, N. Datta, A. Ekert, and A. J. Landahl, Perfect state transfer in quantum spin networks, Phys. Rev. Lett. 92, 187902 (2004).pubmed.ncbi.nlm.nih.gov/15169534
  5. [5]P. J. Pemberton-Ross and A. Kay, Perfect quantum routing in regular spin networks, Phys. Rev. Lett. 106, 020503 (2011).
  6. [6]H. Pichler, T. Ramos, A. J. Daley, and P. Zoller, Quantum optics of chiral spin networks, Phys. Rev. A 91, 042116 (2015).DOI
  7. [7]J. Nokkala, J. Piilo, and G. Bianconi, Complex quantum networks: a topical review, J. Phys. A: Math. Theor. 57, 233001 (2024).DOI
  8. [8]J. I. Cirac, P. Zoller, H. J. Kimble, and H. Mabuchi, Quantum state transfer and entanglement distribution among distant nodes in a quantum network, Phys. Rev. Lett. 78, 3221 (1997).DOI
  9. [9]A. Kay, Basics of perfect communication through quantum networks, Phys. Rev. A 84, 022337 (2011).DOI
  10. [10]S. Wehner, D. Elkouss, and R. Hanson, Quantum internet: A vision for the road ahead, Science 362, eaam9288 (2018).DOI
  11. [11]K. Azuma, S. E. Economou, D. Elkouss, P. Hilaire, L. Jiang, H.-K. Lo, and I. Tzitrin, Quantum repeaters: From quantum networks to the quantum internet, Rev. Mod. Phys. 95, 045006 (2023).DOI
  12. [12]C. E. Granade, C. Ferrie, N. Wiebe, and D. G. Cory, Robust online Hamiltonian learning, New J. Phys. 14, 103013 (2012).
  13. [13]N. Wiebe, C. Granade, C. Ferrie, and D. G. Cory, Hamiltonian learning and certification using quantum resources, Phys. Rev. Lett. 112, 190501 (2014).pubmed.ncbi.nlm.nih.gov/24877920
  14. [14]S. Li, D.-J. Pan, Y.-K. Zhu, J.-L. Zhou, W.-C. Liao, W.-X. Zhang, Z.-T. Liang, Q.-X. Lv, H. Yu, Z.-Y. Xue, H. Yan, and S.-L. Zhu, Ul high-throughput-precision Hamiltonian parameter estimation in a superconducting circuit, Phys. Rev. Lett. 132, 250204 (2024).DOI
  15. [15]D. Stilck França, L. A. Markovich, V. V. Dobrovitski, A. H. Werner, and J. Borregaard, Efficient and robust estimation of many-qubit Hamiltonians, Nature Communications 15, 311 (2024).
  16. [16]M. G. A. Paris, Quantum estimation for quantum technology, International Journal of Quantum Information 7 (2008).
  17. [17]M. Szczykulska, T. Baumgratz, and A. Datta, Multiparameter quantum metrology, Advances in Physics: X 1, 621 (2016).
  18. [18]F. Albarelli, J. F. Friel, and A. Datta, Evaluating the Holevo Cramér-Rao bound for multiparameter quantum metrology, Phys. Rev. Lett. 123, 200503 (2019).DOI
  19. [19]J. Liu, H. Yuan, X.-M. Lu, and X. Wang, Quantum Fisher information matrix and multiparameter estimation, J. Phys. A: Math. Theor. 53, 023001 (2019).DOI
  20. [20]F. Albarelli, M. Barbieri, M. G. Genoni, and I. Gianani, A perspective on multiparameter quantum metrology: From theoretical tools to applications, Physics Letters A 384, 126311 (2020).DOI
  21. [21]C. Shoukang, M. G. Genoni, and F. Albarelli, Efficiently evaluating Holevo, RLD and SLD Cramér-Rao bounds for multiparameter quantum estimation with Gaussian states, Commun. Phys. 9, 126 (2026).DOI
  22. [22]S. Ragy, M. Jarzyna, and R. Demkowicz-Dobrzański, Compatibility in multiparameter quantum metrology, Phys. Rev. A 94, 052108 (2016).DOI
  23. [23]S. Razavian, M. G. A. Paris, and M. G. Genoni, On the quantumness of multiparameter estimation problems for qubit systems, Entropy 22, 10.3390/e22111197 (2020).DOI
  24. [24]F. Albarelli and R. Demkowicz-Dobrzański, Probe incompatibility in multiparameter noisy quantum metrology, Phys. Rev. X 12, 011039 (2022).DOI
  25. [25]A. Candeloro, M. G. A. Paris, and M. G. A. Genoni, On the properties of the asymptotic incompatibility measure in multiparameter quantum estimation, J. Phys. A: Math. Theor. 54, 485301 (2021).DOI
  26. [26]F. Belliardo and V. Giovannetti, Incompatibility in quantum parameter estimation, New J. Phys. 23, 063055 (2021).DOI
  27. [27]O. Gühne, E. Haapasalo, T. Kraft, J.-P. Pellonpää, and R. Uola, Colloquium: Incompatible measurements in quantum information science, Rev. Mod. Phys. 95, 011003 (2023).
  28. [28]A. Candeloro, Z. Pazhotan, and M. G. A. Paris, Dimension matters: precision and incompatibility in multiparameter quantum estimation models, Quantum Science and Technology 9, 045045 (2024).arxiv.org/abs/2403.07106
  29. [29]J. He and M. G. A. Paris, Scrambling for precision: optimizing multiparameter qubit estimation in the face of sloppiness and incompatibility, J. Phys. A 58, 325301 (2025).arxiv.org/abs/2503.08235
  30. [30]T. J. Proctor, P. A. Knott, and J. A. Dunningham, Multiparameter estimation in networked quantum sensors, Phys. Rev. Lett. 120, 080501 (2018).DOI
  31. [31]Z. Eldredge, M. Foss-Feig, J. A. Gross, S. L. Rolston, and A. V. Gorshkov, Optimal and secure measurement protocols for quantum sensor networks, Phys. Rev. A 97, 042337 (2018).DOI
  32. [32]N. Kura and M. Ueda, Finite-error metrological bounds on multiparameter hamiltonian estimation, Phys. Rev. A 97, 012101 (2018).DOI
  33. [33]D. Xie and C. Xu, Optimal control for multi-parameter quantum estimation with time-dependent hamiltonians, Results in Physics 15, 102620 (2019).DOI
  34. [34]I. Gianani and C. Benedetti, Multiparameter estimation of continuous-time quantum walk Hamiltonians through machine learning, AVS Quantum Science 5, 014405 (2023).DOI
  35. [35]V. Montenegro, C. Mukhopadhyay, R. Yousefjani, S. Sarkar, U. Mishra, M. G. Paris, and A. Bayat, Review: Quantum metrology and sensing with many-body systems, Physics Reports 1134, 1 (2025).DOI
  36. [36]L. P. García-Pintos, K. Bharti, J. Bringewatt, H. Dehghani, A. Ehrenberg, N. Yunger Halpern, and A. V. Gorshkov, Estimation of Hamiltonian parameters from thermal states, Phys. Rev. Lett. 133, 040802 (2024).
  37. [37]R. M. Gray, Toeplitz and Circulant Matrices: A Review, Foundations and Trends(R) in Communications and Information Theory (Now Publishers Inc., Hanover, MA, USA, 2006).
  38. [38]B. Olson, S. Shaw, C. Shi, C. Pierre, and R. Parker, Circulant matrices and their application to vibration analysis, Appl. Mech. Rev. 66, 040803 (2014).DOI
  39. [39]M. B. Plenio and S. F. Huelga, Dephasing-assisted transport: quantum networks and biomolecules, New J. Phys. 10, 113019 (2008).DOI
  40. [40]O. Mülken and A. Blumen, Continuous-time quantum walks: Models for coherent transport on complex networks, Phys. Rep. 502, 37 (2011).
  41. [41]O. Mülken, V. Pernice, and A. Blumen, Quantum transport on small-world networks: A continuous-time quantum walk approach, Phys. Rev. E 76, 051125 (2007).pubmed.ncbi.nlm.nih.gov/18233641
  42. [42]K. A., Perfect, Efficient, state transfer and its application as a constructive tool, Int. J. Quantum Inf. 08, 641 (2010).
  43. [43]L. Razzoli, M. G. A. Paris, and P. Bordone, Transport efficiency of continuous-time quantum walks on graphs, Entropy 23, 85 (2021).DOI
  44. [44]M. Maciel Cássio, C. F. O. Mendes, W. T. Strunz, and M. Galiceanu, Quantum transport on generalized scale-free networks, Phys. Rev. A 102, 032219 (2020).DOI
  45. [45]S. Cavazzoni, L. Razzoli, P. Bordone, and M. G. A. Paris, Perturbed graphs achieve unit transport efficiency without environmental noise, Phys. Rev. E 106, 024118 (2022).DOI
  46. [46]A. M. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, and D. A. Spielman, Exponential algorithmic speedup by a quantum walk, in Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, STOC ’03 (Association for Computing Machinery, 2003) pp. 59–68.
  47. [47]A. M. Childs and J. Goldstone, Spatial search by quantum walk, Phys. Rev. A 70, 022314 (2004).DOI
  48. [48]A. P. Hines and P. C. E. Stamp, Quantum walks, quantum gates, and quantum computers, Phys. Rev. A 75, 062321 (2007).DOI
  49. [49]R. Portugal, Quantum walks and search algorithms (Springer Nature Switzerland, AG, 2018).
  50. [50]S. Chakraborty, L. Novo, and J. Roland, Optimality of spatial search via continuous-time quantum walks, Phys. Rev. A 102, 032214 (2020).DOI
  51. [51]A. Candeloro, C. Benedetti, M. G. Genoni, and M. G. A. Paris, Feedback-assisted quantum search by continuous-time quantum walks, Adv. Quantum Technol. , 2200093 (2022).DOI
  52. [52]M. Radaelli, C. Benedetti, and S. Olivares, Quantum-driven sampling of the almost-uniform distribution via quantum walks, New J. Phys. 28, 034510 (2026).DOI
  53. [53]M. Schreiber, K. N. Cassemiro, V. Potoček, A. Gábris, I. Jex, and C. Silberhorn, Decoherence and disorder in quantum walks: From ballistic spread to localization, Phys. Rev. Lett. 106, 180403 (2011).DOI
  54. [54]P. Xue and B. C. Sanders, Controlling and reversing the transition from classical diffusive to quantum ballistic transport in a quantum walk by driving the coin, Phys. Rev. A 87, 022334 (2013).DOI
  55. [55]C. Benedetti, M. A. C. Rossi, and M. G. A. Paris, Continuous-time quantum walks on dynamical percolation graphs, Europhys. Lett. 124, 60001 (2019).
  56. [56]V. Gualtieri, C. Benedetti, and M. G. A. Paris, Quantum-classical dynamical distance and quantumness of quantum walks, Phys. Rev. A 102, 012201 (2020).DOI
  57. [57]G. Bressanini, C. Benedetti, and M. G. A. Paris, Decoherence and classicalization of continuous-time quantum walks on graphs, Quantum Inf. Proc. 21, 317 (2022).DOI
  58. [58]L. J. Adithya, J. Nokkala, J. Piilo, and C. Meena, Stability of continuous time quantum walks in complex networks, Physica Scripta 101, 195103 (2026).DOI
  59. [59]P. Luppi, C. Benedetti, and A. A. Smirne, Temporal nonclassicality in continuous-time quantum walks, Phys. Rev. A 113, 042212 (2026).DOI
  60. [60]C. Benedetti and I. Gianani, Identifying network topologies via quantum walk distributions, AVS Quantum Science 6, 014412 (2024).DOI
  61. [61]C. J. Campbell, M. Mackinnon, M. Paternostro, and D. A. Chisholm, Inferring quantum network topologies using genetic optimization of indirect measurements, AVS Quantum Sci. 7, 034402 (2025).DOI
  62. [62]F. Romeo and J. Settino, Probing graph topology from local quantum measurements, Quantum Science and Technology 11, 01JT01 (2025)arxiv.org/abs/2507.23689
  63. [63]L. Seveso, C. Benedetti, and M. G. A. Paris, The walker speaks its graph: global and nearly-local probing of the tunnelling amplitude in continuous-time quantum walks, Journal of Physics A: Mathematical and Theoretical 52, 105304 (2019).DOI
  64. [64]S. M. Kay, Fundamentals of Statistical Signal Processing: Estimation Theory (Prentice Hall, 1993).
  65. [65]J. He and M. G. A. Paris, Scrambling for precision: optimizing multiparameter qubit estimation in the face of sloppiness and incompatibility, arXiv:2503.08235 (2025).arxiv.org/abs/2503.08235
  66. [66]K. Matsumoto, A new approach to the cramer-rao-type bound of the pure-state model, Journal of Physics A: Mathematical and General 35, 3111 (2002).
  67. [67]M. D. Vidrighin, G. Donati, M. G. Genoni, X.-M. Jin, W. S. Kolthammer, M. S. Kim, A. Datta, M. Barbieri, and I. A. Walmsley, Joint estimation of phase and phase diffusion for quantum metrology, Nature Communications 5, 3532 (2014).DOI
  68. [68]E. Roccia, I. Gianani, L. Mancino, M. Sbroscia, F. Somma, M. G. Genoni, and M. Barbieri, Entangling measurements for multiparameter estimation with two qubits, Quantum Sci. Technol. 3, 01JT01 (2017).DOI
  69. [69]F. Albarelli, I. Gianani, M. G. Genoni, and M. Barbieri, Fisher-information susceptibility for multiparameter quantum estimation, Phys. Rev. A 110, 032436 (2024).DOI
  70. [70]L. Razzoli, Continuous-time quantum walks for quantum technology: quantum estimation and modeling of transport phenomena (Ph.D. thesis, Università degli Studi di Modena e Reggio Emilia, 2021).
  71. [71]J. Liu, X.-X. Jing, and X. Wang, Quantum metrology with unitary parametrization processes, Scientific Reports 5, 8565 (2015).DOI
  72. [72]L. Pezzè, M. A. Ciampini, N. Spagnolo, P. C. Humphreys, A. Datta, I. A. Walmsley, M. Barbieri, F. Scardino, and A. Smerzi, Quantum estimation of multiple phases, Phys. Rev. Lett. 119, 130504 (2017).
  73. [73]T. Popoviciu, Sur les équations algébriques ayant toutes leurs racines réelles, Mathematica 9, 129 (1935).
  74. [74]V. Giovannetti, S. Lloyd, and L. Maccone, Quantum metrology, Phys. Rev. Lett. 96, 010401 (2006).
  75. [75]H. S. M. Coxeter, Regular polytopes (Macmillan, 1963).

Paper details

vlnc:W_6kw4gjhh
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 6

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Not recorded for this paper

View statement
Looking for related papers…
Contents