Average-case complexity versus approximate simulation of commuting quantum computations. - Michael J. Bremner; Ashley Montanaro; Dan J. Shepherd (CoRR, 2015)

On the Complexity of Random Quantum Computations and the Jones Polynomial. - Ryan L. Mann; Michael J. Bremner (CoRR, 2017)

Achieving quantum supremacy with sparse and noisy commuting quantum computations. - Michael J. Bremner; Ashley Montanaro; Dan J. Shepherd (Quantum, 2017)

Approximation Algorithms for Complex-Valued Ising Models on Bounded Degree Graphs. - Ryan L. Mann; Michael J. Bremner (Quantum, 2019)

Quantum Parameterized Complexity. - Michael J. Bremner; Zhengfeng Ji; Ryan L. Mann; Luke Mathieson; Mauro E. S. Morales; Alexis T. E. Shaw (CoRR, 2022)

Parameterized Complexity of Weighted Local Hamiltonian Problems and the Quantum Exponential Time Hypothesis. - Michael J. Bremner; Zhengfeng Ji; Xingjian Li 006; Luke Mathieson; Mauro E. S. Morales (CoRR, 2022)

Transversal Injection: Using the Surface Code to Prepare Non-Pauli Eigenstates. - Jason Gavriel; Daniel Herr; Alexis T. E. Shaw; Michael J. Bremner; Alexandru Paler; Simon J. Devitt (QCE, 2023)

The Complexity of Local Stoquastic Hamiltonians on 2D Lattices. - Gabriel Waite; Michael J. Bremner (CoRR, 2025)