Related papers: Computational challenges in the relativistic few-n…
We present some informal remarks on aspects of relativistic quantum computing.
I will give an overview of what I see as some of the most important future directions in the theory of fault-tolerant quantum computation. In particular, I will give a brief summary of the major problems that need to be solved in fault…
In this lecture I give a brief review of low-dimensional few-body problems recently encountered in attempting a quantitative description of ultracold atoms and molecules confined in 2D and 1D optical lattices. Multi-channel nature of these…
This work connects two mathematical fields - computational complexity and interval linear algebra. It introduces the basic topics of interval linear algebra - regularity and singularity, full column rank, solving a linear system, deciding…
The article presents an introductory review of quantum algorithms for non-relativisitc as well as relativistic four component molecular energy calculations developed in past few years.
We draw two incomplete, biased maps of challenges in computational complexity lower bounds.
Quantum computers are expected to be able to solve mathematical problems that cannot be solved using conventional computers. Many of these problems are of practical importance, especially in the areas of cryptography and secure…
We present an algorithm to compute the number of solutions of the (constrained) number partitioning problem. A concrete implementation of the algorithm on an Ising-type quantum computer is given.
In this paper, the application of quantum simulations and quantum machine learning to solve low-energy nuclear physics problems is explored. The use of quantum computing to deal with nuclear physics problems is, in general, in its infancy…
Future quantum computers are anticipated to be able to perform simulations of quantum many-body systems and quantum field theories that lie beyond the capabilities of classical computation. This will lead to new insights and predictions for…
I give a brief overview of fault-tolerant quantum computation, with an emphasis on recent work and open questions.
In connection with the contribution "Quantum Condensates in Nuclear Matter" some problems are given to become more familiar with the techniques of many-particle physics.
The development of computational techniques in the last decade has made possible to attack some classical problems of algebraic geometry. In this survey, we briefly describe some open problems related to algebraic curves which can be…
The purpose of this paper is to explore the applications of quantum computing to energy systems optimization problems and discuss some of the challenges faced by quantum computers with techniques to overcome them. The basic concepts…
One of the most promising suggested applications of quantum computing is solving classically intractable chemistry problems. This may help to answer unresolved questions about phenomena like: high temperature superconductivity, solid-state…
A brief introduction to light front techniques is presented. This is followed by a review of recent attempts to perform realistic, relativistic nuclear physics with those techniques.
This presentation reports on recent developments concerning basic aspects of low-energy QCD as they relate to the understanding of the nucleon mass and the nuclear many-body problem.
This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…
The analysis of papers on usage NMR in quantum computations is provided and the probable direction of the future investigations are considered.
Complexity theory as practiced by physicists and computational complexity theory as practiced by computer scientists both characterize how difficult it is to solve complex problems. Here it is shown that the parameters of a specific model…