Related papers: Time Reversal and n-qubit Canonical Decompositions
We present an algorithm that computes the composition factors of the n-th tensor power of the free associative algebra on a vector space. The composition factors admit a description in terms of certain coefficients $c_{\lambda\mu}$…
Reversible computation is key in developing new, energy-efficient paradigms, but also in providing forward-only concepts with broader definitions and finer frames of study.Among other fields, the algebraic specification and representation…
We discuss the exact non-invertible Kramers-Wannier symmetry of 1+1d lattice models on a tensor product Hilbert space of qubits. This symmetry is associated with a topological defect and a conserved operator, and the latter can be presented…
Reversible algorithms play a crucial role both in classical and quantum computation. While for a classical bit the only nontrivial reversible operation is the bit-flip, nature is far more versatile in what it allows to do to a quantum bit.…
Transforming a matrix over a field to echelon form, or decomposing the matrix as a product of structured matrices that reveal the rank profile, is a fundamental building block of computational exact linear algebra. This paper surveys the…
Quantum dynamics simulations (QDSs) are one of the most highly anticipated applications of quantum computing. Quantum circuit depth for implementing Hamiltonian simulation algorithms is commonly time dependent so that long time dynamics…
In the macroscopic world, time is intrinsically asymmetric, flowing in a specific direction, from past to future. However, the same is not necessarily true for quantum systems, as some quantum processes produce valid quantum evolutions…
A Cylindrical Algebraic Decomposition (CAD) is a decomposition of R^n into a finite collection of semialgebraic cells. A CAD satisfies the "frontier condition" if, for every cell C, there is a collection of cells of the decomposition whose…
We review the entanglement properties in collective models and their relationship with quantum phase transitions. Focusing on the concurrence which characterizes the two-spin entanglement, we show that for first-order transition, this…
Uncovering the origin of the arrow of time remains a fundamental scientific challenge. Within the framework of statistical physics, this problem was inextricably associated with the second law of thermodynamics, which declares that entropy…
We obtain analytically close forms of benchmark quantum dynamics of the collapse and revival (CR), reduced density matrix, Von Neumann entropy, and fidelity for the XXZ central spin problem. These quantities characterize the quantum…
Canonical Polyadic Decomposition (CPD) represents a third-order tensor as the minimal sum of rank-1 terms. Because of its uniqueness properties the CPD has found many concrete applications in telecommunication, array processing, machine…
Quantum algorithms for Hamiltonian simulation and linear differential equations more generally have provided promising exponential speed-ups over classical computers on a set of problems with high real-world interest. However, extending…
Time reversal in quantum or classical systems described by an Hermitian Hamiltonian is a physically allowed process, which requires in principle inverting the sign of the Hamiltonian. Here we consider the problem of time reversal of a…
The quantum dynamics of M pairwise coupled spin 1/2 is analyzed and the time evolution of the entanglement get established within a prefixed couple of spins is studied. A conceptual and quantitative link between the concurrence function and…
We present an effective ansatz for the wave function of correlated electrons that brings closer the fields of machine learning parameterizations and tensor rank decompositions. We consider a CANDECOMP/PARAFAC (CP) tensor factorization of a…
A novel theoretical convergence rate estimate for a Balancing Domain Decomposition by Constraints algorithm is proven for the solution of the cardiac Bidomain model, describing the propagation of the electric impulse in the cardiac tissue.…
Recently it has been shown that time-optimal quantum computation is attained by using the Cartan decomposition of a unitary matrix. We extend this approach by noting that the unitary group is compact. This allows us to reduce the execution…
New or enlarged symmetries can emerge at the low-energy spectrum of a Hamiltonian that does not possess the symmetries, if the symmetry breaking terms in the Hamiltonian are irrelevant under the renormalization group flow. In this letter,…
We analyze the effects of noncommutativity in conformal quantum mechanics (CQM) using the $\kappa$-deformed space-time as a prototype. Upto the first order in the deformation parameter, the symmetry structure of the CQM algebra is preserved…