activity
20152020
most citedAn Invitation to Quantum Channels

31 citations · 55 across the 7 of their papers we have counts for

collaborators
Showing quant-phShow all

10 papers · 1 filter

quant-ph2020

Initial entanglement, entangling unitaries, and completely positive maps

Vinayak Jagadish, R. Srikanth, Francesco Petruccione

The problem of conditions on the initial correlations between the system and the environment that lead to completely positive (CP) or not-completely positive (NCP) maps has been st…

quant-ph20203 cited

Compressed Sensing Tomography for qudits in Hilbert spaces of non-power-of-two dimensions

Revanth Badveli, Vinayak Jagadish, R. Srikanth +1

The techniques of low-rank matrix recovery were adapted for Quantum State Tomography (QST) previously by D. Gross et al. [Phys. Rev. Lett. 105, 150401 (2010)], where they consider…

quant-ph2020

Dynamics of quantum correlations in a Qubit-Oscillator system interacting via a dissipative bath

Revanth Badveli, Vinayak Jagadish, S. Akshaya +2

The entanglement dynamics in a bipartite system consisting of a qubit and a harmonic oscillator interacting only through their coupling with the same bath is studied. The considere…

quant-ph2019

Convex combinations of CP-divisible Pauli channels that are not semigroups

Vinayak Jagadish, R. Srikanth, Francesco Petruccione

We study the memory property of the channels obtained by convex combinations of Markovian channels that are not necessarily quantum dynamical semigroups (QDSs). In particular, we c…

quant-ph2019

Convex Combinations of Pauli Semigroups: Geometry, Measure and an Application

Vinayak Jagadish, R. Srikanth, Francesco Petruccione

Finite-time Markovian channels, unlike their infinitesimal counterparts, do not form a convex set. As a particular instance of this observation, we consider the problem of mixing t…

quant-ph20199 cited

Measure of not-completely-positive qubit maps: the general case

Vinayak Jagadish, R. Srikanth, Francesco Petruccione

We show that the set of not-completely-positive (NCP) maps is unbounded, unless further assumptions are made. This is done by first proposing a reasonable definition of a valid NCP…