A Comparative Study on Solving Optimization Problems With Exponentially Fewer Qubits
Variational quantum optimization algorithms, such as the variational quantum eigensolver (VQE) or the quantum approximate optimization algorithm (QAOA), are among the most studied quantum algorithms. In our work, we evaluate and improve an algorithm based on the VQE, which uses exponentially fewer q...
Saved in:
Main Authors: | David Winderl, Nicola Franco, Jeanette Miriam Lorenz |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2024-01-01
|
Series: | IEEE Transactions on Quantum Engineering |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/10506971/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Solving Nonnative Combinatorial Optimization Problems Using Hybrid Quantum–Classical Algorithms
by: Jonathan Wurtz, et al.
Published: (2024-01-01) -
Fixed-Point Grover Adaptive Search for Quadratic Binary Optimization Problems
by: Akos Nagy, et al.
Published: (2024-01-01) -
A quantum entanglement-based algorithm for discriminating non-orthogonal qubits
by: Mohammed Zidan, et al.
Published: (2025-01-01) -
Multidisk Clutch Optimization Using Quantum Annealing
by: D. John Malcolm, et al.
Published: (2024-01-01) -
Multiobjective Optimization and Network Routing With Near-Term Quantum Computers
by: Shao-Hen Chiew, et al.
Published: (2024-01-01)