arXiv subjects

Konrad Szymański

Publications and source records attributed to Konrad Szymański.

16 recordsLinked to original sources

arXiv2026

GroupFunctions.jl: computing individual entries of the irreducible representations of the unitary group U(d)

GroupFunctions.jl is a Julia library for computing individual matrix elements of irreducible representations of U(d). These matrix elements, called group functions, can be evaluated symbolically or numerically. For SU(2), they reduce to the Wigner D-functions. The library computes these matrix elements in a carrier-space basis enumerated by Gelfand-Tsetlin patterns. It can also compute entire representation operators, construct input unitaries from parameterisations common in quantum optics, translate Gelfand-Tsetlin patterns into occupation-number kets, and compute the associated Schur functions. Results can be exported in a form compatible with Mathematica.

quant-ph↗

arXiv2026

The joint numerical range of three hermitian $4\times 4$ matrices

We analyze the joint numerical range $W$ of three hermitian matrices of order four. In the generic case, this three-dimensional convex set has a smooth boundary. We analyze non-generic structures. Fifteen possible classes regarding the numbers of non-elliptic faces in the boundary of $W$ are identified and an explicit example is presented for each class. Secondly, it is shown that a nonempty intersection of three mutually distinct one-dimensional faces is a corner point. Thirdly, introducing a tensor product structure into $\mathbb C^4=\mathbb C^2\otimes\mathbb C^2$, one defines the separable joint numerical range - a subset of $W$ useful in studies of quantum entanglement. The boundary of the separable numerical range is compared with that of $W$.

math.FA↗

arXiv2026

The uncertainty geometry of finite-dimensional position and momentum

Uncertainty relations are usually stated as bounds on selected combinations of variances, but the full covariance matrix contains substantially richer information about the geometry of quantum state space and about the operational capabilities of quantum systems. Here we characterize the covariance matrices attainable by a finite-dimensional canonical pair of observables related by the discrete Fourier transform, the natural analogue of position and momentum in a finite Hilbert space. We combine analytic arguments with convex-geometric and semidefinite-programming methods based on joint numerical ranges to describe the admissible region through unitary invariants, in particular the trace and determinant of the covariance matrix. This provides a systematic way to identify extremal states, generalizing the notion of minimum-uncertainty states, and to quantify how the discrete uncertainty geometry approaches its continuous counterpart with increasing dimension. We further show that the resulting covariance-matrix characterization has direct consequences for applications: it yields accuracy bounds for multi parameter estimation protocols and separability criteria for finite-dimensional bipartite systems, including discrete analogues of continuous-variable EPR-type witnesses. Our results establish a systematic and versatile platform for connecting uncertainty relations, convex quantum geometry, metrology, and entanglement detection in finite-dimensional systems.

quant-ph↗

arXiv2026

Useful entanglement can be extracted from noisy graph states

Cluster states and graph states in general offer a useful model of the stabilizer formalism and a path toward the development of measurement-based quantum computation. Their defining structure - the stabilizer group - encodes all possible correlations that can be observed during measurement. The measurement outcomes which are consistent with the stabilizer structure make error correction possible. Here, we leverage both properties to design feasible families of states that can be used as robust building blocks of quantum computation. This procedure reduces the effect of experimentally relevant noise models on the extraction of smaller entangled states from the larger noisy graph state. In particular, we study the extraction of Bell pairs from linearly extended graph states - this has the immediate consequence for state teleportation across the graph. We show that robust entanglement can be extracted by proper design of the linear graph with only a minimal overhead of the physical qubits. This scenario is relevant to systems in which the entanglement can be created between neighboring sites. The results shown in this work provide a mathematical framework for noise reduction in measurement-based quantum computation. With proper connectivity structures, the effect of noise can be minimized for a large class of realistic noise processes.

quant-ph↗

arXiv2024

Rotational covariance restricts available quantum states

Quantum states of angular momentum and spin generally are not invariant under rotations of the reference frame. Therefore, they can be used as a resource of relative orientation, which is encoded in the asymmetry of the state under consideration. In this paper we introduce the analytical characterization of the rotational information by parameterizing the group characteristic function by polynomial functions. By doing so, we show that the set of states achievable through transformations lacking a reference frame (rotationally covariant ones) admits an analytical characterization and can be studied through the use of semidefinite optimization techniques. We demonstrate the developed methods via examples, and provide a physical scenario in which a reference-independent operation performs a metrologically useful operation: the preparation of a state of light improving interferometer sensitivity, which equivalently can be realized as a postprocessing step.

