Finding eigenvectors with a quantum variational algorithm
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- A polynomial quantum algorithm for approximating the Jones polynomial
- ANALYTIC ONE-BIT AND CNOT GATE CONSTRUCTIONS OF GENERAL n-QUBIT CONTROLLED GATES
- Algorithms and Computation
- Exponential improvement in precision for simulating sparse Hamiltonians
- LAPACK Users' Guide
- Matrix algorithms. Vol. 2: Eigensystems
- Numerical methods in matrix computations
- On completely factoring any integer efficiently in a single run of an order-finding algorithm
- On lines and planes of closest fit to systems of points in space.
- On quantum field theory — I: explicit solution of Dyson’s equation in electrodynamics without use of feynman graphs
- On some algorithms for the solution of the complete eigenvalue problem
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Principal component analysis.
- Principal component analysis: a review and recent developments
- Quantum circuits cannot control unknown operations
- Scikit-learn: machine learning in Python
- Stabilization of Quantum Computations by Symmetrization
- The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
- The computational complexity of linear optics
- The theory of variational hybrid quantum-classical algorithms
- The variational quantum eigensolver: a review of methods and best practices
- Universal Quantum Simulators
- Universal linear optics
This page was built for publication: Finding eigenvectors with a quantum variational algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6852861)
