Bayesian quantum phase estimation with fixed photon states
- URL: http://arxiv.org/abs/2308.01293v1
- Date: Wed, 2 Aug 2023 17:26:10 GMT
- Title: Bayesian quantum phase estimation with fixed photon states
- Authors: Boyu Zhou, Saikat Guha, Christos N. Gagatsos
- Abstract summary: We consider the generic form of a two-mode bosonic state $|Psi_nrangle$ with finite Fock expansion and fixed mean photon number.
We study the form of the optimal input state, i.e., the form of the state's Fock coefficients.
- Score: 4.928739385940871
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We consider the generic form of a two-mode bosonic state $|\Psi_n\rangle$
with finite Fock expansion and fixed mean photon number to an integer $n\geq1$.
The upper and lower modes of the input state $|\Psi_n\rangle$ pick up a phase
$\phi$ and $-\phi$ respectively and we study the form of the optimal input
state, i.e., the form of the state's Fock coefficients, such that the mean
square error (MSE) for estimating $\phi$ is minimized while the MSE is always
attainable by a measurement. Our setting is Bayesian, meaning that we consider
$\phi$ as a random variable that follows a prior probability distribution
function (PDF). For the celebrated NOON state (equal superposition of
$|n0\rangle$ and $|0n\rangle$), which is a special case of the input state we
consider, and for a flat prior PDF we find that the Heisenberg scaling is lost
and the attainable minimum mean square error (MMSE) is found to be
$\pi^2/3-1/4n^2$, which is a manifestation of the fundamental difference
between the Fisherian and Bayesian approaches. Then, our numerical analysis
provides the optimal form of the generic input state for fixed values of $n$
and we provide evidence that a state $|\Psi_{\tau}\rangle$ produced by mixing a
Fock state with vacuum in a beam-splitter of transmissivity $\tau$ (i.e. a
special case of the state $|\Psi_n\rangle$), must correspond to $\tau=0.5$.
Finally, we consider an example of an adaptive technique: We consider a state
of the form of $|\Psi_n\rangle$ for $n=1$. We start with a flat prior PDF, and
for each subsequent step we use as prior PDF the posterior probability of the
previous step, while for each step we update the optimal state and optimal
measurement. We show our analysis for up to five steps, but one can allow the
algorithm to run further. Finally, we conjecture the form the of the prior PDF
and the optimal state for the infinite step and we calculate the corresponding
MMSE.
Related papers
- Revisiting Step-Size Assumptions in Stochastic Approximation [1.3654846342364308]
The paper revisits step-size selection in a general Markovian setting.
A major conclusion is that the choice of $rho =0$ or even $rho1/2$ is justified only in select settings.
arXiv Detail & Related papers (2024-05-28T05:11:05Z) - Efficient Sampling of Stochastic Differential Equations with Positive
Semi-Definite Models [91.22420505636006]
This paper deals with the problem of efficient sampling from a differential equation, given the drift function and the diffusion matrix.
It is possible to obtain independent and identically distributed (i.i.d.) samples at precision $varepsilon$ with a cost that is $m2 d log (1/varepsilon)$
Our results suggest that as the true solution gets smoother, we can circumvent the curse of dimensionality without requiring any sort of convexity.
arXiv Detail & Related papers (2023-03-30T02:50:49Z) - Near Sample-Optimal Reduction-based Policy Learning for Average Reward
MDP [58.13930707612128]
This work considers the sample complexity of obtaining an $varepsilon$-optimal policy in an average reward Markov Decision Process (AMDP)
We prove an upper bound of $widetilde O(H varepsilon-3 ln frac1delta)$ samples per state-action pair, where $H := sp(h*)$ is the span of bias of any optimal policy, $varepsilon$ is the accuracy and $delta$ is the failure probability.
arXiv Detail & Related papers (2022-12-01T15:57:58Z) - Best Policy Identification in Linear MDPs [70.57916977441262]
We investigate the problem of best identification in discounted linear Markov+Delta Decision in the fixed confidence setting under a generative model.
The lower bound as the solution of an intricate non- optimization program can be used as the starting point to devise such algorithms.
arXiv Detail & Related papers (2022-08-11T04:12:50Z) - Quantum tomography using state-preparation unitaries [0.22940141855172028]
We describe algorithms to obtain an approximate classical description of a $d$-dimensional quantum state when given access to a unitary.
We show that it takes $widetildeTheta(d/varepsilon)$ applications of the unitary to obtain an $varepsilon$-$ell$-approximation of the state.
We give an efficient algorithm for obtaining Schatten $q$-optimal estimates of a rank-$r$ mixed state.
arXiv Detail & Related papers (2022-07-18T17:56:18Z) - Phase estimation with limited coherence [0.0]
For pure states, we give the minimum estimation variance attainable, $V(C)$, and the optimal state, in the limit when the probe system size, $n$, is large.
We show that the variance exhibits a Heisenberg-like scaling, $V(C) sim a_n/C2$, where $a_n$ decreases to $pi2/3$ as $n$ increases, leading to a dimension-independent relation.
arXiv Detail & Related papers (2022-07-12T16:36:59Z) - A first-order primal-dual method with adaptivity to local smoothness [64.62056765216386]
We consider the problem of finding a saddle point for the convex-concave objective $min_x max_y f(x) + langle Ax, yrangle - g*(y)$, where $f$ is a convex function with locally Lipschitz gradient and $g$ is convex and possibly non-smooth.
We propose an adaptive version of the Condat-Vu algorithm, which alternates between primal gradient steps and dual steps.
arXiv Detail & Related papers (2021-10-28T14:19:30Z) - Optimal Control for Closed and Open System Quantum Optimization [0.0]
We provide a rigorous analysis of the quantum optimal control problem in the setting of a linear combination $s(t)B+ (1-s(t))C$ of two noncommuting Hamiltonians.
The target is to minimize the energy of the final problem'' Hamiltonian $C$, for a time-dependent and bounded control schedule.
arXiv Detail & Related papers (2021-07-07T22:57:57Z) - SDP Achieves Exact Minimax Optimality in Phase Synchronization [19.909352968029584]
We study the phase synchronization problem with noisy measurements $Y=z*z*+sigma WinmathbbCntimes ntimes n.
We prove that SDP achieves error bound $ (1+o)fracnp22np$ under a squared $ell$ loss.
arXiv Detail & Related papers (2021-01-07T03:14:05Z) - Improved Sample Complexity for Incremental Autonomous Exploration in
MDPs [132.88757893161699]
We learn the set of $epsilon$-optimal goal-conditioned policies attaining all states that are incrementally reachable within $L$ steps.
DisCo is the first algorithm that can return an $epsilon/c_min$-optimal policy for any cost-sensitive shortest-path problem.
arXiv Detail & Related papers (2020-12-29T14:06:09Z) - Linear Time Sinkhorn Divergences using Positive Features [51.50788603386766]
Solving optimal transport with an entropic regularization requires computing a $ntimes n$ kernel matrix that is repeatedly applied to a vector.
We propose to use instead ground costs of the form $c(x,y)=-logdotpvarphi(x)varphi(y)$ where $varphi$ is a map from the ground space onto the positive orthant $RRr_+$, with $rll n$.
arXiv Detail & Related papers (2020-06-12T10:21:40Z)
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.