{"paper":{"title":"Breaking the chain: geometry-native state preparation with ASPIRE","arxiv_id":"2610.03528","primary_cat":"quant-ph","submitted_at":"2026-10-02T16:15: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":0.99,"id":"s0","own":false,"role":"background","text":"Loading data into quantum computers is a key bottleneck that threatens end-to-end quantum advantage.","hedge":{"p":0.99,"label":"asserted"},"own_p":0.04,"main_claim_p":0.02,"quantitative":false,"quantitative_p":0.03,"role_probabilities":{"gap":0.01,"method":0.0,"result":0.0,"background":0.99,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":1,"p":1.0,"id":"s1","own":false,"role":"background","text":"Quantum-circuit compilers for structured states like matrix product states (MPS) are a critical enabler to manage this in quantum chemistry, finance, and many-body quantum simulation.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.04,"main_claim_p":0.03,"quantitative":false,"quantitative_p":0.03,"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":2,"p":0.99,"id":"s2","own":false,"role":"background","text":"Approximate preparation of MPS typically relies on layered sequential staircases of nearest-neighbour gates.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.04,"main_claim_p":0.03,"quantitative":false,"quantitative_p":0.05,"role_probabilities":{"gap":0.01,"method":0.0,"result":0.0,"background":0.99,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":3,"p":0.88,"id":"s3","own":true,"role":"contribution","text":"We present Adaptive State Preparation by Iterative Removal of Entanglement (ASPIRE), an algorithm that approximately compiles state-preparation circuits by selecting gates based on the state's underlying entanglement geometry and the available connectivity of the target quantum processor.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.93,"main_claim_p":0.18,"quantitative":false,"quantitative_p":0.04,"role_probabilities":{"gap":0.0,"method":0.12,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.88,"interpretation":0.0}},{"i":4,"p":0.99,"id":"s4","own":true,"role":"method","text":"Our protocol scores candidate qubit pairs on the removability of their entanglement and identifies layers of parallelised long-ranged gates that remove the most entanglement.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.93,"main_claim_p":0.07,"quantitative":false,"quantitative_p":0.08,"role_probabilities":{"gap":0.0,"method":0.99,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.01,"interpretation":0.0}},{"i":5,"p":0.59,"id":"s5","own":true,"role":"result","text":"We demonstrate our protocol empirically across a range of settings, illustrating its success for preparing Hamiltonian ground states and multivariate amplitude-encoded functions, and accounting for qubit connectivity, hardware noise, and both NISQ and early fault-tolerant settings.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.96,"main_claim_p":0.14,"quantitative":false,"quantitative_p":0.13,"role_probabilities":{"gap":0.0,"method":0.09,"result":0.59,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.32,"interpretation":0.0}},{"i":6,"p":0.99,"id":"s6","own":true,"role":"result","text":"Throughout, ASPIRE typically achieves higher fidelities and shallower circuits than existing methods for states with long-ranged entanglement, even when classical optimisation is accounted for.","hedge":{"p":0.92,"label":"asserted"},"own_p":0.94,"main_claim_p":0.58,"quantitative":true,"quantitative_p":0.89,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.99,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.01}},{"i":7,"p":0.99,"id":"s7","own":true,"role":"interpretation","text":"Our investigation positions ASPIRE as a competitive, resource-frugal state-preparation protocol, with particular promise for applications tolerant to imperfect fidelity such as preparation of guide states for quantum phase estimation.","hedge":{"p":0.62,"label":"hedged_possibility"},"own_p":0.73,"main_claim_p":0.58,"quantitative":false,"quantitative_p":0.19,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.01,"contribution":0.0,"interpretation":0.99}}]},"compiled":{"main_claim":{"p":0.62,"text":"Our investigation positions ASPIRE as a competitive, resource-frugal state-preparation protocol, with particular promise for applications tolerant to imperfect fidelity such as preparation of guide states for quantum phase estimation.","location":"abstract s7","hedge_strength":{"p":0.62,"label":"hedged possibility"}},"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":6435,"cost_usd_reported":0.0},"compiled_at":"2026-10-05","bank_version":"abstract-p1-20260923","model_version":"classifier-1.13.0","abstract_states":{"claims_first":0.05,"states_limitation":0.68,"human_participants":0.02,"controlled_comparison":0.61,"randomized_assignment":0.01,"states_quantitative_result":0.07,"compares_with_prior_results":0.95,"mentions_code_or_data_availability":0.03},"evidential_basis":{"p":0.97,"value":"simulation or computation","probabilities":{"argument":0.0,"literature":0.0,"proof_or_derivation":0.0,"analysis_of_existing_data":0.0,"observation_or_experiment":0.03,"simulation_or_computation":0.97}},"contribution_type":{"p":1.0,"value":"method or tool","probabilities":{"review":0.0,"method_or_tool":1.0,"empirical_study":0.0,"simulation_study":0.0,"theoretical_result":0.0,"dataset_or_benchmark":0.0,"position_or_commentary":0.0}},"contribution_statement":{"p":1.0,"text":"We present Adaptive State Preparation by Iterative Removal of Entanglement (ASPIRE), an algorithm that approximately compiles state-preparation circuits by selecting gates based on the state's underlying entanglement geometry and the available connectivity of the target quantum processor.","location":"abstract s3"}},"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}}