Optimizing quantum transformation matrices: Block decomposition approach for efficient gate reduction

Kin Man Lai; Xin Wang

doi:10.1103/PhysRevA.111.042613

Optimizing quantum transformation matrices: Block decomposition approach for efficient gate reduction

Kin Man Lai, Xin Wang^*

^*Corresponding author for this work

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

12 Downloads (CityUHK Scholars)

Abstract

This paper introduces an algorithm designed to approximate quantum transformation matrix with a restricted number of gates by using the block decomposition technique. Addressing challenges posed by numerous gates in handling large qubit transformations, the algorithm provides a solution by optimizing gate usage while maintaining computational accuracy. Inspired by the block decompose algorithm, our approach processes transformation matrices in a blockwise manner, enabling users to specify the desired gate count for flexibility in resource allocation. Simulations validate the effectiveness of the algorithm in approximating transformations with significantly fewer gates, enhancing quantum computing efficiency for complex calculations. © 2025 American Physical Society.

Original language	English
Article number	042613
Journal	Physical Review A
Volume	111
Issue number	4
Online published	14 Apr 2025
DOIs	https://doi.org/10.1103/PhysRevA.111.042613
Publication status	Published - Apr 2025

Funding

This work is supported by the National Natural Science Foundation of China (Grants No. 11874312 and No. 12474489), Shenzhen Fundamental Research Program (Grant No. JCYJ20240813153139050), the Guangdong Provincial Quantum Science Strategic Initiative (Grants No. GDZX2203001 and No. GDZX2403001), and the Innovation Program for Quantum Science and Technology (Grant No. 2021ZD0302300).

Publisher's Copyright Statement

COPYRIGHT TERMS OF DEPOSITED FINAL PUBLISHED VERSION FILE: Lai, K. M., & Wang, X. (2025). Optimizing quantum transformation matrices: Block decomposition approach for efficient gate reduction. Physical Review A, 111(4), Article 042613. https://doi.org/10.1103/PhysRevA.111.042613 The copyright of this article is owned by American Physical Society.

Access Output

10.1103/PhysRevA.111.042613

280894508.pdfFinal Published version, 927 KB

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@article{06ae282cdc104094b148ffdf994829c0,

title = "Optimizing quantum transformation matrices: Block decomposition approach for efficient gate reduction",

abstract = "This paper introduces an algorithm designed to approximate quantum transformation matrix with a restricted number of gates by using the block decomposition technique. Addressing challenges posed by numerous gates in handling large qubit transformations, the algorithm provides a solution by optimizing gate usage while maintaining computational accuracy. Inspired by the block decompose algorithm, our approach processes transformation matrices in a blockwise manner, enabling users to specify the desired gate count for flexibility in resource allocation. Simulations validate the effectiveness of the algorithm in approximating transformations with significantly fewer gates, enhancing quantum computing efficiency for complex calculations. {\textcopyright} 2025 American Physical Society.",

author = "Lai, {Kin Man} and Xin Wang",

year = "2025",

month = apr,

doi = "10.1103/PhysRevA.111.042613",

language = "English",

volume = "111",

journal = "Physical Review A",

issn = "2469-9926",

publisher = "American Physical Society",

number = "4",

}

TY - JOUR

T1 - Optimizing quantum transformation matrices

T2 - Block decomposition approach for efficient gate reduction

AU - Lai, Kin Man

AU - Wang, Xin

PY - 2025/4

Y1 - 2025/4

N2 - This paper introduces an algorithm designed to approximate quantum transformation matrix with a restricted number of gates by using the block decomposition technique. Addressing challenges posed by numerous gates in handling large qubit transformations, the algorithm provides a solution by optimizing gate usage while maintaining computational accuracy. Inspired by the block decompose algorithm, our approach processes transformation matrices in a blockwise manner, enabling users to specify the desired gate count for flexibility in resource allocation. Simulations validate the effectiveness of the algorithm in approximating transformations with significantly fewer gates, enhancing quantum computing efficiency for complex calculations. © 2025 American Physical Society.

AB - This paper introduces an algorithm designed to approximate quantum transformation matrix with a restricted number of gates by using the block decomposition technique. Addressing challenges posed by numerous gates in handling large qubit transformations, the algorithm provides a solution by optimizing gate usage while maintaining computational accuracy. Inspired by the block decompose algorithm, our approach processes transformation matrices in a blockwise manner, enabling users to specify the desired gate count for flexibility in resource allocation. Simulations validate the effectiveness of the algorithm in approximating transformations with significantly fewer gates, enhancing quantum computing efficiency for complex calculations. © 2025 American Physical Society.

UR - http://www.scopus.com/inward/record.url?scp=105002679320&partnerID=8YFLogxK

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-105002679320&origin=recordpage

U2 - 10.1103/PhysRevA.111.042613

DO - 10.1103/PhysRevA.111.042613

M3 - RGC 21 - Publication in refereed journal

SN - 2469-9926

VL - 111

JO - Physical Review A

JF - Physical Review A

IS - 4

M1 - 042613

ER -

Optimizing quantum transformation matrices: Block decomposition approach for efficient gate reduction

Abstract

Funding

Publisher's Copyright Statement

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this