{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JKL4QIMOWFXDZZCBRI65UTVO3H","short_pith_number":"pith:JKL4QIMO","schema_version":"1.0","canonical_sha256":"4a97c8218eb16e3ce4418a3dda4eaed9c72ed7516a0d003feebdec9a1307d476","source":{"kind":"arxiv","id":"1305.2783","version":2},"attestation_state":"computed","paper":{"title":"Solovay-Kitaev Decomposition Strategy for Single-Qubit Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Barry C. Sanders, Dominic W. Berry, Dong-Sheng Wang, Marcos C. de Oliveira","submitted_at":"2013-05-13T14:10:38Z","abstract_excerpt":"Inspired by the Solovay-Kitaev decomposition for approximating unitary operations as a sequence of operations selected from a universal quantum computing gate set, we introduce a method for approximating any single-qubit channel using single-qubit gates and the controlled-NOT (CNOT). Our approach uses the decomposition of the single-qubit channel into a convex combination of \"quasiextreme\" channels. Previous techniques for simulating general single-qubit channels would require as many as 20 CNOT gates, whereas ours only needs one, bringing it within the range of current experiments."},"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":"1305.2783","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-05-13T14:10:38Z","cross_cats_sorted":[],"title_canon_sha256":"56f556645bcfc2c35b4e20f0a29635d702e20a94fefb523232cbf6c6d5d67c8b","abstract_canon_sha256":"86f4d7dd1ec7d7e927467214f10bd6fd18d564d93ae8481f27d88cd44d39aa0a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:59.138905Z","signature_b64":"3Jjm7wg9iW28CotvICiPBwBAwlf2pQC9wdHaJPDMvczn7qjyncPSlnwV3RM6i0+d7sWP14iYYzCi+HBhu1ynDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a97c8218eb16e3ce4418a3dda4eaed9c72ed7516a0d003feebdec9a1307d476","last_reissued_at":"2026-05-18T03:11:59.138313Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:59.138313Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solovay-Kitaev Decomposition Strategy for Single-Qubit Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Barry C. Sanders, Dominic W. Berry, Dong-Sheng Wang, Marcos C. de Oliveira","submitted_at":"2013-05-13T14:10:38Z","abstract_excerpt":"Inspired by the Solovay-Kitaev decomposition for approximating unitary operations as a sequence of operations selected from a universal quantum computing gate set, we introduce a method for approximating any single-qubit channel using single-qubit gates and the controlled-NOT (CNOT). Our approach uses the decomposition of the single-qubit channel into a convex combination of \"quasiextreme\" channels. Previous techniques for simulating general single-qubit channels would require as many as 20 CNOT gates, whereas ours only needs one, bringing it within the range of current experiments."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2783","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1305.2783","created_at":"2026-05-18T03:11:59.138420+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.2783v2","created_at":"2026-05-18T03:11:59.138420+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2783","created_at":"2026-05-18T03:11:59.138420+00:00"},{"alias_kind":"pith_short_12","alias_value":"JKL4QIMOWFXD","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JKL4QIMOWFXDZZCB","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JKL4QIMO","created_at":"2026-05-18T12:27:49.015174+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/JKL4QIMOWFXDZZCBRI65UTVO3H","json":"https://pith.science/pith/JKL4QIMOWFXDZZCBRI65UTVO3H.json","graph_json":"https://pith.science/api/pith-number/JKL4QIMOWFXDZZCBRI65UTVO3H/graph.json","events_json":"https://pith.science/api/pith-number/JKL4QIMOWFXDZZCBRI65UTVO3H/events.json","paper":"https://pith.science/paper/JKL4QIMO"},"agent_actions":{"view_html":"https://pith.science/pith/JKL4QIMOWFXDZZCBRI65UTVO3H","download_json":"https://pith.science/pith/JKL4QIMOWFXDZZCBRI65UTVO3H.json","view_paper":"https://pith.science/paper/JKL4QIMO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.2783&json=true","fetch_graph":"https://pith.science/api/pith-number/JKL4QIMOWFXDZZCBRI65UTVO3H/graph.json","fetch_events":"https://pith.science/api/pith-number/JKL4QIMOWFXDZZCBRI65UTVO3H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JKL4QIMOWFXDZZCBRI65UTVO3H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JKL4QIMOWFXDZZCBRI65UTVO3H/action/storage_attestation","attest_author":"https://pith.science/pith/JKL4QIMOWFXDZZCBRI65UTVO3H/action/author_attestation","sign_citation":"https://pith.science/pith/JKL4QIMOWFXDZZCBRI65UTVO3H/action/citation_signature","submit_replication":"https://pith.science/pith/JKL4QIMOWFXDZZCBRI65UTVO3H/action/replication_record"}},"created_at":"2026-05-18T03:11:59.138420+00:00","updated_at":"2026-05-18T03:11:59.138420+00:00"}