Related papers: An exact solution of the partition function for me…
Quantum annealing is a generic solver for optimization problems that uses fictitious quantum fluctuation. The most groundbreaking progress in the research field of quantum annealing is its hardware implementation, i.e., the so-called…
We consider open many-body systems governed by a time-dependent quantum master equation with short-range interactions. With a generalized Lieb-Robinson bound, we show that the evolution in this very generic framework is quasi-local, i.e.,…
We present several improvements to the standard Trotter-Suzuki based algorithms used in the simulation of quantum chemistry on a quantum computer. First, we modify how Jordan-Wigner transformations are implemented to reduce their cost from…
A general time-dependent quantum system can be driven fast from its initial ground state to its final ground state without generating transitions by adding a steering term to the Hamiltonian. We show how this technique can be modified to…
We propose a simple quantum algorithm for simulating highly oscillatory quantum dynamics, which does not require complicated quantum control logic for handling time-ordering operators. To our knowledge, this is the first quantum algorithm…
We revisit the so-called folded XXZ model, which was treated earlier by two independent research groups. We argue that this spin-1/2 chain is one of the simplest quantum integrable models, yet it has quite remarkable physical properties.…
The purpose of this work is the development of space-time discretization schemes for phase-field optimal control problems. Specifically in the optimal control minimization problem, a tracking-type cost functional is minimized to steer the…
Simulation of quantum chemistry is expected to be a principal application of quantum computing. In quantum simulation, a complicated Hamiltonian describing the dynamics of a quantum system is decomposed into its constituent terms, where the…
We show that quantum computation can be performed in a system at thermal equilibrium if a spontaneous symmetry breaking occurs. The computing process is associated to the time evolution of the statistical average of the qubit coherence…
An investigation is presented of the utility of semiclassical approximations for solving the quantum-impurity problems arising in the dynamical-mean-field approach to the correlated-electron models. The method is based on performing a exact…
In this article, we present a general methodology for stochastic control problems driven by the Brownian motion filtration including non-Markovian and non-semimartingale state processes controlled by mutually singular measures. The main…
Motivated by the recent development of quantum technology using quantum annealing technique and the recent works on the static properties of the Sherrington-Kirkpatrick (SK) spin glass model, we study quantum annealing of the spin glass…
Many search-based quantum algorithms that achieve a theoretical speedup are not practically relevant since they require extraordinarily long coherence times, or lack the parallelizability of their classical counterparts.This raises the…
We express the partition function for an equilibrium system of interacting particles in the canonical ensemble as a functional integration over the particles' density field. We outline a method to evaluate the partition function by…
Product formulas for Trotter Suzuki simulation remain a practical route to Hamiltonian evolution on noisy intermediate scale quantum (NISQ) hardware, yet their accuracy hinges on three coupled choices: term grouping, product formula order,…
The Schmidt decomposition is the go-to tool for measuring bipartite entanglement of pure quantum states. Similarly, it is possible to study the entangling features of a quantum operation using its operator-Schmidt, or tensor product…
In this work, we introduce a new iterative quantum algorithm, called Iterative Symphonic Tunneling for Satisfiability problems (IST-SAT), which solves quantum spin glass optimization problems using high-frequency oscillating transverse…
Quantum simulation is a promising application for quantum computing. Quantum simulation algorithms may require the ability to control the time evolution unitary. Naive techniques to control a unitary can substantially increase the required…
Stable computational algorithms for the approximate solution of the Cauchy problem for nonstationary problems are based on implicit time approximations. Computational costs for boundary value problems for systems of coupled multidimensional…
We examine the quantization of pseudoclassical dynamical systems, models that have classically anticommuting variables, in the Schr\"odinger picture. We quantize these systems, which can be viewed as classical models of particle spin, using…