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

Short-depth circuits for efficient expectation value estimation

129   0   0.0 ( 0 )
 نشر من قبل Alessandro Roggero
 تاريخ النشر 2019
  مجال البحث فيزياء
والبحث باللغة English




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

The evaluation of expectation values $Trleft[rho Oright]$ for some pure state $rho$ and Hermitian operator $O$ is of central importance in a variety of quantum algorithms. Near optimal techniques developed in the past require a number of measurements $N$ approaching the Heisenberg limit $N=mathcal{O}left(1/epsilonright)$ as a function of target accuracy $epsilon$. The use of Quantum Phase Estimation requires however long circuit depths $C=mathcal{O}left(1/epsilonright)$ making their implementation difficult on near term noisy devices. The more direct strategy of Operator Averaging is usually preferred as it can be performed using $N=mathcal{O}left(1/epsilon^2right)$ measurements and no additional gates besides those needed for the state preparation. In this work we use a simple but realistic model to describe the bound state of a neutron and a proton (the deuteron) and show that the latter strategy can require an overly large number of measurement in order to achieve a reasonably small relative target accuracy $epsilon_r$. We propose to overcome this problem using a single step of QPE and classical post-processing. This approach leads to a circuit depth $C=mathcal{O}left(epsilon^muright)$ (with $mugeq0$) and to a number of measurements $N=mathcal{O}left(1/epsilon^{2+ u}right)$ for $0< uleq1$. We provide detailed descriptions of two implementations of our strategy for $ u=1$ and $ uapprox0.5$ and derive appropriate conditions that a particular problem instance has to satisfy in order for our method to provide an advantage.

قيم البحث

اقرأ أيضاً

195 - S. Iblisdir , M. Cirio , O. Boada 2012
A scheme for measuring complex temperature partition functions of Ising models is introduced. In the context of ordered qubit registers this scheme finds a natural translation in terms of global operations, and single particle measurements on the edg e of the array. Two applications of this scheme are presented. First, through appropriate Wick rotations, those amplitudes can be analytically continued to yield estimates for partition functions of Ising models. Bounds on the estimation error, valid with high confidence, are provided through a central-limit theorem, which validity extends beyond the present context. It holds for example for estimations of the Jones polynomial. Interestingly, the kind of state preparations and measurements involved in this application can in principle be made instantaneous, i.e. independent of the system size or the parameters being simulated. Second, the scheme allows to accurately estimate some non-trivial invariants of links. A third result concerns the computational power of estimations of partition functions for real temperature classical ferromagnetic Ising models on a square lattice. We provide conditions under which estimating such partition functions allows one to reconstruct scattering amplitudes of quantum circuits making the problem BQP-hard. Using this mapping, we show that fidelity overlaps for ground states of quantum Hamiltonians, which serve as a witness to quantum phase transitions, can be estimated from classical Ising model partition functions. Finally, we show that the ability to accurately measure corner magnetizations on thermal states of two-dimensional Ising models with magnetic field leads to fully polynomial random approximation schemes (FPRAS) for the partition function. Each of these results corresponds to a section of the text that can be essentially read independently.
Noise in existing quantum processors only enables an approximation to ideal quantum computation. However, these approximations can be vastly improved by error mitigation, for the computation of expectation values, as shown by small-scale experimental demonstrations. However, the practical scaling of these methods to larger system sizes remains unknown. Here, we demonstrate the utility of zero-noise extrapolation for relevant quantum circuits using up to 26 qubits, circuit depths of 60, and 1080 CNOT gates. We study the scaling of the method for canonical examples of product states and entangling Clifford circuits of increasing size, and extend it to the quench dynamics of 2-D Ising spin lattices with varying couplings. We show that the efficacy of the error mitigation is greatly enhanced by additional error suppression techniques and native gate decomposition that reduce the circuit time. By combining these methods, we demonstrate an accuracy in the approximate quantum simulation of the quench dynamics that surpasses the classical approximations obtained from a state-of-the-art 2-D tensor network method. These results reveal a path to a relevant quantum advantage with noisy, digital, quantum processors.
We develop a framework for characterizing and analyzing engineered likelihood functions (ELFs), which play an important role in the task of estimating the expectation values of quantum observables. These ELFs are obtained by choosing tunable paramete rs in a parametrized quantum circuit that minimize the expected posterior variance of an estimated parameter. We derive analytical expressions for the likelihood functions arising from certain classes of quantum circuits and use these expressions to pick optimal ELF tunable parameters. Finally, we show applications of ELFs in the Bayesian inference framework.
109 - Andreas Blass 2015
No-go theorems assert that hidden-variable theories, subject to appropriate hypotheses, cannot reproduce the predictions of quantum theory. We examine two species of such theorems, value no-go theorems and expectation no-go theorems. The former asser t that hidden-variables cannot match the predictions of quantum theory about the possible values resulting from measurements; the latter assert that hidden-variables cannot match the predictions of quantum theory about the expectation values of measurements. We sharpen the known results of both species, which allows us to clarify the similarities and differences between the two species. We also repair some flaws in existing definitions and proofs.
The violation of the Mermin inequality (MI) for multipartite quantum states guarantees the existence of nonlocality between either few or all parties. The detection of optimal MI violation is fundamentally important, but current methods only involve numerical optimizations, thus hard to find even for three-qubit states. In this paper, we provide a simple and elegant analytical method to achieve the upper bound of Mermin operator for arbitrary three-qubit states. Also, the necessary and sufficient conditions for the tightness of the bound for some class of tri-partite states has been stated. Finally, we suggest an extension of this result for up to n qubits.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

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