arXiv subjects

Fereshte Shahbeigi

Publications and source records attributed to Fereshte Shahbeigi.

12 recordsLinked to original sources

arXiv2025

A hierarchy of thermodynamically consistent quantum operations

In order to determine what quantum operations and measurements are consistent with the laws of thermodynamics, one must start by allowing all processes allowed by the framework of quantum theory, and then impose the laws of thermodynamics as a set of constraints. Here, we consider a hierarchy of quantum operations and measurements that are consistent with ($I$) the weak third law, ($II$) the strong third law, and ($III$) both the second and the third laws of thermodynamics, i.e., operations and measurements that are fully consistent with thermodynamics. Such characterisation allows us to identify which particular thermodynamic principle is responsible for the (un)attainability of a given quantum operation or measurement. In the case of channels, i.e., trace-preserving operations, we show that a channel belongs to ($I$) and ($II$) if and only if it is strictly positive and rank non-decreasing, respectively, whereas a channel belongs to ($III$) only if it is rank non-decreasing and does not perturb a strictly positive state. On the other hand, while thermodynamics does not preclude the measurability of any POVM, the realisable state-update rules for measurements are increasingly restricted as we go from ($I$) to ($III$).

quant-ph↗

arXiv2024

Generating Sets of Stochastic Matrices

This paper introduces the concept of a generating set for stochastic matrices -- a subset of matrices whose repeated composition generates the entire set. Understanding such generating sets requires specifying the "indivisible elements" and "building blocks" within the set, which serve as fundamental components of the generation process. Expanding upon prior studies, we develop a framework that formalizes divisibility in the context of stochastic matrices. We provide a sufficient condition for divisibility that is shown to be necessary in dimension $n=3$, while for $n=2$, all stochastic matrices are shown to be divisible. Using these results, we construct generating sets for dimensions 2 and 3 by specifying the indivisible elements, and, importantly, we give an upper bound for the number of factors required from the generating set to produce the entire semigroup.

math.RA↗

arXiv2024

Channel nonlocality under decoherence

The implementation of realistic quantum devices requires a solid understanding of the nonlocal resources present in quantum channels, and the effects of decoherence on them. Here we quantify nonlocality of bipartite quantum channels and identify its component resisting the effects of dephasing noise. Despite its classical nature, we demonstrate that the latter plays a relevant role in performing quantum protocols, such as state transformations and quantum coding for noisy communication. In the converse direction, we show that simulating certain stochastic processes with quantum channels undergoing decoherence has a communication advantage with respect to their classical simulation.

quant-ph↗

arXiv2024

Quantum-embeddable stochastic matrices

The classical embeddability problem asks whether a given stochastic matrix $T$, describing transition probabilities of a $d$-level system, can arise from the underlying homogeneous continuous-time Markov process. Here, we investigate the quantum version of this problem, asking of the existence of a Markovian quantum channel generating state transitions described by a given $T$. More precisely, we aim at characterising the set of quantum-embeddable stochastic matrices that arise from memoryless continuous-time quantum evolution. To this end, we derive both upper and lower bounds on that set, providing new families of stochastic matrices that are quantum-embeddable but not classically-embeddable, as well as families of stochastic matrices that are not quantum-embeddable. As a result, we demonstrate that a larger set of transition matrices can be explained by memoryless models if the dynamics is allowed to be quantum, but we also identify a non-zero measure set of random processes that cannot be explained by either classical or quantum memoryless dynamics. Finally, we fully characterise extreme stochastic matrices (with entries given only by zeros and ones) that are quantum-embeddable.

quant-ph↗

arXiv2024

Certifying nonlocal properties of noisy quantum operations

Certifying quantum properties from the probability distributions they induce is an important task for several purposes. While this framework has been largely explored and used for quantum states, its extrapolation to the level of channels started recently in a variety of approaches. In particular, little is known about to what extent noise can spoil certification methods for channels. In this work we provide a unified methodology to certify nonlocal properties of quantum channels from the correlations obtained in prepare-and-measurement protocols: our approach gathers fully and semi-device-independent existing methods for this purpose, and extends them to new certification criteria. In addition, the effect of different models of dephasing noise is analysed. Some noise models are shown to generate nonlocality and entanglement in special cases. In the extreme case of complete dephasing, the measurement protocols discussed yield particularly simple tests to certify nonlocality, which can be obtained from known criteria by fixing the dephasing basis. These are based on the relations between bipartite quantum channels and their classical analogues: bipartite stochastic matrices defining conditional distributions.

quant-ph↗

arXiv2024

Dephasing Noise Simulation for Coherence-Generating Devices

Advancing quantum technologies necessitates an in-depth exploration of how operations generate quantum resources and respond to noise. Crucial are gates generating quantum coherence and the challenge of mitigating gate dephasing noise. Precisely, we study the dephasing noise that reduces the coherence-generating power of quantum gates, its simulation, and critical factors. Our primary contribution lies in a theorem characterizing the full set of dephasing noises in gates, adaptable to the simulation by any predefined operation set. In particular, we apply our result to quantify the memory adaptability required for a dephasing noise to arise. Furthermore, we analytically calculate the quantifier for gates acting on qubit systems, thereby fully characterizing this scenario. Next, we show how our results reveal the structure of non-trivial dephasing noise affecting qubit gates and apply them to experimental data, conclusively demonstrating the existence of a gate's dephasing noise, which is irreducible to dephasing of either input or output states. Finally, we show how our study contributes to addressing an open question in the resource theory of coherence generation.

