REVIEW 9 cited by
Classical Simulation of Quantum Supremacy 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
read the original abstract
It is believed that random quantum circuits are difficult to simulate classically. These have been used to demonstrate quantum supremacy: the execution of a computational task on a quantum computer that is infeasible for any classical computer. The task underlying the assertion of quantum supremacy by Arute et al. (Nature, 574, 505--510 (2019)) was initially estimated to require Summit, the world's most powerful supercomputer today, approximately 10,000 years. The same task was performed on the Sycamore quantum processor in only 200 seconds. In this work, we present a tensor network-based classical simulation algorithm. Using a Summit-comparable cluster, we estimate that our simulator can perform this task in less than 20 days. On moderately-sized instances, we reduce the runtime from years to minutes, running several times faster than Sycamore itself. These estimates are based on explicit simulations of parallel subtasks, and leave no room for hidden costs. The simulator's key ingredient is identifying and optimizing the "stem" of the computation: a sequence of pairwise tensor contractions that dominates the computational cost. This orders-of-magnitude reduction in classical simulation time, together with proposals for further significant improvements, indicates that achieving quantum supremacy may require a period of continuing quantum hardware developments without an unequivocal first demonstration.
Forward citations
Cited by 9 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.
-
Hardness and Complexity Transition of Noisy Random Circuit Sampling
Under the standard ideal-RCS #P-hardness conjecture, noisy random circuit sampling remains hard for depolarizing noise γ = O(log n/(nd)), and matching simulability results make γ = Θ(log n/(nd)) the transition scale.
-
Optimizing Tensor Network Partitioning using Simulated Annealing
A simulated annealing refinement of tensor network partitionings for distributed contraction lowers estimated computational and memory cost by about 8x on average versus naive partitioning on MQT Bench circuits.
-
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...
-
Matrix Product Evolution: A Method for Simulating Quantum Circuits Using Tensor Networks
A depth-oriented tensor-network contraction method, called MPE, is introduced and shown to gain accuracy from post-selection, complementing standard MPS simulation.
-
Position: Quantum Program Generation Must Prioritize Validity Over Probabilistic Scaling
The paper argues that probabilistic scaling alone cannot fix the validity gap in quantum circuit generation, so quantum code assistants must build verification into generation rather than filter outputs after the fact.
-
Loophole-Robust Certification of Quantum Advantage
For any bounded-reward task, a classical strategy with benchmark-dependent side information can improve over the loophole-free classical score by at most the total-variation strength η of that dependence.
-
Quantum Supremacy through Fock State $q$ boson Sampling with Transmon Qubits
A transmon's nonlinear spectrum can be approximated by a q-boson with q=1+K/omega, and the paper argues this enables Fock-state q-boson sampling with potential quantum supremacy.
-
Hybrid Quantum Neural Networks: Theory, Implementations, and Applications
A balanced review of hybrid quantum neural networks, concluding that quantum layers help on structured, small-scale and quantum-native problems but do not yet beat classical models on generic benchmarks.
Discussion (0). Sign in to comment.