Searcharxiv⌕ Search

arXiv subjects

Michał Horodecki

Publications and source records attributed to Michał Horodecki.

At least 73 records · Page 4Linked to original sources

Simple scheme for encoding and decoding a qubit in unknown state for various topological codes

We present a scheme for encoding and decoding an unknown state for CSS codes, based on syndrome measurements. We illustrate our method by means of Kitaev toric code, defected-lattice code, topological subsystem code and Haah 3D code. The protocol is local whenever in a given code the crossings between the logical operators consist of next neighbour pairs, which holds for the above codes. For subsystem code we also present scheme in a noisy case, where we allow for bit and phase-flip errors on qubits as well as state preparation and syndrome measurement errors. Similar scheme can be built for two other codes. We show that the fidelity of the protected qubit in the noisy scenario in a large code size limit is of $1-\mathcal{O}(p)$, where $p$ is a probability of error on a single qubit. Regarding Haah code we provide noiseless scheme, leaving the noisy case as an open problem.

quant-ph↗

Explicit constructions of unitary transformations between equivalent irreducible representations

Irreducible representations (irreps) of a finite group $G$ are equivalent if there exists a similarity transformation between them. In this paper, we describe an explicit algorithm for constructing this transformation between a pair of equivalent irreps, assuming we are given an algorithm to compute the matrix elements of these irreps. Along the way, we derive a generalization of the classical orthogonality relations for matrix elements of irreps of finite groups. We give an explicit form of such unitary matrices for the important case of conjugated Young-Yamanouchi representations, when our group $G$ is symmetric group $S(N)$.

math.RT↗

Fundamental limitations for quantum and nano thermodynamics

The relationship between thermodynamics and statistical physics is valid in the thermodynamic limit - when the number of particles becomes very large. Here, we study thermodynamics in the opposite regime - at both the nano scale, and when quantum effects become important. Applying results from quantum information theory we construct a theory of thermodynamics in these limits. We derive general criteria for thermodynamical state transformations, and as special cases, find two free energies: one that quantifies the deterministically extractable work from a small system in contact with a heat bath, and the other that quantifies the reverse process. We find that there are fundamental limitations on work extraction from nonequilibrium states, owing to finite size effects and quantum coherences. This implies that thermodynamical transitions are generically irreversible at this scale. As one application of these methods, we analyse the efficiency of small heat engines and find that they are irreversible during the adiabatic stages of the cycle.

quant-ph↗

The second laws of quantum thermodynamics

The second law of thermodynamics tells us which state transformations are so statistically unlikely that they are effectively forbidden. Its original formulation, due to Clausius, states that "Heat can never pass from a colder to a warmer body without some other change, connected therewith, occurring at the same time". The second law applies to systems composed of many particles interacting; however, we are seeing that one can make sense of thermodynamics in the regime where we only have a small number of particles interacting with a heat bath. Is there a second law of thermodynamics in this regime? Here, we find that for processes which are cyclic or very close to cyclic, the second law for microscopic systems takes on a very different form than it does at the macroscopic scale, imposing not just one constraint on what state transformations are possible, but an entire family of constraints. In particular, we find a family of free energies which generalise the traditional one, and show that they can never increase. We further find that there are three regimes which determine which family of second laws govern state transitions, depending on how cyclic the process is. In one regime one can cause an apparent violation of the usual second law, through a process of embezzling work from a large system which remains arbitrarily close to its original state. These second laws are not only relevant for small systems, but also apply to individual macroscopic systems interacting via long-range interactions, which only satisfy the ordinary second law on average. By making precise the definition of thermal operations, the laws of thermodynamics take on a simple form with the first law defining the class of thermal operations, the zeroeth law emerging as a unique condition ensuring the theory is nontrivial, and the remaining laws being a monotonicity property of our generalised free energies.

quant-ph↗

When Are Popescu-Rohrlich Boxes and Random Access Codes Equivalent?

We study a problem of interconvertibility of two supra-quantum resources: one is so called PR-box, which violates CHSH inequality up to maximal algebraic bound, and second is so called random access code (RAC). The latter is a functionality that enables Bob (receiver) to choose one of two bits of Alice. It has been known, that PR-box supplemented with one bit of communication can be used to simulate RAC. We ask the converse question: to what extent RAC can simulate PR-box? To this end we introduce racbox: a box such that supplemented with one bit of communication offers RAC. As said, PR-box can simulate racbox. The question we raise, is whether any racbox can simulate PR-box. We show that a non-signaling racbox indeed can simulate PR-box, hence those two resources are equivalent. We also provide an example of signalling racbox which cannot simulate PR-box. We give a resource inequality between racbox es and PR-boxes, and show that it is saturated.

