◍wovepaper
SearchResearchersInstitutions
Sign in
institution

Defence Science and Technology Group

Australia

1 paper here37 citations across 1
fields
  • quant-ph1
ROR 05ddrvt52OpenAlex

affiliations via OpenAlex

most citedLower bounds on the complexity of simulating quantum gates

37 citations

researchers with a paper here
  • Andrew M. Childs1
  • Henry L. Haselgrove1
  • Michael A. Nielsen1
collaborating institutions
  • California Institute of TechnologyUS1 paper
  • Massachusetts Institute of TechnologyUS1 paper
  • The University of QueenslandAU1 paper

1 paper

quant-ph2003★ 37 cited

Lower bounds on the complexity of simulating quantum gates

Andrew M. Childs, Henry L. Haselgrove, Michael A. Nielsen

We give a simple proof of a formula for the minimal time required to simulate a two-qubit unitary operation using a fixed two-qubit Hamiltonian together with fast local unitaries.…

◍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.