Scalable Low-overhead Superconducting Non-local Coupler with Exponentially Enhanced Connectivity
read the original abstract
Quantum error correction codes with non-local connections such as quantum low-density parity-check (qLDPC) incur lower overhead and outperform surface codes on large-scale devices. These codes are not applicable on current superconducting devices with nearest-neighbor connections. To rectify the deficiency in connectivity of superconducting circuit system, we experimentally demonstrate a convenient on-chip coupler of centimeters long and propose an extra coupler layer to map the qubit array to a binary-tree connecting graph. This mapping layout reduces the average qubit entangling distance from O(N) to O(logN), demonstrating an exponentially enhanced connectivity with eliminated crosstalk. The entangling gate with the coupler is performed between two fluxonium qubits, reaching a fidelity of 99.37 % while the system static ZZ rate remains as low as 144 Hz without active cancellation or circuit parameter targeting. With the scalable binary tree structure and high-fidelity non-local entanglement, novel quantum algorithms can be implemented on the superconducting qubit system, positioning it as a strong competitor to other physics systems regarding circuit connectivity.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
Placing and routing quantum LDPC codes in multilayer superconducting hardware
HAL heuristic produces explicit layouts for bivariate bicycle, tile, radial, and Tanner qLDPC codes on multilayer superconducting hardware, demonstrating that open-boundary designs reduce hardware demands with only mo...
-
System-Level Design of Scalable Fluxonium Quantum Processors with Double-Transmon Couplers
A system-level design methodology for scalable fluxonium processors with double-transmon couplers that supports high-fidelity gates, fast reset, and dispersive readout through frequency partitioning under realistic co...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.