{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RH3GM6BGINKL253BOXWTMNFYJ3","short_pith_number":"pith:RH3GM6BG","schema_version":"1.0","canonical_sha256":"89f66678264354bd776175ed3634b84ecf05b41f56b88ac9ac77a6d74ad2b61d","source":{"kind":"arxiv","id":"1401.3629","version":1},"attestation_state":"computed","paper":{"title":"Prospects for quantum computing: extremely doubtful","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"M.I. Dyakonov","submitted_at":"2014-01-15T15:33:45Z","abstract_excerpt":"The quantum computer is supposed to process information by applying unitary transformations to the complex amplitudes defining the state of N qubits. A useful machine needing N=1000 or more, the number of continuous parameters describing the state of a quantum computer at any given moment is much greater than the number of protons in the Universe. However, the theorists believe that the feasibility of large-scale quantum computing has been proven via the threshold theorem. Like for any theorem, the proof is based on a number of assumptions considered as axioms. However, in the physical world n"},"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":"1401.3629","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-01-15T15:33:45Z","cross_cats_sorted":[],"title_canon_sha256":"a9fc8bbeb1e5462114be344f90b581987e6e394195887ee8fce2a6b37c7cc3d2","abstract_canon_sha256":"f6ec1942bff686b7fe7e9f2b96af902e21a910d9a63401bcc6bd49113478ecd1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:25.901420Z","signature_b64":"Mjq3RgOkgNmx+AMUAmmsULHZ8QeJg8h0smYlbBnilBkKwNV7vb4MvnHwfpvFyXKXsl8xXeqokGcX3gXoWJBHCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89f66678264354bd776175ed3634b84ecf05b41f56b88ac9ac77a6d74ad2b61d","last_reissued_at":"2026-05-18T02:42:25.900577Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:25.900577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Prospects for quantum computing: extremely doubtful","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"M.I. Dyakonov","submitted_at":"2014-01-15T15:33:45Z","abstract_excerpt":"The quantum computer is supposed to process information by applying unitary transformations to the complex amplitudes defining the state of N qubits. A useful machine needing N=1000 or more, the number of continuous parameters describing the state of a quantum computer at any given moment is much greater than the number of protons in the Universe. However, the theorists believe that the feasibility of large-scale quantum computing has been proven via the threshold theorem. Like for any theorem, the proof is based on a number of assumptions considered as axioms. However, in the physical world n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3629","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":"1401.3629","created_at":"2026-05-18T02:42:25.900716+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.3629v1","created_at":"2026-05-18T02:42:25.900716+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3629","created_at":"2026-05-18T02:42:25.900716+00:00"},{"alias_kind":"pith_short_12","alias_value":"RH3GM6BGINKL","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RH3GM6BGINKL253B","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RH3GM6BG","created_at":"2026-05-18T12:28:46.137349+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/RH3GM6BGINKL253BOXWTMNFYJ3","json":"https://pith.science/pith/RH3GM6BGINKL253BOXWTMNFYJ3.json","graph_json":"https://pith.science/api/pith-number/RH3GM6BGINKL253BOXWTMNFYJ3/graph.json","events_json":"https://pith.science/api/pith-number/RH3GM6BGINKL253BOXWTMNFYJ3/events.json","paper":"https://pith.science/paper/RH3GM6BG"},"agent_actions":{"view_html":"https://pith.science/pith/RH3GM6BGINKL253BOXWTMNFYJ3","download_json":"https://pith.science/pith/RH3GM6BGINKL253BOXWTMNFYJ3.json","view_paper":"https://pith.science/paper/RH3GM6BG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.3629&json=true","fetch_graph":"https://pith.science/api/pith-number/RH3GM6BGINKL253BOXWTMNFYJ3/graph.json","fetch_events":"https://pith.science/api/pith-number/RH3GM6BGINKL253BOXWTMNFYJ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RH3GM6BGINKL253BOXWTMNFYJ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RH3GM6BGINKL253BOXWTMNFYJ3/action/storage_attestation","attest_author":"https://pith.science/pith/RH3GM6BGINKL253BOXWTMNFYJ3/action/author_attestation","sign_citation":"https://pith.science/pith/RH3GM6BGINKL253BOXWTMNFYJ3/action/citation_signature","submit_replication":"https://pith.science/pith/RH3GM6BGINKL253BOXWTMNFYJ3/action/replication_record"}},"created_at":"2026-05-18T02:42:25.900716+00:00","updated_at":"2026-05-18T02:42:25.900716+00:00"}