full_reportDv3_appendices.tex

\appendix

\clearpage

\iftoggle{debuggingaidsappendix}{
\section{Debugging aids}

If the $\log(\mathcal{L})$ plots in Figures \ref{bestEstimateColorBoxPlot}-\ref{invertedBestEstimateColorBoxPlot} indicate that the data is poorly fit by GST, the next step is to begin ``debugging'' the experiments and/or the fit.  Most commonly, a poor fit is due to non-Markovian behavior.  However, there are many kinds of non-Markovian behavior.  The most straightforward occurs when the gate set fluctuates over time, or when there is other time correlation in the experiments (e.g., due to memory effects).  However, another possibility that must be considered is that repeated gate operations cause changes in the system, e.g. heating it up (as is seen in 2-qubit trapped-ion gates) so that the data from long gate sequences is simply chaotic and inconsistent with shorter experiments.

Figure \ref{directMLEGSTLogLBoxPlot} provides a test (albeit currently an unreliable one) for such an effect.  Like Figures \ref{bestEstimateColorBoxPlot}-\ref{invertedBestEstimateColorBoxPlot}, it displays per-experiment $2\Delta\log(\mathcal{L})$ values -- but \emph{not} for any single gate set.  Instead, this \emph{direct GST} analysis treats each base sequence as an independent process (\emph{not} as a product of many gates), and analyzes it using LSGST together with the individual gates (which are necessary to model the effect of the fiducial sequences that precede and follow the base sequence being analyzed).  The resulting direct GST estimate is then used to assign probabilities for the corresponding experiments.  

This analysis decouples the various germs and base sequences from each other.  Unlike a standard GST analysis, it does not model different base sequences as being generated from the same gates.  Therefore, this analysis \emph{should} be fairly consistent (i.e., lots of gray/white squares and few or no red ones) even if Figures \ref{bestEstimateColorBoxPlot}-\ref{invertedBestEstimateColorBoxPlot} indicate severe fit problems.  

\begin{figure}
\begin{center}
\includegraphics[width=6.50in,height=8.00in,keepaspectratio]{full_reportDv3_files/directLongSeqGSTLogLBoxes.pdf}
\caption{\textbf{$2\Delta\log(\mathcal{L})$ values for ``direct GST'' fit.}  This plot indicates how well direct GST analysis of each base sequence fits the observed data.  By decoupling different base sequences, this analysis largely avoids making any assumptions about Markovianity, and therefore serves as a sanity check on the full GST analysis.  See text for details.\label{directMLEGSTLogLBoxPlot}}
\end{center}
\end{figure}

Figure \ref{directMLEGSTDeviationBoxPlot} uses direct GST analysis in another way, but to detect similar effects.   The goal here is to to compare two different predictions for each base sequence:  (1) the one given by the overall GST fit; and (2) the one obtained by direct GST on that base sequence, as in Figure \ref{directMLEGSTLogLBoxPlot}.  The analysis shown in Figure \ref{directMLEGSTDeviationBoxPlot} does so by computing each process's fidelity with the closest unitary.  This is a measure of non-unitary decoherence.  Then, it plots the \emph{difference} between the values of this ``unitarity'' for (1) the overall GST fit, and (2) the direct GST estimate.  The direct GST estimate is not very precise, but it is extremely reliable, because it is not influenced by any data that are not \emph{directly} connected with that base sequence.  Thus, this serves as another sanity check and debugging aid.  Large absolute values indicate that the full GST fit is signicantly inconsistent with the data (complementing the analysis in Figure \ref{bestEstimateColorBoxPlot}).  Positive numbers indicate that full GST has \emph{overestimated} the amount of decoherence, while negative numbers indicate that it \emph{underestimated} it.

\begin{figure}
\begin{center}
\includegraphics[width=4.00in,height=5.00in,keepaspectratio]{full_reportDv3_files/directLongSeqGSTDeviationBoxes.pdf}
\caption{\textbf{Inconsistency of unitarity between GST and direct GST.}  This plot shows, for each base sequence, the increase in ``upper bound of fidelity with unitary'' (see Table \ref{bestGatesetClosestUnitaryTable}) when using the direct-GST result for a gate sequence instead of the process given by the best gate set.\label{directMLEGSTDeviationBoxPlot}}
\end{center}
\end{figure}

Finally, for various reasons including the diagnosis of non-Markovian behavior, it is often useful to have a direct and reliable estimate of the per-gate incoherent error rate observed in each base sequence.  This is shown in Figure \ref{smallEigvalErrRateColorBoxPlot}.  To obtain these numbers, direct GST is performed on each base sequence.  Then, each resulting process matrices is diagonalized, and the smallest eigenvalue (corresponding the most rapid loss of information/coherence/polarization) is extracted.  This eigenvalue is then raised to the $1/L$ power, where $L$ is the length of the base sequence, to estimate the rate of decoherence per gate, and subtracted from 1 (to convert it to an error rate).  These numbers become much more reliable towards the right-hand side of the plot, because errors in LGST become far less significant for these long sequences.  Large changes in this direct-GST error rate as $L$ is changed (on any given row of the table) are a ``smoking gun'' for non-Markovian decoherence -- especially when the error rate \emph{decreases} with increasing $L$.  Ideally, all numbers in a given row should be the same.

\begin{figure}
\begin{center}
\includegraphics[width=4.00in,height=5.00in,keepaspectratio]{full_reportDv3_files/smallEigvalErrRateBoxes.pdf}
\caption{\textbf{Per-gate error rates, extrapolated from the smallest magnitude eigenvalue of the direct GST gate matrix.}  See text for further details.\label{smallEigvalErrRateColorBoxPlot}}
\end{center}
\end{figure}

%\begin{figure}
%\begin{center}
%\XXputfield{bestEstimateColorBoxPlot_hist}{Histogram of best gate set logL}
%\caption{\XXputfield{tt_bestEstimateColorBoxPlot_hist}{}Histogram plot of best gate set $2\Delta\log(\mathcal{L})$ values.}
%\end{center}
%\end{figure}

}{}


