The path toward practical superconducting quantum processors requires the integration of a large number of high-performance qubits. Modular architectures could offer a way to addressthe scaling limitations of monolithic designs by partitioning a large quantum processor into physically separated modules, or chiplets, linked through long-range interconnects. In this context, although fluxonium qubits have emerged as a compelling platform for quantum computing due to their long coherence times and high-fidelity gates, existing coupling schemes remain restricted to qubits in close proximity on a single chip. This limitation inherently precludes the long-range interconnects essential for modular integration. In this work, we propose a long-range tunable coupler designed to interconnect fluxonium qubits separated by more than one centimeter, thereby supporting the realization of modular fluxonium quantum processors. Under realistic assumptions, the proposed coupler has the potential to achieve inter-module two-qubit gate performance, specifically sub-100-ns gates with intrinsic errors below 10−4, comparable to that of intra-module (intra-chiplet) gates, while enabling modular integration with low quantum crosstalk, a key requirement for scalable systems. We further discuss the integration of this coupler into modular fluxonium lattices and explore its feasibility for achieving the higher connectivity and longer coupling range required for complex quantum error correction codes. This work could contribute to the development of large-scale fluxonium quantum processors by bridging their demonstrated potential with modular scalability.
The design of coupler-based superconducting two-qubit gates simplifies circuit layout and alleviate frequency crowding, thereby enhancing the scalability and flexibility of quantumchips. However, in such architectures, a trade-off often exists between suppressing crosstalk and reducing gate duration, and how to achieve synergistic optimization of both remains an open challenge. To address this, this paper proposes a coupler-assisted superconducting two-qubit geometric gate scheme oriented towards crosstalk robustness. By introducing additional parametric degrees of freedom, the scheme steers the system evolution along desired trajectories, thereby flexibly avoiding crosstalk-sensitive operational regions. Numerical simulations demonstrate that the proposed scheme can effectively suppress crosstalk errors while enabling fast gate operations, and exhibits strong robustness against typical experimental imperfections such as qubit frequency drift. Moreover, even when accounting for unavoidable high-frequency oscillation terms and qubit decoherence in realistic physical systems, our crosstalk-robust two-qubit geometric gates still achieve high fidelity. This work provides a feasible pathway toward robust and efficient two-qubit gate implementation in superconducting quantum computation.
Decoherence is an inevitable problem when targeting to increase the fidelity of quantum gates, and thus is one of the main obstacles for large-scale quantum computation. The longera gate operation is, the more decoherence-induced gate infidelity will be. Therefore, how to shorten the gate time becomes an urgent problem to be solved. To this end, time-optimal control based on solving the quantum brachistochron equation is a straightforward solution. Here, based on time-optimal control, we propose a scheme to realize universal quantum gates on superconducting qubits, in a two-dimensional square lattice configuration, and the two-qubit gate fidelity can be higher than 99.7%. Meanwhile, we can further accelerate the z-axis gate considerably by adjusting the time-independent detuning. Finally, in order to reduce the influence of the dephasing error, decoherence free subspace is also incorporated in our physical implementation. Therefore, we present a promising fast scheme for large-scale quantum computation.
Quantum computation attaches importance to high-precision quantum manipulation, where the quantum state transfer with high fidelity is necessary. Here, we propose a new scheme to implementthe quantum state transfer of high fidelity and long distance, by adding on-site potential into the qubit chain and enlarging the proportion of the coupling strength between the two ends and the chain. In the numerical simulation, without decoherence, the transfer fidelities of 9 and 11 qubit chain are 0.999 and 0.997, respectively. Moreover, we give a detailed physical realization scheme of the quantum state transfer in superconducting circuits, and discuss the tolerance of our proposal against decoherence. Therefore, our scheme will shed light on quantum computation with long chain and high-fidelity quantum state transfer.
Quantum gates based on geometric phases possess intrinsic noise-resilience features and therefore attract much attention. However, the implementations of previous geometric quantumcomputation typically require a long pulse time of gates. As a result, their experimental control inevitably suffers from the cumulative disturbances of systematic errors due to excessive time consumption. Here, we experimentally implement a set of noncyclic and nonadiabatic geometric quantum gates in a superconducting circuit, which greatly shortens the gate time. And also, we experimentally verify that our universal single-qubit geometric gates are more robust to both the Rabi frequency error and qubit frequency shift-induced error, compared to the conventional dynamical gates, by using the randomized benchmarking method. Moreover, this scheme can be utilized to construct two-qubit geometric operations, while the generation of the maximally entangled Bell states is demonstrated. Therefore, our results provide a promising routine to achieve fast, high-fidelity, and error-resilient quantum gates in superconducting quantum circuits.
Recently, nonadiabatic geometric quantum computation has been received much attention, due to its fast manipulation and intrinsic error-resilience characteristics. However, to obtainuniversal geometric quantum control, only limited and special evolution paths have been proposed, which usually requires longer gate-time and more operational steps, and thus leads to lower quality of the implemented quantum gates. Here, we present an effective scheme to find the shortest geometric path under the conventional conditions of geometric quantum computation, where high-fidelity and robust geometric gates can be realized by only single-loop evolution, and the gate performances are better than the corresponding dynamical ones. Furthermore, we can optimize the pulse shapes in our scheme to further shorten the gate-time, determined by how fast the path is travelled. In addition, we also present its physical implementation on superconducting circuits, consisting of capacitively coupled transmon qubits, where the fidelities of geometric single- and two-qubit gates can be higher than 99.95% and 99.80% within the current state-of-the-art experimental technologies, respectively. These results indicate that our scheme is promising for large-scale fault-tolerant quantum computation.
Quantum computation based on nonadiabatic geometric phases has attracted a broad range of interests, due to its fast manipulation and inherent noise resistance. However, to obtain universalgeometric quantum gates, the required evolution paths are usually limited to some special ones, and the evolution times of which are still longer than dynamical quantum gates, resulting in weakening of robustness and more infidelity of the implemented geometric gates. Here, we propose a path-optimized scheme for geometric quantum computation on superconducting transmon qubits, where high-fidelity and robust universal nonadiabatic geometric gates can be implemented, based on conventional experimental setups. Specifically, we find that, by selecting appropriate evolution paths, the constructed geometric gates can be superior to their corresponding dynamical ones under different local errors. Through our numerical simulations, we obtain the fidelities for single-qubit geometric Phase, π/8 and Hadamard gates as 99.93%, 99.95% and 99.95%, respectively. Remarkably, the fidelity for two-qubit control-phase gate can be as high as 99.87%. Therefore, our scheme provides a new perspective for geometric quantum computation, making it more promising in the application of large-scale fault-tolerant quantum computation.
Obtaining high-fidelity and robust quantum gates is the key for scalable quantum computation, and one of the promising ways is to implement quantum gates using geometric phases, wherethe influence of local noises can be greatly reduced. To obtain robust quantum gates, we here propose a scheme for quantum manipulation by combining the geometric phase approach with the dynamical correction technique, where the imperfection control induced X-error can be greatly suppressed. Moreover, to be robust against the decoherence effect and the randomized qubit-frequency shift Z-error, our scheme is also proposed based on the polariton qubit, the eigenstates of the light-matter interaction, which is immune to both errors up to the second order, due to its near symmetric energy spectrum. Finally, our scheme is implemented on the superconducting circuits, which also simplifies previous implementations. Since the main errors can be greatly reduced in our proposal, it provides a promising strategy for scalable solid-state fault-tolerant quantum computation.
Geometric phases accompanying adiabatic quantum evolutions can be used to construct robust quantum control for quantum information processing due to their noise-resilient feature. Asignificant development along this line is to construct geometric gates using nonadiabatic quantum evolutions to reduce errors due to decoherence. However, it has been shown that nonadiabatic geometric gates are not necessarily more robust than dynamical ones, in contrast to an intuitive expectation. Here we experimentally investigate this issue for the case of nonadiabatic holonomic quantum computation~(NHQC) and show that conventional NHQC schemes cannot guarantee the expected robustness due to a cross coupling to the states outside the computational space. We implement a new set of constraints for gate construction in order to suppress such cross coupling to achieve an enhanced robustness. Using a superconducting quantum circuit, we demonstrate high-fidelity holonomic gates whose infidelity against quasi-static transverse errors can be suppressed up to the fourth order, instead of the second order in conventional NHQC and dynamical gates. In addition, we explicitly measure the accumulated dynamical phase due to the above mentioned cross coupling and verify that it is indeed much reduced in our NHQC scheme. We further demonstrate a protocol for constructing two-qubit NHQC gates also with an enhanced robustness.
High-fidelity and robust quantum manipulation is the key for scalable quantum computation. Therefore, due to the intrinsic operational robustness, quantum manipulation induced by geometricphases is one of the promising candidates. However, the longer gate time for geometric operations and more physical-implementation difficulties hinder its practical and wide applications. Here, we propose a simplified implementation of universal holonomic quantum gates on superconducting circuits with experimentally demonstrated techniques, which can remove the two main challenges by introducing the time-optimal control into the construction of quantum gates. Remarkably, our scheme is also based on a decoherence-free subspace encoding, with minimal physical qubit resource, which can further immune to error caused by qubit-frequency drift, which is regarded as the main error source for large scale superconducting circuits. Meanwhile, we deliberately design the quantum evolution to eliminate gate error caused by unwanted leakage sources. Therefore, our scheme is more robust than the conventional ones, and thus provides a promising alternative strategy for scalable fault-tolerant quantum computation.