Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2507.12603 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918095663136768 |
|---|---|
| author | Kupryianau, Heorhi Niemiec, Marcin |
| author_facet | Kupryianau, Heorhi Niemiec, Marcin |
| contents | Efficient quantum arithmetic operations are essential building blocks for complex quantum algorithms, yet few theoretical designs have been implemented in practical quantum programming frameworks. This paper presents the first complete implementation of the T-count optimized non-restoring quantum square root algorithm using the Qrisp quantum programming framework. The algorithm, originally proposed by Thapliyal et al., offers better resource efficiency compared to alternative methods, achieving reduced T-count and qubit requirements while avoiding garbage output. Our implementation validates the theoretical resource estimates, confirming a T-count of 14n-14 and T-depth of 5n+3 for n-bit inputs. The modular design approach enabled by Qrisp allows construction from reusable components including reversible adders, subtractors, and conditional logic blocks built from fundamental quantum gates. The three-stage algorithm - comprising initial subtraction, iterative conditional addition/subtraction, and remainder restoration is successfully translated from algorithmic description to executable quantum code. Experimental validation across multiple test cases confirms correctness, with the circuit producing accurate integer square roots and remainders. This work demonstrates the practical realizability of resource-optimized quantum arithmetic algorithms and establishes a foundation for implementing different arithmetic operations in modern quantum programming frameworks. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_12603 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Qrisp Implementation and Resource Analysis of a T-Count-Optimised Non-Restoring Quantum Square-Root Circuit Kupryianau, Heorhi Niemiec, Marcin Quantum Physics Efficient quantum arithmetic operations are essential building blocks for complex quantum algorithms, yet few theoretical designs have been implemented in practical quantum programming frameworks. This paper presents the first complete implementation of the T-count optimized non-restoring quantum square root algorithm using the Qrisp quantum programming framework. The algorithm, originally proposed by Thapliyal et al., offers better resource efficiency compared to alternative methods, achieving reduced T-count and qubit requirements while avoiding garbage output. Our implementation validates the theoretical resource estimates, confirming a T-count of 14n-14 and T-depth of 5n+3 for n-bit inputs. The modular design approach enabled by Qrisp allows construction from reusable components including reversible adders, subtractors, and conditional logic blocks built from fundamental quantum gates. The three-stage algorithm - comprising initial subtraction, iterative conditional addition/subtraction, and remainder restoration is successfully translated from algorithmic description to executable quantum code. Experimental validation across multiple test cases confirms correctness, with the circuit producing accurate integer square roots and remainders. This work demonstrates the practical realizability of resource-optimized quantum arithmetic algorithms and establishes a foundation for implementing different arithmetic operations in modern quantum programming frameworks. |
| title | Qrisp Implementation and Resource Analysis of a T-Count-Optimised Non-Restoring Quantum Square-Root Circuit |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2507.12603 |