\iftoggle{gaugeoptappendix}{
\section{Best gate set in different gauges\label{appendix_gauge_opts}}

In this appendix, we report the non-gauge-invariant quantities from the main text for different gauge choices.  In each section, GST's best gate set estimate is gauge optimized according to a different objective function, as specified within the section.

\subsection{Gauge optimization to the target gate set}
The gauge is chosen to minimize the Frobenius distance between the estimate and the target gates, with equal weight given to the gate and SPAM parameters.

\begin{table}[h]
\begin{center}
\begin{tabular}[l]{|c|c|c|}
\hline
Operator & Matrix & Hilbert-Schmidt vector (Pauli basis) \\ \hline
$\rho_{0}$ & $ \left(\!\!\begin{array}{cc}
0.955 & 0.001e^{-i0.03} \\ 
0.001e^{i0.03} & 0.045
 \end{array}\!\!\right) $
 & $ \begin{array}{c}
0.707 \\ 
0.001 \\ 
4\e{-5} \\ 
0.643
 \end{array} $
 \\ \hline
$E_{0}$ & $ \left(\!\!\begin{array}{cc}
0.05 & 0.002e^{i1.58} \\ 
0.002e^{-i1.58} & 0.961
 \end{array}\!\!\right) $
 & $ \begin{array}{c}
0.715 \\ 
-1\e{-5} \\ 
-0.002 \\ 
-0.644
 \end{array} $
 \\ \hline
\end{tabular}

\caption{\textbf{The GST estimate of the SPAM operations}.  Compare to Table \ref{targetSpamTable}.\label{bestTargetGatesetSpamTable}}
\end{center}
\end{table}

\begin{table}[h]
\begin{center}
\begin{tabular}[l]{|c|c|c|}
\hline
 & $E_{0}$ & $E_C$ \\ \hline
$\rho_{0}$ & 0.091 & 0.909 \\ \hline
\end{tabular}

\caption{\textbf{GST estimate of SPAM probabilities}.  Computed by taking the dot products of vectors in Table \ref{bestTargetGatesetSpamTable}.\label{bestTargetGatesetSpamParametersTable}}
\end{center}
\end{table}

\begin{table}[h]
\begin{center}
\begin{tabular}[l]{|c|c|}
\hline
Gate & Superoperator (Pauli basis) \\ \hline
Gi & $ \left(\!\!\begin{array}{cccc}
1 & 0 & 0 & 0 \\ 
-0.001 & 0.945 & -0.006 & -0.009 \\ 
4\e{-4} & 0.001 & 0.947 & 0.004 \\ 
0.002 & 2\e{-5} & 0.001 & 0.949
 \end{array}\!\!\right) $
 \\ \hline
Gx & $ \left(\!\!\begin{array}{cccc}
1 & 0 & 0 & 0 \\ 
4\e{-4} & 0.951 & -0.005 & -0.005 \\ 
0.01 & 4\e{-4} & 3\e{-4} & -0.949 \\ 
0.011 & 4\e{-4} & 0.949 & -0.002
 \end{array}\!\!\right) $
 \\ \hline
Gy & $ \left(\!\!\begin{array}{cccc}
1 & 0 & 0 & 0 \\ 
-0.01 & 2\e{-4} & -0.005 & 0.949 \\ 
3\e{-4} & 0.001 & 0.951 & 0.001 \\ 
0.01 & -0.949 & -0.006 & -0.001
 \end{array}\!\!\right) $
 \\ \hline
\end{tabular}

\caption{\textbf{The GST estimate of the logic gate operations}.  Compare to Table \ref{targetGatesTable}.\label{bestTargetGatesetGatesTable}}
\end{center}
\end{table}

\begin{table}[h]
\begin{center}
\begin{tabular}[l]{|c|c|c|c|}
\hline
Gate & \begin{tabular}{c}Process\\Infidelity\end{tabular} & \begin{tabular}{c}$\nicefrac{1}{2}$ Trace\\Distance\end{tabular} & $\nicefrac{1}{2}$ $\Diamond$-Norm \\ \hline
Gi & 0.04 & 0.04 & 0.04 \\ \hline
Gx & 0.038 & 0.038 & 0.039 \\ \hline
Gy & 0.038 & 0.038 & 0.039 \\ \hline
\end{tabular}

\vspace{2em}
\begin{tabular}[l]{|c|c|}
\hline
Gate & Error Generator \\ \hline
Gi & $ \left(\!\!\begin{array}{cccc}
0 & 0 & 0 & 0 \\ 
-0.001 & -0.057 & -0.007 & -0.009 \\ 
4\e{-4} & 0.001 & -0.054 & 0.004 \\ 
0.002 & 2\e{-5} & 0.001 & -0.053
 \end{array}\!\!\right) $
 \\ \hline
Gx & $ \left(\!\!\begin{array}{cccc}
0 & 0 & 0 & 0 \\ 
4\e{-4} & -0.051 & 7\e{-5} & -0.008 \\ 
0.017 & 0.001 & -0.05 & -0.001 \\ 
0.001 & 6\e{-6} & 0.001 & -0.055
 \end{array}\!\!\right) $
 \\ \hline
Gy & $ \left(\!\!\begin{array}{cccc}
0 & 0 & 0 & 0 \\ 
-0.016 & -0.052 & 0.001 & -5\e{-5} \\ 
3\e{-4} & 0.002 & -0.05 & 6\e{-5} \\ 
-9\e{-5} & -5\e{-4} & -0.008 & -0.053
 \end{array}\!\!\right) $
 \\ \hline
\end{tabular}

\caption{\textbf{Comparison of GST estimated gates to target gates}.  This table presents, for each of the gates, three different measures of distance or discrepancy from the GST estimate to the ideal target operation.  See text for more detail.  The column labeled ``Error Generator'' gives the Lindbladian $\mathbb{L}$ that describes \emph{how} the gate is failing to match the target.  This error generator is defined by the equation $\hat{G} = G_{\mathrm{target}}e^{\mathbb{L}}$. \label{bestTargetGatesetVsTargetTable}}
\end{center}
\end{table}

\begin{table}[h]
\begin{center}
\begin{tabular}[l]{|c|c|c|c|c|c|}
\hline
Gate & Eigenvalues & Fixed pt & Rotn. axis & Diag. decay & Off-diag. decay \\ \hline
Gi & $ \begin{array}{c}
0.949 \\ 
0.946e^{i0.00} \\ 
0.946e^{-i0.00} \\ 
1
 \end{array} $
 & $ \begin{array}{c}
0.998 \\ 
-0.023 \\ 
0.009 \\ 
0.031
 \end{array} $
 & $ \begin{array}{c}
0 \\ 
0.933 \\ 
-0.151 \\ 
-0.326
 \end{array} $
 & 0.051 & 0.054 \\ \hline
Gx & $ \begin{array}{c}
0.949e^{i1.57} \\ 
0.949e^{-i1.57} \\ 
0.951 \\ 
1
 \end{array} $
 & $ \begin{array}{c}
1 \\ 
0.006 \\ 
-2\e{-5} \\ 
0.011
 \end{array} $
 & $ \begin{array}{c}
0 \\ 
-1 \\ 
3\e{-6} \\ 
-5\e{-4}
 \end{array} $
 & 0.049 & 0.051 \\ \hline
Gy & $ \begin{array}{c}
0.949e^{i1.57} \\ 
0.949e^{-i1.57} \\ 
0.951 \\ 
1
 \end{array} $
 & $ \begin{array}{c}
1 \\ 
-4\e{-4} \\ 
0.006 \\ 
0.01
 \end{array} $
 & $ \begin{array}{c}
0 \\ 
-0.005 \\ 
1 \\ 
-0.001
 \end{array} $
 & 0.049 & 0.051 \\ \hline
\end{tabular}

\vspace{2em}
\begin{tabular}[l]{|c|c|c|c|c|}
\hline
\multirow{2}{*}{Gate} & \multirow{2}{*}{Angle} & \multicolumn{3}{c|}{Angle between Rotation Axes} \\ \cline{3-5}
 & & Gi & Gx & Gy \\ \hline
Gi & 0.001$\pi$ &  & 0.883$\pi$ & 0.55$\pi$ \\ \hline
Gx & 0.5$\pi$ & 0.883$\pi$ &  & 0.498$\pi$ \\ \hline
Gy & 0.5$\pi$ & 0.55$\pi$ & 0.498$\pi$ &  \\ \hline
\end{tabular}

\caption{\textbf{Eigen-decomposition of estimated gates}.  Each estimated gate is described in terms of: (1) the eigenvalues of the superoperator; (2) the gate's fixed point (as a vector in $\mathcal{B}(\mathcal{H})$, in the Pauli basis); (3)  the axis around which it rotates, as a vector in $\mathcal{B}(\mathcal{H})$; (4) the angle of the rotation that it applies; (5) the decay rate along the axis of rotation (``diagonal decay''); and (6) the decay rate perpendicular to the axis of rotation (``off-diagonal decay'').  ``--'' indicates that the decomposition failed or couldn't be interpreted. \label{bestTargetGatesetDecompTable}}
\end{center}
\end{table}


\begin{table}[h]
\begin{center}
\begin{tabular}[l]{|c|c|c|c|c|c|}
\hline
Gate & \begin{tabular}{c}Process\\Infidelity\end{tabular} & \begin{tabular}{c}$\nicefrac{1}{2}$ Trace\\Distance\end{tabular} & \begin{tabular}{c}Rotation\\Axis\end{tabular} & \begin{tabular}{c}Rotation\\Angle\end{tabular} & Sanity \checkmark \\ \hline
Gi & 0.04 & 0.04 & $ \begin{array}{c}
0 \\ 
-0.262 \\ 
-0.741 \\ 
0.618
 \end{array} $
 & 0.002$\pi$ & 6\e{-6} \\ \hline
Gx & 0.038 & 0.038 & $ \begin{array}{c}
0 \\ 
1 \\ 
-0.003 \\ 
2\e{-4}
 \end{array} $
 & 0.5$\pi$ & 4\e{-4} \\ \hline
Gy & 0.038 & 0.038 & $ \begin{array}{c}
0 \\ 
0.003 \\ 
-1 \\ 
-5\e{-4}
 \end{array} $
 & 0.5$\pi$ & 4\e{-4} \\ \hline
\end{tabular}

\caption{Information pertaining to the closest unitary gate to each of the estimated gates.\label{bestTargetGatesetClosestUnitaryTable}}
\end{center}
\end{table}


\begin{table}[h]
\begin{center}
\begin{tabular}[l]{|c|c|c|}
\hline
Gate & Choi matrix (Pauli basis) & Eigenvalues \\ \hline
Gi & $ \left(\!\!\begin{array}{cccc}
0.96 & 0.001e^{-i1.86} & 0.002e^{-i1.53} & 0.002e^{i1.36} \\ 
0.001e^{i1.86} & 0.012 & 0.001e^{-i2.84} & 0.002e^{i3.10} \\ 
0.002e^{i1.53} & 0.001e^{i2.84} & 0.013 & 0.001e^{i0.20} \\ 
0.002e^{-i1.36} & 0.002e^{-i3.10} & 0.001e^{-i0.20} & 0.014
 \end{array}\!\!\right) $
 & $ \begin{array}{c}
0.011 \\ 
0.013 \\ 
0.017 \\ 
0.96
 \end{array} $
 \\ \hline
Gx & $ \left(\!\!\begin{array}{cccc}
0.487 & 0.475e^{i1.57} & 0.003e^{-i0.50} & 0.003e^{i0.47} \\ 
0.475e^{-i1.57} & 0.488 & 0.003e^{-i1.98} & 0.003e^{i2.01} \\ 
0.003e^{i0.50} & 0.003e^{i1.98} & 0.013 & 9\e{-5}e^{-i1.56} \\ 
0.003e^{-i0.47} & 0.003e^{-i2.01} & 9\e{-5}e^{i1.56} & 0.012
 \end{array}\!\!\right) $
 & $ \begin{array}{c}
0.008 \\ 
0.013 \\ 
0.017 \\ 
0.962
 \end{array} $
 \\ \hline
Gy & $ \left(\!\!\begin{array}{cccc}
0.488 & 0.003e^{-i2.53} & 0.474e^{i1.57} & 0.003e^{i0.54} \\ 
0.003e^{i2.53} & 0.012 & 0.003e^{-i1.88} & 1\e{-4}e^{i2.41} \\ 
0.474e^{-i1.57} & 0.003e^{i1.88} & 0.488 & 0.003e^{i1.96} \\ 
0.003e^{-i0.54} & 1\e{-4}e^{-i2.41} & 0.003e^{-i1.96} & 0.012
 \end{array}\!\!\right) $
 & $ \begin{array}{c}
0.009 \\ 
0.012 \\ 
0.017 \\ 
0.962
 \end{array} $
 \\ \hline
\end{tabular}

\caption{\textbf{Choi matrix representation of the GST estimated gate set}.  This table lists Choi representations of the estimated gates, and their eigenvalues.  Unitary gates have a spectrum $(1,0,0\ldots)$, just like pure quantum states.  Negative eigenvalues are non-physical, and may represent either statistical fluctuations or violations of the CPTP model used by GST.\label{bestTargetGatesetChoiTable}}
\end{center}
\end{table}


\clearpage

\subsection{Gauge optimization to the target SPAM}
The gauge is chosen to minimize the Frobenius distance between the estimate and the target gates, with 99\% weight given to the SPAM parameters, 1\% to the gate parameters.

\begin{table}[h]
\begin{center}
\begin{tabular}[l]{|c|c|c|}
\hline
Operator & Matrix & Hilbert-Schmidt vector (Pauli basis) \\ \hline
$\rho_{0}$ & $ \left(\!\!\begin{array}{cc}
0.97 & 6\e{-6}e^{i0.53} \\ 
6\e{-6}e^{-i0.53} & 0.03
 \end{array}\!\!\right) $
 & $ \begin{array}{c}
0.707 \\ 
7\e{-6} \\ 
-4\e{-6} \\ 
0.664
 \end{array} $
 \\ \hline
$E_{0}$ & $ \left(\!\!\begin{array}{cc}
0.063 & 2\e{-5}e^{i1.31} \\ 
2\e{-5}e^{-i1.31} & 1.002
 \end{array}\!\!\right) $
 & $ \begin{array}{c}
0.753 \\ 
6\e{-6} \\ 
-2\e{-5} \\ 
-0.664
 \end{array} $
 \\ \hline
\end{tabular}

\caption{\textbf{The GST estimate of the SPAM operations}.  Compare to Table \ref{targetSpamTable}.\label{bestTargetSpamGatesetSpamTable}}
\end{center}
\end{table}

\begin{table}[h]
\begin{center}
\begin{tabular}[l]{|c|c|c|}
\hline
 & $E_{0}$ & $E_C$ \\ \hline
$\rho_{0}$ & 0.091 & 0.909 \\ \hline
\end{tabular}

\caption{\textbf{GST estimate of SPAM probabilities}.  Computed by taking the dot products of vectors in Table \ref{bestTargetSpamGatesetSpamTable}.\label{bestTargetSpamGatesetSpamParametersTable}}
\end{center}
\end{table}

\begin{table}[h]
\begin{center}
\begin{tabular}[l]{|c|c|}
\hline
Gate & Superoperator (Pauli basis) \\ \hline
Gi & $ \left(\!\!\begin{array}{cccc}
1 & 0 & 0 & 0 \\ 
-5\e{-4} & 0.945 & -0.006 & -0.009 \\ 
2\e{-4} & 0.001 & 0.947 & 0.004 \\ 
0.004 & 3\e{-5} & 0.001 & 0.949
 \end{array}\!\!\right) $
 \\ \hline
Gx & $ \left(\!\!\begin{array}{cccc}
1 & 0 & 0 & 0 \\ 
0.001 & 0.951 & -0.005 & -0.004 \\ 
0.065 & 1\e{-4} & 0.002 & -0.947 \\ 
0.066 & 0.001 & 0.951 & -0.004
 \end{array}\!\!\right) $
 \\ \hline
Gy & $ \left(\!\!\begin{array}{cccc}
1 & 0 & 0 & 0 \\ 
-0.065 & 0.001 & -0.008 & 0.947 \\ 
2\e{-4} & 0.004 & 0.951 & 0.003 \\ 
0.065 & -0.951 & -0.002 & -0.001
 \end{array}\!\!\right) $
 \\ \hline
\end{tabular}

\caption{\textbf{The GST estimate of the logic gate operations}.  Compare to Table \ref{targetGatesTable}.\label{bestTargetSpamGatesetGatesTable}}
\end{center}
\end{table}

\begin{table}[h]
\begin{center}
\begin{tabular}[l]{|c|c|c|c|}
\hline
Gate & \begin{tabular}{c}Process\\Infidelity\end{tabular} & \begin{tabular}{c}$\nicefrac{1}{2}$ Trace\\Distance\end{tabular} & $\nicefrac{1}{2}$ $\Diamond$-Norm \\ \hline
Gi & 0.04 & 0.04 & 0.04 \\ \hline
Gx & 0.038 & 0.058 & 0.07 \\ \hline
Gy & 0.038 & 0.057 & 0.071 \\ \hline
\end{tabular}

\vspace{2em}
\begin{tabular}[l]{|c|c|}
\hline
Gate & Error Generator \\ \hline
Gi & $ \left(\!\!\begin{array}{cccc}
0 & 0 & 0 & 0 \\ 
-5\e{-4} & -0.057 & -0.007 & -0.009 \\ 
2\e{-4} & 0.001 & -0.054 & 0.004 \\ 
0.005 & 3\e{-5} & 0.001 & -0.053
 \end{array}\!\!\right) $
 \\ \hline
Gx & $ \left(\!\!\begin{array}{cccc}
0 & 0 & 0 & 0 \\ 
0.001 & -0.051 & -0.001 & -0.008 \\ 
0.105 & 0.001 & -0.048 & 0.002 \\ 
0.001 & 0.001 & 0.005 & -0.057
 \end{array}\!\!\right) $
 \\ \hline
Gy & $ \left(\!\!\begin{array}{cccc}
0 & 0 & 0 & 0 \\ 
-0.105 & -0.051 & -0.005 & -0.004 \\ 
4\e{-4} & 0.006 & -0.05 & -5\e{-4} \\ 
0.001 & -0.004 & -0.009 & -0.054
 \end{array}\!\!\right) $
 \\ \hline
\end{tabular}

\caption{\textbf{Comparison of GST estimated gates to target gates}.  This table presents, for each of the gates, three different measures of distance or discrepancy from the GST estimate to the ideal target operation.  See text for more detail.  The column labeled ``Error Generator'' gives the Lindbladian $\mathbb{L}$ that describes \emph{how} the gate is failing to match the target.  This error generator is defined by the equation $\hat{G} = G_{\mathrm{target}}e^{\mathbb{L}}$. \label{bestTargetSpamGatesetVsTargetTable}}
\end{center}
\end{table}

\begin{table}[h]
\begin{center}
\begin{tabular}[l]{|c|c|c|c|c|c|}
\hline
Gate & Eigenvalues & Fixed pt & Rotn. axis & Diag. decay & Off-diag. decay \\ \hline
Gi & $ \begin{array}{c}
0.949 \\ 
0.946e^{i0.00} \\ 
0.946e^{-i0.00} \\ 
1
 \end{array} $
 & $ \begin{array}{c}
0.992 \\ 
-0.023 \\ 
0.01 \\ 
0.087
 \end{array} $
 & $ \begin{array}{c}
0 \\ 
0.933 \\ 
-0.151 \\ 
-0.327
 \end{array} $
 & 0.051 & 0.054 \\ \hline
Gx & $ \begin{array}{c}
0.949e^{i1.57} \\ 
0.949e^{-i1.57} \\ 
0.951 \\ 
1
 \end{array} $
 & $ \begin{array}{c}
0.995 \\ 
0.005 \\ 
0.002 \\ 
0.067
 \end{array} $
 & $ \begin{array}{c}
0 \\ 
-1 \\ 
3\e{-4} \\ 
-5\e{-4}
 \end{array} $
 & 0.049 & 0.051 \\ \hline
Gy & $ \begin{array}{c}
0.949e^{i1.57} \\ 
0.949e^{-i1.57} \\ 
0.951 \\ 
1
 \end{array} $
 & $ \begin{array}{c}
0.995 \\ 
-0.002 \\ 
0.008 \\ 
0.066
 \end{array} $
 & $ \begin{array}{c}
0 \\ 
-0.006 \\ 
1 \\ 
0.003
 \end{array} $
 & 0.049 & 0.051 \\ \hline
\end{tabular}

\vspace{2em}
\begin{tabular}[l]{|c|c|c|c|c|}
\hline
\multirow{2}{*}{Gate} & \multirow{2}{*}{Angle} & \multicolumn{3}{c|}{Angle between Rotation Axes} \\ \cline{3-5}
 & & Gi & Gx & Gy \\ \hline
Gi & 0.001$\pi$ &  & 0.883$\pi$ & 0.55$\pi$ \\ \hline
Gx & 0.5$\pi$ & 0.883$\pi$ &  & 0.498$\pi$ \\ \hline
Gy & 0.5$\pi$ & 0.55$\pi$ & 0.498$\pi$ &  \\ \hline
\end{tabular}

\caption{\textbf{Eigen-decomposition of estimated gates}.  Each estimated gate is described in terms of: (1) the eigenvalues of the superoperator; (2) the gate's fixed point (as a vector in $\mathcal{B}(\mathcal{H})$, in the Pauli basis); (3)  the axis around which it rotates, as a vector in $\mathcal{B}(\mathcal{H})$; (4) the angle of the rotation that it applies; (5) the decay rate along the axis of rotation (``diagonal decay''); and (6) the decay rate perpendicular to the axis of rotation (``off-diagonal decay'').  ``--'' indicates that the decomposition failed or couldn't be interpreted. \label{bestTargetSpamGatesetDecompTable}}
\end{center}
\end{table}


\begin{table}[h]
\begin{center}
\begin{tabular}[l]{|c|c|c|c|c|c|}
\hline
Gate & \begin{tabular}{c}Process\\Infidelity\end{tabular} & \begin{tabular}{c}$\nicefrac{1}{2}$ Trace\\Distance\end{tabular} & \begin{tabular}{c}Rotation\\Axis\end{tabular} & \begin{tabular}{c}Rotation\\Angle\end{tabular} & Sanity \checkmark \\ \hline
Gi & 0.04 & 0.04 & $ \begin{array}{c}
0 \\ 
0.262 \\ 
0.743 \\ 
-0.616
 \end{array} $
 & 0.002$\pi$ & 3\e{-5} \\ \hline
Gx & 0.038 & 0.058 & $ \begin{array}{c}
0 \\ 
1 \\ 
-0.003 \\ 
4\e{-4}
 \end{array} $
 & 0.5$\pi$ & 0.015 \\ \hline
Gy & 0.038 & 0.057 & $ \begin{array}{c}
0 \\ 
-0.003 \\ 
1 \\ 
0.003
 \end{array} $
 & 0.5$\pi$ & 0.015 \\ \hline
\end{tabular}

\caption{Information pertaining to the closest unitary gate to each of the estimated gates.\label{bestTargetSpamGatesetClosestUnitaryTable}}
\end{center}
\end{table}


\begin{table}[h]
\begin{center}
\begin{tabular}[l]{|c|c|c|}
\hline
Gate & Choi matrix (Pauli basis) & Eigenvalues \\ \hline
Gi & $ \left(\!\!\begin{array}{cccc}
0.96 & 0.001e^{-i1.72} & 0.002e^{-i1.54} & 0.002e^{i1.02} \\ 
0.001e^{i1.72} & 0.012 & 0.002e^{-i2.43} & 0.002e^{i3.11} \\ 
0.002e^{i1.54} & 0.002e^{i2.43} & 0.013 & 0.001e^{i0.10} \\ 
0.002e^{-i1.02} & 0.002e^{-i3.11} & 0.001e^{-i0.10} & 0.014
 \end{array}\!\!\right) $
 & $ \begin{array}{c}
0.01 \\ 
0.013 \\ 
0.017 \\ 
0.96
 \end{array} $
 \\ \hline
Gx & $ \left(\!\!\begin{array}{cccc}
0.487 & 0.475e^{i1.57} & 0.016e^{-i0.08} & 0.016e^{i0.08} \\ 
0.475e^{-i1.57} & 0.488 & 0.016e^{-i1.65} & 0.016e^{i1.63} \\ 
0.016e^{i0.08} & 0.016e^{i1.65} & 0.014 & 0.001e^{-i0.13} \\ 
0.016e^{-i0.08} & 0.016e^{-i1.63} & 0.001e^{i0.13} & 0.011
 \end{array}\!\!\right) $
 & $ \begin{array}{c}
-0.011 \\ 
0.013 \\ 
0.035 \\ 
0.963
 \end{array} $
 \\ \hline
Gy & $ \left(\!\!\begin{array}{cccc}
0.488 & 0.016e^{-i3.05} & 0.474e^{i1.57} & 0.017e^{i0.19} \\ 
0.016e^{i3.05} & 0.013 & 0.016e^{-i1.64} & 0.001e^{i3.10} \\ 
0.474e^{-i1.57} & 0.016e^{i1.64} & 0.488 & 0.016e^{i1.56} \\ 
0.017e^{-i0.19} & 0.001e^{-i3.10} & 0.016e^{-i1.56} & 0.012
 \end{array}\!\!\right) $
 & $ \begin{array}{c}
-0.011 \\ 
0.012 \\ 
0.036 \\ 
0.963
 \end{array} $
 \\ \hline
\end{tabular}

\caption{\textbf{Choi matrix representation of the GST estimated gate set}.  This table lists Choi representations of the estimated gates, and their eigenvalues.  Unitary gates have a spectrum $(1,0,0\ldots)$, just like pure quantum states.  Negative eigenvalues are non-physical, and may represent either statistical fluctuations or violations of the CPTP model used by GST.\label{bestTargetSpamGatesetChoiTable}}
\end{center}
\end{table}

\clearpage

\subsection{Gauge optimization to the target gates:}
The gauge is chosen to minimize the Frobenius distance between the estimate and the target gates, with 99\% weight given to the gate parameters, 1\% to the SPAM parameters.


\begin{table}[h]
\begin{center}
\begin{tabular}[l]{|c|c|c|}
\hline
Operator & Matrix & Hilbert-Schmidt vector (Pauli basis) \\ \hline
$\rho_{0}$ & $ \left(\!\!\begin{array}{cc}
0.951 & 0.001e^{-i0.16} \\ 
0.001e^{i0.16} & 0.049
 \end{array}\!\!\right) $
 & $ \begin{array}{c}
0.707 \\ 
0.002 \\ 
3\e{-4} \\ 
0.637
 \end{array} $
 \\ \hline
$E_{0}$ & $ \left(\!\!\begin{array}{cc}
0.046 & 0.002e^{i1.61} \\ 
0.002e^{-i1.61} & 0.955
 \end{array}\!\!\right) $
 & $ \begin{array}{c}
0.708 \\ 
-1\e{-4} \\ 
-0.003 \\ 
-0.643
 \end{array} $
 \\ \hline
\end{tabular}

\caption{\textbf{The GST estimate of the SPAM operations}.  Compare to Table \ref{targetSpamTable}.\label{bestTargetGatesGatesetSpamTable}}
\end{center}
\end{table}

\begin{table}[h]
\begin{center}
\begin{tabular}[l]{|c|c|c|}
\hline
 & $E_{0}$ & $E_C$ \\ \hline
$\rho_{0}$ & 0.091 & 0.909 \\ \hline
\end{tabular}

\caption{\textbf{GST estimate of SPAM probabilities}.  Computed by taking the dot products of vectors in Table \ref{bestTargetGatesGatesetSpamTable}.\label{bestTargetGatesGatesetSpamParametersTable}}
\end{center}
\end{table}

\begin{table}[h]
\begin{center}
\begin{tabular}[l]{|c|c|}
\hline
Gate & Superoperator (Pauli basis) \\ \hline
Gi & $ \left(\!\!\begin{array}{cccc}
1 & 0 & 0 & 0 \\ 
-0.001 & 0.945 & -0.006 & -0.009 \\ 
4\e{-4} & 0.001 & 0.947 & 0.004 \\ 
0.001 & 2\e{-5} & 0.001 & 0.949
 \end{array}\!\!\right) $
 \\ \hline
Gx & $ \left(\!\!\begin{array}{cccc}
1 & 0 & 0 & 0 \\ 
3\e{-4} & 0.951 & -0.005 & -0.005 \\ 
2\e{-4} & 3\e{-4} & 8\e{-5} & -0.949 \\ 
2\e{-4} & 3\e{-4} & 0.949 & -0.002
 \end{array}\!\!\right) $
 \\ \hline
Gy & $ \left(\!\!\begin{array}{cccc}
1 & 0 & 0 & 0 \\ 
2\e{-4} & 8\e{-5} & -0.004 & 0.949 \\ 
3\e{-4} & 0.001 & 0.951 & 0.001 \\ 
-2\e{-4} & -0.949 & -0.006 & -0.001
 \end{array}\!\!\right) $
 \\ \hline
\end{tabular}

\caption{\textbf{The GST estimate of the logic gate operations}.  Compare to Table \ref{targetGatesTable}.\label{bestTargetGatesGatesetGatesTable}}
\end{center}
\end{table}

\begin{table}[h]
\begin{center}
\begin{tabular}[l]{|c|c|c|c|}
\hline
Gate & \begin{tabular}{c}Process\\Infidelity\end{tabular} & \begin{tabular}{c}$\nicefrac{1}{2}$ Trace\\Distance\end{tabular} & $\nicefrac{1}{2}$ $\Diamond$-Norm \\ \hline
Gi & 0.04 & 0.04 & 0.04 \\ \hline
Gx & 0.038 & 0.038 & 0.038 \\ \hline
Gy & 0.038 & 0.038 & 0.038 \\ \hline
\end{tabular}

\vspace{2em}
\begin{tabular}[l]{|c|c|}
\hline
Gate & Error Generator \\ \hline
Gi & $ \left(\!\!\begin{array}{cccc}
0 & 0 & 0 & 0 \\ 
-0.001 & -0.057 & -0.007 & -0.009 \\ 
4\e{-4} & 0.001 & -0.054 & 0.004 \\ 
0.001 & 2\e{-5} & 0.001 & -0.053
 \end{array}\!\!\right) $
 \\ \hline
Gx & $ \left(\!\!\begin{array}{cccc}
0 & 0 & 0 & 0 \\ 
3\e{-4} & -0.051 & 4\e{-4} & -0.008 \\ 
3\e{-4} & 5\e{-4} & -0.05 & -0.001 \\ 
5\e{-5} & 7\e{-6} & 0.001 & -0.054
 \end{array}\!\!\right) $
 \\ \hline
Gy & $ \left(\!\!\begin{array}{cccc}
0 & 0 & 0 & 0 \\ 
3\e{-4} & -0.052 & 0.002 & 5\e{-5} \\ 
3\e{-4} & 0.002 & -0.05 & 6\e{-5} \\ 
2\e{-5} & -4\e{-4} & -0.008 & -0.053
 \end{array}\!\!\right) $
 \\ \hline
\end{tabular}

\caption{\textbf{Comparison of GST estimated gates to target gates}.  This table presents, for each of the gates, three different measures of distance or discrepancy from the GST estimate to the ideal target operation.  See text for more detail.  The column labeled ``Error Generator'' gives the Lindbladian $\mathbb{L}$ that describes \emph{how} the gate is failing to match the target.  This error generator is defined by the equation $\hat{G} = G_{\mathrm{target}}e^{\mathbb{L}}$. \label{bestTargetGatesGatesetVsTargetTable}}
\end{center}
\end{table}

\begin{table}[h]
\begin{center}
\begin{tabular}[l]{|c|c|c|c|c|c|}
\hline
Gate & Eigenvalues & Fixed pt & Rotn. axis & Diag. decay & Off-diag. decay \\ \hline
Gi & $ \begin{array}{c}
0.949 \\ 
0.946e^{i0.00} \\ 
0.946e^{-i0.00} \\ 
1
 \end{array} $
 & $ \begin{array}{c}
0.999 \\ 
-0.023 \\ 
0.009 \\ 
0.021
 \end{array} $
 & $ \begin{array}{c}
0 \\ 
0.933 \\ 
-0.151 \\ 
-0.326
 \end{array} $
 & 0.051 & 0.054 \\ \hline
Gx & $ \begin{array}{c}
0.949e^{i1.57} \\ 
0.949e^{-i1.57} \\ 
0.951 \\ 
1
 \end{array} $
 & $ \begin{array}{c}
1 \\ 
0.007 \\ 
-3\e{-5} \\ 
2\e{-4}
 \end{array} $
 & $ \begin{array}{c}
0 \\ 
-1 \\ 
4\e{-6} \\ 
-3\e{-4}
 \end{array} $
 & 0.049 & 0.051 \\ \hline
Gy & $ \begin{array}{c}
0.949e^{i1.57} \\ 
0.949e^{-i1.57} \\ 
0.951 \\ 
1
 \end{array} $
 & $ \begin{array}{c}
1 \\ 
-2\e{-5} \\ 
0.006 \\ 
-2\e{-4}
 \end{array} $
 & $ \begin{array}{c}
0 \\ 
-0.005 \\ 
1 \\ 
-0.001
 \end{array} $
 & 0.049 & 0.051 \\ \hline
\end{tabular}

\vspace{2em}
\begin{tabular}[l]{|c|c|c|c|c|}
\hline
\multirow{2}{*}{Gate} & \multirow{2}{*}{Angle} & \multicolumn{3}{c|}{Angle between Rotation Axes} \\ \cline{3-5}
 & & Gi & Gx & Gy \\ \hline
Gi & 0.001$\pi$ &  & 0.883$\pi$ & 0.55$\pi$ \\ \hline
Gx & 0.5$\pi$ & 0.883$\pi$ &  & 0.498$\pi$ \\ \hline
Gy & 0.5$\pi$ & 0.55$\pi$ & 0.498$\pi$ &  \\ \hline
\end{tabular}

\caption{\textbf{Eigen-decomposition of estimated gates}.  Each estimated gate is described in terms of: (1) the eigenvalues of the superoperator; (2) the gate's fixed point (as a vector in $\mathcal{B}(\mathcal{H})$, in the Pauli basis); (3)  the axis around which it rotates, as a vector in $\mathcal{B}(\mathcal{H})$; (4) the angle of the rotation that it applies; (5) the decay rate along the axis of rotation (``diagonal decay''); and (6) the decay rate perpendicular to the axis of rotation (``off-diagonal decay'').  ``--'' indicates that the decomposition failed or couldn't be interpreted. \label{bestTargetGatesGatesetDecompTable}}
\end{center}
\end{table}


\begin{table}[h]
\begin{center}
\begin{tabular}[l]{|c|c|c|c|c|c|}
\hline
Gate & \begin{tabular}{c}Process\\Infidelity\end{tabular} & \begin{tabular}{c}$\nicefrac{1}{2}$ Trace\\Distance\end{tabular} & \begin{tabular}{c}Rotation\\Axis\end{tabular} & \begin{tabular}{c}Rotation\\Angle\end{tabular} & Sanity \checkmark \\ \hline
Gi & 0.04 & 0.04 & $ \begin{array}{c}
0 \\ 
0.262 \\ 
0.741 \\ 
-0.618
 \end{array} $
 & 0.002$\pi$ & 4\e{-6} \\ \hline
Gx & 0.038 & 0.038 & $ \begin{array}{c}
0 \\ 
1 \\ 
-0.003 \\ 
2\e{-5}
 \end{array} $
 & 0.5$\pi$ & 3\e{-7} \\ \hline
Gy & 0.038 & 0.038 & $ \begin{array}{c}
0 \\ 
-0.003 \\ 
1 \\ 
-4\e{-6}
 \end{array} $
 & 0.5$\pi$ & 3\e{-7} \\ \hline
\end{tabular}

\caption{Information pertaining to the closest unitary gate to each of the estimated gates.\label{bestTargetGatesGatesetClosestUnitaryTable}}
\end{center}
\end{table}


\begin{table}[h]
\begin{center}
\begin{tabular}[l]{|c|c|c|}
\hline
Gate & Choi matrix (Pauli basis) & Eigenvalues \\ \hline
Gi & $ \left(\!\!\begin{array}{cccc}
0.96 & 0.001e^{-i1.88} & 0.002e^{-i1.52} & 0.002e^{i1.43} \\ 
0.001e^{i1.88} & 0.012 & 0.001e^{-i2.94} & 0.002e^{i3.09} \\ 
0.002e^{i1.52} & 0.001e^{i2.94} & 0.013 & 0.001e^{i0.22} \\ 
0.002e^{-i1.43} & 0.002e^{-i3.09} & 0.001e^{-i0.22} & 0.014
 \end{array}\!\!\right) $
 & $ \begin{array}{c}
0.011 \\ 
0.013 \\ 
0.017 \\ 
0.96
 \end{array} $
 \\ \hline
Gx & $ \left(\!\!\begin{array}{cccc}
0.487 & 0.475e^{i1.57} & 0.001e^{-i1.54} & 0.001e^{i1.53} \\ 
0.475e^{-i1.57} & 0.488 & 0.001e^{-i3.09} & 0.001e^{i3.11} \\ 
0.001e^{i1.54} & 0.001e^{i3.09} & 0.013 & 9\e{-5}e^{-i1.91} \\ 
0.001e^{-i1.53} & 0.001e^{-i3.11} & 9\e{-5}e^{i1.91} & 0.012
 \end{array}\!\!\right) $
 & $ \begin{array}{c}
0.011 \\ 
0.013 \\ 
0.014 \\ 
0.962
 \end{array} $
 \\ \hline
Gy & $ \left(\!\!\begin{array}{cccc}
0.488 & 0.002e^{-i1.54} & 0.474e^{i1.57} & 0.001e^{i1.61} \\ 
0.002e^{i1.54} & 0.012 & 0.001e^{i3.08} & 9\e{-5}e^{i2.17} \\ 
0.474e^{-i1.57} & 0.001e^{-i3.08} & 0.488 & 0.001e^{-i3.10} \\ 
0.001e^{-i1.61} & 9\e{-5}e^{-i2.17} & 0.001e^{i3.10} & 0.012
 \end{array}\!\!\right) $
 & $ \begin{array}{c}
0.011 \\ 
0.012 \\ 
0.015 \\ 
0.962
 \end{array} $
 \\ \hline
\end{tabular}

\caption{\textbf{Choi matrix representation of the GST estimated gate set}.  This table lists Choi representations of the estimated gates, and their eigenvalues.  Unitary gates have a spectrum $(1,0,0\ldots)$, just like pure quantum states.  Negative eigenvalues are non-physical, and may represent either statistical fluctuations or violations of the CPTP model used by GST.\label{bestTargetGatesGatesetChoiTable}}
\end{center}
\end{table}

\clearpage

\subsection{Gauge optimization to TP}
The gauge is chosen to make the gate set as trace-preserving as possible.  This is done by minimizing the sum of the squared euclidian distance between the first row of each estimated gate matrix and the vector $(1,0,\cdots 0)$.  The Frobenius distance between the estimate and the target gate set, weighted by $10^{-4}$, is added to the aforementioned sum of distances is to give the final objective function.  Ideally, a perfectly TP gate set will be found and the Frobenius distance term causes the optimization to choose the gate set closest to the target gates that is also in TP.  If a perfectly TP gate set cannot be gauge-optimized to, then the resulting gate set compromises between being TP and being close to the target gate set, with the intent that the TP penalty term dominates.

\begin{table}[h]
\begin{center}
\begin{tabular}[l]{|c|c|c|}
\hline
Operator & Matrix & Hilbert-Schmidt vector (Pauli basis) \\ \hline
$\rho_{0}$ & $ \left(\!\!\begin{array}{cc}
0.955 & 0.001e^{-i0.03} \\ 
0.001e^{i0.03} & 0.045
 \end{array}\!\!\right) $
 & $ \begin{array}{c}
0.707 \\ 
0.001 \\ 
4\e{-5} \\ 
0.643
 \end{array} $
 \\ \hline
$E_{0}$ & $ \left(\!\!\begin{array}{cc}
0.05 & 0.002e^{i1.58} \\ 
0.002e^{-i1.58} & 0.961
 \end{array}\!\!\right) $
 & $ \begin{array}{c}
0.715 \\ 
-1\e{-5} \\ 
-0.002 \\ 
-0.644
 \end{array} $
 \\ \hline
\end{tabular}

\caption{\textbf{The GST estimate of the SPAM operations}.  Compare to Table \ref{targetSpamTable}.\label{bestTPGatesetSpamTable}}
\end{center}
\end{table}

\begin{table}[h]
\begin{center}
\begin{tabular}[l]{|c|c|c|}
\hline
 & $E_{0}$ & $E_C$ \\ \hline
$\rho_{0}$ & 0.091 & 0.909 \\ \hline
\end{tabular}

\caption{\textbf{GST estimate of SPAM probabilities}.  Computed by taking the dot products of vectors in Table \ref{bestTPGatesetSpamTable}.\label{bestTPGatesetSpamParametersTable}}
\end{center}
\end{table}

\begin{table}[h]
\begin{center}
\begin{tabular}[l]{|c|c|}
\hline
Gate & Superoperator (Pauli basis) \\ \hline
Gi & $ \left(\!\!\begin{array}{cccc}
1 & 0 & 0 & 0 \\ 
-0.001 & 0.945 & -0.006 & -0.009 \\ 
4\e{-4} & 0.001 & 0.947 & 0.004 \\ 
0.002 & 2\e{-5} & 0.001 & 0.949
 \end{array}\!\!\right) $
 \\ \hline
Gx & $ \left(\!\!\begin{array}{cccc}
1 & 0 & 0 & 0 \\ 
4\e{-4} & 0.951 & -0.005 & -0.005 \\ 
0.01 & 4\e{-4} & 3\e{-4} & -0.949 \\ 
0.011 & 4\e{-4} & 0.949 & -0.002
 \end{array}\!\!\right) $
 \\ \hline
Gy & $ \left(\!\!\begin{array}{cccc}
1 & 0 & 0 & 0 \\ 
-0.01 & 2\e{-4} & -0.005 & 0.949 \\ 
3\e{-4} & 0.001 & 0.951 & 0.001 \\ 
0.01 & -0.949 & -0.006 & -0.001
 \end{array}\!\!\right) $
 \\ \hline
\end{tabular}

\caption{\textbf{The GST estimate of the logic gate operations}.  Compare to Table \ref{targetGatesTable}.\label{bestTPGatesetGatesTable}}
\end{center}
\end{table}

\begin{table}[h]
\begin{center}
\begin{tabular}[l]{|c|c|c|c|}
\hline
Gate & \begin{tabular}{c}Process\\Infidelity\end{tabular} & \begin{tabular}{c}$\nicefrac{1}{2}$ Trace\\Distance\end{tabular} & $\nicefrac{1}{2}$ $\Diamond$-Norm \\ \hline
Gi & 0.04 & 0.04 & 0.04 \\ \hline
Gx & 0.038 & 0.038 & 0.039 \\ \hline
Gy & 0.038 & 0.038 & 0.039 \\ \hline
\end{tabular}

\vspace{2em}
\begin{tabular}[l]{|c|c|}
\hline
Gate & Error Generator \\ \hline
Gi & $ \left(\!\!\begin{array}{cccc}
0 & 0 & 0 & 0 \\ 
-0.001 & -0.057 & -0.007 & -0.009 \\ 
4\e{-4} & 0.001 & -0.054 & 0.004 \\ 
0.002 & 2\e{-5} & 0.001 & -0.053
 \end{array}\!\!\right) $
 \\ \hline
Gx & $ \left(\!\!\begin{array}{cccc}
0 & 0 & 0 & 0 \\ 
4\e{-4} & -0.051 & 7\e{-5} & -0.008 \\ 
0.017 & 0.001 & -0.05 & -0.001 \\ 
0.001 & 6\e{-6} & 0.001 & -0.055
 \end{array}\!\!\right) $
 \\ \hline
Gy & $ \left(\!\!\begin{array}{cccc}
0 & 0 & 0 & 0 \\ 
-0.016 & -0.052 & 0.001 & -5\e{-5} \\ 
3\e{-4} & 0.002 & -0.05 & 6\e{-5} \\ 
-9\e{-5} & -5\e{-4} & -0.008 & -0.053
 \end{array}\!\!\right) $
 \\ \hline
\end{tabular}

\caption{\textbf{Comparison of GST estimated gates to target gates}.  This table presents, for each of the gates, three different measures of distance or discrepancy from the GST estimate to the ideal target operation.  See text for more detail.  The column labeled ``Error Generator'' gives the Lindbladian $\mathbb{L}$ that describes \emph{how} the gate is failing to match the target.  This error generator is defined by the equation $\hat{G} = G_{\mathrm{target}}e^{\mathbb{L}}$. \label{bestTPGatesetVsTargetTable}}
\end{center}
\end{table}

\begin{table}[h]
\begin{center}
\begin{tabular}[l]{|c|c|c|c|c|c|}
\hline
Gate & Eigenvalues & Fixed pt & Rotn. axis & Diag. decay & Off-diag. decay \\ \hline
Gi & $ \begin{array}{c}
0.949 \\ 
0.946e^{i0.00} \\ 
0.946e^{-i0.00} \\ 
1
 \end{array} $
 & $ \begin{array}{c}
0.998 \\ 
-0.023 \\ 
0.009 \\ 
0.031
 \end{array} $
 & $ \begin{array}{c}
0 \\ 
0.933 \\ 
-0.151 \\ 
-0.326
 \end{array} $
 & 0.051 & 0.054 \\ \hline
Gx & $ \begin{array}{c}
0.949e^{i1.57} \\ 
0.949e^{-i1.57} \\ 
0.951 \\ 
1
 \end{array} $
 & $ \begin{array}{c}
1 \\ 
0.006 \\ 
-2\e{-5} \\ 
0.011
 \end{array} $
 & $ \begin{array}{c}
0 \\ 
-1 \\ 
3\e{-6} \\ 
-5\e{-4}
 \end{array} $
 & 0.049 & 0.051 \\ \hline
Gy & $ \begin{array}{c}
0.949e^{i1.57} \\ 
0.949e^{-i1.57} \\ 
0.951 \\ 
1
 \end{array} $
 & $ \begin{array}{c}
1 \\ 
-4\e{-4} \\ 
0.006 \\ 
0.01
 \end{array} $
 & $ \begin{array}{c}
0 \\ 
-0.005 \\ 
1 \\ 
-0.001
 \end{array} $
 & 0.049 & 0.051 \\ \hline
\end{tabular}

\vspace{2em}
\begin{tabular}[l]{|c|c|c|c|c|}
\hline
\multirow{2}{*}{Gate} & \multirow{2}{*}{Angle} & \multicolumn{3}{c|}{Angle between Rotation Axes} \\ \cline{3-5}
 & & Gi & Gx & Gy \\ \hline
Gi & 0.001$\pi$ &  & 0.883$\pi$ & 0.55$\pi$ \\ \hline
Gx & 0.5$\pi$ & 0.883$\pi$ &  & 0.498$\pi$ \\ \hline
Gy & 0.5$\pi$ & 0.55$\pi$ & 0.498$\pi$ &  \\ \hline
\end{tabular}

\caption{\textbf{Eigen-decomposition of estimated gates}.  Each estimated gate is described in terms of: (1) the eigenvalues of the superoperator; (2) the gate's fixed point (as a vector in $\mathcal{B}(\mathcal{H})$, in the Pauli basis); (3)  the axis around which it rotates, as a vector in $\mathcal{B}(\mathcal{H})$; (4) the angle of the rotation that it applies; (5) the decay rate along the axis of rotation (``diagonal decay''); and (6) the decay rate perpendicular to the axis of rotation (``off-diagonal decay'').  ``--'' indicates that the decomposition failed or couldn't be interpreted. \label{bestTPGatesetDecompTable}}
\end{center}
\end{table}


\begin{table}[h]
\begin{center}
\begin{tabular}[l]{|c|c|c|c|c|c|}
\hline
Gate & \begin{tabular}{c}Process\\Infidelity\end{tabular} & \begin{tabular}{c}$\nicefrac{1}{2}$ Trace\\Distance\end{tabular} & \begin{tabular}{c}Rotation\\Axis\end{tabular} & \begin{tabular}{c}Rotation\\Angle\end{tabular} & Sanity \checkmark \\ \hline
Gi & 0.04 & 0.04 & $ \begin{array}{c}
0 \\ 
-0.262 \\ 
-0.741 \\ 
0.618
 \end{array} $
 & 0.002$\pi$ & 6\e{-6} \\ \hline
Gx & 0.038 & 0.038 & $ \begin{array}{c}
0 \\ 
1 \\ 
-0.003 \\ 
2\e{-4}
 \end{array} $
 & 0.5$\pi$ & 4\e{-4} \\ \hline
Gy & 0.038 & 0.038 & $ \begin{array}{c}
0 \\ 
0.003 \\ 
-1 \\ 
-5\e{-4}
 \end{array} $
 & 0.5$\pi$ & 4\e{-4} \\ \hline
\end{tabular}

\caption{Information pertaining to the closest unitary gate to each of the estimated gates.\label{bestTPGatesetClosestUnitaryTable}}
\end{center}
\end{table}


\begin{table}[h]
\begin{center}
\begin{tabular}[l]{|c|c|c|}
\hline
Gate & Choi matrix (Pauli basis) & Eigenvalues \\ \hline
Gi & $ \left(\!\!\begin{array}{cccc}
0.96 & 0.001e^{-i1.86} & 0.002e^{-i1.53} & 0.002e^{i1.36} \\ 
0.001e^{i1.86} & 0.012 & 0.001e^{-i2.84} & 0.002e^{i3.10} \\ 
0.002e^{i1.53} & 0.001e^{i2.84} & 0.013 & 0.001e^{i0.20} \\ 
0.002e^{-i1.36} & 0.002e^{-i3.10} & 0.001e^{-i0.20} & 0.014
 \end{array}\!\!\right) $
 & $ \begin{array}{c}
0.011 \\ 
0.013 \\ 
0.017 \\ 
0.96
 \end{array} $
 \\ \hline
Gx & $ \left(\!\!\begin{array}{cccc}
0.487 & 0.475e^{i1.57} & 0.003e^{-i0.50} & 0.003e^{i0.47} \\ 
0.475e^{-i1.57} & 0.488 & 0.003e^{-i1.98} & 0.003e^{i2.01} \\ 
0.003e^{i0.50} & 0.003e^{i1.98} & 0.013 & 9\e{-5}e^{-i1.56} \\ 
0.003e^{-i0.47} & 0.003e^{-i2.01} & 9\e{-5}e^{i1.56} & 0.012
 \end{array}\!\!\right) $
 & $ \begin{array}{c}
0.008 \\ 
0.013 \\ 
0.017 \\ 
0.962
 \end{array} $
 \\ \hline
Gy & $ \left(\!\!\begin{array}{cccc}
0.488 & 0.003e^{-i2.53} & 0.474e^{i1.57} & 0.003e^{i0.54} \\ 
0.003e^{i2.53} & 0.012 & 0.003e^{-i1.88} & 1\e{-4}e^{i2.41} \\ 
0.474e^{-i1.57} & 0.003e^{i1.88} & 0.488 & 0.003e^{i1.96} \\ 
0.003e^{-i0.54} & 1\e{-4}e^{-i2.41} & 0.003e^{-i1.96} & 0.012
 \end{array}\!\!\right) $
 & $ \begin{array}{c}
0.009 \\ 
0.012 \\ 
0.017 \\ 
0.962
 \end{array} $
 \\ \hline
\end{tabular}

\caption{\textbf{Choi matrix representation of the GST estimated gate set}.  This table lists Choi representations of the estimated gates, and their eigenvalues.  Unitary gates have a spectrum $(1,0,0\ldots)$, just like pure quantum states.  Negative eigenvalues are non-physical, and may represent either statistical fluctuations or violations of the CPTP model used by GST.\label{bestTPGatesetChoiTable}}
\end{center}
\end{table}

\clearpage

\subsection{Gauge optimization to CPTP}
The gauge is chosen to minimize a quantity indicating the ``non-CPTP-ness'' of the gate set, along with a slight preference for being close to the target gate set.  In particular, we first optimize the gate set to TP (as described above), and then minimize the logarithm of a CP ``penalty term'' which we take as the sum of
\begin{enumerate}
\item the absolute values of any negative eigenvalues possessed by a gate's Choi matrix
\item the absolute value of any negative eigenvalues of a state preparation density matrix
\item the absolute difference between the trace of a state preparation density matrix and one
\item the distance between an eigenvalue of an effect operator and the interval $[0,1]$.
\end{enumerate}
within the space of TP-preserving gauge transformations.  This CP penalty term is added to the Frobenius distance between the estimate and the target gate set, weighted by $10^{-4}$ to give the final objective function.

\begin{table}[h]
\begin{center}
\begin{tabular}[l]{|c|c|c|}
\hline
Operator & Matrix & Hilbert-Schmidt vector (Pauli basis) \\ \hline
$\rho_{0}$ & $ \left(\!\!\begin{array}{cc}
0.955 & 0.001e^{-i0.03} \\ 
0.001e^{i0.03} & 0.045
 \end{array}\!\!\right) $
 & $ \begin{array}{c}
0.707 \\ 
0.001 \\ 
4\e{-5} \\ 
0.643
 \end{array} $
 \\ \hline
$E_{0}$ & $ \left(\!\!\begin{array}{cc}
0.05 & 0.002e^{i1.58} \\ 
0.002e^{-i1.58} & 0.961
 \end{array}\!\!\right) $
 & $ \begin{array}{c}
0.715 \\ 
-1\e{-5} \\ 
-0.002 \\ 
-0.644
 \end{array} $
 \\ \hline
\end{tabular}

\caption{\textbf{The GST estimate of the SPAM operations}.  Compare to Table \ref{targetSpamTable}.\label{bestCPTPGatesetSpamTable}}
\end{center}
\end{table}

\begin{table}[h]
\begin{center}
\begin{tabular}[l]{|c|c|c|}
\hline
 & $E_{0}$ & $E_C$ \\ \hline
$\rho_{0}$ & 0.091 & 0.909 \\ \hline
\end{tabular}

\caption{\textbf{GST estimate of SPAM probabilities}.  Computed by taking the dot products of vectors in Table \ref{bestCPTPGatesetSpamTable}.\label{bestCPTPGatesetSpamParametersTable}}
\end{center}
\end{table}

\begin{table}[h]
\begin{center}
\begin{tabular}[l]{|c|c|}
\hline
Gate & Superoperator (Pauli basis) \\ \hline
Gi & $ \left(\!\!\begin{array}{cccc}
1 & 0 & 0 & 0 \\ 
-0.001 & 0.945 & -0.006 & -0.009 \\ 
4\e{-4} & 0.001 & 0.947 & 0.004 \\ 
0.002 & 2\e{-5} & 0.001 & 0.949
 \end{array}\!\!\right) $
 \\ \hline
Gx & $ \left(\!\!\begin{array}{cccc}
1 & 0 & 0 & 0 \\ 
4\e{-4} & 0.951 & -0.005 & -0.005 \\ 
0.01 & 4\e{-4} & 3\e{-4} & -0.949 \\ 
0.011 & 4\e{-4} & 0.949 & -0.002
 \end{array}\!\!\right) $
 \\ \hline
Gy & $ \left(\!\!\begin{array}{cccc}
1 & 0 & 0 & 0 \\ 
-0.01 & 2\e{-4} & -0.005 & 0.949 \\ 
3\e{-4} & 0.001 & 0.951 & 0.001 \\ 
0.01 & -0.949 & -0.006 & -0.001
 \end{array}\!\!\right) $
 \\ \hline
\end{tabular}

\caption{\textbf{The GST estimate of the logic gate operations}.  Compare to Table \ref{targetGatesTable}.\label{bestCPTPGatesetGatesTable}}
\end{center}
\end{table}

\begin{table}[h]
\begin{center}
\begin{tabular}[l]{|c|c|c|c|}
\hline
Gate & \begin{tabular}{c}Process\\Infidelity\end{tabular} & \begin{tabular}{c}$\nicefrac{1}{2}$ Trace\\Distance\end{tabular} & $\nicefrac{1}{2}$ $\Diamond$-Norm \\ \hline
Gi & 0.04 & 0.04 & 0.04 \\ \hline
Gx & 0.038 & 0.038 & 0.039 \\ \hline
Gy & 0.038 & 0.038 & 0.039 \\ \hline
\end{tabular}

\vspace{2em}
\begin{tabular}[l]{|c|c|}
\hline
Gate & Error Generator \\ \hline
Gi & $ \left(\!\!\begin{array}{cccc}
0 & 0 & 0 & 0 \\ 
-0.001 & -0.057 & -0.007 & -0.009 \\ 
4\e{-4} & 0.001 & -0.054 & 0.004 \\ 
0.002 & 2\e{-5} & 0.001 & -0.053
 \end{array}\!\!\right) $
 \\ \hline
Gx & $ \left(\!\!\begin{array}{cccc}
0 & 0 & 0 & 0 \\ 
4\e{-4} & -0.051 & 7\e{-5} & -0.008 \\ 
0.017 & 0.001 & -0.05 & -0.001 \\ 
0.001 & 6\e{-6} & 0.001 & -0.055
 \end{array}\!\!\right) $
 \\ \hline
Gy & $ \left(\!\!\begin{array}{cccc}
0 & 0 & 0 & 0 \\ 
-0.016 & -0.052 & 0.001 & -5\e{-5} \\ 
3\e{-4} & 0.002 & -0.05 & 6\e{-5} \\ 
-9\e{-5} & -5\e{-4} & -0.008 & -0.053
 \end{array}\!\!\right) $
 \\ \hline
\end{tabular}

\caption{\textbf{Comparison of GST estimated gates to target gates}.  This table presents, for each of the gates, three different measures of distance or discrepancy from the GST estimate to the ideal target operation.  See text for more detail.  The column labeled ``Error Generator'' gives the Lindbladian $\mathbb{L}$ that describes \emph{how} the gate is failing to match the target.  This error generator is defined by the equation $\hat{G} = G_{\mathrm{target}}e^{\mathbb{L}}$. \label{bestCPTPGatesetVsTargetTable}}
\end{center}
\end{table}

\begin{table}[h]
\begin{center}
\begin{tabular}[l]{|c|c|c|c|c|c|}
\hline
Gate & Eigenvalues & Fixed pt & Rotn. axis & Diag. decay & Off-diag. decay \\ \hline
Gi & $ \begin{array}{c}
0.949 \\ 
0.946e^{i0.00} \\ 
0.946e^{-i0.00} \\ 
1
 \end{array} $
 & $ \begin{array}{c}
0.998 \\ 
-0.023 \\ 
0.009 \\ 
0.031
 \end{array} $
 & $ \begin{array}{c}
0 \\ 
0.933 \\ 
-0.151 \\ 
-0.326
 \end{array} $
 & 0.051 & 0.054 \\ \hline
Gx & $ \begin{array}{c}
0.949e^{i1.57} \\ 
0.949e^{-i1.57} \\ 
0.951 \\ 
1
 \end{array} $
 & $ \begin{array}{c}
1 \\ 
0.006 \\ 
-2\e{-5} \\ 
0.011
 \end{array} $
 & $ \begin{array}{c}
0 \\ 
-1 \\ 
3\e{-6} \\ 
-5\e{-4}
 \end{array} $
 & 0.049 & 0.051 \\ \hline
Gy & $ \begin{array}{c}
0.949e^{i1.57} \\ 
0.949e^{-i1.57} \\ 
0.951 \\ 
1
 \end{array} $
 & $ \begin{array}{c}
1 \\ 
-4\e{-4} \\ 
0.006 \\ 
0.01
 \end{array} $
 & $ \begin{array}{c}
0 \\ 
-0.005 \\ 
1 \\ 
-0.001
 \end{array} $
 & 0.049 & 0.051 \\ \hline
\end{tabular}

\vspace{2em}
\begin{tabular}[l]{|c|c|c|c|c|}
\hline
\multirow{2}{*}{Gate} & \multirow{2}{*}{Angle} & \multicolumn{3}{c|}{Angle between Rotation Axes} \\ \cline{3-5}
 & & Gi & Gx & Gy \\ \hline
Gi & 0.001$\pi$ &  & 0.883$\pi$ & 0.55$\pi$ \\ \hline
Gx & 0.5$\pi$ & 0.883$\pi$ &  & 0.498$\pi$ \\ \hline
Gy & 0.5$\pi$ & 0.55$\pi$ & 0.498$\pi$ &  \\ \hline
\end{tabular}

\caption{\textbf{Eigen-decomposition of estimated gates}.  Each estimated gate is described in terms of: (1) the eigenvalues of the superoperator; (2) the gate's fixed point (as a vector in $\mathcal{B}(\mathcal{H})$, in the Pauli basis); (3)  the axis around which it rotates, as a vector in $\mathcal{B}(\mathcal{H})$; (4) the angle of the rotation that it applies; (5) the decay rate along the axis of rotation (``diagonal decay''); and (6) the decay rate perpendicular to the axis of rotation (``off-diagonal decay'').  ``--'' indicates that the decomposition failed or couldn't be interpreted. \label{bestCPTPGatesetDecompTable}}
\end{center}
\end{table}


\begin{table}[h]
\begin{center}
\begin{tabular}[l]{|c|c|c|c|c|c|}
\hline
Gate & \begin{tabular}{c}Process\\Infidelity\end{tabular} & \begin{tabular}{c}$\nicefrac{1}{2}$ Trace\\Distance\end{tabular} & \begin{tabular}{c}Rotation\\Axis\end{tabular} & \begin{tabular}{c}Rotation\\Angle\end{tabular} & Sanity \checkmark \\ \hline
Gi & 0.04 & 0.04 & $ \begin{array}{c}
0 \\ 
-0.262 \\ 
-0.741 \\ 
0.618
 \end{array} $
 & 0.002$\pi$ & 6\e{-6} \\ \hline
Gx & 0.038 & 0.038 & $ \begin{array}{c}
0 \\ 
-1 \\ 
0.003 \\ 
-2\e{-4}
 \end{array} $
 & 0.5$\pi$ & 4\e{-4} \\ \hline
Gy & 0.038 & 0.038 & $ \begin{array}{c}
0 \\ 
0.003 \\ 
-1 \\ 
-5\e{-4}
 \end{array} $
 & 0.5$\pi$ & 4\e{-4} \\ \hline
\end{tabular}

\caption{Information pertaining to the closest unitary gate to each of the estimated gates.\label{bestCPTPGatesetClosestUnitaryTable}}
\end{center}
\end{table}


\begin{table}[h]
\begin{center}
\begin{tabular}[l]{|c|c|c|}
\hline
Gate & Choi matrix (Pauli basis) & Eigenvalues \\ \hline
Gi & $ \left(\!\!\begin{array}{cccc}
0.96 & 0.001e^{-i1.86} & 0.002e^{-i1.53} & 0.002e^{i1.36} \\ 
0.001e^{i1.86} & 0.012 & 0.001e^{-i2.84} & 0.002e^{i3.10} \\ 
0.002e^{i1.53} & 0.001e^{i2.84} & 0.013 & 0.001e^{i0.20} \\ 
0.002e^{-i1.36} & 0.002e^{-i3.10} & 0.001e^{-i0.20} & 0.014
 \end{array}\!\!\right) $
 & $ \begin{array}{c}
0.011 \\ 
0.013 \\ 
0.017 \\ 
0.96
 \end{array} $
 \\ \hline
Gx & $ \left(\!\!\begin{array}{cccc}
0.487 & 0.475e^{i1.57} & 0.003e^{-i0.50} & 0.003e^{i0.47} \\ 
0.475e^{-i1.57} & 0.488 & 0.003e^{-i1.98} & 0.003e^{i2.01} \\ 
0.003e^{i0.50} & 0.003e^{i1.98} & 0.013 & 9\e{-5}e^{-i1.56} \\ 
0.003e^{-i0.47} & 0.003e^{-i2.01} & 9\e{-5}e^{i1.56} & 0.012
 \end{array}\!\!\right) $
 & $ \begin{array}{c}
0.008 \\ 
0.013 \\ 
0.017 \\ 
0.962
 \end{array} $
 \\ \hline
Gy & $ \left(\!\!\begin{array}{cccc}
0.488 & 0.003e^{-i2.53} & 0.474e^{i1.57} & 0.003e^{i0.54} \\ 
0.003e^{i2.53} & 0.012 & 0.003e^{-i1.88} & 1\e{-4}e^{i2.41} \\ 
0.474e^{-i1.57} & 0.003e^{i1.88} & 0.488 & 0.003e^{i1.96} \\ 
0.003e^{-i0.54} & 1\e{-4}e^{-i2.41} & 0.003e^{-i1.96} & 0.012
 \end{array}\!\!\right) $
 & $ \begin{array}{c}
0.009 \\ 
0.012 \\ 
0.017 \\ 
0.962
 \end{array} $
 \\ \hline
\end{tabular}

\caption{\textbf{Choi matrix representation of the GST estimated gate set}.  This table lists Choi representations of the estimated gates, and their eigenvalues.  Unitary gates have a spectrum $(1,0,0\ldots)$, just like pure quantum states.  Negative eigenvalues are non-physical, and may represent either statistical fluctuations or violations of the CPTP model used by GST.\label{bestCPTPGatesetChoiTable}}
\end{center}
\end{table}

\clearpage
}{}

