Related papers: Complexity classification of two-qubit commuting h…
We introduce an intermediate quantum computing model built from translation-invariant Ising-interacting spins. Despite being non-universal, the model cannot be classically efficiently simulated unless the polynomial hierarchy collapses.…
What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? We provide an efficient algorithm to simulate any desired two-body Hamiltonian evolution using any fixed two-body entangling n-qubit…
What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? Dodd et al. (quant-ph/0106064) provided a partial solution to this problem in the form of an efficient algorithm to simulate any desired…
Effective Hamiltonian methods are utilized to model the two-qubit cross-resonance gate for both the ideal two-qubit case and when higher levels are included. Analytic expressions are obtained in the qubit case and the higher-level model is…
Given a Hamiltonian that is a sum of commuting few-body terms, the commuting Hamiltonian problem is to determine if there exists a quantum state that is the simultaneous eigenstate of all of these terms that minimizes each term…
Quantum simulators with hundreds of qubits and engineerable Hamiltonians have the potential to explore quantum many-body models that are intractable for classical computers. However, learning the simulated Hamiltonian, a prerequisite for…
We show that the general Heisenberg Hamiltonian with non-uniform couplings can be characterised by mapping the entanglement it generates as a function of time. Identification of the Hamiltonian in this way is possible as the coefficients of…
We study the complexity of classically sampling from the output distribution of an Ising spin model, which can be implemented naturally in a variety of atomic, molecular, and optical systems. In particular, we construct a specific example…
We study the complexity of local Hamiltonians in which the terms pairwise commute. Commuting local Hamiltonians (CLHs) provide a way to study the role of non-commutativity in the complexity of quantum systems and touch on many fundamental…
We prove that adiabatic computation is equivalent to standard quantum computation even when the adiabatic quantum system is restricted to be a set of particles on a one-dimensional chain. We give a construction that uses a 2-local…
What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? It has been shown that all two-body Hamiltonian evolutions can be simulated using \emph{any} fixed two-body entangling $n$-qubit…
Many quantum algorithms, such as adiabatic algorithms (e.g. AQC) and phase randomisation, require simulating Hamiltonian evolution. In addition, the simulation of physical systems is an important objective in its own right. In many cases,…
When can a quantum system of finite dimension be used to simulate another quantum system of finite dimension? What restricts the capacity of one system to simulate another? In this paper we complete the program of studying what simulations…
The space of quantum Hamiltonians has a natural partition in classes of operators that can be adiabatically deformed into each other. We consider parametric families of Hamiltonians acting on a bi-partite quantum state-space. When the…
An old conjecture claims that commuting Hamiltonians of the double-elliptic integrable system are constructed from the theta-functions associated with Riemann surfaces from the Seiberg-Witten family, with moduli treated as dynamical…
We use the class of commuting quantum computations known as IQP (Instantaneous Quantum Polynomial time) to strengthen the conjecture that quantum computers are hard to simulate classically. We show that, if either of two plausible…
We prove that if a sequence of pairs of smooth commuting Hamiltonians converge in the $C^0$ topology to a pair of smooth Hamiltonians, these commute. This allows us define the notion of commuting continuous Hamiltonians. As an application…
The study of quantum circuits composed of commuting gates is particularly useful to understand the delicate boundary between quantum and classical computation. Indeed, while being a restricted class, commuting circuits exhibit genuine…
This paper extends work done to date on quantum computation by associating potentials with different types of computation steps. Quantum Turing machine Hamiltonians, generalized to include potentials, correspond to sums over tight binding…
As quantum computers mature, the applicability in practice becomes more important. Many uses of quantum computers will be hybrid, with classical computers still playing an important role in operating and using the quantum computer. The term…