Bremner, Michael J.

Characterizing quantum supremacy in near-term devices

Boixo, S., Isakov, S. V., Smelyanskiy, V. N., Babbush, R., Ding, N., Jiang, Z., Bremner, M. J., Martinis, J. M., & Neven, H. (2018) · Nature Physics

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 1,175

Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy

Bremner, M. J., Jozsa, R., & Shepherd, D. J. (2011) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 308

Average-Case Complexity Versus Approximate Simulation of Commuting Quantum Computations

Bremner, M. J., Montanaro, A., & Shepherd, D. J. (2016) · Physical Review Letters

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 299

Achieving quantum supremacy with sparse and noisy commuting quantum computations

Bremner, M. J., Montanaro, A., & Shepherd, D. J. (2017) · Quantum

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 191

Universal quantum computation and simulation using any entangling Hamiltonian and local unitaries

Dodd, J. L., Nielsen, M. A., Bremner, M. J., & Thew, R. T. (2002) · Physical Review A

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 156

Quantum simulation of interacting high-dimensional systems: The influence of noise

Dür, W., Bremner, M. J., & Briegel, H. J. (2008) · Physical Review A

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 41