Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Bulletin of the American Physical Society

Algorithm-specific Performance Analysis of Transmon Qubit Devices

Michael F. O’Keeffe, Morten Kjærgaard, Mollie E. Schwartz, Gabriel Samach, Amy Greene, Chris McNally, Danna Rosenberg, William D. Oliver, Andrew J. Kerman, Kevin Obenland

Published Mar 4, 2020• 0 citations
OpenAlex

Related papers

Possible limits on superconducting quantum computers from spontaneous wave-function collapse models

Michele Vischi, Luca Ferialdi, Andrea Trombettoni +1 more

The continuous spontaneous localization (CSL) model is an alternative formulation of quantum mechanics, which introduces a noise-coupled nonlinearly to the wave function to account for its collapse. We consider CSL effects on quantum computers made of superconducting transmon qubits. As a direct effect CSL reduces quantum superpositions of the computational basis states of the qubits: we show the reduction rate to be negligibly small. However, an indirect effect of CSL, dissipation induced by the noise, also leads transmon qubits to decohere, by generating additional quasiparticles. Since the decoherence rate of transmon qubits depends on the quasiparticle density, by computing their generation rate induced by CSL, we can estimate the corresponding quasiparticle density and thus the limit set by CSL on the performances of transmon quantum computers. We show that CSL could spoil the quantum computation of practical algorithms on large devices. We further explore the possibility of testing CSL effects on superconducting devices.

arXiv:2201.05114•Physical review. B./Physical review. B•Nov 9, 2022•3 citations

Qubit Feedback on a Five-Qubit Transmon Device

Amy Greene, Bharath Kannan, Morten Kjærgaard +8 more

Bulletin of the American Physical Society•Mar 7, 2018•0 citations

Optimization of Transmon Qubit Fabrication

Josephine Chang, Mary Beth Rothwell, George Keefe

Bulletin of the American Physical Society•Mar 18, 2013•0 citations

Scaling Superconducting Quantum Computers with Chiplet Architectures

Kaitlin N. Smith, Gokul Subramanian Ravi, Jonathan M. Baker +1 more

Fixed-frequency transmon quantum computers (QCs) have advanced in coherence times, addressability, and gate fidelities. Unfortunately, these devices are restricted by the number of on-chip qubits, capping processing power and slowing progress toward fault-tolerance. Although emerging transmon devices feature over 100 qubits, building QCs large enough for meaningful demonstrations of quantum advantage requires overcoming many design challenges. For example, today’s transmon qubits suffer from significant variation due to limited precision in fabrication. As a result, barring significant improvements in current fabrication techniques, scaling QCs by building ever larger individual chips with more qubits is hampered by device variation. Severe device variation that degrades QC performance is referred to as a defect. Here, we focus on a specific defect known as a frequency collision. When transmon frequencies collide, their difference falls within a range that limits two-qubit gate fidelity. Frequency collisions occur with greater probability on larger QCs, causing collision-free yields to decline as the number of on-chip qubits increases. As a solution, we propose exploiting the higher yields associated with smaller QCs by integrating quantum chiplets within quantum multi-chip modules (MCMs). Yield, gate performance, and application-based analysis show the feasibility of QC scaling through modularity. Our results demonstrate that chiplet architectures, relative to monolithic designs, benefit from average yield improvements ranging from 9.6 – 92.6 × for ≲5 qubit machines. In addition, our simulations explore the design space of chiplet systems and discover configurations that demonstrate average two-qubit gate infidelity reductions that are at best 0.815 × their monolithic counterpart. Finally, we observe that carefully-selected modular systems achieve fidelity improvements on a range of benchmark circuits.

arXiv:2210.10921•IEEE/ACM International Symposium on Microarchitecture (MICRO)•Oct 1, 2022•69 citations

Scalable parity architecture with a shuttling-based spin qubit processor

Florian Ginzel, Michael Fellner, Christian Ertler +3 more

