{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:5MP5CY2J42WAOJMOUO7SSFYEIE","short_pith_number":"pith:5MP5CY2J","schema_version":"1.0","canonical_sha256":"eb1fd16349e6ac07258ea3bf291704410a01888f5f2190d3ee176efd587b4a52","source":{"kind":"arxiv","id":"2210.15161","version":1},"attestation_state":"computed","paper":{"title":"Automated error correction in superdense coding, with implementation on superconducting quantum computer","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Kumar Nilesh, Piyush Joshi, Prasanta Panigrahi","submitted_at":"2022-10-27T04:02:13Z","abstract_excerpt":"Construction of a fault-tolerant quantum computer remains a challenging problem due to unavoidable noise in quantum states and the fragility of quantum entanglement. However, most of the error-correcting codes increases the complexity of the algorithms, thereby decreasing any quantum advantage. Here we present a task-specific error-correction technique that provides a complete protection over a restricted set of quantum states. Specifically, we give an automated error correction in Superdense Coding algorithms utilizing n-qubit generalized Bell states. At its core, it is based on non-destructi"},"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":"2210.15161","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2022-10-27T04:02:13Z","cross_cats_sorted":[],"title_canon_sha256":"70a6b1d177eece1b07b8160528e6a89d68b84874c45c4111e53cd24245fa130e","abstract_canon_sha256":"dd9d6cf83b8e90f420461482239291b16e9f0fa7ac5bc71d8dc37725b4fd4933"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:11:02.957946Z","signature_b64":"oExpOZBIJqPWZWBLMNks6qyq5iENVEvquxgB4Qhifqu5tcgblNgJiBm9ZCmNqU4NWfUFWe5LfgXpU5F06J/MAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb1fd16349e6ac07258ea3bf291704410a01888f5f2190d3ee176efd587b4a52","last_reissued_at":"2026-07-05T05:11:02.957523Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:11:02.957523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automated error correction in superdense coding, with implementation on superconducting quantum computer","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Kumar Nilesh, Piyush Joshi, Prasanta Panigrahi","submitted_at":"2022-10-27T04:02:13Z","abstract_excerpt":"Construction of a fault-tolerant quantum computer remains a challenging problem due to unavoidable noise in quantum states and the fragility of quantum entanglement. However, most of the error-correcting codes increases the complexity of the algorithms, thereby decreasing any quantum advantage. Here we present a task-specific error-correction technique that provides a complete protection over a restricted set of quantum states. Specifically, we give an automated error correction in Superdense Coding algorithms utilizing n-qubit generalized Bell states. At its core, it is based on non-destructi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.15161","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.15161/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2210.15161","created_at":"2026-07-05T05:11:02.957587+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.15161v1","created_at":"2026-07-05T05:11:02.957587+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.15161","created_at":"2026-07-05T05:11:02.957587+00:00"},{"alias_kind":"pith_short_12","alias_value":"5MP5CY2J42WA","created_at":"2026-07-05T05:11:02.957587+00:00"},{"alias_kind":"pith_short_16","alias_value":"5MP5CY2J42WAOJMO","created_at":"2026-07-05T05:11:02.957587+00:00"},{"alias_kind":"pith_short_8","alias_value":"5MP5CY2J","created_at":"2026-07-05T05:11:02.957587+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/5MP5CY2J42WAOJMOUO7SSFYEIE","json":"https://pith.science/pith/5MP5CY2J42WAOJMOUO7SSFYEIE.json","graph_json":"https://pith.science/api/pith-number/5MP5CY2J42WAOJMOUO7SSFYEIE/graph.json","events_json":"https://pith.science/api/pith-number/5MP5CY2J42WAOJMOUO7SSFYEIE/events.json","paper":"https://pith.science/paper/5MP5CY2J"},"agent_actions":{"view_html":"https://pith.science/pith/5MP5CY2J42WAOJMOUO7SSFYEIE","download_json":"https://pith.science/pith/5MP5CY2J42WAOJMOUO7SSFYEIE.json","view_paper":"https://pith.science/paper/5MP5CY2J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.15161&json=true","fetch_graph":"https://pith.science/api/pith-number/5MP5CY2J42WAOJMOUO7SSFYEIE/graph.json","fetch_events":"https://pith.science/api/pith-number/5MP5CY2J42WAOJMOUO7SSFYEIE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5MP5CY2J42WAOJMOUO7SSFYEIE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5MP5CY2J42WAOJMOUO7SSFYEIE/action/storage_attestation","attest_author":"https://pith.science/pith/5MP5CY2J42WAOJMOUO7SSFYEIE/action/author_attestation","sign_citation":"https://pith.science/pith/5MP5CY2J42WAOJMOUO7SSFYEIE/action/citation_signature","submit_replication":"https://pith.science/pith/5MP5CY2J42WAOJMOUO7SSFYEIE/action/replication_record"}},"created_at":"2026-07-05T05:11:02.957587+00:00","updated_at":"2026-07-05T05:11:02.957587+00:00"}