3 papers
quant-ph2026
Toward Fault-Tolerant Variational Optimization: QAOA under [[4,2,2]] Error Detection
Matteo Robert Child, Emanuele Dri, Giacomo Vitali +2
We present a partially fault-tolerant implementation of QAOA based on the error-detection code, targeting the Max-Cut problem on a square graph. Our main contribution i…
cs.CR2026
Encrypted Neural Networks without Overflows
Philipp Kern, Lorenzo Rovida, Samuel Teuber +3
The popular Cheon-Kim-Kim-Song (CKKS) scheme enables efficient private inference in neural networks by evaluating them on encrypted data. Since CKKS only supports addition, multipl…
quant-ph2024
An Analysis of Quantum Annealing Algorithms for Solving the Maximum Clique Problem
Alessandro Gherardi, Alberto Leporati
Quantum annealers can be used to solve many (possibly NP-hard) combinatorial optimization problems, by formulating them as quadratic unconstrained binary optimization (QUBO) proble…