Noisy Tensor Ring approximation for computing gradients of Variational Quantum Eigensolver for Combinatorial Optimization

Variational Quantum algorithms, especially Quantum Approximate Optimization and Variational Quantum Eigensolver (VQE) have established their potential to provide computational advantage in the realm of combinatorial optimization. However, these algorithms suffer from classically intractable gradient...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Peddireddy, Dheeraj, Priyam, Utkarsh, Aggarwal, Vaneet
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Learning Physics - Quantum Physics
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!