arXiv subjects

Michał Studziński

Publications and source records attributed to Michał Studziński.

At least 37 records · Page 2Linked to original sources

arXiv2024

Positive maps from the walled Brauer algebra

We present positive maps and matrix inequalities for variables from the positive cone. These inequalities contain partial transpose and reshuffling operations, and can be understood as positive multilinear maps that are in one-to-one correspondence with elements from the walled Brauer algebra. Using our formalism, these maps can be obtained in a systematic and clear way by manipulating partially transposed permutation operators under a partial trace. Additionally, these maps are reasonably easy in construction by combining an algorithmic approach with graphical calculus.

quant-ph↗

arXiv2023

Minimal Port-based Teleportation

There are two types of port-based teleportation (PBT) protocols: deterministic -- when the state always arrives to the receiver but is imperfectly transmitted and probabilistic -- when the state reaches the receiver intact with high probability. We introduce the minimal set of requirements that define a feasible PBT protocol and construct a simple PBT protocol that satisfies these requirements: it teleports an unknown state of a qubit with success probability $p_{succ}=1-\frac{N+2}{2^{N+1}}$ and fidelity $1-O(\frac{1}{N})$ with the resource state consisting of $N$ maximally entangled states. This protocol is not reducible from either the deterministic or probabilistic PBT protocol. We define the corresponding efficient superdense coding protocols which transmit more classical bits with fewer maximally entangled states. Furthermore, we introduce rigorous methods for comparing and converting between different PBT protocols.

quant-ph↗

arXiv2023

Two instances of random access code in the quantum regime

We consider two classes of quantum generalisations of Random Access Code (RAC) and study lower bounds for probabilities of success for such tasks. It provides a useful framework for the study of certain information processing tasks with constrained resources. The first class is based on a random access code with quantum inputs and output known as No-Signalling Quantum RAC (NS-QRAC) [A. Grudka et al. Phys. Rev. A 92, 052312 (2015)], where unbounded entanglement and constrained classical communication are allowed, which can be seen as quantum teleportation with constrained classical communication, for which we provide a quantum lower bound. We consider two modifications to the NS-QRAC scenario, first where unbounded entanglement and constrained quantum communication is allowed and, second where bounded entanglement and unconstrained classical communication are allowed, where we find a monogamy relation for the transmission fidelities, which -- in contrast to the usual communication schemes -- involves multiple senders and a single receiver. We provide lower bounds for these scenarios. The second class is based on a random access code with a quantum channel and shared entanglement [A. Tavakoli et al. PRX Quantum 2 (4) 040357 (2021)]. We study the set of tasks where two inputs made of two digits of $d$-base are encoded over a qudit and a maximally entangled state, which can be seen as quantum dense coding with constrained quantum communication, for which we provide quantum lower bounds for $d=2,3,4$. The encoding employed utilises Gray codes.

quant-ph↗

arXiv2022

Enhancing phase-covariant channel performance with non-unitality

We analyze quantum communication properties of phase-covariant channels depending on their degree of non-unitality. In particular, we derive analytical formulas for minimal and maximal channel fidelity on pure states and maximal output purity. Next, we introduce a measure of non-unitality and show how to manipulate between unital and maximally non-unital maps by considering classical mixtures of quantum channels. Finally, we prove that maximal fidelity and maximal output purity increase with non-unitality and present several examples. Interestingly, non-unitality can also prolong quantum entanglement and lead to its rebirth.

quant-ph↗

arXiv2022

Efficient multi port-based teleportation schemes

In this manuscript we analyse generalised port-based teleportation (PBT) schemes, allowing for transmitting more than one unknown quantum state (or a composite quantum state) in one go, where the state ends up in several ports at Bob's side. We investigate the efficiency of our scheme discussing both deterministic and probabilistic case, where parties share maximally entangled states. It turns out that the new scheme gives better performance than various variants of the optimal PBT protocol used for the same task. All the results are presented in group-theoretic manner depending on such quantities like dimensions and multiplicities of irreducible representations in the Schur-Weyl duality. The presented analysis was possible by considering the algebra of permutation operators acting on n systems distorted by the action of partial transposition acting on more than one subsystem. Considering its action on the n-fold tensor product of the Hilbert space with finite dimension, we present construction of the respective irreducible matrix representations, which are in fact matrix irreducible representations of the Walled Brauer Algebra. I turns out that the introduced formalism, and symmetries beneath it, appears in many aspects of theoretical physics and mathematics - theory of anti ferromagnetism, aspects of gravity theory or in the problem of designing quantum circuits for special task like for example inverting an unknown unitary.

