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

arXiv:2507.14691 · SciPost Physics

Scalable modular architecture for universal quantum computation

Fernando Gago-Encinas, Christiane P. Koch

Published Feb 17, 2026• 3 citations
arXivHTMLPDF

Abstract

Universal quantum computing requires the ability to perform every unitary operation, i.e., evolution operator controllability. In view of developing resource-efficient quantum processing units (QPUs), it is important to determine how many local controls and qubit-qubit couplings are required for controllability. Unfortunately, assessing the controllability of large qubit arrays is a difficult task, due to the exponential scaling of Hilbert space dimension. Here we show that it is sufficient to connect two qubit arrays that are evolution operator controllable by a single entangling two-qubit gate in order to obtain a composite qubit array that is evolution operator controllable. The proof provides a template to build up modular QPUs from smaller building blocks with reduced numbers of local controls and couplings. We illustrate the approach with two examples, consisting of 10, respectively 127 qubits, inspired by IBM quantum processors.

DOI
10.21468/scipostphys.20.2.046

Related papers

Graph test of controllability in qubit arrays: a systematic way to determine the minimum number of external controls

Fernando Gago-Encinas, M. Leibscher, Christiane P. Koch

Abstract The ability to implement any desired quantum logic gate on a quantum processing unit is equivalent to evolution-operator controllability of the qubits. Conversely, controllability analysis can be used to minimize the resources, i.e. the number of external controls and qubit–qubit couplings, required for universal quantum computing. Standard controllability analysis, consisting in the construction of the dynamical Lie algebra, is, however, impractical already for a comparatively small number of qubits. Here, we show how to leverage an alternative approach, based on a graph representation of the Hamiltonian, to determine controllability of arrays of coupled qubits. We provide a complete computational framework and exemplify it for arrays of five qubits, inspired by the ibmq_quito architecture. We find that the number of controls can be reduced from five to one for complex qubit–qubit couplings and to two for standard qubit–qubit couplings.

arXiv:2212.04828•Quantum Science and Technology•Jun 26, 2023•6 citations

Determining the ability for universal quantum computing: Testing controllability via dimensional expressivity

Fernando Gago-Encinas, Tobias Hartung, Daniel M. Reich +2 more

Operator controllability refers to the ability to implement an arbitrary unitary in SU(N) and is a prerequisite for universal quantum computing. Controllability tests can be used in the design of quantum devices to reduce the number of external controls. Their practical use is hampered, however, by the exponential scaling of their numerical effort with the number of qubits. Here, we devise a hybrid quantum-classical algorithm based on a parametrized quantum circuit. We show that controllability is linked to the number of independent parameters, which can be obtained by dimensional expressivity analysis. We exemplify the application of the algorithm to qubit arrays with nearest-neighbour couplings and local controls. Our work provides a systematic approach to the resource-efficient design of quantum chips.

arXiv:2308.00606•Quantum•Dec 21, 2023•6 citations

Architecture of a scalable universal quantum processor by encoding two qubits on electron and nuclear spins in a trapped ion

Ji Bian, Teng Liu, Min Ding +5 more

Abstract Scalable quantum information processing with limited physical resources is a key challenge in the pursuit of practical quantum advantage. Here, we introduce an approach that encodes two qubits per ion, enabling an n -ion–2 n -qubit quantum processor by harnessing four internal levels of trapped ions. As a proof of principle, we demonstrate a universal 1-ion–2-qubit processor using the valence electron spin and nuclear spin of a single 171 Yb + ion, achieving gate fidelities exceeding 98% for both single- and two-qubit operations via quantum process tomography. Furthermore, we implement Grover’s algorithm with a success rate surpassing 99%, showing the system’s computational capability. Through robust optimal quantum control, we enhance gate robustness against amplitude and frequency fluctuations, critical for large-scale operation. We present scalable architectures leveraging both laser-free and laser-based entangling gates, revealing that intra-atomic electron–nuclear spin interactions can reduce the complexity of inter-atomic operations. By substituting inter-atomic gates with high-fidelity intra-atomic ones, our scheme significantly improves circuit performance. This work establishes a pathway to exponentially expand the Hilbert space of quantum processors, and represents an important advance toward scalable, high-capacity quantum computing.

arXiv:2407.01196•New Journal of Physics•Dec 23, 2025•1 citation

Scalable and robust quantum computing on qubit arrays with fixed coupling

Nguyen H. Le, Max Cykiert, Eran Ginossar

Abstract We propose a scheme for scalable and robust quantum computing on two-dimensional arrays of qubits with fixed longitudinal coupling. This opens the possibility for bypassing the device complexity associated with tunable couplers required in conventional quantum computing hardware. Our approach is based on driving a subarray of qubits such that the total multi-qubit Hamiltonian can be decomposed into a sum of commuting few-qubit blocks, and efficient optimisation of the unitary evolution within each block. The driving pulses are optimised to implement a target gate on the driven qubits, and at the same time identity gates on the neighbouring undriven qubits, cancelling any unwanted evolution due to the constant qubit-qubit interaction. We show that it is possible to realise a universal set of quantum gates with high fidelity on the basis blocks, and by shifting the driving pattern one can realise an arbitrary quantum circuit on the array. Allowing for imperfect Hamiltonian characterisation, we use robust optimal control to obtain fidelities around 99.99% despite 1% uncertainty in the qubit-qubit and drive-qubit couplings, and a detuning uncertainty at 0.1% of the qubit-qubit coupling strength. This robust feature is crucial for scaling up as parameter uncertainty is significant in large devices.

