File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Optimal Universal Programming of Unitary Gates

TitleOptimal Universal Programming of Unitary Gates
Authors
Issue Date2020
Citation
Physical Review Letters, 2020, v. 125, n. 21, article no. 210501 How to Cite?
AbstractA universal quantum processor is a device that takes as input a (quantum) program, containing an encoding of an arbitrary unitary gate, and a (quantum) data register, on which the encoded gate is applied. While no perfect universal quantum processor can exist, approximate processors have been proposed in the past two decades. A fundamental open question is how the size of the smallest quantum program scales with the approximation error. Here we answer the question, by proving a bound on the size of the program and designing a concrete protocol that attains the bound in the asymptotic limit. Our result is based on a connection between optimal programming and the Heisenberg limit of quantum metrology, and establishes an asymptotic equivalence between the tasks of programming, learning, and estimating unitary gates.
Persistent Identifierhttp://hdl.handle.net/10722/303716
ISSN
2023 Impact Factor: 8.1
2023 SCImago Journal Rankings: 3.040
ISI Accession Number ID
Grants

 

DC FieldValueLanguage
dc.contributor.authorYang, Yuxiang-
dc.contributor.authorRenner, Renato-
dc.contributor.authorChiribella, Giulio-
dc.date.accessioned2021-09-15T08:25:52Z-
dc.date.available2021-09-15T08:25:52Z-
dc.date.issued2020-
dc.identifier.citationPhysical Review Letters, 2020, v. 125, n. 21, article no. 210501-
dc.identifier.issn0031-9007-
dc.identifier.urihttp://hdl.handle.net/10722/303716-
dc.description.abstractA universal quantum processor is a device that takes as input a (quantum) program, containing an encoding of an arbitrary unitary gate, and a (quantum) data register, on which the encoded gate is applied. While no perfect universal quantum processor can exist, approximate processors have been proposed in the past two decades. A fundamental open question is how the size of the smallest quantum program scales with the approximation error. Here we answer the question, by proving a bound on the size of the program and designing a concrete protocol that attains the bound in the asymptotic limit. Our result is based on a connection between optimal programming and the Heisenberg limit of quantum metrology, and establishes an asymptotic equivalence between the tasks of programming, learning, and estimating unitary gates.-
dc.languageeng-
dc.relation.ispartofPhysical Review Letters-
dc.titleOptimal Universal Programming of Unitary Gates-
dc.typeArticle-
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1103/PhysRevLett.125.210501-
dc.identifier.pmid33274974-
dc.identifier.scopuseid_2-s2.0-85097186389-
dc.identifier.hkuros330860-
dc.identifier.volume125-
dc.identifier.issue21-
dc.identifier.spagearticle no. 210501-
dc.identifier.epagearticle no. 210501-
dc.identifier.eissn1079-7114-
dc.identifier.isiWOS:000589610300002-
dc.relation.projectCompressed Quantum Dynamics: Storing, Programming, and Simulating Physical Processes with Minimum-Sized Quantum Systems-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats