SSSatvik Singh

Satvik Singh

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Satvik Singh has a total of 13 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Information Storage and Transmission under Markovian Noise

    by Satvik Singh, Nilanjana Datta

    We study the information transmission capacities of quantum Markov semigroups acting on finite-dimensional quantum systems. We show that, in the limit of infinite time, the capacities can be efficiently computed in terms of the structure of the peripheral space of the semigroup, are strongly additive, and satisfy the strong converse property. We also establish convergence bounds to show that the infinite-time capacities are reached after time scaling quadratically with the system dimension. From a data storage perspective, our analysis provides tight bounds on the number of bits or qubits that can be reliably stored for long times in a quantum memory experiencing Markovian noise. From a practical standpoint, we show that typically, a quantum memory with Markovian noise acting independently and identically on all qubits and a fixed time-independent global error correction mechanism becomes useless for storage after time scaling exponentially with the number of qubits. In contrast, if the error correction is local, the memory becomes useless much more quickly, i.e., after time scaling logarithmically with the number of qubits. In the setting of point-to-point communication between two spatially separated parties, our analysis provides efficiently computable bounds on the optimal rate at which bits or qubits can be reliably transmitted via long Markovian communication channels, both in the finite block-length and asymptotic regimes.


  • Entanglement in cyclic sign invariant quantum states

    by Aabhas Gulati, Ion Nechita, Satvik Singh

    We introduce and study bipartite quantum states that are invariant under the local action of the cyclic sign group. Due to symmetry, these states are sparse and can be parameterized by a triple of vectors. Their important semi-definite properties, such as positivity and positivity under partial transpose (PPT), can be simply characterized in terms of these vectors and their discrete Fourier transforms. We study in detail the entanglement properties of this family of symmetric states, showing that it contains PPT entangled states. For states that are diagonal in the Dicke basis, deciding separability is equivalent to a circulant version of the complete positivity problem. In local dimension d ≤ 5, we completely characterize these sets and construct entanglement witnesses; some partial results are also obtained for d = 6, 7. We construct a new family of states for which the properties of PPT and separability can be characterized for all dimensions, generalizing results from from the literature. Our results show that these states have a rich entanglement structure, even in the bosonic subspace.


  • Simultaneous Superadditivity of the Direct and Complementary Channel Capacities

    by Satvik Singh, Sergii Strelchuk

    Quantum communication channels differ from their classical counterparts because their capacities can be superadditive. The principle of monogamy of entanglement suggests that superadditive improvements in the transmission capacity of a channel should reduce the amount of information loss to the environment. We challenge this intuition by demonstrating that the coherent and private information of a channel and its complement can be simultaneously superadditive for arbitrarily many channel uses. To quantify the limits of this effect, we consider the notion of max (resp. total) private information of a channel, which represents the maximum (resp. sum) of the private information of the channel itself and its complement, and study its relationship with the coherent information of the individual direct and complementary channels. We show that these quantities can obey different interleaving sequences of inequalities for a varying number of channel uses.


  • Open Access

    Ergodic theory of diagonal orthogonal covariant quantum channels

    by Satvik Singh, Nilanjana Datta, Ion Nechita

    We analyse the ergodic properties of quantum channels that are covariant with respect to diagonal orthogonal transformations. We prove that the ergodic behaviour of a channel in this class is essentially governed by a classical stochastic matrix. This allows us to exploit tools from classical ergodic theory to study quantum ergodicity of such channels. As an application of our analysis, we study dual unitary brickwork circuits which have recently been proposed as minimal models of quantum chaos in many-body systems. Upon imposing a local diagonal orthogonal invariance symmetry on these circuits, the long-term behaviour of spatio-temporal correlations between local observables in such circuits is completely determined by the ergodic properties of a channel that is covariant under diagonal orthogonal transformations. We utilize this fact to show that such symmetric dual unitary circuits exhibit a rich variety of ergodic behaviours, thus emphasizing their importance.


  • Fully Undistillable Quantum States Are Separable

    by Satvik Singh, Nilanjana Datta

    Assume that Alice, Bob, and Charlie share a tripartite pure state |ψ ABC ⟩. We prove that if Alice cannot distill entanglement with either Bob or Charlie using |ψ ABC ⟩ and local operations with any one of the following configurations for classical communication: ( A → B , A ↔ C ), ( A ↔ B , A → C ), and ( A ↔ B , A ↔ C ), then the same is also true for the other two configurations. Moreover, this happens precisely when the state is such that both its reductions on systems AB and AC are separable, which is further equivalent to the reductions being PPT. This, in particular, implies that any NPT bipartite state is such that either the state itself or its complement is 2-way distillable. In proving these results, we first obtain an explicit lower bound on the 2-way distillable entanglement of low rank bipartite states. Furthermore, we show that even though not all low rank states are 1-way distillable, a randomly sampled low rank state will almost surely be 1-way distillable.


  • Open Access

    Bi-PPT channels are entanglement breaking

    by Alexander Müller-Hermes, Satvik Singh

    In a recent paper, Hirche and Leditzky introduced the notion of bi-PPT channels which are quantum channels that stay completely positive under composition with a transposition and such that the same property holds for one of their complementary channels. They asked whether there are examples of such channels that are not antidegradable. We show that this is not the case, since bi-PPT channels are always entanglement breaking. We also show that degradable quantum channels staying completely positive under composition with a transposition are entanglement breaking.

  • Open Access

    Fully undistillable quantum states are separable

    by Satvik Singh, Nilanjana Datta

    Assume that Alice, Bob, and Charlie share a tripartite pure state $|\psi_{ABC}\rangle$. We prove that if Alice cannot distill entanglement with either Bob or Charlie using $|\psi_{ABC}\rangle$ and local operations with any one of the following configurations for classical communication: $(A\to B, A\leftrightarrow C), (A\leftrightarrow B, A\to C),$ and $(A\leftrightarrow B, A\leftrightarrow C)$, then the same is also true for the other two configurations. Moreover, this happens precisely when the state is such that both its reductions $\rho_{AB}$ and $\rho_{AC}$ are separable, which is further equivalent to the reductions being PPT. This, in particular, implies that any NPT bipartite state is such that either the state itself or its complement is 2-way distillable. In proving these results, we first obtain an explicit lower bound on the 2-way distillable entanglement of low rank bipartite states. Furthermore, we show that even though not all low rank states are 1-way distillable, a randomly sampled low rank state will almost surely be 1-way distillable.

  • A Brief Discourse on Hausdorff Dimension and Self-similarity

    by Satvik Singh

    One often distinguishes between a line and a plane by saying that the former is one-dimensional while the latter is two-dimensional. But, what does it mean for an object to have d dimensions? Can we define a consistent notion of dimension rigorously for arbitrary objects, say a snowflake, perhaps? And must the dimension always be integer-valued? After highlighting some crucial problems that one encounters while defining a sensible notion of dimension for a certain class of objects, we attempt to answer the above questions by exploring the concept of Hausdorff dimension—a remarkable method of assigning dimension to subsets of arbitrary metric spaces. In order to properly formulate the definition and properties of the Hausdorff dimension, we review the critical measure-theoretic terminology beforehand. Finally, we discuss the notion of self-similarity and show how it often defies our quotidian intuition that dimension must always be integer-valued.


  • Open Access

    Merging Bioactivity Predictions from Cell Morphology and Chemical Fingerprint Models Using Similarity to Training Data

    by Srijit Seal, Hongbin Yang, Maria-Anna Trapotsi, Satvik Singh, Jordi Carreras-Puigvert, Ola Spjuth, Andreas Bender

    The applicability domain of machine learning models trained on structural fingerprints for the prediction of biological endpoints is often limited by the lack of diversity of chemical space of the training data. In this work, we developed similarity-based merger models which combined the outputs of individual models trained on cell morphology (based on Cell Painting) and chemical structure (based on chemical fingerprints) and the structural and morphological similarities of the compounds in the test dataset to compounds in the training dataset. We applied these similarity-based merger models using logistic regression models on the predictions and similarities as features and predicted assay hit calls of 177 assays from ChEMBL, PubChem and the Broad Institute (where the required Cell Painting annotations were available). We found that the similarity-based merger models outperformed other models with an additional 20% assays (79 out of 177 assays) with an AUC>0.70 compared with 65 out of 177 assays using structural models and 50 out of 177 assays using Cell Painting models. Our results demonstrated that similarity-based merger models combining structure and cell morphology models can more accurately predict a wide range of biological assay outcomes and further expanded the applicability domain by better extrapolating to new structural and morphology spaces. Abstract Figure: Figure: For TOC Only


  • Open Access

    Coherent information of a quantum channel or its complement is generically positive

    by Satvik Singh, Nilanjana Datta

    The task of determining whether a given quantum channel has positive capacity to transmit quantum information is a fundamental open problem in quantum information theory. In general, the coherent information needs to be computed for an unbounded number of copies of a channel in order to detect a positive value of its quantum capacity. However, in this Letter, we show that the coherent information of a single copy of a randomly selected channel is positive almost surely if the channel's output space is larger than its environment. Hence, in this case, a single copy of the channel typically suffices to determine positivity of its quantum capacity. Put differently, channels with zero coherent information have measure zero in the subset of channels for which the output space is larger than the environment. On the other hand, if the environment is larger than the channel's output space, identical results hold for the channel's complement.