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

Zhongguo kexue. Wulixue Lixue Tianwenxue

Quantum networks for implementing effiently a nonlocal N-qubit controlled unitary gate via non-symmetric quantum channels: Designing and optimizing

Libing Chen, Hong LU

Published Jul 21, 2017• 2 citations
Publisher

Abstract

We show how a nonlocal N-qubit controlled unitary gate can be implemented locally and effectively by using non-symmetric quantum channels. We construct respectively two quantum networks for realizing conclusively this nonlocal quantum gate. The first one hires (N–2) symmetric qubit-qubit Bell states and a non-symmetric qubit-qudit Bell state as quantum channels. The basic idea of this scheme is to use (N–2) additional levels of this qudit to “hide” certain computational states of (N–1) nonlocal control states from the conditional dynamics, which results in an effective nonlocal N-qubit controlled unitary gate design. In this scheme, however, either the number of the additional levels or that of 1-qudit gates needs to increase with N. The other one can improve significantly the local implementation of this nonlocal gate if we harness (N–1) non-symmetric qubit-qutrit Bell states as quantum channels. This scheme uses respectively (N–1) qutrits’s additional levels to expose one and only one initial computational state of (N–1) nonlocal control states to the conditional dynamics. In comparison with the first one, the procedure is greatly simplified, and the total gate time is reduced. The fact that the quantum network that does the proposed implementation is built entirely of local single-body and two-body gates, and has only (3N–4) two-body gates is notable.

DOI
10.1360/sspma2016-00541

Related papers

Quantum networks for implementing locally and conclusively a nonlocal qudit Toffoli gate: Designing and optimizing

Hong LU, LiBing CHEN

Local implementation of a nonlocal d-dimensional quantum Toffoli gate is considered. We construct respectively two quantum networks for realizing this nonlocal quantum gate conclusively. The first one is based on Eisert’s insight but follow a different pathway which results in a nonlocal d-dimensional Toffoli gate design. This scheme involves a local d-dimensional three-body interaction, which does not appear naturally in physical system. The other one can improve significantly the local implementation of this nonlocal gate if the target node harnesses a qutrit as a catalyser. In its simplest form this quantum network that does the improved scheme is built entirely of local single-body and two-body elementary gates, and with only 3 two-body elementary gates at the target node. The latter is simpler but conclusive, and more efficient but with less resource, which will make it more feasible with the current experimental technology and more suitable for large-scale quantum network.

Zhongguo kexue. Wulixue Lixue Tianwenxue•Sep 1, 2016•8 citations

Nonlocal multi-target controlled–controlled gate using Greenberger–Horne–Zeilinger channel and qutrit catalysis

Libing Chen, H. Lu

We present a scheme for implementing locally a nonlocal N -target controlled–controlled gate with unit probability of success by harnessing two ( N +1)-qubit Greenberger–Horne–Zeilinger (GHZ) states as quantum channel and N qutrits as catalyser. The quantum network that implements this nonlocal ( N +2)-body gate is built entirely of local single-body and two-body gates, and has only (3 N +2) two-body gates. This result suggests that both the computational depth of quantum network and the quantum resources required to perform this nonlocal gate might be significantly reduced. This scheme can be generalized straightforwardly to implement a nonlocal N -target and M -control qubits gate.

Chinese Physics B•Jun 25, 2015•4 citations

Simplified construction and physical realization of n -qubit controlled phase gates

Shi‐Biao Zheng

We show that with the assistance of a third level of qubits an $n$-qubit phase gate can be constructed from $2n\ensuremath{-}4$ two-qutrit conditional swap gates, a single qutrit-qubit controlled phase gate, and two single-qutrit operations. Unlike previous schemes, our scheme uses the auxiliary level to ``expose'' some state to the qutrit-qubit controlled phase gate, instead of using it to ``hide'' states from the conditional dynamics. Neither the number of the additional levels nor that of single-qutrit operations needs to increase with $n$. We propose a physical implementation of the required elementary gates in cavity QED and show that the total gate time may be greatly reduced compared with that required in previous methods.

Physical Review A•Jul 23, 2012•16 citations

Simplified construction of nnn-qubit controlled phase gates and physical realization

Shi Biao Zheng

We show that with the assistance of a third level of the qubits an n-qubit phase gate can be constructed from $2n-4$ two-qutrit conditional swap gates, a single qutrit-qubit controlled phase gate, and two single-qutrit operations. Unlike previous schemes, our scheme uses the auxiliary level to "expose" some state to the qutrit-qubit controlled phase gate, instead of using it to "hide" states from the conditional dynamics. Neither the number of the additional levels nor that of single-qutrit operations needs to increase with $n$. We propose a physical implementation of the required elementary gates in cavity QED, and show that the total gate time may be greatly reduced as compared with that required in the previous methods.

