Modular Parity Quantum Approximate Optimization
Kilian Ender, Anette Messinger, Michael Fellner, Clemens Dlaska, Wolfgang Lechner
Abstract
The performance of a ``quantum approximate optimization algorithm'' is improved in a hybrid method, which keeps the required circuit depth constant while reducing the number of explicitly enforced parity constraints.
Topics & Concepts
Parity (physics)Modular designQuantumComputer scienceOptimization algorithmConstant (computer programming)AlgorithmMathematicsPhysicsQuantum mechanicsMathematical optimizationProgramming languageOperating systemQuantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum-Dot Cellular Automata