preprint · arXiv (Cornell University) · 2021
Parity Quantum Optimization: Compiler
Kilian Ender, Roeland ter Hoeven, Benjamin E. Niehoff, Maike Drieb-Schön, Wolfgang Lechner
Cited by 4Open access
Abstract
We introduce parity quantum optimization with the aim of solving optimization problems consisting of arbitrary $k$-body interactions and side conditions using planar quantum chip architectures. The method introduces a decomposition of the problem graph with arbitrary $k$-body terms using generalized closed cycles of a hypergraph. Side conditions of the optimization problem in form of hard constraints can be included as open cycles containing the terms involved in the side conditions. The generalized parity mapping thus circumvents the need to translate optimization problems to a quadratic unconstrained binary optimization problem (QUBO) and allows for the direct encoding of higher-order constrained binary optimization problems (HCBO) on a square lattice and full parallelizability of gates.
Cite this paper
Ender, K., ter Hoeven, R., Niehoff, B. E., Drieb-Schön, M., & Lechner, W. (2021). Parity Quantum Optimization: Compiler. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2105.06233
Ender, Kilian, et al. “Parity Quantum Optimization: Compiler.” arXiv (Cornell University), 2021, https://doi.org/10.48550/arxiv.2105.06233.
Ender, Kilian, Roeland ter Hoeven, Benjamin E. Niehoff, Maike Drieb-Schön, and Wolfgang Lechner. 2021. “Parity Quantum Optimization: Compiler.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.2105.06233.
Ender, K. et al. (2021) ‘Parity Quantum Optimization: Compiler’, arXiv (Cornell University). Available at: https://doi.org/10.48550/arxiv.2105.06233.
@misc{ender2021parity,
title = {{Parity Quantum Optimization: Compiler}},
author = {Ender, Kilian and ter Hoeven, Roeland and Niehoff, Benjamin E. and Drieb-Schön, Maike and Lechner, Wolfgang},
journal = {arXiv (Cornell University)},
year = {2021},
doi = {10.48550/arxiv.2105.06233}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
Finding Debt Cycles: QUBO Formulations for the Maximum Weighted Cycle Problem Solved Using Quantum Annealing
Hendrik Künnemann, Frank Phillipson · Mathematics · 2023
Cited by 1Open access
An experimental study on binary optimization using quantum annealing in D-Wave
Nongmeikapam Brajabidhu Singh, Gopal Krishna, Arnab Roy et al. · International Conference on Informatics and Computing (ICIC) · 2022
Cited by 3
Embedding Inequality Constraints for Quantum Annealing Optimization
Tomáš Vyskočil, Scott Pakin, Hristo N. Djidjev · Lecture notes in computer science · 2019
Cited by 40
Quantum annealing: next-generation computation and how to implement it when information is missing
Masayuki Ohzeki, Chako Takahashi, Shuntaro Okada et al. · Nonlinear Theory and Its Applications IEICE · 2018
Cited by 15Open access
Asymptotic Analysis of Problem Formulations for Quantum Annealers
Julio Auto, Fred Shi · IEEE International Conference on Quantum Computing and Engineering (QCE) · 2023
Cited by 0
Quantum and Digital Annealing for the Quadratic Assignment Problem
Philippe Codognet, Daniel Díaz, Salvador Pinto Abreu · IEEE International Conference on Quantum Software (QSW) · 2022
Cited by 15
Modeling the Costas Array Problem in QUBO for Quantum Annealing
Philippe Codognet · Lecture notes in computer science · 2022
Cited by 4