{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:RPBGJIYPW5557DXZKQEEM5X46B","short_pith_number":"pith:RPBGJIYP","schema_version":"1.0","canonical_sha256":"8bc264a30fb77bdf8ef954084676fcf04dfbb73c22ade1a5dcb52586983d65b5","source":{"kind":"arxiv","id":"2207.01539","version":1},"attestation_state":"computed","paper":{"title":"Clifford Circuit Initialisation for Variational Quantum Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"A. C. Medina, B. X. Li, C. N. Self, K. E. Khosla, M. H. Cheng, M. Lin, M. S. Kim","submitted_at":"2022-07-04T15:59:33Z","abstract_excerpt":"We present an initialisation method for variational quantum algorithms applicable to intermediate scale quantum computers. The method uses simulated annealing of the efficiently simulable Clifford parameter points as a pre-optimisation to find a low energy initial condition. We numerically demonstrate the effectiveness of the technique, and how it depends on Hamiltonian structure, number of qubits and circuit depth. While a range of different problems are considered, we note that the method is particularly useful for quantum chemistry problems. This presented method could help achieve a quantu"},"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":"2207.01539","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-07-04T15:59:33Z","cross_cats_sorted":[],"title_canon_sha256":"31218ea87951eec90cfc6615e11c49e3618990e691dce1b326b9ddaeb1336de0","abstract_canon_sha256":"2cff46db9b958daf954e514878b8297443266c857fff192fb05b86e30dec0661"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:37:13.125351Z","signature_b64":"dYFsZ5taw36ddLDvIyP8+cN2TKTKfXC2UrWVc/UV25AGuyiRtWnYNugC0f5mnTNdMnG+pcom5ikGQL/h4iUMBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bc264a30fb77bdf8ef954084676fcf04dfbb73c22ade1a5dcb52586983d65b5","last_reissued_at":"2026-07-05T04:37:13.124967Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:37:13.124967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clifford Circuit Initialisation for Variational Quantum Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"A. C. Medina, B. X. Li, C. N. Self, K. E. Khosla, M. H. Cheng, M. Lin, M. S. Kim","submitted_at":"2022-07-04T15:59:33Z","abstract_excerpt":"We present an initialisation method for variational quantum algorithms applicable to intermediate scale quantum computers. The method uses simulated annealing of the efficiently simulable Clifford parameter points as a pre-optimisation to find a low energy initial condition. We numerically demonstrate the effectiveness of the technique, and how it depends on Hamiltonian structure, number of qubits and circuit depth. While a range of different problems are considered, we note that the method is particularly useful for quantum chemistry problems. This presented method could help achieve a quantu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.01539","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/2207.01539/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":"2207.01539","created_at":"2026-07-05T04:37:13.125019+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.01539v1","created_at":"2026-07-05T04:37:13.125019+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.01539","created_at":"2026-07-05T04:37:13.125019+00:00"},{"alias_kind":"pith_short_12","alias_value":"RPBGJIYPW555","created_at":"2026-07-05T04:37:13.125019+00:00"},{"alias_kind":"pith_short_16","alias_value":"RPBGJIYPW5557DXZ","created_at":"2026-07-05T04:37:13.125019+00:00"},{"alias_kind":"pith_short_8","alias_value":"RPBGJIYP","created_at":"2026-07-05T04:37:13.125019+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.06320","citing_title":"Improving stabilizer approximation with quantum strategy","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RPBGJIYPW5557DXZKQEEM5X46B","json":"https://pith.science/pith/RPBGJIYPW5557DXZKQEEM5X46B.json","graph_json":"https://pith.science/api/pith-number/RPBGJIYPW5557DXZKQEEM5X46B/graph.json","events_json":"https://pith.science/api/pith-number/RPBGJIYPW5557DXZKQEEM5X46B/events.json","paper":"https://pith.science/paper/RPBGJIYP"},"agent_actions":{"view_html":"https://pith.science/pith/RPBGJIYPW5557DXZKQEEM5X46B","download_json":"https://pith.science/pith/RPBGJIYPW5557DXZKQEEM5X46B.json","view_paper":"https://pith.science/paper/RPBGJIYP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.01539&json=true","fetch_graph":"https://pith.science/api/pith-number/RPBGJIYPW5557DXZKQEEM5X46B/graph.json","fetch_events":"https://pith.science/api/pith-number/RPBGJIYPW5557DXZKQEEM5X46B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RPBGJIYPW5557DXZKQEEM5X46B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RPBGJIYPW5557DXZKQEEM5X46B/action/storage_attestation","attest_author":"https://pith.science/pith/RPBGJIYPW5557DXZKQEEM5X46B/action/author_attestation","sign_citation":"https://pith.science/pith/RPBGJIYPW5557DXZKQEEM5X46B/action/citation_signature","submit_replication":"https://pith.science/pith/RPBGJIYPW5557DXZKQEEM5X46B/action/replication_record"}},"created_at":"2026-07-05T04:37:13.125019+00:00","updated_at":"2026-07-05T04:37:13.125019+00:00"}