Related papers: Quantum Algorithm for the Advection-Diffusion Equa…
Exact and nonperturbative quantum master equation can be constructed via the calculus on path integral. It results in hierarchical equations of motion for the reduced density operator. Involved are also a set of well--defined auxiliary…
We propose a computationally efficient method to solve the dynamics of operators of bosonic quantum systems coupled to their environments. The method maps the operator under interest to a set of complex-valued functions, and its adjoint…
By precisely writing down the matrix element of the local Boltzmann operator, we have proposed a new path integral formulation for quantum field theory and developed a corresponding Monte Carlo algorithm. With current formula, the…
As the number of processor cores on supercomputers becomes larger and larger, algorithms with high degree of parallelism attract more attention. In this work, we propose a novel space-time coupled algorithm for solving an inverse problem…
The infinite time-evolving block decimation (iTEBD) algorithm [Phys. Rev. Lett. 98, 070201 (2007)] allows to simulate unitary evolution and to compute the ground state of one-dimensional quantum lattice systems in the thermodynamic limit.…
Over a decade ago, it was demonstrated that quantum computing has the potential to revolutionize numerical linear algebra by enabling algorithms with complexity superior to what is classically achievable, e.g., the seminal HHL algorithm for…
We investigate the possibility of solving continuous non-convex optimization problems using a network of interacting quantum optical oscillators. We propose a native encoding of continuous variables in analog signals associated with the…
This note is devoted to the distributed optimization problem of multi-agent systems with nonconvex velocity constraints, nonuniform position constraints and nonuniform stepsizes. Two distributed constrained algorithms with nonconvex…
The advent of quantum computing can potentially revolutionize how complex problems are solved. This paper proposes a two-loop quantum-classical solution algorithm for generation scheduling by infusing quantum computing, machine learning,…
This paper summarizes a quantum algorithm of [R.D. Somma, et.al., Phys. Rev. Lett. 101, 130504 (2008)] that simulates a classical annealing process for solving discrete optimization problems. The complexity of the quantum algorithm scales…
This review is devoted to the different techniques that have been developed to compute the phase-coherent transport properties of quantum nanoelectronic systems connected to electrodes. Beside a review of the different algorithms proposed…
Variational quantum algorithms offer a promising new paradigm for solving partial differential equations on near-term quantum computers. Here, we propose a variational quantum algorithm for solving a general evolution equation through…
In this paper, the distributed strongly convex optimization problem is studied with spatio-temporal compressed communication and equality constraints. For the case where each agent holds an distributed local equality constraint, a…
Complexity of the Operations Research Theory tasks can be often diminished in cases that do not require finding the exact solution. For example, forecasting two-dimensional hierarchical time series leads us to the transportation problem…
We present a quantum algorithm for simulating open quantum systems coupled to Gaussian environments valid for any configuration and coupling strength. The algorithm is applicable to problems with strongly coupled, or non-Markovian,…
The study of real-time evolution of lattice quantum field theories using classical computers is known to scale exponentially with the number of lattice sites. Due to a fundamentally different computational strategy, quantum computers hold…
Current approaches to fault-tolerant quantum computation will not enable useful quantum computation on near-term devices of 50 to 100 qubits. Leading proposals, such as the color code and surface code schemes, must devote a large fraction…
We present a new $4$-approximation algorithm for the Combinatorial Motion Planning problem which runs in $\mathcal{O}(n^2\alpha(n^2,n))$ time, where $\alpha$ is the functional inverse of the Ackermann function, and a fully distributed…
The advection-diffusion and wave equations are the fundamental equations governing any physical law and therefore arise in many areas of physics and astrophysics. For complex problems and geometries, only numerical simulations can give…
We present a quantum algorithm that analyzes time series data simulated by a quantum differential equation solver. The proposed algorithm is a quantum version of the dynamic mode decomposition algorithm used in diverse fields such as fluid…