Benchmarking quantum gates and circuits

• URL: http://arxiv.org/abs/2407.09942v2
• Date: Sun, 23 Feb 2025 15:32:27 GMT
• Title: Benchmarking quantum gates and circuits
• Authors: Vinay Tripathi, Daria Kowsari, Kumar Saurav, Haimeng Zhang, Eli M. Levenson-Falk, Daniel A. Lidar,
• Abstract summary: This paper reviews a variety of key benchmarking techniques, including Randomized Benchmarking, Quantum Process Tomography, Gate Set Tomography, Process Fidelity Estimation, Direct Fidelity Estimation, and Cross-Entropy Benchmarking.<n>We introduce deterministic benchmarking (DB), a novel protocol that minimizes the number of experimental runs, exhibits resilience to SPAM errors, and effectively characterizes both coherent and incoherent errors.
• Score: 1.6163129903911515
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Accurate noise characterization in quantum gates and circuits is vital for the development of reliable quantum simulations for chemically relevant systems and fault-tolerant quantum computing. This paper reviews a variety of key benchmarking techniques, including Randomized Benchmarking, Quantum Process Tomography, Gate Set Tomography, Process Fidelity Estimation, Direct Fidelity Estimation, and Cross-Entropy Benchmarking. We evaluate each method's complexities, the resources they require, and their effectiveness in addressing coherent, incoherent, and state preparation and measurement (SPAM) errors. Furthermore, we introduce deterministic benchmarking (DB), a novel protocol that minimizes the number of experimental runs, exhibits resilience to SPAM errors, and effectively characterizes both coherent and incoherent errors. The implementation of DB is experimentally validated using a superconducting transmon qubit, and the results are substantiated with a simple analytical model and master equation simulations. With the addition of DB to the toolkit of available benchmarking methods, this article serves as a practical guide for choosing and applying benchmarking protocols to advance quantum computing technologies.

Related papers

• Advancing quantum process tomography through universal compilation [0.0]
  Quantum process tomography (QPT) is crucial for characterizing operations in quantum gates and circuits. Here, we propose a QPT approach based on universal compilation, which systematically decomposes quantum processes into optimized Kraus operators and Choi matrices. We benchmark our approach through numerical simulations of random unitary gates, demonstrating highly accurate quantum process characterization.
  arXiv  Detail & Related papers  (2025-04-21T08:34:33Z)
• Quantum Characterization, Verification, and Validation [0.0]
  Quantum characterization, verification, and validation (QCVV) is a set of techniques to probe, describe, and assess the behavior of quantum bits (qubits) QCVV protocols probe and describe the effects of unwanted decoherence so that it can be eliminated or mitigated.
  arXiv  Detail & Related papers  (2025-03-20T17:45:03Z)
• An Accurate and Efficient Analytic Model of Fidelity Under Depolarizing Noise Oriented to Large Scale Quantum System Design [1.80755313284025]
  We present a comprehensive theoretical framework to predict the fidelity of quantum circuits under depolarizing noise. We propose an efficient fidelity estimation algorithm based on device calibration data. The proposed approach provides a scalable and practical tool for benchmarking quantum hardware.
  arXiv  Detail & Related papers  (2025-03-09T16:59:24Z)
• Learning to rank quantum circuits for hardware-optimized performance enhancement [0.0]
  We introduce and experimentally test a machine-learning-based method for ranking logically equivalent quantum circuits. We compare our method to two common approaches: random layout selection and a publicly available baseline called Mapomatic. Our best model leads to a $1.8times$ reduction in selection error when compared to the baseline approach and a $3.2times$ reduction when compared to random selection.
  arXiv  Detail & Related papers  (2024-04-09T18:00:01Z)
• Error budget of parametric resonance entangling gate with a tunable coupler [0.0]
  We analyze the experimental error budget of parametric resonance gates in a tunable coupler architecture. Incoherent errors, mainly arising from qubit relaxation and dephasing due to white noise, limit the fidelity of the two-qubit gates. Leakage to noncomputational states is the second largest contributor to the two-qubit gates infidelity.
  arXiv  Detail & Related papers  (2024-02-06T18:46:27Z)
• Dynamical subset sampling of quantum error correcting protocols [0.0]
  We show the capabilities of dynamical subset sampling with examples from fault-tolerant (FT) QEC. We show that, in a typical stabilizer simulation with incoherent Pauli noise of strength $p = 10-3$, our method can reach a required sampling accuracy on the logical failure rate.
  arXiv  Detail & Related papers  (2023-09-22T10:32:20Z)
• Robust and efficient verification of graph states in blind measurement-based quantum computation [52.70359447203418]
  Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
  arXiv  Detail & Related papers  (2023-05-18T06:24:45Z)
• BUMP: A Benchmark of Unfaithful Minimal Pairs for Meta-Evaluation of Faithfulness Metrics [70.52570641514146]
  We present a benchmark of unfaithful minimal pairs (BUMP) BUMP is a dataset of 889 human-written, minimally different summary pairs. Unlike non-pair-based datasets, BUMP can be used to measure the consistency of metrics.
  arXiv  Detail & Related papers  (2022-12-20T02:17:30Z)
