Lower bounds on the complexity of simulating quantum gates

Simple item page
dc.creatorChilds, Andrew M.
dc.creatorHaselgrove, Henry L.
dc.creatorNielsen, Michael A.
dc.date2003-07-25
dc.date.accessioned2026-07-07T06:07:27Z
dc.date.available2026-07-07T06:07:27Z
dc.descriptionWe 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. We also note that a related lower bound holds for arbitrary n-qubit gates.
dc.description6 pages
dc.identifierhttps://arxiv.org/abs/quant-ph/0307190
dc.identifierhttp://arxiv.org/abs/quant-ph/0307190
dc.identifierPhys. Rev. A 68, 052311 (2003)
dc.identifierdoi:10.1103/PhysRevA.68.052311
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/91296
dc.subjectQuantum Physics
dc.titleLower bounds on the complexity of simulating quantum gates
dc.typetext

Files

Collections

arXiv