相关论文: Treating the Independent Set Problem by 2D Ising I…

At present, several models for quantum computation have been proposed. Adiabatic quantum computation scheme particularly offers this possibility and is based on a slow enough time evolution of the system, where no transitions take place. In…

Understanding NP-complete problems is a central topic in computer science. This is why adiabatic quantum optimization has attracted so much attention, as it provided a new approach to tackle NP-complete problems using a quantum computer.…

A promising paradigm of quantum computing for achieving practical quantum advantages is quantum annealing or quantum approximate optimization algorithm, where the classical problems are encoded in Ising interactions. However, it is…

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…

In [R. Jozsa, B. Kraus, A. Miyake, J. Watrous, Proc. R. Soc. A {\bf 466}, 809-830 (2010)] it has been shown that a match gate circuit running on n qubits can be compressed to a universal quantum computation on \log(n)+3 qubits. Here, we…

The shift of interest from general purpose quantum computers to adiabatic quantum computing or quantum annealing calls for a broadly applicable and easy to implement test to assess how quantum or adiabatic is a specific hardware. Here we…

Quantum simulators have the potential to solve quantum many-body problems that are beyond the reach of classical computers, especially when they feature long-range entanglement. To fulfill their prospects, quantum simulators must be fully…

Quantum annealing is a way to prepare an eigenstate of the problem Hamiltonian. Starting from an eigenstate of a trivial Hamiltonian, we slowly change the Hamiltonian to the problem Hamiltonian, and the system remains in the eigenstate of…

The k-local Hamiltonian problem is a natural complete problem for the complexity class QMA, the quantum analog of NP. It is similar in spirit to MAX-k-SAT, which is NP-complete for k<=2. It was known that the problem is QMA-complete for any…

Non-adiabatic holonomic quantum computation in decoherence-free subspaces protects quantum information from control imprecisions and decoherence. For the non-collective decoherence that each qubit has its own bath, we show the…

By using the effective Hamiltonian approach, we present a self-consistent framework for the analysis of geometric phases and dynamically stable decoherence-free subspaces in open systems. Comparisons to the earlier works are made. This…

Quantum state tomography is an essential tool for the characterization and verification of quantum states. However, as it cannot be directly applied to systems with more than a few qubits, efficient tomography of larger states on mid-sized…

With qubits encoded into atomic ground and Rydberg states and situated on the vertexes of a graph, the conditional quantum dynamics of Rydberg blockade, which inhibits simultaneous excitation of nearby atoms, has been employed recently to…

We analyse a nonadiabatic self-consistent field method by means of an exactly-solvable model. The method is based on nuclear and electronic orbitals that are functions of the cartesian coordinates in the laboratory-fixed frame. The kinetic…

Matching problems on 3D shapes and images are challenging as they are frequently formulated as combinatorial quadratic assignment problems (QAPs) with permutation matrix constraints, which are NP-hard. In this work, we address such problems…

The exact solution of a two-dimensional (2D) Ising model with the next nearest interactions at zero magnetic field is derived. At first, the transfer matrices are analyzed in three representations, i.e., Clifford algebraic representation,…

Adiabatic quantum computing is a powerful framework for state preparation, while its evolution time often scales quadratically in the inverse Hamiltonian spectral gap, leading to sub-optimal computational complexity. In this work, we…

We show that the stochastic dynamics of a large class of one-dimensional interacting particle systems may be presented by integrable quantum spin Hamiltonians. Generalizing earlier work \cite{Stin95a,Stin95b} we present an alternative…

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 provide exact analytical solutions for a two dimensional explicitly time-dependent non-Hermitian quantum system. While the time-independent variant of the model studied is in the broken PT-symmetric phase for the entire range of the…