REVIEW 1 cited by
Introduction to Variational Quantum Algorithms
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
This document is a pdf version of the series of blogposts about variational quantum algorithms (VQA) I originally posted on my blog Musty Thoughts. It provides an explanation of the basic variational algorithms, such as Variational Quantum Eigensolver (VQE) and Quantum Approximate Optimization Algorithm (QAOA), as well as a more general framework for VQAs. It also describes some more advanced techniques that can be used to make these algorithms more efficient, as well as the challenges associated with using them.
Forward citations
Cited by 1 Pith paper
-
Overcoming Barren Plateaus in Variational Quantum Circuits using a Two-Step Least Squares Approach
A two-stage convex/nonconvex least-squares algorithm is claimed to remove the condition-number barrier in variational quantum optimization and achieve high-fidelity BB84 quantum-state cloning.
Discussion (0). Continue with ORCID to comment.