Commuting quantum circuits and complexity of Ising partition functions

Commuting quantum circuits and complexity of Ising partition functions

Instantaneous quantum polynomial-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...

Full description

Bibliographic Details
Main Authors: Keisuke Fujii, Tomoyuki Morimae
Format: Article
Language:English
Published: IOP Publishing 2017-01-01
Series:New Journal of Physics
Subjects:
instantaneous quantum polynomial time computation
commuting quantum circuit
quantum supremacy
classical simulation
partition function
Ising model
Online Access:https://doi.org/10.1088/1367-2630/aa5fdb

Similar Items

Similar Items