{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:LGG7XCZY62RE6VSW7O2MKO5XXW","short_pith_number":"pith:LGG7XCZY","schema_version":"1.0","canonical_sha256":"598dfb8b38f6a24f5656fbb4c53bb7bd99bb00de114e06dcb21392faea29ce6d","source":{"kind":"arxiv","id":"2302.11141","version":1},"attestation_state":"computed","paper":{"title":"GASP -- A Genetic Algorithm for State Preparation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"quant-ph","authors_text":"Charles D. Hill, Floyd M. Creevey, Lloyd C. L. Hollenberg","submitted_at":"2023-02-22T04:41:01Z","abstract_excerpt":"The efficient preparation of quantum states is an important step in the execution of many quantum algorithms. In the noisy intermediate-scale quantum (NISQ) computing era, this is a significant challenge given quantum resources are scarce and typically only low-depth quantum circuits can be implemented on physical devices. We present a genetic algorithm for state preparation (GASP) which generates relatively low-depth quantum circuits for initialising a quantum computer in a specified quantum state. The method uses a basis set of R_x, R_y, R_z, and CNOT gates and a genetic algorithm to systema"},"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":"2302.11141","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-02-22T04:41:01Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"2aaf04b4b8647b414c153fdb70baa605678ca7ae20ac58f222d9e7495f126814","abstract_canon_sha256":"0e2a8d6006111775dc4045ca86bd33788432bdad29c234c9cc3159050f3bb8d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:44:31.003247Z","signature_b64":"vfqlCPJuXfbUY++pp2n+BXrZ5Bf9COruJjkxZ2OcDwivjM06Zz4K2gz/QS5PF8WcZekgW8S4dBQ9AcEMM3UDDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"598dfb8b38f6a24f5656fbb4c53bb7bd99bb00de114e06dcb21392faea29ce6d","last_reissued_at":"2026-07-05T05:44:31.002848Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:44:31.002848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GASP -- A Genetic Algorithm for State Preparation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"quant-ph","authors_text":"Charles D. Hill, Floyd M. Creevey, Lloyd C. L. Hollenberg","submitted_at":"2023-02-22T04:41:01Z","abstract_excerpt":"The efficient preparation of quantum states is an important step in the execution of many quantum algorithms. In the noisy intermediate-scale quantum (NISQ) computing era, this is a significant challenge given quantum resources are scarce and typically only low-depth quantum circuits can be implemented on physical devices. We present a genetic algorithm for state preparation (GASP) which generates relatively low-depth quantum circuits for initialising a quantum computer in a specified quantum state. The method uses a basis set of R_x, R_y, R_z, and CNOT gates and a genetic algorithm to systema"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.11141","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/2302.11141/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":"2302.11141","created_at":"2026-07-05T05:44:31.002906+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.11141v1","created_at":"2026-07-05T05:44:31.002906+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.11141","created_at":"2026-07-05T05:44:31.002906+00:00"},{"alias_kind":"pith_short_12","alias_value":"LGG7XCZY62RE","created_at":"2026-07-05T05:44:31.002906+00:00"},{"alias_kind":"pith_short_16","alias_value":"LGG7XCZY62RE6VSW","created_at":"2026-07-05T05:44:31.002906+00:00"},{"alias_kind":"pith_short_8","alias_value":"LGG7XCZY","created_at":"2026-07-05T05:44:31.002906+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.20863","citing_title":"Leveraging Diffusion Models for Parameterized Quantum Circuit Generation","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LGG7XCZY62RE6VSW7O2MKO5XXW","json":"https://pith.science/pith/LGG7XCZY62RE6VSW7O2MKO5XXW.json","graph_json":"https://pith.science/api/pith-number/LGG7XCZY62RE6VSW7O2MKO5XXW/graph.json","events_json":"https://pith.science/api/pith-number/LGG7XCZY62RE6VSW7O2MKO5XXW/events.json","paper":"https://pith.science/paper/LGG7XCZY"},"agent_actions":{"view_html":"https://pith.science/pith/LGG7XCZY62RE6VSW7O2MKO5XXW","download_json":"https://pith.science/pith/LGG7XCZY62RE6VSW7O2MKO5XXW.json","view_paper":"https://pith.science/paper/LGG7XCZY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.11141&json=true","fetch_graph":"https://pith.science/api/pith-number/LGG7XCZY62RE6VSW7O2MKO5XXW/graph.json","fetch_events":"https://pith.science/api/pith-number/LGG7XCZY62RE6VSW7O2MKO5XXW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LGG7XCZY62RE6VSW7O2MKO5XXW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LGG7XCZY62RE6VSW7O2MKO5XXW/action/storage_attestation","attest_author":"https://pith.science/pith/LGG7XCZY62RE6VSW7O2MKO5XXW/action/author_attestation","sign_citation":"https://pith.science/pith/LGG7XCZY62RE6VSW7O2MKO5XXW/action/citation_signature","submit_replication":"https://pith.science/pith/LGG7XCZY62RE6VSW7O2MKO5XXW/action/replication_record"}},"created_at":"2026-07-05T05:44:31.002906+00:00","updated_at":"2026-07-05T05:44:31.002906+00:00"}