quant-ph↗

arXiv2022

Square-root measurements and degradation of the resource state in port-based teleportation scheme

Port-based teleportation (PBT) is a protocol of quantum teleportation in which a receiver does not have to apply correction to the transmitted state. In this protocol two spatially separated parties can teleport an unknown quantum state only by exploiting joint measurements on number of shared $d-$dimensional maximally entangled states (resource state) together with a state to be teleported and one way classical communication. In this paper we analyse for the first time the recycling protocol for the deterministic PBT beyond the qubit case. In the recycling protocol the main idea is to re-use the remaining resource state after one or many rounds of PBT for further processes of teleportation. The key property is to learn how much the underlying resource state degrades after every round of the teleportation process. We measure this by evaluating quantum fidelity between respective resource states. To do so we first present analysis of the square-root measurements used by the sender in PBT by exploiting the symmetries of the system. In particular, we show how to effectively evaluate their square-roots and composition. These findings allow us to present the explicit formula for the recycling fidelity involving only group-theoretic parameters describing irreducible representations in the Schur-Weyl duality. For the first time, we also analyse the degradation of the resource state for the optimal PBT scheme and show its degradation for all $d\geq 2$. In the both versions, the qubit case is discussed separately resulting in compact expression for fidelity, depending only on the number of shared entangled pairs.

quant-ph↗

arXiv2022

Upper bounds on the leakage of private data and operational approach to markovianity

We quantify the consequences of a private key leakage and private randomness generated during quantum key distribution. We provide simple lower bounds on the one-way distillable key after the leakage has been detected. We also show that the distributed private randomness does not drop by more than twice the number of qubits of the traced-out system. We further focus on irreducible private states, showing that their two-way distillable key is non-lockable. We then strengthen this result by referring to the idea of recovery maps. We further consider the action of special case of side-channels on some of the private states. Finally, we connect the topic of (non)markovian dynamics with that of hacking. In particular, we show that an invertible map is non-CP-divisible if and only if there exists a state whose the key witnessed by a particular privacy witness increases in time. This complements the recent result of J. Kolodyński et al. [Phys. Rev. A 101, 020303(R) (2020)] where the log-negativity was connected with the (non)markovianity of the dynamics.

quant-ph↗

arXiv2021

Multiport based teleportation -- transmission of a large amount of quantum information

We analyse the problem of transmitting a number of unknown quantum states or one composite system in one go. We derive a lower bound on the performance of such process, measured in the entanglement fidelity. The obtained bound is effectively computable and outperforms the explicit values of the entanglement fidelity calculated for the pre-existing variants of the port-based protocols, allowing for teleportation of a much larger amount of quantum information. The comparison with the exact formulas and similar analysis for the probabilistic scheme is also discussed. In particular, we present the closed-form expressions for the entanglement fidelity and for the probability of success in the probabilistic scheme in the qubit case in the picture of the spin angular momentum.

quant-ph↗

arXiv2021

Optimal Multi-port-based Teleportation Schemes

In this paper, we introduce optimal versions of a multi-port based teleportation scheme allowing to send a large amount of quantum information. We fully characterise probabilistic and deterministic case by presenting expressions for the average probability of success and entanglement fidelity. In the probabilistic case, the final expression depends only on global parameters describing the problem, such as the number of ports $N$, the number of teleported systems $k$, and local dimension $d$. It allows us to show square improvement in the number of ports with respect to the non-optimal case. We also show that the number of teleported systems can grow when the number $N$ of ports increases as $o(N)$ still giving high efficiency. In the deterministic case, we connect entanglement fidelity with the maximal eigenvalue of a generalised teleportation matrix. In both cases the optimal set of measurements and the optimal state shared between sender and receiver is presented. All the results are obtained by formulating and solving primal and dual SDP problems, which due to existing symmetries can be solved analytically. We use extensively tools from representation theory and formulate new results that could be of the separate interest for the potential readers.

