Benchmarking Single-Qubit Gates on a Neutral Atom Quantum Processor

• URL: http://arxiv.org/abs/2509.06881v1
• Date: Mon, 08 Sep 2025 16:58:44 GMT
• Title: Benchmarking Single-Qubit Gates on a Neutral Atom Quantum Processor
• Authors: Artem Rozanov, Boris Bantysh, Ivan Bobrov, Gleb Struchalin, Stanislav Straupe,
• Abstract summary: We present benchmarking results for single-qubit gates implemented on a neutral atom quantum processor.<n>For single-qubit gates, DRB yields an average fidelity of $99.963 pm 0.016%$.<n>We introduce a gauge optimization procedure for GST that brings the reconstructed gates, input states, and measurements into a canonical frame.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present benchmarking results for single-qubit gates implemented on a neutral atom quantum processor using Direct Randomized Benchmarking (DRB) and Gate Set Tomography (GST). The DRB protocol involves preparing stabilizer states, applying $m$ layers of native single-qubit gates, and measuring in the computational basis, providing an efficient error characterization under a stochastic Pauli noise model. GST enables the full, self-consistent reconstruction of quantum processes, including gates, input states, and measurements. Both protocols provide robust to state preparation and measurement (SPAM) errors estimations of gate performance, offering complementary perspectives on quantum gate fidelity. For single-qubit gates, DRB yields an average fidelity of $99.963 \pm 0.016\%$. The protocol was further applied to a 25-qubit array under global single-qubit control. GST results are consistent with those obtained via DRB. We also introduce a gauge optimization procedure for GST that brings the reconstructed gates, input states, and measurements into a canonical frame, enabling meaningful fidelity comparisons while preserving physical constraints. These constraints of the operators -- such as complete positivity and trace preservation -- are enforced by performing the optimization over the Stiefel manifold. The combined analysis supports the use of complementary benchmarking techniques for characterizing scalable quantum architectures.

Related papers

• Context-aware gate set tomography: Improving the self-consistent characterization of trapped-ion universal gate sets by leveraging non-Markovianity [49.1574468325115]
  Gate set tomography ( GST) estimates the complete set of noisy quantum gates, state preparations, and measurements.<n>In its original incarnation, GST improves the estimation precision by applying the gates sequentially.<n>We show that context dependence can be incorporated in the parametrization of the gate set, allowing us to reduce the sampling cost of GST.
  arXiv  Detail & Related papers  (2025-07-03T11:37:36Z)
• Evaluating the performance of quantum processing units at large width and depth [0.40964539027092917]
  We introduce a benchmarking protocol based on the linear ramp quantum approximate optimization algorithm (LR-QAOA)<n>LR-QAOA quantifies a QPU's ability to preserve a coherent signal as circuit depth increases, identifying when performance becomes statistically indistinguishable from random sampling.<n>We apply this protocol to 24 quantum processors from six vendors, testing problems with up to 156 qubits and 10,000 layers across 1D-chains, native layouts, and fully connected topologies.
  arXiv  Detail & Related papers  (2025-02-10T13:50:50Z)
• Microscopic parametrizations for gate set tomography under coloured noise [0.0]
  We show that a microscopic parametrization of quantum gates under time-correlated noise on the driving phase reduces the required resources. We discuss the minimal parametrizations of the gate set that include the effect of finite correlation times and non-Markovian quantum evolutions.
  arXiv  Detail & Related papers  (2024-07-16T09:39:52Z)
• Majorization-based benchmark of the complexity of quantum processors [105.54048699217668]
  We numerically simulate and characterize the operation of various quantum processors. We identify and assess quantum complexity by comparing the performance of each device against benchmark lines. We find that the majorization-based benchmark holds as long as the circuits' output states have, on average, high purity.
  arXiv  Detail & Related papers  (2023-04-10T23:01:10Z)
• Direct pulse-level compilation of arbitrary quantum logic gates on superconducting qutrits [36.30869856057226]
  We demonstrate any arbitrary qubit and qutrit gate can be realized with high-fidelity, which can significantly reduce the length of a gate sequence. We show that optimal control gates are robust to drift for at least three hours and that the same calibration parameters can be used for all implemented gates.
  arXiv  Detail & Related papers  (2023-03-07T22:15:43Z)
• Benchmarking universal quantum gates via channel spectrum [0.0]
  Noise remains the major obstacle to scalable quantum computation. We propose a method to infer the noise properties of the target gate, including process fidelity, fidelity, and some unitary parameters, from the eigenvalues of its noisy channel. Our method is insensitive to state-preparation and measurement errors, and importantly, can benchmark universal gates and is scalable to many-qubit systems.
  arXiv  Detail & Related papers  (2023-01-05T13:18:19Z)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• Scalable fast benchmarking for individual quantum gates with local twirling [1.7995166939620801]
  We propose a character-cycle benchmarking protocol and a character-average benchmarking protocol only using local twirling gates. We numerically demonstrate our protocols for a non-Clifford gate -- controlled-$(TX)$ and a Clifford gate -- five-qubit quantum error-correcting encoding circuit.
  arXiv  Detail & Related papers  (2022-03-19T13:01:14Z)
• 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)
• Software mitigation of coherent two-qubit gate errors [55.878249096379804]
  Two-qubit gates are important components of quantum computing. But unwanted interactions between qubits (so-called parasitic gates) can degrade the performance of quantum applications. We present two software methods to mitigate parasitic two-qubit gate errors.
  arXiv  Detail & Related papers  (2021-11-08T17:37:27Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• Coherent randomized benchmarking [68.8204255655161]
  We show that superpositions of different random sequences rather than independent samples are used. We show that this leads to a uniform and simple protocol with significant advantages with respect to gates that can be benchmarked.
  arXiv  Detail & Related papers  (2020-10-26T18:00:34Z)
• Characterizing Universal Gate Sets via Dihedral Benchmarking [0.0]
  We describe a practical experimental protocol for robustly characterizing the error rates of non-Clifford gates associated with dihedral groups.<n>Our dihedral benchmarking protocol is a generalization of randomized benchmarking that relaxes the usual unitary 2-design condition.
  arXiv  Detail & Related papers  (2015-08-25T21:36:28Z)

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.