Related papers: Virtual Quantum Markov Chain of four-qubit systems
Invertible local transformations of a multipartite system are used to define equivalence classes in the set of entangled states. This classification concerns the entanglement properties of a single copy of the state. Accordingly, we say…
We report the implementation of Grover's quantum search algorithm in the scalable system of trapped atomic ion quantum bits. Any one of four possible states of a two-qubit memory is marked, and following a single query of the search space,…
We consider a partial trace transformation which maps a multipartite quantum state to collection of local density matrices. We call this collection a mean field state. The necessary and sufficient conditions under which a mean field state…
Quantum Markov chains (QMCs) are positive maps on a trace-class space describing open quantum dynamics on graphs. Such objects have a statistical resemblance with classical random walks, while at the same time it allows for internal…
In this paper, an intuitive mathematical formulation is provided to generalize the residual entanglement for tripartite systems of qubits (Phys. Rev. A \textbf{61}, 052306 (2000)) to the tripartite systems in higher dimension. The spirit…
Verification of infinite-state Markov chains is still a challenge despite several fruitful numerical or statistical approaches. For decisive Markov chains, there is a simple numerical algorithm that frames the reachability probability as…
The Markov gap, defined as the difference between reflected entropy and mutual information, serves as a diagnostic for quantum recoverability and multipartite entanglement. In holographic settings, it admits a geometric interpretation as…
In this paper, an intuitive mathematical formulation is provided to generalize the residual entanglement for tripartite systems of qubits [Phys. Rev. A 61, 052306 (2000)] to the tripartite systems in higher dimension. The spirit lies in the…
Multivariate (MTV) porous materials exhibit unique structural complexities based on diverse spatial arrangements of multiple building block combinations. These materials possess potential synergistic functionalities that exceed the sum of…
In this paper, we develop an in-depth analysis of non-reversible Markov chains on denumerable state space from a similarity orbit perspective. In particular, we study the class of Markov chains whose transition kernel is in the similarity…
In this paper we present several multipartite quantum systems featuring the same type of genuine (tripartite) entanglement. Based on a geometric interpretation of the so-called $|W\rangle$ and $|GHZ\rangle$ states we show that the…
In this paper, an intuitive approach is employed to generalize the full separability criterion of tripartite quantum states of qubits to the higher-dimensional systems (Phys. Rev. A \textbf{72}, 022333 (2005)). A distinct characteristic of…
Measurement-based quantum computation (MQC) is a leading paradigm for building a quantum computer. Cluster states being used in this context act as one-way quantum computers. Here, we consider Z-states as a type of highly entangled states…
Sharing genuine multipartite entanglement by considering collective use of copies of biseparable states, which are entangled across all bipartitions but lack genuine multipartite entanglement at the single-copy level, plays a central role…
Markov states have been defined for tripartite quantum systems. In this paper, we generalize the definition of the Markov states to arbitrary multipartite case and find the general structure of an important subset of them, which we will…
We study the stochastic local operation and classical communication (SLOCC) equivalence for arbitrary dimensional multipartite quantum states. For multipartite pure states, we present a necessary and sufficient criterion in terms of their…
The reconstruction of the state of a multipartite quantum mechanical system represents a fundamental task in quantum information science. At its most basic, it concerns a state of a bipartite quantum system whose subsystems are subjected to…
Quantum algorithms can potentially solve a handful of problems more efficiently than their classical counterparts. In that context, it has been discussed that Markov chains problems could be solved significantly faster using quantum…
Continuous-variable bosonic systems stand as prominent candidates for implementing quantum computational tasks. While various necessary criteria have been established to assess their resourcefulness, sufficient conditions have remained…
Entangled systems in experiments may be lost or offline in distributed quantum information processing. This inspires a general problem to characterize quantum operations which result in breaking of entanglement or not. Our goal in this work…