Quick Navigation
Topics
Trapped Ion Quantum Computing
Superconducting Qubits
Quantum Simulation
Overcoming disorder in superconducting globally driven quantum computing
arXiv
Authors: Riccardo Aiudi, Julien Despres, Roberto Menta, Ashkan Abedi, Guido Menichetti, Vittorio Giovannetti, Marco Polini, Francesco Caravelli
Year
2025
Paper ID
17887
Status
Preprint
Abstract Read
~2 min
Abstract Words
152
Citations
N/A
Abstract
We study the impact of static disorder on a globally-controlled superconducting quantum computing architecture based on a quasi-two-dimensional ladder geometry [R. Menta et al., Phys. Rev. Research 7, L012065 (2025)]. Specifically, we examine how fabrication-induced inhomogeneities in qubit resonant frequencies and coupling strengths affect quantum state propagation and the fidelity of fundamental quantum operations. Using numerical simulations, we quantify the degradation in performance due to disorder and identify single-qubit rotations, two-qubit entangling gates, and quantum information transport as particularly susceptible. To address this challenge, we rely on pulse optimization schemes, and, in particular, on the GRAPE (Gradient Ascent Pulse Engineering) algorithm. Our results demonstrate that, even for realistic levels of disorder, optimized pulse sequences can achieve high-fidelity operations, exceeding 99.9% for the three quantum operations, restoring reliable universal quantum logic and robust information flow. These findings highlight pulse optimization as a powerful strategy to enhance the resilience to disorder of solid-state globally-driven quantum computing platforms.
Why This Paper Matters
- This paper contributes to the Quantum Simulation research area in the Quantum Articles archive.
- It adds a 2025 reference point for readers tracking recent quantum research.
- We study the impact of static disorder on a globally-controlled superconducting quantum computing architecture based on a quasi-two-dimensional ladder geometry [R.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.