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

Multi-objective simulated annealing-based quantum circuit cutting for distributed quantum computation

PHYSICA SCRIPTA 2024年第11期99卷 115108-115108页

作者： Hou, Guangwu Zhu, Changhua Sun, Yi Xidian Univ Sch Telecommun Engn Xian 710071 Shaanxi Peoples R China Xidian Univ Collaborat Innovat Ctr Quantum Informat Shaanxi Pr Xian 710071 Shaanxi Peoples R China Xian Univ Posts & Telecommun Shaanxi Key Lab Informat Commun Network & Secur Xian 710121 Shaanxi Peoples R China

In the current noisy intermediate-scale quantum (NISQ) era, the number of qubits and the depth of quantum circuits in a quantum computer are limited because of complex operation among increasing number of qubits, low-fidelity quantum gates under noise, and short coherence time of physical qubits. However, with distributed quantum computation (DQC) in which multiple small-scale quantum computers cooperate, large-scale quantum circuits can be implemented. In DQC, it is a key step to decompose large-scale quantum circuits into several small-scale subcircuits equivalently. In this paper, we propose a quantum circuit cutting scheme for the circuits consisting of only single-qubit gates and two-qubit gates. In the scheme, the number of non-local gates and the rounds of subcircuits operation are minimized by using the multi-objective simulated annealing (MOSA) algorithm to cluster the gates and to choose the cutting positions whilst using non-local gates. A reconstruction process is also proposed to calculate the probability distribution of output states of the original circuit. As an example, the 7-qubit circuit of Shor algorithm factoring 15 is used to verify the algorithm. Five cutting schemes are recommended, which can be selected according to practical requirements. Compared with the results of the mixing integer programming (MIP) algorithm, the number of execution rounds is efficiently reduced by slightly increasing the number of nonlocal gates.

关键词： distributed quantum computation circuit cutting nonlocal quantum gate multi-objective simulated annealing

来源：评论

学校读者我要写书评

暂无评论

distributed quantum computation ARCHITECTURE USING SEMICONDUCTOR NANOPHOTONICS

引用

INTERNATIONAL JOURNAL OF quantum INFORMATION 2010年第1-2期8卷 295-323页

作者： Van Meter, Rodney Ladd, Thaddeus D. Fowler, Austin G. Yamamoto, Yoshihisa Keio Univ Fac Environm & Informat Studies Kanagawa 2528520 Japan Stanford Univ Edward L Ginzton Lab Stanford CA 94305 USA Res Org Informat & Syst Natl Inst Informat Chiyoda Ku Tokyo 1018430 Japan Univ Melbourne Ctr Quantum Comp Technol Melbourne Vic 3010 Australia

In a large-scale quantum computer, the cost of communications will dominate the performance and resource requirements, place many severe demands on the technology, and constrain the architecture. Unfortunately, fault-tolerant computers based entirely on photons with probabilistic gates, though equipped with "built-in" communication, have very large resource overheads;likewise, computers with reliable probabilistic gates between photons or quantum memories may lack sufficient communication resources in the presence of realistic optical losses. Here, we consider a compromise architecture, in which semiconductor spin qubits are coupled by bright laser pulses through nanophotonic waveguides and cavities using a combination of frequent probabilistic and sparse determinstic entanglement mechanisms. The large photonic resource requirements incurred by the use of probabilistic gates for quantum communication are mitigated in part by the potential high-speed operation of the semiconductor nanophotonic hardware. The system employs topological cluster-state quantum error correction for achieving fault-tolerance. Our results suggest that such an architecture/technology combination has the potential to scale to a system capable of attacking classically intractable computational problems.

关键词： distributed quantum computation topological fault tolerance quantum multicomputer nanophotonics

来源：评论

学校读者我要写书评

暂无评论

An Evolutionary Approach to Optimizing Teleportation Cost in distributed quantum computation

引用

INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS 2020年第4期59卷 1315-1329页

作者： Houshmand, Mahboobeh Mohammadi, Zahra Zomorodi-Moghadam, Mariam Houshmand, Monireh Islamic Azad Univ Dept Comp Engn Mashhad Branch Mashhad Razavi Khorasan Iran Imam Reza Int Univ Dept Elect Engn Mashhad Razavi Khorasan Iran Ferdowsi Univ Mashhad Dept Comp Engn Mashhad Razavi Khorasan Iran

