{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TNC2U4TXMLWMR36OTOGXFZJ5WI","short_pith_number":"pith:TNC2U4TX","schema_version":"1.0","canonical_sha256":"9b45aa727762ecc8efce9b8d72e53db2199e5aab6fe85beeb9d691123fb879f5","source":{"kind":"arxiv","id":"2411.04169","version":1},"attestation_state":"computed","paper":{"title":"On the complexity of sampling from shallow Brownian circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"quant-ph","authors_text":"Bill Fefferman, Gregory Bentsen, Michael J. Gullans, Soumik Ghosh, Yinchen Liu","submitted_at":"2024-11-06T19:00:00Z","abstract_excerpt":"While many statistical properties of deep random quantum circuits can be deduced, often rigorously and other times heuristically, by an approximation to global Haar-random unitaries, the statistics of constant-depth random quantum circuits are generally less well-understood due to a lack of amenable tools and techniques. We circumvent this barrier by considering a related constant-time Brownian circuit model which shares many similarities with constant-depth random quantum circuits but crucially allows for direct calculations of higher order moments of its output distribution. Using mean-field"},"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":"2411.04169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-11-06T19:00:00Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"0a8252915172d18b65e32037ff282972e7b3350239e62c055ac2cc198f861880","abstract_canon_sha256":"ce99c6f7464ec25d684e4691c1df84e321db101b1e979b52258b054942e4e27b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:32:15.333907Z","signature_b64":"SxVct22MgjppepAGUKHVvs7qen0Cq9HbJOFNTeq8ry1iD1xZddDM9pcyrHZqAU0N6Vi4hXZp04Y7ozF2pdCKAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b45aa727762ecc8efce9b8d72e53db2199e5aab6fe85beeb9d691123fb879f5","last_reissued_at":"2026-07-05T09:32:15.333482Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:32:15.333482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the complexity of sampling from shallow Brownian circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"quant-ph","authors_text":"Bill Fefferman, Gregory Bentsen, Michael J. Gullans, Soumik Ghosh, Yinchen Liu","submitted_at":"2024-11-06T19:00:00Z","abstract_excerpt":"While many statistical properties of deep random quantum circuits can be deduced, often rigorously and other times heuristically, by an approximation to global Haar-random unitaries, the statistics of constant-depth random quantum circuits are generally less well-understood due to a lack of amenable tools and techniques. We circumvent this barrier by considering a related constant-time Brownian circuit model which shares many similarities with constant-depth random quantum circuits but crucially allows for direct calculations of higher order moments of its output distribution. Using mean-field"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.04169","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/2411.04169/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":"2411.04169","created_at":"2026-07-05T09:32:15.333536+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.04169v1","created_at":"2026-07-05T09:32:15.333536+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.04169","created_at":"2026-07-05T09:32:15.333536+00:00"},{"alias_kind":"pith_short_12","alias_value":"TNC2U4TXMLWM","created_at":"2026-07-05T09:32:15.333536+00:00"},{"alias_kind":"pith_short_16","alias_value":"TNC2U4TXMLWMR36O","created_at":"2026-07-05T09:32:15.333536+00:00"},{"alias_kind":"pith_short_8","alias_value":"TNC2U4TX","created_at":"2026-07-05T09:32:15.333536+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"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":72,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TNC2U4TXMLWMR36OTOGXFZJ5WI","json":"https://pith.science/pith/TNC2U4TXMLWMR36OTOGXFZJ5WI.json","graph_json":"https://pith.science/api/pith-number/TNC2U4TXMLWMR36OTOGXFZJ5WI/graph.json","events_json":"https://pith.science/api/pith-number/TNC2U4TXMLWMR36OTOGXFZJ5WI/events.json","paper":"https://pith.science/paper/TNC2U4TX"},"agent_actions":{"view_html":"https://pith.science/pith/TNC2U4TXMLWMR36OTOGXFZJ5WI","download_json":"https://pith.science/pith/TNC2U4TXMLWMR36OTOGXFZJ5WI.json","view_paper":"https://pith.science/paper/TNC2U4TX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.04169&json=true","fetch_graph":"https://pith.science/api/pith-number/TNC2U4TXMLWMR36OTOGXFZJ5WI/graph.json","fetch_events":"https://pith.science/api/pith-number/TNC2U4TXMLWMR36OTOGXFZJ5WI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TNC2U4TXMLWMR36OTOGXFZJ5WI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TNC2U4TXMLWMR36OTOGXFZJ5WI/action/storage_attestation","attest_author":"https://pith.science/pith/TNC2U4TXMLWMR36OTOGXFZJ5WI/action/author_attestation","sign_citation":"https://pith.science/pith/TNC2U4TXMLWMR36OTOGXFZJ5WI/action/citation_signature","submit_replication":"https://pith.science/pith/TNC2U4TXMLWMR36OTOGXFZJ5WI/action/replication_record"}},"created_at":"2026-07-05T09:32:15.333536+00:00","updated_at":"2026-07-05T09:32:15.333536+00:00"}