{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:IIRHD3MTCKLRC3ET7AE4NS7VLB","short_pith_number":"pith:IIRHD3MT","schema_version":"1.0","canonical_sha256":"422271ed931297116c93f809c6cbf55852dfdc3ae987d3f22c51a9640d44fcf1","source":{"kind":"arxiv","id":"1011.4874","version":3},"attestation_state":"computed","paper":{"title":"Comparing, Optimising and Benchmarking Quantum Control Algorithms in a Unifying Programming Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"quant-ph","authors_text":"A. Gruslys, P. de Fouquieres, S.J. Glaser, S. Machnes, S. Schirmer, T. Schulte-Herbrueggen, U. Sander","submitted_at":"2010-11-22T17:02:45Z","abstract_excerpt":"For paving the way to novel applications in quantum simulation, computation, and technology, increasingly large quantum systems have to be steered with high precision. It is a typical task amenable to numerical optimal control to turn the time course of pulses, i.e. piecewise constant control amplitudes, iteratively into an optimised shape. Here, we present the first comparative study of optimal control algorithms for a wide range of finite-dimensional applications. We focus on the most commonly used algorithms: GRAPE methods which update all controls concurrently, and KROTOV-type methods whic"},"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":"1011.4874","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-11-22T17:02:45Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"08f8456cab28019cb46992101a50fbed65814f50fe95b77ff55303409138ddff","abstract_canon_sha256":"db280c62adbc678fdb9ae573cb2ae80f2e30c474abb5b8ea21c2080d9fc2a2e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:36.046137Z","signature_b64":"fEjmKBSPm4bAfoEZXVxLPzD28/UpDE23flg/jneTRU4Qd8QRIMlSAodCzhWnFXVsWqdtXatcyITgnL06AOfACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"422271ed931297116c93f809c6cbf55852dfdc3ae987d3f22c51a9640d44fcf1","last_reissued_at":"2026-05-18T02:23:36.045521Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:36.045521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Comparing, Optimising and Benchmarking Quantum Control Algorithms in a Unifying Programming Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"quant-ph","authors_text":"A. Gruslys, P. de Fouquieres, S.J. Glaser, S. Machnes, S. Schirmer, T. Schulte-Herbrueggen, U. Sander","submitted_at":"2010-11-22T17:02:45Z","abstract_excerpt":"For paving the way to novel applications in quantum simulation, computation, and technology, increasingly large quantum systems have to be steered with high precision. It is a typical task amenable to numerical optimal control to turn the time course of pulses, i.e. piecewise constant control amplitudes, iteratively into an optimised shape. Here, we present the first comparative study of optimal control algorithms for a wide range of finite-dimensional applications. We focus on the most commonly used algorithms: GRAPE methods which update all controls concurrently, and KROTOV-type methods whic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.4874","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":""},"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":"1011.4874","created_at":"2026-05-18T02:23:36.045611+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.4874v3","created_at":"2026-05-18T02:23:36.045611+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.4874","created_at":"2026-05-18T02:23:36.045611+00:00"},{"alias_kind":"pith_short_12","alias_value":"IIRHD3MTCKLR","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"IIRHD3MTCKLRC3ET","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"IIRHD3MT","created_at":"2026-05-18T12:26:09.077623+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IIRHD3MTCKLRC3ET7AE4NS7VLB","json":"https://pith.science/pith/IIRHD3MTCKLRC3ET7AE4NS7VLB.json","graph_json":"https://pith.science/api/pith-number/IIRHD3MTCKLRC3ET7AE4NS7VLB/graph.json","events_json":"https://pith.science/api/pith-number/IIRHD3MTCKLRC3ET7AE4NS7VLB/events.json","paper":"https://pith.science/paper/IIRHD3MT"},"agent_actions":{"view_html":"https://pith.science/pith/IIRHD3MTCKLRC3ET7AE4NS7VLB","download_json":"https://pith.science/pith/IIRHD3MTCKLRC3ET7AE4NS7VLB.json","view_paper":"https://pith.science/paper/IIRHD3MT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.4874&json=true","fetch_graph":"https://pith.science/api/pith-number/IIRHD3MTCKLRC3ET7AE4NS7VLB/graph.json","fetch_events":"https://pith.science/api/pith-number/IIRHD3MTCKLRC3ET7AE4NS7VLB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IIRHD3MTCKLRC3ET7AE4NS7VLB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IIRHD3MTCKLRC3ET7AE4NS7VLB/action/storage_attestation","attest_author":"https://pith.science/pith/IIRHD3MTCKLRC3ET7AE4NS7VLB/action/author_attestation","sign_citation":"https://pith.science/pith/IIRHD3MTCKLRC3ET7AE4NS7VLB/action/citation_signature","submit_replication":"https://pith.science/pith/IIRHD3MTCKLRC3ET7AE4NS7VLB/action/replication_record"}},"created_at":"2026-05-18T02:23:36.045611+00:00","updated_at":"2026-05-18T02:23:36.045611+00:00"}