{"paper":{"title":"When Equivalent Quantum Circuits Lose Synthesis Choices","arxiv_id":"2610.06142","primary_cat":"quant-ph","submitted_at":"2026-10-05T11:13:02+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":"Quantum compilers synthesize high-level operations, such as the quantum Fourier transform and multi-controlled X gates, into gate-level circuits.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.05,"main_claim_p":0.02,"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":1,"p":1.0,"id":"s1","own":false,"role":"background","text":"Across compilation stages, a circuit may be serialized, exchanged as OpenQASM, converted between compilers, or lowered to gates.","hedge":{"p":0.97,"label":"hedged_possibility"},"own_p":0.07,"main_claim_p":0.02,"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.95,"id":"s2","own":false,"role":"background","text":"These representation changes can preserve computation while removing the high-level operation itself, leaving the receiving compiler unable to apply a requested synthesis method.","hedge":{"p":0.66,"label":"hedged_possibility"},"own_p":0.12,"main_claim_p":0.16,"quantitative":false,"quantitative_p":0.04,"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":3,"p":0.47,"id":"s3","own":false,"role":"contribution","text":"We call this loss synthesis availability.","hedge":{"p":0.85,"label":"asserted"},"own_p":0.43,"main_claim_p":0.04,"quantitative":false,"quantitative_p":0.03,"role_probabilities":{"gap":0.05,"method":0.01,"result":0.0,"background":0.45,"limitation":0.0,"future_work":0.0,"contribution":0.47,"interpretation":0.02}},{"i":4,"p":0.84,"id":"s4","own":true,"role":"method","text":"We study synthesis availability in Qiskit, TKET, and Cirq through controlled experiments, repository analysis, circuits captured from project tests, and a Munich Quantum Toolkit pipeline.","hedge":{"p":0.91,"label":"asserted"},"own_p":0.95,"main_claim_p":0.03,"quantitative":false,"quantitative_p":0.09,"role_probabilities":{"gap":0.0,"method":0.84,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.16,"interpretation":0.0}},{"i":5,"p":0.99,"id":"s5","own":true,"role":"result","text":"Synthesis availability survives serialization when deserialization restores the high-level operation and survives compiler conversion only when the receiving compiler supports that operation.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.9,"main_claim_p":0.22,"quantitative":false,"quantitative_p":0.11,"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":6,"p":1.0,"id":"s6","own":true,"role":"result","text":"It does not survive the evaluated OpenQASM routes.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.88,"main_claim_p":0.13,"quantitative":false,"quantitative_p":0.05,"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":1.0,"id":"s7","own":true,"role":"result","text":"After a direct OpenQASM 3 round trip, requested synthesis has no effect in all 360 delivered conditions even though compilation succeeds.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.94,"main_claim_p":0.11,"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":8,"p":1.0,"id":"s8","own":true,"role":"result","text":"In the MQT pipeline, OpenQASM 2 interchange increases the two-qubit gate count by 37.2 percent for an eight-qubit Grover circuit.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.94,"main_claim_p":0.04,"quantitative":true,"quantitative_p":0.99,"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":9,"p":0.78,"id":"s9","own":true,"role":"contribution","text":"We also introduce Verified, which records high-level operations before a representation change and reconstructs them only when a check confirms that the record still matches the delivered circuit.","hedge":{"p":0.99,"label":"asserted"},"own_p":0.94,"main_claim_p":0.06,"quantitative":false,"quantitative_p":0.05,"role_probabilities":{"gap":0.0,"method":0.22,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.78,"interpretation":0.0}},{"i":10,"p":0.99,"id":"s10","own":true,"role":"result","text":"Verified restores requested synthesis in all 830 recovery runs, with median verification times from 2.0 to 638 ms per operation family.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.96,"main_claim_p":0.09,"quantitative":true,"quantitative_p":0.99,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.99,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.01,"interpretation":0.0}},{"i":11,"p":0.67,"id":"s11","own":true,"role":"limitation","text":"The check rejects every stale record but also some valid records.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.94,"main_claim_p":0.06,"quantitative":false,"quantitative_p":0.08,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.33,"background":0.0,"limitation":0.67,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":12,"p":1.0,"id":"s12","own":true,"role":"interpretation","text":"These results show that preserving functional equivalence alone is insufficient when later synthesis choices depend on retained high-level structure.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.83,"main_claim_p":0.9,"quantitative":false,"quantitative_p":0.05,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":1.0}}]},"compiled":{"main_claim":{"p":1.0,"text":"These results show that preserving functional equivalence alone is insufficient when later synthesis choices depend on retained high-level structure.","location":"abstract s12","hedge_strength":{"p":1.0,"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":9410,"cost_usd_reported":0.0},"compiled_at":"2026-10-06","bank_version":"abstract-p1-20260923","model_version":"classifier-1.13.0","abstract_states":{"claims_first":0.05,"states_limitation":0.91,"human_participants":0.02,"controlled_comparison":0.43,"randomized_assignment":0.02,"states_quantitative_result":0.99,"compares_with_prior_results":0.63,"mentions_code_or_data_availability":0.06},"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":0.68,"value":"empirical study","probabilities":{"review":0.0,"method_or_tool":0.32,"empirical_study":0.68,"simulation_study":0.0,"theoretical_result":0.0,"dataset_or_benchmark":0.0,"position_or_commentary":0.0}},"contribution_statement":{"p":0.96,"text":"We also introduce Verified, which records high-level operations before a representation change and reconstructs them only when a check confirms that the record still matches the delivered circuit.","location":"abstract s9"}},"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":13,"sentences_in_abstract":13},"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}}