We study the problem of simulating the time evolution of a lattice Hamiltonian, where the qubits are laid out on a lattice and the Hamiltonian only includes geometrically local …
We show how to apply the quantum adiabatic algorithm directly to the quantum computation of molecular properties. We describe a procedure to map electronic structure Hamiltonians …
Accurate prediction of chemical and material properties from first-principles quantum chemistry is a challenging task on traditional computers. Recent developments in quantum …
One of the main challenges in the field of quantum simulation and computation is to identify ways to certify the correct functioning of a device when a classical efficient simulation is not …
N Dattani - arXiv preprint arXiv:1901.04405, 2019 - arxiv.org
A book about turning high-degree optimization problems into quadratic optimization problems that maintain the same global minimum (ground state). This book explores …
A Gabriel, BC Hiesmayr, M Huber - arXiv preprint arXiv:1002.2953, 2010 - arxiv.org
Using a recently introduced framework, we derive criteria for quantum k-separability, which are very easily computed. In the case k= 2, our criteria are equally strong to the best …
DS Wang - Quantum Engineering, 2021 - Wiley Online Library
Quantum computing has been a fascinating research field in quantum physics. Recent progresses motivate us to study in depth the universal quantum computing models …
Quantum satisfiability is a constraint satisfaction problem that generalizes classical boolean satisfiability. In the quantum k-SAT problem, each constraint is specified by a k-local …
S Hallgren, D Nagaj, S Narayanaswami - arXiv preprint arXiv:1312.1469, 2013 - arxiv.org
The Local Hamiltonian problem is the problem of estimating the least eigenvalue of a local Hamiltonian, and is complete for the class QMA. The 1D problem on a chain of qubits has …