REVIEW 7 cited by
Randomized compiling for scalable quantum computing on a noisy superconducting quantum processor
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
read the original abstract
The successful implementation of algorithms on quantum processors relies on the accurate control of quantum bits (qubits) to perform logic gate operations. In this era of noisy intermediate-scale quantum (NISQ) computing, systematic miscalibrations, drift, and crosstalk in the control of qubits can lead to a coherent form of error which has no classical analog. Coherent errors severely limit the performance of quantum algorithms in an unpredictable manner, and mitigating their impact is necessary for realizing reliable quantum computations. Moreover, the average error rates measured by randomized benchmarking and related protocols are not sensitive to the full impact of coherent errors, and therefore do not reliably predict the global performance of quantum algorithms, leaving us unprepared to validate the accuracy of future large-scale quantum computations. Randomized compiling is a protocol designed to overcome these performance limitations by converting coherent errors into stochastic noise, dramatically reducing unpredictable errors in quantum algorithms and enabling accurate predictions of algorithmic performance from error rates measured via cycle benchmarking. In this work, we demonstrate significant performance gains under randomized compiling for the four-qubit quantum Fourier transform algorithm and for random circuits of variable depth on a superconducting quantum processor. Additionally, we accurately predict algorithm performance using experimentally-measured error rates. Our results demonstrate that randomized compiling can be utilized to leverage and predict the capabilities of modern-day noisy quantum processors, paving the way forward for scalable quantum computing.
Forward citations
Cited by 7 Pith papers
-
The Geometry of Quantum Complexity in Open Systems
Open-system quantum complexity is governed by a sub-Finslerian geometry whose curvature depends on the cost penalties for unitary and dissipative controls.
-
Quantum-informed surrogate sampling for combinatorial optimization
QISS classically samples a pairwise model built from O(N) low-weight QAOA correlators and outperforms standard QAOA at larger depths on MaxCut and MIS benchmarks.
-
A modular state-space model of human perception, cognition, and decision dynamics
A modular state-space model decomposing perception, cognition, and decision into interpretable equations, with sufficient stability conditions and a simulated rehabilitation control demonstration.
-
Exploiting biased noise in variational quantum models
Twirling amplitude-damping noise into uniform Pauli/depolarising channels reduces expressivity and gradient magnitudes, while preserving the noise bias yields better VQA optimisation in the studied models.
-
Critical Flicker Fusion Frequency As A Falsifiable Boundary Between Plastic And Non-Plastic Neural Systems
CFFF is proposed as a stable, falsifiable marker of a plasticity boundary between fixed sensory timing and flexible cortical processing.
-
State-Dependent Observation Noise Reintroduces Epistemic Value in Linear-Gaussian Active Inference
State-dependent observation noise, evaluated at a control-dependent belief mean, makes a linear-Gaussian active-inference agent's posterior covariance and (for scalar observations) epistemic value action-dependent, an...
-
Semantic and episodic memories in a predictive coding model of the neocortex
A predictive coding model of the neocortex recalls individual MNIST examples only when trained on a tiny batch; training on the full dataset preserves semantic reconstruction but degrades episodic recall.
Discussion (0). Continue with ORCID to comment.