{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:VEYKIVMONST3XZEIA6UC52U47R","short_pith_number":"pith:VEYKIVMO","canonical_record":{"source":{"id":"0910.5587","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-10-29T09:14:40Z","cross_cats_sorted":[],"title_canon_sha256":"2b36eb789d115e56491eaee0f1b4e4e3cb5f6b12ba92ee3d05f49727e127e770","abstract_canon_sha256":"03d84011efe3e5eb9c5b0d7fa1a0403f155dce7555ae4b62bc8f5d687dd920fe"},"schema_version":"1.0"},"canonical_sha256":"a930a4558e6ca7bbe48807a82eea9cfc4cf4fef0e24f5fcb2fa157a89092ffb3","source":{"kind":"arxiv","id":"0910.5587","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0910.5587","created_at":"2026-05-18T04:22:09Z"},{"alias_kind":"arxiv_version","alias_value":"0910.5587v2","created_at":"2026-05-18T04:22:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.5587","created_at":"2026-05-18T04:22:09Z"},{"alias_kind":"pith_short_12","alias_value":"VEYKIVMONST3","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"VEYKIVMONST3XZEI","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"VEYKIVMO","created_at":"2026-05-18T12:26:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:VEYKIVMONST3XZEIA6UC52U47R","target":"record","payload":{"canonical_record":{"source":{"id":"0910.5587","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-10-29T09:14:40Z","cross_cats_sorted":[],"title_canon_sha256":"2b36eb789d115e56491eaee0f1b4e4e3cb5f6b12ba92ee3d05f49727e127e770","abstract_canon_sha256":"03d84011efe3e5eb9c5b0d7fa1a0403f155dce7555ae4b62bc8f5d687dd920fe"},"schema_version":"1.0"},"canonical_sha256":"a930a4558e6ca7bbe48807a82eea9cfc4cf4fef0e24f5fcb2fa157a89092ffb3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:09.329658Z","signature_b64":"K0eO5jdQsZZYzvS+hprkh+hb33LHz3cvDPhwMbt39o81UaJHJ27NLFx74meZvulUUvbNvv16x15Kd6iDI9fnBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a930a4558e6ca7bbe48807a82eea9cfc4cf4fef0e24f5fcb2fa157a89092ffb3","last_reissued_at":"2026-05-18T04:22:09.329138Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:09.329138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0910.5587","source_version":2,"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-18T04:22:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V2C494kCpYmmiwgbmCLl+fjAGUdlJaWgKsYXKn2eqzuCAq7OxbN8lGj5FJSUil8h6P5jR6eJChc/2mOdzmgXCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T06:43:05.135854Z"},"content_sha256":"6e680b70d56ede504b853f45e92a4d3975b3ef879c40c5128fc94ae0dc3c6e29","schema_version":"1.0","event_id":"sha256:6e680b70d56ede504b853f45e92a4d3975b3ef879c40c5128fc94ae0dc3c6e29"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:VEYKIVMONST3XZEIA6UC52U47R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Time complexity and gate complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Tatsuhiko Koike, Yosuke Okudaira","submitted_at":"2009-10-29T09:14:40Z","abstract_excerpt":"We formulate and investigate the simplest version of time-optimal quantum computation theory (t-QCT), where the computation time is defined by the physical one and the Hamiltonian contains only one- and two-qubit interactions. This version of t-QCT is also considered as optimality by sub-Riemannian geodesic length. The work has two aims: one is to develop a t-QCT itself based on physically natural concept of time, and the other is to pursue the possibility of using t-QCT as a tool to estimate the complexity in conventional gate-optimal quantum computation theory (g-QCT). In particular, we inve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.5587","kind":"arxiv","version":2},"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-18T04:22:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BcciUOiWFmWX4wJz/fnGtZKqWyFpAjqBYCMu4cp5BWrAmCdqHlbxel1ixtxLCuyiuhLtSk96lPVTCttEmwrEDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T06:43:05.136211Z"},"content_sha256":"289783053fc87c6a2cae12dcb19ab47145ef7408aaabbbfe5549e2758f095dea","schema_version":"1.0","event_id":"sha256:289783053fc87c6a2cae12dcb19ab47145ef7408aaabbbfe5549e2758f095dea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VEYKIVMONST3XZEIA6UC52U47R/bundle.json","state_url":"https://pith.science/pith/VEYKIVMONST3XZEIA6UC52U47R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VEYKIVMONST3XZEIA6UC52U47R/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-06-12T06:43:05Z","links":{"resolver":"https://pith.science/pith/VEYKIVMONST3XZEIA6UC52U47R","bundle":"https://pith.science/pith/VEYKIVMONST3XZEIA6UC52U47R/bundle.json","state":"https://pith.science/pith/VEYKIVMONST3XZEIA6UC52U47R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VEYKIVMONST3XZEIA6UC52U47R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:VEYKIVMONST3XZEIA6UC52U47R","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":"03d84011efe3e5eb9c5b0d7fa1a0403f155dce7555ae4b62bc8f5d687dd920fe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-10-29T09:14:40Z","title_canon_sha256":"2b36eb789d115e56491eaee0f1b4e4e3cb5f6b12ba92ee3d05f49727e127e770"},"schema_version":"1.0","source":{"id":"0910.5587","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0910.5587","created_at":"2026-05-18T04:22:09Z"},{"alias_kind":"arxiv_version","alias_value":"0910.5587v2","created_at":"2026-05-18T04:22:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.5587","created_at":"2026-05-18T04:22:09Z"},{"alias_kind":"pith_short_12","alias_value":"VEYKIVMONST3","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"VEYKIVMONST3XZEI","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"VEYKIVMO","created_at":"2026-05-18T12:26:02Z"}],"graph_snapshots":[{"event_id":"sha256:289783053fc87c6a2cae12dcb19ab47145ef7408aaabbbfe5549e2758f095dea","target":"graph","created_at":"2026-05-18T04:22:09Z","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":"We formulate and investigate the simplest version of time-optimal quantum computation theory (t-QCT), where the computation time is defined by the physical one and the Hamiltonian contains only one- and two-qubit interactions. This version of t-QCT is also considered as optimality by sub-Riemannian geodesic length. The work has two aims: one is to develop a t-QCT itself based on physically natural concept of time, and the other is to pursue the possibility of using t-QCT as a tool to estimate the complexity in conventional gate-optimal quantum computation theory (g-QCT). In particular, we inve","authors_text":"Tatsuhiko Koike, Yosuke Okudaira","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-10-29T09:14:40Z","title":"Time complexity and gate complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.5587","kind":"arxiv","version":2},"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:6e680b70d56ede504b853f45e92a4d3975b3ef879c40c5128fc94ae0dc3c6e29","target":"record","created_at":"2026-05-18T04:22:09Z","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":"03d84011efe3e5eb9c5b0d7fa1a0403f155dce7555ae4b62bc8f5d687dd920fe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-10-29T09:14:40Z","title_canon_sha256":"2b36eb789d115e56491eaee0f1b4e4e3cb5f6b12ba92ee3d05f49727e127e770"},"schema_version":"1.0","source":{"id":"0910.5587","kind":"arxiv","version":2}},"canonical_sha256":"a930a4558e6ca7bbe48807a82eea9cfc4cf4fef0e24f5fcb2fa157a89092ffb3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a930a4558e6ca7bbe48807a82eea9cfc4cf4fef0e24f5fcb2fa157a89092ffb3","first_computed_at":"2026-05-18T04:22:09.329138Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:22:09.329138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K0eO5jdQsZZYzvS+hprkh+hb33LHz3cvDPhwMbt39o81UaJHJ27NLFx74meZvulUUvbNvv16x15Kd6iDI9fnBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:22:09.329658Z","signed_message":"canonical_sha256_bytes"},"source_id":"0910.5587","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e680b70d56ede504b853f45e92a4d3975b3ef879c40c5128fc94ae0dc3c6e29","sha256:289783053fc87c6a2cae12dcb19ab47145ef7408aaabbbfe5549e2758f095dea"],"state_sha256":"dedbf66f468fc3019dd3e39c03b1b03ce72602d4bf6f8b2341fb84ea528452f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MqQEd6EZYNCjFGYarsBY/Nl+D33hMHizV0svwhRTmh3mhYNtOpvFB3r/+flNAu1s5CsTGUiZYnvKWKJ997/0BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T06:43:05.139435Z","bundle_sha256":"5b7683fde1f3e89e9db9bf5bcdae53697320cd4e11722342165c82bdf65fcfe2"}}