Related papers: Time Reversal and n-qubit Canonical Decompositions
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,…
The two-qubit canonical decomposition SU(4) = [SU(2) \otimes SU(2)] Delta [SU(2) \otimes SU(2)] writes any two-qubit quantum computation as a composition of a local unitary, a relative phasing of Bell states, and a second local unitary.…
We present a constructive method utilizing the Cartan decomposition to characterize topological properties and their connection to two-qubit quantum entanglement, in the framework of the tenfold classification and Wootters' concurrence.…
Kramers degeneracy theorem is one of the basic results in quantum mechanics. According to it, the time-reversal symmetry makes each energy level of a half-integer spin system at least doubly degenerate, meaning the absence of transitions or…
We consider a generalized central spin model, consisting of two central qubits and an environmental spin chain (with periodic boundary condition) to which these central qubits are locally and weakly connected either at the same site or at…
The concept of concurrence is researched to characterize the dynamical behavior of the bipartite systems. The quantum kicked top model has great significance in the qubit systems and the chaotic properties of the entanglement. The…
Time reversal symmetry is studied in a space with noncommutativity of coordinates and noncommutativity of momenta of canonical type. The circular motion is examined as an apparent example of time reversal symmetry breaking in the space. On…
In this paper, we study some control problems that derive from time optimal control of coupled spin dynamics in NMR spectroscopy and quantum information and computation. Time optimal control helps to minimize relaxation losses. The ability…
Canonical Polyadic Decomposition (CPD) of a third-order tensor is a minimal decomposition into a sum of rank-$1$ tensors. We find new mild deterministic conditions for the uniqueness of individual rank-$1$ tensors in CPD and present an…
The accurate first-principles description of strongly-correlated materials is an important and challenging problem in condensed matter physics. Ab initio downfolding has emerged as a way of deriving compressed many-body Hamiltonians that…
The problem of diagonalization of Hamiltonians of N-dimensional boson systems by means of time-dependent canonical transformations (CT) is considered, the case of quadratic Hamiltonians being treated in greater detail. The unitary generator…
It is shown that any two Hamiltonians H(t) and H'(t) of N dimensional quantum systems can be related by means of time-dependent canonical transformations (CT). The dynamical symmetry group of system with Hamiltonian H(t) coincides with the…
In this work we use the formalism of chord functions (\emph{i.e.} characteristic functions) to analytically solve quadratic non-autonomous Hamiltonians coupled to a reservoir composed by an infinity set of oscillators, with Gaussian initial…
We derive an exact and explicit Kraus decomposition for the reduced density of a quantum system simultaneously interacting with time-dependent external fields and a chaotic environment of thermodynamic dimension. We test the accuracy of the…
After a synoptic panorama about some still unsolved foundational problems involving time-reversal, we show that the \emph{double time-reversal superselection rule} of Nonrelativistic Quantum Mechanics is redundant. We then analyze which,…
We study a nonlinear decomposition of a positive definite matrix into two components: the inverse of another positive definite matrix and a symmetric matrix constrained to lie in a prescribed linear subspace. Equivalently, the inverse…
We introduce a backward stable algorithm for computing the CS decomposition of a partitioned $2n \times n$ matrix with orthonormal columns, or a rank-deficient partial isometry. The algorithm computes two $n \times n$ polar decompositions…
The "folding algorithm"\cite{fold1} is a matrix product state algorithm for simulating quantum systems that involves a spatial evolution of a matrix product state. Hence, the computational effort of this algorithm is controlled by the…
We investigate the dynamics of entanglement given by the concurrence of a two-qubit system in the non-Markovian setting. A quantum master equation is derived which is solved in the eigen basis of the system Hamiltonian for X-type initial…
The Schmidt decomposition is the go-to tool for measuring bipartite entanglement of pure quantum states. Similarly, it is possible to study the entangling features of a quantum operation using its operator-Schmidt, or tensor product…