Related papers: How to combine three quantum states
By using relative entropy of coherence, we characterize the coherence gain induced by some quantum evolutions, including the cohering power of unitary operations and the decohering power of quantum operations. We find that the cohering…
Based on the matrix realignment and partial transpose, we develop an approach to entangling power and operator entanglement of quantum unitary operators. We demonstrate efficiency of the approach by studying several unitary operators on…
In order to investigate distributed quantum computation under restricted network resources, we introduce a quantum computation task over the butterfly network where both quantum and classical communications are limited. We consider…
We present a quantum algorithm for European option pricing in finance, where the key idea is to work in the unary representation of the asset value. The algorithm needs novel circuitry and is divided in three parts: first, the amplitude…
We discuss a model for quantum computing with initially mixed states. Although such a computer is known to be less powerful than a quantum computer operating with pure (entangled) states, it may efficiently solve some problems for which no…
Basic logic gates and their operations in ternary quantum domain are involved in the synthesis of ternary quantum circuits. Only a few works define ternary algebra for ternary quantum logic realization. In this paper, a ternary logic…
We discuss how to reconstruct quantum theory from operational postulates. In particular, the following postulates are consistent only with for classical probability theory and quantum theory. Logical Sharpness: There is a one-to-one map…
In this work, we present new connections between three types of quantum states: positive under partial transpose states, symmetric with positive coefficients states and invariant under realignment states. First, we obtain a common upper…
There is a natural equivalence relation on representations of the states of a given quantum system in a Hilbert space, two representations being equivalent iff they are related by a unitary transformation. There are two equivalence classes,…
The possibility of using strongly and continuously interacting spins for quantum computation has recently been discussed. Here we present a simple optical scheme that achieves this goal while avoiding the drawbacks of earlier proposals. We…
Entangled multipartite states are resources for universal quantum computation, but they can also give rise to ensembles of unitary transformations, a topic usually studied in the context of random quantum circuits. Using several graph state…
Conditional von Neumann entropy is an intriguing concept in quantum information theory. In the present work, we examine the effect of global unitary operations on the conditional entropy of the system. We start with the set containing…
We present an iterative method to solve the multipartite quantum state estimation problem. We demonstrate convergence for any informationally complete set of generalized quantum measurements in every finite dimension. Our method exhibits…
The cluster state model for quantum computation [Phys. Rev. Lett. 86, 5188] outlines a scheme that allows one to use measurement on a large set of entangled quantum systems in what is known as a cluster state to undertake quantum…
This article shows that one can consistently incorporate nonunitary representations of at least one group into the ``ordinary'' nonrelativistic quantum mechanics. This group turns out to be Lorentz group thus giving us an alternative…
This paper introduces a novel approach to implementing non-unitary linear transformations of basis on quantum computational platforms, a significant leap beyond the conventional unitary methods. By integrating Singular Value Decomposition…
Quantum computing employs controllable interactions to perform sequences of logical gates and entire algorithms on quantum registers. This paradigm has been widely explored, e.g., for simulating dynamics of manybody systems by decomposing…
We present a method that outputs a sequence of simple unitary operations to prepare a given quantum state that is a generalized coherent state. Our method takes as inputs the expectation values of some relevant observables on the state to…
One of the core questions of quantum physics is how to reconcile the unitary evolution of quantum states, which is information-preserving and time-reversible, with evolution following the second law of thermodynamics, which, in general, is…
Density matrices evolved according the von Neumann equation are commonly used to simulate the dynamics of driven quantum systems. However, computational methods using density matrices are often too slow to explore the large parameter spaces…