◍wovepaper
SearchResearchersInstitutions
Sign in
institution

Cheltenham Festivals

United Kingdom

2 papers here520 citations across 2
fields
  • quant-ph2
ROR 04ve0xd91OpenAlex

affiliations via OpenAlex

most citedClassical simulation of commuting quantum computations implies collapse of the polynomial hierarchy

303 citations

researchers with a paper here
  • Aram W. Harrow1
  • Dan Shepherd1
  • Mark Stather1
  • Noah Linden1
  • Oliver Gray1
  • Robert Beals1
  • Samuel Kutin1
  • Stephen Brierley1
collaborating institutions
  • CCI Reprographics (United States)US1 paper
  • Center for Theoretical PhysicsPL1 paper
  • Heilbronn Institute for Mathematical ResearchGB1 paper
  • L-3 Communications (United States)US1 paper
  • Leibniz University HannoverDE1 paper
  • Massachusetts Institute of TechnologyUS1 paper
  • University of BristolGB1 paper
  • University of CambridgeGB1 paper
Showing quant-phShow all

2 papers · 1 filter

quant-ph2012★ 217 cited

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…

quant-ph2010★ 303 cited

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…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.