\iftoggle{pixelplotsappendix}{
\section{Pixel plots for intermediate gate sets\label{appendix_logL_pixelplots}}

This appendix contains $2\Delta\log(\mathcal{L})$ pixel-plots for the intermediate estimates computed by GST on dataset ``$\mathcal{D}$'' using a subset of the available data.  Each estimate was computed using only base sequences of length up to $L$, for $L=1,2,4,8,\ldots$.  These plots are \emph{not} identical to subsets of Figure \ref{bestEstimateColorBoxPlot}, because the estimated gate set is different.  Since these estimates only attempt to fit a subset of the data, they generally do much better at fitting that subset.  (They do very badly, in general, at predicting longer sequences; for this reason the $2\Delta\log(\mathcal{L})$ values of those out-of-sample sequences are not shown).  See main text and caption of Figure \ref{bestEstimateColorBoxPlot} for more details.


\begin{figure}
\begin{center}
\includegraphics[width=2.60in,height=2.91in,keepaspectratio]{full_reportDv3_files/L1_LogLBoxes.pdf}
\caption{Box plot of iteration 1 (L=1) gateset $\log(\mathcal{L})$ values.\label{L1GatesetLogLBoxPlot}}
\end{center}
\end{figure}

\begin{figure}
\begin{center}
\includegraphics[width=3.90in,height=2.91in,keepaspectratio]{full_reportDv3_files/L2_LogLBoxes.pdf}
\caption{Box plot of iteration 2 (L=2) gateset $\log(\mathcal{L})$ values.\label{L2GatesetLogLBoxPlot}}
\end{center}
\end{figure}

\begin{figure}
\begin{center}
\includegraphics[width=5.20in,height=7.27in,keepaspectratio]{full_reportDv3_files/L3_LogLBoxes.pdf}
\caption{Box plot of iteration 3 (L=4) gateset $\log(\mathcal{L})$ values.\label{L3GatesetLogLBoxPlot}}
\end{center}
\end{figure}

}{}

