Related papers: Calculation of generating function in many-body sy…
A generating coordinate is introduced into the exchange-correlation functional of density-functional theory (DFT). The many-body wave function is represented as a superposition of Kohn-Sham (KS) Slater determinants arising from different…
Simulating quantum many-body systems is a highly demanding task since the required resources grow exponentially with the dimension of the system. In the case of fermionic systems, this is even harder since nonlocal interactions emerge due…
In this educational paper, we will discuss calculations on the hydrogen molecule both on classical and quantum computers. In the former case, we will discuss the calculation of molecular integrals that can then be used to calculate…
Quantum simulation of complex quantum systems and their properties often requires the ability to prepare initial states in an eigenstate of the Hamiltonian to be simulated. In addition, to compute the eigenvalues of a Hamiltonian is in…
A state-of-the-art method that combines a quantum computational algorithm and machine learning, so-called quantum machine learning, can be a powerful approach for solving quantum many-body problems. However, the research scope in the field…
Geometry and dimensionality have played crucial roles in our understanding of the fundamental laws of nature, with examples ranging from curved space-time in general relativity to modern theories of quantum gravity. In quantum many-body…
The classical Coriolis force finds its quantum analogue in the difference $\Sigma(t)=H(t)-G(t)$ where the ``true'', observable Hamiltonian $H(t)$ represents the instantaneous energy. The other, ``false'' Hamiltonian $G(t)$ generates the…
Efficiently characterising quantum systems, verifying operations of quantum devices and validating underpinning physical models, are central challenges for the development of quantum technologies and for our continued understanding of…
In the near future, material and drug design may be aided by quantum computer assisted simulations. These have the potential to target chemical systems intractable by the most powerful classical computers. However, the resources offered by…
Extensions of average Hamiltonian theory to quantum computation permit the design of arbitrary Hamiltonians, allowing rotations throughout a large Hilbert space. In this way, the kinematics and dynamics of any quantum system may be…
We show that quantum theory (QT) is a substructure of classical probabilistic physics. The central quantity of the classical theory is Hamilton's function, which determines canonical equations, a corresponding flow, and a Liouville equation…
A quantum walk is a time-homogeneous quantum-mechanical process on a graph defined by analogy to classical random walk. The quantum walker is a particle that moves from a given vertex to adjacent vertices in quantum superposition. Here we…
The preparation of Hamiltonian eigenstates is essential for many applications in quantum computing; the efficiency with which this can be done is of key interest. A canonical approach exploits the quantum phase estimation (QPE) algorithm.…
If there exists a classical, i.e. deterministic theory underlying quantum mechanics, an explanation must be found of the fact that the Hamiltonian, which is defined to be the operator that generates evolution in time, is bounded from below.…
Analytic continuation of the classical dynamics generated by a standard Hamiltonian, H = p^2/2m + v(x), into the complex plane yields a particular complex classical dynamical system. For an analytic potential v, we show that the resulting…
Hamiltonian quantum gates controlled by classical electromagnetic fields form the basis of any realistic model of quantum computers. In this letter, we derive a lower bound on the field energy required to implement such gates and relate…
Simulating the time-evolution of a Hamiltonian is one of the most promising applications of quantum computers. Multi-Product Formulas (MPFs) are well suited to replace standard product formulas since they scale better with respect to time…
Experimental implementations of quantum computer architectures are now being investigated in many different physical settings. The full set of requirements that must be met to make quantum computing a reality in the laboratory [1] is…
In the past four decades, the notion of quantum polynomial-time computability has been mathematically modeled by quantum Turing machines as well as quantum circuits. This paper seeks the third model, which is a quantum analogue of the…
Quantum computers will work by evolving a high tensor power of a small (e.g. two) dimensional Hilbert space by local gates, which can be implemented by applying a local Hamiltonian H for a time t. In contrast to this quantum engineering,…