Related papers: A new approximation scheme in quantum mechanics
We apply a recently proposed approximation method to the evaluation of non-Gaussian integral and anharmonic oscillator. The method makes use of the truncated perturbation series by recasting it via the modified Laplace integral…
Highly excited states of quantum many-body systems are central objects in the study of quantum dynamics and thermalization that challenge classical computational methods due to their volume-law entanglement content. In this work, we explore…
In this paper we review a proposed geometrical formulation of quantum mechanics. We argue that this geometrization makes available mathematical methods from classical mechanics to the quantum frame work. We apply this formulation to the…
We propose a method to construct the ground state $\psi(\lambda)$ of local lattice hamiltonians with the generic form $H_0 + \lambda H_1$, where $\lambda$ is a coupling constant and $H_0$ is a hamiltonian with a non degenerate ground state…
Conformal field theory, describing systems with scaling symmetry, plays a crucial role throughout physics. We describe a quantum algorithm to simulate the dynamics of conformal field theories, including the action of local conformal…
Universal fault-tolerant quantum computers will require error-free execution of long sequences of quantum gate operations, which is expected to involve millions of physical qubits. Before the full power of such machines will be available,…
The accurate estimation of quantum observables is a critical task in science. With progress on the hardware, measuring a quantum system will become increasingly demanding, particularly for variational protocols that require extensive…
We review our perturbative techniques for improved heavy quark actions. A new procedure for computing improvement coefficients is suggested, where the continuum limit of a lattice-regularized theory provides the matching conditions.We also…
Complex quantum simulation workflows are often hindered by incompatible wavefunction representations adopted across different algorithmic frameworks. In particular, the mismatch between the first- and second-quantization formalisms prevents…
We propose a hybrid quantum-classical algorithm to compute approximate solutions of binary combinatorial problems. We employ a shallow-depth quantum circuit to implement a unitary and Hermitian operator that block-encodes the weighted…
Variational quantum algorithms are tailored to perform within the constraints of current quantum devices, yet they are limited by performance-degrading errors. In this study, we consider a noise model that reflects realistic gate errors…
Reducing circuit depth is essential for implementing quantum simulations of electronic structure on near-term quantum devices. In this work, we propose a variational quantum eigensolver (VQE) based perturbation theory algorithm to…
The variational quantum eigensolver (VQE) is one of the most promising algorithms for low-lying eigenstates calculation on Noisy Intermediate-Scale Quantum (NISQ) computers. Specifically, VQE has achieved great success for ground state…
The adaptive perturbation chooses a non-standard decomposition. The Hamiltonian becomes a sum of solvable and perturbation parts. We calculate the spectrum using the adaptive perturbation method at the leading-order to compare to numerical…
The quantum mechanical transition amplitudes are calculated perturbatively on the basis of the stochastic quantization method of Parisi and Wu. It is shown that the stochastic scheme reproduces the ordinary result for the amplitude and…
In the work it is shown that the principles "the objective local theory" and corollaries of the standard quantum mechanics are not in such antagonistic inconsistency as it is usually supposed. In the framework of algebraic approach, the…
In electronic structure theory, variational methods offer a valuable paradigm for approximating electronic ground states. However, for historical reasons, this principle is mostly restricted to model chemistries in pre-defined fixed basis…
Quantum annealing is a generic algorithm using quantum-mechanical fluctuations to search for the solution of an optimization problem. The present paper first reviews the fundamentals of quantum annealing and then reports on preliminary…
Current quantum simulators suffer from multiple limitations such as short coherence time, noisy operations, faulty readout and restricted qubit connectivity in some platforms. Variational quantum algorithms are the most promising approach…
Variational quantum eigensolvers (VQEs) combine classical optimization with efficient cost function evaluations on quantum computers. We propose a new approach to VQEs using the principles of measurement-based quantum computation. This…