{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:AFCR2DBTCYATQZXEDWVNTLAYCW","short_pith_number":"pith:AFCR2DBT","schema_version":"1.0","canonical_sha256":"01451d0c3316013866e41daad9ac1815a69f0d76cb15f619280a12c727359284","source":{"kind":"arxiv","id":"2505.05380","version":1},"attestation_state":"computed","paper":{"title":"Scalable Quantum Architecture Search via Landscape Analysis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Chenghong Zhu, Guangxi Li, Hao-Kai Zhang, Sixuan Wu, Xian Wu, Xin Wang","submitted_at":"2025-05-08T16:13:23Z","abstract_excerpt":"Balancing trainability and expressibility is a central challenge in variational quantum computing, and quantum architecture search (QAS) plays a pivotal role by automatically designing problem-specific parameterized circuits that address this trade-off. In this work, we introduce a scalable, training-free QAS framework that efficiently explores and evaluates quantum circuits through landscape fluctuation analysis. This analysis captures key characteristics of the cost function landscape, enabling accurate prediction of circuit learnability without costly training. By combining this metric with"},"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":"2505.05380","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-05-08T16:13:23Z","cross_cats_sorted":[],"title_canon_sha256":"1b6230ffd0f7f24e5c74330fa8eabc258aa4cf8173e92ea8d1e7e49ef6026a83","abstract_canon_sha256":"e3e03dd6aa8b6c8675e0a512d9514680b961e9e2dc73c5148ffce1d36573f4f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:00:23.413086Z","signature_b64":"Fc/kSi+VwkvZpysTLHvv/1cqRt3YrdT1UzaFjkdaQ3MEo1yZ7TirFMUcjnZcxDEfVaUJA4730M7L5TxJlR9NBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01451d0c3316013866e41daad9ac1815a69f0d76cb15f619280a12c727359284","last_reissued_at":"2026-07-05T11:00:23.412537Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:00:23.412537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Quantum Architecture Search via Landscape Analysis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Chenghong Zhu, Guangxi Li, Hao-Kai Zhang, Sixuan Wu, Xian Wu, Xin Wang","submitted_at":"2025-05-08T16:13:23Z","abstract_excerpt":"Balancing trainability and expressibility is a central challenge in variational quantum computing, and quantum architecture search (QAS) plays a pivotal role by automatically designing problem-specific parameterized circuits that address this trade-off. In this work, we introduce a scalable, training-free QAS framework that efficiently explores and evaluates quantum circuits through landscape fluctuation analysis. This analysis captures key characteristics of the cost function landscape, enabling accurate prediction of circuit learnability without costly training. By combining this metric with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.05380","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/2505.05380/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":"2505.05380","created_at":"2026-07-05T11:00:23.412597+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.05380v1","created_at":"2026-07-05T11:00:23.412597+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.05380","created_at":"2026-07-05T11:00:23.412597+00:00"},{"alias_kind":"pith_short_12","alias_value":"AFCR2DBTCYAT","created_at":"2026-07-05T11:00:23.412597+00:00"},{"alias_kind":"pith_short_16","alias_value":"AFCR2DBTCYATQZXE","created_at":"2026-07-05T11:00:23.412597+00:00"},{"alias_kind":"pith_short_8","alias_value":"AFCR2DBT","created_at":"2026-07-05T11:00:23.412597+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.26289","citing_title":"Recent Advances in Quantum Architecture Search","ref_index":64,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AFCR2DBTCYATQZXEDWVNTLAYCW","json":"https://pith.science/pith/AFCR2DBTCYATQZXEDWVNTLAYCW.json","graph_json":"https://pith.science/api/pith-number/AFCR2DBTCYATQZXEDWVNTLAYCW/graph.json","events_json":"https://pith.science/api/pith-number/AFCR2DBTCYATQZXEDWVNTLAYCW/events.json","paper":"https://pith.science/paper/AFCR2DBT"},"agent_actions":{"view_html":"https://pith.science/pith/AFCR2DBTCYATQZXEDWVNTLAYCW","download_json":"https://pith.science/pith/AFCR2DBTCYATQZXEDWVNTLAYCW.json","view_paper":"https://pith.science/paper/AFCR2DBT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.05380&json=true","fetch_graph":"https://pith.science/api/pith-number/AFCR2DBTCYATQZXEDWVNTLAYCW/graph.json","fetch_events":"https://pith.science/api/pith-number/AFCR2DBTCYATQZXEDWVNTLAYCW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AFCR2DBTCYATQZXEDWVNTLAYCW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AFCR2DBTCYATQZXEDWVNTLAYCW/action/storage_attestation","attest_author":"https://pith.science/pith/AFCR2DBTCYATQZXEDWVNTLAYCW/action/author_attestation","sign_citation":"https://pith.science/pith/AFCR2DBTCYATQZXEDWVNTLAYCW/action/citation_signature","submit_replication":"https://pith.science/pith/AFCR2DBTCYATQZXEDWVNTLAYCW/action/replication_record"}},"created_at":"2026-07-05T11:00:23.412597+00:00","updated_at":"2026-07-05T11:00:23.412597+00:00"}