3 papers
quant-ph2026
Elevating Variational Quantum Semidefinite Programs for Polynomial Objectives
Iria W. Wang, Robin Brown, Taylor L. Patti +3
Many practically important NP-hard optimization problems are inherently higher-order polynomial optimizations, which are typically addressed using approximation algorithms. Classic…
quant-ph2025
Designing Fault-Tolerant Blind Quantum Computation
Gefen Baranes, Iria W. Wang, Francisco Machado +6
Blind quantum computing (BQC) is a computational paradigm that allows a client with limited quantum capabilities to delegate quantum computations to a more powerful server while ke…
quant-ph2024
Universal distributed blind quantum computing with solid-state qubits
Yan-Cheng Wei, Pieter-Jan Stas, Aziza Suleymanzade +16
Blind quantum computing (BQC) is a promising application of distributed quantum systems, where a client can perform computations on a remote server without revealing any details of…