{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:GQTBMUNK6BQTTSD3JQW5IFFVW7","short_pith_number":"pith:GQTBMUNK","schema_version":"1.0","canonical_sha256":"34261651aaf06139c87b4c2dd414b5b7c2cd6cc7b82cce0d1e93bac8406d54d1","source":{"kind":"arxiv","id":"2211.11729","version":1},"attestation_state":"computed","paper":{"title":"Quantum majority vote","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.RT"],"primary_cat":"quant-ph","authors_text":"Ashley Montanaro, Harry Buhrman, Laura Man\\v{c}inska, Maris Ozols, Noah Linden","submitted_at":"2022-11-21T18:47:46Z","abstract_excerpt":"Majority vote is a basic method for amplifying correct outcomes that is widely used in computer science and beyond. While it can amplify the correctness of a quantum device with classical output, the analogous procedure for quantum output is not known. We introduce quantum majority vote as the following task: given a product state $|\\psi_1\\rangle \\otimes \\dots \\otimes |\\psi_n\\rangle$ where each qubit is in one of two orthogonal states $|\\psi\\rangle$ or $|\\psi^\\perp\\rangle$, output the majority state. We show that an optimal algorithm for this problem achieves worst-case fidelity of $1/2 + \\The"},"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":"2211.11729","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-11-21T18:47:46Z","cross_cats_sorted":["math.RT"],"title_canon_sha256":"53aa4dafd83d8e8f5d63e03ca82cf2ee2a69930030cc6e5b1c4bb48834a758d7","abstract_canon_sha256":"bbf51091b00a2f62911480bee3af4053136352765fde99a0e22186bda6a11263"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:17:57.257346Z","signature_b64":"6X1M+HJhiOi0g1p3KhLEEz19fCf25MnnYHhjukgN3rrcZFKhMfQNtn/mDkWiMnfdNtgOT9XVqQjVUdUSvCE/CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34261651aaf06139c87b4c2dd414b5b7c2cd6cc7b82cce0d1e93bac8406d54d1","last_reissued_at":"2026-07-05T05:17:57.256879Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:17:57.256879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum majority vote","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.RT"],"primary_cat":"quant-ph","authors_text":"Ashley Montanaro, Harry Buhrman, Laura Man\\v{c}inska, Maris Ozols, Noah Linden","submitted_at":"2022-11-21T18:47:46Z","abstract_excerpt":"Majority vote is a basic method for amplifying correct outcomes that is widely used in computer science and beyond. While it can amplify the correctness of a quantum device with classical output, the analogous procedure for quantum output is not known. We introduce quantum majority vote as the following task: given a product state $|\\psi_1\\rangle \\otimes \\dots \\otimes |\\psi_n\\rangle$ where each qubit is in one of two orthogonal states $|\\psi\\rangle$ or $|\\psi^\\perp\\rangle$, output the majority state. We show that an optimal algorithm for this problem achieves worst-case fidelity of $1/2 + \\The"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.11729","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/2211.11729/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":"2211.11729","created_at":"2026-07-05T05:17:57.256935+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.11729v1","created_at":"2026-07-05T05:17:57.256935+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.11729","created_at":"2026-07-05T05:17:57.256935+00:00"},{"alias_kind":"pith_short_12","alias_value":"GQTBMUNK6BQT","created_at":"2026-07-05T05:17:57.256935+00:00"},{"alias_kind":"pith_short_16","alias_value":"GQTBMUNK6BQTTSD3","created_at":"2026-07-05T05:17:57.256935+00:00"},{"alias_kind":"pith_short_8","alias_value":"GQTBMUNK","created_at":"2026-07-05T05:17:57.256935+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.00038","citing_title":"Lottery BP: Unlocking Quantum Error Decoding at Scale","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GQTBMUNK6BQTTSD3JQW5IFFVW7","json":"https://pith.science/pith/GQTBMUNK6BQTTSD3JQW5IFFVW7.json","graph_json":"https://pith.science/api/pith-number/GQTBMUNK6BQTTSD3JQW5IFFVW7/graph.json","events_json":"https://pith.science/api/pith-number/GQTBMUNK6BQTTSD3JQW5IFFVW7/events.json","paper":"https://pith.science/paper/GQTBMUNK"},"agent_actions":{"view_html":"https://pith.science/pith/GQTBMUNK6BQTTSD3JQW5IFFVW7","download_json":"https://pith.science/pith/GQTBMUNK6BQTTSD3JQW5IFFVW7.json","view_paper":"https://pith.science/paper/GQTBMUNK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.11729&json=true","fetch_graph":"https://pith.science/api/pith-number/GQTBMUNK6BQTTSD3JQW5IFFVW7/graph.json","fetch_events":"https://pith.science/api/pith-number/GQTBMUNK6BQTTSD3JQW5IFFVW7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GQTBMUNK6BQTTSD3JQW5IFFVW7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GQTBMUNK6BQTTSD3JQW5IFFVW7/action/storage_attestation","attest_author":"https://pith.science/pith/GQTBMUNK6BQTTSD3JQW5IFFVW7/action/author_attestation","sign_citation":"https://pith.science/pith/GQTBMUNK6BQTTSD3JQW5IFFVW7/action/citation_signature","submit_replication":"https://pith.science/pith/GQTBMUNK6BQTTSD3JQW5IFFVW7/action/replication_record"}},"created_at":"2026-07-05T05:17:57.256935+00:00","updated_at":"2026-07-05T05:17:57.256935+00:00"}