Searcharxiv⌕ Search

arXiv subjects

Zbigniew Puchała

Publications and source records attributed to Zbigniew Puchała.

70 records · Page 4Linked to original sources
arXiv2012

Collectibility for Mixed Quantum States

Bounds analogous to entropic uncertainty relations allow one to design practical tests to detect quantum entanglement by a collective measurement performed on several copies of the state analyzed. This approach, initially worked out for pure states only [Phys. Rev. Lett. 107, 150502 (2011)], is extended here for mixed quantum states. We define collectibility for any mixed states of a multipartite system. Deriving bounds for collectibility for positive partially transposed states of given purity provides a new insight into the structure of entangled quantum states. In case of two qubits the application of complementary measurements and coincidence based detections leads to a new test of entanglement of pseudopure states.

quant-ph↗
arXiv2012

A model for quantum queue

We consider an extension of Discrete Time Markov Chain queueing model to the quantum domain by use of Discrete Time Quantum Markov Chain. We introduce methods for numerical analysis of such models. Using this tools we show that quantum model behaves fundamentally differently from the classical one.

quant-ph↗
arXiv2012

Restricted numerical shadow and geometry of quantum entanglement

The restricted numerical range $W_R(A)$ of an operator $A$ acting on a $D$-dimensional Hilbert space is defined as a set of all possible expectation values of this operator among pure states which belong to a certain subset $R$ of the of set of pure quantum states of dimension $D$. One considers for instance the set of real states, or in the case of composite spaces, the set of product states and the set of maximally entangled states. Combining the operator theory with a probabilistic approach we introduce the restricted numerical shadow of $A$ -- a normalized probability distribution on the complex plane supported in $W_R(A)$. Its value at point $z \in {\mathbbm C}$ is equal to the probability that the expectation value $< ψ|A|ψ>$ is equal to $z$, where $|ψ>$ represents a random quantum state in subset $R$ distributed according to the natural measure on this set, induced by the unitarily invariant Fubini--Study measure. Studying restricted shadows of operators of a fixed size $D=N_A N_B$ we analyse the geometry of sets of separable and maximally entangled states of the $N_A \times N_B$ composite quantum system. Investigating trajectories formed by evolving quantum states projected into the plane of the shadow we study the dynamics of quantum entanglement. A similar analysis extended for operators on $D=2^3$ dimensional Hilbert space allows us to investigate the structure of the orbits of $GHZ$ and $W$ quantum states of a three--qubit system.

quant-ph↗
arXiv2012

Quantum control with spectral constraints

Various constraints concerning control fields can be imposed in the realistic implementations of quantum control systems. One of the most important is the restriction on the frequency spectrum of acceptable control parameters. It is important to consider the limitations of experimental equipment when trying to find appropriate control parameters. Therefore, in this paper we present a general method of obtaining a piecewise-constant controls, which are robust with respect to spectral constraints. We consider here a Heisenberg spin chain, however the method can be applied to a system with more general interactions. To model experimental restrictions we apply an ideal low-pass filter to numerically obtained control pulses. The usage of the proposed method has negligible impact on the control quality as opposed to the standard approach, which does not take into account spectral limitations.

quant-ph↗
arXiv2012

Increasing the security of the ping-pong protocol by using many mutually unbiased bases

In this paper we propose an extended version of the ping-pong protocol and study its security. The proposed protocol incorporates the usage of mutually unbiased bases in the control mode. We show that, by increasing the number of bases, it is possible to improve the security of this protocol. We also provide the upper bounds on eavesdropping average non-detection probability and propose a control mode modification that increases the attack detection probability.

quant-ph↗
arXiv2012

Local controllability of quantum systems

We give a criterion that is sufficient for controllability of multipartite quantum systems. We generalize the graph infection criterion to the quantum systems that cannot be described with the use of a graph theory. We introduce the notation of hypergraphs and reformulate the infection property in this setting. The introduced criterion has a topological nature and therefore it is not connected to any particular experimental realization of quantum information processing.

quant-ph↗
arXiv2011

Qubit flip game on a Heisenberg spin chain

We study a quantum version of a penny flip game played using control parameters of the Hamiltonian in the Heisenberg model. Moreover, we extend this game by introducing auxiliary spins which can be used to alter the behaviour of the system. We show that a player aware of the complex structure of the system used to implement the game can use this knowledge to gain higher mean payoff.

quant-ph↗
arXiv2011

Probability measure generated by the superfidelity

We study the probability measure on the space of density matrices induced by the metric defined by using superfidelity. We give the formula for the probability density of eigenvalues. We also study some statistical properties of the set of density matrices equipped with the introduced measure and provide a method for generating density matrices according to the introduced measure.

