Bill Fefferman

Artificial Intelligence · 2018

A researcher in the Science corpus: 1 paper; trusts 2 researchers and is trusted by 0 researchers here, as inferred from the citation graph.

Subfields

Whom Bill Fefferman trusts overall

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

  1. Scott Aaronson

Papers from Bill Fefferman's perspective

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

  1. Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy (Proceedings of the Royal Society A)
  2. Complexity-Theoretic Foundations of Quantum Supremacy Experiments (Cybersecurity and Cyberforensics Conference)
  3. The computational complexity of linear optics (Theory of Computing)
  4. Integrated multimode interferometers with arbitrary designs for photonic boson sampling (Nature Photonics)
  5. AND T
  6. I and J
  7. Quantum computing, postselection, and probabilistic polynomial-time (Proceedings of the Royal Society A)
  8. Improved Simulation of Stabilizer Circuits (arXiv.org)
  9. Encoding a qubit in an oscillator
  10. Classical simulation of noninteracting-fermion quantum circuits (arXiv.org)

Their papers