Quantum-classical system and method for matrix computations
AssigneeZapata Computing, Inc.
InventorsYudong Cao, Andrei Kniazev
Life of this patent
Estimating the term…
Abstract
A hybrid quantum-classical computer solves systems of equations and eigenvalue problems utilizing non-unitary transformations on the quantum computer. The method may be applied, for example, to principal component analysis, least squares fitting, regression, spectral embedding and clustering, vibrations in mechanics, fluids and quantum chemistry, material sciences, electromagnetism, signal processing, image segmentation and data mining.
Claims12
A method for using a quantum computing component to find the lowest eigenvector of a Hermitian matrix A by repeatedly updating a candidate solution, the method comprising:
- (A) preparing, on the quantum computing component, a quantum state q encoding the candidate solution,
- (B) applying, on the quantum computing component, an operation O, which depends on the Hermitian matrix A, to the quantum state q to obtain an updated candidate solution q′,
- (C) repeating step (B), wherein the operation is applied to the updated candidate solution q′, until a final quantum state has been obtained, and
- (D) measuring, on the quantum computing component, the final quantum state to obtain the lowest eigenvector of A.
A computing system comprising:
- a quantum computing component comprising a plurality of qubits;
- and
- wherein the quantum computing component is adapted to find the lowest eigenvector of a Hermitian matrix A by repeatedly updating a candidate solution, by:
- (A) preparing, on the quantum computing component, a quantum state q encoding the candidate solution,
- (B) applying, on the quantum computing component, an operation O, which depends on the Hermitian matrix A, to the quantum state q to obtain an updated candidate solution q′,
- (C) repeating step (B), wherein the operation is applied to the updated candidate solution q′, until a final quantum state has been obtained, and
- (D) measuring, on the quantum computing component, the final quantum state to obtain the lowest eigenvector of A.
Dependencies are inferred from the claim text.