{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:WPZYW6MTTAC354GNULXGGF7DRX","short_pith_number":"pith:WPZYW6MT","schema_version":"1.0","canonical_sha256":"b3f38b79939805bef0cda2ee6317e38dd678cc855b05d2d9fd64c43d65cbe955","source":{"kind":"arxiv","id":"2005.06787","version":1},"attestation_state":"computed","paper":{"title":"Classical Simulation of Quantum Supremacy Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bo Yuan, Cupjin Huang, Fang Zhang, Haihong Xu, Huanjun Yu, Jianxin Chen, Junjie Cai, Junyin Wu, Mario Szegedy, Michael Newman, Xun Gao, Yaoyun Shi, Zhengxiong Tian","submitted_at":"2020-05-14T07:57:38Z","abstract_excerpt":"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.\n  In this work, we present a tensor network-based cl"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2005.06787","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-05-14T07:57:38Z","cross_cats_sorted":[],"title_canon_sha256":"c8f325017b116e3ecee5ca9a01f2fa7dccf2600bee58b7748f888dc0840dc8ad","abstract_canon_sha256":"9c20115c262a21b5ea44b097749e7b27770af995c83ff54df27b4b9ebb20c414"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:02:50.477454Z","signature_b64":"XWW1LcUFxSHSNlG5k/SF7ZdT3J+YmguAVROv2B7+0y2tzSL4FNfqa3XvzaM1DRfMqZf2t2STqbPrGyuDwIYNBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3f38b79939805bef0cda2ee6317e38dd678cc855b05d2d9fd64c43d65cbe955","last_reissued_at":"2026-07-05T01:02:50.476977Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:02:50.476977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Classical Simulation of Quantum Supremacy Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bo Yuan, Cupjin Huang, Fang Zhang, Haihong Xu, Huanjun Yu, Jianxin Chen, Junjie Cai, Junyin Wu, Mario Szegedy, Michael Newman, Xun Gao, Yaoyun Shi, Zhengxiong Tian","submitted_at":"2020-05-14T07:57:38Z","abstract_excerpt":"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.\n  In this work, we present a tensor network-based cl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.06787","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2005.06787/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2005.06787","created_at":"2026-07-05T01:02:50.477042+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.06787v1","created_at":"2026-07-05T01:02:50.477042+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.06787","created_at":"2026-07-05T01:02:50.477042+00:00"},{"alias_kind":"pith_short_12","alias_value":"WPZYW6MTTAC3","created_at":"2026-07-05T01:02:50.477042+00:00"},{"alias_kind":"pith_short_16","alias_value":"WPZYW6MTTAC354GN","created_at":"2026-07-05T01:02:50.477042+00:00"},{"alias_kind":"pith_short_8","alias_value":"WPZYW6MT","created_at":"2026-07-05T01:02:50.477042+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":11,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.08707","citing_title":"Simulating quantum circuits with a neural statebank","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2605.27285","citing_title":"Basis-Adaptive Sparse-State Simulation of Quantum Circuits","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2606.01291","citing_title":"Quantum Algorithm for Distributed Reduction of Entanglements (QADR): A Trainable and Simulation-Efficient QML Framework","ref_index":144,"is_internal_anchor":false},{"citing_arxiv_id":"2503.15118","citing_title":"SparQSim: Simulating Scalable Quantum Algorithms via Sparse Quantum State Representations","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2604.27058","citing_title":"Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2510.02725","citing_title":"Congestion bounds via Laplacian eigenvalues and their application to tensor networks with arbitrary geometry","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2604.27058","citing_title":"Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2604.25532","citing_title":"Bond-dimension scaling of a local-refinement advantage over hyperoptimized tensor-network contraction on Sycamore like topologies","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19889","citing_title":"Quantum-to-Classical Computability Transition via Negative Markov Chains","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05036","citing_title":"Efficient simulation of noisy IQP circuits with amplitude-damping noise","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19625","citing_title":"Coherent-State Propagation: A Computational Framework for Simulating Bosonic Quantum Systems","ref_index":219,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WPZYW6MTTAC354GNULXGGF7DRX","json":"https://pith.science/pith/WPZYW6MTTAC354GNULXGGF7DRX.json","graph_json":"https://pith.science/api/pith-number/WPZYW6MTTAC354GNULXGGF7DRX/graph.json","events_json":"https://pith.science/api/pith-number/WPZYW6MTTAC354GNULXGGF7DRX/events.json","paper":"https://pith.science/paper/WPZYW6MT"},"agent_actions":{"view_html":"https://pith.science/pith/WPZYW6MTTAC354GNULXGGF7DRX","download_json":"https://pith.science/pith/WPZYW6MTTAC354GNULXGGF7DRX.json","view_paper":"https://pith.science/paper/WPZYW6MT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.06787&json=true","fetch_graph":"https://pith.science/api/pith-number/WPZYW6MTTAC354GNULXGGF7DRX/graph.json","fetch_events":"https://pith.science/api/pith-number/WPZYW6MTTAC354GNULXGGF7DRX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WPZYW6MTTAC354GNULXGGF7DRX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WPZYW6MTTAC354GNULXGGF7DRX/action/storage_attestation","attest_author":"https://pith.science/pith/WPZYW6MTTAC354GNULXGGF7DRX/action/author_attestation","sign_citation":"https://pith.science/pith/WPZYW6MTTAC354GNULXGGF7DRX/action/citation_signature","submit_replication":"https://pith.science/pith/WPZYW6MTTAC354GNULXGGF7DRX/action/replication_record"}},"created_at":"2026-07-05T01:02:50.477042+00:00","updated_at":"2026-07-05T01:02:50.477042+00:00"}