检索结果-内蒙古大学图书馆

Approximating exponentials of commutators by optimized product formulas

quantum information processing 2025年第2期24卷 1-21页

作者： Casas, F. Escorihuela-Tomas, A. Casares, P. A. Moreno Univ Jaume 1 Dept Matemat Castellon de La Plana 12071 Spain Univ Jaume 1 IMAC Castellon de La Plana 12071 Spain

Trotter product formulas constitute a cornerstone quantum Hamiltonian simulation technique. However, the efficient implementation of Hamiltonian evolution of nested commutators remains an under explored area. In this work, we construct optimized product formulas of orders 3-6 approximating the exponential of a commutator of two arbitrary operators in terms of the exponentials of the operators involved. The new schemes require a reduced number of exponentials and thus provide more efficient approximations than other previously published alternatives. They can also be used as basic methods in recursive procedures to increase the order of approximation. We expect this research will improve the efficiency of quantum control protocols, as well as quantum algorithms such as the Zassenhaus-based product formula, Magnus operator-based time-dependent simulation, and product formula schemes with modified potentials.

关键词： Product formulas Hamiltonian evolution of commutators of observables quantum simulation

来源：评论

学校读者我要写书评

暂无评论

quantum classifier based on open quantum systems with amplitude information loading

引用

quantum information processing 2024年第10期23卷 1-24页

作者： Brito, Eduardo Barreto de Paula Neto, Fernando M. Bernardes, Nadja Kolb Univ Fed Pernambuco Ctr Informat Ave Jorn Anibal Fernandes BR-50740560 Recife Pe Brazil Univ Fed Pernambuco Dept Fis Ave Jorn Anibal Fernandes BR-50670901 Recife Pe Brazil

Although the studies on quantum algorithms have been progressing, it is still necessary to broaden the investigation of open quantum systems. In this study, we present the use of an open quantum system to implement a quantum classifier algorithm. Zhang et al. propose a one-QuBit system interacting with the environment through a unitary operator from the Hamiltonian. In our proposal, the input data are loaded into the amplitude of the environment instead of being in the unitary operator. This change positively impacts the performance of different databases tested and causes a difference in the system entanglement behavior. For evaluation, the Zhang et al. proposed models were tested in four real-world datasets and seven other toy problems. The results are evaluated according to accuracy and F1 score. A deeper analysis of the Iris dataset is also done, checking the creation of entanglement and an extensive random search for better parameters on the proposed model. The results show that for most real-world dataset configurations, the proposed model, although having a simpler decision area, performed better than the one inspired by the Zhang et al. model, and that there is no pattern for the system entanglement in the Iris dataset.

关键词： quantum open system quantum neuron quantum classifier quantum machine learning Open quantum system neuron Artificial neuron Machine learning

来源：评论

学校读者我要写书评

暂无评论

Introduction to multiplicative group on 2-qubits in quantum color image processing

引用

quantum information processing 2023年第9期22卷 1-34页

作者： Grigoryan, Artyom M. Agaian, Sos S. Univ Texas San Antonio Dept Elect & Comp Engn San Antonio TX 78249 USA CUNY Coll Staten Isl Comp Sci Dept New York NY USA

quantum computing algorithms offer the potential to revolutionize computational efficiency across a wide range of applications. However, one significant challenge that has impeded progress in color image processing is the difficulty of representing color relationships in quantum computers. In addition to this challenge, another major hurdle is efficiently representing data in quantum computers and performing quantum operations or arithmetic. To overcome these challenges, researchers have proposed various novel approaches, including using qubit lattices and flexible representations of quantum images. Despite these advancements, the quantum color image processing field is still in its early stages. This paper proposes a new arithmetic for processing quantum color images using novel operations for 2-qubits and the concept of quantum quaternion Fourier transform. We first study arithmetic operations in the 2-qubit setting, such as multiplication, inverse, and division on 2-qubits in quantum computation. The space of 2-qubits with real amplitudes is considered, and prototypes of power and exponent operations are also defined. The presented operations are applied to quantum superpositions of 2-qubits, to enable processing of quaternion images, which are 4-dimensional vectors and can be represented by 2-qubits at each pixel. The proposed methods and tools are designed to be embedded in a quantum device, which allows them to be used in various applications in the 2-qubits domain. To facilitate practical applications, the paper also introduces a tool for processing color images that can be used for color image filtering. Furthermore, this work provides a foundation to explore theoretical and practical aspects of color image processing on quantum computers.

