arXiv subjects

An Min Wang

Publications and source records attributed to An Min Wang.

63 records · Page 4Linked to original sources

arXiv2001

Generalization of the entanglement of formation for multi-party systems

We present the generalization of the entanglement of formation for three-party systems in a pure state. For three qubit system we derive out its explicit and closed expression which is a linear combination of the binary entropy functions with various arguments, and these arguments are clearly determined in terms of the components of state vector of three qubits. As a reasonable measure of entanglement, the main behaviors and elementary properties of this generalized entanglement of formation are showed through discussing some important and interesting examples. Moreover, we propose how to extend our definition to a mixed state in according to the familiar idea. Then, we suggest the generalization of the entanglement of formation for multi-party systems which is consistent with the regular definition for two-party systems and our definition for three-party systems.

quant-ph↗

arXiv2001

Construction of a Scalable, Uniform and Universal Quantum Network and Its Applications

We present a possible candidate of construction of a scalable, uniform and universal quantum network, which is built from quantum gates to elements of quantum circuit, again to quantum subnetworks and finally to an entire quantum network. Our scheme can overcome some difficulties of the existing schemes and makes improvements to different extent in the scale of quantum network, ability of computation, implementation of engineering, efficiency of quantum network, universality, compatibility, design principle, programmability, fault tolerance, error control, industrialization and commercialization {\it et. al} aspects. As the applications of this construction scheme, we obtain the entire quantum networks for Shor's algorithm, Grover's algorithm and solving Schrödinger equation in general. This implies that the scalable, uniform and universal quantum networks are able to generally describe the known main results and can be further applied to more interesting examples in quantum computations.

quant-ph↗

arXiv2000

Modification of relative entropy of Entanglement

We present the modified relative entropy of entanglement (MRE) in order to both improve the computability for the relative entropy of entanglement and avoid the problem that the entanglement of formation seems to be greater than entanglement of distillation. For two qubit system we derive out an explicit and "weak" closed expression of MRE that depends on the pure state decompositions in the case of mixed states. For more qubit system, we obtain an algorithm to calculate MRE in principle. MRE significantly improves the computability of relative entropy of entanglement and decreases the dependence and sensitivity on the pure state decompositions. Moreover it is able to inherit most of the important physical features of the relative entropy of entanglement. In addition, a kind of states, as an extension of Werner's states, is discussed constructively.

quant-ph↗

arXiv2000

Modified relative entropy of entanglement for multi-party systems

We present the modified relative entropy of entanglement for multi-party systems by a given relative density matrix which is spanned by a linear combination of the direct products of so-called basis of relative density matrices and reduced density matrices for every party. For three qubit system in a pure state we derive out the explicit and closed expression of our relative density matrix which is a function of the components of the state vector of three qubits. Through computing the modified relative entropy of entanglement of some important and interesting examples, we display the main behaviors and elementary properties of the modified relative entropy of entanglement and compare it with the generalized entanglement of formation. Moreover, we also propose an assistant, as the upper bound, of the modified relative entropy of entanglement.

quant-ph↗

arXiv2000

Bounds on the generalized entanglement of formation for multi-party systems

We present a general method to find the upper and lower bounds on the generalized entanglement of formation for multi-party systems. The upper and lower bounds can be expressed in terms of the bi-partite entanglements of formation and/or entropies of various subsystems. The examples for tri- and four-party systems in the both pure states and mixed states are given. We also suggest a little modified definition of generalized entanglement of formation for multi-party systems if EPR pairs are thought of belonging to the set of maximally entangled states.

quant-ph↗

arXiv2000

Eigenvalues, Peres' separability condition and entanglement

The general expression with the physical significance and positive definite condition of the eigenvalues of $4\times 4$ Hermitian and trace-one matrix are obtained. This implies that the eigenvalue problem of the $4\times 4$ density matrix is generally solved. The obvious expression of Peres' separability condition for an arbitrary state of two qubits is then given out and it is very easy to use. Furthermore, we discuss some applications to the calculation of the entanglement, the upper bound of the entanglement, and a model of the transfer of entanglement in a qubit chain through a noisy channel.

quant-ph↗

arXiv2000

Quantum CPU and Quantum Simulating

Making use of an universal quantum network or QCPU proposed by me [6], some special quantum networks for simulating some quantum systems are given out. Specially, it is obtained that the quantum network for the time evolution operator which can simulate, in general, Schrödinger equation.

quant-ph↗

arXiv2000

An Universal Quantum Network - Quantum CPU

An universal quantum network which can implement a general quantum computing is proposed. In this sense, it can be called the quantum central processing unit (QCPU). For a given quantum computing, its realization of QCPU is just its quantum network. QCPU is standard and easy-assemble because it only has two kinds of basic elements and two auxiliary elements. QCPU and its realizations are scalable, that is, they can be connected together, and so they can construct the whole quantum network to implement the general quantum algorithm and quantum simulating procedure.

quant-ph↗

arXiv2000

Quantum CPU and Quantum Algorithm

Making use of an universal quantum network -- QCPU proposed by me\upcite{My1}, it is obtained that the whole quantum network which can implement some the known quantum algorithms including Deutsch algorithm, quantum Fourier transformation, Shor's algorithm and Grover's algorithm.

quant-ph↗