Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0402051 · Journal of Mathematical Physics

Time reversal and n-qubit canonical decompositions

Stephen S. Bullock, Gavin K. Brennen, Dianne Prost O’Leary

Published May 13, 2005• 18 citations
arXivHTMLPDF

Abstract

On pure states of n quantum bits, the concurrence entanglement monotone returns the norm of the inner product of a pure state with its spin-flip. The monotone vanishes for n odd, but for n even there is an explicit formula for its value on mixed states, i.e., a closed-form expression computes the minimum over all ensemble decompositions of a given density. For n even a matrix decomposition ν=k1ak2 of the unitary group is explicitly computable and allows for study of the monotone’s dynamics. The side factors k1 and k2 of this concurrence canonical decomposition (CCD) are concurrence symmetries, so the dynamics reduce to consideration of the a factor. This unitary a phases a basis of entangled states, and the concurrence dynamics of u are determined by these relative phases. In this work, we provide an explicit numerical algorithm computing ν=k1ak2 for n odd. Further, in the odd case we lift the monotone to a two-argument function. The concurrence capacity of ν according to the double argument lift may be nontrivial for n odd and reduces to the usual concurrence capacity in the literature for n even. The generalization may also be studied using the CCD, leading again to maximal capacity for most unitaries. The capacity of ν⊗I2 is at least that of ν, so odd-qubit capacities have implications for even-qubit entanglement. The generalizations require considering the spin-flip as a time reversal symmetry operator in Wigner’s axiomatization, and the original Lie algebra homomorphism defining the CCD may be restated entirely in terms of this time reversal. The polar decomposition related to the CCD then writes any unitary evolution as the product of a time-symmetric and time-antisymmetric evolution with respect to the spin-flip. En route we observe a Kramers’ nondegeneracy: the existence of a nondegenerate eigenstate of any time reversal symmetric n-qubit Hamiltonian demands (i) n even and (ii) maximal concurrence of said eigenstate. We provide examples of how to apply this work to study the kinematics and dynamics of entanglement in spin chain Hamiltonians.

DOI
10.1063/1.1900293

Related papers

Canonical decompositions of n-qubit quantum computations and concurrence

Stephen S. Bullock, Gavin K. Brennen

The two-qubit canonical decomposition SU(4)=[SU(2)⊗SU(2)]Δ[SU(2)⊗SU(2)] writes any two-qubit unitary operator as a composition of a local unitary, a relative phasing of Bell states, and a second local unitary. Using Lie theory, we generalize this to an n-qubit decomposition, the concurrence canonical decomposition (CCD) SU(2n)=KAK. The group K fixes a bilinear form related to the concurrence, and in particular any unitary in K preserves the tangle |〈φ|¯(−iσ1y)⋯(−iσny)|φ〉|2 for n even. Thus, the CCD shows that any n-qubit unitary is a composition of a unitary operator preserving this n-tangle, a unitary operator in A which applies relative phases to a set of GHZ states, and a second unitary operator which preserves the tangle. As an application, we study the extent to which a large, random unitary may change concurrence. The result states that for a randomly chosen a∈A⊂SU(22p), the probability that a carries a state of tangle 0 to a state of maximum tangle approaches 1 as the even number of qubits approaches infinity. Any v=k1ak2 for such an a∈A has the same property. Finally, although |〈φ|¯(−iσ1y)⋯(−iσny)|φ〉|2 vanishes identically when the number of qubits is odd, we show that a more complicated CCD still exists in which K is a symplectic group.

arXiv:quant-ph/0309104•Journal of Mathematical Physics•May 14, 2004•50 citations

Characterizing the entangling capacity of n-qubit computations

Stephen S. Bullock, Gavin K. Brennen

The state space H n of n quantum bits of data is exponentially large, having dimension 2. The (pure) local states which correspond to each individual quantum bit being in an isolated one-qubit state, i.e. those which are tensor products, form a much smaller orbit of ⊗ n 1 U(2).|00...0) of linear dimension within the state space. Hence most states are non-local, or entangled. The concurrence function on quantum data states is one measure of entanglement, intuitively capturing an exponentially small fraction of the phenomenon. This paper reports numerical tests of how concurrence changes as one applies a quantum computation u to a pure n quantum-bit data state |ψ). We make strong use of a mathematical tool for factoring u = k 1 a k 2 into subcomputations, namely the CCD matrix decomposition. The concurrence dynamics of a computation |ψ) → u|ψ) are in a certain sense localized to the a factor, and so our actual numerics concentrate on |ψ) → a|ψ). This is a great simplification, since an arbitrary unitary evolution may vary over 4 n - 1 real degrees of freedom, while the a ∈ A of the appropriate form for the CCD matrix decomposition may vary over 2 n - 1 or 2 n/2 - 1 as n = 2p, 2p - 1.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Aug 24, 2004•1 citation

