Related papers: Computational challenges in the relativistic few-n…
This contribution gives a short review of recent theoretical advances in most topics of nuclear cluster physics concentrating, however, around {$\alpha$} particle clustering. Along the route, the point of view will be critical mentioning…
We discuss the challenges of modeling X-ray bursts in multi-dimensions, review the different calculations done to date, and discuss our new set of ongoing simulations. We also describe algorithmic improvements that may help in the future to…
These lecture notes are an informal introduction to the theory of computational complexity and its links to quantum computing and statistical mechanics.
In the last couple of decades, the world has seen several stunning instances of quantum algorithms that provably outperform the best classical algorithms. For most problems, however, it is currently unknown whether quantum algorithms can…
I assess the potential of quantum computation. Broad and important applications must be found to justify construction of a quantum computer; I review some of the known quantum algorithms and consider the prospects for finding new ones.…
The status of our understanding of relativistic sum rules is reviewed. The recent development of new theoretical methods for the evaluation of these sum rules offers hope for further advances in this challenging field. These new techniques…
This article outlines our point of view regarding the applicability, state-of-the-art, and potential of quantum computing for problems in finance. We provide an introduction to quantum computing as well as a survey on problem classes in…
Quantum computing is a new computational paradigm with the potential to solve certain computationally challenging problems much faster than traditional approaches. Civil engineering encompasses many computationally challenging problems,…
Many mechanical engineering applications call for multiscale computational modeling and simulation. However, solving for complex multiscale systems remains computationally onerous due to the high dimensionality of the solution space.…
What is computable with limited resources? How can we verify the correctness of computations? How to measure computational power with precision? Despite the immense scientific and engineering progress in computing, we still have only…
We study some aspects of the Quantum Brachistochrone Problem. Physical realizability of the faster pseudo Hermitian version of the problem is also discussed. This analysis, applied to simple quantum gates, supports an informational…
In this article we cover the canonical problem formulation necessary to program the D-Wave quantum processing unit (QPU) and discuss how such a problem is compiled onto the QPU. We also cover recent joint work solving a problem from…
Computational models are an essential tool for the design, characterization, and discovery of novel materials. Hard computational tasks in materials science stretch the limits of existing high-performance supercomputing centers, consuming…
We survey some recent work on topological quantum computation with gapped boundaries and boundary defects and list some open problems.
Tasked with the challenge to build better and better computers, quantum computing and classical computing face the same conundrum: the success of classical computing systems. Small quantum computing systems have been demonstrated, and…
In this paper we give an overview of the quantum computational complexity class QMA and a description of known QMA-complete problems to date. Such problems are believed to be difficult to solve, even with a quantum computer, but have the…
During the last 15 years, there has been much progress in defining the nuclear Hamiltonian and applying quantum Monte Carlo methods to the calculation of light nuclei. I describe both aspects of this work and some recent results.
Modern adiabatic quantum computers (AQC) are already used to solve difficult combinatorial optimisation problems in various domains of science. Currently, only a few applications of AQC in computer vision have been demonstrated. We review…
I first comment on some recent advances in computing equipment for CPU-intensive numerical simulations, and on possible developments in the near future. I then discuss some particularly important and yet unsolved problems in dynamics and…
The Hilbert space formalism of quantum mechanics is reviewed with emphasis on applications to quantum computing. Standard interferomeric techniques are used to construct a physical device capable of universal quantum computation. Some…