REVIEW 14 cited by
Benchmarking Quantum Processor Performance at Scale
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
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.
Forward citations
Cited by 14 Pith papers
-
Mitigating errors in state preparation and measurement with noncomputational states
Using extra transmon levels to measure state-preparation error lets a noise-learning protocol separate state-preparation, gate, and measurement errors, including for mid-circuit measurements.
-
Quench Spectroscopy of Magnetic Excitations on a Superconducting Quantum Processor
Quench spectroscopy on a superconducting processor extracts magnon, bound-state and two-spinon spectra of L=101 XXZ chains, including from product states in the gapless regime without ground-state preparation.
-
Oraqle: An Empirical Analysis of Qubit Readout and Discriminators in Quantum Error Correction
Using real 5-qubit traces, this study shows readout windows can be cut to ~600 ns with negligible QEC penalty and small discriminators match large ones.
-
Real-Time Dynamics in a (2+1)-D Gauge Theory: The Stringy Nature on a Superconducting Quantum Simulator
On a 144-qubit superconducting processor, the authors observe the real-time dynamics of confining electric strings in a (2+1)-D Z2 gauge theory, distinguishing longitudinal yo-yo modes from transverse bending and demo...
-
Calibrating quantum gates up to 52 qubits in a superconducting processor
CAB benchmarks a 44-qubit parallel CZ gate at 63.09% and a 52-qubit version at 38.92%, and global-fidelity optimization improves a 6-qubit parallel CZ gate from about 88.7% to 92.04%.
-
Experimental study of multiple-shot unitary channels discrimination using the IBM Q computers
On IBM Brisbane, sequential and hybrid circuits discriminate unitary channels more reliably than wide parallel circuits, until depth noise dominates.
-
Efficient Quantum Convolutional Neural Networks for Image Classification: Overcoming Hardware Constraints
A 49-qubit quantum CNN with a fragment encoding scheme achieved 96.08% accuracy on binary MNIST classification on IBM Heron r2 hardware, outperforming a 22-parameter classical CNN baseline, but only for simple binary tasks.
-
Evaluating the performance of quantum processing units at large width and depth
A cross-vendor benchmark using fixed-parameter QAOA ranks 24 quantum processors by how well they preserve algorithmic signal at extreme circuit depth and width.
-
Design and Benchmarking of a Quantum Photonic Chip
RP000, a room-temperature CMOS photonic three-qubit processor, delivers higher or comparable accuracy to parameter-matched classical nets on ML classification and better noise tolerance than a superconducting processor.
-
Photonic processor benchmarking for variational quantum process tomography
In a benchmark of variational quantum process tomography on 2-qubit unitaries, a classical one-hot optical processor and a quantum photonic processor both outperformed superconducting processors, reaching process fide...
-
Approximate Quadratization of High-Order Hamiltonians for Combinatorial Quantum Optimization
Replacing the full QAOA Hamiltonian with an approximate quadratic or SWAP-truncated version yields shallower circuits that can outperform standard QAOA under realistic noise.
-
Securities Transaction Settlement Optimization on superconducting quantum devices
A variational quantum algorithm with custom readout mitigation solves simplified TARGET2-Securities settlement instances of up to 40 trades, but real hardware runs remain noise-limited and do not beat random sampling.
-
Approximate quantum circuit compilation for proton-transfer kinetics on quantum processors
Compressing ADAPT-VQE circuits with approximate quantum compiling keeps noiseless proton-transfer barrier estimates within 13% of the CASCI reference, but noisy-device simulations with zero-noise extrapolation still m...
-
A Cost-Effective Quantum Boolean-Phase SWAP Gate with Only Two CNOT Gates
A two-CNOT swap-like gate is introduced whose transpiled version has lower gate count and depth than the standard three-CNOT SWAP, at the cost of user-selected phase distortions.
Discussion (0). Continue with ORCID to comment.