arXiv:1207.2882•Jul 12, 2012•0 citations

Nonlocal implementation of multi-qubit controlled unitary quantum gates with quantum channel

Engin Şahin, İhsan Yılmaz

Quantum computers are very efficient in terms of speed and security. Decoherence and architectural complexity restrict the control of sensitive quantum information as the number of qubits in a quantum computer increases. Therefore, it is more convenient to make a device with multiple quantum processors with small number of qubits instead of making a device with a large number of qubits quantum processors. The implementation of controlled unitary gates is a problem in such nonlocal systems. The methods in the literature for this problem use entangled qubit pairs, classical communication channels and classical bits. The existing methods perform some unitary operations on the target state for reconstruction after sending information through classical communication channels and applying quantum measurements on control states. In this study, a generalized method for nonlocal implementation of multi-qubit controlled unitary quantum gates with quantum channel is proposed. The proposed method can implement any controlled gate on the control and target qubits that are far from each other in terms of location. The method does not require classical channels and classical bits, any extra unitary operation for reconstruction. The proposed method is both more secure and uses less resources for operations than the other hybrid methods in the literature. Comparisons with existing studies are given in terms of required entangled qubit pairs, classical channels and bits, extra unitary operations for reconstruction the target state, and the advantages of the proposed method are revealed.

Modern Physics Letters A•Nov 10, 2021•0 citations

Efficient High-Dimensional Quantum Circuit Synthesis: From Multi-Controlled Gates to Isometries and Quantum Channels

Gui-Long Jiang

Circuit synthesis of multi-controlled gates is crucial for qudit ($d$-level) quantum computing. This paper presents efficient synthesis schemes that reduce the elementary gate count for multi-controlled single-qudit gates. For synthesizing general $(n-1)$-controlled unitaries on $n$ qudits, we reduce the controlled-increment (CINC) and generalized controlled-$X$ (GCX) gate counts to $O(n^2)$, improving upon existing $O(n^{2+\log_2 d})$ CINC and $O(n^3)$ GCX bounds. For $(n-1)$-controlled special unitaries, this complexity is further reduced to $O(n)$. Furthermore, we present a method for approximately synthesizing multi-controlled unitary gates with a linear complexity in the number of control qudits. By utilizing the proposed circuit, we present qudit-based circuit constructions for isometries and quantum channels from $n$ to $m$ qudits. Moreover, for the first time, we present a circuit synthesis scheme for single-controlled gates using SUM gates and single-qudit gates when $d$ is prime. This enables all CINC-based circuits for various quantum operations to be converted into SUM-gate circuits while preserving the same asymptotic complexity. Finally, we establish a theoretical lower bound on the number of SUM and CINC gates required to synthesize general $n$-qudit unitaries.

