اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدEfficient online quantum state estimation using a matrix-exponentiated gradient method
59
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, we explore an efficient online algorithm for quantum state estimation based on a matrix-exponentiated gradient method previously used in the context of machine learning. The state update is governed by a learning rate that determines how much weight is given to the new measurement results obtained in each step. We show convergence of the running state estimate in probability to the true state for both noiseless and noisy measurements. We find that in the latter case the learning rate has to be chosen adaptively and decreasing to guarantee convergence beyond the noise threshold. As a practical alternative we then propose to use running averages of the measurement statistics and a constant learning rate to overcome the noise problem. The proposed algorithm is numerically compared with batch maximum-likelihood and least-squares estimators. The results show a superior performance of the new algorithm in terms of accuracy and runtime complexity.
قيم البحث
اقرأ أيضاً
Bayesian inference is a powerful paradigm for quantum state tomography, treating uncertainty in meaningful and informative ways. Yet the numerical challenges associated with sampling from complex probability distributions hampers Bayesian tomography
in practical settings. In this Article, we introduce an improved, self-contained approach for Bayesian quantum state estimation. Leveraging advances in machine learning and statistics, our formulation relies on highly efficient preconditioned Crank--Nicolson sampling and a pseudo-likelihood. We theoretically analyze the computational cost, and provide explicit examples of inference for both actual and simulated datasets, illustrating improved performance with respect to existing approaches.
We demonstrate a fast, robust and non-destructive protocol for quantum state estimation based on continuous weak measurement in the presence of a controlled dynamical evolution. Our experiment uses optically probed atomic spins as a testbed, and succ
essfully reconstructs a range of trial states with fidelities of ~90%. The procedure holds promise as a practical diagnostic tool for the study of complex quantum dynamics, the testing of quantum hardware, and as a starting point for new types of quantum feedback control.
We consider estimating the marginal likelihood in settings with independent and identically distributed (i.i.d.) data. We propose estimating the predictive distributions in a sequential factorization of the marginal likelihood in such settings by usi
ng stochastic gradient Markov Chain Monte Carlo techniques. This approach is far more efficient than traditional marginal likelihood estimation techniques such as nested sampling and annealed importance sampling due to its use of mini-batches to approximate the likelihood. Stability of the estimates is provided by an adaptive annealing schedule. The resulting stochastic gradient annealed importance sampling (SGAIS) technique, which is the key contribution of our paper, enables us to estimate the marginal likelihood of a number of models considerably faster than traditional approaches, with no noticeable loss of accuracy. An important benefit of our approach is that the marginal likelihood is calculated in an online fashion as data becomes available, allowing the estimates to be used for applications such as online weighted model combination.
The wave-function Monte-Carlo method, also referred to as the use of quantum-jump trajectories, allows efficient simulation of open systems by independently tracking the evolution of many pure-state trajectories. This method is ideally suited to simu
lation by modern, highly parallel computers. Here we show that Krotovs method of numerical optimal control, unlike others, can be modified in a simple way, so that it becomes fully parallel in the pure states without losing its effectiveness. This provides a highly efficient method for finding optimal control protocols for open quantum systems and networks. We apply this method to the problem of generating entangled states in a network consisting of systems coupled in a unidirectional chain. We show that due to the existence of a dark-state subspace in the network, nearly-optimal control protocols can be found for this problem by using only a single pure-state trajectory in the optimization, further increasing the efficiency.
Quantification of coherence lies at the heart of quantum information processing and fundamental physics. Exact evaluation of coherence measures generally needs a full reconstruction of the density matrix, which becomes intractable for large-scale mul
tipartite systems. Here, we propose a systematic theoretical approach to efficiently estimating lower and upper bounds of coherence in multipartite states. Under the stabilizer formalism, the lower bound is determined by the spectrum estimation method with a small number of measurements and the upper bound is determined by a single measurement. We verify our theory with a four-qubit optical quantum system.We experimentally implement various multi-qubit entangled states, including the Greenberger-Horne-Zeilinger state, the cluster state, and the W state, and show how their coherence are efficiently inferred from measuring few observables.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
