REVIEW 6 cited by
Multi-Tensor Contraction for XEB Verification of Quantum Circuits
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
read the original abstract
The computational advantage of noisy quantum computers has been demonstrated by sampling the bitstrings of quantum random circuits. An important issue is how the performance of quantum devices could be quantified in the so-called "supremacy regime". The standard approach is through the linear cross entropy benchmark (XEB), where the theoretical value of the probability is required for each bitstring. However, the computational cost of XEB grows exponentially. So far, random circuits of the 53-qubit Sycamore chip were verified up to 10 cycles of gates only; the XEB fidelities of deeper circuits were approximated with simplified circuits instead. Here we present a multi-tensor contraction algorithm for speeding up the calculations of XEB for quantum circuits, where the computational cost can be significantly reduced through some form of memoization. As a demonstration, we analyzed the experimental data of the 53-qubit Sycamore chip and obtained the exact values of the corresponding XEB fidelities up to 16 cycles using only moderate computing resources (few GPUs). If the algorithm was implemented on the Summit supercomputer, we estimate that for the supremacy (20 cycles) circuits, it would only cost 7.5 days, which is several orders of magnitude lower than previously estimated in the literature.
Forward citations
Cited by 6 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.
-
Realified tensor networks: quantum circuit simulation on real-valued matrix accelerators
Any complex tensor network can be converted into a real-valued tensor network with arithmetic overhead 1+2m+r (never above 3x) and at most doubled intermediate sizes, with measured speedups on real-only NPUs.
-
Hierarchical Search of Tree Tensor Networks for High-Dimensional Data
A hierarchical, entropy-guided search algorithm automatically rewires tree tensor networks and reshapes their indices, delivering 2.5–100× better compression than fixed Tensor Train/Hierarchical Tucker formats on phys...
-
Integrating Neural Networks and Tensor Networks for Computing Free Energy
Tensor-network-based variational autoregressive networks (TNVAN) fix a small 'width set' of spins, contract the rest of the network exactly, and fit a neural variational distribution on the reduced system to estimate ...
-
Strategic Plan for Neutral Atom Quantum Computation
If qubit-count growth (~1.8x/yr) and gate-error reduction (~0.62x/yr) continue, neutral-atom quantum computers could reach practical quantum advantage within a decade, this roadmap projects.
-
Programming guide for solving constraint satisfaction problems with tensor networks
This guide demonstrates how to use the Julia packages GenericTensorNetworks.jl, OMEinsum.jl, and ProblemReductions.jl to represent constraint satisfaction problems as tensor networks, optimize contraction orders, and ...
Discussion (0). Continue with ORCID to comment.