{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:A5WBZPBS6Y45HOAJC5KNFNOSOA","short_pith_number":"pith:A5WBZPBS","schema_version":"1.0","canonical_sha256":"076c1cbc32f639d3b8091754d2b5d2703909ec10e79bb0069ddddbb1b5235ea9","source":{"kind":"arxiv","id":"2406.02501","version":3},"attestation_state":"computed","paper":{"title":"The computational power of random quantum circuits in arbitrary geometries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aaron Hankin, Alex Hall, Azure Hansen, Brian Mathewson, Brian Neyenhuis, Bruce G. Tiemann, Cameron Foltz, Charles H. Baldwin, Christopher N. Gilbreth, Conrad Roman, Craig Holliman, Curtis Volin, Dan Gresh, Danylo Lykov, Davide DelVento, David Hayes, Dominic Lucchetti, Eli Chertkov, Elliot Lehman, Enrico Rinaldi, Ian Hoffman, Ivaylo S. Madjarov, Jacob Johansen, James Walker, Joan M. Dreiling, Johnnie Gray, John P. Bartolotta, John P. Gaebler, Jonhas Colina, Joshua Giles, Juan M. Pino, Julia Cline, Karl Mayer, Marco Pistoia, Matthew Bohn, Matthew DeCross, Michael Foss-Feig, Michael Mills, Michael Schecter, Minzhao Liu, Nathan Hewitt, Patricia J. Lee, Peter E. Siegfried, Pradeep Niroula, Reza Haghshenas, Ross B. Hutson, Ruslan Shaydulin, Russell P. Stutz, Steven. A. Moses, Thomas M. Gatterman, Trent Jacobs, Yuri Alexeev","submitted_at":"2024-06-04T17:20:30Z","abstract_excerpt":"Empirical evidence for a gap between the computational powers of classical and quantum computers has been provided by experiments that sample the output distributions of two-dimensional quantum circuits. Many attempts to close this gap have utilized classical simulations based on tensor network techniques, and their limitations shed light on the improvements to quantum hardware required to frustrate classical simulability. In particular, quantum computers having in excess of $\\sim 50$ qubits are primarily vulnerable to classical simulation due to restrictions on their gate fidelity and their c"},"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":"2406.02501","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-06-04T17:20:30Z","cross_cats_sorted":[],"title_canon_sha256":"338537c2cb33f595336442a05c8974530d4cbe96f68392255a8a10329a6b543a","abstract_canon_sha256":"e4c4ba3e15804c27821012f0289d80edd7d5ea482738aa6a8573e150c432ad96"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:02:38.843691Z","signature_b64":"kw9qBiWXETfjCo11al1j1Mpls/R6sIqw6o9FXO0zwhyJrxQl6r2zBOWdmbY0QCIhqSI63s9r30+3TeiYM3ImCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"076c1cbc32f639d3b8091754d2b5d2703909ec10e79bb0069ddddbb1b5235ea9","last_reissued_at":"2026-07-05T11:02:38.843193Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:02:38.843193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The computational power of random quantum circuits in arbitrary geometries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aaron Hankin, Alex Hall, Azure Hansen, Brian Mathewson, Brian Neyenhuis, Bruce G. Tiemann, Cameron Foltz, Charles H. Baldwin, Christopher N. Gilbreth, Conrad Roman, Craig Holliman, Curtis Volin, Dan Gresh, Danylo Lykov, Davide DelVento, David Hayes, Dominic Lucchetti, Eli Chertkov, Elliot Lehman, Enrico Rinaldi, Ian Hoffman, Ivaylo S. Madjarov, Jacob Johansen, James Walker, Joan M. Dreiling, Johnnie Gray, John P. Bartolotta, John P. Gaebler, Jonhas Colina, Joshua Giles, Juan M. Pino, Julia Cline, Karl Mayer, Marco Pistoia, Matthew Bohn, Matthew DeCross, Michael Foss-Feig, Michael Mills, Michael Schecter, Minzhao Liu, Nathan Hewitt, Patricia J. Lee, Peter E. Siegfried, Pradeep Niroula, Reza Haghshenas, Ross B. Hutson, Ruslan Shaydulin, Russell P. Stutz, Steven. A. Moses, Thomas M. Gatterman, Trent Jacobs, Yuri Alexeev","submitted_at":"2024-06-04T17:20:30Z","abstract_excerpt":"Empirical evidence for a gap between the computational powers of classical and quantum computers has been provided by experiments that sample the output distributions of two-dimensional quantum circuits. Many attempts to close this gap have utilized classical simulations based on tensor network techniques, and their limitations shed light on the improvements to quantum hardware required to frustrate classical simulability. In particular, quantum computers having in excess of $\\sim 50$ qubits are primarily vulnerable to classical simulation due to restrictions on their gate fidelity and their c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.02501","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/2406.02501/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":"2406.02501","created_at":"2026-07-05T11:02:38.843248+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.02501v3","created_at":"2026-07-05T11:02:38.843248+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.02501","created_at":"2026-07-05T11:02:38.843248+00:00"},{"alias_kind":"pith_short_12","alias_value":"A5WBZPBS6Y45","created_at":"2026-07-05T11:02:38.843248+00:00"},{"alias_kind":"pith_short_16","alias_value":"A5WBZPBS6Y45HOAJ","created_at":"2026-07-05T11:02:38.843248+00:00"},{"alias_kind":"pith_short_8","alias_value":"A5WBZPBS","created_at":"2026-07-05T11:02:38.843248+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.22909","citing_title":"Sample-efficient benchmarking of shallow all-to-all random quantum circuits","ref_index":82,"is_internal_anchor":false},{"citing_arxiv_id":"2501.12470","citing_title":"Efficient Compilation for Shuttling Trapped-Ion Machines via the Position Graph Architectural Abstraction","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2502.06961","citing_title":"Fully optimised variational simulation of a dynamical quantum phase transition on a trapped-ion quantum computer","ref_index":53,"is_internal_anchor":false},{"citing_arxiv_id":"2504.21172","citing_title":"Iceberg Beyond the Tip: Co-Compilation of a Quantum Error Detection Code and a Quantum Algorithm","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2506.11552","citing_title":"Learning Encodings by Maximizing State Distinguishability: Variational Quantum Error Correction","ref_index":31,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A5WBZPBS6Y45HOAJC5KNFNOSOA","json":"https://pith.science/pith/A5WBZPBS6Y45HOAJC5KNFNOSOA.json","graph_json":"https://pith.science/api/pith-number/A5WBZPBS6Y45HOAJC5KNFNOSOA/graph.json","events_json":"https://pith.science/api/pith-number/A5WBZPBS6Y45HOAJC5KNFNOSOA/events.json","paper":"https://pith.science/paper/A5WBZPBS"},"agent_actions":{"view_html":"https://pith.science/pith/A5WBZPBS6Y45HOAJC5KNFNOSOA","download_json":"https://pith.science/pith/A5WBZPBS6Y45HOAJC5KNFNOSOA.json","view_paper":"https://pith.science/paper/A5WBZPBS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.02501&json=true","fetch_graph":"https://pith.science/api/pith-number/A5WBZPBS6Y45HOAJC5KNFNOSOA/graph.json","fetch_events":"https://pith.science/api/pith-number/A5WBZPBS6Y45HOAJC5KNFNOSOA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A5WBZPBS6Y45HOAJC5KNFNOSOA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A5WBZPBS6Y45HOAJC5KNFNOSOA/action/storage_attestation","attest_author":"https://pith.science/pith/A5WBZPBS6Y45HOAJC5KNFNOSOA/action/author_attestation","sign_citation":"https://pith.science/pith/A5WBZPBS6Y45HOAJC5KNFNOSOA/action/citation_signature","submit_replication":"https://pith.science/pith/A5WBZPBS6Y45HOAJC5KNFNOSOA/action/replication_record"}},"created_at":"2026-07-05T11:02:38.843248+00:00","updated_at":"2026-07-05T11:02:38.843248+00:00"}