相关论文: Markovianizing Cost of Tripartite Quantum States
We introduce and analyze a task in which a tripartite quantum state is transformed to an approximately recoverable state by a randomizing operation on one of the three subsystems. We consider cases where the initial state is a tensor…
To quantify non-Markovianity of tripartite quantum states from an operational viewpoint, we introduce a class $\Omega^*$ of operations performed by three distant parties. A tripartite quantum state is a free state under $\Omega^*$ if and…
We introduce and analyze a task that we call symmetrization, in which a state of a quantum system, associated with a symmetry group, is transformed by a random unitary operation to a symmetric state. Each element of the unitary ensemble is…
A state on a tripartite quantum system $A \otimes B \otimes C$ forms a Markov chain if it can be reconstructed from its marginal on $A \otimes B$ by a quantum operation from $B$ to $B \otimes C$. We show that the quantum conditional mutual…
In order to analyze non-Markovianity of tripartite quantum states from a resource theoretical viewpoint, we introduce a class of quantum operations performed by three distant parties, and investigate an operational resource theory (ORT)…
We develop an adaptive method for quantum state preparation that utilizes randomness as an essential component and that does not require classical optimization. Instead, a cost function is minimized to prepare a desired quantum state…
We revisit the task of quantum state redistribution in the one-shot setting, and design a protocol for this task with communication cost in terms of a measure of distance from quantum Markov chains. More precisely, the distance is defined…
Here we address a task denoted as deimaginarity, which is to transform a state into a real state with the aid of random covariant-free unitary operations. We consider the minimum cost of randomness required for deimaginarity in the scenario…
Quantum non-Markovianity in tripartite quantum states $\rho_{ABC}$ represents a correlation between systems $A$ and $C$ when conditioned on the system $B$ and is known to have both classical and quantum contributions. However, a systematic…
A state on a tripartite quantum system $\mathcal{H}_{A}\otimes \mathcal{H}_{B}\otimes\mathcal{H}_{C} $ forms a Markov chain, i.e., quantum conditional independence, if it can be reconstructed from its marginal on $\mathcal{H}_{A}\otimes…
Here, a new two-dimensional process, discrete in time and space, that yields the results of both a random walk and a quantum random walk, is introduced. This model describes the population distribution of four coin states |1>,-|1>, |0> -|0>…
Variational hybrid quantum-classical algorithms are promising candidates for near-term implementation on quantum computers. In these algorithms, a quantum computer evaluates the cost of a gate sequence (with speedup over classical cost…
We analyze implementations of bipartite unitaries by means of local operations and classical communication (LOCC) assisted by shared entanglement. We employ concepts and techniques developed in quantum Shannon theory to study an asymptotic…
The entanglement cost of arbitrary sequences of bipartite states is shown to be expressible as the minimization of a conditional spectral entropy rate over sequences of separable extensions of the states in the sequence. The expression is…
This paper shows a novel way of simulating a Markov process by a quantum computer. The main purpose of the paper is to show a particular application of quantum computing in the field of stochastic processes analysis. Using a Quantum…
Consider a quantum system prepared in an input state. One wants to drive it into a target state. Assuming classical states and operations as free resources, I identify a geometric cost function which quantifies the difficulty of the…
We show how to efficiently generate pseudo-random states suitable for quantum information processing via cluster-state quantum computation. By reformulating pseudo-random algorithms in the cluster-state picture, we identify a strategy for…
The possibility of simulating a stochastic process by the intrinsic randomness of quantum system is investigated. Two simulations of Markov Chains by the measurements of quantum systems are proposed.
Recent advances in quantum technology facilitate the realization of information processing using quantum computers at least on the small and intermediate scales of up to several dozens of qubits. We investigate entanglement cost required…
A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…