Hugo Cable, University of Bristol
Concordant computation is a circuit model where only classical mixed-state correlations are allowed at any stage in the circuit (i.e. there can be no entanglement or discord). It is not currently known if concordant circuits always admit efficient simulation by classical computers. I will discuss our new results on this problem, including many new cases where efficient simulation is possible, as well as explaining how our method of simulation can sometimes fail to be efficient.