Related Experiment Video
Updated: Mar 14, 2026
05:39
Scalable Quantum Integrated Circuits on Superconducting Two-Dimensional Electron Gas Platform
Published on: August 2, 2019
10.4K
A scalable architecture for quantum computation with molecular nanomagnets
M D Jenkins1, D Zueco, O Roubeau
1Instituto de Ciencia de Materiales de Aragón (ICMA), CSIC and Universidad de Zaragoza, Zaragoza, Spain. fluis@unizar.es.
Dalton Transactions (Cambridge, England : 2003)
|October 7, 2016
Summary
This study proposes a scalable magnetic quantum processor using molecular spins and superconducting circuits. The design enables universal quantum computations, with feasibility dependent on developing long-coherence molecular qubits.
Area of Science:
- Quantum Computing
- Molecular Spintronics
- Quantum Electrodynamics
Background:
- Existing quantum processors face scalability challenges.
- Individual molecular spins offer a promising route for quantum information processing.
- Superconducting circuits provide a robust platform for controlling quantum states.
Purpose of the Study:
- To propose and analyze a novel magnetic quantum processor architecture.
- To demonstrate the feasibility of universal quantum computation using molecular qubits.
- To explore the scalability potential of molecular-based quantum computing.
Main Methods:
- Derivation of a magnetic quantum electrodynamics Hamiltonian.
- Analysis of spin qubit operations and inter-qubit interactions.
- Realistic calculations using existing device and molecular qubit parameters.
Main Results:
- The proposed hybrid device enables arbitrary single-spin operations.
- Tunable interactions between any pair of molecular spin qubits are achievable.
- Universal quantum computation is possible with this architecture.
Conclusions:
- The proposed magnetic quantum processor is feasible with further development of molecular qubits.
- Long coherence times and precise molecular integration are critical for success.
- This architecture holds significant potential for scalable quantum computation.
