Variational quantum algorithms: fundamental concepts, applications and challenges
From MaRDI portal
Recommendations
Cites work
- A polynomial quantum algorithm for approximating the Jones polynomial
- A Simplex Method for Function Minimization
- Fermionic quantum computation
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- On the universality of the quantum approximate optimization algorithm
- Quantum approximate optimization of the long-range Ising model with a trapped-ion quantum simulator
- Quantum computation and quantum information. 10th anniversary edition
- Random quantum circuits are approximate 2-designs
- Solution of time-independent Schrödinger equation by the imaginary time propagation method
Cited in
(8)- 11 A review of different techniques and challenges of quantum computing in various applications
- Variational quantum multidimensional scaling algorithm
- Uncovering instabilities in variational-quantum deep Q-networks
- Variational quantum computation integer factorization algorithm
- The barren plateaus of quantum neural networks: review, taxonomy and trends
- Type-safe quantum programming in Idris
- A review on quantum approximate optimization algorithm and its variants
- NOISE-VQA: convergence and complexity analysis of variational quantum algorithms with finite-shot and biased oracles
This page was built for publication: Variational quantum algorithms: fundamental concepts, applications and challenges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6566187)