Port-Based State Preparation and Applications

Garazi Muguruza; Florian Speelman

doi:10.22331/q-2024-12-18-1573

Port-Based State Preparation and Applications

QuSoft & Informatics Institute, University of Amsterdam, Netherlands

Published:	2024-12-18, volume 8, page 1573
Eprint:	arXiv:2402.18356v2
Doi:	https://doi.org/10.22331/q-2024-12-18-1573
Citation:	Quantum 8, 1573 (2024).

Find this paper interesting or want to discuss? Scite or leave a comment on SciRate.

Abstract

We introduce Port-Based State Preparation (PBSP), a teleportation task where Alice holds a complete classical description of the target state and Bob'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.
As 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.

Featured image: Diagram for the Port-Based State Preparation protocol.

► BibTeX data

@article{Muguruza2024portbasedstate,
  doi = {10.22331/q-2024-12-18-1573},
  url = {https://doi.org/10.22331/q-2024-12-18-1573},
  title = {Port-{B}ased {S}tate {P}reparation and {A}pplications},
  author = {Muguruza, Garazi and Speelman, Florian},
  journal = {{Quantum}},
  issn = {2521-327X},
  publisher = {{Verein zur F{\"{o}}rderung des Open Access Publizierens in den Quantenwissenschaften}},
  volume = {8},
  pages = {1573},
  month = dec,
  year = {2024}
}

► References

[1] Charles H. Bennett, Gilles Brassard, Claude Crépeau, 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).
https://doi.org/10.1103/PhysRevLett.70.1895

[2] M. A. Nielsenand Isaac L. Chuang ``Programmable Quantum Gate Arrays'' Physical Review Letters 79, 321–324 (1997).
https://doi.org/10.1103/PhysRevLett.79.321
arXiv:9703032

[3] 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–383 (1999).
https://doi.org/10.1145/301250.301347
arXiv:9804043

[4] Michał Horodecki, Paweł Horodecki, and Ryszard Horodecki, ``General teleportation channel, singlet fraction, and quasidistillation'' Physical Review A 60, 1888–1898 (1999).
https://doi.org/10.1103/PhysRevA.60.1888

[5] A. Nayak ``Optimal lower bounds for quantum automata and random access codes'' 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) 369–376 (1999).
https://doi.org/10.1109/SFFCS.1999.814608
arXiv:9904093

[6] 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).
https://doi.org/10.1103/PhysRevLett.87.077902
arXiv:0006044

[7] 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–74 (2005).
https://doi.org/10.1109/TIT.2004.839476
arXiv:0307100

[8] Mark Hillery, Mário Ziman, and Vladimír Bužek, ``Approximate programmable quantum processors'' Physical Review A 73, 022345 (2006).
https://doi.org/10.1103/PhysRevA.73.022345
arXiv:0510161

[9] David Pérez-García ``Optimality of programmable quantum measurements'' Physical Review A 73, 052315 (2006).
https://doi.org/10.1103/PhysRevA.73.052315
arXiv:0602084

[10] Satoshi Ishizakaand Tohya Hiroshima ``Asymptotic teleportation scheme as a universal programmable quantum processor'' Physical Review Letters 101, 240501 (2008).
https://doi.org/10.1103/PhysRevLett.101.240501
arXiv:0807.4568

[11] Salman Beigiand Robert König ``Simplified instantaneous non-local quantum computation with applications to position-based cryptography'' New Journal of Physics 13, 093036 (2011).
https://doi.org/10.1088/1367-2630/13/9/093036
arXiv:1101.1065

[12] Damián Pitalúa-García ``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).
https://doi.org/10.1103/PhysRevA.87.040303
arXiv:1206.4836

[13] Satoshi Ishizaka ``Some remarks on port-based teleportation'' Preprint (2015).
arXiv:1506.01555

[14] Harry Buhrman, Łukasz Czekaj, Andrzej Grudka, Michał Horodecki, Paweł 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–3196 (2016).
https://doi.org/10.1073/pnas.1507647113
arXiv:1502.01058

[15] Michał Studziński, Sergii Strelchuk, Marek Mozrzymas, and Michał Horodecki, ``Port-based teleportation in arbitrary dimension'' Scientific Reports 7, 10871 (2017).
https://doi.org/10.1038/s41598-017-10051-4
arXiv:1612.09260

[16] Christian Majenz ``Entropy in Quantum Information Theory – Communication and Cryptography'' Ph.D. thesis, Faculty of Science, University of Copenhagen (2018).
arXiv:1810.10436

