Annals of Mathematics and Physics

Unique factorization theorem for pure quantum states

Dhananjay P. Mehendale

Published Sep 15, 2023• 1 citation

Abstract

In this paper we establish a unique factorization theorem for pure quantum states expressed in computational basis. We show that there always exists unique factorization for any given N-qubit pure quantum state in terms of the tensor product of non-factorable or ``prime'' pure quantum states. This result is based on a simple criterion: Given N-qubit pure quantum state in computational basis can be factorized as the tensor product of an m-qubit pure quantum state and an n-qubit pure quantum state, where (m + n) = N, if and only if the rank of the certain associated matrix is equal to one. This simple criterion leads to a factorization algorithm which when applied to an N-qubit pure quantum state factorizes that state into the tensor product of non-factorable or ``prime'' pure quantum states. This paper shows that for any given N-qubit pure quantum state the said factorization always ``exists'' and is ``unique''. We demonstrated our work here on a computational basis.PACS Number: 03.67.Mn, 03.65.Ca, 03.65.Ud

DOI: 10.17352/amp.000094

Related papers

On Factorization of N-Qubit Pure States and Complete Entanglement Analysis of 3-Qubit Pure States Containing Exactly Two Terms and Three Terms

Dhananjay P. Mehendale, Madhav R. Modak

A multi-qubit pure quantum state is called separable when it can be factored as the tensor product of 1-qubit pure quantum states. Factorizing a general multi-qubit pure quantum state into the tensor product of its factors (pure states containing a smaller number of qubits) can be a challenging task, especially for highly entangled states. A new criterion based on the proportionality of the rows of certain associated matrices for the existence of certain factorization and a factorization algorithm that follows from this criterion for systematically extracting all the factors is developed in this paper. 3-qubit pure states play a crucial role in quantum computing and quantum information processing. For various applications, the well-known 3-qubit GHZ state which contains two nonzero terms, and the 3-qubit W state which contains three nonzero terms, have been studied extensively. Using the new factorization algorithm developed here we perform a complete analysis vis-à-vis entanglement of 3-qubit states that contain exactly two nonzero terms and exactly three nonzero terms.

Journal of quantum computingJan 1, 20231 citation

Separability criterion based on direct tensor product factorization

M. Flores, Eric A. Galapon

We derive a separability criterion via direct tensor factorization of a pure bipartite state. We also propose how this separability criterion could be extended to be applicable to arbitrary N-qubit pure states and later on to include mixed states.

Proceedings of the Samahang Pisika ng PilipinasJun 3, 20150 citations

SEPARABILITY OF PURE N-QUBIT STATES: TWO CHARACTERIZATIONS

Philippe Jorrand, Mehdi Mhalla

Given a pure state |ψN>∈ℋN of a quantum system composed of n qubits, where ℋN is the Hilbert space of dimension N=2n, this paper answers two questions: what conditions should the amplitudes in |ψN> satisfy for this state to be separable (i) into a tensor product of n qubit states |ψ2>0⊗ |ψ2>1 ⊗⋯⊗ |ψ2>n-1, and (ii), into a tensor product of two subsystems states |ψP> ⊗ |ψQ> with P=2p and Q=2q such that p+q=n? For both questions, necessary and sufficient conditions are proved, thus characterizing at the same time families of separable and entangled states of n qubit systems. A number of more refined questions about separability in n qubit systems can be studied on the basis of these results.

arXiv:quant-ph/0209125International Journal of Foundations of Computer ScienceOct 1, 200310 citations

Entanglement of multipartite quantum states and the generalized quantum search

Robert M. Gingrich