quant-ph↗

arXiv2023

Numerical ranges and geometry in quantum information: Entanglement, uncertainty relations, phase transitions, and state interconversion

Studying the geometry of sets appearing in various problems of quantum information helps in understanding different parts of the theory. It is thus worthwhile to approach quantum mechanics from the angle of geometry -- this has already provided a multitude of interesting results. In this thesis I demonstrate results relevant to numerical ranges -- the sets of simultaneously attainable expectation values of several observables. In particular, I apply this notion in the problems related to uncertainty relations, entanglement detection, and determining bounds for the value of spectral gap. Apart from this, I present geometric structures helping with the question of state interconversion using channels commuting with a particular representation of a group.

quant-ph↗

arXiv2021

Confident entanglement detection via separable numerical range

We investigate the joint (separable) numerical range of multiple measurements, i.e., the regions of expectation values accessible with (separable) quantum states for given observables. This not only enables efficient entanglement detection, but also sheds light on the geometry of the set of quantum states. More precisely, in an experiment, if the confidence region for the obtained data and the separable numerical range are disjoint, entanglement is reliably detected. Generically, the success of such an experiment is more likely the smaller the separable numerical range is compared to the standard numerical range of the observables measured. We quantify this relation using the ratio between these two volumes and show that it cannot be arbitrarily small, giving analytical bounds for any number of particles, local dimensions as well as number of measurements. Moreover, we explicitly compute the volume of separable and standard numerical range for two locally traceless two-qubit product observables, which are of particular interest as they are easier to measure in practice. Furthermore, we consider typical volume ratios for generic observables and extreme instances.

quant-ph↗

arXiv2021

Universal witnesses of vanishing energy gap

Energy gap, the difference between the energy of the ground state of a given Hamiltonian and the energy of its first excited state, is a parameter of a critical importance in analysis of phase transitions and adiabatic quantum computation. We present a concrete technique to determine the upper bound for the energy gap of a Hamiltonian $H_0$ based on properties of the set of expectation values of $H_0$ and an additional auxiliary Hamiltonian $V$. This formalism can be applied to obtain an effective criterion of gaplessness, which we illustrate with a concrete example of the XY model -- a physical system with vanishing energy gap.

quant-ph↗

arXiv2020

Separability gap and large deviation entanglement criterion

For a given Hamiltonian $H$ on a multipartite quantum system, one is interested in finding the energy $E_0$ of its ground state. In the separability approximation, arising as a natural consequence of measurement in a separable basis, one looks for the minimal expectation value $λ_{\rm min}^{\otimes}$ of $H$ among all product states. For several concrete model Hamiltonians, we investigate the difference $λ_{\rm min}^{\otimes}-E_0$, called separability gap, which vanishes if the ground state has a product structure. In the generic case of a random Hermitian matrix of the Gaussian orthogonal ensemble, we find explicit bounds for the size of the gap which depend on the number of subsystems and hold with probability one. This implies an effective entanglement criterion applicable for any multipartite quantum system: If an expectation value of a typical observable among a given state is sufficiently distant from the average value, the state is almost surely entangled.

quant-ph↗

arXiv2019

Quantum correlations protection through spin self-rephasing in 1-D Bose gas

System consisting of a number of trapped atoms evolving under the influence of external inhomogenous magnetic field undergoes spin dephasing: classically, since each atom feels different field along its trajectory, the spin rotation rates differ; as a result the average spin decays. In a quantum mechanical context this corresponds to entanglement of spin and spatial degrees of freedom and nontrivial internal spin dynamics. The spin dephasing can be prevented by tuning the interaction between the atoms. This phenomenon, called spin self-rephasing, has been observed experimentally and can increase the coherence time by a large factor. While such systems have been studied from a semiclassical point of view, a quantum mechanical description is limited, especially in the case of entangled states. In this work we provide a numerical simulation of an ab initio model and provide realistic examples of spin self-rephasing used to counteract the effect of inhomogenous magnetic field. We analyze in particular the joint effect of magnetic field inhomogeneity and interactions on the coherent and spin squeezed states evolution.

