{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:JFQ6RWGTWMIPL43VGG7YFRLVMM","short_pith_number":"pith:JFQ6RWGT","schema_version":"1.0","canonical_sha256":"4961e8d8d3b310f5f37531bf82c5756338ffd281fe8c355efa1bc4e18bbc2748","source":{"kind":"arxiv","id":"1903.12166","version":1},"attestation_state":"computed","paper":{"title":"Sequential minimal optimization for quantum-classical hybrid algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.comp-ph"],"primary_cat":"quant-ph","authors_text":"Keisuke Fujii, Ken M. Nakanishi, Synge Todo","submitted_at":"2019-03-28T17:51:22Z","abstract_excerpt":"We propose a sequential minimal optimization method for quantum-classical hybrid algorithms, which converges faster, is robust against statistical error, and is hyperparameter-free. Specifically, the optimization problem of the parameterized quantum circuits is divided into solvable subproblems by considering only a subset of the parameters. In fact, if we choose a single parameter, the cost function becomes a simple sine curve with period $2\\pi$, and hence we can exactly minimize with respect to the chosen parameter. Furthermore, even in general cases, the cost function is given by a simple s"},"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":"1903.12166","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-03-28T17:51:22Z","cross_cats_sorted":["physics.comp-ph"],"title_canon_sha256":"394f5c653ecddec88206ea30531a9deaf4515e5b7187b1587c102284faf97d79","abstract_canon_sha256":"990234016a6c488b6616673075751030d8ef77d9b8371ed859e8dc78829b5f4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:48:41.853991Z","signature_b64":"1mgoin5wa983uFiPfyYrMfmmQDuupEKa9fnVXLVPVWNSr7I+JPuG252L/ui4CLpjAaZtLURN1b6Tqug1IoW2AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4961e8d8d3b310f5f37531bf82c5756338ffd281fe8c355efa1bc4e18bbc2748","last_reissued_at":"2026-07-05T01:48:41.853524Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:48:41.853524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sequential minimal optimization for quantum-classical hybrid algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.comp-ph"],"primary_cat":"quant-ph","authors_text":"Keisuke Fujii, Ken M. Nakanishi, Synge Todo","submitted_at":"2019-03-28T17:51:22Z","abstract_excerpt":"We propose a sequential minimal optimization method for quantum-classical hybrid algorithms, which converges faster, is robust against statistical error, and is hyperparameter-free. Specifically, the optimization problem of the parameterized quantum circuits is divided into solvable subproblems by considering only a subset of the parameters. In fact, if we choose a single parameter, the cost function becomes a simple sine curve with period $2\\pi$, and hence we can exactly minimize with respect to the chosen parameter. Furthermore, even in general cases, the cost function is given by a simple s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.12166","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/1903.12166/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":"1903.12166","created_at":"2026-07-05T01:48:41.853581+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.12166v1","created_at":"2026-07-05T01:48:41.853581+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.12166","created_at":"2026-07-05T01:48:41.853581+00:00"},{"alias_kind":"pith_short_12","alias_value":"JFQ6RWGTWMIP","created_at":"2026-07-05T01:48:41.853581+00:00"},{"alias_kind":"pith_short_16","alias_value":"JFQ6RWGTWMIPL43V","created_at":"2026-07-05T01:48:41.853581+00:00"},{"alias_kind":"pith_short_8","alias_value":"JFQ6RWGT","created_at":"2026-07-05T01:48:41.853581+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.09836","citing_title":"Variational Quantum Algorithm for Non-equilibrium Steady States","ref_index":57,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JFQ6RWGTWMIPL43VGG7YFRLVMM","json":"https://pith.science/pith/JFQ6RWGTWMIPL43VGG7YFRLVMM.json","graph_json":"https://pith.science/api/pith-number/JFQ6RWGTWMIPL43VGG7YFRLVMM/graph.json","events_json":"https://pith.science/api/pith-number/JFQ6RWGTWMIPL43VGG7YFRLVMM/events.json","paper":"https://pith.science/paper/JFQ6RWGT"},"agent_actions":{"view_html":"https://pith.science/pith/JFQ6RWGTWMIPL43VGG7YFRLVMM","download_json":"https://pith.science/pith/JFQ6RWGTWMIPL43VGG7YFRLVMM.json","view_paper":"https://pith.science/paper/JFQ6RWGT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.12166&json=true","fetch_graph":"https://pith.science/api/pith-number/JFQ6RWGTWMIPL43VGG7YFRLVMM/graph.json","fetch_events":"https://pith.science/api/pith-number/JFQ6RWGTWMIPL43VGG7YFRLVMM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JFQ6RWGTWMIPL43VGG7YFRLVMM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JFQ6RWGTWMIPL43VGG7YFRLVMM/action/storage_attestation","attest_author":"https://pith.science/pith/JFQ6RWGTWMIPL43VGG7YFRLVMM/action/author_attestation","sign_citation":"https://pith.science/pith/JFQ6RWGTWMIPL43VGG7YFRLVMM/action/citation_signature","submit_replication":"https://pith.science/pith/JFQ6RWGTWMIPL43VGG7YFRLVMM/action/replication_record"}},"created_at":"2026-07-05T01:48:41.853581+00:00","updated_at":"2026-07-05T01:48:41.853581+00:00"}