REVIEW 4 cited by
Leveraging Secondary Storage to Simulate Deep 54-qubit Sycamore 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
Leveraging Secondary Storage to Simulate Deep 54-qubit Sycamore Circuits
read the original abstract
In a recent paper, we showed that secondary storage can extend the range of quantum circuits that can be practically simulated with classical algorithms. Here we refine those techniques and apply them to the simulation of Sycamore circuits with 53 and 54 qubits, with the entanglement pattern ABCDCDAB that has proven difficult to classically simulate with other approaches. Our analysis shows that on the Summit supercomputer at Oak Ridge National Laboratories, such circuits can be simulated with high fidelity to arbitrary depth in a matter of days, outputting all the amplitudes.
Forward citations
Cited by 4 Pith papers
-
Sample-efficient benchmarking of shallow all-to-all random quantum circuits
Nonlinear cross-entropy benchmark and heavy-output classifier enable sample-efficient distinction between noisy quantum and classical spoofers for shallow-depth all-to-all random circuits.
-
Fast and memory-efficient classical simulation of quantum machine learning via forward and backward gate fusion
Gate fusion applied to both forward and backward passes in quantum circuit simulation achieves 20-30x throughput gains and supports training large 20-qubit 1000-layer QML models with 60000 parameters using gradient ch...
-
Optimizing Memory Efficiency and Index Ordering to Simulate Quantum Circuits Using Tensor Decision Diagrams
Hardware-aware FTDD memory management plus a Path index-order heuristic bounds RAM and simulates structured circuits (e.g. QFT) up to 100 qubits, with large topology-dependent speedups.
-
SparQSim: Simulating Scalable Quantum Algorithms via Sparse Quantum State Representations
SparQSim is a sparse-state quantum simulator in C++ supporting QRAM that outperforms dense Schrödinger simulators on high-sparsity benchmark circuits and produces consistent results for quantum linear system solvers.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.