Motivated by the prospect of a two-dimensional square-lattice geometry for semiconductor spin qubits, we explore the realization of the parity architecture with quantum dots. We present sequences of spin shuttling and quantum gates that implement the parity quantum approximate optimization algorithm (QAOA) on a lattice constructed of identical unit cells, such that the circuit depth is always constant. We further develop a detailed error model for a hardware-specific analysis of the parity architecture, and we estimate the errors during one round of parity QAOA. The model includes a general description of the shuttling errors as a function of the probability distribution function of the valley splitting, which is the main limitation for the performance. We compare our approach to a superconducting transmon qubit chip, and we find that with high-fidelity spin shuttling the performance of the spin qubits is competitive or even exceeds the results of the transmons. Finally, we discuss the possibility of decoding the logical quantum state and of quantum error mitigation. We find that already with near-term spin qubit devices, a sufficiently low physical error probability can be expected to reliably perform parity QAOA with a short depth in a regime where the success probability compares favorably to standard QAOA.

arXiv:2403.09574•Physical review. B./Physical review. B•Aug 5, 2024•11 citations

Systematic Design of Tuned Transmon Qubits

David W. Abraham, Jay Gambetta, Jerry M. Chow +2 more

Bulletin of the American Physical Society•Mar 3, 2014•0 citations
The continuous spontaneous localization (CSL) model is an alternative formulation of quantum mechanics, which introduces a noise-coupled nonlinearly to the wave function to account for its collapse. We consider CSL effects on quantum computers made of superconducting transmon qubits. As a direct effect CSL reduces quantum superpositions of the computational basis states of the qubits: we show the reduction rate to be negligibly small. However, an indirect effect of CSL, dissipation induced by the noise, also leads transmon qubits to decohere, by generating additional quasiparticles. Since the decoherence rate of transmon qubits depends on the quasiparticle density, by computing their generation rate induced by CSL, we can estimate the corresponding quasiparticle density and thus the limit set by CSL on the performances of transmon quantum computers. We show that CSL could spoil the quantum computation of practical algorithms on large devices. We further explore the possibility of testing CSL effects on superconducting devices.
Fixed-frequency transmon quantum computers (QCs) have advanced in coherence times, addressability, and gate fidelities. Unfortunately, these devices are restricted by the number of on-chip qubits, capping processing power and slowing progress toward fault-tolerance. Although emerging transmon devices feature over 100 qubits, building QCs large enough for meaningful demonstrations of quantum advantage requires overcoming many design challenges. For example, today’s transmon qubits suffer from significant variation due to limited precision in fabrication. As a result, barring significant improvements in current fabrication techniques, scaling QCs by building ever larger individual chips with more qubits is hampered by device variation. Severe device variation that degrades QC performance is referred to as a defect. Here, we focus on a specific defect known as a frequency collision. When transmon frequencies collide, their difference falls within a range that limits two-qubit gate fidelity. Frequency collisions occur with greater probability on larger QCs, causing collision-free yields to decline as the number of on-chip qubits increases. As a solution, we propose exploiting the higher yields associated with smaller QCs by integrating quantum chiplets within quantum multi-chip modules (MCMs). Yield, gate performance, and application-based analysis show the feasibility of QC scaling through modularity. Our results demonstrate that chiplet architectures, relative to monolithic designs, benefit from average yield improvements ranging from 9.6 – 92.6 × for ≲5 qubit machines. In addition, our simulations explore the design space of chiplet systems and discover configurations that demonstrate average two-qubit gate infidelity reductions that are at best 0.815 × their monolithic counterpart. Finally, we observe that carefully-selected modular systems achieve fidelity improvements on a range of benchmark circuits.
Motivated by the prospect of a two-dimensional square-lattice geometry for semiconductor spin qubits, we explore the realization of the parity architecture with quantum dots. We present sequences of spin shuttling and quantum gates that implement the parity quantum approximate optimization algorithm (QAOA) on a lattice constructed of identical unit cells, such that the circuit depth is always constant. We further develop a detailed error model for a hardware-specific analysis of the parity architecture, and we estimate the errors during one round of parity QAOA. The model includes a general description of the shuttling errors as a function of the probability distribution function of the valley splitting, which is the main limitation for the performance. We compare our approach to a superconducting transmon qubit chip, and we find that with high-fidelity spin shuttling the performance of the spin qubits is competitive or even exceeds the results of the transmons. Finally, we discuss the possibility of decoding the logical quantum state and of quantum error mitigation. We find that already with near-term spin qubit devices, a sufficiently low physical error probability can be expected to reliably perform parity QAOA with a short depth in a regime where the success probability compares favorably to standard QAOA.