Related papers: Quantum speed-up for solving the one-dimensional H…
We explore the potential application of quantum annealing to address the protein structure problem. To this end, we compare several proposed ab initio protein folding models for quantum computers and analyze their scaling and performance…
Within the framework of imaginary-time evolution for matrix product states, we introduce a cluster version of the infinite time-evolving block decimation algorithm for simulating quantum many-body systems, addressing the computational…
A quantum system will stay near its instantaneous ground state if the Hamiltonian that governs its evolution varies slowly enough. This quantum adiabatic behavior is the basis of a new class of algorithms for quantum computing. We test one…
Geometry and dimensionality have played crucial roles in our understanding of the fundamental laws of nature, with examples ranging from curved space-time in general relativity to modern theories of quantum gravity. In quantum many-body…
We developed a non-Hermitian quantum optimization algorithm to find the ground state of the ferromagnetic Ising model with up to 1024 spins (qubits). Our approach leads to significant reduction of the annealing time. Analytical and…
Simulating quantum many-body systems is a highly demanding task since the required resources grow exponentially with the dimension of the system. In the case of fermionic systems, this is even harder since nonlocal interactions emerge due…
Quantum annealing is an innovative idea and method for avoiding the increase of the calculation cost of the combinatorial optimization problem. Since the combinatorial optimization problems are ubiquitous, quantum annealing machine with…
This tutorial offers a quick, hands-on introduction to solving Quadratic Unconstrained Binary Optimization (QUBO) models on currently available quantum computers and their simulators. We cover both IBM and D-Wave machines: IBM utilizes a…
A numerical bootstrap method is proposed to provide rigorous and nontrivial bounds in general quantum many-body systems with locality. In particular, lower bounds on ground state energies of local lattice systems are obtained by imposing…
In the theory of Bethe-ansatz integrable quantum systems, rapidities play an important role as they are used to specify many-body states, apart from phases. The physical interpretation of rapidities going back to Sutherland is that they are…
It is difficult to calculate the energy levels and eigenstates of a large physical system on a classical computer because of the exponentially growing size of the Hilbert space. In this work, we experimentally demonstrate a quantum…
We investigate an efficient, generic method for evaluating the performance of quantum annealing devices that does not require the prior knowledge of the true ground state of the benchmark problem. This approach exploits symmetry properties…
Quantum computers have been widely speculated to offer significant advantages in obtaining the ground state of difficult Hamiltonian in chemistry and physics. In this work, we first propose a Lyapunov control-inspired strategy to accelerate…
Quantum information platforms enable analog quantum simulations, such as quantum annealing, offering a promising route to solving complex combinatorial optimization problems. Here, we propose a quantum information architecture based on…
A new quantum algorithm is proposed to solve Satisfiability(SAT) problems by taking advantage of non-unitary transformation in ground state quantum computer. The energy gap scale of the ground state quantum computer is analyzed for 3-bit…
The Potts model is a generalization of the Ising model with $Q>2$ components. In the fully connected ferromagnetic Potts model, a first-order phase transition is induced by varying thermal fluctuations. Therefore, the computational time…
Quantum annealing (QA) is one of the ways to search the ground state of the problem Hamiltonian. Here, we propose the QA scheme to search arbitrary excited states of the problem Hamiltonian. In our scheme, an $n$-th excited state of the…
A dilutely filled $N$-site optical lattice near zero temperature within a high-$Q$ multimode cavity can be mapped to a spin ensemble with tailorable interactions at all length scales. The effective full site to site interaction matrix can…
Transcorrelated methods provide an efficient way of partially transferring the description of electronic correlations from the ground state wavefunction directly into the underlying Hamiltonian. In particular, Dobrautz et al. [Phys. Rev. B,…
We provide fast algorithms for simulating many body Fermi systems on a universal quantum computer. Both first and second quantized descriptions are considered, and the relative computational complexities are determined in each case. In…