quant-ph↗

Group representation approach to 1 - N universal quantum cloning machines

In this work, we revisit the problem of finding an admissible region of fidelities obtained after an application of an arbitrary $1 \rightarrow N$ universal quantum cloner which has been recently solved in [A. Kay et al., Quant. Inf. Comput 13, 880 (2013)] from the side of cloning machines. Using group-theory formalism, we show that the allowed region for fidelities can be alternatively expressed in terms of overlaps of pure states with recently found irreducible representations of the commutant $U \otimes U \otimes \ldots \otimes U \otimes U^*$, which gives the characterization of the allowed region where states being cloned are figure of merit. Additionally, it is sufficient to take pure states with real coefficients only, which makes calculations simpler. To obtain the allowed region, we make a convex hull of possible ranges of fidelities related to a given irrep. Subsequently, two cases: $1 \rightarrow 2$ and $1 \rightarrow 3$ cloners, are studied for different dimensions of states as illustrative examples.

quant-ph↗

Structure and properties of the algebra of partially transposed permutation operators

We consider the structure of algebra of operators, acting in $n-$fold tensor product space, which are partially transposed on the last term. Using purely algebraical methods we show that this algebra is semi-simple and then, considering its regular representation, we derive basic properties of the algebra. In particular, we describe all irreducible representations of the algebra of partially transposed operators and derive expressions for matrix elements of the representations. It appears that there are two types of irreducible representations of the algebra. The first one is strictly connected with the representations of the group $S(n-1)$ induced by irreducible representations of the group $S(n-2)$. The second type is structurally connected with irreducible representations of the group $S(n-1)$.

quant-ph↗

The Resource Theory of Quantum States Out of Thermal Equilibrium

The ideas of thermodynamics have proved fruitful in the setting of quantum information theory, in particular the notion that when the allowed transformations of a system are restricted, certain states of the system become useful resources with which one can prepare previously inaccessible states. The theory of entanglement is perhaps the best-known and most well-understood resource theory in this sense. Here we return to the basic questions of thermodynamics using the formalism of resource theories developed in quantum information theory and show that the free energy of thermodynamics emerges naturally from the resource theory of energy-preserving transformations. Specifically, the free energy quantifies the amount of useful work which can be extracted from asymptotically-many copies of a quantum system when using only reversible energy-preserving transformations and a thermal bath at fixed temperature. The free energy also quantifies the rate at which resource states can be reversibly interconverted asymptotically, provided that a sublinear amount of coherent superposition over energy levels is available, a situation analogous to the sublinear amount of classical communication required for entanglement dilution.

quant-ph↗

Conjectured strong complementary-correlations tradeoff

We conjecture new uncertainty relations which restrict correlations between results of measurements performed by two separated parties on a shared quantum state. The first uncertainty relation bounds the sum of two mutual informations when one party measures a single observable and the other party measures one of two observables. The uncertainty relation does not follow from Maassen-Uffink uncertainty relation and is much stronger than Hall uncertainty relation derived from the latter. The second uncertainty relation bounds the sum of two mutual informations when each party measures one of two observables. We provide numerical evidence for validity of conjectured uncertainty relations and prove them for large classes of states and observables.

quant-ph↗

Commutant structuture of Ux...xUxU* transformations

In this paper we have found irreducible representations (irreps) of the algebra of partially transposed permutation operators on last subsystem. We give here direct method of irreps construction for an arbitrary number of subsystems n and local dimension d. Our method is inspired by representation theory of symmetric group S(n), theory of Brauer Algebras and Walled Brauer Algebras.

quant-ph↗

Local random quantum circuits are approximate polynomial-designs - numerical results

We numerically investigate the statement that local random quantum circuits acting on n qubits composed of polynomially many nearest neighbour two-qubit gates form an approximate unitary poly(n)-design [F.G.S.L. Brandao et al., arXiv:1208.0692]. Using a group theory formalism, spectral gaps that give a ratio of convergence to a given t-design are evaluated for a different number of qubits n (up to 20) and degrees t (t=2,3,4 and 5), improving previously known results for n=2 in the case of t=2 and 3. Their values lead to a conclusion that the previously used lower bound that bounds spectral gaps values may give very little information about the real situation and in most cases, only tells that a gap is closed. We compare our results to the another lower bounding technique, again showing that its results may not be tight.

quant-ph↗

Free randomness amplification using bipartite chain correlations

A direct analysis of the protocol of randomness amplification using Bell inequality violation is performed in terms of the convex combination of no-signaling boxes required to simulate quantum violation of the inequality. The probability distributions of bits generated by a Santha-Vazirani source are shown to be mixtures of permutations of Bernoulli distributions with parameter defined by the source. An intuitive proof is provided for the range of partial randomness from which perfect randomness can be extracted using quantum correlations violating the chain inequalities. Exact values are derived in the asymptotic limit of a large number of measurement settings.

