Michał Oszmaniec

Creating a Superposition of Unknown Quantum States

The superposition principle is one of the landmarks of quantum mechanics. The importance of quantum superpositions provokes questions about the limitations that quantum mechanics itself imposes on the possibility of their generation. In this work, we systematically study the problem of the creation of superpositions of unknown quantum states. First, we prove a no-go theorem that forbids the existence of a universal probabilistic quantum protocol producing a superposition of two unknown quantum states. Second, we provide an explicit probabilistic protocol generating a superposition of two unknown states, each having a fixed overlap with the known referential pure state. The protocol can be applied to generate coherent superposition of results of independent runs of subroutines in a quantum computer. Moreover, in the context of quantum optics it can be used to efficiently generate highly nonclassical states or non-Gaussian states.

How many invariant polynomials are needed to decide local unitary equivalence of qubit states

Given L-qubit states with the fixed spectra of reduced one-qubit density matrices, we find a formula for the minimal number of invariant polynomials needed for solving local unitary (LU) equivalence problem, that is, problem of deciding if two states can be connected by local unitary operations. Interestingly, this number is not the same for every collection of the spectra. Some spectra require less polynomials to solve LU equivalence problem than others. The result is obtained using geometric methods, i.e., by calculating the dimensions of reduced spaces, stemming from the symplectic reduction procedure.

Critical sets of the total variance can detect all stochastic local operations and classical communication classes of multiparticle entanglement

We present a general algorithm for finding all classes of pure multiparticle states equivalent under Stochastic Local Operations and Classsical Communication (SLOCC). We parametrize all SLOCC classes by the critical sets of the total variance function. Our method works for arbitrary systems of distinguishable and indistinguishable particles. We also show how to calculate the Morse indices of critical points which have the interpretation of the number of independent non-local perturbations increasing the variance and hence entanglement of a state. We illustrate our method by two examples.

Random Bosonic States for Robust Quantum Metrology

We study how useful random states are for quantum metrology, i.e., surpass the classical limits imposed on precision in the canonical phase estimation scenario. First, we prove that random pure states drawn from the Hilbert space of distinguishable particles typically do not lead to super-classical scaling of precision even when allowing for local unitary optimization. Conversely, we show that random states from the symmetric subspace typically achieve the optimal Heisenberg scaling without the need for local unitary optimization. Surprisingly, the Heisenberg scaling is observed for states of arbitrarily low purity and preserved under finite particle losses. Moreover, we prove that for such states a standard photon-counting interferometric measurement suffices to typically achieve the Heisenberg scaling of precision for all possible values of the phase at the same time. Finally, we demonstrate that metrologically useful states can be prepared with short random optical circuits generated from three types of beam-splitters and a non-linear (Kerr-like) transformation.

Fraction of isospectral states exhibiting quantum correlations

For several types of correlations: mixed-state entanglement in systems of distinguishable particles, particle entanglement in systems of indistinguishable bosons and fermions and non-Gaussian correlations in fermionic systems we estimate the fraction of non-correlated states among the density matrices with the same spectra. We prove that for the purity exceeding some critical value (depending on the considered problem) fraction of non-correlated states tends to zero exponentially fast with the dimension of the relevant Hilbert space. As a consequence a state randomly chosen from the set of density matrices possessing the same spectra is asymptotically a correlated one. To prove this we developed a systematic framework for detection of correlations via nonlinear witnesses.

Classical simulation of fermionic linear optics augmented with noisy ancillas

Fermionic linear optics is a model of quantum computation which is efficiently simulable on a classical probabilistic computer. We study the problem of a classical simulation of fermionic linear optics augmented with noisy auxiliary states. If the auxiliary state can be expressed as a convex combination of pure Fermionic Gaussian states, the corresponding computation scheme is classically simulable. We present an analytic characterisation of the set of convex-Gaussian states in the first non-trivial case, in which the Hilbert space of the ancilla is a four-mode Fock space. We use our result to solve an open problem recently posed by De Melo et al. and to study in detail the geometrical properties of the set of convex-Gaussian states.

Universal framework for entanglement detection

We construct nonlinear multiparty entanglement measures for distinguishable particles, bosons and fermions. In each case properties of an entanglement measures are related to the decomposition of the suitably chosen representation of the relevant symmetry group onto irreducible components. In the case of distinguishable particles considered entanglement measure reduces to the well-known many particle concurrence. We prove that our entanglement criterion is sufficient and necessary for pure states living in both finite and infinite dimensional spaces. We generalize our entanglement measures to mixed states by the convex roof extension and give a non trivial lower bound of thus obtained generalized concurrence.

Simulating Positive-Operator-Valued Measures with Projective Measurements

Standard projective measurements (PMs) represent a subset of all possible measurements in quantum physics, defined by positive-operator-valued measures. We study what quantum measurements are projective simulable, that is, can be simulated by using projective measurements and classical randomness. We first prove that every measurement on a given quantum system can be realized by classical randomization of projective measurements on the system plus an ancilla of the same dimension. Then, given a general measurement in dimension two or three, we show that deciding whether it is PM simulable can be solved by means of semidefinite programming. We also establish conditions for the simulation of measurements using projective ones valid for any dimension. As an application of our formalism, we improve the range of visibilities for which two-qubit Werner states do not violate any Bell inequality for all measurements. From an implementation point of view, our work provides bounds on the amount of white noise a measurement tolerates before losing any advantage over projective ones.

Multiphoton states related via linear optics

We investigate which pure states of

On detection of quasiclassical states

n