{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:LHQMZYZ5L5BZMHM2VAW3LSKN6M","short_pith_number":"pith:LHQMZYZ5","schema_version":"1.0","canonical_sha256":"59e0cce33d5f43961d9aa82db5c94df32c89bf10c2bacd83d405f0fa7666e145","source":{"kind":"arxiv","id":"2411.04019","version":2},"attestation_state":"computed","paper":{"title":"Low-depth quantum symmetrization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew M. Childs, Daniel Gottesman, Zhenning Liu","submitted_at":"2024-11-06T16:00:46Z","abstract_excerpt":"Quantum symmetrization is the task of transforming a non-strictly increasing list of $n$ integers into an equal superposition of all permutations of the list (or more generally, performing this operation coherently on a superposition of such lists). This task plays a key role in initial state preparation for first-quantized simulations. Motivated by an application to fermionic systems, various algorithms have been proposed to solve a weaker version of symmetrization in which the input list is strictly increasing, but the general symmetrization problem with repetitions in the input list has not"},"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.04019","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-11-06T16:00:46Z","cross_cats_sorted":[],"title_canon_sha256":"c3c14a6ce883f33e975385c152535aa02ac4ab41e1f5b831dfa66ca276e18b77","abstract_canon_sha256":"3c88af09aaf113e7f72186fe58f1eeab5cc85315d72df74b856d77e6c835ce6b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:57:54.639085Z","signature_b64":"HpNIhFujJqO2QqLlhRXkz7I8EeOWQJK2C9xpg3euU1lrBxk5wiG4ySJy7sDmtnY9ngjuucXJqhy6uAmDlRJTBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59e0cce33d5f43961d9aa82db5c94df32c89bf10c2bacd83d405f0fa7666e145","last_reissued_at":"2026-07-05T10:57:54.638559Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:57:54.638559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-depth quantum symmetrization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew M. Childs, Daniel Gottesman, Zhenning Liu","submitted_at":"2024-11-06T16:00:46Z","abstract_excerpt":"Quantum symmetrization is the task of transforming a non-strictly increasing list of $n$ integers into an equal superposition of all permutations of the list (or more generally, performing this operation coherently on a superposition of such lists). This task plays a key role in initial state preparation for first-quantized simulations. Motivated by an application to fermionic systems, various algorithms have been proposed to solve a weaker version of symmetrization in which the input list is strictly increasing, but the general symmetrization problem with repetitions in the input list has not"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.04019","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/2411.04019/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.04019","created_at":"2026-07-05T10:57:54.638618+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.04019v2","created_at":"2026-07-05T10:57:54.638618+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.04019","created_at":"2026-07-05T10:57:54.638618+00:00"},{"alias_kind":"pith_short_12","alias_value":"LHQMZYZ5L5BZ","created_at":"2026-07-05T10:57:54.638618+00:00"},{"alias_kind":"pith_short_16","alias_value":"LHQMZYZ5L5BZMHM2","created_at":"2026-07-05T10:57:54.638618+00:00"},{"alias_kind":"pith_short_8","alias_value":"LHQMZYZ5","created_at":"2026-07-05T10:57:54.638618+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24659","citing_title":"Preparing multi-qudit states in a definite-weight subspace","ref_index":49,"is_internal_anchor":false},{"citing_arxiv_id":"2606.25029","citing_title":"Efficient Quantum Circuits for Coherent Conversion Between General First- and Second-Quantized Many-Body Representations","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2606.24659","citing_title":"Preparing multi-qudit states in a definite-weight subspace","ref_index":50,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03854","citing_title":"Space-Time Tradeoffs of Pauli-Based Computation in Distributed qLDPC Architectures","ref_index":86,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LHQMZYZ5L5BZMHM2VAW3LSKN6M","json":"https://pith.science/pith/LHQMZYZ5L5BZMHM2VAW3LSKN6M.json","graph_json":"https://pith.science/api/pith-number/LHQMZYZ5L5BZMHM2VAW3LSKN6M/graph.json","events_json":"https://pith.science/api/pith-number/LHQMZYZ5L5BZMHM2VAW3LSKN6M/events.json","paper":"https://pith.science/paper/LHQMZYZ5"},"agent_actions":{"view_html":"https://pith.science/pith/LHQMZYZ5L5BZMHM2VAW3LSKN6M","download_json":"https://pith.science/pith/LHQMZYZ5L5BZMHM2VAW3LSKN6M.json","view_paper":"https://pith.science/paper/LHQMZYZ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.04019&json=true","fetch_graph":"https://pith.science/api/pith-number/LHQMZYZ5L5BZMHM2VAW3LSKN6M/graph.json","fetch_events":"https://pith.science/api/pith-number/LHQMZYZ5L5BZMHM2VAW3LSKN6M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LHQMZYZ5L5BZMHM2VAW3LSKN6M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LHQMZYZ5L5BZMHM2VAW3LSKN6M/action/storage_attestation","attest_author":"https://pith.science/pith/LHQMZYZ5L5BZMHM2VAW3LSKN6M/action/author_attestation","sign_citation":"https://pith.science/pith/LHQMZYZ5L5BZMHM2VAW3LSKN6M/action/citation_signature","submit_replication":"https://pith.science/pith/LHQMZYZ5L5BZMHM2VAW3LSKN6M/action/replication_record"}},"created_at":"2026-07-05T10:57:54.638618+00:00","updated_at":"2026-07-05T10:57:54.638618+00:00"}