arXiv:2110.07737•npj Quantum Information•Jan 5, 2023•34 citations

Characterizing the Inter-Core Qubit Traffic in Large-Scale Quantum Modular Architectures

Sahar Ben Rached, Isaac Lopez Agudo, Santiago Rodrigo +7 more

Modular quantum processor architectures are envisioned as a promising solution for the scalability of quantum computing systems beyond the Noisy Intermediate Scale Quantum (NISQ) era. Based upon interconnecting tens to hundreds of quantum processors (i.e cores) via quantum coherent and classical links, this approach unravels the pressing limitations of densely qubit-packed monolithic processors, mainly by mitigating the requirements of qubit control and enhancing qubit isolation. Therefore, this new architectural design enables executing large-scale algorithms in a distributed manner. In order to assess the performance and optimize such architectures, it is crucial to analyze the quantum state transfers occurring via inter-core communication networks, referred to as inter-core qubit traffic. This would provide insights to improve the software and hardware stack for multi-core quantum computers. To this aim, we present a characterization of the spatio-temporal inter-core qubit traffic for different large-scale quantum algorithms. The programs are compiled on an all-to-all connected multi-core architecture that supports up to around 1000 qubits. We characterize the qubit traffic based on multiple performance metrics to assess the computational process and the communication overhead. Based on the showcased results, we conclude on the parallelization and scalability of presented algorithms, qualitatively evaluate the resource requirements as we scale circuit sizes, and lay the foundations of application-oriented benchmarking of large-scale multi-core architectures.

arXiv:2310.01921•IEEE Access•Jan 1, 2025•6 citations

Conveyor-belt superconducting quantum computer

Francesco Cioni, Roberto Menta, Riccardo Aiudi +2 more

The processing unit of a solid-state quantum computer consists of an array of coupled qubits, each driven with on-chip microwave lines that route control signals to the qubits in order to perform logical operations. This approach to quantum computing comes with two major problems. On the one hand, it greatly hampers scalability towards fault-tolerant quantum computers, which are estimated to need a number of qubits—and therefore driving lines—on the order of 10 6 . On the other hand, these lines are a source of electromagnetic noise, exacerbating frequency crowding and crosstalk, while also contributing to power dissipation inside the dilution fridge. We here tackle these two challenges by presenting a quantum processing unit (QPU) for a universal quantum computer which is (rather than ) driven. Our QPU relies on a closed loop of superconducting qubits with always-on ZZ interactions which we dub the “conveyor belt.” Notably, this architecture requires only O ( N ) physical qubits to run a computation on N computational qubits, in contrast to previous O ( N 2 ) proposals for global quantum computation. Universality is achieved via the implementation of single-qubit gates and a Toffoli gate. The ability to perform multiqubit operations in a single step could vastly improve the fidelity and execution time of many algorithms.

