{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2001:MHMORC6VUQ64HUST6F7HICJT2D","short_pith_number":"pith:MHMORC6V","schema_version":"1.0","canonical_sha256":"61d8e88bd5a43dc3d253f17e740933d0cc4ecb5ba051a8f9496d1336597b1aff","source":{"kind":"arxiv","id":"quant-ph/0105133","version":1},"attestation_state":"computed","paper":{"title":"A Quantum Full Adder for a Scalable Nuclear Spin Quantum Computer","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"G.D. Doolen, G.P. Berman, G.V. Lopez, V.I. Tsifrinovich","submitted_at":"2001-05-25T20:21:18Z","abstract_excerpt":"We demonstrate a strategy for implementation a quantum full adder in a spin chain quantum computer. As an example, we simulate a quantum full adder in a chain containing 201 spins. Our simulations also demonstrate how one can minimize errors generated by non-resonant effects."},"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":"quant-ph/0105133","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2001-05-25T20:21:18Z","cross_cats_sorted":[],"title_canon_sha256":"712053128e3b917ef11bf39ff8f1ac9929b22350f1549940adf3b8282fbba365","abstract_canon_sha256":"86812ef03b28453b849c8a976e7753156d91d8e17a03b6da74d5efa36e904ad0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:38:02.698525Z","signature_b64":"rUyAa9QIzDUDNCnJzAlOfSnTE/mXnH97GKqfV6j2eENv0hNVLicWPWK+XfQCQtcgYQgomjz0V9faXiIUAmS/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61d8e88bd5a43dc3d253f17e740933d0cc4ecb5ba051a8f9496d1336597b1aff","last_reissued_at":"2026-05-18T01:38:02.697918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:38:02.697918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Quantum Full Adder for a Scalable Nuclear Spin Quantum Computer","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"G.D. Doolen, G.P. Berman, G.V. Lopez, V.I. Tsifrinovich","submitted_at":"2001-05-25T20:21:18Z","abstract_excerpt":"We demonstrate a strategy for implementation a quantum full adder in a spin chain quantum computer. As an example, we simulate a quantum full adder in a chain containing 201 spins. Our simulations also demonstrate how one can minimize errors generated by non-resonant effects."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0105133","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":"quant-ph/0105133","created_at":"2026-05-18T01:38:02.698004+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0105133v1","created_at":"2026-05-18T01:38:02.698004+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0105133","created_at":"2026-05-18T01:38:02.698004+00:00"},{"alias_kind":"pith_short_12","alias_value":"MHMORC6VUQ64","created_at":"2026-05-18T12:25:50.845339+00:00"},{"alias_kind":"pith_short_16","alias_value":"MHMORC6VUQ64HUST","created_at":"2026-05-18T12:25:50.845339+00:00"},{"alias_kind":"pith_short_8","alias_value":"MHMORC6V","created_at":"2026-05-18T12:25:50.845339+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/MHMORC6VUQ64HUST6F7HICJT2D","json":"https://pith.science/pith/MHMORC6VUQ64HUST6F7HICJT2D.json","graph_json":"https://pith.science/api/pith-number/MHMORC6VUQ64HUST6F7HICJT2D/graph.json","events_json":"https://pith.science/api/pith-number/MHMORC6VUQ64HUST6F7HICJT2D/events.json","paper":"https://pith.science/paper/MHMORC6V"},"agent_actions":{"view_html":"https://pith.science/pith/MHMORC6VUQ64HUST6F7HICJT2D","download_json":"https://pith.science/pith/MHMORC6VUQ64HUST6F7HICJT2D.json","view_paper":"https://pith.science/paper/MHMORC6V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0105133&json=true","fetch_graph":"https://pith.science/api/pith-number/MHMORC6VUQ64HUST6F7HICJT2D/graph.json","fetch_events":"https://pith.science/api/pith-number/MHMORC6VUQ64HUST6F7HICJT2D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MHMORC6VUQ64HUST6F7HICJT2D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MHMORC6VUQ64HUST6F7HICJT2D/action/storage_attestation","attest_author":"https://pith.science/pith/MHMORC6VUQ64HUST6F7HICJT2D/action/author_attestation","sign_citation":"https://pith.science/pith/MHMORC6VUQ64HUST6F7HICJT2D/action/citation_signature","submit_replication":"https://pith.science/pith/MHMORC6VUQ64HUST6F7HICJT2D/action/replication_record"}},"created_at":"2026-05-18T01:38:02.698004+00:00","updated_at":"2026-05-18T01:38:02.698004+00:00"}