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:2308.00606

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

Fernando Gago-Encinas, Tobias Hartung, Daniel M. Reich, Karl Jansen, Christiane P. Koch

Published Jan 1, 2023• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.3204/pubdb-2023-05476

Related papers

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.

Quantum•Dec 21, 2023•2 citations

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•4 citations

Scalable modular architecture for universal quantum computation

Fernando Gago-Encinas, Christiane P. Koch

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.

arXiv:2507.14691•SciPost Physics•Feb 17, 2026•1 citation

Dimensional Expressivity Analysis of Parametric Quantum Circuits

Lena Funcke, Tobias Hartung, Karl Jansen +2 more

Parametric quantum circuits play a crucial role in the performance of many variational quantum algorithms. To successfully implement such algorithms, one must design efficient quantum circuits that sufficiently approximate the solution space while maintaining a low parameter count and circuit depth. In this paper, we develop a method to analyze the dimensional expressivity of parametric quantum circuits. Our technique allows for identifying superfluous parameters in the circuit layout and for obtaining a maximally expressive ansatz with a minimum number of parameters. Using a hybrid quantum-classical approach, we show how to efficiently implement the expressivity analysis using quantum hardware, and we provide a proof of principle demonstration of this procedure on IBM's quantum hardware. We also discuss the effect of symmetries and demonstrate how to incorporate or remove symmetries from the parametrized ansatz.

•Jan 1, 2021•53 citations

Dimensional Expressivity Analysis of Parametric Quantum Circuits

Lena Funcke, Tobias Hartung, Karl Jansen +2 more

Parametric quantum circuits play a crucial role in the performance of many variational quantum algorithms. To successfully implement such algorithms, one must design efficient quantum circuits that sufficiently approximate the solution space while maintaining a low parameter count and circuit depth. In this paper, develop a method to analyze the dimensional expressivity of parametric quantum circuits. Our technique allows for identifying superfluous parameters in the circuit layout and for obtaining a maximally expressive ansatz with a minimum number of parameters. Using a hybrid quantum-classical approach, we show how to efficiently implement the expressivity analysis using quantum hardware, and we provide a proof of principle demonstration of this procedure on IBM's quantum hardware. We also discuss the effect of symmetries and demonstrate how to incorporate or remove symmetries from the parametrized ansatz.

arXiv:2011.03532•Quantum•Mar 29, 2021•56 citations

Dimensional Expressivity Analysis, best-approximation errors, and automated design of parametric quantum circuits

Tobias Hartung, Lena Funcke, Karl Jansen +3 more

The design of parametric quantum circuits (PQCs) for efficient use in variational quantum simulations (VQS) is subject to two competing factors. On one hand, the set of states that can be generated by the PQC has to be large enough to contain the solution state. Otherwise, one may at best find the best approximation of the solution restricted to the states generated by the chosen PQC. On the other hand, the PQC should contain as few parametric quantum gates as possible to minimize noise from the quantum device. Thus, when designing a PQC one needs to ensure that there are no redundant parameters. The dimensional expressivity analysis discussed in these proceedings is a means of addressing these counteracting effects. Its main objective is to identify independent and redundant parameters in the PQC. Using this information, superfluous parameters can be removed and the dimension of the space of states that are generated by the PQC can be computed. Knowing the dimension of the physical state space then allows us to deduce whether or not the PQC can reach all physical states. Furthermore, the dimensional expressivity analysis can be implemented efficiently using a hybrid quantum-classical algorithm. This implementation has relatively small overhead costs both for the classical and quantum part of the algorithm and could therefore be used in the future for on-the-fly circuit construction. This would allow for optimized circuits to be used in every loop of a VQS rather than the same PQC for the entire VQS. These proceedings review and extend work in [1, 2].

arXiv:2111.11489•International Symposium on Lattice Field Theory (LATTICE)•May 16, 2022•0 citations
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.
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 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.
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.
Parametric quantum circuits play a crucial role in the performance of many variational quantum algorithms. To successfully implement such algorithms, one must design efficient quantum circuits that sufficiently approximate the solution space while maintaining a low parameter count and circuit depth. In this paper, we develop a method to analyze the dimensional expressivity of parametric quantum circuits. Our technique allows for identifying superfluous parameters in the circuit layout and for obtaining a maximally expressive ansatz with a minimum number of parameters. Using a hybrid quantum-classical approach, we show how to efficiently implement the expressivity analysis using quantum hardware, and we provide a proof of principle demonstration of this procedure on IBM's quantum hardware. We also discuss the effect of symmetries and demonstrate how to incorporate or remove symmetries from the parametrized ansatz.
Parametric quantum circuits play a crucial role in the performance of many variational quantum algorithms. To successfully implement such algorithms, one must design efficient quantum circuits that sufficiently approximate the solution space while maintaining a low parameter count and circuit depth. In this paper, develop a method to analyze the dimensional expressivity of parametric quantum circuits. Our technique allows for identifying superfluous parameters in the circuit layout and for obtaining a maximally expressive ansatz with a minimum number of parameters. Using a hybrid quantum-classical approach, we show how to efficiently implement the expressivity analysis using quantum hardware, and we provide a proof of principle demonstration of this procedure on IBM's quantum hardware. We also discuss the effect of symmetries and demonstrate how to incorporate or remove symmetries from the parametrized ansatz.
The design of parametric quantum circuits (PQCs) for efficient use in variational quantum simulations (VQS) is subject to two competing factors. On one hand, the set of states that can be generated by the PQC has to be large enough to contain the solution state. Otherwise, one may at best find the best approximation of the solution restricted to the states generated by the chosen PQC. On the other hand, the PQC should contain as few parametric quantum gates as possible to minimize noise from the quantum device. Thus, when designing a PQC one needs to ensure that there are no redundant parameters. The dimensional expressivity analysis discussed in these proceedings is a means of addressing these counteracting effects. Its main objective is to identify independent and redundant parameters in the PQC. Using this information, superfluous parameters can be removed and the dimension of the space of states that are generated by the PQC can be computed. Knowing the dimension of the physical state space then allows us to deduce whether or not the PQC can reach all physical states. Furthermore, the dimensional expressivity analysis can be implemented efficiently using a hybrid quantum-classical algorithm. This implementation has relatively small overhead costs both for the classical and quantum part of the algorithm and could therefore be used in the future for on-the-fly circuit construction. This would allow for optimized circuits to be used in every loop of a VQS rather than the same PQC for the entire VQS. These proceedings review and extend work in [1, 2].