关键词： 2-qubit multiplication quantum color image representation quantum quaternion Fourier transform

来源：评论

学校读者我要写书评

暂无评论

Real-time seedless post-processing for quantum random number generators

IET QUANTUM COMMUNICATION

引用

IET quantum COMMUNICATION 2024年第4期5卷 650-657页

作者： Li, Qian Zhou, Hongyi Shenzhen Res Inst Big Data Shenzhen Int Ctr Ind & Appl Math Shenzhen Peoples R China Chinese Acad Sci Inst Comp Technol State Key Lab Processors Beijing Peoples R China

quantum-proof randomness extraction is essential for handling quantum side information possessed by a quantum adversary, which is widely applied in various quantum cryptography tasks. In this study, the authors introduce a real-time two-source quantum randomness extractor against quantum side information. The authors' extractor is tailored for forward block sources, a novel category of min-entropy sources introduced in this work. These sources retain the flexibility to accommodate a broad range of quantum random number generators. The authors' online algorithms demonstrate the extraction of a constant fraction of min-entropy from two infinitely long independent forward block sources. Moreover, the authors' extractor is inherently block-wise parallelisable, presenting a practical and efficient solution for the timely extraction of high-quality randomness. Applying the authors' extractors to the raw data of one of the most commonly used quantum random number generators, a simulated extraction speed as high as 64 Gbps is achieved.

关键词： quantum cryptography quantum information

来源：评论

学校读者我要写书评

暂无评论

quantum multi-programming for Grover's search

引用

quantum information processing 2023年第1期22卷 1-23页

作者： Park, Gilchan Zhang, Kun Yu, Kwangmin Korepin, Vladimir Brookhaven Natl Lab Computat Sci Initiat Upton NY 11973 USA SUNY Stony Brook Dept Chem Stony Brook NY 11794 USA SUNY Stony Brook CN Yang Inst Theoret Phys Stony Brook NY 11794 USA

quantum multi-programming is a method utilizing contemporary noisy intermediate-scale quantum computers by executing multiple quantum circuits concurrently. Despite early research on it, the research remains on quantum gates or small-size quantum algorithms without correlation. In this paper, we propose a quantum multi-programming (QMP) algorithm for Grover's search. Our algorithm decomposes Grover's algorithm by the partial diffusion operator and executes the decomposed circuits in parallel by QMP. We proved that this new algorithm increases the rotation angle of the Grover operator which, as a result, increases the success probability. The new algorithm is implemented on IBM quantum computers and compared with the canonical Grover's algorithm and other variations of Grover's algorithms. The empirical tests validate that our new algorithm outperforms other variations of Grover's algorithms as well as the canonical Grover's algorithm.

关键词： quantum computing NISQ algorithm Multi-programming Grover's search

来源：评论

学校读者我要写书评

暂无评论

High-efficiency implementation of Toeplitz Strong Extractor for PRNG and QRNG output on CPU/GPU hardware systems

引用

PHYSICA SCRIPTA 2024年第7期99卷 075115-075115页

作者： Anurag, K. S. V. Raghavan, G. Raju, P. Kanaka Def Inst Adv Technol Sch Quantum Technol Pune 411025 Maharashtra India

