Related papers: Time Reversal and n-qubit Canonical Decompositions
We investigate entanglement and quantum phase transition (QPT) in a two-dimensional Heisenberg anisotropic spin-1/2 XY model, using quantum renormalization group method (QRG) on a square lattice of $N\times N$ sites. The entanglement…
We develop a new algorithm based on the time-dependent variational principle applied to matrix product states to efficiently simulate the real- and imaginary time dynamics for infinite one-dimensional quantum lattice systems. This…
We present a hybrid classical-quantum computing paradigm where the quantum part strictly runs within the coherence time of a quantum annealer, a method we call variational coherent quantum annealing (VCQA). It involves optimizing the…
Diagonalizing a Hamiltonian, which is essential for simulating its long-time dynamics, is a key primitive in quantum computing and has been proven to yield a quantum advantage for several specific families of Hamiltonians. Yet, despite its…
Although the laws of classical physics are deterministic, thermodynamics gives rise to an arrow of time through irreversible processes. In quantum mechanics the unitary nature of the time evolution makes it intrinsically reversible, however…
We investigate bicomplex Hamiltonian systems in the framework of an analogous version of the Schrodinger equation. Since in such a setting three different types of conjugates of bicomplex numbers appear, each is found to define in a natural…
Our purpose is to recast KK model in terms of ADM variables. We examine and solve the problem of the consistency of this approach, with particular care about the role of the cylindricity hypothesis. We show in details how the KK reduction…
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)xU(n), may…
Concrete computing machines, either sequential or concurrent, rely on an intimate relation between computation and time. We recall the general characteristic properties of physical time and of present realizations of computing systems. We…
We make a comparative study of quadrature squeezing, photon-number distribution and Wigner function in a decayed quantum system. Specifically, for a field mode prepared initially in cat states interacting with a zero-temperature…
Time reversal and spin flip are discrete symmetry operations of substantial import to quantum information and quantum computation. Spin flip arises in the context of separability, quantification of entanglement and the construction of…
Quantum error correction and symmetry arise in many areas of physics, including many-body systems, metrology in the presence of noise, fault-tolerant computation, and holographic quantum gravity. Here we study the compatibility of these two…
The Variational Quantum Eigensolver approach to the electronic structure problem on a quantum computer involves measurement of the Hamiltonian expectation value. Formally, quantum mechanics allows one to measure all mutually commuting or…
We numerically analyze the dynamical generation of quantum entanglement in a system of 2 interacting particles, started in a coherent separable state, for decreasing values of $\hbar$. As $\hbar\to 0$ the entanglement entropy, computed at…
We prove that the vast majority of symmetric states of qubits can be decomposed in a unique way into a superposition of spin 1/2 coherent states. For the case of two qubits, the proposed decomposition reproduces the Schmidt decomposition…
An algorithm is developed to compute the complete CS decomposition (CSD) of a partitioned unitary matrix. Although the existence of the CSD has been recognized since 1977, prior algorithms compute only a reduced version (the 2-by-1 CSD)…
Canonical Polyadic Decomposition (CPD) of a higher-order tensor is decomposition in a minimal number of rank-1 tensors. We give an overview of existing results concerning uniqueness. We present new, relaxed, conditions that guarantee…
Many current and near-future applications of quantum computing utilise parametric families of quantum circuits and variational methods to find optimal values for these parameters. Solving a quantum computational problem with such…
Decoupling systems into independently evolving components has a long history of simplifying seemingly complex systems. They enable a better understanding of the underlying dynamics and causal structures while providing more efficient means…
Despite the rapid development of quantum science and technology, errors are inevitable and play a crucial role in quantum simulation and quantum computation. In quantum chaotic systems, coherent errors arising from imperfect Hamiltonian…