Related papers: Quantum computation algorithm for many-body studie…
Feynman's prescription for a quantum simulator was to find a hamitonian for a system that could serve as a computer. P\'olya and Hilbert conjecture was to demonstrate Riemann's hypothesis through the spectral decomposition of hermitian…
Quantum computation can be achieved by preparing an appropriate initial product state of qudits and then letting it evolve under a fixed Hamiltonian. The readout is made by measurement on individual qudits at some later time. This approach…
We propose a quantum algorithm for projecting a quantum system to eigenstates of any Hermitian operator, provided one can access the associated control-unitary evolution for the ancilla and the system, as well as the measurement of the…
Achieving quantum advantage in efficiently estimating collective properties of quantum many-body systems remains a fundamental goal in quantum computing. While the quantum gradient estimation (QGE) algorithm has been shown to achieve doubly…
We present a quantum algorithm for the simulation of molecular systems that is asymptotically more efficient than all previous algorithms in the literature in terms of the main problem parameters. As in previous work [Babbush et al., New…
We derive out a complete series expression of Hamiltonian eigenvalues without any approximation and cut in the general quantum systems based on Wang's formal framework \cite{wang1}. In particular, we then propose a calculating approach of…
Rational functions are exceptionally powerful tools in scientific computing, yet their abilities to advance quantum algorithms remain largely untapped. In this paper, we introduce effective implementations of rational transformations of a…
The real world obeys quantum physics and quantum computing presents an alternative way to map physical problems to systems that follow the same laws. Such computation fundamentally constitutes a better way to understand the most challenging…
We construct an efficient autonomous quantum-circuit design algorithm for creating efficient quantum circuits to simulate Hamiltonian many-body quantum dynamics for arbitrary input states. The resultant quantum circuits have optimal space…
We describe a quantum algorithm for preparing states that encode solutions of non-homogeneous linear partial differential equations. The algorithm is a continuous-variable version of matrix inversion: it efficiently inverts differential…
It is shown how to exactly simulate many-body interactions and multi-qubit gates by coupling finite dimensional systems, e.g., qubits with a continuous variable. Cyclic evolution in the phase space of such a variable gives rise to a…
A compelling application of quantum computers with thousands of qubits is quantum simulation. Simulating fermionic systems is both a problem with clear real-world applications and a computationally challenging task. In order to simulate a…
Parity-time ($PT$)-symmetric Hamiltonians exhibit non-unitary dynamical evolution while maintaining real spectra, and offer unique approaches to quantum sensing and entanglement generation. Here we present a method for simulating the…
Quantum computers have the potential to transform the ways in which we tackle some important problems. The efforts by companies like Google, IBM and Microsoft to construct quantum computers have been making headlines for years. Equally…
Solving the electronic structure problem via unitary evolution of the electronic Hamiltonian is one of the promising applications of digital quantum computers. One of the practical strategies to implement the unitary evolution is via…
Hamiltonian learning is crucial to the certification of quantum devices and quantum simulators. In this paper, we propose a hybrid quantum-classical Hamiltonian learning algorithm to find the coefficients of the Pauli operator components of…
We present an iterative algorithm to count Feynman diagrams via many-body relations. The algorithm allows us to count the number of diagrams of the exact solution for the general fermionic many-body problem at each order in the interaction.…
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 present explicit expressions for the central piece of a variational method developed by Shi et al. which extends variational wave functions that are efficiently computable on classical computers beyond mean-field to generalized Gaussian…
The quantum circuit model is the most widely used model of quantum computation. It provides both a framework for formulating quantum algorithms and an architecture for the physical construction of quantum computers. However, several other…