Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Journal of Theoretical Physics

A Disguised Switch for Two-Qubit Gates of a Hybrid Quantum Processing Unit

Pei Pei, Yanqing Guo, Feng‐Yang Zhang, Jiasen Jin

Published Jul 15, 2014• 0 citations
Publisher
DOI
10.1007/s10773-014-2257-8

Related papers

Two-qubit logic gate

Noriaki Horiuchi

Nature Photonics•Nov 27, 2015•2 citations

Switchable Interaction in Molecular Double Qubits

Jesús Ferrando–Soria, Samantha A. Magee, Alessandro Chiesa +11 more

Quantum information processing (QIP) could revolutionize how we simulate and understand quantum systems. Any QIP scheme requires both individual units (qubits) that have long phase memories and switchable units that can be placed between the qubits. Here, we describe supramolecular systems where {Cr 7 Ni} rings are used as qubits, linked by redox-switchable {Ru 2 M} oxo-centered triangles (M = Zn, Ni, or Co). The supramolecular assemblies have been structurally characterized and involve two {Cr 7 Ni} rings bound to {Ru 2 M} triangles through iso -nicotinate ligands. Detailed physical studies, including electrochemistry and electron paramagnetic resonance spectroscopy, show that when M = Co, the supramolecular assembly has the physical characteristics needed to implement the √iSWAP gate, which is an important entangling two-qubit gate. Detailed simulations show that the fidelity of this gate is potentially very high and depends on the phase memory time of the {Cr 7 Ni} qubits but not the {Ru 2 Co} switch.

Chem•Nov 1, 2016•79 citations

S-QGPU: Shared quantum gate processing unit for distributed quantum computing

Shengwang Du, Yufei Ding, Chunming Qiao

We propose a distributed quantum computing (DQC) architecture in which individual small-sized quantum computers are connected to a shared quantum gate processing unit (S-QGPU). The S-QGPU comprises a collection of hybrid two-qubit gate modules for remote gate operations. In contrast to conventional DQC systems, where each quantum computer is equipped with dedicated communication qubits, S-QGPU effectively pools the resources (e.g., the communication qubits) together for remote gate operations, and, thus, significantly reduces the cost of not only the local quantum computers but also the overall distributed system. Our preliminary analysis and simulation show that S-QGPU's shared resources for remote gate operations enable efficient resource utilization. When not all computing qubits (also called data qubits) in the system require simultaneous remote gate operations, S-QGPU-based DQC architecture demands fewer communication qubits, further decreasing the overall cost. Alternatively, with the same number of communication qubits, it can support a larger number of simultaneous remote gate operations more efficiently, especially when these operations occur in a burst mode.

arXiv:2309.08736•AVS Quantum Science•Mar 1, 2025•5 citations

Composite two-qubit quantum gates

Svetoslav S. Ivanov, Nikolay V. Vitanov

•Mar 30, 2015•0 citations

Remote Gate Scheduling in Distributed Quantum Computing

Xu Xu, Yu Liu, Yingling Mao +1 more

Quantum computing has the potential to outperform classical computing in solving specific problems. However, the limited qubit capacity of existing Quantum Processing Units (QPUs) poses significant barriers to the practical implementation of quantum computing. Distributed quantum computing (DQC) offers a promising approach to scaling the qubit capacity of quantum systems by interconnecting multiple QPUs and enabling collaborative computation. Nevertheless, DQC necessitates implementing remote quantum gate operations that consume entangled qubit pairs, which poses a significant challenge for DQC. In this work, we formulate and investigate the remote gate scheduling (RGS) problem, considering two approaches for remote gate operations: Telegate and Teledata. We propose a hybrid heuristic algorithm that dynamically schedules quantum gate operations within a circuit, executed on distributed QPUs, while minimizing entanglement consumption. We conducted extensive simulations using real-world quantum circuits and processors to evaluate the proposed approach. The results show that our approach reduces entanglement consumption by up to 90% and 25% compared to the two baselines, Telegate-SA and Teledata-ZS, respectively. Furthermore, the execution time of our approach is significantly shorter than that of the baselines.

IEEE International Conference on Distributed Computing Systems (ICDCS)•Jul 21, 2025•2 citations

One-Step Implementation of Two-Qubit Quantum Logic Gates

Jing Mang Xu, Shou Zhang, 연규황 +1 more

Journal of the Korean Physical Society•Oct 1, 2006•0 citations
Quantum information processing (QIP) could revolutionize how we simulate and understand quantum systems. Any QIP scheme requires both individual units (qubits) that have long phase memories and switchable units that can be placed between the qubits. Here, we describe supramolecular systems where {Cr 7 Ni} rings are used as qubits, linked by redox-switchable {Ru 2 M} oxo-centered triangles (M = Zn, Ni, or Co). The supramolecular assemblies have been structurally characterized and involve two {Cr 7 Ni} rings bound to {Ru 2 M} triangles through iso -nicotinate ligands. Detailed physical studies, including electrochemistry and electron paramagnetic resonance spectroscopy, show that when M = Co, the supramolecular assembly has the physical characteristics needed to implement the √iSWAP gate, which is an important entangling two-qubit gate. Detailed simulations show that the fidelity of this gate is potentially very high and depends on the phase memory time of the {Cr 7 Ni} qubits but not the {Ru 2 Co} switch.
We propose a distributed quantum computing (DQC) architecture in which individual small-sized quantum computers are connected to a shared quantum gate processing unit (S-QGPU). The S-QGPU comprises a collection of hybrid two-qubit gate modules for remote gate operations. In contrast to conventional DQC systems, where each quantum computer is equipped with dedicated communication qubits, S-QGPU effectively pools the resources (e.g., the communication qubits) together for remote gate operations, and, thus, significantly reduces the cost of not only the local quantum computers but also the overall distributed system. Our preliminary analysis and simulation show that S-QGPU's shared resources for remote gate operations enable efficient resource utilization. When not all computing qubits (also called data qubits) in the system require simultaneous remote gate operations, S-QGPU-based DQC architecture demands fewer communication qubits, further decreasing the overall cost. Alternatively, with the same number of communication qubits, it can support a larger number of simultaneous remote gate operations more efficiently, especially when these operations occur in a burst mode.
Quantum computing has the potential to outperform classical computing in solving specific problems. However, the limited qubit capacity of existing Quantum Processing Units (QPUs) poses significant barriers to the practical implementation of quantum computing. Distributed quantum computing (DQC) offers a promising approach to scaling the qubit capacity of quantum systems by interconnecting multiple QPUs and enabling collaborative computation. Nevertheless, DQC necessitates implementing remote quantum gate operations that consume entangled qubit pairs, which poses a significant challenge for DQC. In this work, we formulate and investigate the remote gate scheduling (RGS) problem, considering two approaches for remote gate operations: Telegate and Teledata. We propose a hybrid heuristic algorithm that dynamically schedules quantum gate operations within a circuit, executed on distributed QPUs, while minimizing entanglement consumption. We conducted extensive simulations using real-world quantum circuits and processors to evaluate the proposed approach. The results show that our approach reduces entanglement consumption by up to 90% and 25% compared to the two baselines, Telegate-SA and Teledata-ZS, respectively. Furthermore, the execution time of our approach is significantly shorter than that of the baselines.