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.
On a quantum inspired approach to train machine learning models
1 Pith paper cite this work, alongside 1 external citations. Polarity classification is still indexing.
1
Pith paper citing it
1
external citations · OpenAlex
fields
quant-ph 1years
2026 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
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.