arXiv subjects

Gui-Long Jiang

Publications and source records attributed to Gui-Long Jiang.

7 recordsLinked to original sources

arXiv2026

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

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-ph↗

arXiv2026

Quantum circuit optimization for arbitrary high-dimensional bipartite quantum computation

Implementation of high-dimensional (HD) quantum gates shows very promising perspectives for HD quantum computation. A bipartite quantum system with arbitrary dimensions $n$ and $m$ is termed a quNit-quMit. Here we propose a synthesis scheme to construct the quantum circuit for general quNit-quMit gates with controlled increment (CINC) gates and local gates. This shows that CINC gates combined with local gates form a universal gate set for HD quantum computation. An upper bound of $O(n^2)$ CINC gates is achieved for arbitrary quNit-quMit gate implementation in the proposed scheme, which is the best known result. Especially for the controlled quNit-quMit gates, our scheme requires only 2 CINC gates, whereas the previous scheme required $2n$.

quant-ph↗

arXiv2026

Efficient and deterministic high-dimensional controlled-swap gates on hybrid linear optical systems with high fidelity

Implementation of quantum logic gates with linear optical elements plays a prominent role in quantum computing due to the relatively easier manipulation and realization. We present efficient schemes to implement controlled-NOT (CNOT) gate and controlled-swap (Fredkin) gate by solely using linear optics. We encode the control qubits and target qudits in photonic polarization (two-level) and spatial degrees of freedom ($d$-level), respectively. Based on the hybrid encoding, CNOT and Fredkin gates are constructed in a deterministic way without any borrowed ancillary photons or measurement-induced nonlinearities. Remarkably, the number of linear optics required to implement a CNOT gate has been reduced to one polarization beam splitter (PBS), while only $d$ PBSs are necessary to implement a generalized Fredkin gate. The optical depths of all schemes are reduced to one and dimension-independent. Besides, the fidelity of our three-qubit Fredkin gate is higher than 99.7\% under realistic conditions, which is higher than the previous schemes.

quant-ph↗

arXiv2023

Optimal synthesis of general multi-qutrit quantum computation

Quantum circuits of a general quantum gate acting on multiple $d$-level quantum systems play a prominent role in multi-valued quantum computation. We first propose a new recursive Cartan decomposition of semi-simple unitary Lie group $U(3^n)$ (arbitrary $n$-qutrit gate). Note that the decomposition completely decomposes an n-qutrit gate into local and non-local operations. We design an explicit quantum circuit for implementing arbitrary two-qutrit gates, and the cost of our construction is 21 generalized controlled X (GCX) and controlled increment (CINC) gates less than the earlier best result of 26 GGXs. Moreover, we extend the program to the $n$-qutrit system, and the quantum circuit of generic $n$-qutrit gates contained $\frac{41}{96}\cdot3^{2n}-4\cdot3^{n-1}-(\frac{n^2}{2}+\frac{n}{4}-\frac{29}{32})$ GGXs and CINCs is presented. Such asymptotically optimal structure is the best known result so far.

quant-ph↗

arXiv2023

Practically Enhanced Hyperentanglement Concentration for Polarization-spatial Hyperentangled Bell States with Linear Optics and Common Single-photon Detectors

Hyperentanglement, defined as the simultaneous entanglement in several independent degrees of freedom (DOFs) of a quantum system, is a fascinating resource in quantum information processing with its outstanding merits. Here we propose heralded hyperentanglement concentration protocols (hyper-ECPs) to concentrate an unknown partially less polarization-spatial hyperentangled Bell state with available linear optics and common single-photon detectors. By introducing time-delay DOFs, the schemes are highly efficient in that the success of the scheme can be accurately heralded by the detection signatures, and postselection techniques or photon-number-resolving detectors, necessary for previous experiments, are not required. Additionally, our linear optical architectures allow certain states, where concentration fails, to be recyclable, and a trick makes the success probabilities of our schemes higher than those of previous linear optical hyper-ECPs.

quant-ph↗

arXiv2023

Heralded and high-efficient entanglement concentrations based on linear optics assisted by time-delay degree of freedom

Entanglement concentration is a critical technique to prevent degraded fidelity and security in long-distance quantum communication. We propose novel practical entanglement concentration protocols (ECPs) for less-entangled Bell and Greenberger-Horne-Zeilinger states with unknown parameters by solely using simple linear optics. We avoid the need for the post-selection principles or photon-number-resolving detector to identify the parity-check measurement completely by orchestrating auxiliary time degree of freedom, and the success of ECPs is exactly heralded by the detection signatures without destroying the incident qubits. Additionally, the outting incident photons kept are in the maximally entangled or the less-entangled state, and the success probability can be increased by recycling the latter. The heralded and the basic linear optical elements make our practical ECPs are accessible to experimental investigation with current technology.

quant-ph↗

arXiv2022

Synthesis and upper bound of Schmidt rank of the bipartite controlled-unitary gates

Quantum circuit model is the most popular paradigm for implementing complex quantum computation. Based on Cartan decomposition, we show that $2(N-1)$ generalized controlled-$X$ (GCX) gates, $6$ single-qubit rotations about the $y$- and $z$-axes, and $N+5$ single-partite $y$- and $z$-rotation-types which are defined in this paper are sufficient to simulate a controlled-unitary gate $\mathcal{U}_{cu(2\otimes N)}$ with $A$ controlling on $\mathbb{C}^2\otimes \mathbb{C}^N$. In the scenario of the unitary gate $\mathcal{U}_{cd(M\otimes N)}$ with $M\geq3$ that is locally equivalent to a diagonal unitary on $\mathbb{C}^M\otimes \mathbb{C}^N$, $2M(N-1)$ GCX gates and $2M(N-1)+10$ single-partite $y$- and $z$-rotation-types are required to simulate it. The quantum circuit for implementing $\mathcal{U}_{cu(2\otimes N)}$ and $\mathcal{U}_{cd(M\otimes N)}$ are presented. Furthermore, we find $\mathcal{U}_{cu(2\otimes2)}$ with $A$ controlling has Schmidt rank two, and in other cases the diagonalized form of the target unitaries can be expanded in terms of specific simple types of product unitary operators.

quant-ph↗