相关论文: Quantum algorithm for matrix functions by Cauchy's…
A milestone in the field of quantum computing will be solving problems in quantum chemistry and materials faster than state-of-the-art classical methods. The current understanding is that achieving quantum advantage in this area will…
We introduce a quantum algorithm to efficiently prepare states with a small energy variance at the target energy. We achieve it by filtering a product state at the given energy with a Lorentzian filter of width $\delta$. Given a local…
The motivation for studying non-Hermitian systems and the role of $\mathcal{PT}$-symmetry is discussed. We investigate the use of a quantum algorithm to find the eigenvalues and eigenvectors of non-Hermitian Hamiltonians, with applications…
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…
Quantum counting is a key quantum algorithm that aims to determine the number of marked elements in a database. This algorithm is based on the quantum phase estimation algorithm and uses the evolution operator of Grover's algorithm because…
We consider the task of estimating the expectation value of an $n$-qubit tensor product observable $O_1\otimes O_2\otimes \cdots \otimes O_n$ in the output state of a shallow quantum circuit. This task is a cornerstone of variational…
In this paper, we explore an efficient online algorithm for quantum state estimation based on a matrix-exponentiated gradient method previously used in the context of machine learning. The state update is governed by a learning rate that…
Quantum phase estimation (QPE) is one of the core algorithms for quantum computing. It has been extensively studied and applied in a variety of quantum applications such as the Shor's factoring algorithm, quantum sampling algorithms and the…
The last few years have seen rapid development of applications of quantum computation to quantum field theory. The first algorithms for quantum simulation of scattering have been proposed in the context of scalar and fermionic theories,…
The phase estimation algorithm, which is at the heart of a variety of quantum algorithms, including Shor's factoring algorithm, allows a quantum computer to accurately determine an eigenvalue of an unitary operator. Quantum nondemolition…
We introduce a genetic algorithm that designs quantum optics experiments for engineering quantum states with specific properties. Our algorithm is powerful and flexible, and can easily be modified to find methods of engineering states for a…
We consider an algorithm to approximate complex-valued periodic functions $f(e^{i\theta})$ as a matrix element of a product of $SU(2)$-valued functions, which underlies so-called quantum signal processing. We prove that the algorithm runs…
We present a quantum algorithm for simulating the wave equation under Dirichlet and Neumann boundary conditions. The algorithm uses Hamiltonian simulation and quantum linear system algorithms as subroutines. It relies on factorizations of…
We present quantum algorithms for the simulation of quantum systems in one spatial dimension, which result in quantum speedups that range from superpolynomial to polynomial. We first describe a method to simulate the evolution of the…
Quantum algorithms are still challenging to solve linear systems of equations on real devices. This challenge arises from the need for deep circuits and numerous ancilla qubits. We introduce the quantum conjugate gradient (QCG) method using…
Quantum simulation is a prominent application of quantum computers. While there is extensive previous work on simulating finite-dimensional systems, less is known about quantum algorithms for real-space dynamics. We conduct a systematic…
In this paper we describe a quantum algorithm to solve sparse systems of nonlinear differential equations whose nonlinear terms are polynomials. The algorithm is nondeterministic and its expected resource requirements are polylogarithmic in…
In the field of quantum linear system algorithms, quantum computing has realized exponential computational advantages over classical computing. However, the focus has been on square coefficient matrices, with few quantum algorithms…
We develop a quantum filter diagonalization method (QFD) that lies somewhere between the variational quantum eigensolver (VQE) and the phase estimation algorithm (PEA) in terms of required quantum circuit resources and conceptual…
We motivate the use of quantum algorithms in particle physics and provide a brief overview of the most recent applications at high-energy colliders. In particular, we discuss in detail how a quantum approach reduces the complexity of jet…