{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FNXMRN665JW4OB7XHRHVTJTXP7","short_pith_number":"pith:FNXMRN66","schema_version":"1.0","canonical_sha256":"2b6ec8b7deea6dc707f73c4f59a6777fe53c9a90353dafe7b0050a391d639648","source":{"kind":"arxiv","id":"2407.07754","version":2},"attestation_state":"computed","paper":{"title":"Random unitaries in extremely low depth","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.str-el","cs.CC","cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Hsin-Yuan Huang, Jonas Haferkamp, Thomas Schuster","submitted_at":"2024-07-10T15:27:48Z","abstract_excerpt":"We prove that random quantum circuits on any geometry, including a 1D line, can form approximate unitary designs over $n$ qubits in $\\log n$ depth. In a similar manner, we construct pseudorandom unitaries (PRUs) in 1D circuits in $\\text{poly}(\\log n)$ depth, and in all-to-all-connected circuits in $\\text{poly}(\\log \\log n)$ depth. In all three cases, the $n$ dependence is optimal and improves exponentially over known results. These shallow quantum circuits have low complexity and create only short-range entanglement, yet are indistinguishable from unitaries with exponential complexity. Our con"},"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":"2407.07754","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-07-10T15:27:48Z","cross_cats_sorted":["cond-mat.str-el","cs.CC","cs.IT","math.IT"],"title_canon_sha256":"983d6d95a951127a2443f6e1f873b458c02fdd73d8ae23e032eb9ef896cb0499","abstract_canon_sha256":"0a720f1b8760224e6e834b4834bbed638c2555fc080a13a1ff96d2115c0397ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:56:52.979910Z","signature_b64":"d7ysTrIm3KHn/xDFHmQd2j9XGPFIE38X+pTDV7YFQpMqwQIsKplIdHkE6f6dv9lHueh4pP48pmPRkvyqJe+tDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b6ec8b7deea6dc707f73c4f59a6777fe53c9a90353dafe7b0050a391d639648","last_reissued_at":"2026-07-05T09:56:52.979474Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:56:52.979474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random unitaries in extremely low depth","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.str-el","cs.CC","cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Hsin-Yuan Huang, Jonas Haferkamp, Thomas Schuster","submitted_at":"2024-07-10T15:27:48Z","abstract_excerpt":"We prove that random quantum circuits on any geometry, including a 1D line, can form approximate unitary designs over $n$ qubits in $\\log n$ depth. In a similar manner, we construct pseudorandom unitaries (PRUs) in 1D circuits in $\\text{poly}(\\log n)$ depth, and in all-to-all-connected circuits in $\\text{poly}(\\log \\log n)$ depth. In all three cases, the $n$ dependence is optimal and improves exponentially over known results. These shallow quantum circuits have low complexity and create only short-range entanglement, yet are indistinguishable from unitaries with exponential complexity. Our con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.07754","kind":"arxiv","version":2},"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/2407.07754/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":"2407.07754","created_at":"2026-07-05T09:56:52.979534+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.07754v2","created_at":"2026-07-05T09:56:52.979534+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.07754","created_at":"2026-07-05T09:56:52.979534+00:00"},{"alias_kind":"pith_short_12","alias_value":"FNXMRN665JW4","created_at":"2026-07-05T09:56:52.979534+00:00"},{"alias_kind":"pith_short_16","alias_value":"FNXMRN665JW4OB7X","created_at":"2026-07-05T09:56:52.979534+00:00"},{"alias_kind":"pith_short_8","alias_value":"FNXMRN66","created_at":"2026-07-05T09:56:52.979534+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":8,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07556","citing_title":"Entanglement Asymmetry in Random Quantum Automata","ref_index":35,"is_internal_anchor":true},{"citing_arxiv_id":"2410.16220","citing_title":"Sample Optimal and Memory Efficient Quantum State Tomography","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2408.12739","citing_title":"Quantum Convolutional Neural Networks are Effectively Classically Simulable","ref_index":108,"is_internal_anchor":false},{"citing_arxiv_id":"2504.01936","citing_title":"Fermionic Averaged Circuit Eigenvalue Sampling","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2504.18098","citing_title":"Efficient witnessing and testing of magic in mixed quantum states","ref_index":69,"is_internal_anchor":false},{"citing_arxiv_id":"2505.10110","citing_title":"Non-Clifford Cost of Random Unitaries","ref_index":61,"is_internal_anchor":false},{"citing_arxiv_id":"2604.10122","citing_title":"Unitary Designs from Two Chaotic Hamiltonians and a Random Pauli Operation","ref_index":38,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15258","citing_title":"General framework for anticoncentration and linear cross-entropy benchmarking in photonic quantum advantage experiments","ref_index":71,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FNXMRN665JW4OB7XHRHVTJTXP7","json":"https://pith.science/pith/FNXMRN665JW4OB7XHRHVTJTXP7.json","graph_json":"https://pith.science/api/pith-number/FNXMRN665JW4OB7XHRHVTJTXP7/graph.json","events_json":"https://pith.science/api/pith-number/FNXMRN665JW4OB7XHRHVTJTXP7/events.json","paper":"https://pith.science/paper/FNXMRN66"},"agent_actions":{"view_html":"https://pith.science/pith/FNXMRN665JW4OB7XHRHVTJTXP7","download_json":"https://pith.science/pith/FNXMRN665JW4OB7XHRHVTJTXP7.json","view_paper":"https://pith.science/paper/FNXMRN66","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.07754&json=true","fetch_graph":"https://pith.science/api/pith-number/FNXMRN665JW4OB7XHRHVTJTXP7/graph.json","fetch_events":"https://pith.science/api/pith-number/FNXMRN665JW4OB7XHRHVTJTXP7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FNXMRN665JW4OB7XHRHVTJTXP7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FNXMRN665JW4OB7XHRHVTJTXP7/action/storage_attestation","attest_author":"https://pith.science/pith/FNXMRN665JW4OB7XHRHVTJTXP7/action/author_attestation","sign_citation":"https://pith.science/pith/FNXMRN665JW4OB7XHRHVTJTXP7/action/citation_signature","submit_replication":"https://pith.science/pith/FNXMRN665JW4OB7XHRHVTJTXP7/action/replication_record"}},"created_at":"2026-07-05T09:56:52.979534+00:00","updated_at":"2026-07-05T09:56:52.979534+00:00"}