Blueprint for all-to-all connected superconducting spin qubits
Abstract: Andreev (or superconducting) spin qubits (ASQs) have recently emerged as a promising qubit platform that combines superconducting circuits with semiconductor spin degrees of freedom. While recent experiments have successfully coupled two ASQs, how to realize a scalable architecture for extending this coupling to multiple distant qubits remains an open question. In this work, we resolve this challenge by introducing an architecture that achieves all-to-all connectivity between multiple remote ASQs. Our approach enables selective connectivity between any qubit pair while maintaining all other qubit pairs uncoupled. Furthermore, we demonstrate the feasibility of efficient readout using circuit quantum electrodynamics techniques and compare different readout configurations. Our architecture shows promise both for gate-based quantum computing and for analog quantum simulation applications by offering higher qubit connectivity than alternative solid-state platforms.
- Google Quantum AI, Phase transition in random circuit sampling, arXiv e-prints , arXiv:2304.11119 (2023a).
- Google Quantum AI, Suppressing quantum errors by scaling a surface code logical qubit, Nature 614, 676 (2023b).
- S. B. Bravyi and A. Y. Kitaev, Quantum codes on a lattice with boundary, arXiv e-prints , quant-ph/9811052 (1998).
- W. Lechner, P. Hauke, and P. Zoller, A quantum annealing architecture with all-to-all connectivity from local interactions, Science Advances 1, e1500838 (2015).
- N. M. Chtchelkatchev and Y. V. Nazarov, Andreev quantum dots for spin manipulation, Phys Rev Lett 90, 10.1103/PhysRevLett.90.226806 (2003).
- C. Padurariu and Y. V. Nazarov, Theoretical proposal for superconducting spin qubits, Phys Rev B 81, 10.1103/PhysRevB.81.144519 (2010).
- S. Park and A. L. Yeyati, Andreev spin qubits in multichannel Rashba nanowires, Phys Rev B 96, 10.1103/physrevb.96.125416 (2017).
- L. Pavešić, R. Aguado, and R. Žitko, Strong-coupling theory of quantum-dot Josephson junctions: Role of a residual quasiparticle, Phys. Rev. B 109, 125131 (2024).
- L. Pavešić and R. Žitko, Generalized transmon Hamiltonian for Andreev spin qubits, arXiv e-prints 10.48550/arXiv.2402.02118 (2024).
- Y. Fauvel, J. S. Meyer, and M. Houzet, Opportunities for the direct manipulation of a phase-driven andreev spin qubit, Phys. Rev. B 109, 184515 (2024).
- V. N. Golovach, M. Borhani, and D. Loss, Electric-dipole-induced spin resonance in quantum dots, Phys Rev B 74, 10.1103/physrevb.74.165319 (2006).
- Note that sizable (compared to ESO,isubscript𝐸SO𝑖E_{{\rm SO},i}italic_E start_POSTSUBSCRIPT roman_SO , italic_i end_POSTSUBSCRIPT) perpendicular Zeeman components might introduce undesired transverse coupling terms between ASQs. See Appendix B.
- Yokogawa, GS610 Source Measure Unit User’s manual (2021), [Online; accessed 27-September-2023].
- F. Barahona, On the computational complexity of ising spin glass models, Journal of Physics A: Mathematical and General 15, 3241 (1982).
- T. Kadowaki and H. Nishimori, Quantum annealing in the transverse ising model, Phys. Rev. E 58, 5355 (1998).
- R. D. Somma, D. Nagaj, and M. Kieferová, Quantum speedup by quantum annealing, Phys. Rev. Lett. 109, 050501 (2012).
- T. Albash and D. A. Lidar, Demonstration of a scaling advantage for a quantum annealer over simulated annealing, Phys. Rev. X 8, 031016 (2018).
- T. V. Stefanski and C. Kraglund Andersen, Flux-pulse-assisted Readout of a Fluxonium Qubit, arXiv e-prints , arXiv:2309.17286 (2023).
- K. N. Nesterov and I. V. Pechenezhskiy, Measurement-induced state transitions in dispersive qubit readout schemes, arXiv e-prints , arXiv:2402.07360 (2024).
- E. Magesan, J. M. Gambetta, and J. Emerson, Scalable and robust randomized benchmarking of quantum processes, Phys. Rev. Lett. 106, 180504 (2011).
- D. Feldstein i Bofill, Magnetic field resilient lumped element superconducting resonators, Master Thesis (2022).
- W. Lawrie, Spin qubits in silicon and germanium, PhD Thesis 10.4233/UUID:9CD36947-5E27-4436-9BBB-D7FC5DAA6047 (2022).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.