相关论文: Virtual Quantum Markov Chain of four-qubit systems
We consider the separability of rank two quantum states on multiple quantum spaces with different dimensions. The sufficient and necessary conditions for separability of these multiparty quantum states are explicitly presented. A…
A phase retrievable quantum channel refers to a quantum channel $\Phi: B(H_A)\to B(H_B)$ such that there is a positive operator valued measure (POVM) $\{F_{j}\}$ in $B(H_{B})$ and $\{\Phi^*(F_j)\}$ is a phase retrievable operator valued…
We introduce a multireference selected quantum Krylov (MRSQK) algorithm suitable for quantum simulation of many-body problems. MRSQK is a low-cost alternative to the quantum phase estimation algorithm that generates a target state as a…
Solving the ground state of quantum many-body systems remains a fundamental challenge in physics and chemistry. Recent advancements in quantum hardware have opened new avenues for addressing this challenge. Inspired by the quantum-enhanced…
Parametrized quantum circuits (PQCs) are crucial in variational quantum algorithms. While it is commonly believed that the optimal PQC is solely used to reproduce the target state, we here reveal that the optimal PQC can also provide…
We consider a quantum relay which is used by two parties to perform several continuous-variable protocols: Entanglement swapping, distillation, quantum teleportation, and quantum key distribution. The theory of these protocols is extended…
We construct quantum gate entanglers for different classes of multipartite states based on definition of W and GHZ concurrence classes. First, we review the basic construction of concurrence classes based on orthogonal complement of a…
Multipartite entanglement has been shown to be of particular relevance for a better understanding and exploitation of the dynamics and flow of entanglement in multiparty systems. This calls for analysis aimed at identifying the appropriate…
Four-quark states may exist as colorless meson-meson molecules or compact systems with two-body colored components. We derive an analytical procedure to expand an arbitrary four--quark wave function in terms of nonorthogonal color…
Feasible distribution of quantum entanglement over long distances remains a fundamental step towards quantum secure communication and quantum network implementations. Quantum repeater nodes based on quantum memories promise to overcome…
Continuous Time Markov Chains (CTMC) have been used extensively to model reliability of storage systems. While the exponentially distributed sojourn time of Markov models is widely known to be unrealistic (and it is necessary to consider…
Quantum computers are not yet up to the task of providing computational advantages for practical stochastic diffusion models commonly used by financial analysts. In this paper we introduce a class of stochastic processes that are both…
The detection of multipartite entanglement in arbitrary dimensional systems is investigated. We derive useful $k$-separability criteria of mixed $n$-partite ($n\geq 3$) quantum states to detect $k$-nonseparable $n$-partite quantum states.…
Reversibility is a key property of Markov chains, central to algorithms such as Metropolis-Hastings and other MCMC methods. Yet many applications yield non-reversible chains, motivating the problem of approximating them by reversible ones…
Quantum computers theoretically promise computational advantage in many tasks, but it is much less clear how such advantage can be maintained when using existing and near-term hardware that has limitations in the number and quality of its…
We provide a number of schemes for the splitting up of quantum information among $k$ parties using a $N$-qubit linear cluster state as a quantum channel, such that the original information can be reconstructed only if all the parties…
Dynamical quantum phase transition is a critical phenomenon involving out-of-equilibrium states and broken symmetries without classical analogy. However, when finite-sized systems are analyzed, dynamical singularities of the rate function…
We introduce a new method to reconstruct unknown quantum states out of incomplete and noisy information. The method is a linear convex optimization problem, therefore with a unique minimum, which can be efficiently solved with Semidefinite…
We analyze possible implementations of quantum algorithms in a system of (macroscopic) Josephson charge qubits. System layout and parameters to realize the Deutsch algorithm with up to three qubits are provided. Special attention is paid to…
We present the variational separability verifier (VSV), which is a novel variational quantum algorithm (VQA) that determines the closest separable state (CSS) of an arbitrary quantum state with respect to the Hilbert-Schmidt distance (HSD).…