In chapter 2 various parameterizations for the orbits under local unitary transformations of three-qubit pure states are analyzed. It is shown that the entanglement monotones of any multipartite pure state uniquely determine the orbit of that state. It follows that there must be an entanglement monotone for three-qubit pure states which depends on the Kempe invariant defined in [1]. A form for such an entanglement monotone is proposed. A theorem is proved that significantly reduces the number of entanglement monotones that must be looked at to find the maximal probability of transforming one multipartite state to another. In chapter 3 Grover's unstructured quantum search algorithm is generalized to use an arbitrary starting superposition and an arbitrary unitary matrix. A formula for the probability of the generalized Grover's algorithm succeeding after n iterations is derived. This formula is used to determine the optimal strategy for using the unstructured quantum search algorithm. The speedup obtained illustrates that a hybrid use of quantum computing and classical computing techniques can yield a performance that is better than either alone. The analysis is extended to the case of a society of k quantum searches acting in parallel. In chapter 4 the positive map Г : p → (Trρ) - ρ is introduced as a separability criterion. Any separable state is mapped by the tensor product of Г and the identity in to a non-negative operator, which provides a necessary condition for separability. If Г acts on a two-dimensional subsystem, then it is equivalent to partial transposition and therefore also sufficient for 2 x 2 and 2 x 3 systems. Finally, a connection between this map for two qubits and complex conjugation in the magic basis [2] is displayed.

Sep 1, 20020 citations

Entanglement beyond tensor product structure: algebraic aspects of quantum non-separability

Łukasz Derkacz, Marek Gwóźdź, Lech Jakóbczyk

An algebraic approach to quantum non-separability is applied to the case of two qubits. It is based on the partition of the algebra of observables into independent subalgebras and the tensor product structure of the Hilbert space is not exploited. Even in this simple case, such a general formulation has some advantages. Using algebraic formalism, we can explicitly show the relativity of the notion of entanglement to the observables measured in the system and characterize separable and non-separable pure states. As a universal measure of non-separability of pure states, we propose to take the so-called total correlation. This quantity depends on the state as well as on the algebraic partition. Its numerical value is given by the norm of the corresponding correlation matrix.

arXiv:1109.0818Journal of Physics A Mathematical and TheoreticalDec 8, 201112 citations

On the distinction between entangled and separable states of quantum registers

Philippe Jorrand, Mehdi Mhalla

Quantum computing operates in three stages: (i) preparation of the initial states of the n qubits of a register, (ii) step by step transformation of the state of this register by unitary operators which compose the quantum program, and (iii), measurement of all or some of the qubits of the register. The existence of quantum algorithms which are exponentially less complex than their classical counterparts for some classes of problems, stems from entangled states established by multi-qubit unitary operators within the quantum program. A register of n qubits is a quantum system composed of n quantum subsystems. The state |/spl psi/> of a quantum system composed of two quantum subsystems A and B is said to be entangled when |/spl psi/> is not reducible to a pair composed of a state |/spl psi/> of A and a state |/spl psi//sub B/> of B: such situations have no counterpart in the classical world. In quantum theory, such a pair of states is denoted by a tensor product: |/spl psi/> is entangled if it cannot be factorized into the tensor product |/spl psi//sub A/>/spl ominus/|/spl psi//sub B/>. This paper establishes conditions according to which it is possible to tell whether or not the state of a register of n qubits is entangled. The state of a single qubit is a vector /spl alpha/|0>+/spl beta/|1> of unit norm in a 2-dimensional vector space, where |0> and |1> are the two basis states and where a and are complex amplitudes. Then, if both A and B are qubits, the most general form of the state of a register composed of the 2 qubits A and B is also a vector of unit norm, but now in a 4-dimensional space: |/spl psi/>=/spl alpha/|00>+/spl beta/|01+/spl gamma/|10>+/spl sigma/|11>. It is straightforward to prove that |/spl psi/> can be factorized into |/spl psi//sub A/>/spl ominus/|/spl psi//sub B/> if and only if /spl alpha//spl delta/=/spl beta//spl gamma/. In such a case, |/spl psi/> is said to be separable, i.e. not entangled. This paper generalizes this form of condition to registers of n qubits. If |/spl psi/> is the state of a register of n qubits, two different questions about the separability of |/spl psi/> are answered: (i) is |/spl psi/> separable into a product |/spl psi//sub 1/>/spl ominus/|/spl psi//sub 2/>/spl ominus/L/spl ominus/|/spl psi//sub n/> of n single qubit states? and (ii), is |/spl psi/> separable into a product |/spl psi//sub A/>/spl ominus/|/spl psi//sub B/> of the states of two subregisters A and B, respectively containing p and q adjacent qubits with p+q=n? For both questions, necessary and sufficient conditions are given.

IEEE Conference on Nanotechnology (IEEE NANO)Jun 25, 20030 citations