



@article {1515,
	title = {Demonstration of Robust Quantum Gate Tomography via Randomized  Benchmarking},
	journal = {New Journal of Physics},
	volume = {17},
	year = {2015},
	month = {2015/11/05},
	pages = {113019},
	abstract = {  Typical quantum gate tomography protocols struggle with a self-consistency
problem: the gate operation cannot be reconstructed without knowledge of the
initial state and final measurement, but such knowledge cannot be obtained
without well-characterized gates. A recently proposed technique, known as
randomized benchmarking tomography (RBT), sidesteps this self-consistency
problem by designing experiments to be insensitive to preparation and
measurement imperfections. We implement this proposal in a superconducting
qubit system, using a number of experimental improvements including
implementing each of the elements of the Clifford group in single {\textquoteleft}atomic{\textquoteright}
pulses and custom control hardware to enable large overhead protocols. We show
a robust reconstruction of several single-qubit quantum gates, including a
unitary outside the Clifford group. We demonstrate that RBT yields physical
gate reconstructions that are consistent with fidelities obtained by randomized
benchmarking.
},
	doi = {10.1088/1367-2630/17/11/113019},
	url = {http://arxiv.org/abs/1505.06686},
	author = {Blake R. Johnson and Marcus P. da Silva and Colm A. Ryan and Shelby Kimmel and Jerry M. Chow and Thomas A. Ohki}
}
@article {1514,
	title = {Robust Extraction of Tomographic Information via Randomized Benchmarking},
	journal = {Physical Review X},
	volume = {4},
	year = {2014},
	month = {2014/3/25},
	abstract = {  We describe how randomized benchmarking can be used to reconstruct the unital
part of any trace-preserving quantum map, which in turn is sufficient for the
full characterization of any unitary evolution, or more generally, any unital
trace-preserving evolution. This approach inherits randomized benchmarking{\textquoteright}s
robustness to preparation and measurement imperfections, therefore avoiding
systematic errors caused by these imperfections. We also extend these
techniques to efficiently estimate the average fidelity of a quantum map to
unitary maps outside of the Clifford group. The unitaries we consider include
operations commonly used to achieve universal quantum computation in a
fault-tolerant setting. In addition, we rigorously bound the time and sampling
complexities of randomized benchmarking procedures.
},
	doi = {10.1103/PhysRevX.4.011050},
	url = {http://arxiv.org/abs/1306.2348v1},
	author = {Shelby Kimmel and Marcus P. da Silva and Colm A. Ryan and Blake R. Johnson and Thomas Ohki}
}
