Stephan Weis
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Stephan Weis has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Karol Życzkowski
Jagiellonian University
3 shared publications - Maksim E. Shirokov
Steklov Mathematical Institute of Russian Academy of Sciences, Moscow, Russia
3 shared publications Andreas Knauf
Department of Mathematics, Friedrich-Alexander-University, Erlangen-Nuremberg Cauerstr. 11, D-91058 Erlangen, Germany
2 shared publicationsAtul Singh Arora
CQST IIIT Hyderabad Telangana India
2 shared publications- Daniel Plaumann
Technische Universität Dortmund
2 shared publications Ilya M. Spitkovsky
College of William and Mary 1 Department of Mathematics P.O. Box 8795, Williamsburg, Virginia 23187-8795, USA
2 shared publications
Latest Publications
- 20 May 2026
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 746, 165-204
Joint numerical ranges of three hermitian 4 × 4 matrices
- 20 May 2026
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 746, 165-204
Joint numerical ranges of three hermitian 4 × 4 matrices
- Open Access
- 26 November 2025
- Published by Centre pour la Communication Scientifique Directe (CCSD) in TheoretiCS
- Vol. ume 4
Protocols for Quantum Weak Coin Flipping
Weak coin flipping is an important cryptographic primitive$\unicode{x2013}$it is the strongest known secure two-party computation primitive that classically becomes secure only under certain assumptions (e.g. computational hardness), while quantumly there exist protocols that achieve arbitrarily close to perfect security. This breakthrough result was established by Mochon in 2007 [arXiv:0711.4114]. However, his proof relied on the existence of certain unitary operators which was established by a non-constructive argument. Consequently, explicit protocols have remained elusive. In this work, we give exact constructions of related unitary operators. These, together with a new formalism, yield a family of protocols approaching perfect security thereby also simplifying Mochon's proof of existence. We illustrate the construction of explicit weak coin flipping protocols by considering concrete examples (from the aforementioned family of protocols) that are more secure than all previously known protocols. 76 pages. This is the TheoretiCS journal version
- 26 November 2025
- Published by Centre pour la Communication Scientifique Directe (CCSD) in TheoretiCS
- Vol. ume 4
Open AccessProtocols for Quantum Weak Coin Flipping
Weak coin flipping is an important cryptographic primitive$\unicode{x2013}$it is the strongest known secure two-party computation primitive that classically becomes secure only under certain assumptions (e.g. computational hardness), while quantumly there exist protocols that achieve arbitrarily close to perfect security. This breakthrough result was established by Mochon in 2007 [arXiv:0711.4114]. However, his proof relied on the existence of certain unitary operators which was established by a non-constructive argument. Consequently, explicit protocols have remained elusive. In this work, we give exact constructions of related unitary operators. These, together with a new formalism, yield a family of protocols approaching perfect security thereby also simplifying Mochon's proof of existence. We illustrate the construction of explicit weak coin flipping protocols by considering concrete examples (from the aforementioned family of protocols) that are more secure than all previously known protocols. 76 pages. This is the TheoretiCS journal version
- Open Access
- 1 June 2025
- Published by Springer Nature in Advances in Operator Theory
- Vol. 10 (3) , 1-31
Matrix systems, algebras, and open maps
Every state on the algebra $$\textrm{M}_n$$ of complex $$n\times n$$ matrices restricts to a state on any matrix system. Whereas the restriction to a matrix system is generally not open, we prove that the restriction to every *-subalgebra of $$\textrm{M}_n$$ is open. This simplifies topology problems in matrix theory and quantum information theory.- 1 June 2025
- Published by Springer Nature in Advances in Operator Theory
- Vol. 10 (3) , 1-31
Open AccessMatrix systems, algebras, and open maps
Every state on the algebra $$\textrm{M}_n$$ of complex $$n\times n$$ matrices restricts to a state on any matrix system. Whereas the restriction to a matrix system is generally not open, we prove that the restriction to every *-subalgebra of $$\textrm{M}_n$$ is open. This simplifies topology problems in matrix theory and quantum information theory. - Open Access
- 1 January 2025
- Published by Banach Press LLC in Journal of Convex Analysis
- Vol. 32 (3) , 901-919
A Note on Faces of Convex Sets
The faces of a convex set owe their relevance to an interplay between convexity and topology that is systematically studied in the work of Rockafellar. Infinite-dimensional convex sets are excluded from this theory as their relative interiors may be empty. Shirokov and the present author answered this issue by proving that every point in a convex set lies in the relative algebraic interior of the face it generates. This theorem is proved here in a simpler way, connecting ideas scattered throughout the literature. This article summarizes and develops methods for faces and their relative algebraic interiors and applies them to spaces of probability measures.
- 1 January 2025
- Published by Banach Press LLC in Journal of Convex Analysis
- Vol. 32 (3) , 901-919
Open AccessA Note on Faces of Convex Sets
The faces of a convex set owe their relevance to an interplay between convexity and topology that is systematically studied in the work of Rockafellar. Infinite-dimensional convex sets are excluded from this theory as their relative interiors may be empty. Shirokov and the present author answered this issue by proving that every point in a convex set lies in the relative algebraic interior of the face it generates. This theorem is proved here in a simpler way, connecting ideas scattered throughout the literature. This article summarizes and develops methods for faces and their relative algebraic interiors and applies them to spaces of probability measures.
- 3 April 2024
- Published by Springer Nature
- p. 385-396
Kippenhahn’s Construction Revisited
- Open Access
Kippenhahn's construction revisited
Kippenhahn discovered that the numerical range of a complex square matrix is the convex hull of a plane real algebraic curve. Here, we present an example of a convex set, which has a similar algebraic description as the numerical range, whereas the analogue of Kippenhahn's construction fails regarding isolated, singular points of the curve. This example prompted us to carefully review Kippenhahn's assertion and to highlight aspects of a complete proof that was achieved with methods of convex geometry and real algebraic geometry.
Open AccessKippenhahn's construction revisited
Kippenhahn discovered that the numerical range of a complex square matrix is the convex hull of a plane real algebraic curve. Here, we present an example of a convex set, which has a similar algebraic description as the numerical range, whereas the analogue of Kippenhahn's construction fails regarding isolated, singular points of the curve. This example prompted us to carefully review Kippenhahn's assertion and to highlight aspects of a complete proof that was achieved with methods of convex geometry and real algebraic geometry.
- 9 March 2023
- Published by Springer Nature in Information Geometry
- Vol. 6 (1) , 293-326
The face lattice of the set of reduced density matrices and its coatoms
- 9 March 2023
- Published by Springer Nature in Information Geometry
- Vol. 6 (1) , 293-326
The face lattice of the set of reduced density matrices and its coatoms
- Open Access
Decomposition of symmetric separable states and ground state energy of bosonic systems
We prove that every symmetric separable state admits a convex decomposition into symmetric pure product states. While the result is not new in itself, here we focus on convex geometry. We discuss the decomposition in the context of numerical ranges and ground state problems of infinite bosonic systems.
Open AccessDecomposition of symmetric separable states and ground state energy of bosonic systems
We prove that every symmetric separable state admits a convex decomposition into symmetric pure product states. While the result is not new in itself, here we focus on convex geometry. We discuss the decomposition in the context of numerical ranges and ground state problems of infinite bosonic systems.
- Open Access
- 1 January 2021
- Published by Banach Press LLC in Journal of Convex Analysis
- Vol. 28 (3) , 847-870
The Face Generated by a Point, Generalized Affine Constraints, and Quantum Theory
We analyze faces generated by points in an arbitrary convex set and their relative algebraic interiors, which are nonempty as we shall prove. We show that by intersecting a convex set with a sublevel or level set of a generalized affine functional, the dimension of the face generated by a point may decrease by at most one. We apply the results to the set of quantum states on a separable Hilbert space. Among others, we show that every state having finite expected values of any two (not necessarily bounded) positive operators admits a decomposition into pure states with the same expected values. We discuss applications in quantum information theory.
- 1 January 2021
- Published by Banach Press LLC in Journal of Convex Analysis
- Vol. 28 (3) , 847-870
Open AccessThe Face Generated by a Point, Generalized Affine Constraints, and Quantum Theory
We analyze faces generated by points in an arbitrary convex set and their relative algebraic interiors, which are nonempty as we shall prove. We show that by intersecting a convex set with a sublevel or level set of a generalized affine functional, the dimension of the face generated by a point may decrease by at most one. We apply the results to the set of quantum states on a separable Hilbert space. Among others, we show that every state having finite expected values of any two (not necessarily bounded) positive operators admits a decomposition into pure states with the same expected values. We discuss applications in quantum information theory.
- 1 January 2021
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Algebra and Geometry
- Vol. 5 (1) , 86-113
Kippenhahn's Theorem for Joint Numerical Ranges and Quantum States
Kippenhahn's theorem asserts that the numerical range of a matrix is the convex hull of a certain algebraic curve. Here, we show that the joint numerical range of finitely many Hermitian matrices i...
- 1 January 2021
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Algebra and Geometry
- Vol. 5 (1) , 86-113
Kippenhahn's Theorem for Joint Numerical Ranges and Quantum States
Kippenhahn's theorem asserts that the numerical range of a matrix is the convex hull of a certain algebraic curve. Here, we show that the joint numerical range of finitely many Hermitian matrices i...