pdfformat: 

@InProceedings{bouland_et_al:LIPIcs:2016:5846, author = {Adam Bouland and Laura Mancinska and Xue Zhang}, title = {{Complexity Classification of TwoQubit Commuting Hamiltonians}}, booktitle = {31st Conference on Computational Complexity (CCC 2016)}, pages = {28:128:33}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770088}, ISSN = {18688969}, year = {2016}, volume = {50}, editor = {Ran Raz}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2016/5846}, URN = {urn:nbn:de:0030drops58469}, doi = {10.4230/LIPIcs.CCC.2016.28}, annote = {Keywords: Quantum Computing, Sampling Problems, Commuting Hamiltonians, IQP, Gate Classification Theorems} }
Keywords:  Quantum Computing, Sampling Problems, Commuting Hamiltonians, IQP, Gate Classification Theorems  
Seminar:  31st Conference on Computational Complexity (CCC 2016)  
Issue date:  2016  
Date of publication:  2016 