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

Alexander Streltsov

dblp:383/1043 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
0000-0002-7742-5731ORCID · reported

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

Theory of computation · 1 · 1 first-author · 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.

Theoretical computer science
1 paper
Quantum computing and quantum information · 100%

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

TopicWeightPapersLastEvidence papers
Quantum computing and quantum information › quantum entanglement
multipartite entanglement
0.912025
Multipartite Entanglement Theory With Entanglement-Nonincreasing Operations · IEEE Trans. Inf. Theory 2025
Quantum computing and quantum information
quantum entanglement
0.912025
Multipartite Entanglement Theory With Entanglement-Nonincreasing Operations · IEEE Trans. Inf. Theory 2025
Quantum computing and quantum information › quantum entanglement
entanglement theory
0.312025
Multipartite Entanglement Theory With Entanglement-Nonincreasing Operations · IEEE Trans. Inf. Theory 2025
Quantum computing and quantum information
resource theory
0.312025
Multipartite Entanglement Theory With Entanglement-Nonincreasing Operations · IEEE Trans. Inf. Theory 2025

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

resource theory · 0.9entanglement entropy · 0.9bipartite reduction · 0.9
YearPublicationVenuePosition
2025 Multipartite Entanglement Theory With Entanglement-Nonincreasing Operations
abstract
A key problem in quantum information science is to determine optimal protocols for the interconversion of entangled states shared between remote parties. While for two parties a large number of results in this direction is available, the multipartite setting still remains a major challenge. In this article, this problem is addressed by extending the resource theory of entanglement for multipartite systems beyond the standard framework of local operations and classical communication. Specifically, we consider transformations capable of introducing a small, controllable increase of entanglement of a state, with the requirement that the increase can be made arbitrarily small. We demonstrate that in this adjusted framework, the transformation rates between multipartite states are fundamentally dictated by the bipartite entanglement entropies of the respective quantum states. Remarkably, this approach allows the reduction of tripartite entanglement to its bipartite analog, indicating that every pure tripartite state can be reversibly synthesized from a suitable number of singlets distributed between pairs of parties.
Alexander Streltsov
IEEE Trans. Inf. Theory1