Characterizing the entangling capacity of n-qubit computations

Stephen S. Bullocka, Gavin K. Brennenb

The state space ?-t of n quantum bits of data is exponentially large, having dimension 2. The (pure) local states which correspond to each individual quantum bit being in an isolated one-qubit state, i.e. those which are tensor products, form a much smaller orbit of ®U(2) . 00 . . . 0) of linear dimension within the state space. Hence most states are non-local, or entangled. The concurrence function on quantum data states is one measure of entanglement, intuitively capturing an exponentially small fraction of the phenomenon. This paper reports numerical tests of how concurrence changes as one applies a quantum computation u to a pure n quantum-bit data state kl') . We make strong use of a mathematical tool for factoring u = k1 a k2 into subcomputations, namely the CCD matrix decomposition. The concurrence dynamics of a computation Ib) u) are in a certain sense localized to the a factor, and so our actual numerics concentrate on RI') '—+aI'i4'). This is a great simplification, since an arbitrary unitary evolution may vary over 4' — 1 real degrees of freedom, while the a e A of the appropriate form for the CCD matrix decomposition may vary over 2 —1 or 2n/2 as n = 2p, 2p — 1.

•Jan 1, 2004•1 citation

Quantum symmetries and Cartan decompositions in arbitrary dimensions

Domenico D’Alessandro, Francesca Albertini

We investigate the relation between Cartan decompositions of the unitary group and discrete quantum symmetries. To every Cartan decomposition there corresponds a quantum symmetry which is the identity when applied twice. As an application, we describe a new and general method to obtain Cartan decompositions of the unitary group of evolutions of multipartite systems from Cartan decompositions on the single subsystems. The resulting decomposition, which we call of the odd-even type, contains, as a special case, the concurrence canonical decomposition (CCD) presented in the context of entanglement theory. The CCD is therefore extended from the case of a multipartite system of n qubits to the case where the component subsystems have arbitrary dimension.

arXiv:quant-ph/0504044•Journal of Physics A Mathematical and Theoretical•Feb 21, 2007•36 citations

CLASSICAL TENSORS AND QUANTUM ENTANGLEMENT II: MIXED STATES

Paolo Aniello, Jesús Clemente-Gallardo, Giuseppe Marmo +1 more

Invariant operator-valued tensor fields on Lie groups are considered. These define classical tensor fields on Lie groups by evaluating them on a quantum state. This particular construction, applied on the local unitary group U(n) × U(n), may establish a method for the identification of entanglement monotone candidates by deriving invariant functions from tensors being by construction invariant under local unitary transformations. In particular, for n = 2, we recover the purity and a concurrence related function (Wootters 1998) as a sum of inner products of symmetric and anti-symmetric parts of the considered tensor fields. Moreover, we identify a distinguished entanglement monotone candidate by using a non-linear realization of the Lie algebra of SU(2) × SU(2). The functional dependence between the latter quantity and the concurrence is illustrated for a subclass of mixed states parametrized by two variables.

arXiv:1011.5859•International Journal of Geometric Methods in Modern Physics•Mar 28, 2011•9 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.

