{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:76HMQME6PYBZ2UXMGA7MVX6HRA","short_pith_number":"pith:76HMQME6","canonical_record":{"source":{"id":"2005.04351","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-05-09T02:31:44Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"d0af887dad237a14c6d246391229b04d58c63de90822ee92017f625e98bfe989","abstract_canon_sha256":"16e84ac71923d3f16cafd88f3ea5c4c992df10fb471c09b0e415e29f6558cde1"},"schema_version":"1.0"},"canonical_sha256":"ff8ec8309e7e039d52ec303ecadfc7880db357df81244246bfc8256dc4e8fc3b","source":{"kind":"arxiv","id":"2005.04351","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.04351","created_at":"2026-07-05T01:01:43Z"},{"alias_kind":"arxiv_version","alias_value":"2005.04351v1","created_at":"2026-07-05T01:01:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.04351","created_at":"2026-07-05T01:01:43Z"},{"alias_kind":"pith_short_12","alias_value":"76HMQME6PYBZ","created_at":"2026-07-05T01:01:43Z"},{"alias_kind":"pith_short_16","alias_value":"76HMQME6PYBZ2UXM","created_at":"2026-07-05T01:01:43Z"},{"alias_kind":"pith_short_8","alias_value":"76HMQME6","created_at":"2026-07-05T01:01:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:76HMQME6PYBZ2UXMGA7MVX6HRA","target":"record","payload":{"canonical_record":{"source":{"id":"2005.04351","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-05-09T02:31:44Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"d0af887dad237a14c6d246391229b04d58c63de90822ee92017f625e98bfe989","abstract_canon_sha256":"16e84ac71923d3f16cafd88f3ea5c4c992df10fb471c09b0e415e29f6558cde1"},"schema_version":"1.0"},"canonical_sha256":"ff8ec8309e7e039d52ec303ecadfc7880db357df81244246bfc8256dc4e8fc3b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:01:43.111457Z","signature_b64":"tD9d82mE02w7oqj1vvoJvuM4RXVH/R+a9xWL6792f+q+Wzuc2x1CSf0mJrr30XaeCaiNiUprqFpUYkAtlP74Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff8ec8309e7e039d52ec303ecadfc7880db357df81244246bfc8256dc4e8fc3b","last_reissued_at":"2026-07-05T01:01:43.111019Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:01:43.111019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2005.04351","source_version":1,"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-05T01:01:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6AExb1h1gFTIqNNxRTo48ZUPNddispbONy9IPqw0WpeUl68LmI3zjbjbQHZPIM9KjWOxSwnKJS5u7fOMpA9GDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-14T17:21:52.010192Z"},"content_sha256":"42476b65cd753fb2a655950fb55ee85f8dc5928dc1a5ea4f4b51a82ea2e1395d","schema_version":"1.0","event_id":"sha256:42476b65cd753fb2a655950fb55ee85f8dc5928dc1a5ea4f4b51a82ea2e1395d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:76HMQME6PYBZ2UXMGA7MVX6HRA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Quantum Circuits for Accurate State Preparation of Smooth, Differentiable Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"quant-ph","authors_text":"Adam Holmes, A. Y. Matsuura","submitted_at":"2020-05-09T02:31:44Z","abstract_excerpt":"Effective quantum computation relies upon making good use of the exponential information capacity of a quantum machine. A large barrier to designing quantum algorithms for execution on real quantum machines is that, in general, it is intractably difficult to construct an arbitrary quantum state to high precision. Many quantum algorithms rely instead upon initializing the machine in a simple state, and evolving the state through an efficient (i.e. at most polynomial-depth) quantum algorithm. In this work, we show that there exist families of quantum states that can be prepared to high precision"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.04351","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/2005.04351/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-05T01:01:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g0UjYF3KIhljVntP8aaIkEkUiz99mgGR/t7QFNkiLIFOTPjSpMalg4nrjBsVHbcpXWGfFXI+wSQK0Wi+Q0mJDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-14T17:21:52.010587Z"},"content_sha256":"80f317eb03610854a3453f8304f6cdc224a45d9d9893dd836c11cf48497b1563","schema_version":"1.0","event_id":"sha256:80f317eb03610854a3453f8304f6cdc224a45d9d9893dd836c11cf48497b1563"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/76HMQME6PYBZ2UXMGA7MVX6HRA/bundle.json","state_url":"https://pith.science/pith/76HMQME6PYBZ2UXMGA7MVX6HRA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/76HMQME6PYBZ2UXMGA7MVX6HRA/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-07-14T17:21:52Z","links":{"resolver":"https://pith.science/pith/76HMQME6PYBZ2UXMGA7MVX6HRA","bundle":"https://pith.science/pith/76HMQME6PYBZ2UXMGA7MVX6HRA/bundle.json","state":"https://pith.science/pith/76HMQME6PYBZ2UXMGA7MVX6HRA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/76HMQME6PYBZ2UXMGA7MVX6HRA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:76HMQME6PYBZ2UXMGA7MVX6HRA","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":"16e84ac71923d3f16cafd88f3ea5c4c992df10fb471c09b0e415e29f6558cde1","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-05-09T02:31:44Z","title_canon_sha256":"d0af887dad237a14c6d246391229b04d58c63de90822ee92017f625e98bfe989"},"schema_version":"1.0","source":{"id":"2005.04351","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.04351","created_at":"2026-07-05T01:01:43Z"},{"alias_kind":"arxiv_version","alias_value":"2005.04351v1","created_at":"2026-07-05T01:01:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.04351","created_at":"2026-07-05T01:01:43Z"},{"alias_kind":"pith_short_12","alias_value":"76HMQME6PYBZ","created_at":"2026-07-05T01:01:43Z"},{"alias_kind":"pith_short_16","alias_value":"76HMQME6PYBZ2UXM","created_at":"2026-07-05T01:01:43Z"},{"alias_kind":"pith_short_8","alias_value":"76HMQME6","created_at":"2026-07-05T01:01:43Z"}],"graph_snapshots":[{"event_id":"sha256:80f317eb03610854a3453f8304f6cdc224a45d9d9893dd836c11cf48497b1563","target":"graph","created_at":"2026-07-05T01:01:43Z","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/2005.04351/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Effective quantum computation relies upon making good use of the exponential information capacity of a quantum machine. A large barrier to designing quantum algorithms for execution on real quantum machines is that, in general, it is intractably difficult to construct an arbitrary quantum state to high precision. Many quantum algorithms rely instead upon initializing the machine in a simple state, and evolving the state through an efficient (i.e. at most polynomial-depth) quantum algorithm. In this work, we show that there exist families of quantum states that can be prepared to high precision","authors_text":"Adam Holmes, A. Y. Matsuura","cross_cats":["cs.NA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-05-09T02:31:44Z","title":"Efficient Quantum Circuits for Accurate State Preparation of Smooth, Differentiable Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.04351","kind":"arxiv","version":1},"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:42476b65cd753fb2a655950fb55ee85f8dc5928dc1a5ea4f4b51a82ea2e1395d","target":"record","created_at":"2026-07-05T01:01:43Z","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":"16e84ac71923d3f16cafd88f3ea5c4c992df10fb471c09b0e415e29f6558cde1","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-05-09T02:31:44Z","title_canon_sha256":"d0af887dad237a14c6d246391229b04d58c63de90822ee92017f625e98bfe989"},"schema_version":"1.0","source":{"id":"2005.04351","kind":"arxiv","version":1}},"canonical_sha256":"ff8ec8309e7e039d52ec303ecadfc7880db357df81244246bfc8256dc4e8fc3b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff8ec8309e7e039d52ec303ecadfc7880db357df81244246bfc8256dc4e8fc3b","first_computed_at":"2026-07-05T01:01:43.111019Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:01:43.111019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tD9d82mE02w7oqj1vvoJvuM4RXVH/R+a9xWL6792f+q+Wzuc2x1CSf0mJrr30XaeCaiNiUprqFpUYkAtlP74Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:01:43.111457Z","signed_message":"canonical_sha256_bytes"},"source_id":"2005.04351","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:42476b65cd753fb2a655950fb55ee85f8dc5928dc1a5ea4f4b51a82ea2e1395d","sha256:80f317eb03610854a3453f8304f6cdc224a45d9d9893dd836c11cf48497b1563"],"state_sha256":"ad1df9c20f7220eff65c96f0e1575d4a4fdad7f61ff9d0269d490ec5214bc130"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"34NHJT3wwm3inXz/1T/kJ2ycywWpMy3oY8DAweWH67hizEEJT1mg6MhLWfZ+UO7cvRLRX/lYD0kA5HOfQpVUAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-14T17:21:52.012819Z","bundle_sha256":"65b59d0cfa662cf25432773b6b37153c1d5ddc7554bfca5b6856584ef4b2d3b1"}}