Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2411.11035 · Open Systems & Information Dynamics

On One-Parameter Families of Hermiticity-Preserving Superoperators which Are Not Positive

Grzegorz Pastuszak, Alicja Jaworska-Pastuszak, Takeo Kamizawa

Published Mar 1, 2025• 2 citations
arXivHTMLPDF

Abstract

A one-parameter family of hermiticity-preserving superoperators is a time-dependent family [Formula: see text] of hermiticity-preserving superoperators determined, in a certain sense, by real and complex polynomial functions in the variable [Formula: see text]. The paper studies sufficient computable criteria for nonpositivity of superoperators in one-parameter families. More precisely, we give sufficient conditions for the following assertions to hold: [Formula: see text] every [Formula: see text] is not positive, [Formula: see text] [Formula: see text] is not positive for [Formula: see text] in some [Formula: see text] and [Formula: see text] there is some [Formula: see text] which is not positive. We show that [Formula: see text] implies [Formula: see text]. Our approach to the problem is based on the Descartes rule of signs and the Sturm-Tarski theorem. In order to apply these facts, we introduce the sign variation formulas. These formulas are first order logical formulas in one variable [Formula: see text], generalising sign sequences of polynomials used in Descartes rule of signs.

DOI
10.1142/s1230161225500040

Related papers

On maps which preserve semipositivity and quantifier elimination theory for real numbers

Grzegorz Pastuszak, Adam Skowyrski, Andrzej Jamiołkowski

Assume that [Formula: see text] is a superoperator which preserves hermiticity. We give an algorithm determining whether [Formula: see text] preserves semipositivity (we call [Formula: see text] positive in this case). Our approach to the problem has a model-theoretic nature, namely, we apply techniques of quantifier elimination theory for real numbers. An approach based on these techniques seems to be the only one that allows to decide whether an arbitrary hermiticity-preserving [Formula: see text] is positive. Before we go to detailed analysis of the problem, we argue that quantifier elimination for real numbers (and also for complex numbers) can play a significant role in quantum information theory and other areas as well.

arXiv:2003.07772•Communications in Contemporary Mathematics•Nov 20, 2020•4 citations

ON EFFECTIVE METHODS OF INVESTIGATION OF NONPOSITIVE MAPS

Andrzej Jamiołkowski

The main aim of the paper is to give an effective procedure which allows us to distinguish between positive and nonpositive maps inside the set of all hermiticity preserving linear transformations. This procedure is important because we do not have any effective method of characterizing positive maps which are not completely positive. The fundamental role in our considerations is played by the well-known in literature matrix CJ. We analyze signs of eigenvalues of this matrix for a given superoperator Φ.

Infinite Dimensional Analysis Quantum Probability and Related Topics•Nov 1, 2023•0 citations

k-Positive Maps: New Characterizations and a Generation Method

Frederik vom Ende, Sumeet Khatri, Sergey Denisov

We study [Formula: see text]-positive linear maps on matrix algebras and address two problems, (i) characterizations of [Formula: see text]-positivity and (ii) generation of nondecomposable [Formula: see text]-positive maps. On the characterization side, we derive optimization-based conditions equivalent to [Formula: see text]-positivity that (a) reduce to a simple check when [Formula: see text], (b) reveal a direct link to the spectral norm of certain order-3 tensors (aligning with known NP-hardness barriers for [Formula: see text]), and (c) recast [Formula: see text]-positivity as a novel optimization problem over separable states, thereby connecting it explicitly to separability testing. On the generation side, we introduce a Lie-semigroup-based method that, starting from a single [Formula: see text]-positive map, produces one-parameter families that remain [Formula: see text]-positive and nondecomposable for small enough times. We illustrate this by generating such families for [Formula: see text] and [Formula: see text]. We also formulate a semidefinite program (SDP) to test an equivalent form of the positive partial transpose (PPT) square conjecture (and do not find any violation of the latter). Our results provide practical computational tools for certifying [Formula: see text]-positivity and a systematic way to sample [Formula: see text]-positive nondecomposable maps.

arXiv:2508.21348•Open Systems & Information Dynamics•Dec 1, 2025•3 citations

