26 citations · 55 across the 4 of their papers we have counts for
4 papers
Iterative Quantum Optimization with Adaptive Problem Hamiltonian
Yifeng Rocky Zhu, David Joseph, Cong Ling +1
Quantum optimization algorithms hold the promise of solving classically hard, discrete optimization problems in practice. The requirement of encoding such problems in a Hamiltonian…
Quantum mean value approximator for hard integer value problems
David Joseph, Antonio J. Martinez, Cong Ling +1
Evaluating the expectation of a quantum circuit is a classically difficult problem known as the quantum mean value problem (QMV). It is used to optimize the quantum approximate opt…
Two quantum Ising algorithms for the Shortest Vector Problem: one for now and one for later
David Joseph, Adam Callison, Cong Ling +1
Quantum computers are expected to break today's public key cryptography within a few decades. New cryptosystems are being designed and standardised for the post-quantum era, and a…
Not-so-adiabatic quantum computation for the shortest vector problem
David Joseph, Alexandros Ghionis, Cong Ling +1
Since quantum computers are known to break the vast majority of currently-used cryptographic protocols, a variety of new protocols are being developed that are conjectured, but not…