On the fragility of gate-error metrics in simulation models of flux-tunable transmon quantum computers

  1. Hannes Lagemann,
  2. Dennis Willsch,
  3. Madita Willsch,
  4. Fengping Jin,
  5. Hans De Raedt,
  6. and Kristel Michielsen
Constructing a quantum computer requires immensely precise control over a quantum system. A lack of precision is often quantified by gate-error metrics, such as the average infidelity or the diamond distance. However, usually such gate-error metrics are only considered for individual gates, and not the errors that accumulate over consecutive gates. Furthermore, it is not well known how susceptible the metrics are to the assumptions which make up the model. Here, we investigate these issues using realistic simulation models of quantum computers with flux-tunable transmons and coupling resonators. We show that the gate-error metrics are susceptible to many of the assumptions which make up the model. Additionally, we find that consecutive gate errors do not accumulate linearly. Previous work showed that the gate-error metrics are poor predictors for the performance of consecutive gates. Here, we provide further evidence and a concise theoretical explanation for this finding. Furthermore, we discuss a problem that potentially limits the overall scaling capabilities of the device architecture we study in this work.

leave comment