Random Number Generators (RNGs) are devices whose utility spans from cryptography to gambling. Depending on the source of the random seed, RNGs are classified as Pseudo-Random Number Generators (PRNGs), which are based on mathematical algorithms, True Random Number Generators (TRNGs) sourced through seemingly random physical processes, and finally, quantum Random Number Generators (QRNGs) which harness the intrinsic randomness of measured outcomes of quantum states. To ensure that the output of a QRNG is private and nearly uniform, the raw data undergoes a strong extraction process such as Toeplitz or Trevisan Hashing. The extraction process needs to be extremely efficient to achieve high-speed random number generation. The present work demonstrates state-of-the-art methods for performing information-theoretically provable randomness extraction using variations of the Toeplitz Hashing algorithm. These algorithms are implemented on various hardware for comprehensive analysis. Subsequently, these methods are applied to two raw data sets from a PRNG source and a quantum source. A new benchmark of 19.5 Gbps for Randomness Extraction using the Fast Fourier Transform-based Toeplitz Strong Extractor is demonstrated in this work. The implementation of the algorithm on a GPU-based system demonstrates notably enhanced speed, marking a significant leap beyond the existing state-of-the-art implementations.

关键词： randomness extraction quantum communication QRNG post-processing Toeplitz Hashing strong extraction

来源：评论

学校读者我要写书评

暂无评论

Twin-field quantum key distribution based on particle swarm optimization algorithm

引用

quantum information processing 2025年第2期24卷 1-14页

作者： Liu, Chang Li, Yue Wang, Haoyang Shi, Kaiyi Sun, Zhongqi Li, Jiaao Zhang, Yujia Ma, Duo Ma, Haiqiang Beijing Univ Posts & Telecommun Sch Sci Beijing 100876 Peoples R China Beijing Univ Posts & Telecommun State Key Lab Informat Photon & Opt Commun Beijing 100876 Peoples R China

In the application of quantum key distribution, besides security being a necessary consideration, real-time performance is also very critical. Exhaustive traversal or local search algorithm has been commonly utilized in previous applications;however, these algorithms cannot satisfy the low latency requirement well. Therefore, in order to achieve efficient quantum key distribution parameter optimization and selection, the particle swarm optimization algorithm applied to twin-field quantum key distribution is proposed and compared with the results of the exhaustive traversal algorithm in this paper. The results show that particle swarm optimization algorithm can optimize the parameters to 15 decimal places;the algorithm performs well in terms of accuracy and robustness, and the parameter optimization accuracy is more than 99.5%. Meanwhile, the minimum running time is 5.68 s when guaranteeing the above values in terms of the accuracy of the optimization results.

关键词： quantum key distribution Particle swarm optimization Parameter optimization Twin-field

来源：评论

学校读者我要写书评

暂无评论

quantum phase transition detection via quantum support vector machine

引用

quantum SCIENCE AND TECHNOLOGY 2025年第1期10卷 015043-015043页

作者： Wang, Youle Cao, Linyun Nanjing Univ Informat Sci & Technol Sch Software Nanjing Peoples R China

Unveiling quantum phase transitions (QPTs) is important for characterising physical systems at low temperatures. However, the detection of these transitions is encumbered by significant challenges, especially in the face of the exponential growth in ground state complexity with system scale. The emergence of quantum machine learning has lately gained traction as a promising method for elucidating the properties of many-body systems, providing a different avenue to study QPT. In this paper, we propose a novel and efficient quantum algorithm for identifying QPT synthesising quantum feature with quantum machine learning. Our approach is anchored in the utilisation of quantum computers to directly encode the kernel matrix into Hilbert spaces, realised by the parallel implementation of the quantum feature map. Specifically, we generate a quantum state encoding the information of ground states of the given quantum systems by employing the parallel quantum feature map. The resultant state preparation circuit is then used to implement a block-encoding of the kernel matrix. Equipped with the associated labels and this encoding, we devise a new quantum support vector machine (QSVM) algorithm, forming the main ingredient of the classifier. The presented method refines the efficiency of the prevailing QSVM algorithm for processing quantum and classical data. We demonstrate the effectiveness of our quantum classifier in predicting QPT within the transverse-field Ising model. The findings affirm the efficacy of quantum machine learning in recognising QPT in many-body systems and offer insights into the design of quantum machine learning algorithms.

关键词： quantum machine learning quantum support vector machine learning quantum phase transition

