Home > Publications database > Optimizing QAOA circuit transpilation with parity twine and SWAP network encodings > print

001     1043252
005     20250624202315.0
024 7 _ |a 10.48550/ARXIV.2505.17944
|2 doi
037 _ _ |a FZJ-2025-02802
041 _ _ |a English
100 1 _ |a Montanez-Barrera, J. A.
|0 P:(DE-Juel1)194305
|b 0
|u fzj
245 _ _ |a Optimizing QAOA circuit transpilation with parity twine and SWAP network encodings
260 _ _ |c 2025
|b arXiv
336 7 _ |a Preprint
|b preprint
|m preprint
|0 PUB:(DE-HGF)25
|s 1750750241_10824
|2 PUB:(DE-HGF)
336 7 _ |a WORKING_PAPER
|2 ORCID
336 7 _ |a Electronic Article
|0 28
|2 EndNote
336 7 _ |a preprint
|2 DRIVER
336 7 _ |a ARTICLE
|2 BibTeX
336 7 _ |a Output Types/Working Paper
|2 DataCite
520 _ _ |a Mapping quantum approximate optimization algorithm (QAOA) circuits with non-trivial connectivity in fixed-layout quantum platforms such as superconducting-based quantum processing units (QPUs) requires a process of transpilation to match the quantum circuit on the given layout. This step is critical for reducing error rates when running on noisy QPUs. Two methodologies that improve the resource required to do such transpilation are the SWAP network and parity twine chains (PTC). These approaches reduce the two-qubit gate count and depth needed to represent fully connected circuits. In this work, a simulated annealing-based method is introduced that reduces the PTC and SWAP network encoding requirements in QAOA circuits with non-fully connected two-qubit gates. This method is benchmarked against various transpilers and demonstrates that, beyond specific connectivity thresholds, it achieves significant reductions in both two-qubit gate count and circuit depth, surpassing the performance of Qiskit transpiler at its highest optimization level. For example, for a 120-qubit QAOA instance with 25% connectivity, our method achieves an 85% reduction in depth and a 28% reduction in two-qubit gates. Finally, the practical impact of PTC encoding is validated by benchmarking QAOA on the ibm_fez device, showing improved performance up to 20 qubits, compared to a 15-qubit limit when using SWAP networks.
536 _ _ |a 5221 - Advanced Solid-State Qubits and Qubit Systems (POF4-522)
|0 G:(DE-HGF)POF4-5221
|c POF4-522
|f POF IV
|x 0
536 _ _ |a BMBF 13N16149 - QSolid - Quantencomputer im Festkörper (BMBF-13N16149)
|0 G:(DE-Juel1)BMBF-13N16149
|c BMBF-13N16149
|x 1
536 _ _ |a QuGrids - Quantum-based Energy Grids (QuGrids20231101)
|0 G:(MKW-NRW)QuGrids20231101
|c QuGrids20231101
|x 2
588 _ _ |a Dataset connected to DataCite
650 _ 7 |a Quantum Physics (quant-ph)
|2 Other
650 _ 7 |a FOS: Physical sciences
|2 Other
700 1 _ |a Ji, Yanjun
|0 P:(DE-Juel1)204481
|b 1
|e Corresponding author
|u fzj
700 1 _ |a von Spakovsky, Michael R.
|0 P:(DE-HGF)0
|b 2
700 1 _ |a Neira, David E. Bernal
|0 P:(DE-HGF)0
|b 3
700 1 _ |a Michielsen, Kristel
|0 P:(DE-Juel1)138295
|b 4
|u fzj
773 _ _ |a 10.48550/ARXIV.2505.17944
909 C O |o oai:juser.fz-juelich.de:1043252
|p VDB
910 1 _ |a Forschungszentrum Jülich
|0 I:(DE-588b)5008462-8
|k FZJ
|b 0
|6 P:(DE-Juel1)194305
910 1 _ |a Forschungszentrum Jülich
|0 I:(DE-588b)5008462-8
|k FZJ
|b 1
|6 P:(DE-Juel1)204481
910 1 _ |a Forschungszentrum Jülich
|0 I:(DE-588b)5008462-8
|k FZJ
|b 4
|6 P:(DE-Juel1)138295
913 1 _ |a DE-HGF
|b Key Technologies
|l Natural, Artificial and Cognitive Information Processing
|1 G:(DE-HGF)POF4-520
|0 G:(DE-HGF)POF4-522
|3 G:(DE-HGF)POF4
|2 G:(DE-HGF)POF4-500
|4 G:(DE-HGF)POF
|v Quantum Computing
|9 G:(DE-HGF)POF4-5221
|x 0
914 1 _ |y 2025
920 _ _ |l yes
920 1 _ |0 I:(DE-Juel1)PGI-12-20200716
|k PGI-12
|l Quantum Computing Analytics
|x 0
920 1 _ |0 I:(DE-Juel1)JSC-20090406
|k JSC
|l Jülich Supercomputing Center
|x 1
980 _ _ |a preprint
980 _ _ |a VDB
980 _ _ |a I:(DE-Juel1)PGI-12-20200716
980 _ _ |a I:(DE-Juel1)JSC-20090406
980 _ _ |a UNRESTRICTED

LibraryCollectionCLSMajorCLSMinorLanguageAuthor
Marc 21