Sergii Strelchuk

Orcid: 0000-0001-8390-3034

According to our database1, Sergii Strelchuk authored at least 20 papers between 2015 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Symmetric Quantum Computation.
Proceedings of the 17th Innovations in Theoretical Computer Science Conference, 2026

2025
Simultaneous Superadditivity of the Direct and Complementary Channel Capacities.
IEEE Trans. Inf. Theory, November, 2025

A finite sufficient set of conditions for catalytic majorization.
CoRR, February, 2025

Quantum Catalytic Space.
Proceedings of the 20th Conference on the Theory of Quantum Computation, 2025

Optimal Fermion-Qubit Mappings via Quadratic Assignment.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2025

2024
DQC1-hardness of estimating correlation functions.
CoRR, 2024

Quantum Circuit Complexity of Genomic Data Encoding.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2024

Quantum Algorithms for Genome Sequencing and Analysis.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2024

Learning Gaussian Operations and the Matchgate Hierarchy.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2024

Provable Advantage in Quantum PAC Learning.
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

2023
Discovering optimal fermion-qubit mappings through algorithmic enumeration.
Quantum, October, 2023

Only Classical Parameterised States have Optimal Measurements under Least Squares Loss.
Quantum, May, 2023

Noise is resource-contextual in quantum communication.
CoRR, 2023

2022
On the Super-exponential Quantum Speedup of Equivariant Quantum Machine Learning Algorithms with SU(d) Symmetry.
CoRR, 2022

2021
Speeding up Learning Quantum States through Group Equivariant Convolutional Quantum Ans{ä}tze.
CoRR, 2021

2017
Quantum conditional query complexity.
Quantum Inf. Comput., 2017

2016
Forgetting boosts the classical environment-assisted and private capacity.
CoRR, 2016

2015
Jordan-Wigner formalism for arbitrary 2-input 2-output matchgates and their classical simulation.
Quantum Inf. Comput., 2015

Superadditivity of private information for any number of uses of the channel.
CoRR, 2015

Quantum Capacity Can Be Greater Than Private Information for Arbitrarily Many Uses.
Proceedings of the 10th Conference on the Theory of Quantum Computation, 2015


  Loading...