相关论文: Quantum Gauss Jordan Elimination

In this paper, we calculate the Jordan decomposition (or say, the Jordan canonical form) for a class of non-symmetric Ornstein-Uhlenbeck operators with the drift coefficient matrix being a Jordan block and the diffusion coefficient matrix…

The search task is one of the most difficult when it comes to execution speed, and reducing the latter is important both when working with large data and with small samples, if they need to be processed frequently and in a limited time.…

In quantum mechanics, the Rosen-Zener model represents a two-level quantum system. Its generalization to multiple degenerate sets of states leads to larger non-autonomous linear system of ordinary differential equations (ODEs). We propose a…

In this work, we introduce a fast numerical algorithm to solve the time-dependent radiative transport equation (RTE). Our method uses the integral formulation of RTE and applies the treecode algorithm to reduce the computational complexity…

Gaussian processes (GP) are a widely used model for regression problems in supervised machine learning. Implementation of GP regression typically requires $O(n^3)$ logic gates. We show that the quantum linear systems algorithm [Harrow et…

This paper presents an enhancement to Grover's search algorithm for instances where the number of items (or the size of the search problem) $N$ is not a power of 2. By employing an efficient algorithm for the preparation of uniform quantum…

In this thesis, we develop resummation algorithms suitable for perturbative QCD. In the first part, we propose a resummation technique applicable to the Regge limit. We develop a new systematic procedure for this limit in perturbative QCD…

The quantum period-finding (QPF) algorithm can compute the period of a function exponentially faster than the best-known classical algorithm. In standard QPF, the output state has a primary contribution from $r$ high-probability bit…

Quantum linear system algorithms (QLSAs) can provide exponential speedups for the solution of linear systems, but the growth of the condition number for finite element problems can eliminate the exponential speedup. QLSAs are also incapable…

An efficient method is proposed for computing the structure of Jordan blocks of a matrix of integers or rational numbers by exact computation. We have given a method for computing Jordan chains of a matrix with exact computation. However,…

Quantum algorithm, as compared to classical algorithm, plays a notable role in solving linear systems of equations with an exponential speedup. Here, we demonstrate a method for solving a particular system of equations by using the concept…

This is a transcription of a conference proceedings from 1985. It reviews the Jordan algebra formulation of quantum mechanics. A possible novelty is the discussion of time evolution; the associator takes over the role of $i$ times the…

Quite often in database search, we only need to extract portion of the information about the satisfying item. Recently Radhakrishnan & Grover [RG] considered this problem in the following form: the database of $N$ items was divided into $K$…

Quantum advantage is the core of quantum computing. Grover's search algorithm is the only quantum algorithm with proven advantage to any possible classical search algorithm. However, realizing this quantum advantage in practice is quite…

If the phase retrieval problem can be solved by a method similar to that of solving a system of linear equations under the context of FFT, the time complexity of computer based phase retrieval algorithm would be reduced. Here I present such…

We describe an algorithm to compute the reduction modulo $p$ of a crystalline Galois representation of dimension $2$ of $\text{Gal}(\overline{\mathbf{Q}}_p/\mathbf{Q}_p)$ with distinct Hodge-Tate weights via the semi-simple modulo $p$…

This study examines the potential for fault-tolerant quantum computers to provide utility in fluid dynamics simulations, with a focus on drag force calculations for ship hull design. We assess whether quantum algorithms can surpass…

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…

We present the quantum algorithm for the Longest Trail Problem. The problem is to search the longest edge-simple path for a graph with $n$ vertexes and $m$ edges. Here edge-simple means no edge occurs in the path twice, but vertexes can…

We present a novel application of the multi-modal, multi-level quantum complex exponential least squares (MM-QCELS) algorithm, a state-of-the-art, early fault-tolerant quantum phase estimation (QPE) technique, to the simulation and analysis…