\iftoggle{whackamoleappendix}{
\section{Whack-a-mole plots for select gate sequences\label{appendix_whack_a_mole}}

This appendix shows whimsically named ``Whack-a-mole'' plots.  The point of these plots is to answer the question ``Why is GST failing to fit the data in the block corresponding to base sequence XXX?''  This question usually comes up after examining Figure \ref{bestEstimateColorBoxPlot} and identifying a particularly bad block.  Usually, the answer is ``Because GST was also trying to fit other data, in block YYY.''  It's often useful to know specifically \emph{which} experiments are the stumbling block -- i.e., which experiments would be even more badly fit by the estimate \emph{if} we demanded that the data in base sequence XXX be fit better.

This question can be answered by examining the derivatives of $2\Delta\log(\mathcal{L})$ with respect to  the gate set, evaluated at the stationary point (local minimum) corresponding to the GST estimate.  By doing so, it is possible to simulate what would happen if, by demanding a better fit to the data in block XXX, we attempted to ``whack'' the large $2\Delta\log(\mathcal{L})$ values in block XXX.  Unsurprisingly, whacking the XXX mole causes another one to pop up somewhere else (the GST fit is a local minimum of $2\Delta\log(\mathcal{L})$, and hopefully a global one too, so there is no way to improve $2\Delta\log(\mathcal{L})$).  Where this occurs can provide some insight into what is stopping GST from fitting the data better (and therefore into what's wrong with the gates).

In the Whack-a-mole plots shown below, each of the longest base sequences is independently ``whacked'' -- i.e., the analysis attempts to reduce the $2\Delta\log(\mathcal{L})$ for that particular base sequence.  The plots answer the question, ``If the $2\Delta\log(\mathcal{L})$ contribution for this base sequence was forced downward by 10 units, how much would the $2\Delta\log(\mathcal{L})$ contributions for other experiments have to rise?''  Thus, the number on the ``whacked'' block is always $-10$.  Blocks with negative values in this analysis are correlated tightly with the whacked block (improving the fit on the whacked block improves their fit as well).  Blocks with large positive values are incompatible with the whacked block (improving the fit on the whacked block makes the fit on such a block worse).  These plots can thus be used to identify inconsistencies in the data.


\begin{figure}
\begin{center}
\includegraphics[width=6.50in,height=8.00in,keepaspectratio]{full_reportDv3_files/whackGxMoleBoxes.pdf}
\caption{Whack-a-$\log(\mathcal{L})$-mole box plot for $\mathrm{Gx}^{8}$.  Hitting with hammer of weight 10.0.\label{WhackGxMoleBoxPlot}}
\end{center}
\end{figure}

\begin{figure}
\begin{center}
\includegraphics[width=6.50in,height=8.00in,keepaspectratio]{full_reportDv3_files/whackGyMoleBoxes.pdf}
\caption{Whack-a-$\log(\mathcal{L})$-mole box plot for $\mathrm{Gy}^{8}$.  Hitting with hammer of weight 10.0.\label{WhackGyMoleBoxPlot}}
\end{center}
\end{figure}

\begin{figure}
\begin{center}
\includegraphics[width=6.50in,height=8.00in,keepaspectratio]{full_reportDv3_files/whackGiMoleBoxes.pdf}
\caption{Whack-a-$\log(\mathcal{L})$-mole box plot for $\mathrm{Gi}^{8}$.  Hitting with hammer of weight 10.0.\label{WhackGiMoleBoxPlot}}
\end{center}
\end{figure}

\begin{figure}
\begin{center}
\includegraphics[width=4in,height=5in,keepaspectratio]{full_reportDv3_files/whackGxMoleBoxesSummed.pdf}
\caption{Whack-a-$\log(\mathcal{L})$-mole box plot for $\mathrm{Gx}^{8}$, summed over fiducial matrix.  Hitting with hammer of weight 10.0.\label{WhackGxMoleBoxPlotSummed}}
\end{center}
\end{figure}

\begin{figure}
\begin{center}
\includegraphics[width=4in,height=5in,keepaspectratio]{full_reportDv3_files/whackGyMoleBoxesSummed.pdf}
\caption{Whack-a-$\log(\mathcal{L})$-mole box plot for $\mathrm{Gy}^{8}$, summed over fiducial matrix.  Hitting with hammer of weight 10.0.\label{WhackGyMoleBoxPlotSummed}}
\end{center}
\end{figure}

\begin{figure}
\begin{center}
\includegraphics[width=4in,height=5in,keepaspectratio]{full_reportDv3_files/whackGiMoleBoxesSummed.pdf}
\caption{Whack-a-$\log(\mathcal{L})$-mole box plot for $\mathrm{Gi}^{8}$, summed over fiducial matrix.  Hitting with hammer of weight 10.0.\label{WhackGiMoleBoxPlotSummed}}
\end{center}
\end{figure}

}{}