math-ph↗
arXiv2011

Eigengestures for natural human computer interface

We present the application of Principal Component Analysis for data acquired during the design of a natural gesture interface. We investigate the concept of an eigengesture for motion capture hand gesture data and present the visualisation of principal components obtained in the course of conducted experiments. We also show the influence of dimensionality reduction on reconstructed gesture data quality.

cs.HC↗
arXiv2011

Numerical shadow and geometry of quantum states

The totality of normalised density matrices of order N forms a convex set Q_N in R^(N^2-1). Working with the flat geometry induced by the Hilbert-Schmidt distance we consider images of orthogonal projections of Q_N onto a two-plane and show that they are similar to the numerical ranges of matrices of order N. For a matrix A of a order N one defines its numerical shadow as a probability distribution supported on its numerical range W(A), induced by the unitarily invariant Fubini-Study measure on the complex projective manifold CP^(N-1). We define generalized, mixed-states shadows of A and demonstrate their usefulness to analyse the structure of the set of quantum states and unitary dynamics therein.

quant-ph↗
arXiv2010

Numerical shadows: measures and densities on the numerical range

For any operator $M$ acting on an $N$-dimensional Hilbert space $H_N$ we introduce its numerical shadow, which is a probability measure on the complex plane supported by the numerical range of $M$. The shadow of $M$ at point $z$ is defined as the probability that the inner product $(Mu,u)$ is equal to $z$, where $u$ stands for a random complex vector from $H_N$, satisfying $||u||=1$. In the case of N=2 the numerical shadow of a non-normal operator can be interpreted as a shadow of a hollow sphere projected on a plane. A similar interpretation is provided also for higher dimensions. For a hermitian $M$ its numerical shadow forms a probability distribution on the real axis which is shown to be a one dimensional $B$-spline. In the case of a normal $M$ the numerical shadow corresponds to a shadow of a transparent solid simplex in $R^{N-1}$ onto the complex plane. Numerical shadow is found explicitly for Jordan matrices $J_N$, direct sums of matrices and in all cases where the shadow is rotation invariant. Results concerning the moments of shadow measures play an important role. A general technique to study numerical shadow via the Cartesian decomposition is described, and a link of the numerical shadow of an operator to its higher-rank numerical range is emphasized.

math.FA↗
arXiv2010

Product numerical range in a space with tensor product structure

We study operators acting on a tensor product Hilbert space and investigate their product numerical range, product numerical radius and separable numerical range. Concrete bounds for the product numerical range for Hermitian operators are derived. Product numerical range of a non-Hermitian operator forms a subset of the standard numerical range containing the barycenter of the spectrum. While the latter set is convex, the product range needs not to be convex nor simply connected. The product numerical range of a tensor product is equal to the Minkowski product of numerical ranges of individual factors.

math.OA↗
arXiv2010

Restricted numerical range: a versatile tool in the theory of quantum information

Numerical range of a Hermitian operator X is defined as the set of all possible expectation values of this observable among a normalized quantum state. We analyze a modification of this definition in which the expectation value is taken among a certain subset of the set of all quantum states. One considers for instance the set of real states, the set of product states, separable states, or the set of maximally entangled states. We show exemplary applications of these algebraic tools in the theory of quantum information: analysis of k-positive maps and entanglement witnesses, as well as study of the minimal output entropy of a quantum channel. Product numerical range of a unitary operator is used to solve the problem of local distinguishability of a family of two unitary gates.

quant-ph↗
arXiv2009

Experimentally feasible measures of distance between quantum operations

We present two measures of distance between quantum processes based on the superfidelity, introduced recently to provide an upper bound for quantum fidelity. We show that the introduced measures partially fulfill the requirements for distance measure between quantum processes. We also argue that they can be especially useful as diagnostic measures to get preliminary knowledge about imperfections in an experimental setup. In particular we provide quantum circuit which can be used to measure the superfidelity between quantum processes. As the behavior of the superfidelity between quantum processes is crucial for the properties of the introduced measures, we study its behavior for several families of quantum channels. We calculate superfidelity between arbitrary one-qubit channels using affine parametrization and superfidelity between generalized Pauli channels in arbitrary dimensions. Statistical behavior of the proposed quantities for the ensembles of quantum operations in low dimensions indicates that the proposed measures can be indeed used to distinguish quantum processes.

quant-ph↗
arXiv2009

Bound on trace distance based on superfidelity

We provide a bound for the trace distance between two quantum states. The lower bound is based on the superfidelity, which provides the upper bound on quantum fidelity. One of the advantages of the presented bound is that it can be estimated using a simple measurement procedure. We also compare this bound with the one provided in terms of fidelity.

quant-ph↗