Low-depth Circuit Implementation of Parity Constraints for Quantum Optimization

Low-depth Circuit Implementation of Parity Constraints for Quantum Optimization

We present a construction for circuits with low gate count and depth, implementing three- and four-body Pauli-Z product operators as they appear in the form of plaquette-shaped constraints in QAOA when using the parity mapping. The circuits can be implemented on any quantum device with nearest-neigh...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Unger, Josua, Messinger, Anette, Niehoff, Benjamin E, Fellner, Michael, Lechner, Wolfgang
Format: Artikel
Sprache:eng
Schlagworte:
Physics - Quantum Physics
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Unger, Josua
Messinger, Anette
Niehoff, Benjamin E
Fellner, Michael
Lechner, Wolfgang
description We present a construction for circuits with low gate count and depth, implementing three- and four-body Pauli-Z product operators as they appear in the form of plaquette-shaped constraints in QAOA when using the parity mapping. The circuits can be implemented on any quantum device with nearest-neighbor connectivity on a square-lattice, using only one gate type and one orientation of two-qubit gates at a time. We find an upper bound for the circuit depth which is independent of the system size. The procedure is readily adjustable to hardware-specific restrictions, such as a minimum required spatial distance between simultaneously executed gates, or gates only being simultaneously executable within a subset of all the qubits, for example a single line.
doi_str_mv 10.48550/arxiv.2211.11287
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2211_11287</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2211_11287</sourcerecordid><originalsourceid>FETCH-LOGICAL-a677-8a9b4dd951c3eaa3e5c447430bfbbbfbb1ef1e6ca0309e27ecdab14e94c513373</originalsourceid><addsrcrecordid>eNotz81KxDAUBeBsXMjoA7gyL9DaNMmkXUrxZ6BQhdmXm_QGA5OkpKk6Pr1MdXE4m8OBj5A7VpWikbJ6gPTtPsu6ZqxkrG7UNRn6-FVMOOcP2rlkVpfpwc8n9BgyZBcDjZa-QXL5TLsYlpzAhbxQGxN9XyHk1dNhzs67n21-Q64snBa8_e8dOT4_HbvXoh9eDt1jX8BeqaKBVotpaiUzHAE4SiOEErzSVutLGFqGewMVr1qsFZoJNBPYCiMZ54rvyP3f7SYa5-Q8pPN4kY2bjP8CyCNLMQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Low-depth Circuit Implementation of Parity Constraints for Quantum Optimization</title><source>arXiv.org</source><creator>Unger, Josua ; Messinger, Anette ; Niehoff, Benjamin E ; Fellner, Michael ; Lechner, Wolfgang</creator><creatorcontrib>Unger, Josua ; Messinger, Anette ; Niehoff, Benjamin E ; Fellner, Michael ; Lechner, Wolfgang</creatorcontrib><description>We present a construction for circuits with low gate count and depth, implementing three- and four-body Pauli-Z product operators as they appear in the form of plaquette-shaped constraints in QAOA when using the parity mapping. The circuits can be implemented on any quantum device with nearest-neighbor connectivity on a square-lattice, using only one gate type and one orientation of two-qubit gates at a time. We find an upper bound for the circuit depth which is independent of the system size. The procedure is readily adjustable to hardware-specific restrictions, such as a minimum required spatial distance between simultaneously executed gates, or gates only being simultaneously executable within a subset of all the qubits, for example a single line.</description><identifier>DOI: 10.48550/arxiv.2211.11287</identifier><language>eng</language><subject>Physics - Quantum Physics</subject><creationdate>2022-11</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2211.11287$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2211.11287$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Unger, Josua</creatorcontrib><creatorcontrib>Messinger, Anette</creatorcontrib><creatorcontrib>Niehoff, Benjamin E</creatorcontrib><creatorcontrib>Fellner, Michael</creatorcontrib><creatorcontrib>Lechner, Wolfgang</creatorcontrib><title>Low-depth Circuit Implementation of Parity Constraints for Quantum Optimization</title><description>We present a construction for circuits with low gate count and depth, implementing three- and four-body Pauli-Z product operators as they appear in the form of plaquette-shaped constraints in QAOA when using the parity mapping. The circuits can be implemented on any quantum device with nearest-neighbor connectivity on a square-lattice, using only one gate type and one orientation of two-qubit gates at a time. We find an upper bound for the circuit depth which is independent of the system size. The procedure is readily adjustable to hardware-specific restrictions, such as a minimum required spatial distance between simultaneously executed gates, or gates only being simultaneously executable within a subset of all the qubits, for example a single line.</description><subject>Physics - Quantum Physics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz81KxDAUBeBsXMjoA7gyL9DaNMmkXUrxZ6BQhdmXm_QGA5OkpKk6Pr1MdXE4m8OBj5A7VpWikbJ6gPTtPsu6ZqxkrG7UNRn6-FVMOOcP2rlkVpfpwc8n9BgyZBcDjZa-QXL5TLsYlpzAhbxQGxN9XyHk1dNhzs67n21-Q64snBa8_e8dOT4_HbvXoh9eDt1jX8BeqaKBVotpaiUzHAE4SiOEErzSVutLGFqGewMVr1qsFZoJNBPYCiMZ54rvyP3f7SYa5-Q8pPN4kY2bjP8CyCNLMQ</recordid><startdate>20221121</startdate><enddate>20221121</enddate><creator>Unger, Josua</creator><creator>Messinger, Anette</creator><creator>Niehoff, Benjamin E</creator><creator>Fellner, Michael</creator><creator>Lechner, Wolfgang</creator><scope>GOX</scope></search><sort><creationdate>20221121</creationdate><title>Low-depth Circuit Implementation of Parity Constraints for Quantum Optimization</title><author>Unger, Josua ; Messinger, Anette ; Niehoff, Benjamin E ; Fellner, Michael ; Lechner, Wolfgang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a677-8a9b4dd951c3eaa3e5c447430bfbbbfbb1ef1e6ca0309e27ecdab14e94c513373</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Physics - Quantum Physics</topic><toplevel>online_resources</toplevel><creatorcontrib>Unger, Josua</creatorcontrib><creatorcontrib>Messinger, Anette</creatorcontrib><creatorcontrib>Niehoff, Benjamin E</creatorcontrib><creatorcontrib>Fellner, Michael</creatorcontrib><creatorcontrib>Lechner, Wolfgang</creatorcontrib><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Unger, Josua</au><au>Messinger, Anette</au><au>Niehoff, Benjamin E</au><au>Fellner, Michael</au><au>Lechner, Wolfgang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Low-depth Circuit Implementation of Parity Constraints for Quantum Optimization</atitle><date>2022-11-21</date><risdate>2022</risdate><abstract>We present a construction for circuits with low gate count and depth, implementing three- and four-body Pauli-Z product operators as they appear in the form of plaquette-shaped constraints in QAOA when using the parity mapping. The circuits can be implemented on any quantum device with nearest-neighbor connectivity on a square-lattice, using only one gate type and one orientation of two-qubit gates at a time. We find an upper bound for the circuit depth which is independent of the system size. The procedure is readily adjustable to hardware-specific restrictions, such as a minimum required spatial distance between simultaneously executed gates, or gates only being simultaneously executable within a subset of all the qubits, for example a single line.</abstract><doi>10.48550/arxiv.2211.11287</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2211.11287
ispartof
issn
language eng
recordid cdi_arxiv_primary_2211_11287
source arXiv.org
subjects Physics - Quantum Physics
title Low-depth Circuit Implementation of Parity Constraints for Quantum Optimization
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-04T08%3A18%3A43IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Low-depth%20Circuit%20Implementation%20of%20Parity%20Constraints%20for%20Quantum%20Optimization&rft.au=Unger,%20Josua&rft.date=2022-11-21&rft_id=info:doi/10.48550/arxiv.2211.11287&rft_dat=%3Carxiv_GOX%3E2211_11287%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true