Michael J. Bremner

Artificial Intelligence · 2002–2016

A researcher in the Science corpus: 4 papers; trusts 5 researchers and is trusted by 10 researchers here, as inferred from the citation graph.

Subfields

• Artificial Intelligence — 27 citations into it; #12,278 of 35,345 by trust here, #7,413 by citations
• Computational Theory and Mathematics — 6 citations into it; #5,418 of 12,182 by trust here, #5,465 by citations

Whom Michael J. Bremner trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Scott Aaronson
2. Sanjeev Arora
3. Boaz Barak
4. H. Nader
5. Richard Jozsa

Who trusts Michael J. Bremner overall

1. Ashley Montanaro
2. Scott Aaronson
3. Aram Wettroth Harrow
4. Edward Farhi
5. Matthew Fisher
6. John Preskill
7. Alexei Y. Arkhipov
8. Nathan Killoran
9. Maria Schuld
10. Sergey Bravyi

Papers from Michael J. Bremner's perspective

Ordered by how strongly the researchers Michael J. Bremner trusts endorse each paper. Same corpus, a different order for every researcher.

1. AND T
2. Quantum computing, postselection, and probabilistic polynomial-time (Proceedings of the Royal Society A)
3. Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy (Proceedings of the Royal Society A)
4. Quantum Computation and Quantum Information: Bibliography
5. Computational Complexity: A Modern Approach
6. Fault-tolerant computing with biased-noise superconducting qubits: a case study
7. Γ and B
8. Quantum computing (New generation computing)
9. Random Matrices
10. Master’s Thesis

Their papers

• Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy (2010) — 489 citations
• Average-case complexity versus approximate simulation of commuting quantum computations (2015) — 315 citations
• Characterizing quantum supremacy in near-term devices (2016) — 1,354 citations
• Quantum dynamics as a physical resource (2002) — 162 citations