REVIEW 7 cited by
The computational power of random quantum circuits in arbitrary geometries
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
Empirical evidence for a gap between the computational powers of classical and quantum computers has been provided by experiments that sample the output distributions of two-dimensional quantum circuits. Many attempts to close this gap have utilized classical simulations based on tensor network techniques, and their limitations shed light on the improvements to quantum hardware required to frustrate classical simulability. In particular, quantum computers having in excess of $\sim 50$ qubits are primarily vulnerable to classical simulation due to restrictions on their gate fidelity and their connectivity, the latter determining how many gates are required (and therefore how much infidelity is suffered) in generating highly-entangled states. Here, we describe recent hardware upgrades to Quantinuum's H2 quantum computer enabling it to operate on up to $56$ qubits with arbitrary connectivity and $99.843(5)\%$ two-qubit gate fidelity. Utilizing the flexible connectivity of H2, we present data from random circuit sampling in highly connected geometries, doing so at unprecedented fidelities and a scale that appears to be beyond the capabilities of state-of-the-art classical algorithms. The considerable difficulty of classically simulating H2 is likely limited only by qubit number, demonstrating the promise and scalability of the QCCD architecture as continued progress is made towards building larger machines.
Forward citations
Cited by 7 Pith papers
-
Constructive interference at the edge of quantum ergodic dynamics
Second-order out-of-time-order correlators measured on 65-qubit random circuits remain sensitive to dynamics and are estimated to be beyond the reach of current classical tensor-network simulation.
-
Verifiable Random Sampling
VRS turns RCS-based certified randomness plus a timed bulletin board into a composable, publicly verifiable sampler of fresh samples from any target distribution.
-
Quantum Internet in a Nutshell -- Advancing Quantum Communication with Ion Traps
A trapped-ion quantum computer emulates BB84 and BBM92 with cloning and side-channel attacks, and simulated small QEC codes can suppress channel noise and fingerprint the noise channel.
-
Scalable suppression of heating errors in large trapped-ion quantum processors
Optimizing MS-gate pulses against an efficiently computable heating-error bound, via a positive-semidefinite QCQP, suppresses heating-induced infidelity in trapped-ion systems with up to 55 ions in simulation.
-
Efficient Implementation of Arbitrary Two-Qubit Gates via Unified Control
A single exchange-plus-drive pulse natively implements arbitrary two-qubit gates on a transmon processor, averaging 99.37 percent XEB fidelity over ten calibrated gates and enabling B-gate synthesis of the whole two-q...
-
Generalized Cross-Entropy Benchmarking for Random Circuits with Ergodicity
Random circuits satisfy an ergodicity condition for positive-coefficient polynomials, and its deviation can benchmark quantum chip fidelity, recovering and generalizing linear cross-entropy benchmarking.
-
Artificial intelligence for representing and characterizing quantum systems
A review organizes AI-based quantum system characterization into ML, deep learning, and language model paradigms, covering property prediction and implicit state reconstruction.
Discussion (0). Continue with ORCID to comment.