{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T01:21:14Z","timestamp":1773796874844,"version":"3.50.1"},"reference-count":27,"publisher":"Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften","license":[{"start":{"date-parts":[[2024,12,18]],"date-time":"2024-12-18T00:00:00Z","timestamp":1734480000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["quantum-journal.org"],"crossmark-restriction":false},"short-container-title":["Quantum"],"abstract":"We introduce Port-Based State Preparation (PBSP), a teleportation task where Alice holds a complete classical description of the target state and Bob&apos;s correction operations are restricted to only tracing out registers. We show a protocol that implements PBSP with error decreasing exponentially in the number of ports, in contrast to the polynomial trade-off for the related task of Port-Based Teleportation, and we prove that this is optimal when a maximally entangled resource state is used.\nAs an application, we introduce approximate Universal Programmable Hybrid Processors (UPHP). Here the goal is to encode a unitary as a quantum state, and the UPHP can apply this unitary to a quantum state when knowing its classical description. We give a construction that needs strictly less memory in terms of dimension than the optimal approximate Universal Programmable Quantum Processor achieving the same error. Additionally, we provide lower bounds for the optimal trade-off between memory and error of UPHPs.<\/jats:p>","DOI":"10.22331\/q-2024-12-18-1573","type":"journal-article","created":{"date-parts":[[2024,12,18]],"date-time":"2024-12-18T15:51:15Z","timestamp":1734537075000},"page":"1573","update-policy":"https:\/\/doi.org\/10.22331\/q-crossmark-policy-page","source":"Crossref","is-referenced-by-count":1,"title":["Port-Based State Preparation and Applications"],"prefix":"10.22331","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-4627-9520","authenticated-orcid":false,"given":"Garazi","family":"Muguruza","sequence":"first","affiliation":[{"name":"QuSoft & Informatics Institute, University of Amsterdam, Netherlands"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3792-9908","authenticated-orcid":false,"given":"Florian","family":"Speelman","sequence":"additional","affiliation":[{"name":"QuSoft & Informatics Institute, University of Amsterdam, Netherlands"}]}],"member":"9598","published-online":{"date-parts":[[2024,12,18]]},"reference":[{"key":"0","doi-asserted-by":"publisher","unstructured":"Charles H. Bennett, Gilles Brassard, Claude Cr\u00e9peau, Richard Jozsa, Asher Peres, and William K. Wootters, ``Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels'' Physical Review Letters 70, 1895-1899 (1993).","DOI":"10.1103\/PhysRevLett.70.1895"},{"key":"1","doi-asserted-by":"publisher","unstructured":"M. A. Nielsenand Isaac L. Chuang ``Programmable Quantum Gate Arrays'' Physical Review Letters 79, 321\u2013324 (1997).","DOI":"10.1103\/PhysRevLett.79.321"},{"key":"2","doi-asserted-by":"publisher","unstructured":"Andris Ambainis, Ashwin Nayak, Ammon Ta-Shma, and Umesh Vazirani, ``Dense quantum coding and a lower bound for 1-way quantum automata'' Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing 376\u2013383 (1999).","DOI":"10.1145\/301250.301347"},{"key":"3","doi-asserted-by":"publisher","unstructured":"Micha\u0142 Horodecki, Pawe\u0142 Horodecki, and Ryszard Horodecki, ``General teleportation channel, singlet fraction, and quasidistillation'' Physical Review A 60, 1888\u20131898 (1999).","DOI":"10.1103\/PhysRevA.60.1888"},{"key":"4","doi-asserted-by":"publisher","unstructured":"A. Nayak ``Optimal lower bounds for quantum automata and random access codes'' 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) 369\u2013376 (1999).","DOI":"10.1109\/SFFCS.1999.814608"},{"key":"5","doi-asserted-by":"publisher","unstructured":"Charles H. Bennett, David P. DiVincenzo, Peter W. Shor, John A. Smolin, Barbara M. Terhal, and William K. Wootters, ``Remote State Preparation'' Physical Review Letters 87, 077902 (2001).","DOI":"10.1103\/PhysRevLett.87.077902"},{"key":"6","doi-asserted-by":"publisher","unstructured":"Charles H. Bennett, Patrick Hayden, Debbie W. Leung, Peter W. Shor, and Andreas Winter, ``Remote preparation of quantum states'' IEEE Transactions on Information Theory 51, 56\u201374 (2005).","DOI":"10.1109\/TIT.2004.839476"},{"key":"7","doi-asserted-by":"publisher","unstructured":"Mark Hillery, M\u00e1rio Ziman, and Vladim\u00edr Bu\u017eek, ``Approximate programmable quantum processors'' Physical Review A 73, 022345 (2006).","DOI":"10.1103\/PhysRevA.73.022345"},{"key":"8","doi-asserted-by":"publisher","unstructured":"David P\u00e9rez-Garc\u00eda ``Optimality of programmable quantum measurements'' Physical Review A 73, 052315 (2006).","DOI":"10.1103\/PhysRevA.73.052315"},{"key":"9","doi-asserted-by":"publisher","unstructured":"Satoshi Ishizakaand Tohya Hiroshima ``Asymptotic teleportation scheme as a universal programmable quantum processor'' Physical Review Letters 101, 240501 (2008).","DOI":"10.1103\/PhysRevLett.101.240501"},{"key":"10","doi-asserted-by":"publisher","unstructured":"Salman Beigiand Robert K\u00f6nig ``Simplified instantaneous non-local quantum computation with applications to position-based cryptography'' New Journal of Physics 13, 093036 (2011).","DOI":"10.1088\/1367-2630\/13\/9\/093036"},{"key":"11","doi-asserted-by":"publisher","unstructured":"Dami\u00e1n Pital\u00faa-Garc\u00eda ``Deduction of an upper bound on the success probability of port-based teleportation from the no-cloning theorem and the no-signaling principle'' Physical Review A 87, 040303 (2013).","DOI":"10.1103\/PhysRevA.87.040303"},{"key":"12","unstructured":"Satoshi Ishizaka ``Some remarks on port-based teleportation'' Preprint (2015)."},{"key":"13","doi-asserted-by":"publisher","unstructured":"Harry Buhrman, \u0141ukasz Czekaj, Andrzej Grudka, Micha\u0142 Horodecki, Pawe\u0142 Horodecki, Marcin Markiewicz, Florian Speelman, and Sergii Strelchuk, ``Quantum communication complexity advantage implies violation of a Bell inequality'' Proceedings of the National Academy of Sciences 113, 3191\u20133196 (2016).","DOI":"10.1073\/pnas.1507647113"},{"key":"14","doi-asserted-by":"publisher","unstructured":"Micha\u0142 Studzi\u0144ski, Sergii Strelchuk, Marek Mozrzymas, and Micha\u0142 Horodecki, ``Port-based teleportation in arbitrary dimension'' Scientific Reports 7, 10871 (2017).","DOI":"10.1038\/s41598-017-10051-4"},{"key":"15","unstructured":"Christian Majenz ``Entropy in Quantum Information Theory \u2013 Communication and Cryptography'' Ph.D. thesis, Faculty of Science, University of Copenhagen (2018)."},{"key":"16","doi-asserted-by":"publisher","unstructured":"Marek Mozrzymas, Micha\u0142 Studzi\u0144ski, Sergii Strelchuk, and Micha\u0142 Horodecki, ``Optimal port-based teleportation'' New Journal of Physics 20, 053006 (2018).","DOI":"10.1088\/1367-2630\/aab8e7"},{"key":"17","doi-asserted-by":"publisher","unstructured":"Aleksander M Kubicki, Carlos Palazuelos, and David P\u00e9rez-Garc\u00eda, ``Resource quantification for the no-programing theorem'' Physical Review Letters 122, 080505 (2019).","DOI":"10.1103\/PhysRevLett.122.080505"},{"key":"18","doi-asserted-by":"publisher","unstructured":"Stefano Pirandola, Riccardo Laurenza, Cosmo Lupo, and Jason L. Pereira, ``Fundamental limits to quantum channel discrimination'' npj Quantum Information 5 (2019).","DOI":"10.1038\/s41534-019-0162-y"},{"key":"19","doi-asserted-by":"publisher","unstructured":"Marco T\u00falio Quintino, Qingxiuxiong Dong, Atsushi Shimbo, Akihito Soeda, and Mio Murao, ``Probabilistic exact universal quantum circuits for transforming unitary operations'' Physical Review A 100, 062339 (2019).","DOI":"10.1103\/PhysRevA.100.062339"},{"key":"20","doi-asserted-by":"publisher","unstructured":"Marco T\u00falio Quintino, Qingxiuxiong Dong, Atsushi Shimbo, Akihito Soeda, and Mio Murao, ``Reversing Unknown Quantum Transformations: Universal Quantum Circuit for Inverting General Unitary Operations'' Physical Review Letters 123, 210502 (2019).","DOI":"10.1103\/PhysRevLett.123.210502"},{"key":"21","doi-asserted-by":"publisher","unstructured":"Michal Sedl\u00e1k, Alessandro Bisio, and M\u00e1rio Ziman, ``Optimal Probabilistic Storage and Retrieval of Unitary Channels'' Physical Review Letters 122, 170502 (2019).","DOI":"10.1103\/PhysRevLett.122.170502"},{"key":"22","doi-asserted-by":"publisher","unstructured":"Yuxiang Yang, Renato Renner, and Giulio Chiribella, ``Optimal Universal Programming of Unitary Gates'' Physical Review Letters 125, 210501 (2020).","DOI":"10.1103\/PhysRevLett.125.210501"},{"key":"23","doi-asserted-by":"publisher","unstructured":"Matthias Christandl, Felix Leditzky, Christian Majenz, Graeme Smith, Florian Speelman, and Michael Walter, ``Asymptotic Performance of Port-Based Teleportation'' Communications in Mathematical Physics 381, 379\u2013451 (2021).","DOI":"10.1007\/s00220-020-03884-0"},{"key":"24","doi-asserted-by":"publisher","unstructured":"Felix Leditzky ``Optimality of the pretty good measurement for port-based teleportation'' Letters in Mathematical Physics 112, 98 (2022).","DOI":"10.1007\/s11005-022-01592-5"},{"key":"25","unstructured":"Jiani Fei, Sydney Timmerman, and Patrick Hayden, ``Efficient Quantum Algorithm for Port-based Teleportation'' (2023)."},{"key":"26","unstructured":"Dmitry Grinko, Adam Burchardt, and Maris Ozols, ``Efficient quantum circuits for port-based teleportation'' Preprint (2023)."}],"container-title":["Quantum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/quantum-journal.org\/papers\/q-2024-12-18-1573\/pdf\/","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,18]],"date-time":"2024-12-18T15:51:45Z","timestamp":1734537105000},"score":1,"resource":{"primary":{"URL":"https:\/\/quantum-journal.org\/papers\/q-2024-12-18-1573\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,18]]},"references-count":27,"URL":"https:\/\/doi.org\/10.22331\/q-2024-12-18-1573","archive":["CLOCKSS"],"relation":{},"ISSN":["2521-327X"],"issn-type":[{"value":"2521-327X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,18]]},"article-number":"1573"}}