Multiparameter simultaneous optimal estimation with an SU(2) coding unitary evolution

• URL: http://arxiv.org/abs/2202.03668v1
• Date: Tue, 8 Feb 2022 06:05:20 GMT
• Title: Multiparameter simultaneous optimal estimation with an SU(2) coding unitary evolution
• Authors: Yu Yang, Shihao Ru, Min An, Yunlong Wang, Feiran Wang, Pei Zhang and Fuli Li
• Abstract summary: In a ubiquitous $SU(2)$ dynamics, achieving the simultaneous optimal estimation of multiple parameters is difficult. We propose a method, characterized by the nested cross-products of the coefficient vector $mathbfX$ of $SU(2)$ generators. Our work reveals that quantum control is not always functional in improving the estimation precision.
• Score: 5.789743084845758
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In a ubiquitous $SU(2)$ dynamics, achieving the simultaneous optimal estimation of multiple parameters is significant but difficult. Using quantum control to optimize this $SU(2)$ coding unitary evolution is one of solutions. We propose a method, characterized by the nested cross-products of the coefficient vector $\mathbf{X}$ of $SU(2)$ generators and its partial derivative $\partial_\ell \mathbf{X}$, to investigate the control-enhanced quantum multiparameter estimation. Our work reveals that quantum control is not always functional in improving the estimation precision, which depends on the characterization of an $SU(2)$ dynamics with respect to the objective parameter. This characterization is quantified by the angle $\alpha_\ell$ between $\mathbf{X}$ and $\partial_\ell \mathbf{X}$. For an $SU(2)$ dynamics featured by $\alpha_\ell=\pi/2$, the promotion of the estimation precision can get the most benefits from the controls. When $\alpha_\ell$ gradually closes to $0$ or $\pi$, the precision promotion contributed to by quantum control correspondingly becomes inconspicuous. Until a dynamics with $\alpha_\ell=0$ or $\pi$, quantum control completely loses its advantage. In addition, we find a set of conditions restricting the simultaneous optimal estimation of all the parameters, but fortunately, which can be removed by using a maximally entangled two-qubit state as the probe state and adding an ancillary channel into the configuration. Lastly, a spin-$1/2$ system is taken as an example to verify the above-mentioned conclusions. Our proposal sufficiently exhibits the hallmark of control-enhancement in fulfilling the multiparameter estimation mission, and it is applicable to an arbitrary $SU(2)$ parametrization process.

Related papers

• Dividing quantum circuits for time evolution of stochastic processes by orthogonal series density estimation [0.0]
  Quantum Monte Carlo integration (QMCI) is a quantum algorithm to estimate expectations of random variables. In this paper, we propose a method to divide $U_X(t)$ based on orthogonal series density estimation. Our method achieves the circuit depth and total query complexity scaling as $O(sqrtN)$ and $O(N3/2)$, respectively.
  arXiv  Detail & Related papers  (2024-06-04T01:50:21Z)
• Control of the von Neumann Entropy for an Open Two-Qubit System Using Coherent and Incoherent Drives [50.24983453990065]
  This article is devoted to developing an approach for manipulating the von Neumann entropy $S(rho(t))$ of an open two-qubit system with coherent control and incoherent control inducing time-dependent decoherence rates. The following goals are considered: (a) minimizing or maximizing the final entropy $S(rho(T))$; (b) steering $S(rho(T))$ to a given target value; (c) steering $S(rho(T))$ to a target value and satisfying the pointwise state constraint $S(
  arXiv  Detail & Related papers  (2024-05-10T10:01:10Z)
• Projection by Convolution: Optimal Sample Complexity for Reinforcement Learning in Continuous-Space MDPs [56.237917407785545]
  We consider the problem of learning an $varepsilon$-optimal policy in a general class of continuous-space Markov decision processes (MDPs) having smooth Bellman operators. Key to our solution is a novel projection technique based on ideas from harmonic analysis. Our result bridges the gap between two popular but conflicting perspectives on continuous-space MDPs.
  arXiv  Detail & Related papers  (2024-05-10T09:58:47Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Gradient-Free Methods for Deterministic and Stochastic Nonsmooth Nonconvex Optimization [94.19177623349947]
  Non-smooth non optimization problems emerge in machine learning and business making. Two core challenges impede the development of efficient methods with finitetime convergence guarantee. Two-phase versions of GFM and SGFM are also proposed and proven to achieve improved large-deviation results.
  arXiv  Detail & Related papers  (2022-09-12T06:53:24Z)
• Multiparameter estimation for qubit states with collective measurements: a case study [0.0]
  We show that simultaneous optimal estimation for both parameters can be attained with a simple collective measurement strategy. We show that when the state is nearly pure, for sufficiently but not arbitrarily large $N$, most information will be captured in the largest three $j$-subspaces. We also obtain numerical results that suggest that using a Bell multiport setup, one can distinguish between projection onto the $j=N/2$ and $j=N/2-1 subspaces.
  arXiv  Detail & Related papers  (2021-09-15T17:02:33Z)
• Optimal Robust Linear Regression in Nearly Linear Time [97.11565882347772]
  We study the problem of high-dimensional robust linear regression where a learner is given access to $n$ samples from the generative model $Y = langle X,w* rangle + epsilon$ We propose estimators for this problem under two settings: (i) $X$ is L4-L2 hypercontractive, $mathbbE [XXtop]$ has bounded condition number and $epsilon$ has bounded variance and (ii) $X$ is sub-Gaussian with identity second moment and $epsilon$ is
  arXiv  Detail & Related papers  (2020-07-16T06:44:44Z)
• Sample Efficient Reinforcement Learning via Low-Rank Matrix Estimation [30.137884459159107]
  We consider the question of learning $Q$-function in a sample efficient manner for reinforcement learning with continuous state and action spaces. We develop a simple, iterative learning algorithm that finds $epsilon$-Schmidt $Q$-function with sample complexity of $widetildeO(frac1epsilonmax(d1), d_2)+2)$ when the optimal $Q$-function has low rank $r$ and the factor $$ is below a certain threshold.
  arXiv  Detail & Related papers  (2020-06-11T00:55:35Z)
• Sample Complexity of Asynchronous Q-Learning: Sharper Analysis and Variance Reduction [63.41789556777387]
  Asynchronous Q-learning aims to learn the optimal action-value function (or Q-function) of a Markov decision process (MDP) We show that the number of samples needed to yield an entrywise $varepsilon$-accurate estimate of the Q-function is at most on the order of $frac1mu_min (1-gamma)5varepsilon2+ fract_mixmu_min (1-gamma)$ up to some logarithmic factor.
  arXiv  Detail & Related papers  (2020-06-04T17:51:00Z)
• Heisenberg scaling precision in multi-mode distributed quantum metrology [0.0]
  We propose an $N$-photon Gaussian measurement scheme which allows the estimation of a parameter $varphi$ encoded into a multi-port interferometer. No restrictions on the structure of the interferometer are imposed other than linearity and passivity.
  arXiv  Detail & Related papers  (2020-03-27T17:34:25Z)
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits [0.755972004983746]
  Variational quantum algorithms (VQAs) optimize the parameters $vectheta$ of a parametrized quantum circuit. We prove two results, assuming $V(vectheta)$ is an alternating layered ansatz composed of blocks forming local 2-designs. We illustrate these ideas with large-scale simulations, up to 100 qubits, of a quantum autoencoder implementation.
  arXiv  Detail & Related papers  (2020-01-02T18:18:25Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.