{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:I3KTK6BVZODXFNB7JM7EURVRIX","short_pith_number":"pith:I3KTK6BV","schema_version":"1.0","canonical_sha256":"46d5357835cb8772b43f4b3e4a46b145ee2118becb0e5386b5bb0d4e15aad413","source":{"kind":"arxiv","id":"2407.20091","version":1},"attestation_state":"computed","paper":{"title":"Trainability maximization using estimation of distribution algorithms assisted by surrogate modelling for quantum architecture search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Concha Bielza, Hao Wang, Pedro Larra\\~naga, Vedran Dunjko, Vicente P. Soloviev","submitted_at":"2024-07-29T15:22:39Z","abstract_excerpt":"Quantum architecture search (QAS) involves optimizing both the quantum parametric circuit configuration but also its parameters for a variational quantum algorithm. Thus, the problem is known to be multi-level as the performance of a given architecture is unknown until its parameters are tuned using classical routines. Moreover, the task becomes even more complicated since well-known trainability issues, e.g., barren plateaus (BPs), can occur. In this paper, we aim to achieve two improvements in QAS: (1) to reduce the number of measurements by an online surrogate model of the evaluation proces"},"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":"2407.20091","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-07-29T15:22:39Z","cross_cats_sorted":[],"title_canon_sha256":"95fffeb9e7373289a71719376a65b9dcf71da9b33901416088e512ae25c0cd1f","abstract_canon_sha256":"4a94c6ab23e1c89b274c498462ec697ff495e9fe7517cd929a750087bd7b430a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:49:48.779713Z","signature_b64":"ptkxd8zbp26uJ3ik6HQIO177D5T5qhn9Y8EvRGvmOhwkcLI5IrTCJewssJH+zV8fQqD8O5HmBcq6bCX9jmCPDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46d5357835cb8772b43f4b3e4a46b145ee2118becb0e5386b5bb0d4e15aad413","last_reissued_at":"2026-07-05T08:49:48.779259Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:49:48.779259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trainability maximization using estimation of distribution algorithms assisted by surrogate modelling for quantum architecture search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Concha Bielza, Hao Wang, Pedro Larra\\~naga, Vedran Dunjko, Vicente P. Soloviev","submitted_at":"2024-07-29T15:22:39Z","abstract_excerpt":"Quantum architecture search (QAS) involves optimizing both the quantum parametric circuit configuration but also its parameters for a variational quantum algorithm. Thus, the problem is known to be multi-level as the performance of a given architecture is unknown until its parameters are tuned using classical routines. Moreover, the task becomes even more complicated since well-known trainability issues, e.g., barren plateaus (BPs), can occur. In this paper, we aim to achieve two improvements in QAS: (1) to reduce the number of measurements by an online surrogate model of the evaluation proces"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.20091","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/2407.20091/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":"2407.20091","created_at":"2026-07-05T08:49:48.779358+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.20091v1","created_at":"2026-07-05T08:49:48.779358+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.20091","created_at":"2026-07-05T08:49:48.779358+00:00"},{"alias_kind":"pith_short_12","alias_value":"I3KTK6BVZODX","created_at":"2026-07-05T08:49:48.779358+00:00"},{"alias_kind":"pith_short_16","alias_value":"I3KTK6BVZODXFNB7","created_at":"2026-07-05T08:49:48.779358+00:00"},{"alias_kind":"pith_short_8","alias_value":"I3KTK6BV","created_at":"2026-07-05T08:49:48.779358+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/I3KTK6BVZODXFNB7JM7EURVRIX","json":"https://pith.science/pith/I3KTK6BVZODXFNB7JM7EURVRIX.json","graph_json":"https://pith.science/api/pith-number/I3KTK6BVZODXFNB7JM7EURVRIX/graph.json","events_json":"https://pith.science/api/pith-number/I3KTK6BVZODXFNB7JM7EURVRIX/events.json","paper":"https://pith.science/paper/I3KTK6BV"},"agent_actions":{"view_html":"https://pith.science/pith/I3KTK6BVZODXFNB7JM7EURVRIX","download_json":"https://pith.science/pith/I3KTK6BVZODXFNB7JM7EURVRIX.json","view_paper":"https://pith.science/paper/I3KTK6BV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.20091&json=true","fetch_graph":"https://pith.science/api/pith-number/I3KTK6BVZODXFNB7JM7EURVRIX/graph.json","fetch_events":"https://pith.science/api/pith-number/I3KTK6BVZODXFNB7JM7EURVRIX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I3KTK6BVZODXFNB7JM7EURVRIX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I3KTK6BVZODXFNB7JM7EURVRIX/action/storage_attestation","attest_author":"https://pith.science/pith/I3KTK6BVZODXFNB7JM7EURVRIX/action/author_attestation","sign_citation":"https://pith.science/pith/I3KTK6BVZODXFNB7JM7EURVRIX/action/citation_signature","submit_replication":"https://pith.science/pith/I3KTK6BVZODXFNB7JM7EURVRIX/action/replication_record"}},"created_at":"2026-07-05T08:49:48.779358+00:00","updated_at":"2026-07-05T08:49:48.779358+00:00"}