{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DUEPOETUEJSWVVD4YSLAPMNS65","short_pith_number":"pith:DUEPOETU","schema_version":"1.0","canonical_sha256":"1d08f7127422656ad47cc49607b1b2f77f2d1f0f01386fd03d21f7a8629903e9","source":{"kind":"arxiv","id":"2408.03026","version":3},"attestation_state":"computed","paper":{"title":"Deep Unfolded Local Quantum Annealing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.dis-nn"],"primary_cat":"quant-ph","authors_text":"Satoshi Takabe, Shunta Arai","submitted_at":"2024-08-06T08:19:51Z","abstract_excerpt":"Local quantum annealing (LQA), an iterative algorithm, is designed to solve combinatorial optimization problems. It draws inspiration from QA, which utilizes adiabatic time evolution to determine the global minimum of a given objective function. In the original LQA, the classical Hamiltonian is minimized via gradient descent. The performance of LQA depends on the choice of the parameters. Owing to the non-convex nature of the original cost function, LQA often becomes trapped in local minima, limiting its effectiveness. To address this challenge, we combine LQA with a deep unfolding scheme, whi"},"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":"2408.03026","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-08-06T08:19:51Z","cross_cats_sorted":["cond-mat.dis-nn"],"title_canon_sha256":"40729823b01e7dba69cdaee28851a8d6a0cea3fb335eedf3eca29cbb5e013724","abstract_canon_sha256":"9a87d4298aee4656a913940073c59e93e51cf278b103df5fb24078276d637fdb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:56:53.546615Z","signature_b64":"EqDWnLU+1vAjvfMgxvH1BOw1q/KFg2C8+g2P4PY7mUnWx2irKXw2i7pT2EOV6RzSyz3fQa1lTSkmq90YClVqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d08f7127422656ad47cc49607b1b2f77f2d1f0f01386fd03d21f7a8629903e9","last_reissued_at":"2026-07-05T09:56:53.546153Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:56:53.546153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Unfolded Local Quantum Annealing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.dis-nn"],"primary_cat":"quant-ph","authors_text":"Satoshi Takabe, Shunta Arai","submitted_at":"2024-08-06T08:19:51Z","abstract_excerpt":"Local quantum annealing (LQA), an iterative algorithm, is designed to solve combinatorial optimization problems. It draws inspiration from QA, which utilizes adiabatic time evolution to determine the global minimum of a given objective function. In the original LQA, the classical Hamiltonian is minimized via gradient descent. The performance of LQA depends on the choice of the parameters. Owing to the non-convex nature of the original cost function, LQA often becomes trapped in local minima, limiting its effectiveness. To address this challenge, we combine LQA with a deep unfolding scheme, whi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.03026","kind":"arxiv","version":3},"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/2408.03026/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":"2408.03026","created_at":"2026-07-05T09:56:53.546218+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.03026v3","created_at":"2026-07-05T09:56:53.546218+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.03026","created_at":"2026-07-05T09:56:53.546218+00:00"},{"alias_kind":"pith_short_12","alias_value":"DUEPOETUEJSW","created_at":"2026-07-05T09:56:53.546218+00:00"},{"alias_kind":"pith_short_16","alias_value":"DUEPOETUEJSWVVD4","created_at":"2026-07-05T09:56:53.546218+00:00"},{"alias_kind":"pith_short_8","alias_value":"DUEPOETU","created_at":"2026-07-05T09:56:53.546218+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.20016","citing_title":"New Insights on Unfolding and Fine-tuning Quantum Federated Learning","ref_index":57,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DUEPOETUEJSWVVD4YSLAPMNS65","json":"https://pith.science/pith/DUEPOETUEJSWVVD4YSLAPMNS65.json","graph_json":"https://pith.science/api/pith-number/DUEPOETUEJSWVVD4YSLAPMNS65/graph.json","events_json":"https://pith.science/api/pith-number/DUEPOETUEJSWVVD4YSLAPMNS65/events.json","paper":"https://pith.science/paper/DUEPOETU"},"agent_actions":{"view_html":"https://pith.science/pith/DUEPOETUEJSWVVD4YSLAPMNS65","download_json":"https://pith.science/pith/DUEPOETUEJSWVVD4YSLAPMNS65.json","view_paper":"https://pith.science/paper/DUEPOETU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.03026&json=true","fetch_graph":"https://pith.science/api/pith-number/DUEPOETUEJSWVVD4YSLAPMNS65/graph.json","fetch_events":"https://pith.science/api/pith-number/DUEPOETUEJSWVVD4YSLAPMNS65/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DUEPOETUEJSWVVD4YSLAPMNS65/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DUEPOETUEJSWVVD4YSLAPMNS65/action/storage_attestation","attest_author":"https://pith.science/pith/DUEPOETUEJSWVVD4YSLAPMNS65/action/author_attestation","sign_citation":"https://pith.science/pith/DUEPOETUEJSWVVD4YSLAPMNS65/action/citation_signature","submit_replication":"https://pith.science/pith/DUEPOETUEJSWVVD4YSLAPMNS65/action/replication_record"}},"created_at":"2026-07-05T09:56:53.546218+00:00","updated_at":"2026-07-05T09:56:53.546218+00:00"}