quant-ph↗

arXiv2021

Efficient classical simulation and benchmarking of quantum processes in the Weyl basis

One of the crucial steps in building a scalable quantum computer is to identify the noise sources which lead to errors in the process of quantum evolution. Different implementations come with multiple hardware-dependent sources of noise and decoherence making the problem of their detection manyfoldly more complex. We develop a randomized benchmarking algorithm which uses Weyl unitaries to efficiently identify and learn a mixture of error models which occur during the computation. We provide an efficiently computable estimate of the overhead required to compute expectation values on outputs of the noisy circuit relying only on locality of the interactions and no further assumptions on the circuit structure. The overhead decreases with the noise rate and this enables us to compute analytic noise bounds that imply efficient classical simulability. We apply our methods to ansatz circuits that appear in the Variational Quantum Eigensolver and establish an upper bound on classical simulation complexity as a function of noise, identifying regimes when they become classically efficiently simulatable.

quant-ph↗

arXiv2020

Positive Maps From Irreducibly Covariant Operators

In this paper, we discuss positive maps induced by (irreducibly) covariant linear operators for finite groups. The application of group theory methods allows deriving some new results of a different kind. In particular, a family of necessary conditions for positivity, for such objects is derived, stemming either from the definition of a positive map or the novel method inspired by the inverse reduction map. In the low-dimensional cases, for the permutation group $S(3)$ and the quaternion group $Q$, the necessary and sufficient conditions are given, together with the discussion on their decomposability. In higher dimensions, we present positive maps induced by a three-dimensional irreducible representation of the permutation group $S(4)$ and $d$-dimensional representation of the monomial unitary group $MU(d)$. In the latter case, we deliver if and only if condition for the positivity and compare the results with the method inspired by the inverse reduction. We show that the generalised Choi map can be obtained by considered covariant maps induced by the monomial unitary group. As an additional result, a novel interpretation of the Fujiwara-Algolet conditions for positivity and complete positivity is presented. Finally, in the end, a new form of an irreducible representation of the symmetric group $S(n)$ is constructed, allowing us to simplify the form of certain Choi-Jamiołkowski images derived for irreducible representations of the symmetric group.

quant-ph↗

arXiv2020

Limitations for private randomness repeaters

Cryptographic protocols are often based on the two main resources: private randomness and private key. In this paper, we develop a relationship between these two resources. First, we show that any state containing perfect, directly accessible, private key (a private state) is a particular case of the state containing perfect, directly accessible, private randomness (an independent state). We then demonstrate a fundamental limitation on the possibility of transferring the privacy of random bits in quantum networks with an intermediate repeater station. More precisely, we provide an upper bound on the rate of repeated randomness in this scenario, similar to the one derived for private key repeaters. This bound holds for states with positive partial transposition. We further demonstrate the power of this upper bound by showing a gap between the localisable and the repeated private randomness for separable Werner states. In the case of restricted class of operations, we provide also a bound on repeated randomness which holds for arbitrary states.

quant-ph↗

arXiv2019

Quantum error correction codes and absolutely maximally entangled states

For every stabiliser $N$-qudit absolutely maximally entangled state, we present a method for determining the stabiliser generators and logical operators of a corresponding quantum error correction code. These codes encode $k$ qudits into $N-k$ qudits, with $k\leq \left \lfloor{N/2} \right \rfloor$, where the local dimension $d$ is prime. We use these methods to analyse the concatenation of such quantum codes and link this procedure to entanglement swapping. Using our techniques, we investigate the spread of quantum information on a tensor network code formerly used as a toy model for the AdS/CFT correspondence. In this network, we show how corrections arise to the Ryu-Takayanagi formula in the case of entangled input state, and that the bound on the entanglement entropy of the boundary state is saturated for absolutely maximally entangled input states.

