{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GVGDLPOR3EEO6OCRSFPLD2622D","short_pith_number":"pith:GVGDLPOR","schema_version":"1.0","canonical_sha256":"354c35bdd1d908ef3851915eb1ebdad0d3dae445eae16b4f7a1080ebf44b9f52","source":{"kind":"arxiv","id":"1902.06852","version":1},"attestation_state":"computed","paper":{"title":"Error reduction of quantum algorithms","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"Debajyoti Bera, Tharrmashastha P.V","submitted_at":"2019-02-19T00:47:31Z","abstract_excerpt":"We give a technique to reduce the error probability of quantum algorithms that determine whether its input has a specified property of interest. The standard process of reducing this error is statistical processing of the results of multiple independent executions of an algorithm. Denoting by $\\rho$ an upper bound of this probability (wlog., assume $\\rho \\le \\frac{1}{2}$), classical techniques require $O(\\frac{\\rho}{[(1-\\rho) - \\rho]^2})$ executions to reduce the error to a negligible constant. We investigated when and how quantum algorithmic techniques like amplitude amplification and estimat"},"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":"1902.06852","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2019-02-19T00:47:31Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"3e1d489df786e05d8516b60a87012d4ddeede3cc368315ad3add04e3406a49e2","abstract_canon_sha256":"13ad72893f5c46e8a2be146b449f22b6b9e03c363b7a40c546b24d2e4cf850ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:45.297191Z","signature_b64":"JiRpLgK7Z9j9KsPQ7mIqxYdL4hxaSKPSuf4f/3aVXDDcR2Po+a5dGxA5CnbtMGoaUdHKOrkyL7xy7xNm8g5LBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"354c35bdd1d908ef3851915eb1ebdad0d3dae445eae16b4f7a1080ebf44b9f52","last_reissued_at":"2026-05-17T23:39:45.296388Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:45.296388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Error reduction of quantum algorithms","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"Debajyoti Bera, Tharrmashastha P.V","submitted_at":"2019-02-19T00:47:31Z","abstract_excerpt":"We give a technique to reduce the error probability of quantum algorithms that determine whether its input has a specified property of interest. The standard process of reducing this error is statistical processing of the results of multiple independent executions of an algorithm. Denoting by $\\rho$ an upper bound of this probability (wlog., assume $\\rho \\le \\frac{1}{2}$), classical techniques require $O(\\frac{\\rho}{[(1-\\rho) - \\rho]^2})$ executions to reduce the error to a negligible constant. We investigated when and how quantum algorithmic techniques like amplitude amplification and estimat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06852","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":"1902.06852","created_at":"2026-05-17T23:39:45.296542+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.06852v1","created_at":"2026-05-17T23:39:45.296542+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06852","created_at":"2026-05-17T23:39:45.296542+00:00"},{"alias_kind":"pith_short_12","alias_value":"GVGDLPOR3EEO","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"GVGDLPOR3EEO6OCR","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"GVGDLPOR","created_at":"2026-05-18T12:33:18.533446+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/GVGDLPOR3EEO6OCRSFPLD2622D","json":"https://pith.science/pith/GVGDLPOR3EEO6OCRSFPLD2622D.json","graph_json":"https://pith.science/api/pith-number/GVGDLPOR3EEO6OCRSFPLD2622D/graph.json","events_json":"https://pith.science/api/pith-number/GVGDLPOR3EEO6OCRSFPLD2622D/events.json","paper":"https://pith.science/paper/GVGDLPOR"},"agent_actions":{"view_html":"https://pith.science/pith/GVGDLPOR3EEO6OCRSFPLD2622D","download_json":"https://pith.science/pith/GVGDLPOR3EEO6OCRSFPLD2622D.json","view_paper":"https://pith.science/paper/GVGDLPOR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.06852&json=true","fetch_graph":"https://pith.science/api/pith-number/GVGDLPOR3EEO6OCRSFPLD2622D/graph.json","fetch_events":"https://pith.science/api/pith-number/GVGDLPOR3EEO6OCRSFPLD2622D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GVGDLPOR3EEO6OCRSFPLD2622D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GVGDLPOR3EEO6OCRSFPLD2622D/action/storage_attestation","attest_author":"https://pith.science/pith/GVGDLPOR3EEO6OCRSFPLD2622D/action/author_attestation","sign_citation":"https://pith.science/pith/GVGDLPOR3EEO6OCRSFPLD2622D/action/citation_signature","submit_replication":"https://pith.science/pith/GVGDLPOR3EEO6OCRSFPLD2622D/action/replication_record"}},"created_at":"2026-05-17T23:39:45.296542+00:00","updated_at":"2026-05-17T23:39:45.296542+00:00"}