quant-pharXiv:2607.08200•Jul 10, 2026•0 citations
We show how a nonlocal N-qubit controlled unitary gate can be implemented locally and effectively by using non-symmetric quantum channels. We construct respectively two quantum networks for realizing conclusively this nonlocal quantum gate. The first one hires (N–2) symmetric qubit-qubit Bell states and a non-symmetric qubit-qudit Bell state as quantum channels. The basic idea of this scheme is to use (N–2) additional levels of this qudit to “hide” certain computational states of (N–1) nonlocal control states from the conditional dynamics, which results in an effective nonlocal N-qubit controlled unitary gate design. In this scheme, however, either the number of the additional levels or that of 1-qudit gates needs to increase with N. The other one can improve significantly the local implementation of this nonlocal gate if we harness (N–1) non-symmetric qubit-qutrit Bell states as quantum channels. This scheme uses respectively (N–1) qutrits’s additional levels to expose one and only one initial computational state of (N–1) nonlocal control states to the conditional dynamics. In comparison with the first one, the procedure is greatly simplified, and the total gate time is reduced. The fact that the quantum network that does the proposed implementation is built entirely of local single-body and two-body gates, and has only (3N–4) two-body gates is notable.
Local implementation of a nonlocal d-dimensional quantum Toffoli gate is considered. We construct respectively two quantum networks for realizing this nonlocal quantum gate conclusively. The first one is based on Eisert’s insight but follow a different pathway which results in a nonlocal d-dimensional Toffoli gate design. This scheme involves a local d-dimensional three-body interaction, which does not appear naturally in physical system. The other one can improve significantly the local implementation of this nonlocal gate if the target node harnesses a qutrit as a catalyser. In its simplest form this quantum network that does the improved scheme is built entirely of local single-body and two-body elementary gates, and with only 3 two-body elementary gates at the target node. The latter is simpler but conclusive, and more efficient but with less resource, which will make it more feasible with the current experimental technology and more suitable for large-scale quantum network.
We present a scheme for implementing locally a nonlocal N -target controlled–controlled gate with unit probability of success by harnessing two ( N +1)-qubit Greenberger–Horne–Zeilinger (GHZ) states as quantum channel and N qutrits as catalyser. The quantum network that implements this nonlocal ( N +2)-body gate is built entirely of local single-body and two-body gates, and has only (3 N +2) two-body gates. This result suggests that both the computational depth of quantum network and the quantum resources required to perform this nonlocal gate might be significantly reduced. This scheme can be generalized straightforwardly to implement a nonlocal N -target and M -control qubits gate.
We show that with the assistance of a third level of qubits an nnn-qubit phase gate can be constructed from $2n\ensuremath{-}4$ two-qutrit conditional swap gates, a single qutrit-qubit controlled phase gate, and two single-qutrit operations. Unlike previous schemes, our scheme uses the auxiliary level to ``expose'' some state to the qutrit-qubit controlled phase gate, instead of using it to ``hide'' states from the conditional dynamics. Neither the number of the additional levels nor that of single-qutrit operations needs to increase with nnn. We propose a physical implementation of the required elementary gates in cavity QED and show that the total gate time may be greatly reduced compared with that required in previous methods.
We show that with the assistance of a third level of the qubits an n-qubit phase gate can be constructed from 2n−42n-42n−4 two-qutrit conditional swap gates, a single qutrit-qubit controlled phase gate, and two single-qutrit operations. Unlike previous schemes, our scheme uses the auxiliary level to "expose" some state to the qutrit-qubit controlled phase gate, instead of using it to "hide" states from the conditional dynamics. Neither the number of the additional levels nor that of single-qutrit operations needs to increase with nnn. We propose a physical implementation of the required elementary gates in cavity QED, and show that the total gate time may be greatly reduced as compared with that required in the previous methods.
Quantum computers are very efficient in terms of speed and security. Decoherence and architectural complexity restrict the control of sensitive quantum information as the number of qubits in a quantum computer increases. Therefore, it is more convenient to make a device with multiple quantum processors with small number of qubits instead of making a device with a large number of qubits quantum processors. The implementation of controlled unitary gates is a problem in such nonlocal systems. The methods in the literature for this problem use entangled qubit pairs, classical communication channels and classical bits. The existing methods perform some unitary operations on the target state for reconstruction after sending information through classical communication channels and applying quantum measurements on control states. In this study, a generalized method for nonlocal implementation of multi-qubit controlled unitary quantum gates with quantum channel is proposed. The proposed method can implement any controlled gate on the control and target qubits that are far from each other in terms of location. The method does not require classical channels and classical bits, any extra unitary operation for reconstruction. The proposed method is both more secure and uses less resources for operations than the other hybrid methods in the literature. Comparisons with existing studies are given in terms of required entangled qubit pairs, classical channels and bits, extra unitary operations for reconstruction the target state, and the advantages of the proposed method are revealed.
Circuit synthesis of multi-controlled gates is crucial for qudit (ddd-level) quantum computing. This paper presents efficient synthesis schemes that reduce the elementary gate count for multi-controlled single-qudit gates. For synthesizing general (n−1)(n-1)(n−1)-controlled unitaries on nnn qudits, we reduce the controlled-increment (CINC) and generalized controlled-XXX (GCX) gate counts to O(n2)O(n^2)O(n2), improving upon existing O(n2+log⁡2d)O(n^{2+\log_2 d})O(n2+log2​d) CINC and O(n3)O(n^3)O(n3) GCX bounds. For (n−1)(n-1)(n−1)-controlled special unitaries, this complexity is further reduced to O(n)O(n)O(n). Furthermore, we present a method for approximately synthesizing multi-controlled unitary gates with a linear complexity in the number of control qudits. By utilizing the proposed circuit, we present qudit-based circuit constructions for isometries and quantum channels from nnn to mmm qudits. Moreover, for the first time, we present a circuit synthesis scheme for single-controlled gates using SUM gates and single-qudit gates when ddd is prime. This enables all CINC-based circuits for various quantum operations to be converted into SUM-gate circuits while preserving the same asymptotic complexity. Finally, we establish a theoretical lower bound on the number of SUM and CINC gates required to synthesize general nnn-qudit unitaries.