{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:DCUMQU54ZEQZ3LFI6NH7TDUHLQ","short_pith_number":"pith:DCUMQU54","canonical_record":{"source":{"id":"2008.01511","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-08-04T13:26:07Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"a4955c8d9e190e1bf82914e6a82ab56f23c6bbb18bfcf4bcd05fcf046499eab8","abstract_canon_sha256":"573dcf214b0cb8a0e597e0f6558e61b0f67e7a0961cc7881fc8f869c5921a23c"},"schema_version":"1.0"},"canonical_sha256":"18a8c853bcc9219daca8f34ff98e875c2a1663c10ff20fb5a8ada38310936318","source":{"kind":"arxiv","id":"2008.01511","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.01511","created_at":"2026-07-05T03:12:45Z"},{"alias_kind":"arxiv_version","alias_value":"2008.01511v2","created_at":"2026-07-05T03:12:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.01511","created_at":"2026-07-05T03:12:45Z"},{"alias_kind":"pith_short_12","alias_value":"DCUMQU54ZEQZ","created_at":"2026-07-05T03:12:45Z"},{"alias_kind":"pith_short_16","alias_value":"DCUMQU54ZEQZ3LFI","created_at":"2026-07-05T03:12:45Z"},{"alias_kind":"pith_short_8","alias_value":"DCUMQU54","created_at":"2026-07-05T03:12:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:DCUMQU54ZEQZ3LFI6NH7TDUHLQ","target":"record","payload":{"canonical_record":{"source":{"id":"2008.01511","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-08-04T13:26:07Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"a4955c8d9e190e1bf82914e6a82ab56f23c6bbb18bfcf4bcd05fcf046499eab8","abstract_canon_sha256":"573dcf214b0cb8a0e597e0f6558e61b0f67e7a0961cc7881fc8f869c5921a23c"},"schema_version":"1.0"},"canonical_sha256":"18a8c853bcc9219daca8f34ff98e875c2a1663c10ff20fb5a8ada38310936318","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:12:45.171257Z","signature_b64":"sooojR+Nz2FQgP4HxwI4aCEGVCCdQCQeyidEs416HVpSao9lbGhc3o45sIvdJtGPPQU/aJ6iF82ld/TglDgVCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18a8c853bcc9219daca8f34ff98e875c2a1663c10ff20fb5a8ada38310936318","last_reissued_at":"2026-07-05T03:12:45.170773Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:12:45.170773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2008.01511","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:12:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tfpq9uq/DBuF7CAOkNN9kF+yGAAk57X233RtsJWFs1f3aR6jQTOyMX4ZN8wRXslKdoN+Hz2S1irrWp8kS5y1BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T08:09:42.251642Z"},"content_sha256":"b2d78eb3ecd77156d5d9f6055231c08b7c0d88f420f465e55b6679983cda24e2","schema_version":"1.0","event_id":"sha256:b2d78eb3ecd77156d5d9f6055231c08b7c0d88f420f465e55b6679983cda24e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:DCUMQU54ZEQZ3LFI6NH7TDUHLQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A divide-and-conquer algorithm for quantum state preparation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"quant-ph","authors_text":"Adenilton J. da Silva, Daniel K. Park, Francesco Petruccione, Israel F. Araujo","submitted_at":"2020-08-04T13:26:07Z","abstract_excerpt":"Advantages in several fields of research and industry are expected with the rise of quantum computers. However, the computational cost to load classical data in quantum computers can impose restrictions on possible quantum speedups. Known algorithms to create arbitrary quantum states require quantum circuits with depth O(N) to load an N-dimensional vector. Here, we show that it is possible to load an N-dimensional vector with a quantum circuit with polylogarithmic depth and entangled information in ancillary qubits. Results show that we can efficiently load data in quantum devices using a divi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.01511","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/2008.01511/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:12:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"04xEAi896ewxY4SS7Vh2828q51z30KCofRBIIS5MyFAyO3l/vMbBUbtFQ2MVwsrvu/RZBZ6Qjce9QR6eCCd+DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T08:09:42.252018Z"},"content_sha256":"64a2e97cb1ef034718e569e08da57e24e1c7abc5bafdc93dc2631ee0f668e5d5","schema_version":"1.0","event_id":"sha256:64a2e97cb1ef034718e569e08da57e24e1c7abc5bafdc93dc2631ee0f668e5d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DCUMQU54ZEQZ3LFI6NH7TDUHLQ/bundle.json","state_url":"https://pith.science/pith/DCUMQU54ZEQZ3LFI6NH7TDUHLQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DCUMQU54ZEQZ3LFI6NH7TDUHLQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-22T08:09:42Z","links":{"resolver":"https://pith.science/pith/DCUMQU54ZEQZ3LFI6NH7TDUHLQ","bundle":"https://pith.science/pith/DCUMQU54ZEQZ3LFI6NH7TDUHLQ/bundle.json","state":"https://pith.science/pith/DCUMQU54ZEQZ3LFI6NH7TDUHLQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DCUMQU54ZEQZ3LFI6NH7TDUHLQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:DCUMQU54ZEQZ3LFI6NH7TDUHLQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"573dcf214b0cb8a0e597e0f6558e61b0f67e7a0961cc7881fc8f869c5921a23c","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-08-04T13:26:07Z","title_canon_sha256":"a4955c8d9e190e1bf82914e6a82ab56f23c6bbb18bfcf4bcd05fcf046499eab8"},"schema_version":"1.0","source":{"id":"2008.01511","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.01511","created_at":"2026-07-05T03:12:45Z"},{"alias_kind":"arxiv_version","alias_value":"2008.01511v2","created_at":"2026-07-05T03:12:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.01511","created_at":"2026-07-05T03:12:45Z"},{"alias_kind":"pith_short_12","alias_value":"DCUMQU54ZEQZ","created_at":"2026-07-05T03:12:45Z"},{"alias_kind":"pith_short_16","alias_value":"DCUMQU54ZEQZ3LFI","created_at":"2026-07-05T03:12:45Z"},{"alias_kind":"pith_short_8","alias_value":"DCUMQU54","created_at":"2026-07-05T03:12:45Z"}],"graph_snapshots":[{"event_id":"sha256:64a2e97cb1ef034718e569e08da57e24e1c7abc5bafdc93dc2631ee0f668e5d5","target":"graph","created_at":"2026-07-05T03:12:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2008.01511/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Advantages in several fields of research and industry are expected with the rise of quantum computers. However, the computational cost to load classical data in quantum computers can impose restrictions on possible quantum speedups. Known algorithms to create arbitrary quantum states require quantum circuits with depth O(N) to load an N-dimensional vector. Here, we show that it is possible to load an N-dimensional vector with a quantum circuit with polylogarithmic depth and entangled information in ancillary qubits. Results show that we can efficiently load data in quantum devices using a divi","authors_text":"Adenilton J. da Silva, Daniel K. Park, Francesco Petruccione, Israel F. Araujo","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-08-04T13:26:07Z","title":"A divide-and-conquer algorithm for quantum state preparation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.01511","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b2d78eb3ecd77156d5d9f6055231c08b7c0d88f420f465e55b6679983cda24e2","target":"record","created_at":"2026-07-05T03:12:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"573dcf214b0cb8a0e597e0f6558e61b0f67e7a0961cc7881fc8f869c5921a23c","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-08-04T13:26:07Z","title_canon_sha256":"a4955c8d9e190e1bf82914e6a82ab56f23c6bbb18bfcf4bcd05fcf046499eab8"},"schema_version":"1.0","source":{"id":"2008.01511","kind":"arxiv","version":2}},"canonical_sha256":"18a8c853bcc9219daca8f34ff98e875c2a1663c10ff20fb5a8ada38310936318","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18a8c853bcc9219daca8f34ff98e875c2a1663c10ff20fb5a8ada38310936318","first_computed_at":"2026-07-05T03:12:45.170773Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:12:45.170773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sooojR+Nz2FQgP4HxwI4aCEGVCCdQCQeyidEs416HVpSao9lbGhc3o45sIvdJtGPPQU/aJ6iF82ld/TglDgVCw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:12:45.171257Z","signed_message":"canonical_sha256_bytes"},"source_id":"2008.01511","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2d78eb3ecd77156d5d9f6055231c08b7c0d88f420f465e55b6679983cda24e2","sha256:64a2e97cb1ef034718e569e08da57e24e1c7abc5bafdc93dc2631ee0f668e5d5"],"state_sha256":"ebed67d75d977a4614af089a82624fa19709d2aa530b81ae8e52f6b65b454dda"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EMFEV7f8Ro2cVBODHJbXpbG/7CwlSs/CqjVY52bkAjJ8yyVJM8KGbRskOwt01vVlYljic+iWqTMVNUJY4X+6BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T08:09:42.254618Z","bundle_sha256":"28c6b0e2cc1045978e55f50f8f257c01ae622237e2c1419143d11d2b730b373d"}}