303 citations · 1.3k across the 11 of their papers we have counts for
11 papers
Achieving quantum supremacy with sparse and noisy commuting quantum computations
Michael J. Bremner, Ashley Montanaro, Dan J. Shepherd
The class of commuting quantum circuits known as IQP (instantaneous quantum polynomial-time) has been shown to be hard to simulate classically, assuming certain complexity-theoreti…
Average-case complexity versus approximate simulation of commuting quantum computations
Michael J. Bremner, Ashley Montanaro, Dan J. Shepherd
We use the class of commuting quantum computations known as IQP (Instantaneous Quantum Polynomial time) to strengthen the conjecture that quantum computers are hard to simulate cla…
Efficient Distributed Quantum Computing
Robert Beals, Stephen Brierley, Oliver Gray +5
We provide algorithms for efficiently addressing quantum memory in parallel. These imply that the standard circuit model can be simulated with low overhead by the more realistic mo…
Binary Matroids and Quantum Probability Distributions
Dan Shepherd
We characterise the probability distributions that arise from quantum circuits all of whose gates commute, and show when these distributions can be classically simulated efficientl…
Quantum Complexity: restrictions on algorithms and architectures
Daniel James Shepherd
A dissertation submitted to the University of Bristol in accordance with the requirements of the degree of Doctor of Philosophy (PhD) in the Faculty of Engineering, Department of C…
Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
Michael J. Bremner, Richard Jozsa, Dan J. Shepherd
We consider quantum computations comprising only commuting gates, known as IQP computations, and provide compelling evidence that the task of sampling their output probability dist…