{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HL34OLU6U76PF3Q2JSV5K5NVZU","short_pith_number":"pith:HL34OLU6","schema_version":"1.0","canonical_sha256":"3af7c72e9ea7fcf2ee1a4cabd575b5cd1a75f1c637c93fbadd199ad4ec142825","source":{"kind":"arxiv","id":"1509.07276","version":1},"attestation_state":"computed","paper":{"title":"Power of Quantum Computation with Few Clean Qubits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Harumichi Nishimura, Hirotada Kobayashi, Keisuke Fujii, Seiichiro Tani, Shuhei Tamate, Tomoyuki Morimae","submitted_at":"2015-09-24T08:48:44Z","abstract_excerpt":"This paper investigates the power of polynomial-time quantum computation in which only a very limited number of qubits are initially clean in the |0> state, and all the remaining qubits are initially in the totally mixed state. No initializations of qubits are allowed during the computation, nor intermediate measurements. The main results of this paper are unexpectedly strong error-reducible properties of such quantum computations. It is proved that any problem solvable by a polynomial-time quantum computation with one-sided bounded error that uses logarithmically many clean qubits can also be"},"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":"1509.07276","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-09-24T08:48:44Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"4f82a2a00706f85b99b3d6a11f167f6e74c27d3a280a1bb2844c73868039d6c3","abstract_canon_sha256":"593016971581dccad368c11922eae4eec4464addfa020b3f6f13d900fff14c0c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:54.053045Z","signature_b64":"I78kfCOjM/VwvINBc0d4e/rCLR/RzTbPtSviN/3nJgrgrIx9d2vTw6RE06AE9fJhCqgbDFmQGACyKIhNQHH0Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3af7c72e9ea7fcf2ee1a4cabd575b5cd1a75f1c637c93fbadd199ad4ec142825","last_reissued_at":"2026-05-18T01:07:54.052636Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:54.052636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Power of Quantum Computation with Few Clean Qubits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Harumichi Nishimura, Hirotada Kobayashi, Keisuke Fujii, Seiichiro Tani, Shuhei Tamate, Tomoyuki Morimae","submitted_at":"2015-09-24T08:48:44Z","abstract_excerpt":"This paper investigates the power of polynomial-time quantum computation in which only a very limited number of qubits are initially clean in the |0> state, and all the remaining qubits are initially in the totally mixed state. No initializations of qubits are allowed during the computation, nor intermediate measurements. The main results of this paper are unexpectedly strong error-reducible properties of such quantum computations. It is proved that any problem solvable by a polynomial-time quantum computation with one-sided bounded error that uses logarithmically many clean qubits can also be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07276","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":"1509.07276","created_at":"2026-05-18T01:07:54.052705+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.07276v1","created_at":"2026-05-18T01:07:54.052705+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07276","created_at":"2026-05-18T01:07:54.052705+00:00"},{"alias_kind":"pith_short_12","alias_value":"HL34OLU6U76P","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HL34OLU6U76PF3Q2","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HL34OLU6","created_at":"2026-05-18T12:29:25.134429+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.08224","citing_title":"The one clean qubit model without entanglement is classically simulable","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HL34OLU6U76PF3Q2JSV5K5NVZU","json":"https://pith.science/pith/HL34OLU6U76PF3Q2JSV5K5NVZU.json","graph_json":"https://pith.science/api/pith-number/HL34OLU6U76PF3Q2JSV5K5NVZU/graph.json","events_json":"https://pith.science/api/pith-number/HL34OLU6U76PF3Q2JSV5K5NVZU/events.json","paper":"https://pith.science/paper/HL34OLU6"},"agent_actions":{"view_html":"https://pith.science/pith/HL34OLU6U76PF3Q2JSV5K5NVZU","download_json":"https://pith.science/pith/HL34OLU6U76PF3Q2JSV5K5NVZU.json","view_paper":"https://pith.science/paper/HL34OLU6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.07276&json=true","fetch_graph":"https://pith.science/api/pith-number/HL34OLU6U76PF3Q2JSV5K5NVZU/graph.json","fetch_events":"https://pith.science/api/pith-number/HL34OLU6U76PF3Q2JSV5K5NVZU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HL34OLU6U76PF3Q2JSV5K5NVZU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HL34OLU6U76PF3Q2JSV5K5NVZU/action/storage_attestation","attest_author":"https://pith.science/pith/HL34OLU6U76PF3Q2JSV5K5NVZU/action/author_attestation","sign_citation":"https://pith.science/pith/HL34OLU6U76PF3Q2JSV5K5NVZU/action/citation_signature","submit_replication":"https://pith.science/pith/HL34OLU6U76PF3Q2JSV5K5NVZU/action/replication_record"}},"created_at":"2026-05-18T01:07:54.052705+00:00","updated_at":"2026-05-18T01:07:54.052705+00:00"}