.png){kind=icon}
返回
Quantum Bilinear Interpolation Algorithms Based on Geometric Centers
.png){kind=icon}
PRE
AI
DOI：10.1145/3591364.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Bilinear interpolation is widely used in classical signal and image processing. Quantum algorithms have been designed for efficiently realizing bilinear interpolation. However, these quantum algorithms have limitations in circuit width and garbage outputs, which block the quantum algorithms applied to noisy intermediatescale quantum devices. In addition, the existing quantum bilinear interpolation algorithms cannot keep the consistency between the geometric centers of the original and target images. To save the above questions, we propose quantum bilinear interpolation algorithms based on geometric centers using fault-tolerant implementations of quantum arithmetic operators. Proposed algorithms include the scaling-up and scaling-down for signals (grayscale images) and signals with three channels (color images). Simulation results demonstrate that the proposed bilinear interpolation algorithms obtain the same results as their classical counterparts with an exponential speedup. Performance analysis reveals that the proposed bilinear interpolation algorithms keep the consistency of geometric centers and significantly reduce circuit width and garbage outputs compared to the existing works.
Keyword:
Bilinear interpolation
quantum bilinear interpolation
quantum algorithm
quantum circuit
期刊
A
IF:
6.8
论文数:
540
被引数:
508
机构
引用论文
Evidence that changes in LH pulse frequency may regulate the seasonal modulation of LH secretion in ovariectomized mares.png)
Reproduction
OAAI
ReproductionIF0
OAAI分享收藏Identification of DDX31 as a Potential Oncogene of Invasive Metastasis and Proliferation in PDAC鉴定DDX31作为PDAC中侵袭性转移和增殖的潜在癌基因
OAAI
OAAI分享收藏
查看更多内容