Related papers: Complexity classification of two-qubit commuting h…
We give a simple proof of a formula for the minimal time required to simulate a two-qubit unitary operation using a fixed two-qubit Hamiltonian together with fast local unitaries. We also note that a related lower bound holds for arbitrary…
We present QCommute, a software tool implemented in C++ for symbolic computation of nested commutators between a Hamiltonian and local observables in quantum many-body spin-1/2 systems on one-, two-, and three-dimensional hypercubic…
Quantum simulation is a promising near term application for mesoscale quantum information processors, with the potential to solve computationally intractable problems at the scale of just a few dozen interacting quantum systems. Recent…
We show that intrinsic fluctuations in system control parameters impose limits on the ability of two-qubit (exchange) Hamiltonians to generate entanglement starting from mixed initial states. We find three classes for Gaussian and Laplacian…
Classical integrable Hamiltonian systems generated by elements of the Poisson commuting ring of spectral invariants on rational coadjoint orbits of the loop algebra $\wt{\gr{gl}}^{+*}(2,{\bf R})$ are integrated by separation of variables in…
We give a careful proof that a parallelized version of adiabatic quantum computation can efficiently simulate universal gate model quantum computation. The proof specifies an explicit parameter-dependent Hamiltonian $H({\lambda})$ that is…
Deterministic quantum computation with one quantum bit (DQC1) is a restricted model of quantum computing where the input state is the completely mixed state except for a single clean qubit, and only a single output qubit is measured at the…
We construct a family of time-independent nearest-neighbor Hamiltonians coupling eight-state systems on a 1D ring that enables universal quantum computation. Hamiltonians in this family can achieve universality either by driving a…
We derived a condition under which a coupled system consisting of two finite-dimensional Hamiltonian systems becomes a Hamiltonian system. In many cases, an industrial system can be modeled as a coupled system of some subsystems. Although…
In the study of bi-Hamiltonian systems (both classical and quantum) one starts with a given dynamics and looks for all alternative Hamiltonian descriptions it admits.In this paper we start with two compatible Hermitian structures (the…
Transition probabilities for a class of two level systems described by explicitly time dependent Hamiltonians are considered. Provided only that the approach to the infinite time limit is non-trivial falling at least as fast as 1/t for…
In this work, we revisit several families of standard Hamiltonians that appear in the literature and discuss their symmetries and conserved quantities in the language of commutant algebras. In particular, we start with families of…
Inspired by connections to two dimensional quantum theory, we define several models of computation based on permuting distinguishable particles (which we call balls), and characterize their computational complexity. In the quantum setting,…
Non hermitian Hamiltonians play an important role in the study of dissipative quantum systems. We show that using states with time dependent normalization can simplify the description of such systems especially in the context of the…
In an attempt to better leverage superconducting quantum computers, scaling efforts have become the central concern. These efforts have been further exacerbated by the increased complexity of these circuits. The added complexity can…
A quadrillion dimensional Hilbert space hosted by a quantum processor with over 50 physical qubits has been expected to be powerful enough to perform computational tasks ranging from simulations of many-body physics to complex financial…
We derive an explicit Hamiltonian for copying the basis up and down states of a quantum two-state system - a qubit - onto n "copy" qubits initially all prepared in the down state. In terms of spin components, for spin-1/2 particle spin…
We use complexity theory to rigorously investigate the difficulty of classically simulating evolution under many-body localized (MBL) Hamiltonians. Using the defining feature that MBL systems have a complete set of quasilocal integrals of…
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…
We consider error suppression schemes in which quantum information is encoded into the ground subspace of a Hamiltonian comprising a sum of commuting terms. Since such Hamiltonians are gapped they are considered natural candidates for…