{"paper":{"title":"Computing with many encoded logical qubits beyond break-even","arxiv_id":"2602.22211","primary_cat":"quant-ph","submitted_at":"2026-02-25T18:59:52+00:00","version_compiled":"v1"},"notice":"Every quoted sentence is the authors' text from the arXiv listing abstract. Labels and probabilities are the outputs of classifier-1.13.0 on the question bank abstract-p1-20260923, exactly as returned. No sentence in this record was written by a language model.","schema":"pith.compiled-record/v0","status":"compiled","abstract":{"source":"arXiv listing abstract v1","sentences":[{"i":0,"p":1.0,"id":"s0","own":false,"role":"background","text":"High-rate quantum error correcting (QEC) codes encode many logical qubits in a given number of physical qubits, making them promising candidates for quantum computation.","hedge":{"p":0.63,"label":"asserted"},"own_p":0.05,"main_claim_p":0.04,"quantitative":false,"quantitative_p":0.11,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":1.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":1,"p":0.95,"id":"s1","own":false,"role":"background","text":"Implementing high-rate codes at a scale that both frustrates classical computing and improves performance by encoding requires both high fidelity gates and long-range qubit connectivity -- both of which are offered by trapped-ion quantum computers.","hedge":{"p":0.98,"label":"asserted"},"own_p":0.07,"main_claim_p":0.04,"quantitative":false,"quantitative_p":0.13,"role_probabilities":{"gap":0.05,"method":0.0,"result":0.0,"background":0.95,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":2,"p":0.57,"id":"s2","own":true,"role":"contribution","text":"Here, we demonstrate computations that outperform their unencoded counterparts in the high-rate $[[ k+2,\\, k,\\, 2 ]]$ iceberg quantum error detecting (QED) and $[[ (k_2 + 2)(k_1 + 2),\\, k_2k_1,\\, 4 ]]$ two-level concatenated iceberg QEC codes, using the 98-qubit Quantinuum Helios trapped-ion quantum processor.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.97,"main_claim_p":0.64,"quantitative":true,"quantitative_p":0.97,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.43,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.57,"interpretation":0.0}},{"i":3,"p":0.71,"id":"s3","own":true,"role":"result","text":"Utilizing new gadgets for encoded operations, we realize this \"beyond break-even\" performance with reasonable postselection rates across a range of fault-tolerant (FT) and partially-fault-tolerant (pFT) component and application benchmarks with between $48$ and $94$ logical qubits.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.96,"main_claim_p":0.46,"quantitative":true,"quantitative_p":0.98,"role_probabilities":{"gap":0.0,"method":0.03,"result":0.71,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.26,"interpretation":0.0}},{"i":4,"p":0.72,"id":"s4","own":true,"role":"contribution","text":"These benchmarks include FT state preparation and measurement, QEC cycle benchmarking, logical gate benchmarking, GHZ state preparation, and a pFT quantum simulation of the three-dimensional $XY$ model of quantum magnetism.","hedge":{"p":0.94,"label":"asserted"},"own_p":0.93,"main_claim_p":0.04,"quantitative":false,"quantitative_p":0.23,"role_probabilities":{"gap":0.0,"method":0.18,"result":0.1,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.72,"interpretation":0.0}},{"i":5,"p":0.97,"id":"s5","own":true,"role":"result","text":"Additionally, we illustrate that postselection rates can be suppressed by increasing the code distance via concatenation.","hedge":{"p":0.97,"label":"asserted"},"own_p":0.91,"main_claim_p":0.06,"quantitative":false,"quantitative_p":0.18,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.97,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.02,"interpretation":0.01}},{"i":6,"p":0.98,"id":"s6","own":true,"role":"interpretation","text":"Our results represent state-of-the-art logical component and state fidelities and provide evidence that high-rate QED/QEC codes are viable on contemporary quantum computers for near-term beyond-classical-scale computation.","hedge":{"p":0.89,"label":"asserted"},"own_p":0.92,"main_claim_p":0.83,"quantitative":false,"quantitative_p":0.28,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.02,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.98}}]},"compiled":{"main_claim":{"p":0.96,"text":"Our results represent state-of-the-art logical component and state fidelities and provide evidence that high-rate QED/QEC codes are viable on contemporary quantum computers for near-term beyond-classical-scale computation.","location":"abstract s6","hedge_strength":{"p":0.89,"label":"asserted"}},"provenance":{"route":{"via":"TypeSafe API","model":"classifier-1.13.0","endpoint":"https://api.typesafe.ai/v1/systemone","provider":"TypeSafe"},"packing":"one request per paper","requests":1,"input_tokens":6014,"cost_usd_reported":0.0},"compiled_at":"2026-09-26","bank_version":"abstract-p1-20260923","model_version":"classifier-1.13.0","abstract_states":{"claims_first":0.11,"states_limitation":0.44,"human_participants":0.02,"controlled_comparison":0.86,"randomized_assignment":0.01,"states_quantitative_result":0.94,"compares_with_prior_results":0.88,"mentions_code_or_data_availability":0.03},"evidential_basis":{"p":0.99,"value":"observation or experiment","probabilities":{"argument":0.0,"literature":0.0,"proof_or_derivation":0.0,"analysis_of_existing_data":0.0,"observation_or_experiment":0.99,"simulation_or_computation":0.01}},"contribution_type":{"p":1.0,"value":"empirical study","probabilities":{"review":0.0,"method_or_tool":0.0,"empirical_study":1.0,"simulation_study":0.0,"theoretical_result":0.0,"dataset_or_benchmark":0.0,"position_or_commentary":0.0}},"contribution_statement":{"p":0.93,"text":"Here, we demonstrate computations that outperform their unencoded counterparts in the high-rate $[[ k+2,\\, k,\\, 2 ]]$ iceberg quantum error detecting (QED) and $[[ (k_2 + 2)(k_1 + 2),\\, k_2k_1,\\, 4 ]]$ two-level concatenated iceberg QEC codes, using the 98-qubit Quantinuum Helios trapped-ion quantum processor.","location":"abstract s2"}},"coverage":{"tier":"abstract","levels_run":["P abstract"],"not_examined":["full text","figures and tables","references and citing sentences","relations to other papers"],"sources_read":["arXiv listing abstract v1"],"levels_not_run":["S sections","T body sentences","C citations","R cross-paper relations"],"sentences_examined":7,"sentences_in_abstract":7},"measured_accuracy":{"url":"https://pith.science/accuracy","measured_on":"2026-10-02","method":"two independent model families labelled a fresh random sample blind; the figure is how often the published label matches their consensus","sentence_role_agreement":0.92,"main_claim_agreement":0.908,"typed_citation_agreement":0.933,"typed_citation_agreement_95_interval":[0.917,0.945],"review_comments_accurate":0.758,"review_comments_accurate_95_interval":[0.684,0.82],"review_caught_admitted_error_found_or_related":0.448}}