Editing
Quantum Gate Set Tomography
(section)
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!
==Outline== [[State Tomography]] and [[Process Tomography]] assume that the initial states and measurements are known. But if the [[state preparation and measurement]] (SPAM) gates are faulty then the estimates provided using these techniques are faulty as well. Quantum gate set tomography solves this problem by including the SPAM gates self-consistently in the gate set to be estimated. The goal of this method is to completely characterize a gate set, which includes an unknown set of gates and an initial state and 2-outcome [[POVM]]. For self-consistency, the SPAM gates are treated on the same footing as the original gates. The SPAM gates are composed of gates in the gate set and therefore the minimal gate set must include sufficient gates to create a complete set of states and measurements. When these gates are applied to our unknown fixed state and measurement, a complete set of initial states and final state is produced. The experimental requirement for GST is the ability to measure the expectation values for the gate set. Two techniques are shown here, which are Linear inversion (LGST) and maximum likelihood estimation (MLE). The linear inversion protocol is fairly easy to implement numerically and is useful for providing quick diagnostics without resorting to more computationally intensive estimation via constrained optimization. The LGST estimate is not generally physical, the information obtained is somewhat qualitative, and hence MLE is preferred. LGST is a useful starting point for MLE. Since the starting point must be physical, while LGST is not, we should use the closest physical gate set to the LGST estimate. This method consists of the following steps: * Initialize the qubit to a particular state. In most systems, the natural choice for this state is the ground state of the qubit. * For a particular choice of SPAM gates and a gate from the Gate set, the corresponding gate sequence is applied to the qubit. As the SPAM gates are composed of the gates from the gate set, the sequence only contains the gates from the gate set. * The 2-outcome POVM is measured. This POVM is required to be a positive semi-definite Hermitian operator. The natural choice for this POVM in most systems is <math>|0\rangle\langle 0|</math>. (Sometimes <math>|1\rangle\langle 1|</math> is used) * The above 1-3 steps are repeated a large number of times (10000 to 100000). For every repetition, the measurement is success (i.e., the measured state is <math>|0\rangle\langle 0|</math>) is recorded as 1 and the measurement failure (i.e., the measured state is not <math>|0\rangle\langle 0|</math>) is recorded as 0. * The measurement results in the step above are averaged over the number of times the measurement was repeated and the expectation value is calculated. * The above 1-5 steps are repeated for every SPAM gates and every gate in the gate set. This gives us the probability of all the possible gate set and SPAM gate combinations. * Repeat steps 1-5 to measure the expectation values of only the SPAM gates. This is used to form a matrix known as the Gram matrix. If the first gate of the gate set is a null gate, then this step is not needed as this data already exists due to the step performed above. * To find the gate set estimate from the measurement data, there are two techniques: ** Linear inversion method (LGST): *** We should check that the gram matrix is invertible and after certain calculations with the inverted gram matrix, the gate set can be estimated. The LGST estimate is not generally physical, the information obtained is somewhat qualitative. *** The gate set estimated in this way is in a different gauge from the actual gate set. To compensate, we transform to a more useful gauge. Since we do not know the actual gate set, only the target one, the most useful gauge is the one that brings the estimated gate set as close as possible based, on some distance metric, to the target. The gauge transformation is found by solving an optimization problem and the resulting gauge matrix is then applied to the gate set found in the step above. ** Maximum likelihood estimation (MLE): LGST is a useful starting point for MLE. The goal in this method is to find the true probabilities corresponding to the measurements, subject to physical constraints. In this method, the best estimate is found by fitting to experimental data a theoretical model of the probability of obtaining that data. *** This method begins by parameterizing the estimate, state and measurement matrices in terms of a vector of parameters. A number of constraints reduce the total number of independent parameters. *** Putting everything together, the probability estimates are written in terms of the parameter vector and Depending on the parameterization choice each of the gates and states is either a linear or quadratic function of its parameters. Each of the gates and states is either a linear or quadratic function of its parameters. The estimator is, therefore, a homogeneous function of order 5 (linear parameterization) or 10 (quadratic parameterization). *** MLE proceeds by finding the set of parameters that minimizes an objective function. The objective, or likelihood function, is the probability distribution we assume produced the data. *** There are two kinds of parameterizations for gates that are commonly used: The Pauli Process Matrix representation and The Pauli transfer Matrix Representation.
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