{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4TL2PZU2Z6XAKC5WK46KM27AE7","short_pith_number":"pith:4TL2PZU2","schema_version":"1.0","canonical_sha256":"e4d7a7e69acfae050bb6573ca66be027c44ef1d2c1da4e51b166fffc2e2aa567","source":{"kind":"arxiv","id":"2501.13050","version":1},"attestation_state":"computed","paper":{"title":"Efficient simulation of parametrized quantum circuits under non-unital noise through Pauli backpropagation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Armando Angrisani, Daniel Stilck Fran\\c{c}a, Ekaterina Pankovets, Omar Fawzi, Victor Martinez","submitted_at":"2025-01-22T17:58:59Z","abstract_excerpt":"As quantum devices continue to grow in size but remain affected by noise, it is crucial to determine when and how they can outperform classical computers on practical tasks. A central piece in this effort is to develop the most efficient classical simulation algorithms possible. Among the most promising approaches are Pauli backpropagation algorithms, which have already demonstrated their ability to efficiently simulate certain classes of parameterized quantum circuits-a leading contender for near-term quantum advantage-under random circuit assumptions and depolarizing noise. However, their ef"},"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":"2501.13050","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-01-22T17:58:59Z","cross_cats_sorted":["cs.CC","math-ph","math.MP"],"title_canon_sha256":"8fc822b3520e901c410032a6500e6b1dd35fea856c14c96e84c3bdf7848b7842","abstract_canon_sha256":"1b767a07302fc0c4836fea62385e95148735fe86335cfec66d302a0f354df996"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:57:34.087357Z","signature_b64":"vePnSGkZL4lxIhgzyAo+/ShmzC3ILgVSnRRtp3LOIGxudpx9B/sZtw3XlE/fGly4/wZAiphAZOmYImLsNV2dBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4d7a7e69acfae050bb6573ca66be027c44ef1d2c1da4e51b166fffc2e2aa567","last_reissued_at":"2026-07-05T11:57:34.086893Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:57:34.086893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient simulation of parametrized quantum circuits under non-unital noise through Pauli backpropagation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Armando Angrisani, Daniel Stilck Fran\\c{c}a, Ekaterina Pankovets, Omar Fawzi, Victor Martinez","submitted_at":"2025-01-22T17:58:59Z","abstract_excerpt":"As quantum devices continue to grow in size but remain affected by noise, it is crucial to determine when and how they can outperform classical computers on practical tasks. A central piece in this effort is to develop the most efficient classical simulation algorithms possible. Among the most promising approaches are Pauli backpropagation algorithms, which have already demonstrated their ability to efficiently simulate certain classes of parameterized quantum circuits-a leading contender for near-term quantum advantage-under random circuit assumptions and depolarizing noise. However, their ef"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.13050","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/2501.13050/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":"2501.13050","created_at":"2026-07-05T11:57:34.086950+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.13050v1","created_at":"2026-07-05T11:57:34.086950+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.13050","created_at":"2026-07-05T11:57:34.086950+00:00"},{"alias_kind":"pith_short_12","alias_value":"4TL2PZU2Z6XA","created_at":"2026-07-05T11:57:34.086950+00:00"},{"alias_kind":"pith_short_16","alias_value":"4TL2PZU2Z6XAKC5W","created_at":"2026-07-05T11:57:34.086950+00:00"},{"alias_kind":"pith_short_8","alias_value":"4TL2PZU2","created_at":"2026-07-05T11:57:34.086950+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.02064","citing_title":"Quantitative Universal Approximation for Noisy Quantum Neural Networks","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2604.02064","citing_title":"Quantitative Universal Approximation for Noisy Quantum Neural Networks","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4TL2PZU2Z6XAKC5WK46KM27AE7","json":"https://pith.science/pith/4TL2PZU2Z6XAKC5WK46KM27AE7.json","graph_json":"https://pith.science/api/pith-number/4TL2PZU2Z6XAKC5WK46KM27AE7/graph.json","events_json":"https://pith.science/api/pith-number/4TL2PZU2Z6XAKC5WK46KM27AE7/events.json","paper":"https://pith.science/paper/4TL2PZU2"},"agent_actions":{"view_html":"https://pith.science/pith/4TL2PZU2Z6XAKC5WK46KM27AE7","download_json":"https://pith.science/pith/4TL2PZU2Z6XAKC5WK46KM27AE7.json","view_paper":"https://pith.science/paper/4TL2PZU2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.13050&json=true","fetch_graph":"https://pith.science/api/pith-number/4TL2PZU2Z6XAKC5WK46KM27AE7/graph.json","fetch_events":"https://pith.science/api/pith-number/4TL2PZU2Z6XAKC5WK46KM27AE7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4TL2PZU2Z6XAKC5WK46KM27AE7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4TL2PZU2Z6XAKC5WK46KM27AE7/action/storage_attestation","attest_author":"https://pith.science/pith/4TL2PZU2Z6XAKC5WK46KM27AE7/action/author_attestation","sign_citation":"https://pith.science/pith/4TL2PZU2Z6XAKC5WK46KM27AE7/action/citation_signature","submit_replication":"https://pith.science/pith/4TL2PZU2Z6XAKC5WK46KM27AE7/action/replication_record"}},"created_at":"2026-07-05T11:57:34.086950+00:00","updated_at":"2026-07-05T11:57:34.086950+00:00"}