{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:S3V5EXICFDXQTMDDF2QONJL4WV","short_pith_number":"pith:S3V5EXIC","schema_version":"1.0","canonical_sha256":"96ebd25d0228ef09b0632ea0e6a57cb5558c19087d57c25de64d97e3b24856f6","source":{"kind":"arxiv","id":"2505.21606","version":2},"attestation_state":"computed","paper":{"title":"Pauli Propagation: A Computational Framework for Simulating Quantum Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.other"],"primary_cat":"quant-ph","authors_text":"Armando Angrisani, Manuel S. Rudolph, Tyson Jones, Yanting Teng, Zo\\\"e Holmes","submitted_at":"2025-05-27T17:52:57Z","abstract_excerpt":"Classical methods to simulate quantum systems are not only a key element of the physicist's toolkit for studying many-body models but are also increasingly important for verifying and challenging upcoming quantum computers. Pauli propagation has recently emerged as a promising new family of classical algorithms for simulating digital quantum systems. Here we provide a comprehensive account of Pauli propagation, tracing its algorithmic structure from its bit-level implementation and formulation as a tree-search problem, all the way to its high-level user applications for simulating quantum circ"},"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":"2505.21606","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-05-27T17:52:57Z","cross_cats_sorted":["cond-mat.other"],"title_canon_sha256":"510c2e4f17bb791593ac6e1b234725e919c7b232219e133fc39081778e98cf3e","abstract_canon_sha256":"26b881c4e7056c31c8861e83407cf1d44f745645ff06c4583dc37122b75605c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:03:31.692414Z","signature_b64":"or6Nw3w2ntMluwstbl6DKR3sJdayziKsTkzlw1tYytCD/FSKEABbld4cV5QR4FkYc2GgQOSmmfSb6SC8I/DdAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96ebd25d0228ef09b0632ea0e6a57cb5558c19087d57c25de64d97e3b24856f6","last_reissued_at":"2026-06-02T01:03:31.691899Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:03:31.691899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pauli Propagation: A Computational Framework for Simulating Quantum Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.other"],"primary_cat":"quant-ph","authors_text":"Armando Angrisani, Manuel S. Rudolph, Tyson Jones, Yanting Teng, Zo\\\"e Holmes","submitted_at":"2025-05-27T17:52:57Z","abstract_excerpt":"Classical methods to simulate quantum systems are not only a key element of the physicist's toolkit for studying many-body models but are also increasingly important for verifying and challenging upcoming quantum computers. Pauli propagation has recently emerged as a promising new family of classical algorithms for simulating digital quantum systems. Here we provide a comprehensive account of Pauli propagation, tracing its algorithmic structure from its bit-level implementation and formulation as a tree-search problem, all the way to its high-level user applications for simulating quantum circ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.21606","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/2505.21606/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":"2505.21606","created_at":"2026-06-02T01:03:31.691961+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.21606v2","created_at":"2026-06-02T01:03:31.691961+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.21606","created_at":"2026-06-02T01:03:31.691961+00:00"},{"alias_kind":"pith_short_12","alias_value":"S3V5EXICFDXQ","created_at":"2026-06-02T01:03:31.691961+00:00"},{"alias_kind":"pith_short_16","alias_value":"S3V5EXICFDXQTMDD","created_at":"2026-06-02T01:03:31.691961+00:00"},{"alias_kind":"pith_short_8","alias_value":"S3V5EXIC","created_at":"2026-06-02T01:03:31.691961+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":23,"internal_anchor_count":23,"sample":[{"citing_arxiv_id":"2604.02584","citing_title":"Fermionic mean-field dynamics for spin systems beyond free fermions","ref_index":103,"is_internal_anchor":true},{"citing_arxiv_id":"2605.23377","citing_title":"SAFE ma-QAOA: Surrogate-Assisted and Fine-Tuning Enhanced Multi-Angle QAOA with Parameter Distillation","ref_index":49,"is_internal_anchor":true},{"citing_arxiv_id":"2502.04271","citing_title":"Variational decision diagrams for quantum-inspired machine learning applications","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2503.24362","citing_title":"Recursion method for out-of-equilibrium many-body dynamics: strengths and limitations","ref_index":34,"is_internal_anchor":true},{"citing_arxiv_id":"2605.21447","citing_title":"Combining non-parametric quantum states and MERA tensor networks for ground-state optimization","ref_index":60,"is_internal_anchor":true},{"citing_arxiv_id":"2605.17067","citing_title":"Near-Optimal Quantum Time Evolution Circuits via Provably Convergent Compression","ref_index":55,"is_internal_anchor":true},{"citing_arxiv_id":"2605.18943","citing_title":"Noise-induced Simulability Transition from Operator Scrambling","ref_index":34,"is_internal_anchor":true},{"citing_arxiv_id":"2605.18985","citing_title":"Efficient Fourier-Based Linear Combination of Unitaries and Applications in Quantum Optimization","ref_index":60,"is_internal_anchor":true},{"citing_arxiv_id":"2411.10406","citing_title":"How to Build a Quantum Supercomputer: Scaling from Hundreds to Millions of Qubits","ref_index":58,"is_internal_anchor":true},{"citing_arxiv_id":"2509.13528","citing_title":"Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms","ref_index":99,"is_internal_anchor":true},{"citing_arxiv_id":"2601.02233","citing_title":"PauliEngine: High-Performant Symbolic Arithmetic for Quantum Operations","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2603.14670","citing_title":"Computing logical error thresholds with the Pauli Frame Sparse Representation","ref_index":85,"is_internal_anchor":true},{"citing_arxiv_id":"2603.24654","citing_title":"Spectral methods: crucial for machine learning, natural for quantum computers?","ref_index":109,"is_internal_anchor":true},{"citing_arxiv_id":"2604.02584","citing_title":"Fermionic mean-field dynamics for spin systems beyond free fermions","ref_index":103,"is_internal_anchor":true},{"citing_arxiv_id":"2605.04025","citing_title":"Fast, accurate, high-resolution simulation of large-scale Fermi-Hubbard models on a digital quantum processor","ref_index":32,"is_internal_anchor":true},{"citing_arxiv_id":"2604.27049","citing_title":"Non-Local Magic Resources for Fermionic Gaussian States","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"2605.04540","citing_title":"Hierarchical entanglement transitions and hidden area-law sectors in quantum many-body dynamics","ref_index":31,"is_internal_anchor":true},{"citing_arxiv_id":"2605.02995","citing_title":"Page Curve for Local-Operator Entanglement from Free Probability","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"2604.04778","citing_title":"QCommute: a tool for symbolic computation of nested commutators in quantum many-body spin-1/2 systems","ref_index":39,"is_internal_anchor":true},{"citing_arxiv_id":"2604.08467","citing_title":"Accelerating Quantum Tensor Network Simulations with Unified Path Variations and Non-Degenerate Batched Sampling","ref_index":18,"is_internal_anchor":true},{"citing_arxiv_id":"2604.17630","citing_title":"Randomized Subsystem Descent for Fermion-to-Qubit Mapping","ref_index":78,"is_internal_anchor":true},{"citing_arxiv_id":"2604.16701","citing_title":"Enabling Lie-Algebraic Classical Simulation beyond Free Fermions","ref_index":105,"is_internal_anchor":true},{"citing_arxiv_id":"2604.16720","citing_title":"Quantum many-body operator cascade as a route to chaos","ref_index":58,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S3V5EXICFDXQTMDDF2QONJL4WV","json":"https://pith.science/pith/S3V5EXICFDXQTMDDF2QONJL4WV.json","graph_json":"https://pith.science/api/pith-number/S3V5EXICFDXQTMDDF2QONJL4WV/graph.json","events_json":"https://pith.science/api/pith-number/S3V5EXICFDXQTMDDF2QONJL4WV/events.json","paper":"https://pith.science/paper/S3V5EXIC"},"agent_actions":{"view_html":"https://pith.science/pith/S3V5EXICFDXQTMDDF2QONJL4WV","download_json":"https://pith.science/pith/S3V5EXICFDXQTMDDF2QONJL4WV.json","view_paper":"https://pith.science/paper/S3V5EXIC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.21606&json=true","fetch_graph":"https://pith.science/api/pith-number/S3V5EXICFDXQTMDDF2QONJL4WV/graph.json","fetch_events":"https://pith.science/api/pith-number/S3V5EXICFDXQTMDDF2QONJL4WV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S3V5EXICFDXQTMDDF2QONJL4WV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S3V5EXICFDXQTMDDF2QONJL4WV/action/storage_attestation","attest_author":"https://pith.science/pith/S3V5EXICFDXQTMDDF2QONJL4WV/action/author_attestation","sign_citation":"https://pith.science/pith/S3V5EXICFDXQTMDDF2QONJL4WV/action/citation_signature","submit_replication":"https://pith.science/pith/S3V5EXICFDXQTMDDF2QONJL4WV/action/replication_record"}},"created_at":"2026-06-02T01:03:31.691961+00:00","updated_at":"2026-06-02T01:03:31.691961+00:00"}