distributed quantum computing has been well-known for many years as a system composed of a number of small-capacity quantum circuits. Limitations in the capacity of monolithic quantum computing systems can be overcome by using distributed quantum systems which communicate with each other through known communication links. In our previous study, an algorithm with an exponential complexity was proposed to optimize the number of qubit teleportations required for the communications between two partitions of a distributed quantum circuit (DQC). In this work, a genetic algorithm is used to solve the optimization problem in a more efficient way. The results are compared with the previous study and we show that our approach works almost the same with a remarkable speed-up. Moreover, the comparison of the proposed approach based on GA with a random search over the search space verifies the effectiveness of GA.

关键词： Communication cost distributed quantum computation Genetic algorithms (GA) Optimization Teleportation

来源：评论

学校读者我要写书评

暂无评论

Reliability Analysis of Qubit Data Movement for distributed quantum computation

Reliability Analysis of Qubit Data Movement for Distributed ...

引用

12th Euromicro Conference on Digital System Design, Architectures, Methods and Tools

作者： Boncalo, Oana Amaricai, Alcxandru Univ Politeh Timisoara Timisoara Romania

ISBN: (纸本)9780769537825

We evaluate the reliability of the move operation specific to a quantum distributed computer. We vary the noise strength for noisy operations and the fidelity of the initial EPR pair for an EPR distillation protocol. The noise model employed is depolarizing quantum channel. The protocol analyzed is a tradeoff between the serial purification and the tree based purification protocols - a 5 level queue protocol. Our analysis employees simulated fault injection to determine the efficiency and reliability of the purification protocol, and it uses analytical results to estimate the reliability of the operation responsible for data movement. We show that noise affecting the quantum gates acts as a limitation factor for the fidelity of the purified EPR pair independent of the number of purification levels.

关键词： distributed quantum computation simulated fault injection reliability analysis

来源：评论

学校读者我要写书评

暂无评论

distributed quantum Algorithm for the NISQ Era: A Novel Approach to Solving Simon's Problem with Reduced Resources

引用

ADVANCED quantum TECHNOLOGIES 2025年第5期8卷

作者： Zhou, Xu Wang, Yuchen Tao, Wenxuan Zhou, Zhuojun Luo, Le Sun Yat Sen Univ Sch Phys & Astron Zhuhai 519082 Peoples R China QUDOOR Co Ltd Beijing 100089 Peoples R China QUDOOR Co Ltd Hefei 230000 Peoples R China Sun Yat Sen Univ Guangdong Prov Key Lab Quantum Metrol & Sensing Zhuhai 519082 Peoples R China Quantum Sci Ctr Guangdong Hong Kong Macao Greater Shenzhen 518045 Peoples R China

distributed quantum computation has gained significant interest in the noisy intermediate-scale quantum (NISQ) era. This paradigm requires each computing node to possess a reduced number of qubits and quantum gates. In this study, a distributed Simon's Algorithm (DSA) is designed to tackle Simon's problem, which entails the discovery of a hidden string s is an element of {0, 1}n of a promised Boolean function f : {0, 1}n -> {0, 1}m, where f (x) = f (y) if and only if x = y or x circle plus y = s. Specifically, 1) our algorithm is capable of being partitioned into any t nodes, where 2 <= t <= n;2) the number of queries required by the DSA is n - t, while that of the original Simon's algorithm (SA) is n - 1;3) the maximum number of qubits required by our approach at a single node is max ( n0, n1, ... , nt-1 ) + m, which is fewer than the qubits required by both the SA and existing distributed Simon's algorithm. Here, nj denotes the number of computing qubits needed for the j-th node and satisfies & sum;t-1 j=0 nj = n;4) the optimal circuit depth of the DSA is (m + 1) . 2 n t + 2, which is reduced compared to the circuit depth of the SA, (m + 1) . 2n + 2;5) in contrast to currently distributed schemes, the DSA eliminates the need for classical queries;6) how the DSA solves a specific Simon's problem (e.g., s = 1000) is also simulated using MindSpore quantum, a quantum simulation software. The simulation results show that the DSA features a shallower quantum circuit, thereby demonstrating enhanced resistance to circuit noise. This characteristic makes it more feasible for implementation in the NISQ era.

关键词： distributed quantum computation noisy intermediate-scale quantum (nisq) era distributed Simon's algorithm (dsa) mindspore quantum quantum simulation software