quant-ph↗

arXiv2019

Geometric and algebraic origins of additive uncertainty relations

Constructive techniques to establish state-independent uncertainty relations for the sum of variances of arbitrary two observables are presented. We investigate the range of simultaneously attainable pairs of variances, which can be applied to a wide variety of problems including finding exact bound for the sum of variances of two components of angular momentum operator for any total angular momentum quantum number $j$ and detection of quantum entanglement. Resulting uncertainty relations are state-independent, semianalytical, bounded-error and can be made arbitrarily tight. The advocated approach, based on the notion of joint numerical range of a number of observables and uncertainty range, allows us to improve earlier numerical works and to derive semianalytical tight bounds for the uncertainty relation for the sum of variances expressed as roots of a polynomial of a single real variable.

quant-ph↗

arXiv2018

Classification of joint numerical ranges of three hermitian matrices of size three

The joint numerical range $W(F)$ of three hermitian $3$-by-$3$ matrices $F=(F_1,F_2,F_3)$ is a convex and compact subset in $\mathbb{R}^3$. Generically we find that $W(F)$ is a three-dimensional oval. Assuming $\dim(W(F))=3$, every one- or two-dimensional face of $W(F)$ is a segment or a filled ellipse. We prove that only ten configurations of these segments and ellipses are possible. We identify a triple $F$ for each class and illustrate $W(F)$ using random matrices and dual varieties.

math.FA↗

arXiv2017

Evolution of entanglement under an Ising-like Hamiltonian with particle losses

We present analytical compact solution for the density matrix and correlation functions of two collective-macroscopic spins evolving via Ising-like Hamiltonian in the presence of particle losses. The losses introduce non-local phase noise which destroys highly entangled states arising in the evolution. On the other hand, the states appearing at relatively short timescales, possessing EPR-like entanglement will survive. Applying our solutions to the recently proposed scheme to entangle two Bose-Einstein condensates, we estimate the optimal number of atoms for EPR correlations.

quant-ph↗

arXiv2017

Uncertainty relations and joint numerical ranges

Noncommutativity lies in the heart of quantum theory and provides rich set of interesting questions in physics and mathematics. In this work I present some of them through the concept of Joint Numerical Range (JNR) - the set of simultaneously attainable averages of quantum observables, which in general need not commute. Full description of JNR geometry quickly becomes complex as the dimensionality of quantum system grows. In this thesis I present already existing results in the theory of JNR, generalizations of the formalism and applications of JNR in the theory of phase transitions and uncertainty relations.

quant-ph↗

arXiv2017

Convex set of quantum states with positive partial transpose analysed by hit and run algorithm

The convex set of quantum states of a composite $K \times K$ system with positive partial transpose is analysed. A version of the hit and run algorithm is used to generate a sequence of random points covering this set uniformly and an estimation for the convergence speed of the algorithm is derived. For $K\ge 3$ this algorithm works faster than sampling over the entire set of states and verifying whether the partial transpose is positive. The level density of the PPT states is shown to differ from the Marchenko-Pastur distribution, supported in [0,4] and corresponding asymptotically to the entire set of quantum states. Based on the shifted semi--circle law, describing asymptotic level density of partially transposed states, and on the level density for the Gaussian unitary ensemble with constraints for the spectrum we find an explicit form of the probability distribution supported in [0,3], which describes well the level density obtained numerically for PPT states.

quant-ph↗

arXiv2016

Efficient polarization of high-angular-momentum systems

We propose methods of optical pumping that are applicable to open, high-angular-momentum transitions in atoms and molecules, for which conventional optical pumping would lead to significant population loss. Instead of applying circularly polarized cw light, as in conventional optical pumping, we propose to use techniques for coherent population transfer (e.g., adiabatic fast passage) to arrange the atoms so as to increase the entropy removed from the system with each spontaneous decay from the upper state. This minimizes the number of spontaneous-emission events required to produce a stretched state, thus reducing the population loss due to decay to other states. To produce a stretched state in a manifold with angular momentum J, conventional optical pumping requires about 2J spontaneous decays per atom, one of our proposed methods reduces this to about log_2(2J), while another of the methods reduces it to about one spontaneous decay, independent of J.

physics.atom-ph↗