{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RKTOKCX7IKLJITVCIU5JBGNPPJ","short_pith_number":"pith:RKTOKCX7","schema_version":"1.0","canonical_sha256":"8aa6e50aff4296944ea2453a9099af7a4aeeb509369aa302bb2d2187cdc32351","source":{"kind":"arxiv","id":"1908.04416","version":2},"attestation_state":"computed","paper":{"title":"Noise Resilience of Variational Quantum Compiling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Kunal Sharma, M. Cerezo, Patrick J. Coles, Sumeet Khatri","submitted_at":"2019-08-12T21:57:13Z","abstract_excerpt":"Variational hybrid quantum-classical algorithms (VHQCAs) are near-term algorithms that leverage classical optimization to minimize a cost function, which is efficiently evaluated on a quantum computer. Recently VHQCAs have been proposed for quantum compiling, where a target unitary $U$ is compiled into a short-depth gate sequence $V$. In this work, we report on a surprising form of noise resilience for these algorithms. Namely, we find one often learns the correct gate sequence $V$ (i.e., the correct variational parameters) despite various sources of incoherent noise acting during the cost-eva"},"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":"1908.04416","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-08-12T21:57:13Z","cross_cats_sorted":[],"title_canon_sha256":"6c80577a063bc154d6c4ccbd95c0500663fb1f91797d8ea42bd3eb508fbbce73","abstract_canon_sha256":"b0c5fa900132aa61273f71ec80ec200f724417bcfbdff622704d66a9cc4f1570"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:52:47.766190Z","signature_b64":"0Fkfdu0qaHX9Ea49a+Bt07gY3ZxNujz/AbNdRo9QhYYPehBkKvLKI74K8K69JFiqt7DAeXQ0rs8DMs2J9mQ0BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8aa6e50aff4296944ea2453a9099af7a4aeeb509369aa302bb2d2187cdc32351","last_reissued_at":"2026-07-05T00:52:47.765654Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:52:47.765654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Noise Resilience of Variational Quantum Compiling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Kunal Sharma, M. Cerezo, Patrick J. Coles, Sumeet Khatri","submitted_at":"2019-08-12T21:57:13Z","abstract_excerpt":"Variational hybrid quantum-classical algorithms (VHQCAs) are near-term algorithms that leverage classical optimization to minimize a cost function, which is efficiently evaluated on a quantum computer. Recently VHQCAs have been proposed for quantum compiling, where a target unitary $U$ is compiled into a short-depth gate sequence $V$. In this work, we report on a surprising form of noise resilience for these algorithms. Namely, we find one often learns the correct gate sequence $V$ (i.e., the correct variational parameters) despite various sources of incoherent noise acting during the cost-eva"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04416","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/1908.04416/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":"1908.04416","created_at":"2026-07-05T00:52:47.765707+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.04416v2","created_at":"2026-07-05T00:52:47.765707+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04416","created_at":"2026-07-05T00:52:47.765707+00:00"},{"alias_kind":"pith_short_12","alias_value":"RKTOKCX7IKLJ","created_at":"2026-07-05T00:52:47.765707+00:00"},{"alias_kind":"pith_short_16","alias_value":"RKTOKCX7IKLJITVC","created_at":"2026-07-05T00:52:47.765707+00:00"},{"alias_kind":"pith_short_8","alias_value":"RKTOKCX7","created_at":"2026-07-05T00:52:47.765707+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1909.02196","citing_title":"Effects of Quantum Noise on Quantum Approximate Optimization Algorithm","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RKTOKCX7IKLJITVCIU5JBGNPPJ","json":"https://pith.science/pith/RKTOKCX7IKLJITVCIU5JBGNPPJ.json","graph_json":"https://pith.science/api/pith-number/RKTOKCX7IKLJITVCIU5JBGNPPJ/graph.json","events_json":"https://pith.science/api/pith-number/RKTOKCX7IKLJITVCIU5JBGNPPJ/events.json","paper":"https://pith.science/paper/RKTOKCX7"},"agent_actions":{"view_html":"https://pith.science/pith/RKTOKCX7IKLJITVCIU5JBGNPPJ","download_json":"https://pith.science/pith/RKTOKCX7IKLJITVCIU5JBGNPPJ.json","view_paper":"https://pith.science/paper/RKTOKCX7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.04416&json=true","fetch_graph":"https://pith.science/api/pith-number/RKTOKCX7IKLJITVCIU5JBGNPPJ/graph.json","fetch_events":"https://pith.science/api/pith-number/RKTOKCX7IKLJITVCIU5JBGNPPJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RKTOKCX7IKLJITVCIU5JBGNPPJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RKTOKCX7IKLJITVCIU5JBGNPPJ/action/storage_attestation","attest_author":"https://pith.science/pith/RKTOKCX7IKLJITVCIU5JBGNPPJ/action/author_attestation","sign_citation":"https://pith.science/pith/RKTOKCX7IKLJITVCIU5JBGNPPJ/action/citation_signature","submit_replication":"https://pith.science/pith/RKTOKCX7IKLJITVCIU5JBGNPPJ/action/replication_record"}},"created_at":"2026-07-05T00:52:47.765707+00:00","updated_at":"2026-07-05T00:52:47.765707+00:00"}