From the Choi formalism in infinite dimensions to unique decompositions of generators of completely positive dynamical semigroups

Frederik vom Ende

Given any separable complex Hilbert space, any trace-class operator [Formula: see text] which does not have purely imaginary trace, and any generator [Formula: see text] of a norm-continuous one-parameter semigroup of completely positive maps we prove that there exists a unique bounded operator [Formula: see text] and a unique completely positive map [Formula: see text] such that (i) [Formula: see text], (ii) the superoperator [Formula: see text] is trace class and has vanishing trace, and (iii) [Formula: see text] is a real number. Central to our proof is a modified version of the Choi formalism which relates completely positive maps to positive semi-definite operators. We characterize when this correspondence is injective and surjective, respectively, which in turn explains why the proof idea of our main result cannot extend to non-separable Hilbert spaces. In particular, we find examples of positive semi-definite operators which have empty pre-image under the Choi formalism as soon as the underlying Hilbert space is infinite-dimensional.

arXiv:2401.14344•Infinite Dimensional Analysis Quantum Probability and Related Topics•Jul 19, 2024•1 citation

A class of entanglement witnesses and a realignment-like criterion

Vahid Jannesary, Vahid Karimipour, Dariusz Chruściński

We present a multi-parameter family of positive maps between spaces of arbitrary but finite dimensions. This framework facilitates the construction of Entanglement Witnesses (EWs) specifically designed for systems living in [Formula: see text] dimensions. A sufficient condition for positivity is presented. Interestingly, it is shown that all EWs constructed this way are equivalent to a single realignment-like criterion which for [Formula: see text] and [Formula: see text] are different is in general stronger than the original realignment criterion. We illustrate effectiveness of this criterion considering examples of Positive Partial Transpose entangled states in [Formula: see text] and [Formula: see text] dimensions.

arXiv:2308.07019•Scientific Reports•Feb 17, 2025•3 citations

When is a bosonic operator a Hamiltonian?

Felix Fischer, Hermann Schulz-Baldes, Daniel Burgarth +1 more

Hermitian polynomials in the quadrature operators $x$ and $p$ are the basic ingredients of continuous-variable quantum information, and increasingly exotic ones are now routinely engineered in superconducting circuits and trapped ions. However, such a polynomial need not define unique quantum dynamics: it may define exactly one, none, or an infinite family of physically distinct ones. Such obstructions are invisible to algebraic arguments and can compromise finite-dimensional truncations, which may fail to converge or silently converge to the wrong dynamics. We develop a method, implemented as an algorithm, which decides which case occurs, and how large the family is, from the coefficients alone, with no functional-analytic input from the user. For Gaussian operators the answer is always one; for non-Gaussian ones, a regime continuous-variable quantum computing cannot do without, the other outcomes occur already for simple and physically natural Hamiltonians. We apply the algorithm to operators drawn from the recent literature.

