{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:KO64C2MH7N7PWCKMQB4MFLQIQQ","short_pith_number":"pith:KO64C2MH","schema_version":"1.0","canonical_sha256":"53bdc16987fb7efb094c8078c2ae088407208c253b62a96778399194df233428","source":{"kind":"arxiv","id":"1011.6013","version":1},"attestation_state":"computed","paper":{"title":"A reduced complexity numerical method for optimal gate synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"math.OC","authors_text":"Matthew R. James, Mile Gu, Srinivas Sridharan, William M. McEneaney","submitted_at":"2010-11-28T03:13:16Z","abstract_excerpt":"Although quantum computers have the potential to efficiently solve certain problems considered difficult by known classical approaches, the design of a quantum circuit remains computationally difficult. It is known that the optimal gate design problem is equivalent to the solution of an associated optimal control problem, the solution to which is also computationally intensive. Hence, in this article, we introduce the application of a class of numerical methods (termed the max-plus curse of dimensionality free techniques) that determine the optimal control thereby synthesizing the desired unit"},"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.6013","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-11-28T03:13:16Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"48c52c179853371cdcc5f84d3fa3e6bc4bd4817c66a69774e68a43d6202cb94e","abstract_canon_sha256":"9cafef78b41b63307658a8f9ec98f19fe3db0502d96bf7ed71ab354993e1652f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:09.723187Z","signature_b64":"rGJUeFWwWJ3PbxgMoVRGl8l4f37TkDzvpiLn8Tk/cZ1LeBO7MmRdfQl5GeuP1ep8yKrHwlrV207ldXbCIrjfDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53bdc16987fb7efb094c8078c2ae088407208c253b62a96778399194df233428","last_reissued_at":"2026-05-18T04:34:09.722724Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:09.722724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A reduced complexity numerical method for optimal gate synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"math.OC","authors_text":"Matthew R. James, Mile Gu, Srinivas Sridharan, William M. McEneaney","submitted_at":"2010-11-28T03:13:16Z","abstract_excerpt":"Although quantum computers have the potential to efficiently solve certain problems considered difficult by known classical approaches, the design of a quantum circuit remains computationally difficult. It is known that the optimal gate design problem is equivalent to the solution of an associated optimal control problem, the solution to which is also computationally intensive. Hence, in this article, we introduce the application of a class of numerical methods (termed the max-plus curse of dimensionality free techniques) that determine the optimal control thereby synthesizing the desired unit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.6013","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":""},"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.6013","created_at":"2026-05-18T04:34:09.722792+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.6013v1","created_at":"2026-05-18T04:34:09.722792+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.6013","created_at":"2026-05-18T04:34:09.722792+00:00"},{"alias_kind":"pith_short_12","alias_value":"KO64C2MH7N7P","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"KO64C2MH7N7PWCKM","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"KO64C2MH","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/KO64C2MH7N7PWCKMQB4MFLQIQQ","json":"https://pith.science/pith/KO64C2MH7N7PWCKMQB4MFLQIQQ.json","graph_json":"https://pith.science/api/pith-number/KO64C2MH7N7PWCKMQB4MFLQIQQ/graph.json","events_json":"https://pith.science/api/pith-number/KO64C2MH7N7PWCKMQB4MFLQIQQ/events.json","paper":"https://pith.science/paper/KO64C2MH"},"agent_actions":{"view_html":"https://pith.science/pith/KO64C2MH7N7PWCKMQB4MFLQIQQ","download_json":"https://pith.science/pith/KO64C2MH7N7PWCKMQB4MFLQIQQ.json","view_paper":"https://pith.science/paper/KO64C2MH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.6013&json=true","fetch_graph":"https://pith.science/api/pith-number/KO64C2MH7N7PWCKMQB4MFLQIQQ/graph.json","fetch_events":"https://pith.science/api/pith-number/KO64C2MH7N7PWCKMQB4MFLQIQQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KO64C2MH7N7PWCKMQB4MFLQIQQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KO64C2MH7N7PWCKMQB4MFLQIQQ/action/storage_attestation","attest_author":"https://pith.science/pith/KO64C2MH7N7PWCKMQB4MFLQIQQ/action/author_attestation","sign_citation":"https://pith.science/pith/KO64C2MH7N7PWCKMQB4MFLQIQQ/action/citation_signature","submit_replication":"https://pith.science/pith/KO64C2MH7N7PWCKMQB4MFLQIQQ/action/replication_record"}},"created_at":"2026-05-18T04:34:09.722792+00:00","updated_at":"2026-05-18T04:34:09.722792+00:00"}