-
crossref
2022-05-12T04:27:37Z
置信度 0.70
-
crossref
2024-07-28T06:05:07Z
置信度 0.70
-
crossref
Xuewu ZHAO, Guangliang LIU, Xindang CHENG, Junzhong JI
2013-10-29T02:45:12Z
置信度 0.70
-
crossref
2011-08-29T12:11:46Z
置信度 0.70
-
crossref
Jian-Guo Hu, Shao-Yi Wu, Yi Yang, Qin-Sheng Zhu 等
2022-08-12T10:16:06Z
置信度 0.70
-
crossref
2011-08-29T16:11:46Z
置信度 0.70
-
Abstract The parallel computing power of quantum computing and the special properties of qubits provide an effective solution for image processing tasks. This paper presents a quantum image encryption algorithm based on Fisher-Yates algorithm and Logistic mapp…
crossref
Ping Fan, Yiteng Zhang
2024-06-12T10:02:06Z
置信度 0.70
-
crossref
2011-08-29T12:11:46Z
置信度 0.70
-
crossref
Rafael Pereira da Silva
2024-12-03T18:53:29Z
置信度 0.70
-
crossref
2008-10-15T15:55:19Z
置信度 0.70
-
crossref
2023-11-25T16:02:58Z
置信度 0.70
-
crossref
Jeffrey Bub
2012-07-29T00:31:00Z
置信度 0.70
-
crossref
2023-10-31T16:40:47Z
置信度 0.70
-
crossref
2023-07-29T09:10:10Z
置信度 0.70
-
We present a detailed circuit implementation of Szegedy's quantization of the Metropolis-Hastings walk. This quantum walk is usually defined with respect to an oracle. We find that a direct implementation of this oracle requires costly arithmetic operations. W…
crossref
Jessica Lemieux, Bettina Heim, David Poulin, Krysta Svore 等
2020-06-29T19:17:22Z
置信度 0.70
-
crossref
Pallab Biswas
2025-02-28T14:24:08Z
置信度 0.70
-
crossref
Alok Shukla, Prakash Vedula
2022-12-02T17:03:48Z
置信度 0.70
-
Topological data analysis has emerged as a powerful tool for analyzing large-scale data. An abstract simplicial complex, in principle, can be built from data points, and by using tools from homology, topological features could be identified. Given a simplex, a…
crossref
Nhat A. Nghiem, Xianfeng David Gu, Tzu-Chieh Wei
2025-12-23T17:47:07Z
置信度 0.70
-
We numerically investigate the performance of the short path optimization algorithm on a toy problem, with the potential chosen to depend only on the total Hamming weight to allow simulation of larger systems. We consider classes of potentials with multiple mi…
crossref
M. B. Hastings
2019-05-20T17:20:26Z
置信度 0.70
-
crossref
Soumik Adhikary
2021-08-02T08:03:10Z
置信度 0.70
-
crossref
Mouhamad Abushaqra
2025-01-02T18:56:53Z
置信度 0.70
-
crossref
Zheng-jun YI, Rong-hua HE, Kun HOU
2013-08-25T01:39:38Z
置信度 0.70
-
crossref
Phuong-Nam Nguyen
2024-01-12T07:02:35Z
置信度 0.70
-
Grover's quantum search algorithm provides a proven quadratic speedup over classical linear search for unstructured databases. While its theoretical advantage is well established, experimental validation on real noisy intermediate-scale quantum (NISQ) hardware…
crossref
Kundan Kumar Sahu
2025-12-29T23:41:19Z
置信度 0.70
-
crossref
2020-04-07T21:33:33Z
置信度 0.70
-
Abstract A key open question in quantum computing is whether quantum algorithms can potentially offer a significant advantage over classical algorithms for tasks of practical interest. Understanding the limits of classical computing in simulating quantum syste…
crossref
Matija Medvidović, Giuseppe Carleo
2021-06-18T10:03:33Z
置信度 0.70
-
crossref
2023-06-30T08:10:45Z
置信度 0.70
-
crossref
Hiroshi Ohno
2024-11-13T12:55:43Z
置信度 0.70
-
crossref
Leila Taghavi
2022-07-09T21:23:56Z
置信度 0.70
-
We introduce Yao , an extensible, efficient open-source framework for quantum algorithm design. Yao features generic and differentiable programming of quantum circuits. It achieves state-of-the-art performance in simulating small to intermediate-sized quantum …
crossref
Xiu-Zhe Luo, Jin-Guo Liu, Pan Zhang, Lei Wang
2020-10-11T16:36:56Z
置信度 0.70
-
crossref
Alokananda Dey, Siddhartha Bhattacharyya, Sandip Dey, Jan Platos
2020-07-10T08:08:32Z
置信度 0.70
-
europepmc
2026
置信度 0.80
-
europepmc
2026
置信度 0.80
-
europepmc
2026
置信度 0.80
-
europepmc
2026
置信度 0.80
-
europepmc
2026
置信度 0.80
-
europepmc
2025
置信度 0.80
-
europepmc
2025
置信度 0.80
-
europepmc
2026
置信度 0.80
-
europepmc
2026
置信度 0.80
-
europepmc
2025
置信度 0.80
-
europepmc
2026
置信度 0.80
-
europepmc
2025
置信度 0.80
-
europepmc
2026
置信度 0.80
-
europepmc
2025
置信度 0.80
-
europepmc
2025
置信度 0.80
-
europepmc
2025
置信度 0.80
-
europepmc
2025
置信度 0.80
-
europepmc
2025
置信度 0.80
-
europepmc
2025
置信度 0.80
-
europepmc
2025
置信度 0.80
-
europepmc
2025
置信度 0.80
-
europepmc
2025
置信度 0.80
-
europepmc
2025
置信度 0.80
-
europepmc
2025
置信度 0.80
-
europepmc
2025
置信度 0.80
-
europepmc
2025
置信度 0.80
-
europepmc
2025
置信度 0.80
-
The identification of RNA motifs plays a crucial role in understanding biological functions, predicting RNA 3D structures, and designing RNA-based therapeutics. One of the efficient strategies approaches this task by analyzing secondary structure graphs annota…
europepmc
2025
置信度 0.80
-
europepmc
2025
置信度 0.80
-
europepmc
2024
置信度 0.80
-
europepmc
2025
置信度 0.80
-
europepmc
2024
置信度 0.80
-
europepmc
2024
置信度 0.80
-
europepmc
2025
置信度 0.80
-
europepmc
2024
置信度 0.80
-
europepmc
2024
置信度 0.80
-
europepmc
2023
置信度 0.80
-
europepmc
2024
置信度 0.80
-
europepmc
2024
置信度 0.80
-
europepmc
2024
置信度 0.80
-
europepmc
2025
置信度 0.80
-
europepmc
2024
置信度 0.80
-
europepmc
2022
置信度 0.80
-
europepmc
2023
置信度 0.80
-
europepmc
2024
置信度 0.80
-
europepmc
2023
置信度 0.80
-
europepmc
2023
置信度 0.80
-
Abstract A novel quantum algorithm for use in Biological Sequence Alignment is presented and analyzed. The large amounts of data extracted from genome sequencing, de novo assembly sequencing, resequencing, and transcriptome sequencing at the DNA or RNA level, …
europepmc
2024
置信度 0.80
-
europepmc
2023
置信度 0.80
-
europepmc
2024
置信度 0.80
-
europepmc
2023
置信度 0.80
-
europepmc
2023
置信度 0.80
-
europepmc
2022
置信度 0.80
-
europepmc
2023
置信度 0.80
-
europepmc
2023
置信度 0.80
-
europepmc
2023
置信度 0.80
-
europepmc
2023
置信度 0.80
-
europepmc
2023
置信度 0.80
-
europepmc
2022
置信度 0.80
-
europepmc
2022
置信度 0.80
-
europepmc
2022
置信度 0.80
-
europepmc
2023
置信度 0.80
-
europepmc
2023
置信度 0.80
-
europepmc
2022
置信度 0.80
-
europepmc
2022
置信度 0.80
-
europepmc
2023
置信度 0.80
-
europepmc
2022
置信度 0.80
-
europepmc
2022
置信度 0.80
-
europepmc
2021
置信度 0.80