arXiv:2412.11782•Physical Review A•Jan 9, 2026•10 citations
Universal quantum computing requires the ability to perform every unitary operation, i.e., evolution operator controllability. In view of developing resource-efficient quantum processing units (QPUs), it is important to determine how many local controls and qubit-qubit couplings are required for controllability. Unfortunately, assessing the controllability of large qubit arrays is a difficult task, due to the exponential scaling of Hilbert space dimension. Here we show that it is sufficient to connect two qubit arrays that are evolution operator controllable by a single entangling two-qubit gate in order to obtain a composite qubit array that is evolution operator controllable. The proof provides a template to build up modular QPUs from smaller building blocks with reduced numbers of local controls and couplings. We illustrate the approach with two examples, consisting of 10, respectively 127 qubits, inspired by IBM quantum processors.
Abstract The ability to implement any desired quantum logic gate on a quantum processing unit is equivalent to evolution-operator controllability of the qubits. Conversely, controllability analysis can be used to minimize the resources, i.e. the number of external controls and qubit–qubit couplings, required for universal quantum computing. Standard controllability analysis, consisting in the construction of the dynamical Lie algebra, is, however, impractical already for a comparatively small number of qubits. Here, we show how to leverage an alternative approach, based on a graph representation of the Hamiltonian, to determine controllability of arrays of coupled qubits. We provide a complete computational framework and exemplify it for arrays of five qubits, inspired by the ibmq_quito architecture. We find that the number of controls can be reduced from five to one for complex qubit–qubit couplings and to two for standard qubit–qubit couplings.
Operator controllability refers to the ability to implement an arbitrary unitary in SU(N) and is a prerequisite for universal quantum computing. Controllability tests can be used in the design of quantum devices to reduce the number of external controls. Their practical use is hampered, however, by the exponential scaling of their numerical effort with the number of qubits. Here, we devise a hybrid quantum-classical algorithm based on a parametrized quantum circuit. We show that controllability is linked to the number of independent parameters, which can be obtained by dimensional expressivity analysis. We exemplify the application of the algorithm to qubit arrays with nearest-neighbour couplings and local controls. Our work provides a systematic approach to the resource-efficient design of quantum chips.
Abstract Scalable quantum information processing with limited physical resources is a key challenge in the pursuit of practical quantum advantage. Here, we introduce an approach that encodes two qubits per ion, enabling an n -ion–2 n -qubit quantum processor by harnessing four internal levels of trapped ions. As a proof of principle, we demonstrate a universal 1-ion–2-qubit processor using the valence electron spin and nuclear spin of a single 171 Yb + ion, achieving gate fidelities exceeding 98% for both single- and two-qubit operations via quantum process tomography. Furthermore, we implement Grover’s algorithm with a success rate surpassing 99%, showing the system’s computational capability. Through robust optimal quantum control, we enhance gate robustness against amplitude and frequency fluctuations, critical for large-scale operation. We present scalable architectures leveraging both laser-free and laser-based entangling gates, revealing that intra-atomic electron–nuclear spin interactions can reduce the complexity of inter-atomic operations. By substituting inter-atomic gates with high-fidelity intra-atomic ones, our scheme significantly improves circuit performance. This work establishes a pathway to exponentially expand the Hilbert space of quantum processors, and represents an important advance toward scalable, high-capacity quantum computing.
Abstract We propose a scheme for scalable and robust quantum computing on two-dimensional arrays of qubits with fixed longitudinal coupling. This opens the possibility for bypassing the device complexity associated with tunable couplers required in conventional quantum computing hardware. Our approach is based on driving a subarray of qubits such that the total multi-qubit Hamiltonian can be decomposed into a sum of commuting few-qubit blocks, and efficient optimisation of the unitary evolution within each block. The driving pulses are optimised to implement a target gate on the driven qubits, and at the same time identity gates on the neighbouring undriven qubits, cancelling any unwanted evolution due to the constant qubit-qubit interaction. We show that it is possible to realise a universal set of quantum gates with high fidelity on the basis blocks, and by shifting the driving pattern one can realise an arbitrary quantum circuit on the array. Allowing for imperfect Hamiltonian characterisation, we use robust optimal control to obtain fidelities around 99.99% despite 1% uncertainty in the qubit-qubit and drive-qubit couplings, and a detuning uncertainty at 0.1% of the qubit-qubit coupling strength. This robust feature is crucial for scaling up as parameter uncertainty is significant in large devices.
Modular quantum processor architectures are envisioned as a promising solution for the scalability of quantum computing systems beyond the Noisy Intermediate Scale Quantum (NISQ) era. Based upon interconnecting tens to hundreds of quantum processors (i.e cores) via quantum coherent and classical links, this approach unravels the pressing limitations of densely qubit-packed monolithic processors, mainly by mitigating the requirements of qubit control and enhancing qubit isolation. Therefore, this new architectural design enables executing large-scale algorithms in a distributed manner. In order to assess the performance and optimize such architectures, it is crucial to analyze the quantum state transfers occurring via inter-core communication networks, referred to as inter-core qubit traffic. This would provide insights to improve the software and hardware stack for multi-core quantum computers. To this aim, we present a characterization of the spatio-temporal inter-core qubit traffic for different large-scale quantum algorithms. The programs are compiled on an all-to-all connected multi-core architecture that supports up to around 1000 qubits. We characterize the qubit traffic based on multiple performance metrics to assess the computational process and the communication overhead. Based on the showcased results, we conclude on the parallelization and scalability of presented algorithms, qualitatively evaluate the resource requirements as we scale circuit sizes, and lay the foundations of application-oriented benchmarking of large-scale multi-core architectures.
The processing unit of a solid-state quantum computer consists of an array of coupled qubits, each driven with on-chip microwave lines that route control signals to the qubits in order to perform logical operations. This approach to quantum computing comes with two major problems. On the one hand, it greatly hampers scalability towards fault-tolerant quantum computers, which are estimated to need a number of qubits—and therefore driving lines—on the order of 10 6 . On the other hand, these lines are a source of electromagnetic noise, exacerbating frequency crowding and crosstalk, while also contributing to power dissipation inside the dilution fridge. We here tackle these two challenges by presenting a quantum processing unit (QPU) for a universal quantum computer which is (rather than ) driven. Our QPU relies on a closed loop of superconducting qubits with always-on ZZ interactions which we dub the “conveyor belt.” Notably, this architecture requires only O ( N ) physical qubits to run a computation on N computational qubits, in contrast to previous O ( N 2 ) proposals for global quantum computation. Universality is achieved via the implementation of single-qubit gates and a Toffoli gate. The ability to perform multiqubit operations in a single step could vastly improve the fidelity and execution time of many algorithms.