quant-pharXiv:2610.33545•Oct 27, 2026•1 citation
A one-parameter family of hermiticity-preserving superoperators is a time-dependent family [Formula: see text] of hermiticity-preserving superoperators determined, in a certain sense, by real and complex polynomial functions in the variable [Formula: see text]. The paper studies sufficient computable criteria for nonpositivity of superoperators in one-parameter families. More precisely, we give sufficient conditions for the following assertions to hold: [Formula: see text] every [Formula: see text] is not positive, [Formula: see text] [Formula: see text] is not positive for [Formula: see text] in some [Formula: see text] and [Formula: see text] there is some [Formula: see text] which is not positive. We show that [Formula: see text] implies [Formula: see text]. Our approach to the problem is based on the Descartes rule of signs and the Sturm-Tarski theorem. In order to apply these facts, we introduce the sign variation formulas. These formulas are first order logical formulas in one variable [Formula: see text], generalising sign sequences of polynomials used in Descartes rule of signs.
Assume that [Formula: see text] is a superoperator which preserves hermiticity. We give an algorithm determining whether [Formula: see text] preserves semipositivity (we call [Formula: see text] positive in this case). Our approach to the problem has a model-theoretic nature, namely, we apply techniques of quantifier elimination theory for real numbers. An approach based on these techniques seems to be the only one that allows to decide whether an arbitrary hermiticity-preserving [Formula: see text] is positive. Before we go to detailed analysis of the problem, we argue that quantifier elimination for real numbers (and also for complex numbers) can play a significant role in quantum information theory and other areas as well.
The main aim of the paper is to give an effective procedure which allows us to distinguish between positive and nonpositive maps inside the set of all hermiticity preserving linear transformations. This procedure is important because we do not have any effective method of characterizing positive maps which are not completely positive. The fundamental role in our considerations is played by the well-known in literature matrix CJ. We analyze signs of eigenvalues of this matrix for a given superoperator Φ.
We study [Formula: see text]-positive linear maps on matrix algebras and address two problems, (i) characterizations of [Formula: see text]-positivity and (ii) generation of nondecomposable [Formula: see text]-positive maps. On the characterization side, we derive optimization-based conditions equivalent to [Formula: see text]-positivity that (a) reduce to a simple check when [Formula: see text], (b) reveal a direct link to the spectral norm of certain order-3 tensors (aligning with known NP-hardness barriers for [Formula: see text]), and (c) recast [Formula: see text]-positivity as a novel optimization problem over separable states, thereby connecting it explicitly to separability testing. On the generation side, we introduce a Lie-semigroup-based method that, starting from a single [Formula: see text]-positive map, produces one-parameter families that remain [Formula: see text]-positive and nondecomposable for small enough times. We illustrate this by generating such families for [Formula: see text] and [Formula: see text]. We also formulate a semidefinite program (SDP) to test an equivalent form of the positive partial transpose (PPT) square conjecture (and do not find any violation of the latter). Our results provide practical computational tools for certifying [Formula: see text]-positivity and a systematic way to sample [Formula: see text]-positive nondecomposable maps.
Given any separable complex Hilbert space, any trace-class operator [Formula: see text] which does not have purely imaginary trace, and any generator [Formula: see text] of a norm-continuous one-parameter semigroup of completely positive maps we prove that there exists a unique bounded operator [Formula: see text] and a unique completely positive map [Formula: see text] such that (i) [Formula: see text], (ii) the superoperator [Formula: see text] is trace class and has vanishing trace, and (iii) [Formula: see text] is a real number. Central to our proof is a modified version of the Choi formalism which relates completely positive maps to positive semi-definite operators. We characterize when this correspondence is injective and surjective, respectively, which in turn explains why the proof idea of our main result cannot extend to non-separable Hilbert spaces. In particular, we find examples of positive semi-definite operators which have empty pre-image under the Choi formalism as soon as the underlying Hilbert space is infinite-dimensional.
We present a multi-parameter family of positive maps between spaces of arbitrary but finite dimensions. This framework facilitates the construction of Entanglement Witnesses (EWs) specifically designed for systems living in [Formula: see text] dimensions. A sufficient condition for positivity is presented. Interestingly, it is shown that all EWs constructed this way are equivalent to a single realignment-like criterion which for [Formula: see text] and [Formula: see text] are different is in general stronger than the original realignment criterion. We illustrate effectiveness of this criterion considering examples of Positive Partial Transpose entangled states in [Formula: see text] and [Formula: see text] dimensions.
Hermitian polynomials in the quadrature operators xxx and ppp are the basic ingredients of continuous-variable quantum information, and increasingly exotic ones are now routinely engineered in superconducting circuits and trapped ions. However, such a polynomial need not define unique quantum dynamics: it may define exactly one, none, or an infinite family of physically distinct ones. Such obstructions are invisible to algebraic arguments and can compromise finite-dimensional truncations, which may fail to converge or silently converge to the wrong dynamics. We develop a method, implemented as an algorithm, which decides which case occurs, and how large the family is, from the coefficients alone, with no functional-analytic input from the user. For Gaussian operators the answer is always one; for non-Gaussian ones, a regime continuous-variable quantum computing cannot do without, the other outcomes occur already for simple and physically natural Hamiltonians. We apply the algorithm to operators drawn from the recent literature.