{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:QR2GV2ESZH3VV4M5LVUXCQWKRG","short_pith_number":"pith:QR2GV2ES","schema_version":"1.0","canonical_sha256":"84746ae892c9f75af19d5d697142ca8980f6b78f4109455afd4c94e3c20b7eb3","source":{"kind":"arxiv","id":"2508.04288","version":1},"attestation_state":"computed","paper":{"title":"Challenges in Applying Variational Quantum Algorithms to Dynamic Satellite Network Routing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.SY","eess.SY"],"primary_cat":"quant-ph","authors_text":"Phuc Hao Do, Tran Duc Le","submitted_at":"2025-08-06T10:25:39Z","abstract_excerpt":"Applying near-term variational quantum algorithms to the problem of dynamic satellite network routing represents a promising direction for quantum computing. In this work, we provide a critical evaluation of two major approaches: static quantum optimizers such as the Variational Quantum Eigensolver (VQE) and the Quantum Approximate Optimization Algorithm (QAOA) for offline route computation, and Quantum Reinforcement Learning (QRL) methods for online decision-making. Using ideal, noise-free simulations, we find that these algorithms face significant challenges. Specifically, static optimizers "},"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":"2508.04288","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-08-06T10:25:39Z","cross_cats_sorted":["cs.AI","cs.SY","eess.SY"],"title_canon_sha256":"e558b33ef9150c8d8a329f8a7cc0c53410edf334fdb66e155451283d76fd9f97","abstract_canon_sha256":"353ec29488e5c706531db16c6b3f187d69ff0921be42d39e8d26f26307e3a453"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:49:24.248043Z","signature_b64":"y4k9l7EPVndfViVLO2dlVtMmAzl2rZENvQZaffBtL+CMQ3OOCOhoRaio06SKnLinLy9WAFH+G68kU8fOGzXnBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84746ae892c9f75af19d5d697142ca8980f6b78f4109455afd4c94e3c20b7eb3","last_reissued_at":"2026-07-05T11:49:24.247541Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:49:24.247541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Challenges in Applying Variational Quantum Algorithms to Dynamic Satellite Network Routing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.SY","eess.SY"],"primary_cat":"quant-ph","authors_text":"Phuc Hao Do, Tran Duc Le","submitted_at":"2025-08-06T10:25:39Z","abstract_excerpt":"Applying near-term variational quantum algorithms to the problem of dynamic satellite network routing represents a promising direction for quantum computing. In this work, we provide a critical evaluation of two major approaches: static quantum optimizers such as the Variational Quantum Eigensolver (VQE) and the Quantum Approximate Optimization Algorithm (QAOA) for offline route computation, and Quantum Reinforcement Learning (QRL) methods for online decision-making. Using ideal, noise-free simulations, we find that these algorithms face significant challenges. Specifically, static optimizers "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.04288","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/2508.04288/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":"2508.04288","created_at":"2026-07-05T11:49:24.247598+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.04288v1","created_at":"2026-07-05T11:49:24.247598+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.04288","created_at":"2026-07-05T11:49:24.247598+00:00"},{"alias_kind":"pith_short_12","alias_value":"QR2GV2ESZH3V","created_at":"2026-07-05T11:49:24.247598+00:00"},{"alias_kind":"pith_short_16","alias_value":"QR2GV2ESZH3VV4M5","created_at":"2026-07-05T11:49:24.247598+00:00"},{"alias_kind":"pith_short_8","alias_value":"QR2GV2ES","created_at":"2026-07-05T11:49:24.247598+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.07924","citing_title":"A Non-Monotonic Relationship: An Empirical Analysis of Hybrid Quantum Classifiers for Unseen Ransomware Detection","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QR2GV2ESZH3VV4M5LVUXCQWKRG","json":"https://pith.science/pith/QR2GV2ESZH3VV4M5LVUXCQWKRG.json","graph_json":"https://pith.science/api/pith-number/QR2GV2ESZH3VV4M5LVUXCQWKRG/graph.json","events_json":"https://pith.science/api/pith-number/QR2GV2ESZH3VV4M5LVUXCQWKRG/events.json","paper":"https://pith.science/paper/QR2GV2ES"},"agent_actions":{"view_html":"https://pith.science/pith/QR2GV2ESZH3VV4M5LVUXCQWKRG","download_json":"https://pith.science/pith/QR2GV2ESZH3VV4M5LVUXCQWKRG.json","view_paper":"https://pith.science/paper/QR2GV2ES","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.04288&json=true","fetch_graph":"https://pith.science/api/pith-number/QR2GV2ESZH3VV4M5LVUXCQWKRG/graph.json","fetch_events":"https://pith.science/api/pith-number/QR2GV2ESZH3VV4M5LVUXCQWKRG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QR2GV2ESZH3VV4M5LVUXCQWKRG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QR2GV2ESZH3VV4M5LVUXCQWKRG/action/storage_attestation","attest_author":"https://pith.science/pith/QR2GV2ESZH3VV4M5LVUXCQWKRG/action/author_attestation","sign_citation":"https://pith.science/pith/QR2GV2ESZH3VV4M5LVUXCQWKRG/action/citation_signature","submit_replication":"https://pith.science/pith/QR2GV2ESZH3VV4M5LVUXCQWKRG/action/replication_record"}},"created_at":"2026-07-05T11:49:24.247598+00:00","updated_at":"2026-07-05T11:49:24.247598+00:00"}