4 citations · 8 across the 3 of their papers we have counts for
3 papers
quant-ph2007★ 4 cited
Limitations of some simple adiabatic quantum algorithms
Lawrence M. Ioannou, Michele Mosca
Let , , be the Hamiltonian governing an adiabatic quantum algorithm, where is diagonal in the Hadamard basis and is diagonal in…
cs.DS2005★ 4 cited
Computing finite-dimensional bipartite quantum separability
Lawrence M. Ioannou
Ever since entanglement was identified as a computational and cryptographic resource, effort has been made to find an efficient way to tell whether a given density matrix represent…
quant-ph2003
A Note on Quantum Separability
L. M. Ioannou, B. C. Travaglione
This short note describes a method to tackle the (bipartite) quantum separability problem. The method can be used for solving the separability problem in an experimental setting as…