{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2000:LMNE77TWKNZKNKCBTZ5KJANIA6","short_pith_number":"pith:LMNE77TW","canonical_record":{"source":{"id":"quant-ph/0002033","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2000-02-11T22:06:21Z","cross_cats_sorted":[],"title_canon_sha256":"4f5f025b8e35a929e1b055a98283bbc9b51ce34204d305b02cbedeaebd7bf55d","abstract_canon_sha256":"4a7fa7a813c17edac5d89b8c068efb0ea146f2e1538b85e99738bff7b02a05b1"},"schema_version":"1.0"},"canonical_sha256":"5b1a4ffe765372a6a8419e7aa481a80791c52b3ea8bc66c3d7cd7b0a0b194df2","source":{"kind":"arxiv","id":"quant-ph/0002033","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0002033","created_at":"2026-05-18T03:47:09Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0002033v2","created_at":"2026-05-18T03:47:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0002033","created_at":"2026-05-18T03:47:09Z"},{"alias_kind":"pith_short_12","alias_value":"LMNE77TWKNZK","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_16","alias_value":"LMNE77TWKNZKNKCB","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_8","alias_value":"LMNE77TW","created_at":"2026-05-18T12:25:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2000:LMNE77TWKNZKNKCBTZ5KJANIA6","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0002033","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2000-02-11T22:06:21Z","cross_cats_sorted":[],"title_canon_sha256":"4f5f025b8e35a929e1b055a98283bbc9b51ce34204d305b02cbedeaebd7bf55d","abstract_canon_sha256":"4a7fa7a813c17edac5d89b8c068efb0ea146f2e1538b85e99738bff7b02a05b1"},"schema_version":"1.0"},"canonical_sha256":"5b1a4ffe765372a6a8419e7aa481a80791c52b3ea8bc66c3d7cd7b0a0b194df2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:47:09.361852Z","signature_b64":"KWPB0mYyu1LscE3YL5irZA+r46ZsOq9dTzbxbyicTycxu9sjvtkv9HYpqs93Y7eP8L390BOIodF2lfjcT0exAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b1a4ffe765372a6a8419e7aa481a80791c52b3ea8bc66c3d7cd7b0a0b194df2","last_reissued_at":"2026-05-18T03:47:09.361448Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:47:09.361448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0002033","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-18T03:47:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oUDV5QmMD++AIAuEshDCSx1qGRChra8V3YiJ/LZzplmDb4+RyVtlEF+vxjDCuUfYtrQdebDtcaE8laCG4280Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:31:28.305633Z"},"content_sha256":"b3ef84ff283efc9bc81a9c6c5757e68a1cc41fb85f3a7b56d31cc4a25b7fb604","schema_version":"1.0","event_id":"sha256:b3ef84ff283efc9bc81a9c6c5757e68a1cc41fb85f3a7b56d31cc4a25b7fb604"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2000:LMNE77TWKNZKNKCBTZ5KJANIA6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-valued Logic Gates for Quantum Computation","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ashok Muthukrishnan, C. R. Stroud, jr","submitted_at":"2000-02-11T22:06:21Z","abstract_excerpt":"We develop a multi-valued logic for quantum computing for use in multi-level quantum systems, and discuss the practical advantages of this approach for scaling up a quantum computer. Generalizing the methods of binary quantum logic, we establish that arbitrary unitary operations on any number of d-level systems (d > 2) can be decomposed into logic gates that operate on only two systems at a time. We show that such multi-valued logic gates are experimentally feasible in the context of the linear ion trap scheme for quantum computing. By using d levels in each ion in this scheme, we reduce the n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0002033","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-18T03:47:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Db7ZCRb2Arw5kdiGhc7cE9sT8pkKPvzZiE4DHRGFKWeY0Ff5lnUgOKb78HHaXiHUN07UmHcDp6TovgyusNGYAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:31:28.305991Z"},"content_sha256":"0062cf154b445fee5d51216ef433b7e15841d91ca65fd5081825571a9de66d99","schema_version":"1.0","event_id":"sha256:0062cf154b445fee5d51216ef433b7e15841d91ca65fd5081825571a9de66d99"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LMNE77TWKNZKNKCBTZ5KJANIA6/bundle.json","state_url":"https://pith.science/pith/LMNE77TWKNZKNKCBTZ5KJANIA6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LMNE77TWKNZKNKCBTZ5KJANIA6/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-05T15:31:28Z","links":{"resolver":"https://pith.science/pith/LMNE77TWKNZKNKCBTZ5KJANIA6","bundle":"https://pith.science/pith/LMNE77TWKNZKNKCBTZ5KJANIA6/bundle.json","state":"https://pith.science/pith/LMNE77TWKNZKNKCBTZ5KJANIA6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LMNE77TWKNZKNKCBTZ5KJANIA6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2000:LMNE77TWKNZKNKCBTZ5KJANIA6","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":"4a7fa7a813c17edac5d89b8c068efb0ea146f2e1538b85e99738bff7b02a05b1","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2000-02-11T22:06:21Z","title_canon_sha256":"4f5f025b8e35a929e1b055a98283bbc9b51ce34204d305b02cbedeaebd7bf55d"},"schema_version":"1.0","source":{"id":"quant-ph/0002033","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0002033","created_at":"2026-05-18T03:47:09Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0002033v2","created_at":"2026-05-18T03:47:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0002033","created_at":"2026-05-18T03:47:09Z"},{"alias_kind":"pith_short_12","alias_value":"LMNE77TWKNZK","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_16","alias_value":"LMNE77TWKNZKNKCB","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_8","alias_value":"LMNE77TW","created_at":"2026-05-18T12:25:50Z"}],"graph_snapshots":[{"event_id":"sha256:0062cf154b445fee5d51216ef433b7e15841d91ca65fd5081825571a9de66d99","target":"graph","created_at":"2026-05-18T03:47: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 develop a multi-valued logic for quantum computing for use in multi-level quantum systems, and discuss the practical advantages of this approach for scaling up a quantum computer. Generalizing the methods of binary quantum logic, we establish that arbitrary unitary operations on any number of d-level systems (d > 2) can be decomposed into logic gates that operate on only two systems at a time. We show that such multi-valued logic gates are experimentally feasible in the context of the linear ion trap scheme for quantum computing. By using d levels in each ion in this scheme, we reduce the n","authors_text":"Ashok Muthukrishnan, C. R. Stroud, jr","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2000-02-11T22:06:21Z","title":"Multi-valued Logic Gates for Quantum Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0002033","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:b3ef84ff283efc9bc81a9c6c5757e68a1cc41fb85f3a7b56d31cc4a25b7fb604","target":"record","created_at":"2026-05-18T03:47: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":"4a7fa7a813c17edac5d89b8c068efb0ea146f2e1538b85e99738bff7b02a05b1","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2000-02-11T22:06:21Z","title_canon_sha256":"4f5f025b8e35a929e1b055a98283bbc9b51ce34204d305b02cbedeaebd7bf55d"},"schema_version":"1.0","source":{"id":"quant-ph/0002033","kind":"arxiv","version":2}},"canonical_sha256":"5b1a4ffe765372a6a8419e7aa481a80791c52b3ea8bc66c3d7cd7b0a0b194df2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b1a4ffe765372a6a8419e7aa481a80791c52b3ea8bc66c3d7cd7b0a0b194df2","first_computed_at":"2026-05-18T03:47:09.361448Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:47:09.361448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KWPB0mYyu1LscE3YL5irZA+r46ZsOq9dTzbxbyicTycxu9sjvtkv9HYpqs93Y7eP8L390BOIodF2lfjcT0exAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:47:09.361852Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0002033","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3ef84ff283efc9bc81a9c6c5757e68a1cc41fb85f3a7b56d31cc4a25b7fb604","sha256:0062cf154b445fee5d51216ef433b7e15841d91ca65fd5081825571a9de66d99"],"state_sha256":"0e07cf838cec98b8ed9f1c04a099cc9cb0f4373236320a7d0dd393810209f604"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RCmd3nvNFNJvdAGzg/W6vHDTFwukIdU3KPldpmPq2leE8PvesGRXKrV88h8Y2DUFF6vUPSNUd70IXqIXsaqgCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T15:31:28.307927Z","bundle_sha256":"1d5d7a50df7e079dfbbe8ddebd5df52d07b20907f88c5028a106a2a31869283d"}}