File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Universal superreplication of unitary gates

TitleUniversal superreplication of unitary gates
Authors
Issue Date2015
Citation
Physical Review Letters, 2015, v. 114, n. 12 How to Cite?
Abstract© 2015 American Physical Society. Quantum states obey an asymptotic no-cloning theorem, stating that no deterministic machine can reliably replicate generic sequences of identically prepared pure states. In stark contrast, we show that generic sequences of unitary gates can be replicated deterministically at nearly quadratic rates, with an error vanishing on most inputs except for an exponentially small fraction. The result is not in contradiction with the no-cloning theorem, since the impossibility of deterministically transforming pure states into unitary gates prevents the application of the gate replication protocol to states. In addition to gate replication, we show that N parallel uses of a completely unknown unitary gate can be compressed into a single gate acting on O(log2N) qubits, leading to an exponential reduction of the amount of quantum communication needed to implement the gate remotely.
Persistent Identifierhttp://hdl.handle.net/10722/213454
ISSN
2015 Impact Factor: 7.645
2015 SCImago Journal Rankings: 3.731
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorChiribella, G.-
dc.contributor.authorYang, Y.-
dc.contributor.authorHuang, C.-
dc.date.accessioned2015-07-28T04:07:20Z-
dc.date.available2015-07-28T04:07:20Z-
dc.date.issued2015-
dc.identifier.citationPhysical Review Letters, 2015, v. 114, n. 12-
dc.identifier.issn0031-9007-
dc.identifier.urihttp://hdl.handle.net/10722/213454-
dc.description.abstract© 2015 American Physical Society. Quantum states obey an asymptotic no-cloning theorem, stating that no deterministic machine can reliably replicate generic sequences of identically prepared pure states. In stark contrast, we show that generic sequences of unitary gates can be replicated deterministically at nearly quadratic rates, with an error vanishing on most inputs except for an exponentially small fraction. The result is not in contradiction with the no-cloning theorem, since the impossibility of deterministically transforming pure states into unitary gates prevents the application of the gate replication protocol to states. In addition to gate replication, we show that N parallel uses of a completely unknown unitary gate can be compressed into a single gate acting on O(log2N) qubits, leading to an exponential reduction of the amount of quantum communication needed to implement the gate remotely.-
dc.languageeng-
dc.relation.ispartofPhysical Review Letters-
dc.titleUniversal superreplication of unitary gates-
dc.typeArticle-
dc.description.natureLink_to_subscribed_fulltext-
dc.identifier.doi10.1103/PhysRevLett.114.120504-
dc.identifier.scopuseid_2-s2.0-84925851205-
dc.identifier.volume114-
dc.identifier.issue12-
dc.identifier.eissn1079-7114-
dc.identifier.isiWOS:000351877200003-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats