{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:BQWJS2I5G4SSRXUGBPXMZTSOKL","short_pith_number":"pith:BQWJS2I5","schema_version":"1.0","canonical_sha256":"0c2c99691d372528de860beeccce4e52efb384c2c38d375903c8d94d0160e68e","source":{"kind":"arxiv","id":"2409.15426","version":1},"attestation_state":"computed","paper":{"title":"FOCQS: Feedback Optimally Controlled Quantum States","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Lucas T. Brady, Stuart Hadfield","submitted_at":"2024-09-23T18:00:06Z","abstract_excerpt":"Quantum optimization, both for classical and quantum functions, is one of the most well-studied applications of quantum computing, but recent trends have relied on hybrid methods that push much of the fine-tuning off onto costly classical algorithms. Feedback-based quantum algorithms, such as FALQON, avoid these fine-tuning problems but at the cost of additional circuit depth and a lack of convergence guarantees. In this work, we take the local greedy information collected by Lyapunov feedback control and develop an analytic framework to use it to perturbatively update previous control layers,"},"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":"2409.15426","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-09-23T18:00:06Z","cross_cats_sorted":[],"title_canon_sha256":"8c5063de325242fb1d0917526b213556436ddcaffac69f16eceb50238ff530e1","abstract_canon_sha256":"8405a2f06b8b36e862211733c8e25342491d0ed3865a4bdd35b409a91a4db25b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:10:54.752188Z","signature_b64":"CStsL6Hoa+sUDa9wvjH5gympuTodjP7paJEP49D2rQ0MD8U+zImQTJ9gClIq4NSj9GH9ifnYezALYhkg9wYbDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c2c99691d372528de860beeccce4e52efb384c2c38d375903c8d94d0160e68e","last_reissued_at":"2026-07-05T09:10:54.751722Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:10:54.751722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FOCQS: Feedback Optimally Controlled Quantum States","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Lucas T. Brady, Stuart Hadfield","submitted_at":"2024-09-23T18:00:06Z","abstract_excerpt":"Quantum optimization, both for classical and quantum functions, is one of the most well-studied applications of quantum computing, but recent trends have relied on hybrid methods that push much of the fine-tuning off onto costly classical algorithms. Feedback-based quantum algorithms, such as FALQON, avoid these fine-tuning problems but at the cost of additional circuit depth and a lack of convergence guarantees. In this work, we take the local greedy information collected by Lyapunov feedback control and develop an analytic framework to use it to perturbatively update previous control layers,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.15426","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/2409.15426/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":"2409.15426","created_at":"2026-07-05T09:10:54.751778+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.15426v1","created_at":"2026-07-05T09:10:54.751778+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.15426","created_at":"2026-07-05T09:10:54.751778+00:00"},{"alias_kind":"pith_short_12","alias_value":"BQWJS2I5G4SS","created_at":"2026-07-05T09:10:54.751778+00:00"},{"alias_kind":"pith_short_16","alias_value":"BQWJS2I5G4SSRXUG","created_at":"2026-07-05T09:10:54.751778+00:00"},{"alias_kind":"pith_short_8","alias_value":"BQWJS2I5","created_at":"2026-07-05T09:10:54.751778+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2411.10406","citing_title":"How to Build a Quantum Supercomputer: Scaling from Hundreds to Millions of Qubits","ref_index":92,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BQWJS2I5G4SSRXUGBPXMZTSOKL","json":"https://pith.science/pith/BQWJS2I5G4SSRXUGBPXMZTSOKL.json","graph_json":"https://pith.science/api/pith-number/BQWJS2I5G4SSRXUGBPXMZTSOKL/graph.json","events_json":"https://pith.science/api/pith-number/BQWJS2I5G4SSRXUGBPXMZTSOKL/events.json","paper":"https://pith.science/paper/BQWJS2I5"},"agent_actions":{"view_html":"https://pith.science/pith/BQWJS2I5G4SSRXUGBPXMZTSOKL","download_json":"https://pith.science/pith/BQWJS2I5G4SSRXUGBPXMZTSOKL.json","view_paper":"https://pith.science/paper/BQWJS2I5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.15426&json=true","fetch_graph":"https://pith.science/api/pith-number/BQWJS2I5G4SSRXUGBPXMZTSOKL/graph.json","fetch_events":"https://pith.science/api/pith-number/BQWJS2I5G4SSRXUGBPXMZTSOKL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BQWJS2I5G4SSRXUGBPXMZTSOKL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BQWJS2I5G4SSRXUGBPXMZTSOKL/action/storage_attestation","attest_author":"https://pith.science/pith/BQWJS2I5G4SSRXUGBPXMZTSOKL/action/author_attestation","sign_citation":"https://pith.science/pith/BQWJS2I5G4SSRXUGBPXMZTSOKL/action/citation_signature","submit_replication":"https://pith.science/pith/BQWJS2I5G4SSRXUGBPXMZTSOKL/action/replication_record"}},"created_at":"2026-07-05T09:10:54.751778+00:00","updated_at":"2026-07-05T09:10:54.751778+00:00"}