Related papers: Universal Simulation of Hamiltonians Using a Finit…
We present a general, systematic, and efficient method for decomposing any given exponential operator of bosonic mode operators, describing an arbitrary multi-mode Hamiltonian evolution, into a set of universal unitary gates. Although our…
In this paper we consider a generalization of quantum hash functions for arbitrary groups. We show that quantum hash function exists for arbitrary abelian group. We construct a set of "good" automorphisms --- a key component of quantum hash…
We investigate the possibility to suppress interactions between a finite dimensional system and an infinite dimensional environment through a fast sequence of unitary kicks on the finite dimensional system. This method, called dynamical…
In recent decades the field of quantum computation has seen remarkable development. While much progress has been made toward the realization of a fully digital, scalable, and fault tolerant quantum computer, there are still many essential…
In recent years, we have witnessed an explosion of experimental tools by which quantum systems can be manipulated in a controlled and coherent way. One of the most important goals now is to build quantum simulators, which would open up the…
Quantum phenomena of interest in connection with applications to computation and communication almost always involve generating specific transfers between eigenstates, and their linear superpositions. For some quantum systems, such as spin…
We present a novel, computationally efficient approach to accelerate quantum optimal control calculations of large multi-qubit systems used in a variety of quantum computing applications. By leveraging the intrinsic symmetry of finite…
IBM quantum computers are used to simulate the dynamics of small systems of interacting quantum spins. For time-independent systems with fewer than three spins, we compute the exact time evolution at arbitrary times and measure spin…
In this paper, we firstly briefly review the duality quantum computer. Distinctly, the generalized quantum gates, the basic evolution operators in a duality quantum computer are no longer unitary, and they can be expressed in terms of…
The ability to simulate one Hamiltonian with another is an important primitive in quantum information processing. In this paper, a simulation method for arbitrary $\sigma_z \otimes \sigma_z$ interaction based on Hadamard matrices…
We study the quantum computational power of a generic class of anisotropic solid state Hamiltonians. A universal set of encoded logic operations are found which do away with difficult-to-implement single-qubit gates in a number of quantum…
We consider the manifold of all quantum many-body states that can be generated by arbitrary time-dependent local Hamiltonians in a time that scales polynomially in the system size, and show that it occupies an exponentially small volume in…
For a quantum many-body problem, effective Hamiltonians that give exact eigenvalues in reduced model space usually have different expressions, diagrams and evaluation rules from effective transition operators that give exact transition…
Quantum simulation using synthetic quantum systems offers unique opportunities to explore open questions in many-body physics and a path for the generation of useful entangled states. Nevertheless, so far many quantum simulators have been…
We analyze the asymptotic dynamics of quantum systems resulting from large numbers of iterations of random unitary operations. Although, in general, these quantum operations cannot be diagonalized it is shown that their resulting asymptotic…
In this paper we propose a systematic method to solve the inverse dynamical problem for a quantum system governed by the von Neumann equation: to find a class of Hamiltonians reproducing a prescribed time evolution of a pure or mixed state…
The universal quantum computer is a device capable of simulating any physical system and represents a major goal for the field of quantum information science. Algorithms performed on such a device are predicted to offer significant gains…
We prove that every unitary acting on any multipartite system and having operator Schmidt rank equal to 2 can be diagonalized by local unitaries. This then implies that every such multipartite unitary is locally equivalent to a controlled…
Quantum simulation is a foundational application for quantum computers, projected to offer insights into complex quantum systems beyond the reach of classical computation. However, with the exception of Trotter-based methods, which suffer…
We show that a local Hamiltonian of spin-3/2 particles with only two-body nearest-neighbor Affleck-Kennedy-Lieb-Tasaki and exchange-type interactions has an unique ground state, which can be used to implement universal quantum computation…