Commuting quantum circuits and complexity of Ising partition functions

Abstract

Instantaneous quantumpolynomial-time (IQP) computation is a class of quantum computation consisting only of commuting two-qubit gates and is not universal. Nevertheless, it has been shown that if there is a classical algorithm that can simulate IQP efficiently, the polynomial hierarchy collapses to the third level, which is highly implausible. However, the… (More)

Topics

  • Presentations referencing similar topics