{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:G2GL4H5NYODE3ZD4MVVPI6RXAT","short_pith_number":"pith:G2GL4H5N","schema_version":"1.0","canonical_sha256":"368cbe1fadc3864de47c656af47a3704ebec948137e26051b08f741b10a29f8b","source":{"kind":"arxiv","id":"2504.17561","version":1},"attestation_state":"computed","paper":{"title":"Quantum Circuit Construction and Optimization through Hybrid Evolutionary Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Claudia Linnhoff-Popien, Gerhard Stenzel, Leo S\\\"unkel, Michael K\\\"olle, Philipp Altmann, Thomas Gabor","submitted_at":"2025-04-24T13:54:22Z","abstract_excerpt":"We apply a hybrid evolutionary algorithm to minimize the depth of circuits in quantum computing. More specifically, we evaluate two different variants of the algorithm. In the first approach, we combine the evolutionary algorithm with an optimization subroutine to optimize the parameters of the rotation gates present in the quantum circuit. In the second, the algorithm solely relies on evolutionary operations (i.e., mutations and crossover). We approach the problem from two sides: (1) constructing circuits from the ground up by starting with random initializations and (2) initializing individu"},"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":"2504.17561","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-04-24T13:54:22Z","cross_cats_sorted":[],"title_canon_sha256":"204500a0f83d56a5335926a28c6751f24bf92123c0f751717e9823b4d4d08616","abstract_canon_sha256":"4b3db25cb0c29ab108e2fdf32c2114efe54c3611edbdcaaf5e07fd04d5421411"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:53:31.144332Z","signature_b64":"OCLfTEE4QxvzVhvAH2AGVSY73qfxDqiO5SZ6PDQlBAkhjg2JyYRjsvvoILbT46H2Vli7mAyWaIWfrWIjf7g8CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"368cbe1fadc3864de47c656af47a3704ebec948137e26051b08f741b10a29f8b","last_reissued_at":"2026-07-05T10:53:31.143557Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:53:31.143557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Circuit Construction and Optimization through Hybrid Evolutionary Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Claudia Linnhoff-Popien, Gerhard Stenzel, Leo S\\\"unkel, Michael K\\\"olle, Philipp Altmann, Thomas Gabor","submitted_at":"2025-04-24T13:54:22Z","abstract_excerpt":"We apply a hybrid evolutionary algorithm to minimize the depth of circuits in quantum computing. More specifically, we evaluate two different variants of the algorithm. In the first approach, we combine the evolutionary algorithm with an optimization subroutine to optimize the parameters of the rotation gates present in the quantum circuit. In the second, the algorithm solely relies on evolutionary operations (i.e., mutations and crossover). We approach the problem from two sides: (1) constructing circuits from the ground up by starting with random initializations and (2) initializing individu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.17561","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/2504.17561/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":"2504.17561","created_at":"2026-07-05T10:53:31.143651+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.17561v1","created_at":"2026-07-05T10:53:31.143651+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.17561","created_at":"2026-07-05T10:53:31.143651+00:00"},{"alias_kind":"pith_short_12","alias_value":"G2GL4H5NYODE","created_at":"2026-07-05T10:53:31.143651+00:00"},{"alias_kind":"pith_short_16","alias_value":"G2GL4H5NYODE3ZD4","created_at":"2026-07-05T10:53:31.143651+00:00"},{"alias_kind":"pith_short_8","alias_value":"G2GL4H5N","created_at":"2026-07-05T10:53:31.143651+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/G2GL4H5NYODE3ZD4MVVPI6RXAT","json":"https://pith.science/pith/G2GL4H5NYODE3ZD4MVVPI6RXAT.json","graph_json":"https://pith.science/api/pith-number/G2GL4H5NYODE3ZD4MVVPI6RXAT/graph.json","events_json":"https://pith.science/api/pith-number/G2GL4H5NYODE3ZD4MVVPI6RXAT/events.json","paper":"https://pith.science/paper/G2GL4H5N"},"agent_actions":{"view_html":"https://pith.science/pith/G2GL4H5NYODE3ZD4MVVPI6RXAT","download_json":"https://pith.science/pith/G2GL4H5NYODE3ZD4MVVPI6RXAT.json","view_paper":"https://pith.science/paper/G2GL4H5N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.17561&json=true","fetch_graph":"https://pith.science/api/pith-number/G2GL4H5NYODE3ZD4MVVPI6RXAT/graph.json","fetch_events":"https://pith.science/api/pith-number/G2GL4H5NYODE3ZD4MVVPI6RXAT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G2GL4H5NYODE3ZD4MVVPI6RXAT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G2GL4H5NYODE3ZD4MVVPI6RXAT/action/storage_attestation","attest_author":"https://pith.science/pith/G2GL4H5NYODE3ZD4MVVPI6RXAT/action/author_attestation","sign_citation":"https://pith.science/pith/G2GL4H5NYODE3ZD4MVVPI6RXAT/action/citation_signature","submit_replication":"https://pith.science/pith/G2GL4H5NYODE3ZD4MVVPI6RXAT/action/replication_record"}},"created_at":"2026-07-05T10:53:31.143651+00:00","updated_at":"2026-07-05T10:53:31.143651+00:00"}