Reproduce “Privacy-Preserving Quantum Annealing for Quadratic Unconstrained Binary Optimization (QUBO) Problems” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Moyang Xie, Yuan Zhang, Sheng Zhong, Qun Li
Researchers from Nanjing University and William & Mary developed a privacy-preserving framework for Quadratic Unconstrained Binary Optimization (QUBO) problems solved via third-party quantum annealing services. Their method securely obfuscates sensitive problem matrices, enabling clients to accurately reconstruct optimal solutions with over 90% accuracy for medium-sized problems (e.g., order 40) while maintaining robust privacy guarantees.
Key insights
- Privacy protection is enhanced exponentially with the order of the matrix (n) and the number of digit matrices (k), but decreases as the radix (r) grows due to more information density.
- Accuracy in reconstructing the optimal solution improves with a higher number of samples (t) and a larger radix (r), though increasing k provides diminishing returns beyond a certain point.
- The framework reveals a tunable trade-off between privacy, accuracy, and computational efficiency through parameters like the matrix order, number of digit matrices, radix, and sampling count.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.