Related papers: A Time-Symmetric Quantum Algorithm for Direct Eige…
We present a quantum algorithm for simulating the dynamics of Hamiltonians that are not necessarily sparse. Our algorithm is based on the input model where the entries of the Hamiltonian are stored in a data structure in a quantum random…
We propose a hybrid quantum-classical algorithm for approximating the ground state and ground state energy of a Hamiltonian. Once the Ansatz has been decided, the quantum part of the algorithm involves the calculation of two overlap…
This paper describes an algorithm for selecting a consistent set within the consistent histories approach to quantum mechanics and investigates its properties. The algorithm select from among the consistent sets formed by projections…
Accurate computation of multiple eigenvalues of quantum Hamiltonians is essential in quantum chemistry, materials science, and molecular spectroscopy. Estimating excited-state energies is challenging for classical algorithms due to…
In a recent paper Bender and Mannheim showed that the unequal-frequency fourth-order derivative Pais-Uhlenbeck oscillator model has a realization in which the energy eigenvalues are real and bounded below, the Hilbert-space inner product is…
Quantum Hamiltonian identification is important for characterizing the dynamics of quantum systems, calibrating quantum devices and achieving precise quantum control. In this paper, an effective two-step optimization (TSO) quantum…
To overcome the fast oscillatory behavior of correlation functions for extracting scattering phase shift in real-time quantum simulations encountered in Ref.\cite{Guo:2026qkx}, we propose and test two solutions in the present work. One is…
This article presents the first complete application of a quantum time-marching algorithm for simulating multidimensional linear transport phenomena with arbitrary boundaries, whereby the success probabilities are problem intrinsic. The…
Recently, there has been growing interest in simulating time-dependent Hamiltonians using quantum algorithms, driven by diverse applications, such as quantum adiabatic computing. While techniques for simulating time-independent Hamiltonian…
The task of estimating the ground state of Hamiltonians is an important problem in physics with numerous applications ranging from solid-state physics to combinatorial optimization. We provide a hybrid quantum-classical algorithm for…
We present a model of discrete quantum evolution based on quantum correlations between the evolving system and a reference quantum clock system. A quantum circuit for the model is provided, which in the case of a constant Hamiltonian is…
A non-Hermitian operator $H$ defined in a Hilbert space with inner product $\langle\cdot|\cdot\rangle$ may serve as the Hamiltonian for a unitary quantum system, if it is $\eta$-pseudo-Hermitian for a metric operator (positive-definite…
In this article, we discussed certain properties of non-Hermitian $\CP$-symmetry Hamiltonian, and it is shown that a consistent physical theory of quantum mechanics can be built on a ${\cal C} \CP$-symmetry Hamiltonian. In particular, we…
The Rodeo Algorithm is a quantum computing method for computing the energy spectrum of a Hamiltonian and preparing its energy eigenstates. We discuss how to improve the performance of the rodeo algorithm for each of these two applications.…
Simulating Hamiltonian dynamics is one of the most fundamental and significant tasks for characterising quantum materials. Recently, a series of quantum algorithms employing block-encoding of Hamiltonians have succeeded in providing…
This paper summarizes a research program that has been underway for a decade. The objective is to find a fast and accurate scheme for solving quantum problems which does not involve a Monte Carlo algorithm. We use an alternative strategy…
We present an algorithm for measurement of $k$-local operators in a quantum state, which scales logarithmically both in the system size and the output accuracy. The key ingredients of the algorithm are a digital representation of the…
A projective measurement of energy (PME) on a quantum system is a quantum measurement, determined by the Hamiltonian of the system. PME protocols exist when the Hamiltonian is given in advance. Unknown Hamiltonians can be identified by…
Recently Bender, Brody, Jones and Meister found that in the quantum brachistochrone problem the passage time needed for the evolution of certain initial states into specified final states can be made arbitrarily small, when the…
Quantum algorithms offer significant speedups over their classical counterparts for a variety of problems. The strongest arguments for this advantage are borne by algorithms for quantum search, quantum phase estimation, and Hamiltonian…