Direct interpolative construction of the discrete Fourier transform as a matrix product operator

The quantum Fourier transform (QFT), which can be viewed as a reindexing of the discrete Fourier transform (DFT), has been shown to be compressible as a low-rank matrix product operator (MPO) or quantized tensor train (QTT) operator. However, the original proof of this fact does not furnish a constr...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Chen, Jielun, Lindsey, Michael
Format: Artikel
Sprache:eng
Schlagworte:
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 Chen, Jielun
Lindsey, Michael
description The quantum Fourier transform (QFT), which can be viewed as a reindexing of the discrete Fourier transform (DFT), has been shown to be compressible as a low-rank matrix product operator (MPO) or quantized tensor train (QTT) operator. However, the original proof of this fact does not furnish a construction of the MPO with a guaranteed error bound. Meanwhile, the existing practical construction of this MPO, based on the compression of a quantum circuit, is not as efficient as possible. We present a simple closed-form construction of the QFT MPO using the interpolative decomposition, with guaranteed near-optimal compression error for a given rank. This construction can speed up the application of the QFT and the DFT, respectively, in quantum circuit simulations and QTT applications. We also connect our interpolative construction to the approximate quantum Fourier transform (AQFT) by demonstrating that the AQFT can be viewed as an MPO constructed using a different interpolation scheme.
doi_str_mv 10.48550/arxiv.2404.03182
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2404_03182</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2404_03182</sourcerecordid><originalsourceid>FETCH-LOGICAL-a672-792f4c2efebeaec65fa0b68e3733023a3cd239f0db32b3dcfefef00ff364d1df3</originalsourceid><addsrcrecordid>eNotz71Ow0AQBGA3FCjwAFTsC9hcbv2XEgUCSJHSpDfru11xUuyz1pcovD0hUE0zM9KXZQ9LU5RtVZkn0nM4FbY0ZWFw2drb7PMlKLsEYUysUzxQCicGF8c56dGlEEeIAumLwYfZKSeGTTxqYIWkNM4SdQCagWCgpOEMk0Z_GUKcWClFvctuhA4z3__nIttvXvfr93y7e_tYP29zqhubNysrpbMs3DOxqysh09ctY4NoLBI6b3Elxvdoe_ROLk0xRgTr0i-94CJ7_Lu9ErtJw0D63f1SuysVfwBGJVJe</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Direct interpolative construction of the discrete Fourier transform as a matrix product operator</title><source>arXiv.org</source><creator>Chen, Jielun ; Lindsey, Michael</creator><creatorcontrib>Chen, Jielun ; Lindsey, Michael</creatorcontrib><description>The quantum Fourier transform (QFT), which can be viewed as a reindexing of the discrete Fourier transform (DFT), has been shown to be compressible as a low-rank matrix product operator (MPO) or quantized tensor train (QTT) operator. However, the original proof of this fact does not furnish a construction of the MPO with a guaranteed error bound. Meanwhile, the existing practical construction of this MPO, based on the compression of a quantum circuit, is not as efficient as possible. We present a simple closed-form construction of the QFT MPO using the interpolative decomposition, with guaranteed near-optimal compression error for a given rank. This construction can speed up the application of the QFT and the DFT, respectively, in quantum circuit simulations and QTT applications. We also connect our interpolative construction to the approximate quantum Fourier transform (AQFT) by demonstrating that the AQFT can be viewed as an MPO constructed using a different interpolation scheme.</description><identifier>DOI: 10.48550/arxiv.2404.03182</identifier><language>eng</language><subject>Computer Science - Numerical Analysis ; Mathematics - Numerical Analysis ; Physics - Quantum Physics</subject><creationdate>2024-04</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,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2404.03182$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2404.03182$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Chen, Jielun</creatorcontrib><creatorcontrib>Lindsey, Michael</creatorcontrib><title>Direct interpolative construction of the discrete Fourier transform as a matrix product operator</title><description>The quantum Fourier transform (QFT), which can be viewed as a reindexing of the discrete Fourier transform (DFT), has been shown to be compressible as a low-rank matrix product operator (MPO) or quantized tensor train (QTT) operator. However, the original proof of this fact does not furnish a construction of the MPO with a guaranteed error bound. Meanwhile, the existing practical construction of this MPO, based on the compression of a quantum circuit, is not as efficient as possible. We present a simple closed-form construction of the QFT MPO using the interpolative decomposition, with guaranteed near-optimal compression error for a given rank. This construction can speed up the application of the QFT and the DFT, respectively, in quantum circuit simulations and QTT applications. We also connect our interpolative construction to the approximate quantum Fourier transform (AQFT) by demonstrating that the AQFT can be viewed as an MPO constructed using a different interpolation scheme.</description><subject>Computer Science - Numerical Analysis</subject><subject>Mathematics - Numerical Analysis</subject><subject>Physics - Quantum Physics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz71Ow0AQBGA3FCjwAFTsC9hcbv2XEgUCSJHSpDfru11xUuyz1pcovD0hUE0zM9KXZQ9LU5RtVZkn0nM4FbY0ZWFw2drb7PMlKLsEYUysUzxQCicGF8c56dGlEEeIAumLwYfZKSeGTTxqYIWkNM4SdQCagWCgpOEMk0Z_GUKcWClFvctuhA4z3__nIttvXvfr93y7e_tYP29zqhubNysrpbMs3DOxqysh09ctY4NoLBI6b3Elxvdoe_ROLk0xRgTr0i-94CJ7_Lu9ErtJw0D63f1SuysVfwBGJVJe</recordid><startdate>20240403</startdate><enddate>20240403</enddate><creator>Chen, Jielun</creator><creator>Lindsey, Michael</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20240403</creationdate><title>Direct interpolative construction of the discrete Fourier transform as a matrix product operator</title><author>Chen, Jielun ; Lindsey, Michael</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a672-792f4c2efebeaec65fa0b68e3733023a3cd239f0db32b3dcfefef00ff364d1df3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Computer Science - Numerical Analysis</topic><topic>Mathematics - Numerical Analysis</topic><topic>Physics - Quantum Physics</topic><toplevel>online_resources</toplevel><creatorcontrib>Chen, Jielun</creatorcontrib><creatorcontrib>Lindsey, Michael</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Chen, Jielun</au><au>Lindsey, Michael</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Direct interpolative construction of the discrete Fourier transform as a matrix product operator</atitle><date>2024-04-03</date><risdate>2024</risdate><abstract>The quantum Fourier transform (QFT), which can be viewed as a reindexing of the discrete Fourier transform (DFT), has been shown to be compressible as a low-rank matrix product operator (MPO) or quantized tensor train (QTT) operator. However, the original proof of this fact does not furnish a construction of the MPO with a guaranteed error bound. Meanwhile, the existing practical construction of this MPO, based on the compression of a quantum circuit, is not as efficient as possible. We present a simple closed-form construction of the QFT MPO using the interpolative decomposition, with guaranteed near-optimal compression error for a given rank. This construction can speed up the application of the QFT and the DFT, respectively, in quantum circuit simulations and QTT applications. We also connect our interpolative construction to the approximate quantum Fourier transform (AQFT) by demonstrating that the AQFT can be viewed as an MPO constructed using a different interpolation scheme.</abstract><doi>10.48550/arxiv.2404.03182</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2404.03182
ispartof
issn
language eng
recordid cdi_arxiv_primary_2404_03182
source arXiv.org
subjects Computer Science - Numerical Analysis
Mathematics - Numerical Analysis
Physics - Quantum Physics
title Direct interpolative construction of the discrete Fourier transform as a matrix product operator
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T13%3A52%3A04IST&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=Direct%20interpolative%20construction%20of%20the%20discrete%20Fourier%20transform%20as%20a%20matrix%20product%20operator&rft.au=Chen,%20Jielun&rft.date=2024-04-03&rft_id=info:doi/10.48550/arxiv.2404.03182&rft_dat=%3Carxiv_GOX%3E2404_03182%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