• Potential and limitations of quantum extreme learning machines [55.41644538483948]
  We present a framework to model QRCs and QELMs, showing that they can be concisely described via single effective measurements. Our analysis paves the way to a more thorough understanding of the capabilities and limitations of both QELMs and QRCs.
  arXiv  Detail & Related papers  (2022-10-03T09:32:28Z)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• Error-based Knockoffs Inference for Controlled Feature Selection [49.99321384855201]
  We propose an error-based knockoff inference method by integrating the knockoff features, the error-based feature importance statistics, and the stepdown procedure together. The proposed inference procedure does not require specifying a regression model and can handle feature selection with theoretical guarantees.
  arXiv  Detail & Related papers  (2022-03-09T01:55:59Z)
• Measuring NISQ Gate-Based Qubit Stability Using a 1+1 Field Theory and Cycle Benchmarking [50.8020641352841]
  We study coherent errors on a quantum hardware platform using a transverse field Ising model Hamiltonian as a sample user application. We identify inter-day and intra-day qubit calibration drift and the impacts of quantum circuit placement on groups of qubits in different physical locations on the processor. This paper also discusses how these measurements can provide a better understanding of these types of errors and how they may improve efforts to validate the accuracy of quantum computations.
  arXiv  Detail & Related papers  (2022-01-08T23:12:55Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• BCD Nets: Scalable Variational Approaches for Bayesian Causal Discovery [97.79015388276483]
  A structural equation model (SEM) is an effective framework to reason over causal relationships represented via a directed acyclic graph (DAG) Recent advances enabled effective maximum-likelihood point estimation of DAGs from observational data. We propose BCD Nets, a variational framework for estimating a distribution over DAGs characterizing a linear-Gaussian SEM.
  arXiv  Detail & Related papers  (2021-12-06T03:35:21Z)
• Efficient diagnostics for quantum error correction [0.0]
  We present a scalable experimental approach based on Pauli error reconstruction to predict the performance of codes. Numerical evidence demonstrates that our method significantly outperforms predictions based on standard error metrics for various error models.
  arXiv  Detail & Related papers  (2021-08-24T16:28:29Z)
• Fault-tolerant parity readout on a shuttling-based trapped-ion quantum computer [64.47265213752996]
  We experimentally demonstrate a fault-tolerant weight-4 parity check measurement scheme. We achieve a flag-conditioned parity measurement single-shot fidelity of 93.2(2)%. The scheme is an essential building block in a broad class of stabilizer quantum error correction protocols.
  arXiv  Detail & Related papers  (2021-07-13T20:08:04Z)
• Quantum-tailored machine-learning characterization of a superconducting qubit [50.591267188664666]
  We develop an approach to characterize the dynamics of a quantum device and learn device parameters. This approach outperforms physics-agnostic recurrent neural networks trained on numerically generated and experimental data. This demonstration shows how leveraging domain knowledge improves the accuracy and efficiency of this characterization task.
  arXiv  Detail & Related papers  (2021-06-24T15:58:57Z)
• Hidden Inverses: Coherent Error Cancellation at the Circuit Level [3.3012851255362494]
  Coherent gate errors are a concern in many proposed quantum computing architectures. We benchmark our coherent errors by comparing the actual performance of composite single-qubit gates to the predicted performance. We propose a compilation technique, which we refer to as hidden inverses, that creates circuits robust to these coherent errors.
  arXiv  Detail & Related papers  (2021-04-02T15:57:48Z)
• Crosstalk Suppression for Fault-tolerant Quantum Error Correction with Trapped Ions [62.997667081978825]
  We present a study of crosstalk errors in a quantum-computing architecture based on a single string of ions confined by a radio-frequency trap, and manipulated by individually-addressed laser beams. This type of errors affects spectator qubits that, ideally, should remain unaltered during the application of single- and two-qubit quantum gates addressed at a different set of active qubits. We microscopically model crosstalk errors from first principles and present a detailed study showing the importance of using a coherent vs incoherent error modelling and, moreover, discuss strategies to actively suppress this crosstalk at the gate level.
  arXiv  Detail & Related papers  (2020-12-21T14:20:40Z)
• CASTLE: Regularization via Auxiliary Causal Graph Discovery [89.74800176981842]
  We introduce Causal Structure Learning (CASTLE) regularization and propose to regularize a neural network by jointly learning the causal relationships between variables. CASTLE efficiently reconstructs only the features in the causal DAG that have a causal neighbor, whereas reconstruction-based regularizers suboptimally reconstruct all input features.
  arXiv  Detail & Related papers  (2020-09-28T09:49:38Z)
• Correlated Randomized Benchmarking [0.4462334751640167]
  We introduce a crosstalk metric which indicates the distance to the closest map with only local errors. We demonstrate this technique experimentally with a four-qubit superconducting device.
  arXiv  Detail & Related papers  (2020-03-04T22:37:57Z)

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.