•Jan 23, 2012•0 citations
On pure states of n quantum bits, the concurrence entanglement monotone returns the norm of the inner product of a pure state with its spin-flip. The monotone vanishes for n odd, but for n even there is an explicit formula for its value on mixed states, i.e., a closed-form expression computes the minimum over all ensemble decompositions of a given density. For n even a matrix decomposition ν=k1ak2 of the unitary group is explicitly computable and allows for study of the monotone’s dynamics. The side factors k1 and k2 of this concurrence canonical decomposition (CCD) are concurrence symmetries, so the dynamics reduce to consideration of the a factor. This unitary a phases a basis of entangled states, and the concurrence dynamics of u are determined by these relative phases. In this work, we provide an explicit numerical algorithm computing ν=k1ak2 for n odd. Further, in the odd case we lift the monotone to a two-argument function. The concurrence capacity of ν according to the double argument lift may be nontrivial for n odd and reduces to the usual concurrence capacity in the literature for n even. The generalization may also be studied using the CCD, leading again to maximal capacity for most unitaries. The capacity of ν⊗I2 is at least that of ν, so odd-qubit capacities have implications for even-qubit entanglement. The generalizations require considering the spin-flip as a time reversal symmetry operator in Wigner’s axiomatization, and the original Lie algebra homomorphism defining the CCD may be restated entirely in terms of this time reversal. The polar decomposition related to the CCD then writes any unitary evolution as the product of a time-symmetric and time-antisymmetric evolution with respect to the spin-flip. En route we observe a Kramers’ nondegeneracy: the existence of a nondegenerate eigenstate of any time reversal symmetric n-qubit Hamiltonian demands (i) n even and (ii) maximal concurrence of said eigenstate. We provide examples of how to apply this work to study the kinematics and dynamics of entanglement in spin chain Hamiltonians.
The two-qubit canonical decomposition SU(4)=[SU(2)⊗SU(2)]Δ[SU(2)⊗SU(2)] writes any two-qubit unitary operator as a composition of a local unitary, a relative phasing of Bell states, and a second local unitary. Using Lie theory, we generalize this to an n-qubit decomposition, the concurrence canonical decomposition (CCD) SU(2n)=KAK. The group K fixes a bilinear form related to the concurrence, and in particular any unitary in K preserves the tangle |〈φ|¯(−iσ1y)⋯(−iσny)|φ〉|2 for n even. Thus, the CCD shows that any n-qubit unitary is a composition of a unitary operator preserving this n-tangle, a unitary operator in A which applies relative phases to a set of GHZ states, and a second unitary operator which preserves the tangle. As an application, we study the extent to which a large, random unitary may change concurrence. The result states that for a randomly chosen a∈A⊂SU(22p), the probability that a carries a state of tangle 0 to a state of maximum tangle approaches 1 as the even number of qubits approaches infinity. Any v=k1ak2 for such an a∈A has the same property. Finally, although |〈φ|¯(−iσ1y)⋯(−iσny)|φ〉|2 vanishes identically when the number of qubits is odd, we show that a more complicated CCD still exists in which K is a symplectic group.
The state space H n of n quantum bits of data is exponentially large, having dimension 2. The (pure) local states which correspond to each individual quantum bit being in an isolated one-qubit state, i.e. those which are tensor products, form a much smaller orbit of ⊗ n 1 U(2).|00...0) of linear dimension within the state space. Hence most states are non-local, or entangled. The concurrence function on quantum data states is one measure of entanglement, intuitively capturing an exponentially small fraction of the phenomenon. This paper reports numerical tests of how concurrence changes as one applies a quantum computation u to a pure n quantum-bit data state |ψ). We make strong use of a mathematical tool for factoring u = k 1 a k 2 into subcomputations, namely the CCD matrix decomposition. The concurrence dynamics of a computation |ψ) → u|ψ) are in a certain sense localized to the a factor, and so our actual numerics concentrate on |ψ) → a|ψ). This is a great simplification, since an arbitrary unitary evolution may vary over 4 n - 1 real degrees of freedom, while the a ∈ A of the appropriate form for the CCD matrix decomposition may vary over 2 n - 1 or 2 n/2 - 1 as n = 2p, 2p - 1.
The state space ?-t of n quantum bits of data is exponentially large, having dimension 2. The (pure) local states which correspond to each individual quantum bit being in an isolated one-qubit state, i.e. those which are tensor products, form a much smaller orbit of ®U(2) . 00 . . . 0) of linear dimension within the state space. Hence most states are non-local, or entangled. The concurrence function on quantum data states is one measure of entanglement, intuitively capturing an exponentially small fraction of the phenomenon. This paper reports numerical tests of how concurrence changes as one applies a quantum computation u to a pure n quantum-bit data state kl') . We make strong use of a mathematical tool for factoring u = k1 a k2 into subcomputations, namely the CCD matrix decomposition. The concurrence dynamics of a computation Ib) u) are in a certain sense localized to the a factor, and so our actual numerics concentrate on RI') '—+aI'i4'). This is a great simplification, since an arbitrary unitary evolution may vary over 4' — 1 real degrees of freedom, while the a e A of the appropriate form for the CCD matrix decomposition may vary over 2 —1 or 2n/2 as n = 2p, 2p — 1.
We investigate the relation between Cartan decompositions of the unitary group and discrete quantum symmetries. To every Cartan decomposition there corresponds a quantum symmetry which is the identity when applied twice. As an application, we describe a new and general method to obtain Cartan decompositions of the unitary group of evolutions of multipartite systems from Cartan decompositions on the single subsystems. The resulting decomposition, which we call of the odd-even type, contains, as a special case, the concurrence canonical decomposition (CCD) presented in the context of entanglement theory. The CCD is therefore extended from the case of a multipartite system of n qubits to the case where the component subsystems have arbitrary dimension.
Invariant operator-valued tensor fields on Lie groups are considered. These define classical tensor fields on Lie groups by evaluating them on a quantum state. This particular construction, applied on the local unitary group U(n) × U(n), may establish a method for the identification of entanglement monotone candidates by deriving invariant functions from tensors being by construction invariant under local unitary transformations. In particular, for n = 2, we recover the purity and a concurrence related function (Wootters 1998) as a sum of inner products of symmetric and anti-symmetric parts of the considered tensor fields. Moreover, we identify a distinguished entanglement monotone candidate by using a non-linear realization of the Lie algebra of SU(2) × SU(2). The functional dependence between the latter quantity and the concurrence is illustrated for a subclass of mixed states parametrized by two variables.
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.