اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدQuantum advantages for Pauli channel estimation
101
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We show that entangled measurements provide an exponential advantage in sample complexity for Pauli channel estimation, which is both a fundamental problem and a practically important subroutine for benchmarking near-term quantum devices. The specific task we consider is to learn the eigenvalues of an $n$-qubit Pauli channel to precision $varepsilon$ in $l_infty$ distance. We give an estimation protocol with an $n$-qubit ancilla that succeeds with high probability using only $O(n/varepsilon^{2})$ copies of the Pauli channel, while prove that any ancilla-free protocol (possibly with adaptive control and channel concatenation) would need at least $Omega(2^{n/3})$ rounds of measurement. We further study the advantages provided by a small number of ancillas. For the case that a $k$-qubit ancilla ($kle n$) is available, we obtain a sample complexity lower bound of $Omega(2^{(n-k)/3})$ for any non-concatenating protcol, and a stronger lower bound of $Omega(n2^{n-k})$ for any non-adaptive, non-concatenating protocol. The latter is shown to be tight by explicitly constructing a $k$-qubit-ancilla-assisted estimation protocol. We also show how to apply the ancilla-assisted estimation protocol to a practical quantum benchmarking task in a noise-resilient and sample-efficient manner, given reasonable noise assumptions. Our results provide a practically-interesting example for quantum advantages in property learning and also bring new insight for quantum benchmarking.
قيم البحث
اقرأ أيضاً
The accuracy of any physical scheme used to estimate the parameter describing the strength of a single qubit Pauli channel can be quantified using standard techniques from quantum estimation theory. It is known that the optimal estimation scheme, wit
h m channel invocations, uses initial states for the systems which are pure and unentangled and provides an uncertainty of O[1/m^(1/2)]. This protocol is analogous to a classical repetition and averaging scheme. We consider estimation schemes where the initial states available are not pure and compare a protocol involving quantum correlated states to independent state protocols analogous to classical repetition schemes. We show, that unlike the pure state case, the quantum correlated state protocol can yield greater estimation accuracy than any independent state protocol. We show that these gains persist even when the system states are separable and, in some cases, when quantum discord is absent after channel invocation. We describe the relevance of these protocols to nuclear magnetic resonance measurements.
The quantum Fisher information (QFI), as a function of quantum states, measures the amount of information that a quantum state carries about an unknown parameter. The (entanglement-assisted) QFI of a quantum channel is defined to be the maximum QFI o
f the output state assuming an entangled input state over a single probe and an ancilla. In quantum metrology, people are interested in calculating the QFI of $N$ identical copies of a quantum channel when $N rightarrow infty$, which is called the asymptotic QFI. Over the years, researchers found various types of upper bounds of the asymptotic QFI, but they were proven achievable only in several specific situations. It was known that the asymptotic QFI of an arbitrary quantum channel grows either linearly or quadratically with $N$. Here we show that a simple criterion can determine whether the scaling is linear or quadratic. In both cases, the asymptotic QFI and a quantum error correction protocol to achieve it are computable via a semidefinite program. When the scaling is quadratic, the Heisenberg limit, a feature of noiseless quantum channels, is recovered. When the scaling is linear, we show the asymptotic QFI is still in general larger than $N$ times the single-channel QFI and furthermore, sequential estimation strategies provide no advantage over parallel ones.
Motivated by estimation of quantum noise models, we study the problem of learning a Pauli channel, or more generally the Pauli error rates of an arbitrary channel. By employing a novel reduction to the Population Recovery problem, we give an extremel
y simple algorithm that learns the Pauli error rates of an $n$-qubit channel to precision $epsilon$ in $ell_infty$ using just $O(1/epsilon^2) log(n/epsilon)$ applications of the channel. This is optimal up to the logarithmic factors. Our algorithm uses only unentangled state preparation and measurements, and the post-measurement classical runtime is just an $O(1/epsilon)$ factor larger than the measurement data size. It is also impervious to a limited model of measurement noise where heralded measurement failures occur independently with probability $le 1/4$. We then consider the case where the noise channel is close to the identity, meaning that the no-error outcome occurs with probability $1-eta$. In the regime of small $eta$ we extend our algorithm to achieve multiplicative precision $1 pm epsilon$ (i.e., additive precision $epsilon eta$) using just $Obigl(frac{1}{epsilon^2 eta}bigr) log(n/epsilon)$ applications of the channel.
We investigate estimation of fluctuating channels and its effect on security of continuous-variable quantum key distribution. We propose a novel estimation scheme which is based on the clusterization of the estimated transmittance data. We show that
uncertainty about whether the transmittance is fixed or not results in a lower key rate. However, if the total number of measurements is large, one can obtain using our method a key rate similar to the non-fluctuating channel even for highly fluctuating channels. We also verify our theoretical assumptions using experimental data from an atmospheric quantum channel. Our method is therefore promising for secure quantum communication over strongly fluctuating turbulent atmospheric channels.
We consider the problem of jointly estimating expectation values of many Pauli observables, a crucial subroutine in variational quantum algorithms. Starting with randomized measurements, we propose an efficient derandomization procedure that iterativ
ely replaces random single-qubit measurements with fixed Pauli measurements; the resulting deterministic measurement procedure is guaranteed to perform at least as well as the randomized one. In particular, for estimating any $L$ low-weight Pauli observables, a deterministic measurement on only of order $log(L)$ copies of a quantum state suffices. In some cases, for example when some of the Pauli observables have a high weight, the derandomized procedure is substantially better than the randomized one. Specifically, numerical experiments highlight the advantages of our derandomized protocol over various previous methods for estimating the ground-state energies of small molecules.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
