Benchmarking Quantum Processor Performance at Scale

• URL: http://arxiv.org/abs/2311.05933v1
• Date: Fri, 10 Nov 2023 08:47:31 GMT
• Title: Benchmarking Quantum Processor Performance at Scale
• Authors: David C. McKay and Ian Hincks and Emily J. Pritchett and Malcolm Carroll and Luke C. G. Govia and Seth T. Merkel
• Abstract summary: As quantum processors grow, new performance benchmarks are required to capture the full quality of the devices at scale. We discuss a scalable benchmark which measures the fidelity of a connecting set of two-qubit gates over $N$ qubits. Our layer fidelity can be easily related to algorithmic run time, via $gamma$ defined in Ref.citeberg2022probabilistic that can be used to estimate the number of circuits required for error mitigation.
• Score: 0.10485739694839669
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: As quantum processors grow, new performance benchmarks are required to capture the full quality of the devices at scale. While quantum volume is an excellent benchmark, it focuses on the highest quality subset of the device and so is unable to indicate the average performance over a large number of connected qubits. Furthermore, it is a discrete pass/fail and so is not reflective of continuous improvements in hardware nor does it provide quantitative direction to large-scale algorithms. For example, there may be value in error mitigated Hamiltonian simulation at scale with devices unable to pass strict quantum volume tests. Here we discuss a scalable benchmark which measures the fidelity of a connecting set of two-qubit gates over $N$ qubits by measuring gate errors using simultaneous direct randomized benchmarking in disjoint layers. Our layer fidelity can be easily related to algorithmic run time, via $\gamma$ defined in Ref.\cite{berg2022probabilistic} that can be used to estimate the number of circuits required for error mitigation. The protocol is efficient and obtains all the pair rates in the layered structure. Compared to regular (isolated) RB this approach is sensitive to crosstalk. As an example we measure a $N=80~(100)$ qubit layer fidelity on a 127 qubit fixed-coupling "Eagle" processor (ibm\_sherbrooke) of 0.26(0.19) and on the 133 qubit tunable-coupling "Heron" processor (ibm\_montecarlo) of 0.61(0.26). This can easily be expressed as a layer size independent quantity, error per layered gate (EPLG), which is here $1.7\times10^{-2}(1.7\times10^{-2})$ for ibm\_sherbrooke and $6.2\times10^{-3}(1.2\times10^{-2})$ for ibm\_montecarlo.

Related papers

• In-situ mid-circuit qubit measurement and reset in a single-species trapped-ion quantum computing system [34.82692226532414]
  We implement in-situ mid-circuit measurement and reset (MCMR) operations on a trapped-ion quantum computing system. We introduce and compare two methods for isolating data qubits from measured qubits. We experimentally demonstrate both methods on a crystal of two $171textrmYb+$ ions.
  arXiv  Detail & Related papers  (2025-04-17T00:10:35Z)
• Scalable General Error Mitigation for Quantum Circuits [0.3141085922386211]
  In quantum computing, error mitigation is a method to improve the results of an error-prone quantum processor by post-processing them. We improve the General Error Mitigation (GEM) method for scalability. Experiments show that the mitigation works comparably well to GEM, while requiring a fraction of the calibration runs.
  arXiv  Detail & Related papers  (2024-11-12T16:47:36Z)
• Quantum error correction below the surface code threshold [107.92016014248976]
  Quantum error correction provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit. We present two surface code memories operating below a critical threshold: a distance-7 code and a distance-5 code integrated with a real-time decoder. Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms.
  arXiv  Detail & Related papers  (2024-08-24T23:08:50Z)
• QuTracer: Mitigating Quantum Gate and Measurement Errors by Tracing Subsets of Qubits [8.54896613102673]
  Quantum error mitigation plays a crucial role in the current noisy-intermediate-scale-quantum (NISQ) era. We propose QuTracer, a framework designed to mitigate both gate and measurement errors in subsets of qubits.
  arXiv  Detail & Related papers  (2024-04-30T17:06:04Z)
• Benchmarking the algorithmic performance of near-term neutral atom processors [0.0]
  We present a characterization of the algorithmic performance of Rydberg atom quantum computers through device simulation. We consider three different quantum algorithm related tests, exploiting the ability to dynamically update qubit connectivity and multi-qubit gates. Our results indicate Rydberg atom processors are a highly competitive near-term platform which, bolstered by the potential for further scalability, can pave the way toward useful quantum computation.
  arXiv  Detail & Related papers  (2024-02-03T11:55:02Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• High-threshold and low-overhead fault-tolerant quantum memory [4.91491092996493]
  We present an end-to-end quantum error correction protocol based on a family of LDPC codes with a high encoding rate. We show that 12 logical qubits can be preserved for nearly one million syndrome cycles using 288 physical qubits.
  arXiv  Detail & Related papers  (2023-08-15T17:55:12Z)
• 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)
• Universal logic with encoded spin qubits in silicon [1.5796098351442824]
  Qubits encoded in a decoherence-free subsystem and realized in exchange-coupled silicon quantum dots are promising candidates for fault-tolerant quantum computing. Key difficulties are that encoded entangling gates require a large number of control pulses and high-yielding quantum dot arrays. Here we show a device made using the single-layer etch-defined gate architecture that achieves both the required functional yield needed for full control and the coherence necessary for thousands of exchange pulses to be applied.
  arXiv  Detail & Related papers  (2022-02-08T02:23:46Z)
• AQD: Towards Accurate Fully-Quantized Object Detection [94.06347866374927]
  We propose an Accurate Quantized object Detection solution, termed AQD, to get rid of floating-point computation. Our AQD achieves comparable or even better performance compared with the full-precision counterpart under extremely low-bit schemes.
  arXiv  Detail & Related papers  (2020-07-14T09:07:29Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)

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.