Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2511.02413 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908627983400960 |
|---|---|
| author | Liu, Yu-Hang Tao, Yuan-Hong Lan, Jing-Run Fei, Shao-Ming |
| author_facet | Liu, Yu-Hang Tao, Yuan-Hong Lan, Jing-Run Fei, Shao-Ming |
| contents | This paper focuses on quantum algorithms for three key matrix operations: Hadamard (Schur) product, Kronecker (tensor) product, and elementary column transformations each. By designing specific unitary transformations and auxiliary quantum measurement, efficient quantum schemes with circuit diagrams are proposed. Their computational depths are: O(1) for Kronecker product; O(max(m,n)) for Hadamard product (linked to matrix dimensions); and O(m) for elementary column transformations of (2^n X 2^m) matrices (dependent only on column count).Notably, compared to traditional column transformation via matrix transposition and row transformations, this scheme reduces computation steps and quantum gate usage, lowering quantum computing energy costs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_02413 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Quantum Circuit Implementation of Two Matrix Product Operations and Elementary Column Transformations Liu, Yu-Hang Tao, Yuan-Hong Lan, Jing-Run Fei, Shao-Ming Quantum Physics This paper focuses on quantum algorithms for three key matrix operations: Hadamard (Schur) product, Kronecker (tensor) product, and elementary column transformations each. By designing specific unitary transformations and auxiliary quantum measurement, efficient quantum schemes with circuit diagrams are proposed. Their computational depths are: O(1) for Kronecker product; O(max(m,n)) for Hadamard product (linked to matrix dimensions); and O(m) for elementary column transformations of (2^n X 2^m) matrices (dependent only on column count).Notably, compared to traditional column transformation via matrix transposition and row transformations, this scheme reduces computation steps and quantum gate usage, lowering quantum computing energy costs. |
| title | Quantum Circuit Implementation of Two Matrix Product Operations and Elementary Column Transformations |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2511.02413 |