اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOptimum Quantum Error Recovery using Semidefinite Programming
271
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Quantum error correction (QEC) is an essential element of physical quantum information processing systems. Most QEC efforts focus on extending classical error correction schemes to the quantum regime. The input to a noisy system is embedded in a coded subspace, and error recovery is performed via an operation designed to perfectly correct for a set of errors, presumably a large subset of the physical noise process. In this paper, we examine the choice of recovery operation. Rather than seeking perfect correction on a subset of errors, we seek a recovery operation to maximize the entanglement fidelity for a given input state and noise model. In this way, the recovery operation is optimum for the given encoding and noise process. This optimization is shown to be calculable via a semidefinite program (SDP), a well-established form of convex optimization with efficient algorithms for its solution. The error recovery operation may also be interpreted as a combining operation following a quantum spreading channel, thus providing a quantum analogy to the classical diversity combining operation.
قيم البحث
اقرأ أيضاً
We apply semidefinite programming for designing 1 to 2 symmetric qubit quantum cloners. These are optimized for the average fidelity of their joint output state with respect to a product of multiple originals. We design 1 to 2 quantum bit cloners usi
ng the numerical method for finding completely positive maps approximating a nonphysical one optimally. We discuss the properties of the so-designed cloners.
Quantum steering refers to the non-classical correlations that can be observed between the outcomes of measurements applied on half of an entangled state and the resulting post-measured states that are left with the other party. From an operational p
oint of view, a steering test can be seen as an entanglement test where one of the parties performs uncharacterised measurements. Thus, quantum steering is a form of quantum inseparability that lies in between the well-known notions of Bell nonlocality and entanglement. Moreover, quantum steering is also related to several asymmetric quantum information protocols where some of the parties are considered untrusted. Because of these facts, quantum steering has received a lot of attention both theoretically and experimentally. The main goal of this review is to give an overview of how to characterise quantum steering through semidefinite programming. This characterisation provides efficient numerical methods to address a number of problems, including steering detection, quantification, and applications. We also give a brief overview of some important results that are not directly related to semidefinite programming. Finally, we make available a collection of semidefinite programming codes that can be used to study the topics discussed in this article
Semidefinite Programming (SDP) is a class of convex optimization programs with vast applications in control theory, quantum information, combinatorial optimization and operational research. Noisy intermediate-scale quantum (NISQ) algorithms aim to ma
ke an efficient use of the current generation of quantum hardware. However, optimizing variational quantum algorithms is a challenge as it is an NP-hard problem that in general requires an exponential time to solve and can contain many far from optimal local minima. Here, we present a current term NISQ algorithm for SDP. The classical optimization program of our NISQ solver is another SDP over a smaller dimensional ansatz space. We harness the SDP based formulation of the Hamiltonian ground state problem to design a NISQ eigensolver. Unlike variational quantum eigensolvers, the classical optimization program of our eigensolver is convex, can be solved in polynomial time with the number of ansatz parameters and every local minimum is a global minimum. Further, we demonstrate the potential of our NISQ SDP solver by finding the largest eigenvalue of up to $2^{1000}$ dimensional matrices and solving graph problems related to quantum contextuality. We also discuss NISQ algorithms for rank-constrained SDPs. Our work extends the application of NISQ computers onto one of the most successful algorithmic frameworks of the past few decades.
Resolving a conjecture of Abbe, Bandeira and Hall, the authors have recently shown that the semidefinite programming (SDP) relaxation of the maximum likelihood estimator achieves the sharp threshold for exactly recovering the community structure unde
r the binary stochastic block model of two equal-sized clusters. The same was shown for the case of a single cluster and outliers. Extending the proof techniques, in this paper it is shown that SDP relaxations also achieve the sharp recovery threshold in the following cases: (1) Binary stochastic block model with two clusters of sizes proportional to network size but not necessarily equal; (2) Stochastic block model with a fixed number of equal-sized clusters; (3) Binary censored block model with the background graph being ErdH{o}s-Renyi. Furthermore, a sufficient condition is given for an SDP procedure to achieve exact recovery for the general case of a fixed number of clusters plus outliers. These results demonstrate the versatility of SDP relaxation as a simple, general purpose, computationally feasible methodology for community detection.
Quantum information leverages properties of quantum behaviors in order to perform useful tasks such as secure communication and randomness certification. Nevertheless, not much is known about the intricate geometric features of the set quantum behavi
ors. In this paper we study the structure of the set of quantum correlators using semidefinite programming. Our main results are (i) a generalization of the analytic description by Tsirelson-Landau-Masanes, (ii) necessary and sufficient conditions for extremality and exposedness, and (iii) an operational interpretation of extremality in the case of two dichotomic measurements, in terms of self-testing. We illustrate the usefulness of our theoretical findings with many examples and extensive computational work.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
