{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:EASRCEF2XA3ALBEWF63PGJSP2M","short_pith_number":"pith:EASRCEF2","canonical_record":{"source":{"id":"1603.06867","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-03-22T16:56:29Z","cross_cats_sorted":[],"title_canon_sha256":"a0a11b075d5368ae039a05ba69d7058b99db780dace688418ce2d13ebb3cd000","abstract_canon_sha256":"b62c0739dfa1ce387625c047ab796b840e1b1090f1ac7956ee7380bf96834d76"},"schema_version":"1.0"},"canonical_sha256":"20251110bab8360584962fb6f3264fd30848063ef1cacefa29a0041f2740fbb1","source":{"kind":"arxiv","id":"1603.06867","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.06867","created_at":"2026-05-18T01:18:34Z"},{"alias_kind":"arxiv_version","alias_value":"1603.06867v1","created_at":"2026-05-18T01:18:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06867","created_at":"2026-05-18T01:18:34Z"},{"alias_kind":"pith_short_12","alias_value":"EASRCEF2XA3A","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EASRCEF2XA3ALBEW","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EASRCEF2","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:EASRCEF2XA3ALBEWF63PGJSP2M","target":"record","payload":{"canonical_record":{"source":{"id":"1603.06867","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-03-22T16:56:29Z","cross_cats_sorted":[],"title_canon_sha256":"a0a11b075d5368ae039a05ba69d7058b99db780dace688418ce2d13ebb3cd000","abstract_canon_sha256":"b62c0739dfa1ce387625c047ab796b840e1b1090f1ac7956ee7380bf96834d76"},"schema_version":"1.0"},"canonical_sha256":"20251110bab8360584962fb6f3264fd30848063ef1cacefa29a0041f2740fbb1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:34.548533Z","signature_b64":"AB0eS81pCk/ONWxD7h3vCCwvfP25e8VlPrfUMHY4xiNE45PPQ+yaAZQfD6ngNH7wQf9gR+8Smhx01tgCgjzSDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20251110bab8360584962fb6f3264fd30848063ef1cacefa29a0041f2740fbb1","last_reissued_at":"2026-05-18T01:18:34.548007Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:34.548007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.06867","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:18:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iPIMHXc+rMCTbexRAyO9X3TdYs/Holq436pmTEjtqhTH/CWXDapnodX2Wy5rJB1KS0mW4vd4vG59/NgcYTdNCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:57:25.290664Z"},"content_sha256":"f45984539e0c1ecf23e338c05f4dfe28fe332dc17a616f2f5b71a4a9125c4d57","schema_version":"1.0","event_id":"sha256:f45984539e0c1ecf23e338c05f4dfe28fe332dc17a616f2f5b71a4a9125c4d57"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:EASRCEF2XA3ALBEWF63PGJSP2M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pauli Decomposition over Commuting Subsets: Applications in Gate Synthesis, State Preparation, and Quantum Simulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"K. R. Koteswara Rao, Swathi S. Hegde, T. S. Mahesh","submitted_at":"2016-03-22T16:56:29Z","abstract_excerpt":"A key task in quantum computation is the application of a sequence of gates implementing a specific unitary operation. However, the decomposition of an arbitrary unitary operation into simpler quantum gates is a nontrivial problem. Here we propose a general and robust protocol to decompose any target unitary into a sequence of Pauli rotations. The procedure involves identifying a commuting subset of Pauli operators having a high trace overlap with the target unitary, followed by a numerical optimization of their corresponding rotation angles. The protocol is demonstrated by decomposing several"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06867","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:18:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EI3gZ6x5p4NEC0MBk325q9ap7Ddmj19EqU5bin2A4BPFw8Qv7GBCVUhDtrrkXLPaPZLVxgxLq3aTZ74mmSC9Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:57:25.291395Z"},"content_sha256":"d2295a9e3f9120a811ab836109e01695e48ab38e19948d19de1cfbb702c44a50","schema_version":"1.0","event_id":"sha256:d2295a9e3f9120a811ab836109e01695e48ab38e19948d19de1cfbb702c44a50"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EASRCEF2XA3ALBEWF63PGJSP2M/bundle.json","state_url":"https://pith.science/pith/EASRCEF2XA3ALBEWF63PGJSP2M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EASRCEF2XA3ALBEWF63PGJSP2M/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T17:57:25Z","links":{"resolver":"https://pith.science/pith/EASRCEF2XA3ALBEWF63PGJSP2M","bundle":"https://pith.science/pith/EASRCEF2XA3ALBEWF63PGJSP2M/bundle.json","state":"https://pith.science/pith/EASRCEF2XA3ALBEWF63PGJSP2M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EASRCEF2XA3ALBEWF63PGJSP2M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EASRCEF2XA3ALBEWF63PGJSP2M","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b62c0739dfa1ce387625c047ab796b840e1b1090f1ac7956ee7380bf96834d76","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-03-22T16:56:29Z","title_canon_sha256":"a0a11b075d5368ae039a05ba69d7058b99db780dace688418ce2d13ebb3cd000"},"schema_version":"1.0","source":{"id":"1603.06867","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.06867","created_at":"2026-05-18T01:18:34Z"},{"alias_kind":"arxiv_version","alias_value":"1603.06867v1","created_at":"2026-05-18T01:18:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06867","created_at":"2026-05-18T01:18:34Z"},{"alias_kind":"pith_short_12","alias_value":"EASRCEF2XA3A","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EASRCEF2XA3ALBEW","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EASRCEF2","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:d2295a9e3f9120a811ab836109e01695e48ab38e19948d19de1cfbb702c44a50","target":"graph","created_at":"2026-05-18T01:18:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"A key task in quantum computation is the application of a sequence of gates implementing a specific unitary operation. However, the decomposition of an arbitrary unitary operation into simpler quantum gates is a nontrivial problem. Here we propose a general and robust protocol to decompose any target unitary into a sequence of Pauli rotations. The procedure involves identifying a commuting subset of Pauli operators having a high trace overlap with the target unitary, followed by a numerical optimization of their corresponding rotation angles. The protocol is demonstrated by decomposing several","authors_text":"K. R. Koteswara Rao, Swathi S. Hegde, T. S. Mahesh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-03-22T16:56:29Z","title":"Pauli Decomposition over Commuting Subsets: Applications in Gate Synthesis, State Preparation, and Quantum Simulations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06867","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f45984539e0c1ecf23e338c05f4dfe28fe332dc17a616f2f5b71a4a9125c4d57","target":"record","created_at":"2026-05-18T01:18:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b62c0739dfa1ce387625c047ab796b840e1b1090f1ac7956ee7380bf96834d76","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-03-22T16:56:29Z","title_canon_sha256":"a0a11b075d5368ae039a05ba69d7058b99db780dace688418ce2d13ebb3cd000"},"schema_version":"1.0","source":{"id":"1603.06867","kind":"arxiv","version":1}},"canonical_sha256":"20251110bab8360584962fb6f3264fd30848063ef1cacefa29a0041f2740fbb1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20251110bab8360584962fb6f3264fd30848063ef1cacefa29a0041f2740fbb1","first_computed_at":"2026-05-18T01:18:34.548007Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:34.548007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AB0eS81pCk/ONWxD7h3vCCwvfP25e8VlPrfUMHY4xiNE45PPQ+yaAZQfD6ngNH7wQf9gR+8Smhx01tgCgjzSDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:34.548533Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.06867","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f45984539e0c1ecf23e338c05f4dfe28fe332dc17a616f2f5b71a4a9125c4d57","sha256:d2295a9e3f9120a811ab836109e01695e48ab38e19948d19de1cfbb702c44a50"],"state_sha256":"defbb986920e9f2c2b374e75e19d9cdf04de1954cdfdcaa2a46e2d4fde4f26eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ch9xS/KXiAeY0oZlcPsFTonv4RDA4WZPNCzEcAPoyk5kofjmxhcSZzU0JQWuiK8J6DlzPVXdLaBP97SsqGOUCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:57:25.299198Z","bundle_sha256":"ce5f0dae11fb9f7b53c0a88abc97e0f50ed5a9de2049aeaae9ad2b963fb3b4d6"}}