{"paper":{"title":"Universal computation with magic Hamiltonians","arxiv_id":"2609.14757","primary_cat":"quant-ph","submitted_at":"2026-09-13T19:45:25+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":"In the conventional theory of quantum computation, universality is discussed in terms of properties of unitary gate sets.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.05,"main_claim_p":0.02,"quantitative":false,"quantitative_p":0.04,"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.98,"id":"s1","own":false,"role":"background","text":"In many experimental setups, however, we instead have access to a parametrized set of Hamiltonians, which can be exponentiated for any desired time.","hedge":{"p":0.93,"label":"asserted"},"own_p":0.09,"main_claim_p":0.02,"quantitative":false,"quantitative_p":0.09,"role_probabilities":{"gap":0.02,"method":0.0,"result":0.0,"background":0.98,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":2,"p":0.96,"id":"s2","own":true,"role":"contribution","text":"Accordingly, we formulate a continuous analogue of universality, where adding one expensive Hamiltonian control to a cheap set of local control operators allows for universal computation.","hedge":{"p":0.99,"label":"asserted"},"own_p":0.62,"main_claim_p":0.73,"quantitative":false,"quantitative_p":0.22,"role_probabilities":{"gap":0.0,"method":0.02,"result":0.02,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.96,"interpretation":0.0}},{"i":3,"p":0.7,"id":"s3","own":true,"role":"result","text":"We find several concrete sets of 1- or 2-local Pauli generators $S$ and $n$-qubit ``magic\" Hamiltonians $H$ that together generate the full Lie algebra $\\mathfrak{su}(2^n)$, with a special focus on the Ising Hamiltonian $J$.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.95,"main_claim_p":0.21,"quantitative":false,"quantitative_p":0.39,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.7,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.3,"interpretation":0.0}},{"i":4,"p":0.69,"id":"s4","own":true,"role":"method","text":"We propose a method to directly implement any unitary by exponentiating these generator sets, and give bounds on the needed time of application of the magic Hamiltonian $H$.","hedge":{"p":0.96,"label":"asserted"},"own_p":0.92,"main_claim_p":0.15,"quantitative":true,"quantitative_p":0.52,"role_probabilities":{"gap":0.0,"method":0.69,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.31,"interpretation":0.0}},{"i":5,"p":1.0,"id":"s5","own":true,"role":"result","text":"We find that the number of applications of $H$ needed to approximate any unitary up to accuracy $\\epsilon$ scales exponentially in the number of qubits as expected from the standard application of the Solovay-Kitaev theorem.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.94,"main_claim_p":0.19,"quantitative":true,"quantitative_p":0.96,"role_probabilities":{"gap":0.0,"method":0.0,"result":1.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":6,"p":1.0,"id":"s6","own":true,"role":"result","text":"We also find phase transitions in the size of the generated Lie algebras as the parameters of the Ising Hamiltonian are varied.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.95,"main_claim_p":0.05,"quantitative":false,"quantitative_p":0.07,"role_probabilities":{"gap":0.0,"method":0.0,"result":1.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":7,"p":0.53,"id":"s7","own":true,"role":"contribution","text":"We find an algorithmic application of the Chow/Rashevskii technique to implement unitaries corresponding to iterated commutators.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.9,"main_claim_p":0.06,"quantitative":false,"quantitative_p":0.03,"role_probabilities":{"gap":0.0,"method":0.38,"result":0.09,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.53,"interpretation":0.0}}]},"compiled":{"main_claim":{"p":0.99,"text":"Accordingly, we formulate a continuous analogue of universality, where adding one expensive Hamiltonian control to a cheap set of local control operators allows for universal computation.","location":"abstract s2","hedge_strength":{"p":0.99,"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":6440,"cost_usd_reported":0.0},"compiled_at":"2026-09-23","bank_version":"abstract-p1-20260923","model_version":"classifier-1.13.0","abstract_states":{"claims_first":0.05,"states_limitation":0.81,"human_participants":0.01,"controlled_comparison":0.05,"randomized_assignment":0.01,"states_quantitative_result":0.85,"compares_with_prior_results":0.63,"mentions_code_or_data_availability":0.02},"evidential_basis":{"p":0.99,"value":"proof or derivation","probabilities":{"argument":0.0,"literature":0.0,"proof_or_derivation":0.99,"analysis_of_existing_data":0.0,"observation_or_experiment":0.0,"simulation_or_computation":0.01}},"contribution_type":{"p":0.81,"value":"theoretical result","probabilities":{"review":0.0,"method_or_tool":0.19,"empirical_study":0.0,"simulation_study":0.0,"theoretical_result":0.81,"dataset_or_benchmark":0.0,"position_or_commentary":0.0}},"contribution_statement":{"p":0.8,"text":"Accordingly, we formulate a continuous analogue of universality, where adding one expensive Hamiltonian control to a cheap set of local control operators allows for universal computation.","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":8,"sentences_in_abstract":8},"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,"review_comments_judged":{"judged_by":["gpt-5.6-luna","grok-4.7"],"judged_against":"Pith's own text copy of each paper: text extracted from the PDF, the first 90,000 characters","measured_on":"2026-10-04","accurate":113,"decided":149,"sampled_reviews":200,"split_by_lane":false,"by_lane":"https://pith.science/accuracy#by-lane"}}}