ترغب بنشر مسار تعليمي؟ اضغط هنا

Fast quantum state reconstruction via accelerated non-convex programming

75   0   0.0 ( 0 )
 نشر من قبل Anastasios Kyrillidis
 تاريخ النشر 2021
والبحث باللغة English




اسأل ChatGPT حول البحث

We propose a new quantum state reconstruction method that combines ideas from compressed sensing, non-convex optimization, and acceleration methods. The algorithm, called Momentum-Inspired Factored Gradient Descent (texttt{MiFGD}), extends the applicability of quantum tomography for larger systems. Despite being a non-convex method, texttt{MiFGD} converges emph{provably} to the true density matrix at a linear rate, in the absence of experimental and statistical noise, and under common assumptions. With this manuscript, we present the method, prove its convergence property and provide Frobenius norm bound guarantees with respect to the true density matrix. From a practical point of view, we benchmark the algorithm performance with respect to other existing methods, in both synthetic and real experiments performed on an IBMs quantum processing unit. We find that the proposed algorithm performs orders of magnitude faster than state of the art approaches, with the same or better accuracy. In both synthetic and real experiments, we observed accurate and robust reconstruction, despite experimental and statistical noise in the tomographic data. Finally, we provide a ready-to-use code for state tomography of multi-qubit systems.



قيم البحث

اقرأ أيضاً

With nowadays steadily growing quantum processors, it is required to develop new quantum tomography tools that are tailored for high-dimensional systems. In this work, we describe such a computational tool, based on recent ideas from non-convex optim ization. The algorithm excels in the compressed-sensing-like setting, where only a few data points are measured from a low-rank or highly-pure quantum state of a high-dimensional system. We show that the algorithm can practically be used in quantum tomography problems that are beyond the reach of convex solvers, and, moreover, is faster than other state-of-the-art non-convex approaches. Crucially, we prove that, despite being a non-convex program, under mild conditions, the algorithm is guaranteed to converge to the global minimum of the problem; thus, it constitutes a provable quantum state tomography protocol.
Constraint programming (CP) is a paradigm used to model and solve constraint satisfaction and combinatorial optimization problems. In CP, problems are modeled with constraints that describe acceptable solutions and solved with backtracking tree searc h augmented with logical inference. In this paper, we show how quantum algorithms can accelerate CP, at both the levels of inference and search. Leveraging existing quantum algorithms, we introduce a quantum-accelerated filtering algorithm for the $texttt{alldifferent}$ global constraint and discuss its applicability to a broader family of global constraints with similar structure. We propose frameworks for the integration of quantum filtering algorithms within both classical and quantum backtracking search schemes, including a novel hybrid classical-quantum backtracking search method. This work suggests that CP is a promising candidate application for early fault-tolerant quantum computers and beyond.
We determine the resource scaling of machine learning-based quantum state reconstruction methods, in terms of inference and training, for systems of up to four qubits when constrained to pure states. Further, we examine system performance in the low- count regime, likely to be encountered in the tomography of high-dimensional systems. Finally, we implement our quantum state reconstruction method on an IBM Q quantum computer, and compare against both unconstrained and constrained MLE state reconstruction.
We introduce a simple yet versatile protocol to inverse engineer the time-dependent Hamiltonian in two- and three level systems. In the protocol, by utilizing a universal SU(2) transformation, a given speedup goal can be obtained with large freedom t o select the control parameters. As an illustration example, the protocol is applied to perform population transfer between nitrogen-vacancy (NV) centers in diamond. Numerical simulation shows that the speed of the present protocol is fast compared with that of the adiabatic process. Moreover, the protocol is also tolerant to decoherence and experimental parameter fluctuations. Therefore, the protocol may be useful for designing an experimental feasible Hamiltonian to engineer a quantum system.
We propose a fast and robust quantum state transfer protocol employing a Su-Schrieffer-Heeger chain, where the interchain couplings vary in time. Based on simple considerations around the terms involved in the definition of the adiabatic invariant, w e construct an exponential time-driving function that successfully takes advantage of resonant effects to speed up the transfer process. Using optimal control theory, we confirm that the proposed time-driving function is close to optimal. To unravel the crucial aspects of our construction, we proceed to a comparison with two other protocols. One where the underlying Su-Schrieffer-Heeger chain is adiabatically time-driven and another where the underlying chain is topologically trivial and resonant effects are at work. By numerically investigating the resilience of each protocol to static noise, we highlight the robustness of the exponential driving.

الأسئلة المقترحة

التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا