Quantum Physics · arXiv:2610.19077 v1 · submitted 13 Oct 2026 · 39 references
Federated Unlearning of Quantum Data via Classical Shadows
The paper says
“Quantum federated learning trains a quantum neural network (QNN) across nodes that hold quantum data, such as the states of quantum sensors.”
more of the abstract
To forget data, unlearning methods for quantum models replay them, and federated unlearning from stored updates removes whole nodes only. Quantum data cannot be replayed, since a state is consumed when measured and cannot be cloned. 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. 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. Only classical estimates cross the network. 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. 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.
from the abstract
Pith says
Machine review · deepseek-v4-flash · 15 Oct 2026 · what was read was not recorded · not checked by a person
It can be wrong. Challenge this review or reply to it.
The passes disagreed. Reader: holds up. Skeptic: holds up only with conditions. Referee: major revision.
Clever and well-tested solution to a real problem, but the theoretical guarantee relies on a zero-gradient condition that is unlikely to hold in practice and is not bounded or tested. This line is wrong
3 major objections · 6 minor
How often objections from reviews like this one are right: not yet measured
Not checked: figures, code, what the 39 references say.
The paper says, at §II.B & §III.C, Eq. (8) and Proposition 2
The review did not quote this passage.
Pith says: Objection 1 of 3 · major
The identity ∇L(θ⋆; D_r) = -g_f, on which the Newton correction rests, assumes ∇L(θ⋆; D)=0 (i.e., θ⋆ is a minimizer of the full loss). The paper states this assumption (sentence b55) but does not analyze the error when training has not converged to a stationary point—a typical situation for non-convex QNN landscapes under SGD.
more of objection 1
If ∇L(θ⋆;D) ≠ 0, an additional term ∥(Ĥ_r)^{-1}∇L(θ⋆;D)∥ appears in the correction, which is not captured by Proposition 2. Please either (a) bound ∥∇L(θ⋆;D)∥ in terms of training parameters and include it in the error analysis, or (b) provide experiments with early-stopped or less-converged models to demonstrate that the method remains accurate within the claimed margin.
The paper says, at §IV, Proposition 2 and Corollary 1
The review did not quote this passage.
Pith says: Objection 2 of 3 · major
The theoretical guarantees (Proposition 2) rely on L(·; D_r) being κ-strongly convex and having an M-Lipschitz Hessian on a ball containing θ⋆ and θ_r. These conditions are not verified for the QNN circuits used in the experiments, and QNN loss landscapes are generally non-convex.
more of objection 2
While the empirical results suggest the method still works, the paper should discuss the plausibility of these assumptions for the shallow circuits employed (8 qubits, layered brickwork) and, if possible, report estimated values of κ and M or bounds derived from the circuit structure. Without such discussion, the applicability of the parameter-distance bound to the tested setting is unclear.
The paper says, at §V, Table I and Fig. 6
The review did not quote this passage.
Pith says: Objection 3 of 3 · major
The experiments are conducted with 60 training rounds; in this regime the model is likely near a local minimum. To support the claim that SHADE works under less ideal convergence (e.g., when ∇L(θ⋆;D) is not negligible), please include a sensitivity study where the number of training rounds is varied (e.g., 10, 20, 40 rounds) and measure the distance to retrain and forget accuracy. This would directly address the skeptic's concern about the practical validity of the minimizer assumption.
6 minor objections
The paper says, at §IV, Theorem 1
Pith says: minor objection 1 of 6
The constant α in Eq. (9) is said to be absolute but is not specified or referenced. Please either provide its value or cite a standard median-of-means bound (e.g., from Huang et al., Nature Physics 2020) so that readers can compute the required S.
The paper says, at §III-C, Eq. (8)
Pith says: minor objection 2 of 6
The step 'symmetrizes Ĥ_r, raises its eigenvalues below μ to μ' should be explicitly described as projecting onto the set of symmetric matrices with eigenvalues at least μ. This projection is convex and does not increase the distance to H_r, but a brief justification would improve clarity.
show 4 more
The paper says, at §V-A, Testbed description
Pith says: minor objection 3 of 6
The testbed uses only 3 nodes, while the simulation uses 50. It would be helpful to comment on how the testbed results (in Table I columns) are expected to generalize to a larger number of nodes, particularly regarding network latency and estimation parallelism.
The paper says, at §V-B, Table I
Pith says: minor objection 4 of 6
The 'Time' column for SHADE reports 0.17–0.18 s in simulation and 0.18–0.19 s on testbed. Please clarify whether this includes only the server's Newton solve and the upload of estimates, or also the per-node estimation time from shadows. If the latter, mention the node-level wall-clock time.
The paper says, at §III-A, Eq. (5)
Pith says: minor objection 5 of 6
The description of the shadow protocol mentions calibrating for readout errors on real devices. It would be helpful to cite the calibrated-shadow literature (e.g., Chen et al., PRX Quantum 2021) for the variance bound after calibration.
The paper says, at General
Pith says: minor objection 6 of 6
The phrase 'quantum data cannot be replayed' could be slightly softened: quantum data cannot be replayed after measurement because the state is destroyed, but they could be replayed if additional copies are available. The paper already acknowledges this (the no-cloning theorem and finite copies). Consider rewording in the abstract to avoid implying absolute impossibility.
What would settle it
Re-run the main experiment (50 nodes, 8 qubits, sample deletion 5%) with models taken at early training epochs (e.g., rounds 10, 20, 30, 40) where ∥∇L(θ⋆;D)∥ is significant. For each early model, compute the SHADE correction and measure ∥θ_u − θ_r∥ and the forget accuracy. If the distance exceeds 0.03 (the value reported at round 60) or the FA drops more than 1 point from the retrained FA, the minimizer assumption is load-bearing. Report ∥∇L(θ⋆;D)∥ for each epoch.
from the skeptic's reading
How the review went
4 readings by deepseek-v4-flash · 15 Oct 2026
- Reader holds up
- Skeptic partly agrees: says it holds up only with conditions The Newton correction assumes ∇L(θ⋆;D)=0, i.e., θ⋆ is a minimizer of the full loss. In practice, training may not converge to a stationary point; the resulting error is unaccounted for and could break the forget accuracy guarantee.
- Editor wrote the verdict above
- Referee major revision: 3 major objections, 6 minor
Not run on this paper: the simulated authors' defence.
Pith did not check this review's objections against the paper.
The review in full
The review in brief, machine-written
This paper tackles a genuine and underappreciated problem: how to remove specific quantum states from a federated QNN when the states cannot be replayed. The core idea—record classical shadows of every state at training time, then estimate the forget data's gradient and the retained data's curvature from the shadows and apply a federated Newton correction—is clever and well-motivated. The light-cone bound on snapshot storage is a nice practical addition. The experiments are thorough, covering three deletion types, multiple baselines, and real hardware under a realistic noise model. The key claim (forget accuracy within 0.5 points of retraining, in under 0.2 seconds) is convincingly demonstrated.
There is one soft spot, and the stress-test note gets it right. The Newton correction in Eq. (8) depends on the identity ∇L(θ^⋆; Dr) = −gf, which holds only if ∇L(θ^⋆; D) = 0—i.e., the trained model is a stationary point of the full loss. The paper states this assumption (b55), but in a realistic QFL deployment with noisy parameter-shift estimates and non-convex loss landscapes, convergence to a stationary point is not assured. The error introduced by a non-zero gradient is not bounded, and the paper does not test the sensitivity of the method to training convergence. The theory (Proposition 2) also assumes κ-strong convexity with M-Lipschitz Hessian—conditions unlikely to hold for QNNs and not verified for the circuits used. The experiments are done with a well-trained model (60 rounds), which may be near a local minimum, but the claim of “within 0.5 points” is not demonstrated under less ideal convergence.
That said, the paper does not hide these assumptions, and the experimental results suggest the method still works in practice despite them. The flaw is real but not fatal; it limits the theoretical rigor that can be claimed. A responsible revision would either bound ∥∇L(θ^⋆; D)∥ from training data or include experiments with fewer rounds to test robustness.
This paper is for the quantum ML and federated learning communities. It deserves a serious referee and likely acceptance after minor revisions addressing the convergence assumptions. I would definitely bring it to reading group.
The strongest objection
The central unlearning procedure (Eq. 8) derives from the identity ∇L(θ⋆;D_r) = −g_f, which holds only if ∇L(θ⋆;D)=0. The paper explicitly states (sentence b55) that θ⋆ is taken as a minimizer of L(·;D). In a realistic QFL deployment, the model is trained by noisy parameter-shift estimates on finite copies, and the global convergence of SGD is not guaranteed on the non‑convex QNN landscape. Hence θ⋆ may have a non‑zero gradient, introducing an additional error term in the Newton step that is not captured by Proposition 2. The paper does not bound ∥∇L(θ⋆;D)∥ or test how the correction degrades when training has not reached a stationary point. The experiments use a fully trained model (60 rounds), which may be near a local minimum, but the claim of ‘within 0.5 points of retraining’ is not demonstrated under less ideal convergence conditions. If the initial gradient norm is large, the uncorrected term could be comparable to the first term in Eq. (10), invalidating the error target.
The reader identified the strong‑convexity assumption of the retain loss as the weakest point. That concern is valid and acknowledged by the paper. However, a more fundamental assumption—that θ⋆ is a minimizer of the full loss—is not discussed in the limitations. It is used implicitly in the Newton correction derivation and is not verified experimentally. The experiments likely operate close to a local minimum, but the paper claims a general capability without testing regimes where convergence is poor. Adding a test for the initial gradient norm would directly address this risk. Therefore, I recommend a CONDITIONAL acceptance pending this additional verification. My agreement with the reader is partial because the minimizer assumption is a different (and arguably more basic) gap not captured by the convexity criticism.
The referee's report
If the results are robust, SHADE solves a practically important problem for quantum federated learning: forgetting specific quantum data that cannot be remeasured. The use of classical shadows to enable deferred gradient and curvature estimation is novel, and the light-cone analysis makes the record cost manageable for shallow circuits. The method has been implemented on real edge boards with device noise, which strengthens the claim of practical applicability. The paper provides formal guarantees for the shadow estimates and a Newton correction bound, and the experimental evaluation covers three deletion types and multiple baselines.
Pith's reading of the paper (a machine's summary, not the authors')
Quantum federated learning trains a quantum neural network across nodes that produce quantum states, such as sensor outputs. When data must be forgotten—because a node withdraws or a sensor drifted—existing unlearning methods require replaying the consumed states, which is impossible due to no-cloning and the one-shot nature of quantum measurement. This paper proposes SHADE, which records classical shadows of each training state, enabling estimation of gradients and curvatures for the forget data without re-measuring the state. A single federated Newton correction then removes the forget data's effect. The authors prove the shadow record grows with the backward light cone of the measured observable, not the total qubit count, and demonstrate that SHADE matches retraining accuracy within 0.5 points in under 0.2 seconds on a 50-node simulation and edge hardware.
What carries the argument. The key machinery is the classical shadow formalism combined with backward-light-cone restriction, applied to the gradient and Hessian operators of a parameterized quantum circuit. The classical shadow snapshot (Eq. 5) provides unbiased estimates of expectation values at any parameters when the circuit depth is fixed. By keeping snapshots only on the light cone Λ of the output observable O, the required number of snapshots per state grows exponentially in |Λ| but not in the number of qubits (Theorem 1). The federated Newton correction (Eq. 8) uses the estimated gradient of the forget data and the estimated Hessian of the retained data to update the model in one step, without iterative optimization or replay.
Core claim. The central discovery is that a quantum neural network's gradient and Hessian on a quantum state are expectation values of observables, and these can be estimated at any later parameter value from classical shadows recorded during training, without accessing the original state again. By storing only the shadow data on the backward light cone of the output observable, the storage cost depends only on the depth of the circuit, not on the total qubit count. This enables a federated Newton correction that matches the unlearning accuracy of full retraining while being orders of magnitude faster and consuming no fresh quantum copies.
The premise it rests on. The error bound in Proposition 2 assumes the retain loss landscape is κ-strongly convex with an M-Lipschitz Hessian on a ball containing the trained and retrained models, an assumption that is known to fail for typical quantum neural networks outside of overparameterized regimes.
If the paper is right (Pith's inferences, not the authors')
SHADE enables fine-grained unlearning (per-sample, per-window, per-node) in quantum federated learning without any additional quantum resource consumption after training.
Unlearning can be completed in under 0.2 seconds regardless of the number of nodes, enabling real-time compliance with deletion requests.
The shadow record size scales exponentially with the backward light cone of the observable, not with the number of qubits, allowing large shallow circuits to be forgotten efficiently.
The method maintains model utility (test accuracy above 95.7%) and privacy (membership inference near 50%) across all deletion types.
SHADE does not require any node to re-prepare or measure quantum states after the training phase, making it compatible with strict no-cloning constraints.
The SHADE framework could be adapted to other tasks beyond classification, such as quantum state certification or quantum metrology, where forgetting past calibration data is required.
The theoretical dependence on strong convexity (Proposition 2) may be relaxed by using a quasi-Newton update or a smaller step size, potentially extending the method to deeper circuits where the Hessian is not guaranteed positive definite.
The record cost (72 kB per state for 8 qubits) might be reduced further by adaptive shadow protocols that focus on the most informative measurement bases, or by compressing the shadow bits through error-correcting codes.
Check this review
Pith stored no record of this review's passes and took no fingerprint of it. Reviews made by code from 13 Nov 2026 on carry both.
How often reviews like this one are right
Reviews like this one: written by deepseek-v4-flash, where what was read was not recorded.
How often objections from reviews like this one are right: not yet measured
Reviews by people
This review was written by a machine. No person has reviewed this paper on Pith yet. A scientist listed on Pith can review it for a fee, and their review is published here whatever it concludes.
The paper
Abstract
Quantum federated learning trains a quantum neural network (QNN) across nodes that hold quantum data, such as the states of quantum sensors. To forget data, unlearning methods for quantum models replay them, and federated unlearning from stored updates removes whole nodes only. Quantum data cannot be replayed, since a state is consumed when measured and cannot be cloned. 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. 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. Only classical estimates cross the network. 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. 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.
The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. No sentence in this record was written by a model.
abstract compiled · 2026-10-15
The authors' main claim, as the classifier picked it out 0.91
“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.”
How the main claim is stated: asserted 1.00
What the abstract itself states, as probabilities: 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.90 · mentions code or data availability 0.03
The abstract, sentence by sentence
This table labels the abstract only (arXiv listing abstract v1). The number is the probability the classifier gave the label.
| Sentence | Role | The authors' own work | States the main conclusion | Strength |
|---|---|---|---|---|
| Quantum federated learning trains a quantum neural network (QNN) across nodes that hold quantum data, such as the states of quantum sensors. | background 1.00 | 0.06 | 0.02 | asserted 1.00 |
| To forget data, unlearning methods for quantum models replay them, and federated unlearning from stored updates removes whole nodes only. | background 0.57 | 0.05 | 0.04 | asserted 1.00 |
| Quantum data cannot be replayed, since a state is consumed when measured and cannot be cloned. | background 0.70 | 0.07 | 0.04 | asserted 1.00 |
| 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. | method 0.52 | 0.80 | 0.13 | asserted 0.99 |
| 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. | method 0.98 | 0.81 | 0.18 | asserted 1.00 |
| Only classical estimates cross the network. | method 0.88 | 0.52 | 0.05 | asserted 1.00 |
| 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. | result 0.79 | 0.92 | 0.26 | asserted 1.00 |
| 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. | result 1.00 | 0.96 | 0.35 | asserted 1.00 |
What kind of paper the classifier reports this is: method or tool 1.00 · evidence from simulation or computation 0.89
What was examined, and what was not
Sources read
- arXiv listing abstract v1
Not examined
- full text
- figures and tables
- references and citing sentences
- relations to other papers
Levels run
- P abstract
Not run
- S sections
- T body sentences
- C citations
- R cross-paper relations
How the labels were made
Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-10-15: 1 request, 6,267 input tokens.
Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. This record as JSON
Figures (7)
Showing 5 of the paper's 7 figures. Figures are the authors', reproduced from the paper.
References (39)
- [1] C. Degen, F. Reinhard, and P. Cappellaro, “Quantum sensing,”Reviews of Modern Physics, vol. 89, no. 3, p. 035002, 2017 on Pith
- [2] Z. Zhang and Q. Zhuang, “Distributed quantum sensing,”Quantum Science and Technology, vol. 6, no. 4, p. 043001, 2021 on Pith
- [3] S. Wehner, D. Elkouss, and R. Hanson, “Quantum internet: A vision for the road ahead,”Science, vol. 362, no. 6412, p. eaam9288, 2018 on Pith
- [4] I. Cong, S. Choi, and M. D. Lukin, “Quantum convolutional neural networks,”Nature Physics, vol. 15, no. 12, pp. 1273–1278, 2019 on Pith
- [5] S. Y .-C. Chen and S. Yoo, “Federated Quantum Machine Learning,” Entropy, vol. 23, no. 4, p. 460, 2021 on Pith
- [6] M. Chehimi and W. Saad, “Quantum Federated Learning with Quantum Data,” inProceedings of the IEEE International Conference on Acous- tics, Speech and Signal Processing (ICASSP), 2022, pp. 8617–8621 on Pith
- [7] B. Wu, J. Huang, and S. Yu, ““X of Information” Continuum: A Survey on AI-Driven Multi-Dimensional Metrics for Next-Generation Net- worked Systems,”IEEE Communications Surveys & Tutorials, vol. 28, pp. 5307–5344, 2026 on Pith
- [8] B. Wu, Z. Ding, and J. Huang, “RELIEF: Turning missing modalities into training acceleration for federated learning on heterogeneous IoT edge,”IEEE Internet of Things Journal, 2026, early access on Pith
- [9] B. Wu, J. Huang, Q. Duan, L. Dong, and Z. Cai, “Enhancing Vehic- ular Platooning With Wireless Federated Learning: A Resource-Aware Control Framework,”IEEE Transactions on Networking, vol. 34, pp. 1479–1494, 2026 on Pith
- [10] B. Wu, J. Huang, and Q. Duan, “Real-time intelligent healthcare enabled by federated digital twins with AoI optimization,”IEEE Network, vol. 40, no. 2, pp. 184–191, 2026 on Pith
- [11] Z. Ding, J. Huang, Q. Duan, C. Zhang, Y . Zhao, and S. Gu, “A Dual- Level Game-Theoretic Approach for Collaborative Learning in UA V- Assisted Heterogeneous Vehicle Networks,” in2025 IEEE International Performance, Computing, and Communications Conference (IPCCC), 2025, pp. 1–8 on Pith
- [12] Z. Ding, J. Huang, Y . Zhao, and Z. Cai, “Combating knowledge diversity and catastrophic forgetting in UA V-assisted collaborative ve- hicular learning: A game-theoretic approach,”ACM Transactions on Autonomous and Adaptive Systems, Jun. 2026, just Accepted on Pith
- [13] Z. Ding, J. Huang, and J. Qi, “Learning to defend: A multi-agent reinforcement learning framework for Stackelberg security game in mo- bile edge computing,” in2026 International Conference on Computing, Networking and Communications (ICNC), 2026, pp. 769–774 on Pith
- [14] J. Huang, C.-C. Xing, and M. Guizani, “Power allocation for D2D communications with SWIPT,”IEEE Transactions on Wireless Com- munications, vol. 19, no. 4, pp. 2308–2320, 2020 on Pith
- [15] J. Huang, Y . Zhou, Z. Ning, and H. Gharavi, “Wireless power transfer and energy harvesting: Current status and future prospects,”IEEE Wireless Communications, vol. 26, no. 4, pp. 163–169, 2019 on Pith
- [16] X. Che, D. Xu, and X. Du, “Comparative analysis of formula and structure prediction from tandem mass spectra,” inData Science: Foundations and Applications (PAKDD 2026), ser. Lecture Notes in Computer Science, vol. 16618. Singapore: Springer, 2027, pp. 215–227 on Pith
- [17] B. Wu, Z. Ding, and J. Huang, “A Review of Continual Learning in Edge AI,”IEEE Transactions on Network Science and Engineering, vol. 13, pp. 6571–6588, 2026 on Pith
- [18] B. Wu, J. Huang, and Y . Zhao, “From Alpha to Omega: Lifecycle- aware forgetting defense in federated continual learning for planetary exploration,” in2026 IEEE 46th International Conference on Distributed Computing Systems (ICDCS), 2026, pp. 1–11 on Pith
- [19] B. Wu and J. Huang, “Lifecycle-Aware Federated Continual Learning in Mobile Autonomous Systems,” arXiv preprint arXiv:2604.20745, 2026 on PithPith's reviewarXiv
- [20] B. Wu, Z. Ding, and J. Huang, “PRISM: Exposing and Resolving Spurious Isolation in Federated Multimodal Continual Learning,” arXiv preprint arXiv:2605.01061, 2026 on PithPith's reviewarXiv
show 19 more
- [21] ——, “Not all experience belongs in the weights: Component routing for self-improving GUI agents,”arXiv preprint arXiv:2610.01787, 2026 on PithPith's reviewarXiv
- [22] B. Wu, J. Huang, and Y . Zhao, “REBASE: Device-cloud experi- ence coherence for GUI agents across app updates,”arXiv preprint arXiv:2609.32130, 2026 on PithPith's reviewarXiv
- [23] B. Wu and J. Huang, “CrystalMem: Elastic memory for self- evolving LLM agents via knowledge crystallization,”arXiv preprint arXiv:2608.00303, 2026 on PithPith's reviewarXiv
- [24] L. Bourtoule, V . Chandrasekaran, C. A. Choquette-Choo, H. Jia, A. Travers, B. Zhang, D. Lie, and N. Papernot, “Machine Unlearning,” inProceedings of the IEEE Symposium on Security and Privacy (S&P), 2021, pp. 141–159 on Pith
- [25] Z. Ding and J. Huang, “Toward Trustworthy Federated Unlearning for Mobile Autonomous Systems,”IEEE Network, pp. 1–9, 2026 on Pith
- [26] Z. Ding, B. Wu, and J. Huang, “SCALE: Sensitivity-Aware Federated Unlearning with Information Freshness Optimization for Mobile Edge Computing,” inProceedings of the IEEE International Conference on Distributed Computing Systems (ICDCS), 2026, to appear on Pith
- [27] U. Pudasaini, Z. Ding, and J. Huang, “Securing smart agriculture with communication-efficient federated unlearning,” in2026 IEEE 27th International Conference on High Performance Switching and Routing (HPSR), 2026, pp. 1–7 on Pith
- [28] Z. Ding, B. Wu, and J. Huang, “EASE: Federated Multimodal Un- learning via Entanglement-Aware Anchor Closure,” arXiv preprint arXiv:2605.00733, 2026 on PithPith's reviewarXiv
- [29] Z. Ding, J. Huang, and L. Dong, “When unlearning fails: Reliable data deletion under post-training in agent networks,”arXiv preprint arXiv:2607.28829, 2026 on PithPith's reviewarXiv
- [30] X. Che, D. Xu, and X. Wu, “StraightDP: Geometry-aware dif- ferential privacy for rectified-flow transformers,”arXiv preprint arXiv:2607.29100, 2026 on PithPith's reviewarXiv
- [31] J. Su, R. He, G. Li, S. Qin, Z. He, H. Situ, and F. Gao, “From membership-privacy leakage to quantum machine unlearning,”Physical Review Applied, vol. 25, no. 4, p. 044056, 2026 on Pith
- [32] M. Kurmanji, P. Triantafillou, J. Hayes, and E. Triantafillou, “Towards Unbounded Machine Unlearning,” inAdvances in Neural Information Processing Systems (NeurIPS), vol. 36, 2023 on Pith
- [33] C. Guo, T. Goldstein, A. Hannun, and L. van der Maaten, “Certified Data Removal from Machine Learning Models,” inProceedings of the 37th International Conference on Machine Learning (ICML), 2020, pp. 3832–3842 on Pith
- [34] G. Liu, X. Ma, Y . Yang, C. Wang, and J. Liu, “FedEraser: Enabling Efficient Client-Level Data Removal from Federated Learning Models,” inProceedings of the IEEE/ACM International Symposium on Quality of Service (IWQoS), 2021, pp. 1–10 on Pith
- [35] L. Zhang, T. Zhu, H. Zhang, P. Xiong, and W. Zhou, “FedRecov- ery: Differentially Private Machine Unlearning for Federated Learning Frameworks,”IEEE Transactions on Information Forensics and Security, vol. 18, pp. 4732–4746, 2023 on Pith
- [36] W. K. Wootters and W. H. Zurek, “A single quantum cannot be cloned,” Nature, vol. 299, no. 5886, pp. 802–803, 1982 on Pith
- [37] M. Schuld, V . Bergholm, C. Gogolin, J. Izaac, and N. Killoran, “Eval- uating analytic gradients on quantum hardware,”Physical Review A, vol. 99, no. 3, p. 032331, 2019 on Pith
- [38] H.-Y . Huang, R. Kueng, and J. Preskill, “Predicting many properties of a quantum system from very few measurements,”Nature Physics, vol. 16, no. 10, pp. 1050–1057, 2020 on Pith
- [39] M. Cerezo, A. Sone, T. V olkoff, L. Cincio, and P. J. Coles, “Cost function dependent barren plateaus in shallow parametrized quantum circuits,” Nature Communications, vol. 12, no. 1, p. 1791, 2021 on Pith
Challenges and discussion
Disagree with the review, or know something it missed? Leave a comment, or challenge this review formally: a challenge becomes a permanent entry in this paper's record, and its decision is published here.
Come back by email
A short list of the week's newly reviewed papers. Nothing is sent until you confirm from your inbox, and every email has a link that stops it. No account.
No comments yet.
Sign in to comment