quant-ph↗

arXiv2024

Measurement sharpness and disturbance tradeoff

Obtaining information from a quantum system through a measurement typically disturbs its state. The postmeasurement states for a given measurement, however, are not unique and highly rely on the chosen measurement model, complicating the puzzle of information-disturbance. Two distinct questions are then in order. Firstly, what is the minimum disturbance a measurement may induce? Secondly, when a fixed disturbance occurs, how informative is the possible measurement in the best-case scenario? Here, we propose various approaches to tackle these questions and provide explicit solutions for the set of unbiased binary qubit measurements and postmeasurement state spaces that are equivalent to the image of a unital qubit channel. In particular, we show there are different tradeoff relations between the sharpness of this measurement and the average fidelity of the premeasurement and postmeasurement state spaces as well as the sharpness and quantum resources preserved in the postmeasurement states in terms of coherence and discord-like correlation once the measurement is applied locally.

quant-ph↗

arXiv2022

Accessible maps in a group of classical or quantum channels

We study the problem of accessibility in a set of classical and quantum channels admitting a group structure. Group properties of the set of channels, and the structure of the closure of the analyzed group $G$ plays a pivotal role in this regard. The set of all convex combinations of the group elements contains a subset of channels that are accessible by a dynamical semigroup. We demonstrate that accessible channels are determined by probability vectors of weights of a convex combination of the group elements, which depend neither on the dimension of the space on which the channels act, nor on the specific representation of the group. Investigating geometric properties of the set $\mathcal{A}$ of accessible maps we show that this set is non-convex, but it enjoys the star-shape property with respect to the uniform mixture of all elements of the group. We demonstrate that the set $\mathcal{A}$ covers a positive volume in the polytope of all convex combinations of the elements of the group.

quant-ph↗

arXiv2022

Simulating of X-states and the two-qubit XYZ Heisenberg system on IBM quantum computer

Two qubit density matrices, which are of X-shape, are a natural generalization of Bell Diagonal States (BDSs) recently simulated on the IBM quantum device. We generalize the previous results and propose a quantum circuit for simulation of a general two qubit X-state, implement it on the same quantum device, and study its entanglement for several values of the extended parameter space. We also show that their X-shape is approximately robust against noisy quantum gates. To further physically motivate this study, we invoke the two-spin Heisenberg XYZ system and show that for a wide class of initial states, it leads to dynamical density matrices which are X-states. Due to the symmetries of this Hamiltonian, we show that by only two qubits, one can simulate the dynamics of this system on the IBM quantum computer.

quant-ph↗

arXiv2021

Quasi-inversion of quantum and classical channels in finite dimensions

We introduce the concept of quasi-inverse of quantum and classical channels, prove general properties of these inverses and determine them for a large class of channels acting in an arbitrary finite dimension. Therefore we extend the previous results of [1] to arbitrary dimensional channels and to the classical domain. We demonstrate how application of the proposed scheme can increase on the average the fidelity between a given random pure state and its image transformed by the quantum channel followed by its quasi-inversion.

quant-ph↗

arXiv2020

Log-Convex set of Lindblad semigroups acting on $N$-level system

We analyze the set ${\cal A}_N^Q$ of mixed unitary channels represented in the Weyl basis and accessible by a Lindblad semigroup acting on an $N$-level quantum system. General necessary and sufficient conditions for a mixed Weyl quantum channel of an arbitrary dimension to be accessible by a semigroup are established. The set ${\cal A}_N^Q$ is shown to be log--convex and star-shaped with respect to the completely depolarizing channel. A decoherence supermap acting in the space of Lindblad operators transforms them into the space of Kolmogorov generators of classical semigroups. We show that for mixed Weyl channels the hyper-decoherence commutes with the dynamics, so that decohering a quantum accessible channel we obtain a bistochastic matrix form the set ${\cal A}_N^C$ of classical maps accessible by a semigroup. Focusing on $3$-level systems we investigate the geometry of the sets of quantum accessible maps, its classical counterpart and the support of their spectra. We demonstrate that the set ${\cal A}_3^Q$ is not included in the set ${\cal U}^Q_3$ of quantum unistochastic channels, although an analogous relation holds for $N=2$. The set of transition matrices obtained by hyper-decoherence of unistochastic channels of order $N\ge 3$ is shown to be larger than the set of unistochastic matrices of this order, and yields a motivation to introduce the larger sets of $k$-unistochastic matrices.

quant-ph↗

arXiv2018

Quantumness of quantum channels

Quantum coherence is a fundamental aspect of quantum physics and plays a central role in quantum information science. This essential property of the quantum states could be fragile under the influence of the quantum operations. The extent to which quantum coherence is diminished depends both on the channel and the incoherent basis. Motivated by this, we propose a measure of nonclassicality of a quantum channel as the average quantum coherence of the state space after the channel acts on, minimized over all orthonormal basis sets of the state space. Utilizing the squared $l_1$-norm of coherence for the qubit channels, the minimization can be treated analytically and the proposed measure takes a closed form of expression. If we allow the channels to act locally on a maximally entangled state, the quantum correlation is diminished making the states more classical. We show that the extent to which quantum correlation is preserved under local action of the channel cannot exceed the quantumness of the underlying channel. We further apply our measure to the quantum teleportation protocol and show that a nonzero quantumness for the underlying channel provides a necessary condition to overcome the best classical protocols.

quant-ph↗