{"paper":{"title":"Federated Unlearning of Quantum Data via Classical Shadows","arxiv_id":"2610.19077","primary_cat":"quant-ph","submitted_at":"2026-10-13T19:11:33+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 federated learning trains a quantum neural network (QNN) across nodes that hold quantum data, such as the states of quantum sensors.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.06,"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.57,"id":"s1","own":false,"role":"background","text":"To forget data, unlearning methods for quantum models replay them, and federated unlearning from stored updates removes whole nodes only.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.05,"main_claim_p":0.04,"quantitative":false,"quantitative_p":0.1,"role_probabilities":{"gap":0.43,"method":0.0,"result":0.0,"background":0.57,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":2,"p":0.7,"id":"s2","own":false,"role":"background","text":"Quantum data cannot be replayed, since a state is consumed when measured and cannot be cloned.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.07,"main_claim_p":0.04,"quantitative":false,"quantitative_p":0.06,"role_probabilities":{"gap":0.29,"method":0.0,"result":0.0,"background":0.7,"limitation":0.01,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":3,"p":0.52,"id":"s3","own":true,"role":"method","text":"We propose Shadow-based Data Erasure (SHADE), in which each node records a classical shadow of every training state, a few randomized single-qubit measurements taken at training time.","hedge":{"p":0.99,"label":"asserted"},"own_p":0.8,"main_claim_p":0.13,"quantitative":false,"quantitative_p":0.14,"role_probabilities":{"gap":0.0,"method":0.52,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.48,"interpretation":0.0}},{"i":4,"p":0.98,"id":"s4","own":true,"role":"method","text":"The gradient and curvature of a QNN on a state are expectations of observables, so SHADE estimates them for the forget data from the shadows at any later parameters and removes their effect by a federated Newton correction.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.81,"main_claim_p":0.18,"quantitative":false,"quantitative_p":0.05,"role_probabilities":{"gap":0.0,"method":0.98,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.02,"interpretation":0.0}},{"i":5,"p":0.88,"id":"s5","own":true,"role":"method","text":"Only classical estimates cross the network.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.52,"main_claim_p":0.05,"quantitative":false,"quantitative_p":0.06,"role_probabilities":{"gap":0.0,"method":0.88,"result":0.02,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.08,"interpretation":0.02}},{"i":6,"p":0.79,"id":"s6","own":true,"role":"result","text":"We prove that the shadow size needed for a target unlearning error grows exponentially in the size of the backward light cone of the measured observable and not in the number of qubits.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.92,"main_claim_p":0.26,"quantitative":true,"quantitative_p":0.95,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.79,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.2,"interpretation":0.01}},{"i":7,"p":1.0,"id":"s7","own":true,"role":"result","text":"In simulation with 50 nodes and on edge boards, SHADE matches the forget accuracy of retraining within 0.5 points, without replay and in under 0.2 s.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.96,"main_claim_p":0.35,"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}}]},"compiled":{"main_claim":{"p":0.91,"text":"In simulation with 50 nodes and on edge boards, SHADE matches the forget accuracy of retraining within 0.5 points, without replay and in under 0.2 s.","location":"abstract s7","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":6267,"cost_usd_reported":0.0},"compiled_at":"2026-10-15","bank_version":"abstract-p1-20260923","model_version":"classifier-1.13.0","abstract_states":{"claims_first":0.11,"states_limitation":0.58,"human_participants":0.03,"controlled_comparison":0.81,"randomized_assignment":0.05,"states_quantitative_result":0.98,"compares_with_prior_results":0.9,"mentions_code_or_data_availability":0.03},"evidential_basis":{"p":0.89,"value":"simulation or computation","probabilities":{"argument":0.0,"literature":0.0,"proof_or_derivation":0.09,"analysis_of_existing_data":0.0,"observation_or_experiment":0.02,"simulation_or_computation":0.89}},"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":0.99,"text":"We propose Shadow-based Data Erasure (SHADE), in which each node records a classical shadow of every training state, a few randomized single-qubit measurements taken at training time.","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,"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"}}}