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

Demonstrating quantum speed-up in a superconducting two-qubit processor

Andreas Dewes, Romain Lauro, Florian R. Ong, Viven Schmitt, D. Estève, Patrice Bertet, D. Vion, P. Milman

Published Feb 29, 2012• 0 citations
OpenAlex

Related papers

Demonstration of two-qubit algorithms with a superconducting quantum processor

L. DiCarlo, Jerry M. Chow, Jay Gambetta +8 more

arXiv:0903.2030•Nature•Jun 28, 2009•1,190 citations

Quantum speeding-up of computation demonstrated in a superconducting two-qubit processor

Andreas Dewes, Romain Lauro, Florian R. Ong +5 more

We operate a superconducting quantum processor consisting of two tunable transmon qubits coupled by a swapping interaction, and equipped with nondestructive single-shot readout of the two qubits. With this processor, we run the Grover search algorithm among four objects and find that the correct answer is retrieved after a single run with a success probability between $0.52$ and $0.67$, which is significantly larger than the $0.25$ achieved with a classical algorithm. This constitutes a proof of concept for the quantum speed-up of electrical quantum processors.

arXiv:1110.5170•Physical Review B•Apr 5, 2012•38 citations

The Arm Qubit for Faster, Higher Fidelity Readout and Gates

Jeremy B. Kline

Currently, superconducting qubit processors are bottlenecked by errors during two-qubit gates, readout, and idle time. All three error contributions could be reduced if we improved the speed of operations (without introducing additional leakage errors) compared to the qubit lifetime. Readout and two-qubit gates are multimode interactions and therefore are limited by the coupling strength between the modes. In this thesis, we introduce a two-mode superconducting qubit which uses one mode to facilitate strong coupling to other modes of the quantum processor and one mode to store data with high coherence. Simulations show that this architecture could enable order-of-magnitude reductions in error during readout and two-qubit gates.

•Sep 1, 2025•0 citations

Superconducting qubits on the way to a quantum processor

Frank K. Wilhelm

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

Scalable quantum eraser with superconducting integrated circuits

Ciro Micheletti Diniz, Celso J. Villas-Bôas, Alan Costa Santos

Abstract A fast and scalable scheme for multi-qubit resetting in superconducting quantum processors is proposed by exploiting the feasibility of frequency-tunable transmon qubits and transmon-like couplers to engineer a full programmable superconducting erasing head. We demonstrate the emergence of collective effects that lead to a decoherence-free subspace during the erasing process. The presence of such a subspace negatively impacts the device’s performance and has been overlooked in other multi-qubit chips. To circumvent this issue and pave the way to the device’s scalability, we employ tunable frequency couplers to identify a specific set of parameters that enables us to erase even those states within this subspace, ensuring the simultaneous multi-qubit resetting, verified here for the two-qubit case. In contrast, we show that collectivity effects can also emerge as an ingredient to speed up the erasing process. To end, we offer a proposal to build up integrated superconducting processors that can be efficiently connected to erasure heads in a scalable way.

arXiv:2409.16893•Quantum Science and Technology•Mar 7, 2025•2 citations

Energy Inference of Black-Box Quantum Computers Using Quantum Speed Limit

Nobumasa Ishida, Yoshihiko Hasegawa

Cloud-based quantum computers do not provide users with access to hardware-level information such as the underlying Hamiltonians, which obstructs the characterization of their physical properties. We propose a method to infer the energy scales of gate Hamiltonians in such black-box quantum processors using only user-accessible data, by exploiting quantum speed limits. Specifically, we reinterpret the Margolus-Levitin and Mandelstam-Tamm bounds as estimators of the energy expectation value and variance, respectively, and relate them to the shortest time for the processor to orthogonalize a quantum state. This shortest gate time, expected to lie on the nanosecond scale, is inferred from job execution times measured in seconds by employing gate-time amplification. We apply the method to IBM's superconducting quantum processor and estimate the energy scales associated with single-, two-, and three-qubit gates. The order of estimated energy is consistent with typical drive energies in superconducting qubit systems, suggesting that current gate operations approach the quantum speed limit. Our results demonstrate that fundamental energetic properties of black-box quantum computers can be quantitatively accessed through operational time measurements, reflecting the conjugate relationship between time and energy imposed by the uncertainty principle.

quant-pharXiv:2512.15472•Dec 18, 2025•2 citations
We operate a superconducting quantum processor consisting of two tunable transmon qubits coupled by a swapping interaction, and equipped with nondestructive single-shot readout of the two qubits. With this processor, we run the Grover search algorithm among four objects and find that the correct answer is retrieved after a single run with a success probability between 0.520.520.52 and 0.670.670.67, which is significantly larger than the 0.250.250.25 achieved with a classical algorithm. This constitutes a proof of concept for the quantum speed-up of electrical quantum processors.
Currently, superconducting qubit processors are bottlenecked by errors during two-qubit gates, readout, and idle time. All three error contributions could be reduced if we improved the speed of operations (without introducing additional leakage errors) compared to the qubit lifetime. Readout and two-qubit gates are multimode interactions and therefore are limited by the coupling strength between the modes. In this thesis, we introduce a two-mode superconducting qubit which uses one mode to facilitate strong coupling to other modes of the quantum processor and one mode to store data with high coherence. Simulations show that this architecture could enable order-of-magnitude reductions in error during readout and two-qubit gates.
Abstract A fast and scalable scheme for multi-qubit resetting in superconducting quantum processors is proposed by exploiting the feasibility of frequency-tunable transmon qubits and transmon-like couplers to engineer a full programmable superconducting erasing head. We demonstrate the emergence of collective effects that lead to a decoherence-free subspace during the erasing process. The presence of such a subspace negatively impacts the device’s performance and has been overlooked in other multi-qubit chips. To circumvent this issue and pave the way to the device’s scalability, we employ tunable frequency couplers to identify a specific set of parameters that enables us to erase even those states within this subspace, ensuring the simultaneous multi-qubit resetting, verified here for the two-qubit case. In contrast, we show that collectivity effects can also emerge as an ingredient to speed up the erasing process. To end, we offer a proposal to build up integrated superconducting processors that can be efficiently connected to erasure heads in a scalable way.
Cloud-based quantum computers do not provide users with access to hardware-level information such as the underlying Hamiltonians, which obstructs the characterization of their physical properties. We propose a method to infer the energy scales of gate Hamiltonians in such black-box quantum processors using only user-accessible data, by exploiting quantum speed limits. Specifically, we reinterpret the Margolus-Levitin and Mandelstam-Tamm bounds as estimators of the energy expectation value and variance, respectively, and relate them to the shortest time for the processor to orthogonalize a quantum state. This shortest gate time, expected to lie on the nanosecond scale, is inferred from job execution times measured in seconds by employing gate-time amplification. We apply the method to IBM's superconducting quantum processor and estimate the energy scales associated with single-, two-, and three-qubit gates. The order of estimated energy is consistent with typical drive energies in superconducting qubit systems, suggesting that current gate operations approach the quantum speed limit. Our results demonstrate that fundamental energetic properties of black-box quantum computers can be quantitatively accessed through operational time measurements, reflecting the conjugate relationship between time and energy imposed by the uncertainty principle.