2000 character limit reached
Enhancing Quantum Optimization with Parity Network Synthesis
Published 16 Feb 2024 in quant-ph | (2402.11099v1)
Abstract: This paper examines QAOA in the context of parity network synthesis. We propose a pair of algorithms for parity network synthesis and linear circuit inversion. Together, these algorithms can build the diagonal component of the QAOA circuit, generally the most expensive in terms of two qubit gates. We compare the CNOT count of our strategy to off-the-shelf compiler tools for random, full, and graph-based optimization problems and find that ours outperforms the alternatives.
- A quantum approximate optimization algorithm, 2014.
- Obstacles to variational quantum optimization from symmetry protection. Physical Review Letters, 125(26), December 2020.
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz. Algorithms, 12(2):34, February 2019.
- Quantum local search with the quantum alternating operator ansatz. Quantum, 6:781, August 2022.
- Multistart methods for quantum approximate optimization. In 2019 IEEE High Performance Extreme Computing Conference (HPEC). IEEE, September 2019.
- An adaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computer, 2022.
- Kunal Marwaha. Local classical max-cut algorithm outperforms p=2 qaoa on high-girth regular graphs. Quantum, 5:437, April 2021.
- A generic compilation strategy for the unitary coupled cluster ansatz, 2020.
- Phase polynomials synthesis algorithms for nisq architectures and beyond. Quantum Science and Technology, 7(4):045027, September 2022.
- Gaussian elimination versus greedy methods for the synthesis of linear reversible circuits. ACM Transactions on Quantum Computing, 2(3):1–26, September 2021.
- Qiskit contributors. Qiskit: An open-source framework for quantum computing, 2023.
- On the controlled-not complexity of controlled-not–phase circuits. Quantum Science and Technology, 4(1):015002, September 2018.
- Pseudo-boolean optimization. Discrete Applied Mathematics, 123(1):155–225, 2002.
- Solvable model of a spin-glass. Phys. Rev. Lett., 35:1792–1796, Dec 1975.
- QAOA of the Highest Order. In 19th IEEE International Conference on Software Architecture, 11 2021.
- Scaling whole-chip qaoa for higher-order ising spin glass models on heavy-hex graphs, 2023.
- Space-efficient binary optimization for variational computing, 2020.
- On the approximability of random-hypergraph max-3-xorsat problems with quantum algorithms, 2023.
- Phase gadget synthesis for shallow circuits. Electronic Proceedings in Theoretical Computer Science, 318:213–228, May 2020.
- Efficient synthesis of linear reversible circuits, 2003.
- Duncan J. Watts. Networks, dynamics, and the small‐world phenomenon. American Journal of Sociology, 105(2):493–527, 1999.
- Toby Walsh. Search in a small world. Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (II), 2, 1999.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
