{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:3B3NECMCU26JGCFB5JG3P7B26A","short_pith_number":"pith:3B3NECMC","schema_version":"1.0","canonical_sha256":"d876d20982a6bc9308a1ea4db7fc3af028f9cb7e7d138dda4626315bee6567cc","source":{"kind":"arxiv","id":"2201.11495","version":4},"attestation_state":"computed","paper":{"title":"Quantum State Preparation with Optimal Circuit Depth: Implementations and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Tongyang Li, Xiao-Ming Zhang, Xiao Yuan","submitted_at":"2022-01-27T13:16:30Z","abstract_excerpt":"Quantum state preparation is an important subroutine for quantum computing. We show that any $n$-qubit quantum state can be prepared with a $\\Theta(n)$-depth circuit using only single- and two-qubit gates, although with a cost of an exponential amount of ancillary qubits. On the other hand, for sparse quantum states with $d\\geqslant2$ non-zero entries, we can reduce the circuit depth to $\\Theta(\\log(nd))$ with $O(nd\\log d)$ ancillary qubits. The algorithm for sparse states is exponentially faster than best-known results and the number of ancillary qubits is nearly optimal and only increases po"},"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":"2201.11495","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-01-27T13:16:30Z","cross_cats_sorted":[],"title_canon_sha256":"d76bf5a91a307ab2e6e985739f4c052b022ded054ab49979bda77f98952ea6ce","abstract_canon_sha256":"152334f4958424b7d68ca00749b332a49e8095c985752febe76fa4bf1cb4fa40"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:03:22.742951Z","signature_b64":"OP0UiuU24h2apBqa55RUXZX9t82IHUXRWU2lYa4gt49Hre7t88axhKfFNjTCd0ustDdEXyKwBQ8MGICZK7jKCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d876d20982a6bc9308a1ea4db7fc3af028f9cb7e7d138dda4626315bee6567cc","last_reissued_at":"2026-07-05T06:03:22.742565Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:03:22.742565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum State Preparation with Optimal Circuit Depth: Implementations and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Tongyang Li, Xiao-Ming Zhang, Xiao Yuan","submitted_at":"2022-01-27T13:16:30Z","abstract_excerpt":"Quantum state preparation is an important subroutine for quantum computing. We show that any $n$-qubit quantum state can be prepared with a $\\Theta(n)$-depth circuit using only single- and two-qubit gates, although with a cost of an exponential amount of ancillary qubits. On the other hand, for sparse quantum states with $d\\geqslant2$ non-zero entries, we can reduce the circuit depth to $\\Theta(\\log(nd))$ with $O(nd\\log d)$ ancillary qubits. The algorithm for sparse states is exponentially faster than best-known results and the number of ancillary qubits is nearly optimal and only increases po"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.11495","kind":"arxiv","version":4},"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/2201.11495/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":"2201.11495","created_at":"2026-07-05T06:03:22.742629+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.11495v4","created_at":"2026-07-05T06:03:22.742629+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.11495","created_at":"2026-07-05T06:03:22.742629+00:00"},{"alias_kind":"pith_short_12","alias_value":"3B3NECMCU26J","created_at":"2026-07-05T06:03:22.742629+00:00"},{"alias_kind":"pith_short_16","alias_value":"3B3NECMCU26JGCFB","created_at":"2026-07-05T06:03:22.742629+00:00"},{"alias_kind":"pith_short_8","alias_value":"3B3NECMC","created_at":"2026-07-05T06:03:22.742629+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.08758","citing_title":"Statistical models of barren plateaus and anti-concentration of Pauli observables","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3B3NECMCU26JGCFB5JG3P7B26A","json":"https://pith.science/pith/3B3NECMCU26JGCFB5JG3P7B26A.json","graph_json":"https://pith.science/api/pith-number/3B3NECMCU26JGCFB5JG3P7B26A/graph.json","events_json":"https://pith.science/api/pith-number/3B3NECMCU26JGCFB5JG3P7B26A/events.json","paper":"https://pith.science/paper/3B3NECMC"},"agent_actions":{"view_html":"https://pith.science/pith/3B3NECMCU26JGCFB5JG3P7B26A","download_json":"https://pith.science/pith/3B3NECMCU26JGCFB5JG3P7B26A.json","view_paper":"https://pith.science/paper/3B3NECMC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.11495&json=true","fetch_graph":"https://pith.science/api/pith-number/3B3NECMCU26JGCFB5JG3P7B26A/graph.json","fetch_events":"https://pith.science/api/pith-number/3B3NECMCU26JGCFB5JG3P7B26A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3B3NECMCU26JGCFB5JG3P7B26A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3B3NECMCU26JGCFB5JG3P7B26A/action/storage_attestation","attest_author":"https://pith.science/pith/3B3NECMCU26JGCFB5JG3P7B26A/action/author_attestation","sign_citation":"https://pith.science/pith/3B3NECMCU26JGCFB5JG3P7B26A/action/citation_signature","submit_replication":"https://pith.science/pith/3B3NECMCU26JGCFB5JG3P7B26A/action/replication_record"}},"created_at":"2026-07-05T06:03:22.742629+00:00","updated_at":"2026-07-05T06:03:22.742629+00:00"}