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

Review of intermediate representations for quantum computing

JOURNAL OF SUPERcomputing 2025年第2期81卷 1-21页

作者： Cardama, F. Javier Vazquez-Perez, Jorge Pineiro, Cesar Pichel, Juan C. Pena, Tomas F. Gomez, Andres Univ Santiago Compostela Ctr Singular Invest Tecnoloxias Intelixentes CiTIU Santiago De Compostela 15782 Galicia Spain Univ Santiago Compostela Dept Elect Comp Santiago De Compostela 15705 Galicia Spain Galicia Supercomp Ctr CESGA Santiago De Compostela 15705 Galicia Spain

Intermediate representations (IRs) are fundamental to classical and quantum computing, bridging high-level quantum programming languages and the hardware-specific instructions required for execution. This paper reviews the development of quantum IRs, focusing on their evolution and the need for abstraction layers that facilitate portability and optimization. Monolithic quantum IRs, such as QIR (Lubinski et al. in Front Phys 10:940293, 2022. https://***/10.3389/fphy.2022.940293), QSSA (Peduri et al. in Proceedings of the 31st ACM SIGPLAN international conference on compiler construction. CC 2022. Association for computing Machinery, New York, 2022), or Q-MLIR (McCaskey and Nguyen in Proceedings-2021 IEEE International Conference on quantum computing and Engineering, QCE, 2021), their effectiveness in handling abstractions, and their hybrid support between quantum-classical operations are evaluated. However, a key limitation is their inability to address qubit locality, an essential feature for distributed quantum computing (DQC). To overcome this, InQuIR (Nishio and Wakizaka in InQuIR: Intermediate Representation for Interconnected quantum Computers, 2023. https://***/abs/2302.00267) was introduced as an IR specifically designed for distributed systems, providing explicit control over qubit locality and inter-node communication. While effective in managing qubit distribution, InQuIR's dependence on manual manipulation of communication protocols increases complexity for developers. NetQIR (V & aacute;zquez-P & eacute;rez et al. in NetQIR: An Extension of QIR for distributed quantum computing, 2024. https://***/abs/2408.03712), an extension of QIR for DQC, emerges as a solution to achieve the abstraction of quantum communications protocols. This review emphasizes the need for further advancements in IRs for distributed quantum systems, which will play a crucial role in the scalability and usability of future quantum networks.

关键词： Intermediate representation quantum compiling distributed quantum computing Compilers

来源：评论

学校读者我要写书评

暂无评论

Asymmetric secure multi-party quantum computation with weak clients against dishonest majority

引用

quantum SCIENCE AND TECHNOLOGY 2025年第2期10卷 025015-025015页

作者： Kapourniotis, Theodoros Kashefi, Elham Leichtle, Dominik Music, Luka Ollivier, Harold Univ Warwick Dept Phys Coventry CV4 7AL England Sorbonne Univ Lab Informat CNRS F-75005 Paris France Univ Edinburgh Sch Informat Edinburgh EH8 9AB Scotland Quandela F-91300 Massy France PSL Univ Ecole Normale Super DI ENS CNRSINRIA F-75005 Paris France

Secure multi-party computation (SMPC) protocols allow several parties distrusting each other to collectively compute a function on their inputs, without revealing the input values. In this paper, we introduce a protocol that lifts SMPC to its quantum counterpart-secure multi-party quantum computation (SMPQC) for classical inputs and outputs-in a composable and statistically secure way, even for a single honest party. The soundness error-the maximum cheating probability of malicious parties-is shown to be proportional to the inverse of a polynomial with respect to the number of rounds in the protocol, and can be further decreased to a negligible quantity for bounded-error quantum-polynomial-time computations. Unlike previous SMPQC protocols, our proposal only requires very limited quantum resources from all but one party. In addition, the protocol exhibits some noise robustness that can facilitate small-scale implementations with near-future technologies. The protocol is based on a new technique for quantum verification that requires only the collective remote preparation of quantum states in a single plane of the Bloch sphere. To demonstrate the ability of verifying the computation with such limited clients, we uncover and use a fundamental invariance that is inherent to measurement-based quantum computing.

关键词： quantum verification delegated computation secure multi-party computation distributed quantum computing

来源：评论

学校读者我要写书评

暂无评论

The simulation of distributed quantum algorithms

引用

JOURNAL OF SUPERcomputing 2025年第5期81卷

作者： Muralidharan, Sreraman Wells Fargo New York NY 10013 USA

distributed quantum computing (DQC) provides a way to scale quantum computers using multiple quantum processing units (QPU) connected through quantum communication links. In this paper, we have built a distributed quantum computing simulator and used the simulator to investigate quantum algorithms such as the quantum Fourier transform, quantum phase estimation, quantum amplitude estimation, and generation of probability distribution in DQC. The simulator can be used to easily generate and execute distributed quantum circuits, obtain and benchmark DQC parameters such as the fidelity of the algorithm and the number of entanglement generation steps, and use dynamic circuits in a distributed setting to improve results. We show the applicability of dynamic quantum circuits in DQC, where mid-circuit measurements, local operations, and classical communication are used in place of noisy inter-processor (non-local) quantum gates.

关键词： distributed quantum computing Non-local quantum gates Dynamic quantum circuits quantum communication

来源：评论

学校读者我要写书评

暂无评论

Joint Wire Cutting with Non-Maximally Entangled States

引用

ADVANCED quantum TECHNOLOGIES 2025年第5期8卷

作者： Bechtold, Marvin Barzen, Johanna Leymann, Frank Mandl, Alexander Truger, Felix Univ Stuttgart Inst Architecture Applicat Syst Univ Str 38 D-70569 Stuttgart Germany

distributed quantum computing leverages multiple quantum devices collectively to perform computations exceeding each device's capabilities. A currently studied technique to enable this distributed approach is wire cutting, which decomposes a quantum circuit into smaller subcircuits by cutting connecting wires. These subcircuits can be executed on distributed devices, and their results are then classically combined to reconstruct the original computation's result. However, wire cutting requires additional circuit executions to preserve result accuracy, with their number growing exponentially with each cut. Thus, minimizing this sampling overhead is crucial for reducing execution time. Employing shared non-maximally entangled (NME) states between distributed devices reduces this overhead for single wire cuts, approaching ideal teleportation with maximally entangled states. Extending this approach to jointly cutting multiple wires using NME states remained unexplored. This study addresses this gap by investigating the use of NME states for joint wire cuts, aiming to reduce the sampling overhead further. The three main contributions include (i) determining the minimal sampling overhead for this scenario, (ii) analyzing the overhead when using composite NME states constructed from smaller NME states, and (iii) introducing a wire cutting technique that achieves the optimal sampling overhead with pure NME states, advancing toward wire cutting with arbitrary NME states.

关键词： circuit knitting distributed quantum computing noisy entanglement quantum circuit cutting quantum teleportation

来源：评论

学校读者我要写书评

暂无评论

distributed quantum machine learning via classical communication

引用

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

作者： Hwang, Kiwmann Lim, Hyang-Tag Kim, Yong-Su Park, Daniel K. Kim, Yosep Korea Inst Sci & Technol KIST Ctr Quantum Technol Seoul 02792 South Korea Yonsei Univ Dept Phys Seoul 03722 South Korea Korea Univ Dept Phys Seoul 02841 South Korea Korea Univ Sci & Technol KIST Sch Div Quantum Informat Seoul 02792 South Korea Yonsei Univ Dept Appl Stat Seoul 03722 South Korea Yonsei Univ Dept Stat & Data Sci Seoul 03722 South Korea

quantum machine learning is emerging as a promising application of quantum computing due to its distinct way of encoding and processing data. It is believed that large-scale quantum machine learning demonstrates substantial advantages over classical counterparts, but a reliable scale-up is hindered by the fragile nature of quantum systems. Here we present an experimentally accessible distributed quantum machine learning scheme that integrates quantum processor units via classical communication. As a demonstration, we perform data classification tasks on eight-dimensional synthetic datasets by emulating two four-qubit processors and employing quantum convolutional neural networks. Our results indicate that incorporating classical communication notably improves classification accuracy compared to schemes without communication. Furthermore, at the tested circuit depths, we observe that the accuracy with classical communication is no less than that achieved with quantum communication. Our work provides a practical path to demonstrating large-scale quantum machine learning on intermediate-scale quantum processors by leveraging classical communication that can be implemented through currently available mid-circuit measurements.

关键词： quantum machine learning distributed quantum computing classical communication quantum communication

来源：评论

学校读者我要写书评

暂无评论

quantum data centres: a simulation-based comparative noise analysis

引用

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

作者： Campbell, K. Lawey, A. Razavi, M. Univ Leeds Sch Elect & Elect Engn Leeds LS29JT England

quantum data centres (QDCs) could overcome the scalability challenges of modern quantum computers. Single-processor monolithic quantum computers are affected by increased cross talk and difficulty of implementing gates when the number of qubits is increased. In a QDC, multiple quantum processing units (QPUs) are linked together over short distances, allowing the total number of computational qubits to be increased without increasing the number of qubits on any one processor. In doing so, the error incurred by operations at each QPU can be kept small, however additional noise will be added to the system due to the latency cost and errors incurred during inter-QPU entanglement distribution. We investigate the relative impact of these different types of noise using a classically simulated QDC with two QPUs and compare the robustness to noise of the two main ways of implementing remote gates, cat-comm and TP-comm. We find that considering the quantity of gates or inter-QPU entangled links is often inadequate to predict the output fidelity from a quantum circuit and infer that an improved understanding of error propagation during distributed quantum circuits may represent a significant optimisation opportunity for compilation.

关键词： distributed quantum computing quantum data centre quantum noise

来源：评论

学校读者我要写书评

暂无评论

Near-term distributed quantum computation using mean-field corrections and auxiliary qubits

引用

quantum SCIENCE AND TECHNOLOGY 2024年第3期9卷 035022-035022页

作者： Gomez, Abigail McClain Patti, Taylor L. Anandkumar, Anima Yelin, Susanne F. Harvard Univ Dept Phys Cambridge MA 02138 USA NVIDIA Santa Clara CA 95051 USA CALTECH Dept Comp Math Sci CMS Pasadena CA 91125 USA

distributed quantum computation is often proposed to increase the scalability of quantum hardware, as it reduces cooperative noise and requisite connectivity by sharing quantum information between distant quantum devices. However, such exchange of quantum information itself poses unique engineering challenges, requiring high gate fidelity and costly non-local operations. To mitigate this, we propose near-term distributed quantum computing, focusing on approximate approaches that involve limited information transfer and conservative entanglement production. We first devise an approximate distributed computing scheme for the time evolution of quantum systems split across any combination of classical and quantum devices. Our procedure harnesses mean-field corrections and auxiliary qubits to link two or more devices classically, optimally encoding the auxiliary qubits to both minimize short-time evolution error and extend the approximate scheme's performance to longer evolution times. We then expand the scheme to include limited quantum information transfer through selective qubit shuffling or teleportation, broadening our method's applicability and boosting its performance. Finally, we build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms. To characterize our technique, we introduce a non-linear perturbation theory that discerns the critical role of our mean-field corrections in optimization and may be suitable for analyzing other non-linear quantum techniques. This fragmented pre-training is remarkably successful, reducing algorithmic error by orders of magnitude while requiring fewer iterations.

关键词： distributed quantum computing near-term quantum computing quantum simulation variational quantum algorithms

来源：评论

学校读者我要写书评

暂无评论

Selecting and Developing a quantum Internet Simulator for the Needs of New Audience: Practices and Considerations

引用

IEEE ACCESS 2024年 12卷 170965-170979页

作者： Lai, Yuan-Cheng Lin, Han Chen, Yen-Hung Hsiao, Yu-Ling Chen, Liang-Chun Natl Taiwan Univ Sci & Technol Dept Informat Management Taipei 106335 Taiwan Natl Taipei Univ Nursing & Hlth Sci Dept Informat Management Taipei 112303 Taiwan

The quantum Internet is a revolutionary technology that aims to enhance the capabilities of the Classical Internet and enable new tasks that are not possible through classical communication. However, with numerous proposed designs and applications, selecting an appropriate simulator or constructing a new one can be challenging for the needs of education or training purpose. To address this issue, this research provides guidance on selecting a suitable quantum Internet simulator and identifies essential functionalities for developing a new one. The study assesses 13 opensource simulators and offers advice for selecting a simulator based on the user's needs, including beginners for learning purposes, intermediate users for integration purposes, and advanced users for constructing a new high-performance simulator. Additionally, this study recommends programming skills and libraries, such as utilizing Python/Julia for scenario scripts, GPU toolkits for matrix operations, and C/C++ as an interface for linking various programming languages. This study also provides practical examples, including technical details, of a basic quantum internet simulator that utilizes GPU acceleration. These skills and libraries can help users construct and customize a quantum Internet simulator that fits their specific needs.

关键词： distributed quantum computing quantum internet quantum internet quantum key distribution quantum key distribution simulator simulator simulator

来源：评论

学校读者我要写书评

暂无评论

Low-cost nonlocal Toffoli gate in a linear quantum network topology

引用

MODERN PHYSICS LETTERS B 2025年第1期39卷

作者： Chen, Huijiong Hou, Guangwu Zhu, Changhua Xidian Univ Sch Telecommun Engn 2 South Taibai Rd Xian Shannxi Peoples R China

Although a Toffoli gate can be equivalently implemented using several single-qubit and two-qubit gates, it will consume much resource, two of which are nonlocal controlled-NOT (CNOT) gates acting on two non-adjacent nodes, especially in distributed quantum computation (DQC). We, for the first time, employ an ancillary qubit to construct a nonlocal Toffoli gate for DQC in linear network topology. The ancillary-qubit-based scheme needs fewer qubits, quantum gates, and entanglement states than that based on quantum teleportation scheme and the entanglement swapping scheme. We also analyze the performance of the three proposed schemes under different application scenarios, and present their pros and cons. Our work will help to implement DQC in noisy intermediate-scale quantum (NISQ) era.

关键词： Toffoli NISQ distributed quantum computing quantum networks

来源：评论

学校读者我要写书评

暂无评论

Entanglement Request Scheduling in quantum Datacenter Networks

引用

IEEE NETWORK 2025年第3期39卷 188-195页

作者： Vista, Francesco Diadamo, Stephen Kaur, Eneet Shapourian, Hassan Nejabati, Reza Cisco Res San Jose CA 95134 USA Univ Luxembourg Interdisciplinary Ctr Secur Reliabil & Trust SnT Signal Proc & Commun SIGCOM Res Grp L-1855 Luxembourg City Luxembourg Qoro Quantum D-81737 Munich Germany Zyphra Palo Alto CA 94306 USA

In distributed quantum computing (DQC), reliable entanglement distribution across a network of quantum computers is crucial. During the quantum program compilation process, the timing and locations of required entanglement resources can be determined. Leveraging this information, we use the properties of quantum network hardware-specifically, the entanglement generation and quantum switch operation rates-to optimize quantum job execution schedules. This work presents a system that, given a set of quantum programs, extracts an Entaglement Demand Schedule (EDS) and generates an execution plan, including resource allocation tables and switch control instructions. We outline the system architecture and benchmark its performance using collections of randomized quantum programs, and describe further steps to enhance our system.

关键词： Qubit quantum entanglement quantum computing quantum algorithm Optical switches Computers Timing Hardware Resource management Processor scheduling distributed quantum computing entanglement request scheduling quantum networks entanglement distribution

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：