{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VCC5CXH5LRRG7UMVXQRDLJHDUJ","short_pith_number":"pith:VCC5CXH5","schema_version":"1.0","canonical_sha256":"a885d15cfd5c626fd195bc2235a4e3a24ab8105de3616c4a4e05b8e6f278f3a8","source":{"kind":"arxiv","id":"2506.16964","version":1},"attestation_state":"computed","paper":{"title":"Space-time tradeoff for sparse quantum state preparation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Guanzhong Li, Jingquan Luo, Lvzhou Li","submitted_at":"2025-06-20T12:52:05Z","abstract_excerpt":"In this work, we investigate the trade-off between the circuit depth and the number of ancillary qubits for preparing sparse quantum states. We prove that any $n$-qubit $d$-spare quantum state (i.e., it has only $d$ non-zero amplitudes) can be prepared by a quantum circuit with depth $O\\left(\\frac{nd \\log m}{m \\log m/n} + \\log nd\\right)$ using $m\\geq 6n$ ancillary qubits, which achieves the current best trade-off between depth and ancilla number. In particular, when $m = \\Theta({\\frac{nd}{\\log d}})$, our result recovers the optimal circuit depth $\\Theta(\\log nd)$ given in \\hyperlink{cite.zhang"},"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":"2506.16964","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-06-20T12:52:05Z","cross_cats_sorted":[],"title_canon_sha256":"139eaa4dd13bab414e9977068f2bc514e4d1b0b47799a380423ec23ddb165d6c","abstract_canon_sha256":"b9000247470b8e7f6cbef732d0c6a085ed089652cc2b11ce2745fe11fc002f57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:24:46.177556Z","signature_b64":"QJfzxx2g0oCbThpMZa/jl6AVhuH4qON1CoyIUbJP3kaE0m3VTshutOS1AGfjdGS3deUejoPnufKVVOFP4OubCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a885d15cfd5c626fd195bc2235a4e3a24ab8105de3616c4a4e05b8e6f278f3a8","last_reissued_at":"2026-07-05T11:24:46.177093Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:24:46.177093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Space-time tradeoff for sparse quantum state preparation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Guanzhong Li, Jingquan Luo, Lvzhou Li","submitted_at":"2025-06-20T12:52:05Z","abstract_excerpt":"In this work, we investigate the trade-off between the circuit depth and the number of ancillary qubits for preparing sparse quantum states. We prove that any $n$-qubit $d$-spare quantum state (i.e., it has only $d$ non-zero amplitudes) can be prepared by a quantum circuit with depth $O\\left(\\frac{nd \\log m}{m \\log m/n} + \\log nd\\right)$ using $m\\geq 6n$ ancillary qubits, which achieves the current best trade-off between depth and ancilla number. In particular, when $m = \\Theta({\\frac{nd}{\\log d}})$, our result recovers the optimal circuit depth $\\Theta(\\log nd)$ given in \\hyperlink{cite.zhang"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.16964","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/2506.16964/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":"2506.16964","created_at":"2026-07-05T11:24:46.177154+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.16964v1","created_at":"2026-07-05T11:24:46.177154+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.16964","created_at":"2026-07-05T11:24:46.177154+00:00"},{"alias_kind":"pith_short_12","alias_value":"VCC5CXH5LRRG","created_at":"2026-07-05T11:24:46.177154+00:00"},{"alias_kind":"pith_short_16","alias_value":"VCC5CXH5LRRG7UMV","created_at":"2026-07-05T11:24:46.177154+00:00"},{"alias_kind":"pith_short_8","alias_value":"VCC5CXH5","created_at":"2026-07-05T11:24:46.177154+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.17170","citing_title":"Advancing Quantum State Preparation Using Decision Diagram with Local Invertible Maps","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VCC5CXH5LRRG7UMVXQRDLJHDUJ","json":"https://pith.science/pith/VCC5CXH5LRRG7UMVXQRDLJHDUJ.json","graph_json":"https://pith.science/api/pith-number/VCC5CXH5LRRG7UMVXQRDLJHDUJ/graph.json","events_json":"https://pith.science/api/pith-number/VCC5CXH5LRRG7UMVXQRDLJHDUJ/events.json","paper":"https://pith.science/paper/VCC5CXH5"},"agent_actions":{"view_html":"https://pith.science/pith/VCC5CXH5LRRG7UMVXQRDLJHDUJ","download_json":"https://pith.science/pith/VCC5CXH5LRRG7UMVXQRDLJHDUJ.json","view_paper":"https://pith.science/paper/VCC5CXH5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.16964&json=true","fetch_graph":"https://pith.science/api/pith-number/VCC5CXH5LRRG7UMVXQRDLJHDUJ/graph.json","fetch_events":"https://pith.science/api/pith-number/VCC5CXH5LRRG7UMVXQRDLJHDUJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VCC5CXH5LRRG7UMVXQRDLJHDUJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VCC5CXH5LRRG7UMVXQRDLJHDUJ/action/storage_attestation","attest_author":"https://pith.science/pith/VCC5CXH5LRRG7UMVXQRDLJHDUJ/action/author_attestation","sign_citation":"https://pith.science/pith/VCC5CXH5LRRG7UMVXQRDLJHDUJ/action/citation_signature","submit_replication":"https://pith.science/pith/VCC5CXH5LRRG7UMVXQRDLJHDUJ/action/replication_record"}},"created_at":"2026-07-05T11:24:46.177154+00:00","updated_at":"2026-07-05T11:24:46.177154+00:00"}