Parity Quantum Optimization: Encoding Constraints-Reference-Cited by-同舟云学术

Parity Quantum Optimization: Encoding Constraints

Published:2023-03-17 Issue: Volume:7 Page:951
ISSN:2521-327X
Container-title:Quantum
language:en
Short-container-title:Quantum

Author:

Drieb-Schön Maike¹²,Ender Kilian¹²,Javanmard Younes¹,Lechner Wolfgang¹²

Affiliation:

1. Parity Quantum Computing GmbH, A-6020 Innsbruck, Austria

2. Institute for Theoretical Physics, University of Innsbruck, A-6020 Innsbruck, Austria

Abstract

Constraints make hard optimization problems even harder to solve on quantum devices because they are implemented with large energy penalties and additional qubit overhead. The parity mapping, which has been introduced as an alternative to the spin encoding, translates the problem to a representation using only parity variables that encodes products of spin variables. In combining exchange interaction and single spin flip terms in the parity representation, constraints on sums and products of arbitrary k-body terms can be implemented without additional overhead in two-dimensional quantum systems.

Funder

Austrian Science Fund

Publisher

Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften

Subject

Physics and Astronomy (miscellaneous),Atomic and Molecular Physics, and Optics

Link

https://quantum-journal.org/papers/q-2023-03-17-951/pdf/

Reference71 articles.

1. Edward Farhi, Jeffrey Goldstone, Sam Gutmann, et al. ``A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem''. Science 292, 472–475 (2001).

2. David Allouche, Isabelle Andre, Sophie Barbe, et al. ``Computational protein design as an optimization problem''. Artificial Intelligence 212, 59–79 (2014).

3. Simon Gravel and Veit Elser. ``Divide and concur: A general approach to constraint satisfaction''. Phys. Rev. E 78, 036706 (2008).

4. Florian Neukart, Gabriele Compostella, Christian Seidel, et al. ``Traffic flow optimization using a quantum annealer'' (2017). arXiv:1708.01625.

5. Eleanor G. Rieffel, Davide Venturelli, Bryan O'Gorman, et al. ``A case study in programming a quantum annealer for hard operational planning problems''. Quantum Information Processing 14 (2015).

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Flexible constraint compilation in the parity architecture;Physical Review A;2023-10-12

2. Encoding-independent optimization problem formulation for quantum computing;Frontiers in Quantum Science and Technology;2023-09-07

3. Quantum computing for finance;Nature Reviews Physics;2023-07-11