{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5NXUAS5H2ZWZBHNHIHUNTFQR5X","short_pith_number":"pith:5NXUAS5H","schema_version":"1.0","canonical_sha256":"eb6f404ba7d66d909da741e8d99611edf5867bf5503c6efc2a82162d5cd451c5","source":{"kind":"arxiv","id":"2406.12371","version":1},"attestation_state":"computed","paper":{"title":"Hybrid Quantum-Classical Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Roberto Campos","submitted_at":"2024-06-18T07:54:05Z","abstract_excerpt":"This thesis explores hybrid algorithms that combine classical and quantum computing to enhance the performance of classical algorithms. Two approaches are studied: a hybrid search and sample optimization algorithm and a classical algorithm that assesses the cost and performance of quantum algorithms in chemistry. Hybrid algorithms are vital due to limitations in both classical and quantum computing, offering a solution by leveraging the strengths of both. The first algorithm, quantum Metropolis Solver (QMS), adapts a quantum walk to a Metropolis-Hastings algorithm for industrial applications, "},"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":"2406.12371","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-06-18T07:54:05Z","cross_cats_sorted":[],"title_canon_sha256":"93e2599e4d6458ecd8c5a6db766f39e7fc252a819a557b0cd8a0cc2c66b23f91","abstract_canon_sha256":"2c7735bc9d8a7b0e87c66b0d2a8a5d3a7c9157634be34c24ba5b7ac6f40cc227"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:33:45.035979Z","signature_b64":"CnR4YEzcNJNyLdVGDRZU56nBR+X2FMbmbG/AHAwNEC0mRbnY1Fe7ZRSku8gngP92Yh0+pmBu+xU9q6NYDwhSAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb6f404ba7d66d909da741e8d99611edf5867bf5503c6efc2a82162d5cd451c5","last_reissued_at":"2026-07-05T08:33:45.035559Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:33:45.035559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hybrid Quantum-Classical Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Roberto Campos","submitted_at":"2024-06-18T07:54:05Z","abstract_excerpt":"This thesis explores hybrid algorithms that combine classical and quantum computing to enhance the performance of classical algorithms. Two approaches are studied: a hybrid search and sample optimization algorithm and a classical algorithm that assesses the cost and performance of quantum algorithms in chemistry. Hybrid algorithms are vital due to limitations in both classical and quantum computing, offering a solution by leveraging the strengths of both. The first algorithm, quantum Metropolis Solver (QMS), adapts a quantum walk to a Metropolis-Hastings algorithm for industrial applications, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.12371","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/2406.12371/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":"2406.12371","created_at":"2026-07-05T08:33:45.035617+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.12371v1","created_at":"2026-07-05T08:33:45.035617+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.12371","created_at":"2026-07-05T08:33:45.035617+00:00"},{"alias_kind":"pith_short_12","alias_value":"5NXUAS5H2ZWZ","created_at":"2026-07-05T08:33:45.035617+00:00"},{"alias_kind":"pith_short_16","alias_value":"5NXUAS5H2ZWZBHNH","created_at":"2026-07-05T08:33:45.035617+00:00"},{"alias_kind":"pith_short_8","alias_value":"5NXUAS5H","created_at":"2026-07-05T08:33:45.035617+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.09528","citing_title":"Comprehensive Survey of QML: From Data Analysis to Algorithmic Advancements","ref_index":37,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5NXUAS5H2ZWZBHNHIHUNTFQR5X","json":"https://pith.science/pith/5NXUAS5H2ZWZBHNHIHUNTFQR5X.json","graph_json":"https://pith.science/api/pith-number/5NXUAS5H2ZWZBHNHIHUNTFQR5X/graph.json","events_json":"https://pith.science/api/pith-number/5NXUAS5H2ZWZBHNHIHUNTFQR5X/events.json","paper":"https://pith.science/paper/5NXUAS5H"},"agent_actions":{"view_html":"https://pith.science/pith/5NXUAS5H2ZWZBHNHIHUNTFQR5X","download_json":"https://pith.science/pith/5NXUAS5H2ZWZBHNHIHUNTFQR5X.json","view_paper":"https://pith.science/paper/5NXUAS5H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.12371&json=true","fetch_graph":"https://pith.science/api/pith-number/5NXUAS5H2ZWZBHNHIHUNTFQR5X/graph.json","fetch_events":"https://pith.science/api/pith-number/5NXUAS5H2ZWZBHNHIHUNTFQR5X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5NXUAS5H2ZWZBHNHIHUNTFQR5X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5NXUAS5H2ZWZBHNHIHUNTFQR5X/action/storage_attestation","attest_author":"https://pith.science/pith/5NXUAS5H2ZWZBHNHIHUNTFQR5X/action/author_attestation","sign_citation":"https://pith.science/pith/5NXUAS5H2ZWZBHNHIHUNTFQR5X/action/citation_signature","submit_replication":"https://pith.science/pith/5NXUAS5H2ZWZBHNHIHUNTFQR5X/action/replication_record"}},"created_at":"2026-07-05T08:33:45.035617+00:00","updated_at":"2026-07-05T08:33:45.035617+00:00"}