{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YVIF6OZTAEGJIFPO5SVEMGXBO7","short_pith_number":"pith:YVIF6OZT","schema_version":"1.0","canonical_sha256":"c5505f3b33010c9415eeecaa461ae177e83ca3d3c50373b6cbf3846dd3e80b4e","source":{"kind":"arxiv","id":"1807.00800","version":5},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.00800","created_at":"2026-05-17T23:46:30.245336+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.00800v5","created_at":"2026-05-17T23:46:30.245336+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00800","created_at":"2026-05-17T23:46:30.245336+00:00"},{"alias_kind":"pith_short_12","alias_value":"YVIF6OZTAEGJ","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YVIF6OZTAEGJIFPO","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YVIF6OZT","created_at":"2026-05-18T12:33:04.347982+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.27648","citing_title":"Effective Noise Mitigation via Quantum Circuit Learning in Quantum Simulation of Integrable Spin Chains","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YVIF6OZTAEGJIFPO5SVEMGXBO7","json":"https://pith.science/pith/YVIF6OZTAEGJIFPO5SVEMGXBO7.json","graph_json":"https://pith.science/api/pith-number/YVIF6OZTAEGJIFPO5SVEMGXBO7/graph.json","events_json":"https://pith.science/api/pith-number/YVIF6OZTAEGJIFPO5SVEMGXBO7/events.json","paper":"https://pith.science/paper/YVIF6OZT"},"agent_actions":{"view_html":"https://pith.science/pith/YVIF6OZTAEGJIFPO5SVEMGXBO7","download_json":"https://pith.science/pith/YVIF6OZTAEGJIFPO5SVEMGXBO7.json","view_paper":"https://pith.science/paper/YVIF6OZT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.00800&json=true","fetch_graph":"https://pith.science/api/pith-number/YVIF6OZTAEGJIFPO5SVEMGXBO7/graph.json","fetch_events":"https://pith.science/api/pith-number/YVIF6OZTAEGJIFPO5SVEMGXBO7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YVIF6OZTAEGJIFPO5SVEMGXBO7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YVIF6OZTAEGJIFPO5SVEMGXBO7/action/storage_attestation","attest_author":"https://pith.science/pith/YVIF6OZTAEGJIFPO5SVEMGXBO7/action/author_attestation","sign_citation":"https://pith.science/pith/YVIF6OZTAEGJIFPO5SVEMGXBO7/action/citation_signature","submit_replication":"https://pith.science/pith/YVIF6OZTAEGJIFPO5SVEMGXBO7/action/replication_record"}},"created_at":"2026-05-17T23:46:30.245336+00:00","updated_at":"2026-05-17T23:46:30.245336+00:00"}