Itay Hen

Quantifying the Impact of Precision Errors on Quantum Approximate Optimization Algorithms

2021 · arXiv (Cornell University)

The quantum approximate optimization algorithm (QAOA) is a hybrid quantum-classical algorithm that seeks to achieve approximate solutions to optimization problems by iteratively alternating between intervals of controlled quantum evolution. Here, we examine the effect of …

Hardness and Ease of Curing the Sign Problem for Two-Local Qubit\n Hamiltonians

2019 · arXiv (Cornell University)

We examine the problem of determining whether a multi-qubit two-local\nHamiltonian can be made stoquastic by single-qubit unitary transformations. We\nprove that when such a Hamiltonian contains one-local terms, then this task can\nbe NP-hard. This is shown …