[17] Marek Mozrzymas, Michał Studziński, Sergii Strelchuk, and Michał Horodecki, ``Optimal port-based teleportation'' New Journal of Physics 20, 053006 (2018).
https://doi.org/10.1088/1367-2630/aab8e7
arXiv:1707.08456

[18] Aleksander M Kubicki, Carlos Palazuelos, and David Pérez-García, ``Resource quantification for the no-programing theorem'' Physical Review Letters 122, 080505 (2019).
https://doi.org/10.1103/PhysRevLett.122.080505
arXiv:1805.00756

[19] Stefano Pirandola, Riccardo Laurenza, Cosmo Lupo, and Jason L. Pereira, ``Fundamental limits to quantum channel discrimination'' npj Quantum Information 5 (2019).
https://doi.org/10.1038/s41534-019-0162-y
arXiv:1803.02834

[20] Marco Túlio 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).
https://doi.org/10.1103/PhysRevA.100.062339
arXiv:1909.01366

[21] Marco Túlio 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).
https://doi.org/10.1103/PhysRevLett.123.210502
arXiv:1810.06944

[22] Michal Sedlák, Alessandro Bisio, and Mário Ziman, ``Optimal Probabilistic Storage and Retrieval of Unitary Channels'' Physical Review Letters 122, 170502 (2019).
https://doi.org/10.1103/PhysRevLett.122.170502
arXiv:1809.04552

[23] Yuxiang Yang, Renato Renner, and Giulio Chiribella, ``Optimal Universal Programming of Unitary Gates'' Physical Review Letters 125, 210501 (2020).
https://doi.org/10.1103/PhysRevLett.125.210501
arXiv:2007.10363

[24] 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–451 (2021).
https://doi.org/10.1007/s00220-020-03884-0
arXiv:1809.10751

[25] Felix Leditzky ``Optimality of the pretty good measurement for port-based teleportation'' Letters in Mathematical Physics 112, 98 (2022).
https://doi.org/10.1007/s11005-022-01592-5
arXiv:2008.11194

[26] Jiani Fei, Sydney Timmerman, and Patrick Hayden, ``Efficient Quantum Algorithm for Port-based Teleportation'' (2023).
arXiv:2310.01637

[27] Dmitry Grinko, Adam Burchardt, and Maris Ozols, ``Efficient quantum circuits for port-based teleportation'' Preprint (2023).
arXiv:2312.03188

Cited by

[1] Rajendra S Bhati, Michał Studziński, and Jarosław K Korbicz, "Port-based teleportation under pure-dephasing decoherence", Quantum Science and Technology 11 3, 035073 (2026).

[2] Entong He and Yuxiang Yang, "Resource quantification for programming low-depth quantum circuits", Quantum 10, 2166 (2026).

[3] Frédéric Grosshans, Michał Horodecki, Mio Murao, Tomasz Młynik, Marco Túlio Quintino, Michał Studziński, and Satoshi Yoshida, "Multicopy quantum state teleportation with application to storage and retrieval of quantum programs", Quantum 10, 2105 (2026).

[4] Chloe Kim, Eric Chitambar, and Felix Leditzky, "Asynchronous quantum computation through port-based teleportation", New Journal of Physics 28 3, 034512 (2026).

[5] Vanessa Brzić, Satoshi Yoshida, Mio Murao, and Marco Túlio Quintino, "Higher-order quantum computing with known input states", arXiv:2510.20530, (2025).

[6] Frédéric Grosshans, Michał Horodecki, Mio Murao, Tomasz Młynik, Marco Túlio Quintino, Michał Studziński, and Satoshi Yoshida, "Multicopy quantum state teleportation with application to storage and retrieval of quantum programs", arXiv:2409.10393, (2024).

[7] Chloe Kim, Eric Chitambar, and Felix Leditzky, "A resource theory of asynchronous quantum information processing", arXiv:2504.12945, (2025).

The above citations are from Crossref's cited-by service (last updated successfully 2026-08-12 06:40:13) and SAO/NASA ADS (last updated successfully 2026-08-11 16:30:44). The list may be incomplete as not all publishers provide suitable and complete citation data.

Could not fetch ADS cited-by data during last attempt 2026-08-12 06:40:13: Cannot retrieve data from ADS due to rate limitations.

This Paper is published in Quantum under the Creative Commons Attribution 4.0 International (CC BY 4.0) license. Copyright remains with the original copyright holders such as the authors or their institutions.