{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:65SK6KYJ2PU4PMBTL26VYOVQMM","short_pith_number":"pith:65SK6KYJ","schema_version":"1.0","canonical_sha256":"f764af2b09d3e9c7b0335ebd5c3ab0633ea849ceac29bfac94fa2696a9605efc","source":{"kind":"arxiv","id":"1807.10749","version":3},"attestation_state":"computed","paper":{"title":"Quantum Supremacy Is Both Closer and Farther than It Appears","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.ET"],"primary_cat":"quant-ph","authors_text":"Aneeqa Fatima, Igor L. Markov, Sergei V. Isakov, Sergio Boixo","submitted_at":"2018-07-27T17:58:05Z","abstract_excerpt":"As quantum computers improve in the number of qubits and fidelity, the question of when they surpass state-of-the-art classical computation for a well-defined computational task is attracting much attention. The leading candidate task for this milestone entails sampling from the output distribution defined by a random quantum circuit. We develop a massively-parallel simulation tool Rollright that does not require inter-process communication (IPC) or proprietary hardware. We also develop two ways to trade circuit fidelity for computational speedups, so as to match the fidelity of a given quantu"},"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":"1807.10749","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-07-27T17:58:05Z","cross_cats_sorted":["cs.DC","cs.ET"],"title_canon_sha256":"cd6c9fda2c3b3577c253218b807751dfe3dd6d0e211d5b50b505d0692b03dfd1","abstract_canon_sha256":"a46d90fe6d655d7fa81fa56022cae5be708f1edcf49ed48cdfa71f499821574f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:04:01.895014Z","signature_b64":"uOSbtdKmYUMkus+E2D53j+zMi/YNDm2nHz1fxAcDG4uUD3r3o/mItpQ0V+UuTb6cCLIEl7EVincqwjsN8dafDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f764af2b09d3e9c7b0335ebd5c3ab0633ea849ceac29bfac94fa2696a9605efc","last_reissued_at":"2026-07-05T02:04:01.894590Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:04:01.894590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Supremacy Is Both Closer and Farther than It Appears","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.ET"],"primary_cat":"quant-ph","authors_text":"Aneeqa Fatima, Igor L. Markov, Sergei V. Isakov, Sergio Boixo","submitted_at":"2018-07-27T17:58:05Z","abstract_excerpt":"As quantum computers improve in the number of qubits and fidelity, the question of when they surpass state-of-the-art classical computation for a well-defined computational task is attracting much attention. The leading candidate task for this milestone entails sampling from the output distribution defined by a random quantum circuit. We develop a massively-parallel simulation tool Rollright that does not require inter-process communication (IPC) or proprietary hardware. We also develop two ways to trade circuit fidelity for computational speedups, so as to match the fidelity of a given quantu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.10749","kind":"arxiv","version":3},"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/1807.10749/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":"1807.10749","created_at":"2026-07-05T02:04:01.894647+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.10749v3","created_at":"2026-07-05T02:04:01.894647+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10749","created_at":"2026-07-05T02:04:01.894647+00:00"},{"alias_kind":"pith_short_12","alias_value":"65SK6KYJ2PU4","created_at":"2026-07-05T02:04:01.894647+00:00"},{"alias_kind":"pith_short_16","alias_value":"65SK6KYJ2PU4PMBT","created_at":"2026-07-05T02:04:01.894647+00:00"},{"alias_kind":"pith_short_8","alias_value":"65SK6KYJ","created_at":"2026-07-05T02:04:01.894647+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2503.15118","citing_title":"SparQSim: Simulating Scalable Quantum Algorithms via Sparse Quantum State Representations","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24694","citing_title":"Encoding strategies for quantum enhanced fluid simulations: opportunities and challenges","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2604.12256","citing_title":"Large-Scale Quantum Circuit Simulation on HPC Cluster via Cache Blocking, Boosting, and Gate Fusion Optimization","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05036","citing_title":"Efficient simulation of noisy IQP circuits with amplitude-damping noise","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/65SK6KYJ2PU4PMBTL26VYOVQMM","json":"https://pith.science/pith/65SK6KYJ2PU4PMBTL26VYOVQMM.json","graph_json":"https://pith.science/api/pith-number/65SK6KYJ2PU4PMBTL26VYOVQMM/graph.json","events_json":"https://pith.science/api/pith-number/65SK6KYJ2PU4PMBTL26VYOVQMM/events.json","paper":"https://pith.science/paper/65SK6KYJ"},"agent_actions":{"view_html":"https://pith.science/pith/65SK6KYJ2PU4PMBTL26VYOVQMM","download_json":"https://pith.science/pith/65SK6KYJ2PU4PMBTL26VYOVQMM.json","view_paper":"https://pith.science/paper/65SK6KYJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.10749&json=true","fetch_graph":"https://pith.science/api/pith-number/65SK6KYJ2PU4PMBTL26VYOVQMM/graph.json","fetch_events":"https://pith.science/api/pith-number/65SK6KYJ2PU4PMBTL26VYOVQMM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/65SK6KYJ2PU4PMBTL26VYOVQMM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/65SK6KYJ2PU4PMBTL26VYOVQMM/action/storage_attestation","attest_author":"https://pith.science/pith/65SK6KYJ2PU4PMBTL26VYOVQMM/action/author_attestation","sign_citation":"https://pith.science/pith/65SK6KYJ2PU4PMBTL26VYOVQMM/action/citation_signature","submit_replication":"https://pith.science/pith/65SK6KYJ2PU4PMBTL26VYOVQMM/action/replication_record"}},"created_at":"2026-07-05T02:04:01.894647+00:00","updated_at":"2026-07-05T02:04:01.894647+00:00"}