{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YVIF6OZTAEGJIFPO5SVEMGXBO7","short_pith_number":"pith:YVIF6OZT","canonical_record":{"source":{"id":"1807.00800","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-07-02T17:48:45Z","cross_cats_sorted":[],"title_canon_sha256":"990d767b347108e68dc950ccbe38484437e7db35371e2ee9eea7e0062609ae6b","abstract_canon_sha256":"f8c0d26aaac60c586260b23a7f9e4215a4242e68e42cbfae4b7aa6acfd8f0e13"},"schema_version":"1.0"},"canonical_sha256":"c5505f3b33010c9415eeecaa461ae177e83ca3d3c50373b6cbf3846dd3e80b4e","source":{"kind":"arxiv","id":"1807.00800","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.00800","created_at":"2026-05-17T23:46:30Z"},{"alias_kind":"arxiv_version","alias_value":"1807.00800v5","created_at":"2026-05-17T23:46:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00800","created_at":"2026-05-17T23:46:30Z"},{"alias_kind":"pith_short_12","alias_value":"YVIF6OZTAEGJ","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YVIF6OZTAEGJIFPO","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YVIF6OZT","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YVIF6OZTAEGJIFPO5SVEMGXBO7","target":"record","payload":{"canonical_record":{"source":{"id":"1807.00800","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-07-02T17:48:45Z","cross_cats_sorted":[],"title_canon_sha256":"990d767b347108e68dc950ccbe38484437e7db35371e2ee9eea7e0062609ae6b","abstract_canon_sha256":"f8c0d26aaac60c586260b23a7f9e4215a4242e68e42cbfae4b7aa6acfd8f0e13"},"schema_version":"1.0"},"canonical_sha256":"c5505f3b33010c9415eeecaa461ae177e83ca3d3c50373b6cbf3846dd3e80b4e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:30.245825Z","signature_b64":"Be9QcyvKNdN6Y7mm149lFi0JfJxeRoX4t6NVNRtjQ0hkl/SG+eChUK9f2gWK3nlZGBrWsAFrTreqHDTArhhwAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5505f3b33010c9415eeecaa461ae177e83ca3d3c50373b6cbf3846dd3e80b4e","last_reissued_at":"2026-05-17T23:46:30.245242Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:30.245242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.00800","source_version":5,"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-05-17T23:46:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Xd20mQB7O4GP06vJwLguonz+8FrH7yJ7cxLoLigvlWfVG+u1wugze2Ex73eEoGseGY/QVMtdlAoWvo8fA2yAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:08:44.134069Z"},"content_sha256":"a566edf2b33ccd19615c7177af4d8607d013e6ad31219fcedef42d640306c9b6","schema_version":"1.0","event_id":"sha256:a566edf2b33ccd19615c7177af4d8607d013e6ad31219fcedef42d640306c9b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YVIF6OZTAEGJIFPO5SVEMGXBO7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum-assisted quantum compiling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexander Poremba, Andrew T. Sornborger, Lukasz Cincio, Patrick J. Coles, Ryan LaRose, Sumeet Khatri","submitted_at":"2018-07-02T17:48:45Z","abstract_excerpt":"Compiling quantum algorithms for near-term quantum computers (accounting for connectivity and native gate alphabets) is a major challenge that has received significant attention both by industry and academia. Avoiding the exponential overhead of classical simulation of quantum dynamics will allow compilation of larger algorithms, and a strategy for this is to evaluate an algorithm's cost on a quantum computer. To this end, we propose a variational hybrid quantum-classical algorithm called quantum-assisted quantum compiling (QAQC). In QAQC, we use the overlap between a target unitary $U$ and a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00800","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-17T23:46:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N787gboytiIkAIrXr4OMxWHB0sv6K6FASKArNlBOK8XuUmg9vOWL/BSjiql0TEC39+9gjyxLsnipeQ+MdAqiAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:08:44.134432Z"},"content_sha256":"2204ef2f08b7f55c74ab538175000c40d51bb8da90e0e47a01fff02551ede4f1","schema_version":"1.0","event_id":"sha256:2204ef2f08b7f55c74ab538175000c40d51bb8da90e0e47a01fff02551ede4f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YVIF6OZTAEGJIFPO5SVEMGXBO7/bundle.json","state_url":"https://pith.science/pith/YVIF6OZTAEGJIFPO5SVEMGXBO7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YVIF6OZTAEGJIFPO5SVEMGXBO7/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-05-30T05:08:44Z","links":{"resolver":"https://pith.science/pith/YVIF6OZTAEGJIFPO5SVEMGXBO7","bundle":"https://pith.science/pith/YVIF6OZTAEGJIFPO5SVEMGXBO7/bundle.json","state":"https://pith.science/pith/YVIF6OZTAEGJIFPO5SVEMGXBO7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YVIF6OZTAEGJIFPO5SVEMGXBO7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YVIF6OZTAEGJIFPO5SVEMGXBO7","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":"f8c0d26aaac60c586260b23a7f9e4215a4242e68e42cbfae4b7aa6acfd8f0e13","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-07-02T17:48:45Z","title_canon_sha256":"990d767b347108e68dc950ccbe38484437e7db35371e2ee9eea7e0062609ae6b"},"schema_version":"1.0","source":{"id":"1807.00800","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.00800","created_at":"2026-05-17T23:46:30Z"},{"alias_kind":"arxiv_version","alias_value":"1807.00800v5","created_at":"2026-05-17T23:46:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00800","created_at":"2026-05-17T23:46:30Z"},{"alias_kind":"pith_short_12","alias_value":"YVIF6OZTAEGJ","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YVIF6OZTAEGJIFPO","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YVIF6OZT","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:2204ef2f08b7f55c74ab538175000c40d51bb8da90e0e47a01fff02551ede4f1","target":"graph","created_at":"2026-05-17T23:46:30Z","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"},"paper":{"abstract_excerpt":"Compiling quantum algorithms for near-term quantum computers (accounting for connectivity and native gate alphabets) is a major challenge that has received significant attention both by industry and academia. Avoiding the exponential overhead of classical simulation of quantum dynamics will allow compilation of larger algorithms, and a strategy for this is to evaluate an algorithm's cost on a quantum computer. To this end, we propose a variational hybrid quantum-classical algorithm called quantum-assisted quantum compiling (QAQC). In QAQC, we use the overlap between a target unitary $U$ and a ","authors_text":"Alexander Poremba, Andrew T. Sornborger, Lukasz Cincio, Patrick J. Coles, Ryan LaRose, Sumeet Khatri","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-07-02T17:48:45Z","title":"Quantum-assisted quantum compiling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00800","kind":"arxiv","version":5},"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:a566edf2b33ccd19615c7177af4d8607d013e6ad31219fcedef42d640306c9b6","target":"record","created_at":"2026-05-17T23:46:30Z","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":"f8c0d26aaac60c586260b23a7f9e4215a4242e68e42cbfae4b7aa6acfd8f0e13","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-07-02T17:48:45Z","title_canon_sha256":"990d767b347108e68dc950ccbe38484437e7db35371e2ee9eea7e0062609ae6b"},"schema_version":"1.0","source":{"id":"1807.00800","kind":"arxiv","version":5}},"canonical_sha256":"c5505f3b33010c9415eeecaa461ae177e83ca3d3c50373b6cbf3846dd3e80b4e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c5505f3b33010c9415eeecaa461ae177e83ca3d3c50373b6cbf3846dd3e80b4e","first_computed_at":"2026-05-17T23:46:30.245242Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:30.245242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Be9QcyvKNdN6Y7mm149lFi0JfJxeRoX4t6NVNRtjQ0hkl/SG+eChUK9f2gWK3nlZGBrWsAFrTreqHDTArhhwAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:30.245825Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.00800","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a566edf2b33ccd19615c7177af4d8607d013e6ad31219fcedef42d640306c9b6","sha256:2204ef2f08b7f55c74ab538175000c40d51bb8da90e0e47a01fff02551ede4f1"],"state_sha256":"ff4abc84e24126ccdfc7fc0167a85afe544a0dc88184a4158fd5afd2c4732047"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9+4cWX1i8uuBVSwafrVBiGv5L7Dsh3HTMfPPrHI73YP+SuYBdjQ7ebFyFKC3bjX0IGbhR2tg4EKbv00HbsgFCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:08:44.136351Z","bundle_sha256":"baa457c84755fd0aa3ea89a8bafe01dd871d292d5a29b09afa670bab975b93c7"}}