{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:344GLWMVCGQZE433JBRTVYXUV7","short_pith_number":"pith:344GLWMV","schema_version":"1.0","canonical_sha256":"df3865d99511a192737b48633ae2f4affcc61d82f11c5b8799badfbb170e8446","source":{"kind":"arxiv","id":"2202.13714","version":2},"attestation_state":"computed","paper":{"title":"Robust resource-efficient quantum variational ansatz through evolutionary algorithm","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"Abolfazl Bayat, Man-Hong Yung, Qingyu Li, Rebing Wu, Xiaokai Hou, Xiaoting Wang, Yuhan Huang","submitted_at":"2022-02-28T12:14:11Z","abstract_excerpt":"Variational quantum algorithms (VQAs) are promising methods to demonstrate quantum advantage on near-term devices as the required resources are divided between a quantum simulator and a classical optimizer. As such, designing a VQA which is resource-efficient and robust against noise is a key factor to achieve potential advantage with the existing noisy quantum simulators. It turns out that a fixed VQA circuit design, such as the widely-used hardware efficient ansatz, is not necessarily robust against imperfections. In this work, we propose a genome-length-adjustable evolutionary algorithm to "},"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":"2202.13714","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2022-02-28T12:14:11Z","cross_cats_sorted":["cond-mat.str-el"],"title_canon_sha256":"2c68e6efdcd6b2a2100a6a5725ed57f1e18c34493efd26a6119fb7884b373924","abstract_canon_sha256":"7a59555f175e8e34e2c5d677a1b37fac71a2da665b695c796fc4ebf5fb99ac11"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:24:38.896512Z","signature_b64":"vu33TnE3lBi4KabtXR8BZvnQjQPZnq/wXLQSS/iq0QhpkJyFy/r+B8PAj9ZnKL4YwC2kx9Ia+JPpicoBkgEdCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df3865d99511a192737b48633ae2f4affcc61d82f11c5b8799badfbb170e8446","last_reissued_at":"2026-07-05T04:24:38.896004Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:24:38.896004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust resource-efficient quantum variational ansatz through evolutionary algorithm","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"Abolfazl Bayat, Man-Hong Yung, Qingyu Li, Rebing Wu, Xiaokai Hou, Xiaoting Wang, Yuhan Huang","submitted_at":"2022-02-28T12:14:11Z","abstract_excerpt":"Variational quantum algorithms (VQAs) are promising methods to demonstrate quantum advantage on near-term devices as the required resources are divided between a quantum simulator and a classical optimizer. As such, designing a VQA which is resource-efficient and robust against noise is a key factor to achieve potential advantage with the existing noisy quantum simulators. It turns out that a fixed VQA circuit design, such as the widely-used hardware efficient ansatz, is not necessarily robust against imperfections. In this work, we propose a genome-length-adjustable evolutionary algorithm to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.13714","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/2202.13714/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":"2202.13714","created_at":"2026-07-05T04:24:38.896062+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.13714v2","created_at":"2026-07-05T04:24:38.896062+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.13714","created_at":"2026-07-05T04:24:38.896062+00:00"},{"alias_kind":"pith_short_12","alias_value":"344GLWMVCGQZ","created_at":"2026-07-05T04:24:38.896062+00:00"},{"alias_kind":"pith_short_16","alias_value":"344GLWMVCGQZE433","created_at":"2026-07-05T04:24:38.896062+00:00"},{"alias_kind":"pith_short_8","alias_value":"344GLWMV","created_at":"2026-07-05T04:24:38.896062+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.07686","citing_title":"Emergent Problem-Graph Alignment in RL-Discovered Entanglement Topologies for QAOA","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/344GLWMVCGQZE433JBRTVYXUV7","json":"https://pith.science/pith/344GLWMVCGQZE433JBRTVYXUV7.json","graph_json":"https://pith.science/api/pith-number/344GLWMVCGQZE433JBRTVYXUV7/graph.json","events_json":"https://pith.science/api/pith-number/344GLWMVCGQZE433JBRTVYXUV7/events.json","paper":"https://pith.science/paper/344GLWMV"},"agent_actions":{"view_html":"https://pith.science/pith/344GLWMVCGQZE433JBRTVYXUV7","download_json":"https://pith.science/pith/344GLWMVCGQZE433JBRTVYXUV7.json","view_paper":"https://pith.science/paper/344GLWMV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.13714&json=true","fetch_graph":"https://pith.science/api/pith-number/344GLWMVCGQZE433JBRTVYXUV7/graph.json","fetch_events":"https://pith.science/api/pith-number/344GLWMVCGQZE433JBRTVYXUV7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/344GLWMVCGQZE433JBRTVYXUV7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/344GLWMVCGQZE433JBRTVYXUV7/action/storage_attestation","attest_author":"https://pith.science/pith/344GLWMVCGQZE433JBRTVYXUV7/action/author_attestation","sign_citation":"https://pith.science/pith/344GLWMVCGQZE433JBRTVYXUV7/action/citation_signature","submit_replication":"https://pith.science/pith/344GLWMVCGQZE433JBRTVYXUV7/action/replication_record"}},"created_at":"2026-07-05T04:24:38.896062+00:00","updated_at":"2026-07-05T04:24:38.896062+00:00"}