Built on

S. Zhang, Y. Lu, K. Zhang, W. Chen, Y. Li, J.-N. Zhang, and K. Kim, Error-mitigated quantum gates exceeding physical fidelities in a trapped-ion system , Nature Communications 11
Original
1905
Earlier work this paper cites.
S. T. Flammia and J. J. Wallman, Efficient estimation of Pauli channels , ACM Transactions on Quantum Computing 1
Original
1907
Earlier work this paper cites.
J. Eisert, D. Hangleiter, N. Walk, I. Roth, D. Markham, R. Parekh, U. Chabaud, and E. Kashefi, Quantum certification and benchmarking , Nature Reviews Physics 2
Original
1910
Earlier work this paper cites.
E. Nielsen, K. Rudinger, T. Proctor, A. Russo, K. Young, and R. Blume-Kohout, Probing quantum processor performance with pyGSTi , Quantum Sci. Technol. 5
Original
2002
Earlier work this paper cites.
J. Emerson, R. Alicki, and K. Życzkowski, Scalable noise estimation with random unitary operators , J. Opt. B 7
2005
Earlier work this paper cites.
E. Knill, Quantum computing with realistically noisy devices , Nature (London) 434
2005
Earlier work this paper cites.
P. Aliferis, D. Gottesman, and J. Preskill, Quantum accuracy threshold for concatenated distance-3 codes , Quant. Inf. Comput. 6
2006
Earlier work this paper cites.
E. Knill, D. Leibfried, R. Reichle, J. Britton, R. B. Blakestad, J. D. Jost, C. Langer, R. Ozeri, S. Seidelin, and D. J. Wineland, Randomized benchmarking of quantum gates , Phys. Rev. A 77
Original
2008
Earlier work this paper cites.
E. Nielsen, J. K. Gamble, K. Rudinger, T. Scholten, K. Young, and R. Blume-Kohout, Gate set tomography , Quantum 5
Original
2009
Earlier work this paper cites.
A. W. Cross, D. P. DiVincenzo, and B. M. Terhal, A comparative code study for quantum fault-tolerance , Quant. Inf. Comp. 9
Original
2009
Earlier work this paper cites.
P. Aliferis and J. Preskill, Fibonacci scheme for fault-tolerant quantum computation , Phys. Rev. A 79
Original
2009
Earlier work this paper cites.
M. Kliesch and I. Roth, Theory of quantum system certification , PRX Quantum 2
Original
2010
Earlier work this paper cites.

Similar

J. Helsen, I. Roth, E. Onorati, A. H. Werner, and J. Eisert, A general framework for randomized benchmarking , arXiv:2010.07974 [quant-ph]
Original
2010
Cited alongside, same era.
A. Shabani, R. L. Kosut, M. Mohseni, H. Rabitz, M. A. Broome, M. P. Almeida, A. Fedrizzi, and A. G. White, Efficient measurement of quantum dynamics via compressive sensing , Phys. Rev. Lett. 106
Original
2011
Cited alongside, same era.
E. Magesan, J. M. Gambetta, and J. Emerson, Characterizing quantum gates via randomized benchmarking , Phys. Rev. A 85
Original
2012
Cited alongside, same era.
S. T. Flammia, D. Gross, Y.-K. Liu, and J. Eisert, Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators , New J. Phys. 14
Original
2012
Cited alongside, same era.

Then

J. P. Dehollain, J. T. Muhonen, R. Blume-Kohout, K. M. Rudinger, J. K. Gamble, E. Nielsen, A. Laucht, S. Simmons, R. Kalra, A. S. Dzurak, et al. , Optimization of a solid-state electron spin qubit using gate set tomography , New Journal of Physics 18
2016
Later among the works it cites.
R. Kueng, D. M. Long, A. C. Doherty, and S. T. Flammia, Comparing experiments to the fault-tolerance threshold , Phys. Rev. Lett. 117
Original
2016
Later among the works it cites.
Y. R. Sanders, J. J. Wallman, and B. C. Sanders, Bounding quantum gate error rate based on reported average fidelity , New J. Phys. 18
Original
2016
Later among the works it cites.
M. Kliesch, R. Kueng, J. Eisert, and D. Gross, Improving compressed sensing with the diamond norm , IEEE Trans. Inf. Th. 62
Original
2016
Later among the works it cites.

Beyond the bibliography

alphaXiv searches the wider corpus for related work and actual follow-ups.

Open on alphaXiv

alphaXiv is searching for related work…

Reading the bibliography…

2021

Compressive gate set tomography

Brieger, Raphael, Roth, Ingo, Kliesch, Martin

Understand

Flexible characterization techniques that identify and quantify experimental imperfections under realistic assumptions are crucial for the development of quantum computers.

Gate set tomography is a characterization approach that simultaneously and self-consistently extracts a tomographic description of the implementation of an entire set of quantum gates, as well as the initial state and measurement, from experimental data.
Obtaining such a detailed picture of the experimental implementation is associated with high requirements on the number of sequences and their design, making gate set tomography a challenging task even for only two qubits.
In this work, we show that low-rank approximations of gate sets can be obtained from significantly fewer gate sequences and that it is sufficient to draw them randomly.