Related papers: NLO Renormalization in the Hamiltonian Truncation
We introduce a method that ensures efficient computation of one-dimensional quantum systems with long-range interactions across all temperatures. Our algorithm operates within a quasi-polynomial runtime for inverse temperatures up to…
We present a quantum algorithm for simulating rovibrational Hamiltonians on fault-tolerant quantum computers. The method integrates exact curvilinear kinetic energy operators and general-form potential energy surfaces expressed in a hybrid…
We introduce an iterative importance truncation scheme which aims at reducing the dimension of the model space of configuration interaction approaches by an a priori selection of the physically most relevant basis states. Using an…
We present a proposal for the realization of entanglement Hamiltonians in one-dimensional critical spin systems with strongly interacting cold atoms. Our approach is based on the notion that the entanglement spectrum of such systems can be…
The past years have witnessed impressive advances in electronic structure calculation, especially in the complexity and size of the systems studied, as well as in computation time. Linear scaling methods based on empirical tight-binding…
In finite element methods (FEMs), the accuracy of the solution cannot increase indefinitely because the round-off error increases when the number of degrees of freedom (DoFs) is large enough. This means that the accuracy that can be reached…
Many fundamental properties of a quantum system are captured by its Hamiltonian and ground state. Despite the significance of ground states preparation (GSP), this task is classically intractable for large-scale Hamiltonians. Quantum neural…
Hermite polynomials and functions have extensive applications in scientific and engineering problems. Although it is recognized that employing the scaled Hermite functions rather than the standard ones can remarkably enhance the…
This work aims to address the bottleneck issues of hardware resource limitation and decoherence error in the Hamiltonian simulation of quantum fluids, which are caused by the standard quantum Fourier transform and the evolution of momentum…
Bayesian inference, while foundational to probabilistic reasoning, is often hampered by the computational intractability of posterior distributions, particularly through the challenging evidence integral. Conventional approaches like Markov…
Many promising quantum applications depend on the efficient quantum simulation of an exponentially large sparse Hamiltonian, a task known as sparse Hamiltonian simulation, which is fundamentally important in quantum computation. Although…
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…
Simulating the dynamics of many-body quantum systems is believed to be one of the first fields that quantum computers can show a quantum advantage over classical computers. Noisy intermediate-scale quantum (NISQ) algorithms aim at…
Hamiltonian light-front field theory can be used to solve for hadron states in QCD. To this end, a method has been developed for systematic renormalization of Hamiltonian light-front field theories, with the hope of applying the method to…
For Hamiltonian systems, simulation algorithms that exactly conserve numerical energy or pseudo-energy have seen extensive investigation. Most available methods either require the iterative solution of nonlinear algebraic equations at each…
We establish a connection between quantum mechanics and computation, revealing fundamental limitations for algorithms computing spectra, especially in non-Hermitian settings. Introducing the concept of locally trivial pseudospectra (LTP),…
We introduce an algorithm aimed to reduce the dimensions of Hilbert space. It is used here in order to study the behaviour of low energy states of strongly interacting quantum many-body systems at first order transitions and avoided…
Within the framework of the covariant formulation of light-front dynamics, we develop a general non-perturbative renormalization scheme based on the Fock decomposition of the state vector and its truncation. The counterterms and bare…
The numerical renormalization group (NRG) is rephrased as a variational method with the cost function given by the sum of all the energies of the effective low-energy Hamiltonian. This allows to systematically improve the spectrum obtained…
Quantum computing shows promise for addressing computationally intensive problems but is constrained by the exponential resource requirements of general quantum state tomography (QST), which fully characterizes quantum states through…