相关论文: Realizable Hamiltonians for Universal Adiabatic Qu…

We describe methods for simulating general second-quantized Hamiltonians using the compact encoding, in which qubit states encode only the occupied modes in physical occupation number basis states. These methods apply to second-quantized…

We study a scheme of quantum simulator for two-dimensional xy-model Hamiltonian. Previously the quantum simulator for a coupled cavity array spin model has been explored, but the coupling strength is fixed by the system parameters. In the…

Based on the standard many-fermion field theory, the authors construct models describing ultracold fermions in a 1D optical lattices by implementing a mode expansion of the fermionic field operator where modes, in addition to space…

The QMA-completeness of the local Hamiltonian problem is a landmark result of the field of Hamiltonian complexity that studies the computational complexity of problems in quantum many-body physics. Since its proposal, substantial effort has…

We study mappings between distinct classical spin systems that leave the partition function invariant. As recently shown in [Phys. Rev. Lett. 100, 110501 (2008)], the partition function of the 2D square lattice Ising model in the presence…

We introduce a family of Hamiltonian systems for measurement-based quantum computation with continuous variables. The Hamiltonians (i) are quadratic, and therefore two body, (ii) are of short range, (iii) are frustration-free, and (iv)…

The adiabatic quantum algorithm has drawn intense interest as a potential approach to accelerating optimization tasks using quantum computation. The algorithm is most naturally realised in systems which support Hamiltonian evolution, rather…

The regular structures obtained by optical lattice technology and their behaviour are analysed from the quantum information perspective. Initially, we demonstrate that a triangular optical lattice of two atomic species, bosonic or…

Quantum computation provides exponential speedup for solving certain mathematical problems against classical computers. Motivated by current rapid experimental progress on quantum computing devices, various models of quantum computation…

We prove that estimating the ground state energy of a translationally-invariant, nearest-neighbour Hamiltonian on a 1D spin chain is QMAEXP-complete, even for systems of low local dimension (roughly 40). This is an improvement over the best…

We propose a method for Hamiltonian engineering in quantum information processing architectures that requires no local control, but only relies on collective qubit rotations and field gradients. The technique achieves a spatial modulation…

Digital quantum simulators are among the most appealing applications of a quantum computer. Here we propose a universal, scalable, and integrated quantum computing platform based on tunable nonlinear electromechanical nano-oscillators. It…

In this work we consider the ground space connectivity problem for commuting local Hamiltonians. The ground space connectivity problem asks whether it is possible to go from one (efficiently preparable) state to another by applying a…

An open question in designing superconducting quantum circuits is how best to reduce the full circuit Hamiltonian which describes their dynamics to an effective two-level qubit Hamiltonian which is appropriate for manipulation of quantum…

We propose a simple, robust protocol to prepare a low-energy state of an arbitrary Hamiltonian on a quantum computer or programmable quantum simulator. The protocol is inspired by the adiabatic demagnetization technique, used to cool…

In the framework of quantum groups and additive R-matrices, the fusion procedure allows to construct higher-dimensional solutions of the Yang-Baxter equation. These solutions lead to integrable one-dimensional spin-chain Hamiltonians. Here…

In this paper, we consider spin systems in three spatial dimensions, and prove that the local Hamiltonian problem for 3D lattices with face-centered cubic unit cells, 4-local translationally-invariant interactions between spin-3/2 particles…

We characterise a model of universal quantum computation where the register (computational) qubits are controlled by ancillary qubits, using only a single fixed interaction between register and ancillary qubits. No additional access is…

We present a hybrid quantum-classical algorithm to simulate thermal states of a classical Hamiltonians on a quantum computer. Our scheme employs a sequence of locally controlled rotations, building up the desired state by adding qubits one…

We develop a scheme of fast forward of adiabatic spin dynamics of quantum entangled states. We settle the quasi-adiabatic dynamics by adding the regularization terms to the original Hamiltonian and then accelerate it with use of a large…