{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EUFX2IISOICTUIPP347CP5X6NO","short_pith_number":"pith:EUFX2IIS","schema_version":"1.0","canonical_sha256":"250b7d211272053a21efdf3e27f6fe6b9f9ccd481ea1fb06189e3f6d987fb564","source":{"kind":"arxiv","id":"1901.03431","version":1},"attestation_state":"computed","paper":{"title":"Efficient implementation of unitary transformations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Reevu Maity, Seth Lloyd","submitted_at":"2019-01-10T23:25:12Z","abstract_excerpt":"Quantum computation and quantum control operate by building unitary transformations out of sequences of elementary quantum logic operations or applications of control fields. This paper puts upper bounds on the minimum time required to implement a desired unitary transformation on a d-dimensional Hilbert space when applying sequences of Hamiltonian transformations. We show that strategies of building up a desired unitary out of non-infinitesimal and infinitesimal unitaries, or equivalently, using power and band limited controls, can yield the best possible scaling in time $O(d^2)$."},"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":"1901.03431","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-01-10T23:25:12Z","cross_cats_sorted":[],"title_canon_sha256":"b3ce35a2bacacd68ca1012429dc05d7bf6d3ed9d1eff565db633e968432cc8bb","abstract_canon_sha256":"9b7b4c560cd0b15d884d32a87c2c204c3574a178361c6b50b547ea0335c2552b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:31.250264Z","signature_b64":"oOXvP9DbGHsPiVPeGpdjN1bsMfQAdJNWkEzTUZZGqtXIJUSAV8LHklTuuXi4BC4rhi+tQO7MHJJvKSsa6JgkBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"250b7d211272053a21efdf3e27f6fe6b9f9ccd481ea1fb06189e3f6d987fb564","last_reissued_at":"2026-05-17T23:56:31.249855Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:31.249855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient implementation of unitary transformations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Reevu Maity, Seth Lloyd","submitted_at":"2019-01-10T23:25:12Z","abstract_excerpt":"Quantum computation and quantum control operate by building unitary transformations out of sequences of elementary quantum logic operations or applications of control fields. This paper puts upper bounds on the minimum time required to implement a desired unitary transformation on a d-dimensional Hilbert space when applying sequences of Hamiltonian transformations. We show that strategies of building up a desired unitary out of non-infinitesimal and infinitesimal unitaries, or equivalently, using power and band limited controls, can yield the best possible scaling in time $O(d^2)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03431","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":"1901.03431","created_at":"2026-05-17T23:56:31.249917+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.03431v1","created_at":"2026-05-17T23:56:31.249917+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03431","created_at":"2026-05-17T23:56:31.249917+00:00"},{"alias_kind":"pith_short_12","alias_value":"EUFX2IISOICT","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"EUFX2IISOICTUIPP","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"EUFX2IIS","created_at":"2026-05-18T12:33:15.570797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.00945","citing_title":"The Dynamical Lie Algebra of QAOA-MaxCut on the Complete Graph","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EUFX2IISOICTUIPP347CP5X6NO","json":"https://pith.science/pith/EUFX2IISOICTUIPP347CP5X6NO.json","graph_json":"https://pith.science/api/pith-number/EUFX2IISOICTUIPP347CP5X6NO/graph.json","events_json":"https://pith.science/api/pith-number/EUFX2IISOICTUIPP347CP5X6NO/events.json","paper":"https://pith.science/paper/EUFX2IIS"},"agent_actions":{"view_html":"https://pith.science/pith/EUFX2IISOICTUIPP347CP5X6NO","download_json":"https://pith.science/pith/EUFX2IISOICTUIPP347CP5X6NO.json","view_paper":"https://pith.science/paper/EUFX2IIS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.03431&json=true","fetch_graph":"https://pith.science/api/pith-number/EUFX2IISOICTUIPP347CP5X6NO/graph.json","fetch_events":"https://pith.science/api/pith-number/EUFX2IISOICTUIPP347CP5X6NO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EUFX2IISOICTUIPP347CP5X6NO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EUFX2IISOICTUIPP347CP5X6NO/action/storage_attestation","attest_author":"https://pith.science/pith/EUFX2IISOICTUIPP347CP5X6NO/action/author_attestation","sign_citation":"https://pith.science/pith/EUFX2IISOICTUIPP347CP5X6NO/action/citation_signature","submit_replication":"https://pith.science/pith/EUFX2IISOICTUIPP347CP5X6NO/action/replication_record"}},"created_at":"2026-05-17T23:56:31.249917+00:00","updated_at":"2026-05-17T23:56:31.249917+00:00"}