On the universality of the quantum approximate optimization algorithm

DOI10.1007/s11128-020-02748-9OpenAlexW3080889453MaRDI QIDQ2681661

M. E. S. Morales, Z. Zimborás, Jacob D. Biamonte

Publication date: 3 February 2023

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.03123

zbMATH Keywords

quantum computationquantum controlvariational quantum algorithmsuniversal quantum gate sets

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum control (81Q93)

Related Items (1)

Efficient quantum feature extraction for CNN-based learning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A quantum walk-assisted approximate algorithm for bounded NP optimisation problems
• Logic circuits from zero forcing
• Control systems on Lie groups
• From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
• Symmetry principles in quantum systems theory
• Quantum Computation and Quantum Information
• Lie Theory for Quantum Control
• Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks
• Introduction to Quantum Control and Dynamics
• The theory of variational hybrid quantum-classical algorithms
• Approximation by superpositions of a sigmoidal function

This page was built for publication: On the universality of the quantum approximate optimization algorithm