Fetching the paper…
Reading the bibliography…
We propose a method to reliably and efficiently extract the fidelity of many-qubit quantum circuits composed of continuously parametrized two-qubit gates called matchgates.
Bounds for Kac’s master equation
Persi Diaconis and Laurent Saloff-Coste · 2000
Earlier work this paper cites.
Fermionic linear optics and matchgates
Emanuel Knill · 2001
Earlier work this paper cites.
Expressiveness of matchgates
Leslie G Valiant · 2002
Earlier work this paper cites.
Classical simulation of noninteracting-fermion quantum circuits
Barbara M Terhal and David P DiVincenzo · 2002
Earlier work this paper cites.
Natural two-qubit gate for quantum computation using the XY interaction
Norbert Schuch and Jens Siewert · 2003
Earlier work this paper cites.
Fermionic linear optics revisited
D. P. DiVincenzo and B. M. Terhal · 2005
Earlier work this paper cites.
Lagrangian representation for fermionic linear optics
Sergey Bravyi · 2005
Earlier work this paper cites.
Applications of minor summation formula III, Plücker relations, lattice paths and Pfaffian identities
Masao Ishikawa and Masato Wakayama · 2005
Earlier work this paper cites.
Randomized benchmarking of quantum gates
E. Knill, D. Leibfried, R. Reichle, J. Britton, R. B. Blakestad, J. D. Jost, C. Langer, R. Ozeri, S. Seidelin, and D. J. Wineland · 2008
Earlier work this paper cites.
Matchgates and classical simulation of quantum circuits
Richard Jozsa and Akimasa Miyake · 2008
Earlier work this paper cites.
Demonstration of two-qubit algorithms with a superconducting quantum processor
Leonardo DiCarlo, Jerry M Chow, Jay M Gambetta, Lev S Bishop, Blake R Johnson, DI Schuster, J Majer, Alexandre Blais, Luigi Frunzio, SM Girvin, et al · 2009
Earlier work this paper cites.
Symmetry, representations, and invariants , volume 255
Roe Goodman and Nolan R Wallach · 2009
Earlier work this paper cites.
Characterization of addressability by simultaneous randomized benchmarking
J. M. Gambetta, A. D. Córcoles, S. T. Merkel, B. R. Johnson, J. A. Smolin, J. M. Chow, C. A. Ryan, C. Rigetti, S. Poletto, T. A. Ohki, M. B. Ketchen, and M. Steffen · 2012
Earlier work this paper cites.
Representation theory: a first course , volume 129
William Fulton and Joe Harris · 2013
Cited alongside, same era.
Rolling quantum dice with a superconducting qubit
R. Barends, J. Kelly, A. Veitia, A. Megrant, A. G. Fowler, B. Campbell, Y. Chen, Z. Chen, B. Chiaro, A. Dunsworth, I.-C. Hoi, E. Jeffrey, C. Neill, P. J. J. O’Malley, J. Mutus, C. Quintana, P. Roushan, D. Sank, J. Wenner, T. C. White, A. N. Korotkov, A. N. Cleland, and John M. Martinis · 2014
Cited alongside, same era.
A quantum approximate optimization algorithm
Edward Farhi, Jeffrey Goldstone, and Sam Gutmann · 2014
Cited alongside, same era.
How to efficiently select an arbitrary Clifford group element
Robert Koenig and John A Smolin · 2014
Cited alongside, same era.
The computational power of matchgates and the XY interaction on arbitrary graphs
Daniel J Brod and Andrew M Childs · 2014
Cited alongside, same era.
Complexity of quantum impurity problems
Sergey Bravyi and David Gosset · 2017
Later among the works it cites.
Real randomized benchmarking
A. K. Hashagen, S. T. Flammia, D. Gross, and J. J. Wallman · 2018
Later among the works it cites.
A new class of efficient randomized benchmarking protocols
J. Helsen, X. Xue, L. M. K. Vandersypen, and S. Wehner · 2019
Later among the works it cites.
Benchmarking gate fidelities in a Si/SiGe two-qubit device
X Xue, TF Watson, J Helsen, Daniel R Ward, Donald E Savage, Max G Lagally, Susan N Coppersmith, MA Eriksson, S Wehner, and LMK Vandersypen · 2019
Later among the works it cites.
Characterizing large-scale quantum computers via cycle benchmarking
A. Erhard, J. J. Wallman, L. Postler, M. Meth, R. Stricker, E. A. Martinez, P. Schindler, T. Monz, J. Emerson, and R. Blatt · 2019
Later among the works it cites.
Quantum supremacy using a programmable superconducting processor
Frank Arute, Kunal Arya, Ryan Babbush, Dave Bacon, Joseph C Bardin, Rami Barends, Rupak Biswas, Sergio Boixo, Fernando GSL Brandao, David A Buell, et al · 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Characterizing universal gate sets via dihedral benchmarking
A. Carignan-Dugas, J. J. Wallman, and J. Emerson · 2015
Cited alongside, same era.
Robust characterization of loss rates
J. J. Wallman, M. Barnhill, and J. Emerson · 2015
Cited alongside, same era.
Jordan-Wigner formalism for arbitrary 2-input 2-output matchgates and their classical simulation
Richard Jozsa, Akimasa Miyake, and Sergii Strelchuk · 2015
Cited alongside, same era.
Scalable randomised benchmarking of non-Clifford gates
A. W. Cross, E. Magesan, L. S. Bishop, J. A. Smolin, and J. M. Gambetta · 2016
Cited alongside, same era.
The theory of variational hybrid quantum-classical algorithms
Jarrod R McClean, Jonathan Romero, Ryan Babbush, and Alán Aspuru-Guzik · 2016
Cited alongside, same era.
Procedure for systematically tuning up cross-talk in the cross-resonance gate
Sarah Sheldon, Easwar Magesan, Jerry M Chow, and Jay M Gambetta · 2016
Cited alongside, same era.
Efficient Z gates for quantum computing
David C McKay, Christopher J Wood, Sarah Sheldon, Jerry M Chow, and Jay M Gambetta · 2017
Cited alongside, same era.
Later among the works it cites.
A general framework for randomized benchmarking
Jonas Helsen, Ingo Roth, Emilio Onorati, Albert Werner, and Jens Eisert · 2020
Closest in time.
Implementation of XY entangling gates with a single calibrated pulse
Deanna M. Abrams, Nicolas Didier, Blake R. Johnson, Marcus P. da Silva, and Colm A. Ryan · 2020
Closest in time.
Effective Hamiltonian models of the cross-resonance gate
Easwar Magesan and Jay M Gambetta · 2020
Closest in time.
Character randomized benchmarking for non-multiplicity-free groups with applications to subspace, leakage, and matchgate randomized benchmarking
J. Claes, E. Rieffel, and Z. Wang · 2020
Closest in time.
Efficient classical simulation and benchmarking of quantum processes in the Weyl basis
Daniel Stilck França, Sergii Strelchuk, and Michał Studziński · 2021
Closest in time.
A universal quantum gate set for transmon qubits with strong ZZ interactions
J. Long, T. Zhao, M. Bal, R. Zhao, G. S. Barron, H.-S. Ku, J. A. Howard, X. Wu, C. R. H. McRae, X.-H. Deng, et al · 2021
Closest in time.
A framework for randomized benchmarking over compact groups
Linghang Kong · 2021
Closest in time.