quant-ph↗

Generalized teleportation and entanglement recycling

We introduce new teleportation protocols which are generalizations of the original teleportation protocols that use the Pauli group [Bennett, et al. Physical Review Letters, 70(13) 1895-1899] and the port-based teleportation protocols, introduced by Hiroshima and Ishizaka [Physical Review Letters, 101(24) 240501], that use the symmetric permutation group. We derive sufficient condition for a set of operations, which in general need not form a group, to give rise to a teleportation protocol and provide examples of such schemes. This generalization leads to protocols with novel properties and is needed to push forward new schemes of computation based on them. Port-based teleportation protocols and our generalizations use a large resource state consisting of N singlets to teleport only a single qubit state reliably. We provide two distinct protocols which recycle the resource state to teleport multiple states with error linearly increasing with their number. The first protocol consists of sequentially teleporting qubit states, and the second teleports them in a bulk.

quant-ph↗

(Quantumness in the context of) Resource Theories

We review the basic idea behind resource theories, where we quantify quantum resources by specifying a restricted class of operations. This divides the state space into various sets, including states which are free (because they can be created under the class of operations), and those which are a resource (because they cannot be). One can quantify the worth of the resource by the relative entropy distance to the set of free states, and under certain conditions, this is a unique measure which quantifies the rate of state to state transitions. The framework includes entanglement, asymmetry and purity theory. It also includes thermodynamics, which is a hybrid resource theory combining purity theory and asymmetry. Another hybrid resource theory which merges purity theory and entanglement can be used to study quantumness of correlations and discord, and we present quantumness in this more general framework of resource theories.

quant-ph↗

Convergence to equilibrium under a random Hamiltonian

We analyze equilibration times of subsystems of a larger system under a random total Hamiltonian, in which the basis of the Hamiltonian is drawn from the Haar measure. We obtain that the time of equilibration is of the order of the inverse of the arithmetic average of the Bohr frequencies. To compute the average over a random basis, we compute the inverse of a matrix of overlaps of operators which permute four systems. We first obtain results on such a matrix for a representation of an arbitrary finite group and then apply it to the particular representation of the permutation group under consideration.

quant-ph↗

Region of fidelities for a 1 -> N universal qubit quantum cloner

We analyze a region of fidelities for qubit which is obtained after an application of a 1 -> N universal quantum cloner. We express the allowed region for fidelities in terms of overlaps of pure states with irreps of S(n) (n = N+1) showing that the pure states can be taken with real coefficients only. Subsequently, the case n = 4, corresponding to a 1 -> 3 cloner is studied in more detail as an illustrative example. To obtain the main result, we make a convex hull of possible ranges of fidelities related to a given irrep. The formalism allows to construct the state giving rise to a given N-tuple of fidelities.

quant-ph↗

Distillation of entanglement by projection on permutationally invariant subspaces

We consider distillation of entanglement from two qubit states which are mixtures of three mutually orthogonal states: two pure entangled states and one pure product state. We distill entanglement from such states by projecting n copies of the state on permutationally invariant subspace and then applying one-way hashing protocol. We find analytical expressions for the rate of the protocol. We also generalize this method to higher dimensional systems. To get analytical expression for two qubit case, we faced a mathematical problem of diagonalizing a family of matrices enjoying some symmetries w.r.t. to symmetric group. We have solved this problem in two ways: (i) directly, by use of Schur-Weyl decomposition and Young symmetrizers (ii) showing that the problem is equivalent to a problem of diagonalizing adjacency matrices in a particular instance of a so called algebraic association scheme.

quant-ph↗

Low-dimensional quite noisy bound entanglement with cryptographic key

We provide a class of bound entangled states that have positive distillable secure key rate. The smallest state of this kind is 4 \bigotimes 4. Our class is a generalization of the class presented in [1] (IEEE Trans. Inf. Theory 54, 2621 (2008); arXiv:quant-ph/0506203). It is much wider, containing, in particular, states from the boundary of PPT entangled states (all of the states in the class in [1] were of this kind) but also states inside the set of PPT entangled states, even, approaching the separable states. This generalization comes with a price: for the wider class a positive key rate requires, in general, apart from the one-way Devetak-Winter protocol (used in [1]) also the recurrence preprocessing and thus effectively is a two-way protocol. We also analyze the amount of noise that can be admixtured to the states of our class without losing key distillability property which may be crucial for experimental realization. The wider class contains key-distillable states with higher entropy (up to 3.524, as opposed to 2.564 for the class in [1]).

quant-ph↗