Two-Qubit Gate Set Tomography with Fewer Circuits

• URL: http://arxiv.org/abs/2307.15767v2
• Date: Thu, 21 Sep 2023 22:40:19 GMT
• Title: Two-Qubit Gate Set Tomography with Fewer Circuits
• Authors: Kenneth M. Rudinger, Corey I. Ostrove, Stefan K. Seritan, Matthew D. Grace, Erik Nielsen, Robin J. Blume-Kohout, Kevin C. Young
• Abstract summary: We show how to exploit the structure of GST circuits to determine which ones are superfluous. We also explore the impact of these techniques on the prospects of three-qubit GST.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Gate set tomography (GST) is a self-consistent and highly accurate method for the tomographic reconstruction of a quantum information processor's quantum logic operations, including gates, state preparations, and measurements. However, GST's experimental cost grows exponentially with qubit number. For characterizing even just two qubits, a standard GST experiment may have tens of thousands of circuits, making it prohibitively expensive for platforms. We show that, because GST experiments are massively overcomplete, many circuits can be discarded. This dramatically reduces GST's experimental cost while still maintaining GST's Heisenberg-like scaling in accuracy. We show how to exploit the structure of GST circuits to determine which ones are superfluous. We confirm the efficacy of the resulting experiment designs both through numerical simulations and via the Fisher information for said designs. We also explore the impact of these techniques on the prospects of three-qubit GST.

Related papers

• VST++: Efficient and Stronger Visual Saliency Transformer [74.26078624363274]
  We develop an efficient and stronger VST++ model to explore global long-range dependencies. We evaluate our model across various transformer-based backbones on RGB, RGB-D, and RGB-T SOD benchmark datasets.
  arXiv  Detail & Related papers  (2023-10-18T05:44:49Z)
• Near-Minimal Gate Set Tomography Experiment Designs [0.0]
  We show how to streamline GST experiment designs by removing almost all redundancy. We do this by analyzing the "germ" subroutines at the heart of GST circuits. New experiment designs can match the precision of previous GST experiments with significantly fewer circuits.
  arXiv  Detail & Related papers  (2023-08-17T04:46:25Z)
• Characterizing non-Markovian Quantum Process by Fast Bayesian Tomography [0.0]
  characterization of non-Markovian error poses a challenge to current quantum process tomography techniques. Fast Bayesian Tomography (FBT) is a self-consistent gate set tomography protocol that can be bootstrapped from earlier characterization knowledge. We introduce two experimental protocols for FBT to diagnose the non-Markovian behavior of two-qubit systems on silicon quantum dots.
  arXiv  Detail & Related papers  (2023-07-23T23:10:18Z)
• Efficient characterization of qudit logical gates with gate set tomography using an error-free Virtual-Z-gate model [0.0]
  We propose a more efficient GST approach for qudits, utilizing the qudit Hadamard and virtual Z gates to construct fiducials. Our method reduces the computational costs of estimating characterization results, making GST more practical at scale.
  arXiv  Detail & Related papers  (2022-10-10T17:20:25Z)
• Erasure qubits: Overcoming the $T_1$ limit in superconducting circuits [105.54048699217668]
  amplitude damping time, $T_phi$, has long stood as the major factor limiting quantum fidelity in superconducting circuits. We propose a scheme for overcoming the conventional $T_phi$ limit on fidelity by designing qubits in a way that amplitude damping errors can be detected and converted into erasure errors.
  arXiv  Detail & Related papers  (2022-08-10T17:39:21Z)
• Analytical and experimental study of center line miscalibrations in M\o lmer-S\o rensen gates [51.93099889384597]
  We study a systematic perturbative expansion in miscalibrated parameters of the Molmer-Sorensen entangling gate. We compute the gate evolution operator which allows us to obtain relevant key properties. We verify the predictions from our model by benchmarking them against measurements in a trapped-ion quantum processor.
  arXiv  Detail & Related papers  (2021-12-10T10:56:16Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Efficient Experimental Verification of Quantum Gates with Local Operations [0.0]
  We propose a variant of quantum gate verification (QGV) which is robust to practical gate imperfections. We experimentally realize efficient QGV on a two-qubit controlled-not gate and a three-qubit Toffoli gate. Our work promises a solution to the dimensionality curse in verifying large quantum devices in the quantum era.
  arXiv  Detail & Related papers  (2021-07-06T02:56:55Z)
• Quantum control landscape for ultrafast generation of single-qubit phase shift quantum gates [68.8204255655161]
  We consider the problem of ultrafast controlled generation of single-qubit phase shift quantum gates. Globally optimal control is a control which realizes the gate with maximal possible fidelity. Trap is a control which is optimal only locally but not globally.
  arXiv  Detail & Related papers  (2021-04-26T16:38:43Z)
• Gate Set Tomography [0.0]
  Gate set tomography ( GST) is a protocol for detailed, predictive characterization of logic operations (gates) on quantum computing processors. This paper presents the foundations of GST in comprehensive detail.
  arXiv  Detail & Related papers  (2020-09-15T18:09:05Z)
• Efficient and Stable Graph Scattering Transforms via Pruning [86.76336979318681]
  Graph scattering transforms ( GSTs) offer training-free deep GCN models that extract features from graph data. The price paid by GSTs is exponential complexity in space and time that increases with the number of layers. The present work addresses the complexity limitation of GSTs by introducing an efficient so-termed pruned (p) GST approach.
  arXiv  Detail & Related papers  (2020-01-27T16:05:56Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.