Editing
Direct Fidelity Estimation
Jump to navigation
Jump to search
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
This [https://arxiv.org/abs/1104.4695 example method] is used to certify than an experimental device prepares a desired quantum state. This is directly applicable to a pure quantum state and provides an estimate of the fidelity between the pure state and the actual arbitrary state in the lab, up to a constant additive error. The method requires measuring only a constant number of Pauli expectation values, selected at random according to an importance-weighting rule. '''Tags:''' [[Certification protocol]], [[Fidelity estimation protocol]] ==Assumptions== * The quantum state to be prepared is a pure state. Any other additional structure or symmetry is not assumed. * We can measure <math>n</math>-qubit Pauli observables, that is, tensor products of single-qubit Pauli operators. There is no need to perform any other operations. ==Outline== In this method, we want to compare the final state created in any experiment with the initial state and hence we use fidelity as a figure of merit for this. This method works by measuring a random subset of Pauli observables chosen according to an importance weighing rule. The Pauli observables selected are most likely to detect deviations from the desired state. This method consists of the following steps: * A system is considered of <math>n</math> qubits with a certain space dimension and a pure quantum state is selected that is to be prepared. A group is formed of all possible [[Pauli operators]]. We have a final state, which has to be compared to the original pure quantum state. * A Pauli observable is randomly selected from the group according to predefined importance weighing rule. * A specific amount of copies of the final state are selected, where the amount depends on the selected Pauli observables. * The Pauli observable is measured on each of these copies and the measurement outcome is received. An expectation value is calculated over all the random measurement outcome of all the copies. * To estimate the fidelity with a fixed additive error and failure probability, the procedure from step 2 to step 4 is repeated <math>l</math> times, which is a function of the additive error and failure probability. * The average of all the calculated <math>l</math> expectation values is taken which gives us the estimate of the fidelity. ==Hardware Requirements== * Trusted Measurement device. ==Notation== * <math>d</math>: Dimension of Hilbert space * <math>\rho</math>: Original pure quantum state * <math>\sigma</math>: Final quantum state which has to be compared to the original quantum state * <math>F(\rho, \sigma) = </math>tr(<math>\rho \sigma</math>): Fidelity of the two quantum states <math>\rho</math> and <math>\sigma</math> * <math>W_k (k = 1, 2, ..., d^2)</math>: Denotes all possible Pauli operators, (<math>n</math>-fold tensor products of <math>I</math>, <math>\sigma_x</math>, <math>\sigma_y</math> and <math>\sigma_z</math>) * <math>\chi_p(k)</math>: Characteristic function, <math>\chi_p(k) =</math> tr(<math>\frac{\rho W_k}{\sqrt{d}}</math>) * Pr<math>(k)</math>: Probability of selecting <math>k</math> from <math>\{1, .. ,d^2\}</math>. This is the importance weighting rule, which is a natural probability distribution. Pr<math>(k) = (\chi_p(k))^2</math> * <math>\epsilon</math>: Additive Error * <math>\delta</math>: Failure probability * <math>l</math>: Number of times the process is repeated to obtain the average, <math>l = \frac{1}{\epsilon^2 \delta}</math> * <math>m_i</math>: Number of copies of <math>\sigma</math> in a single process. * <math>A_{ij}</math>: Measurement outcome, <math>A_{ij} \in \{1, -1\}</math> * <math>\tilde{X}</math>: Expectation over all measurement outcomes * <math>\tilde{Y}</math>: Average of all expectation values of all measurement outcomes * <math>E(m)</math>: Expected number of copies of final quantum state ==Properties== * '''The figure of merit''': Fidelity * This protocol requires multiple copies of the final state. The expected numbers of copies are: <math>E(m) \leq 1 + \frac{1}{\epsilon^2\delta} + \frac{2d}{\epsilon^2}log(2/\delta)</math> * This protocol is applicable to a large class of quantum states and requires minimal experimental resources * This protocol is faster than full tomography by a factor of $d$, the dimension of the state space * Measurement of an only constant number of Pauli observables is required however each measurement needs to be repeated. The number of repetitions is <math>O(d)</math> in the worst case, however, in many cases of practical interest, it is smaller. * This protocol used a fixed number of Pauli observables, depending on the additive error and failure probability, and is independent of the size of the system * This method allows one to directly measure the entanglement fidelity and average fidelity of the entire circuit, rather than inferring it from tomography performed on individual gates. ==Procedure Description== '''Input''': copies of final quantum state '''Output''': Figure of merit: Fidelity, <math>F(\rho, \sigma)</math> * For <math>i = 1, 2, ..., l</math>: ** Select <math>k_i \in \{1, .. ,d^2\}</math> randomly, with probability Pr(<math>k_i</math>) ** Determine <math>m_i</math>, <math>m_i = \frac{2}{d (\chi_p(k_i))^2 l \epsilon^2}</math> log<math>\frac{2}{\delta}</math> ** Prepare <math>m_i</math> copies of <math>\sigma</math> ** For <math>j = 1, 2, ..., m_i</math> sequences: *** Measure the Pauli observable <math>W_{k_i}</math> on <math>\sigma</math> *** Get Measurement outcome <math>A_{ij}</math> ** Take estimate over all measurement outcomes to get <math>\tilde{X_i}</math>, <math>\tilde{X_i} = \frac{1}{m_i \sqrt{d} \chi_p(k_i)} \sum^{m_i}_{j=1} A_{ij}</math> * Estimate <math>\tilde{Y},</math> where <math>\tilde{Y} = \frac{1}{l} \sum^{l}_{i=i} \tilde{X_i}</math> * With probability <math>\geq 1-2\delta, F(\rho, \sigma)</math> lies in the range <math>[\tilde{Y} - 2\epsilon, \tilde{Y} + 2\epsilon]</math> ==Further Information== * For stabilizer states, the number of repetitions is constant, independent of the size of the system; and for the W state, it is only quadratic in the number of qubits <math>n</math>. * This method can certify Clifford circuits in constant time, independent of the number of qubits and gates. * This method performs better under some mild assumptions on the noise in the system. If the noise is depolarizing or dephasing, then we get a favourable scaling of <math>\mathcal{O} (\frac{log(1/\delta)}{\epsilon^2})</math> * If the nonzero Pauli expectations are only inverse polynomially small, then the number of copies is polynomial. * By truncating negligibly small probabilities from the relevance distribution, we can improve the worst-case scaling at the cost of adding a tiny (also negligible) bias to our estimate. * An analogous method can be used for certifying any unitary quantum channel by estimating the entanglement fidelity. Most of the analysis for channels is exactly analogous to the case of states. The main difference is that we may also input a state to the channel as well as choose how to measure at the output. ==Related Papers== * S.Flammia and Y.K. Liu (2011) arXiv:1104.4695v3: Direct Fidelity Estimation from Few Pauli Measurements <div style='text-align: right;'>''*contributed by Rhea Parekh''</div>
Summary:
Please note that all contributions to Quantum Protocol Zoo may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
Quantum Protocol Zoo:Copyrights
for details).
Do not submit copyrighted work without permission!
To protect the wiki against automated edit spam, we kindly ask you to solve the following CAPTCHA:
Cancel
Editing help
(opens in new window)
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Log in
Namespaces
Page
Discussion
English
Views
Read
Edit
View history
More
Search
Navigation
Main page
News
Protocol Library
Certification Library
Nodal Subroutines
Codes Repository
Knowledge Graphs
Submissions
Categories
Supplementary Information
Recent Changes
Contact us
Help
Tools
What links here
Related changes
Special pages
Page information