REVIEW 3 cited by
Classical benchmarking of zero noise extrapolation beyond the exactly-verifiable regime
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
abstract
In a recent work a quantum error mitigation protocol was applied to the expectation values obtained from circuits on the IBM Eagle quantum processor with up $127$ - qubits with up to $60 \; - \; \mbox{CNOT}$ layers. To benchmark the efficacy of this quantum protocol a physically motivated quantum circuit family was considered that allowed access to exact solutions in different regimes. The family interpolated between Clifford circuits and was additionally evaluated at low depth where exact validation is practical. It was observed that for highly entangling parameter regimes the circuits are beyond the validation of matrix product state and isometric tensor network state approximation methods. Here we compare the experimental results to matrix product operator simulations of the Heisenberg evolution, find they provide a closer approximation than these pure-state methods by exploiting the closeness to Clifford circuits and limited operator growth. Recently other approximation methods have been used to simulate the full circuit up to its largest extent. We observe a discrepancy of up to $20\%$ among the different classical approaches so far, an uncertainty comparable to the bootstrapped error bars of the experiment. Based on the different approximation schemes we propose modifications to the original circuit family that challenge the particular classical methods discussed here.
Forward citations
Cited by 3 Pith papers
-
Efficient classical simulation of large-scale unitary cluster Jastrow circuits
A one-layer UCJ quantum chemistry circuit can have its energy computed classically in O(N^7) time, so single-layer UCJ circuits cannot provide quantum advantage for energy estimation.
-
Backpropagating Pauli Propagation
A backward-propagation algorithm computes gradients for sparse Pauli dynamics in O(1) passes and O(N_P) memory, with gradient accuracy empirically comparable to the simulation's own energy accuracy.
-
Variational Quantum Simulations of a Two-Dimensional Frustrated Transverse-Field Ising Model on a Trapped-Ion Quantum Computer
A 16-qubit trapped-ion processor, running classically pretrained VQE circuits without error mitigation, reproduces the ferromagnetic and stripe phases of a 2D frustrated transverse-field Ising model.
Discussion (0). Continue with ORCID to comment.