来源：评论

学校读者我要写书评

暂无评论

Psitrum: An open source simulator for universal quantum computers

IET QUANTUM COMMUNICATION

引用

IET quantum COMMUNICATION 2024年第4期5卷 586-600页

作者： Alghadeer, Mohammed Aldawsari, Eid Selvarajan, Raja Alutaibi, Khaled Kais, Sabre Alharbi, Fahhad H. Univ Oxford Clarendon Lab Dept Phys Oxford OX1 3PU England King Fahd Univ Petr & Minerals Dept Informat & Comp Sci Dhahran Saudi Arabia Purdue Univ Dept Chem Dept Phys & Astron W Lafayette IN USA Purdue Univ Purdue Quantum Sci & Engn Inst W Lafayette IN USA King Fahd Univ Petr & Minerals Dept Phys Dhahran Saudi Arabia King Fahd Univ Petr & Minerals Dept Elect Engn Dhahran Saudi Arabia

quantum computing is a radical new paradigm for a technology that is capable to revolutionise information processing. Simulators of universal quantum computer are important for understanding the basic principles and operations of the current noisy intermediate-scale quantum processors, and for building in future fault-tolerant quantum computers. As next-generation quantum technologies continue to advance, it is crucial to address the impact on education and training in quantum physics. The emergence of new industries driven by progress in quantum computing and simulation will create a demand for a specialised quantum workforce. In response to these challenges, the authors present Psitrum, an open-source simulator for universal quantum computers. Psitrum serves as a powerful educational and research tool, enabling a diverse range of stakeholders to understand the fundamental principles and operations of quantum systems. By offering a comprehensive platform for emulating and debugging quantum algorithms through quantum circuits, Psitrum aids in the exploration and analysis of various quantum applications using both MATLAB and MATLAB application programming interface to use the software on other platforms. Psitrum software and source codes are fully available at GitHub. The authors introduce Psitrum, an open-source simulator for universal quantum computers, designed as an educational and research tool for understanding quantum systems. It provides a comprehensive platform for emulating and debugging quantum algorithms through quantum circuits, supporting MATLAB and its API for cross-platform usability. This tool addresses the growing need for specialised education and training in the advancing field of quantum computing and simulation. image

关键词： quantum computing quantum information quantum noise

来源：评论

学校读者我要写书评

暂无评论

quantum private information retrieval with lattice-based access authentication

引用

quantum information processing 2025年第5期24卷 1-18页

作者： Hao, Jia Yang, Yu-Guang Xu, Guang-Bao Jiang, Dong-Huan Li, Dan Zhou, Yi-Hua Shi, Wei-Min Beijing Univ Technol Coll Comp Sci & Technol Beijing 100124 Peoples R China Shandong Univ Sci & Technol Coll Comp Sci & Engn Qingdao 266590 Peoples R China Shandong Univ Sci & Technol Coll Math & Syst Sci Qingdao 266590 Peoples R China Nanjing Univ Aeronaut & Astronaut Coll Comp Sci & Technol Nanjing 210016 Peoples R China

Most quantum key distribution (QKD)-based quantum private information retrieval (QPIR) protocols cannot resist denial-of-service (DoS) attacks. Furthermore, these protocols generally involve issues with an unspecified error rate threshold. To address these issues, we propose the QPIR protocol based on two lattice-based post-quantum algorithms, i.e., CRYSTALS-Dilithium for digital signatures and CRYSTALS-KYBER for key establishment. Specifically, in the quantum secure direct communication network, part of the key establishment process is replaced by the verification of signatures encoded in quantum states. This approach not only achieves access authentication but also effectively resists DoS attacks. We provide a detailed security analysis of our protocol. Furthermore, we provide a method for selecting three parameters m\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$m$$\end{document}, d\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$d$$\end{document} and theta\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\theta $$\end{document} according to security requirements, especially for the security against DoS attacks, thus offering greater flexibility in our protocol.

关键词： quantum private information retrieval Denial of service Access authentication Privacy

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：