来源：评论

学校读者我要写书评

暂无评论

distributed Photonic quantum computations Assisted by Atomic Ensembles

引用

IEEE JOURNAL OF quantum ELECTRONICS 2016年第8期52卷 1-8页

作者： Luo, Ming-Xing Deng, Yun Wang, Xiaojun Southwest Jiaotong Univ Informat Secur & Natl Comp Grid Lab Chengdu 610031 Peoples R China Univ Michigan Dept Phys Ann Arbor MI 48109 USA Sichuan Univ Sci Engn Inst Comp Sci Zigong 64300 Peoples R China Dublin City Univ Sch Elect Engn Dublin 9 Ireland

distributed quantum computation requires that quantum operations may be acted on remote logical qubits. We investigate the possibility of the distributed quantum computation for nonlocal photons assisted by cavity quantum electrodynamics. We first give a compact circuit for the controlled-NOT gate on a remote two-photon system. For the Toffoli gate, we introduce two circuits for a bipartite system with one photonic Einstein-Podolski-Rosen (EPR) entanglement. Two EPR pairs are required for a tripartite system. These Toffoli gates cost a half of entanglements required in the previous teleportation-based quantum computation. These elementary gates may be combined flexibly up to special decompositions of joint system in large-scale quantum applications.

关键词： distributed quantum computation CNOT gate Toffoli gate atomic ensembles cavity quantum electrodynamics

来源：评论

学校读者我要写书评

暂无评论

distributed exact Grover’s algorithm

引用

Frontiers of physics 2023年第5期18卷 255-279页

作者： Xu Zhou Daowen Qiu Le Luo Institute of Quantum Computing and Computer Theory School of Computer Science and EngineeringSun Yat-sen UniversityGuangzhou 510006China The Guangdong Key Laboratory of Information Security Technology Sun Yat-sen UniversityGuangzhou 510006China School of Physics and Astronomy Sun Yat-sen UniversityZhuhai 519082China QUDOOR Co Ltd.Beijing 100089China

distributed quantum computation has gained extensive *** this paper,we consider a search problem that includes only one target item in the unordered *** that,we propose a distributed exact Grover’s algorithm(DEGA),which decomposes the original search problem into■n/2■***,(i)our algorithm is as exact as the modified version of Grover’s algorithm by Long,which means the theoretical probability of finding the objective state is 100%;(ii)the actual depth of our circuit is 8(n mod 2)+9,which is less than the circuit depths of the original and modified Grover’s algorithms,1+8■π/4√2^(n)■and 9+8■π/4√2^(n)-1/2■,*** only depends on the parity of n,and it is not deepened as n increases;(iii)we provide particular situations of the DEGA on Mindquantum(a quantum software)to demonstrate the practicality and validity of our *** our circuit is shallower,it will be more resistant to the depolarization channel noise.

关键词： distributed quantum computation search problem distributed exact Grover’s algorithm(DEGA) Mindquantum the depolarization channel noise

来源：评论

学校读者我要写书评

暂无评论

Protocols for Creating and Distilling Multipartite GHZ States With Bell Pairs

IEEE TRANSACTIONS ON QUANTUM ENGINEERING

引用

IEEE TRANSACTIONS ON quantum ENGINEERING 2020年 1卷 1页

作者： De Bone, Sebastian Ouyang, Runsheng Goodenough, Kenneth Elkouss, David Delft Univ Technol QuTech NL-2628 CJ Delft Netherlands QuSoft Ctr Wiskunde Informat NL-1098 XG Amsterdam Netherlands Tsinghua Univ Dept Phys Beijing 100084 Peoples R China Swiss Fed Inst Technol Dept Informat Technol & Elect Engn CH-8092 Zurich Switzerland

The distribution of high-quality Greenberger-Horne-Zeilinger (GHZ) states is at the heart of many quantum communication tasks, ranging from extending the baseline of telescopes to secret sharing. They also play an important role in error-correction architectures for distributed quantum computation, where Bell pairs can be leveraged to create an entangled network of quantum computers. We investigate the creation and distillation of GHZ states out of nonperfect Bell pairs over quantum networks. In particular, we introduce a heuristic dynamic programming algorithm to optimize over a large class of protocols that create and purify GHZ states. All protocols considered use a common framework based on measurements of nonlocal stabilizer operators of the target state (i.e., the GHZ state), where each nonlocal measurement consumes another (nonperfect) entangled state as a resource. The new protocols outperform previous proposals for scenarios without decoherence and local gate noise. Furthermore, the algorithms can be applied for finding protocols for any number of parties and any number of entangled pairs involved.

