Related papers: Finite Imaginary-Time Evolution for Polynomial Unc…
We present a quantum algorithm for simulating the time evolution generated by any bounded, time-dependent operator $-A$ with non-positive logarithmic norm, thereby serving as a natural generalization of the Hamiltonian simulation problem.…
Efficient ground state search is fundamental to advancing combinatorial optimization problems and quantum chemistry. While the Variational Imaginary Time Evolution (VITE) method offers a useful alternative to Variational Quantum Eigensolver…
Quantum state preparation plays a crucial role in several areas of quantum information science, in applications such as quantum simulation, quantum metrology and quantum computing. However, typically state preparation requires resources…
Quadratic Unconstrained Binary Optimization (QUBO) is recognized as a unifying framework for modeling a wide range of problems. Problems can be solved with commercial solvers customized for solving QUBO and since QUBO have degree two, it is…
We propose a nonvariational scheme for geometry optimization of molecules for the first-quantized eigensolver, a recently proposed framework for quantum chemistry using the probabilistic imaginary-time evolution (PITE) on a quantum…
Simulating time evolution of generic quantum many-body systems using classical numerical approaches has an exponentially growing cost either with evolution time or with the system size. In this work, we present a polynomially scaling hybrid…
Quadratic Unconstrained Binary Optimization (QUBO) is a broad class of optimization problems with many practical applications. To solve its hard instances in an exact way, known classical algorithms require exponential time and several…
We study the problem of simulating the time evolution of a lattice Hamiltonian, where the qubits are laid out on a lattice and the Hamiltonian only includes geometrically local interactions (i.e., a qubit may only interact with qubits in…
We use matrix product techniques to investigate the performance of two algorithms for obtaining the ground state of a quantum many-body Hamiltonian $H = H_A + H_B$ in infinite systems. The first algorithm is a generalization of the quantum…
In black-box combinatorial optimization, objective evaluations are often expensive, so high quality solutions must be found under a limited budget. Factorization machine with quantum annealing (FMQA) builds a quadratic surrogate model from…
Simulating differential equations on classical computers becomes an intractable problem if the grid size is extremely large. Quantum computers are believed to achieve a possibly exponential speedup in the matrix operation. In this paper, we…
Non-unitary state preparation protocols such as imaginary time evolution (ITE) offer substantial advantages relative to unitary ones, including the ability to prepare certain long-range correlated states more efficiently. Here, we ask…
Imaginary-time evolution plays an important role in algorithms for computing ground-state and thermal equilibrium properties of quantum systems, but can be challenging to simulate on classical computers. Many quantum algorithms for…
This paper develops an algorithmic solution using Ising machines to solve large-scale higher-order binary optimization (HOBO) problems with inequality constraints for resource optimization in wireless communications systems. Quadratic…
We propose a new variational quantum algorithm, which we refer to as TIMES-ADAPT, that prepares time-evolved states in a low-energy or symmetric subspace of a time-independent Hamiltonian on a quantum computer. Using a specially trained…
The spatial photonic Ising machine (SPIM) is a promising optical hardware solver for large-scale combinatorial optimization problems with dense interactions. As the SPIM can represent Ising problems with rank-one coupling matrices,…
Finite element methods provide accurate and efficient methods for the numerical solution of partial differential equations by means of restricting variational problems to finite-dimensional approximating spaces. However, they do not…
The current state of the art for large-scale quantum-mechanical simulations is the planewave (PW) pseudopotential method, as implemented in codes such as VASP, ABINIT, and many others. However, since the PW method uses a global Fourier…
Application of current and near-term quantum hardware to the electronic structure problem is highly limited by qubit counts, coherence times, and gate fidelities. To address these restrictions within the variational quantum eigensolver…
We develop a hybrid qubit-qumode framework for simulating quantum electrodynamics in 2+1 dimensions. In this approach, fermionic matter fields are represented by qubits, while U(1) gauge fields are encoded in continuous-variable bosonic…