Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Marek Mozrzymas

dblp:296/5388 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
0000-0003-1905-7595ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Quantum computing and quantum information · 94% Combinatorics and discrete mathematics · 6%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Quantum computing and quantum information › quantum communication
quantum teleportation
1.622026
Entanglement Recycling in Two-Step Port-Based Teleportation · IEEE Trans. Inf. Theory 2026
Efficient Multi Port-Based Teleportation Schemes · IEEE Trans. Inf. Theory 2022
Quantum computing and quantum information
quantum entanglement
1.222026
Entanglement Recycling in Two-Step Port-Based Teleportation · IEEE Trans. Inf. Theory 2026
Efficient Multi Port-Based Teleportation Schemes · IEEE Trans. Inf. Theory 2022
Combinatorics and discrete mathematics
group theory
0.212022
Efficient Multi Port-Based Teleportation Schemes · IEEE Trans. Inf. Theory 2022

Methods — techniques the papers use, named apart from their topics

two-step port-based teleportation · 1.0walled brauer algebra · 0.6irreducible representations · 0.6group-theoretic analysis · 0.6
YearPublicationVenuePosition
2026 Entanglement Recycling in Two-Step Port-Based Teleportation
Piotr Kopszak, Dmitry Grinko, Adam Burchardt, Maris Ozols, Michal Studzinski, Marek Mozrzymas
IEEE Trans. Inf. Theory6
2022 Efficient Multi Port-Based Teleportation Schemes
abstract
In this manuscript we analyse generalised port-based teleportation (PBT) schemes, allowing for transmitting more than one unknown quantum state (or a composite quantum state) in one go, where the state ends up in several ports at Bob’s side. We investigate the efficiency of our scheme discussing both deterministic and probabilistic case, where parties share maximally entangled states. It turns out that the new scheme gives better performance than various variants of the optimal PBT protocol used for the same task. All the results are presented in group-theoretic manner depending on such quantities like dimensions and multiplicities of irreducible representations in the Schur-Weyl duality. The presented analysis was possible by considering the algebra of permutation operators acting on$n$systems distorted by the action of partial transposition acting on more than one subsystem. Considering its action on the$n-$fold tensor product of the Hilbert space with finite dimension, we present construction of the respective irreducible matrix representations, which are in fact matrix irreducible representations of the Walled Brauer Algebra. I turns out that the introduced formalism, and symmetries beneath it, appears in many aspects of theoretical physics and mathematics - theory of anti ferromagnetism, aspects of gravity theory or in the problem of designing quantum circuits for special task like for example inverting an unknown unitary.
Michal Studzinski, Marek Mozrzymas, Piotr Kopszak, Michal Horodecki
IEEE Trans. Inf. Theory2