quant-ph↗

arXiv2019

A Class of PPT Entangled States Arbitrary Far From Separable States

In this paper we show an explicit construction of multipartite class of entangled states with the PPT (Positive Partial Transposition) property in every cut. We investigate properties of this class of states focusing on the trace distance from the set of separable states. We provide an explicit sub-class of the multipartite entangled PPT states which are arbitrary far from the set of separable states. We argue, that in the multipartite case the mentioned distance increases with dimension of the local Hilbert space. In our construction is we do not have to use many copies of initial state living on the smaller space to boost the trace distance as in the previous attempts to this problem.

quant-ph↗

arXiv2018

Simplified formalism of the algebra of partially transposed permutation operators with applications

Hereunder we continue the study of the representation theory of the algebra of permutation operators acting on the $n$-fold tensor product space, partially transposed on the last subsystem. We develop the concept of partially reduced irreducible representations, which allows to simplify significantly previously proved theorems and what is the most important derive new results for irreducible representations of the mentioned algebra. In our analysis we are able to reduce complexity of the central expressions by getting rid of sums over all permutations from symmetric group obtaining equations which are much more handy in practical applications. We also find relatively simple matrix representations for the generators of underlying algebra. Obtained simplifications and developments are applied to derive characteristic of the deterministic port-based teleportation scheme written purely in terms of irreducible representations of the studied algebra. We solve an eigenproblem for generators of algebra which is the first step towards to hybrid port-based teleportation scheme and gives us new proofs of asymptotic behaviour of teleportation fidelity. We also show connection between density operator characterising port-based teleportation and particular matrix composed of irreducible representation of the symmetric group which encodes properties of the investigated algebra.

quant-ph↗

arXiv2017

Port-based teleportation in arbitrary dimension

Port-based teleportation (PBT), introduced in 2008, is a type of quantum teleportation protocol which transmits the state to the receiver without requiring any corrections on the receiver's side. Evaluating the performance of PBT was computationally intractable and previous attempts succeeded only with small systems. We study PBT protocols and fully characterize their performance for arbitrary dimensions and number of ports. We develop new mathematical tools to study the symmetries of the measurement operators that arise in these protocols and belong to the algebra of partially transposed permutation operators. First, we develop the representation theory of the mentioned algebra which provides an elegant way of understanding the properties of subsystems of a large system with general symmetries. In particular, we introduce the theory of the partially reduced irreducible representations which we use to obtain a simpler representation of the algebra of partially transposed permutation operators and thus explicitly determine the properties of any PBT scheme for fixed dimension in polynomial time.

quant-ph↗

arXiv2017

Optimal Port-based Teleportation

Deterministic port-based teleportation (dPBT) protocol is a scheme where a quantum state is guaranteed to be transferred to another system without unitary correction. We characterize the best achievable performance of the dPBT when both the resource state and the measurement is optimized. Surprisingly, the best possible fidelity for an arbitrary number of ports and dimension of the teleported state is given by the largest eigenvalue of a particular matrix -- Teleportation Matrix. It encodes the relationship between a certain set of Young diagrams and emerges as the the optimal solution to the relevant semidefinite program.

quant-ph↗

arXiv2017

Structure of irreducibly covariant quantum channels for finite groups

We obtain an explicit characterization of linear maps, in particular, quantum channels, which are covariant with respect to an irreducible representation ($U$) of a finite group ($G$), whenever $U \otimes U^c$ is simply reducible (with $U^c$ being the contragradient representation). Using the theory of group representations, we obtain the spectral decomposition of any such linear map. The eigenvalues and orthogonal projections arising in this decomposition are expressed entirely in terms of representation characteristics of the group $G$. This in turn yields necessary and sufficient conditions on the eigenvalues of any such linear map for it to be a quantum channel. We also obtain a wide class of quantum channels which are irreducibly covariant by construction. For two-dimensional irrreducible representations of the symmetric group $S(3)$, and the quaternion group $Q$, we also characterize quantum channels which are both irreducibly covariant and entanglement breaking.

quant-ph↗