{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:33FXQFEMFUKATKUKO5OGKNEQC5","short_pith_number":"pith:33FXQFEM","schema_version":"1.0","canonical_sha256":"decb78148c2d1409aa8a775c653490174b22c6df533ae4f85fbb6c47ebdbe6f2","source":{"kind":"arxiv","id":"2210.06411","version":2},"attestation_state":"computed","paper":{"title":"Exploring the optimality of approximate state preparation quantum circuits with a genetic algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"quant-ph","authors_text":"Arttu P\\\"onni, Berat Yenilen, Ilkka Tittonen, Matti Raasakka, Niklas Halonen, Tom Rindell","submitted_at":"2022-10-12T17:06:05Z","abstract_excerpt":"We study the approximate state preparation problem on noisy intermediate-scale quantum (NISQ) computers by applying a genetic algorithm to generate quantum circuits for state preparation. The algorithm can account for the specific characteristics of the physical machine in the evaluation of circuits, such as the native gate set and qubit connectivity. We use our genetic algorithm to optimize the circuits provided by the low-rank state preparation algorithm introduced by Araujo et al., and find substantial improvements to the fidelity in preparing Haar random states with a limited number of CNO"},"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":"2210.06411","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-10-12T17:06:05Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"4c877bbbc59d6f1d56a2071109bb15b9b0bd472f17f3203beb68513714dc7a25","abstract_canon_sha256":"b614bc8c88806e6ecbfb620e2ea5ec65b13d23ffc425e3542d2bd4d23be344c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:08:11.445956Z","signature_b64":"aL8gJZ/eyswe0SuiFu9/8zJcNTaIenxt2CKt2NJS5JNfMa6AxEn0Ri3wGrrmRUFH5Mlu7SkR5gdwUKGco69bBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"decb78148c2d1409aa8a775c653490174b22c6df533ae4f85fbb6c47ebdbe6f2","last_reissued_at":"2026-07-05T06:08:11.445522Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:08:11.445522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploring the optimality of approximate state preparation quantum circuits with a genetic algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"quant-ph","authors_text":"Arttu P\\\"onni, Berat Yenilen, Ilkka Tittonen, Matti Raasakka, Niklas Halonen, Tom Rindell","submitted_at":"2022-10-12T17:06:05Z","abstract_excerpt":"We study the approximate state preparation problem on noisy intermediate-scale quantum (NISQ) computers by applying a genetic algorithm to generate quantum circuits for state preparation. The algorithm can account for the specific characteristics of the physical machine in the evaluation of circuits, such as the native gate set and qubit connectivity. We use our genetic algorithm to optimize the circuits provided by the low-rank state preparation algorithm introduced by Araujo et al., and find substantial improvements to the fidelity in preparing Haar random states with a limited number of CNO"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.06411","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/2210.06411/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":"2210.06411","created_at":"2026-07-05T06:08:11.445576+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.06411v2","created_at":"2026-07-05T06:08:11.445576+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.06411","created_at":"2026-07-05T06:08:11.445576+00:00"},{"alias_kind":"pith_short_12","alias_value":"33FXQFEMFUKA","created_at":"2026-07-05T06:08:11.445576+00:00"},{"alias_kind":"pith_short_16","alias_value":"33FXQFEMFUKATKUK","created_at":"2026-07-05T06:08:11.445576+00:00"},{"alias_kind":"pith_short_8","alias_value":"33FXQFEM","created_at":"2026-07-05T06:08:11.445576+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/33FXQFEMFUKATKUKO5OGKNEQC5","json":"https://pith.science/pith/33FXQFEMFUKATKUKO5OGKNEQC5.json","graph_json":"https://pith.science/api/pith-number/33FXQFEMFUKATKUKO5OGKNEQC5/graph.json","events_json":"https://pith.science/api/pith-number/33FXQFEMFUKATKUKO5OGKNEQC5/events.json","paper":"https://pith.science/paper/33FXQFEM"},"agent_actions":{"view_html":"https://pith.science/pith/33FXQFEMFUKATKUKO5OGKNEQC5","download_json":"https://pith.science/pith/33FXQFEMFUKATKUKO5OGKNEQC5.json","view_paper":"https://pith.science/paper/33FXQFEM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.06411&json=true","fetch_graph":"https://pith.science/api/pith-number/33FXQFEMFUKATKUKO5OGKNEQC5/graph.json","fetch_events":"https://pith.science/api/pith-number/33FXQFEMFUKATKUKO5OGKNEQC5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/33FXQFEMFUKATKUKO5OGKNEQC5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/33FXQFEMFUKATKUKO5OGKNEQC5/action/storage_attestation","attest_author":"https://pith.science/pith/33FXQFEMFUKATKUKO5OGKNEQC5/action/author_attestation","sign_citation":"https://pith.science/pith/33FXQFEMFUKATKUKO5OGKNEQC5/action/citation_signature","submit_replication":"https://pith.science/pith/33FXQFEMFUKATKUKO5OGKNEQC5/action/replication_record"}},"created_at":"2026-07-05T06:08:11.445576+00:00","updated_at":"2026-07-05T06:08:11.445576+00:00"}