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

Marcin Jarzyna

dblp:263/4901 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2021
0000-0001-9989-1648ORCID · reported

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

Computer networks · 2 · 1 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.

Computer networks
2 papers
Physical-layer communications · 100%
Theoretical computer science
1 paper
Computational complexity · 50% Quantum computing and quantum information · 50%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › information theory › capacity analysis
channel capacity
0.512021
Capacity of a Lossy Photon Channel With Direct Detection · IEEE Trans. Commun. 2021
Physical-layer communications › optical communication
direct detection
0.512021
Capacity of a Lossy Photon Channel With Direct Detection · IEEE Trans. Commun. 2021
Physical-layer communications
modulation and detection
0.512021
Capacity of a Lossy Photon Channel With Direct Detection · IEEE Trans. Commun. 2021
Computational complexity › communication complexity › two-party communication
quantum communication complexity
0.412020
Quantum Fingerprinting Over AWGN Channels With Power-Limited Optical Signals · IEEE J. Sel. Areas Commun. 2020
Quantum computing and quantum information › quantum communication
quantum fingerprinting
0.412020
Quantum Fingerprinting Over AWGN Channels With Power-Limited Optical Signals · IEEE J. Sel. Areas Commun. 2020
Physical-layer communications
optical communication
0.112020
Quantum Fingerprinting Over AWGN Channels With Power-Limited Optical Signals · IEEE J. Sel. Areas Commun. 2020

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

numerical capacity computation · 0.5
YearPublicationVenuePosition
2021 Capacity of a Lossy Photon Channel With Direct Detection
abstract
We calculate numerically the capacity of a lossy photon channel assuming photon number resolving detection at the output. We consider scenarios of input Fock and coherent states ensembles and show that the latter always exhibits worse performance than the former. We obtain capacity of a discrete-time Poisson channel as a limiting behavior of the Fock states ensemble capacity. We show also that in the regime of a moderate number of photons and low losses the Fock states ensemble with direct detection is beneficial with respect to capacity limits achievable with quadrature detection.
Karol Lukanowski, Marcin Jarzyna
IEEE Trans. Commun.2
2020 Quantum Fingerprinting Over AWGN Channels With Power-Limited Optical Signals
abstract
Quantum fingerprinting reduces communication complexity of determination whether two n-bit long inputs are equal or different in the simultaneous message passing model. Here we quantify the advantage of quantum fingerprinting over classical protocols when communication is carried out using optical signals with limited power and unrestricted bandwidth propagating over additive white Gaussian noise (AWGN) channels with power spectral density (PSD) much less than one photon per unit time and unit bandwidth. We identify a noise parameter whose order of magnitude separates near-noiseless quantum fingerprinting, with signal duration effectively independent of n, from a regime where the impact of AWGN is significant. In the latter case the signal duration is found to scale as O(√n), analogously to classical fingerprinting. However, the dependence of the signal duration on the AWGN PSD is starkly distinct, leading to quantum advantage in the form of a reduced multiplicative factor in O(√n) scaling.
Michal Lipka, Marcin Jarzyna, Konrad Banaszek
IEEE J. Sel. Areas Commun.2