关键词： distributed quantum computation entanglement distillation Greenberger-Horne-Zeilinger (GHZ) states

来源：评论

学校读者我要写书评

暂无评论

Efficient multi-party quantum secret-sharing protocol

引用

CHINESE JOURNAL OF PHYSICS 2024年 92卷 664-674页

作者： Xin, Xiangjun He, Fan Qiu, Shujing Li, Chaoyang Li, Fagen Zhengzhou Univ Light Ind Coll Software Engn Zhengzhou 450002 Peoples R China Univ Elect Sci & Technol China Sch Comp Sci & Engn Chengdu 611731 Peoples R China

Context: quantum secret sharing allows one secret dealer to divide his/her secret among different participants. Only when all the participants pool their secret pieces together can the secret be reconstructed. quantum secret-sharing protocol can provide high security for users who need to share some secret information among some partners. It is also a useful tool in many applications such as secure operations of joint sharing of quantum money, sharing ancilla states, and distributed quantum computation. Objective: We propose a novel multi-party quantum secret-sharing protocol (MPQSSP). Methods: In our protocol, the dealer mixes the particle sequence of the Bell states and sends the sequence to the participants. The participants encode their secret pieces into Pauli operators, which are applied to the received particle sequence. After annularly transmitting and operating the particle sequence, the participants return the particle sequence to the dealer, who can share a secret with the partners by measuring the returned sequence with the Bell basis. Results: The proposed MPQSSP has the merits as follows. First, its qubit efficiency can be 100% when the sample bits of the secret and the corresponding sample qubits are ignored (In our protocol when the qubit efficiency is computed, the sample bits and the corresponding Bell states used to check eavesdropping are ignored). Second, it can protect participants' privacy and interests, since the dealer cannot derive the secret piece of any participant although he/she masters the secret. Third, the participants need not perform many quantum operations and measurements to check the eavesdropping, which helps improve the efficiency of the protocol. Fourth, compared with most of the similar MPQSSPs, the quantum resources of the proposed one are relatively easier to prepare. At last, the proposed protocol has the security against various eavesdropping attacks. Conclusion: The merits above show that Our MPQSSP is relatively more p

关键词： Secret-sharing protocol quantum secret-sharing protocol Secret piece distributed quantum computation

来源：评论

学校读者我要写书评

暂无评论

Multiuser Entanglement Distribution in quantum Networks Using Multipath Routing

IEEE TRANSACTIONS ON QUANTUM ENGINEERING

引用

IEEE TRANSACTIONS ON quantum ENGINEERING 2023年第1期4卷 1页

作者： Sutcliffe, Evan Beghelli, Alejandra UCL Elect & Elect Engn Dept Opt Networks Grp London WC1E 7JE England

quantum networks facilitate numerous applications including secure communication and distributed quantum computation by performing entanglement distribution. For some multiuser quantum applications, access to a shared multipartite state is required. We consider the problem of designing protocols for distributing such states, at an increased rate. For this, we propose three protocols that leverage multipath routing to increase the distribution rate for multiuser applications. The protocols are evaluated on quantum networks with noisy intermediate scale quantum (NISQ) constraints, including limited quantum memories and probabilistic entanglement generation. Simulation results show that the developed protocols achieve an exponential increase in the distribution rate of multipartite states compared to single-path routing techniques, with a maximum increase of four orders of magnitude for the cases studied. Furthermore, the relative increase in the distribution rate was also found to improve for larger sets of users. When the protocols were tested in scaled-down real-world topologies, it was found that a topology had a significant effect on the multipartite state distribution rates achieved by the protocols. Finally, we found that the benefits of multipath routing are maximum for short quantum memory decoherence times and intermediate values of entanglement generation probability. Hence, the protocols developed can benefit NISQ quantum network control and design.

关键词： quantum networks distributed quantum computation Greenberger-Horne-Zeilinger (GHZ) states multipartite quantum communication quantum internet quantum networks distributed quantum computation Greenberger-Horne-Zeilinger (GHZ) states multipartite quantum communication quantum internet

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：