Implementing Grover Algorithm on Quantum Chip Architecture Optimized with QGHNN for Fidelity and Entanglement Preservation
AI Breakdown
Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.
Abstract
This study introduces a superconducting quantum chip architecture designed to simultaneously preserve entanglement and readout fidelity, addressing one of the key trade-offs in the development of scalable quantum hardware. In conventional quantum circuits, strong qubit qubit coupling enhances entanglement but often leads to undesired crosstalk, dephasing, and reduced measurement fidelity. To mitigate these effects, we propose a hybrid multiqubit configuration consisting of nine transmon qubits organized into interior and exterior groups, interconnected via a flux tunable qubit and a network of distributed resonators. The interior qubits along with tunable qubit form an entanglement core, while the exterior qubits operate in the dispersive regime under large detuning to enable readout. The degree of entanglement can be dynamically tuned by adjusting the coupling between the central tunable qubit and the interior qubits. The total Hamiltonian includes all significant coupling contributions, encompassing effective exchange interactions among interior and exterior qubits, as well as their mediated couplings through interface resonators. By numerically solving the complete Hamiltonian alongside the Lindblad master equation, the system dynamics are characterized, allowing evaluation of both spectroscopic features and separation fidelity. Simulation results demonstrate that the proposed design maintains strong entanglement by creating the avoided-crossing region while sustaining measurement fidelity around 0.995 under realistic noise conditions. These findings confirm that entanglement strength and readout fidelity can be co-optimized within a single, reconfigurable architecture, establishing a viable route toward high-performance and scalable superconducting quantum processors.