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:quant-ph/0305013 · Physical Review A

Universal control of quantum subspaces and subsystems

Paolo Zanardi, Seth Lloyd

Published Feb 20, 2004• 28 citations
arXivHTMLPDF

Abstract

We describe a broad dynamical-algebraic framework for analyzing the quantum control properties of a set of naturally available interactions. General conditions under which universal control is achieved over a set of subspaces/subsystems are found in terms of the representation theory of the group ${\mathcal{U}}_{A}$ of allowed quantum evolutions. In some cases universal control can be achieved in all the state-space sectors carrying an irreducible action of ${\mathcal{U}}_{A}.$ All known physical examples of universal control on subspaces/systems are related to the framework developed here. Implications for quantum-information processing are discussed.

DOI
10.1103/physreva.69.022313

Related papers

Universal quantum control in irreducible state-space sectors: Application to bosonic and spin-boson systems

Paolo Giorda, Paolo Zanardi, Seth Lloyd

We analyze the dynamical-algebraic approach to universal quantum control introduced in P. Zanardi and S. Lloyd, e-print quant-ph/0305013. The quantum state space $\mathcal{H}$ encoding information decomposes into irreducible sectors and subsystems associated with the group of available evolutions. If this group coincides with the unitary part of the group algebra $C\mathcal{K}$ of some group $\mathcal{K}$ then universal control is achievable over the K-irreducible components of $\mathcal{H}.$ This general strategy is applied to different kinds of bosonic systems. We first consider massive bosons in a double well and show how to achieve universal control over all finite-dimensional Fock sectors. We then discuss a multimode massless case giving the conditions for generating the whole infinite-dimensional multimode Heisenberg-Weyl enveloping algebra. Finally we show how to use an auxiliary bosonic mode coupled to finite-dimensional systems to generate high-order nonlinearities needed for universal control.

arXiv:quant-ph/0308133•Physical Review A•Dec 24, 2003•25 citations

Encoded Universality in Physical Implementations of a Quantum Computer

Dave Bacon, Julia Kempe, David Peter Divincenzo +2 more

We revisit the question of universality in quantum computing and propose a new paradigm. Instead of forcing a physical system to enact a predetermined set of universal gates (e.g., single-qubit operations and CNOT), we focus on the intrinsic ability of a system to act as a universal quantum computer using only its naturally available interactions. A key element of this approach is the realization that the fungible nature of quantum information allows for universal manipulations using quantum information encoded in a subspace of the full system Hilbert space, as an alternative to using physical qubits directly. Starting with the interactions intrinsic to the physical system, we show how to determine the possible universality resulting from these interactions over an encoded subspace. We outline a general Lie-algebraic framework which can be used to find the encoding for universality and give several examples relevant to solid-state quantum computing.

arXiv:quant-ph/0102140•Feb 27, 2001•38 citations

Universal simulation of Hamiltonians using a finite set of control operations

Paweł Wocjan, Martin Rötteler, Dominik Janzing +1 more

Any quantum system with a non-trivial Hamiltonian is able to simulate any other Hamiltonian evolution provided that a sufficiently large group of unitary control operations is available. We show that there exist finite groups with this property and present a sufficient condition in terms of group characters. We give examples of such groups in dimension 2 and 3. Furthermore, we show that it is possible to simulate an arbitrary bipartite interaction by a given one using such groups acting locally on the subsystems.

arXiv:quant-ph/0109063•Quantum Information and Computation•Feb 1, 2002•53 citations

Subspace controllability of symmetric spin networks

Jiahui Chen, Yehao Zhou, Ji Bian +2 more

Controlling the dynamics of quantum systems has been a long-standing goal of quantum physics. To understand the controllability of a finite-dimensional quantum system is a fundamental problem in quantum control theory, but can be very challenging in many cases. In particular, results on controllability of open-loop coherently controlled closed quantum systems under symmetry constraints have been elusive. In this paper, we study the controllability of spin systems with some specific symmetry where spins are coupled via Ising interaction and manipulated collectively by a global control field. Based on Lie group and Lie algebra techniques, we find the conditions under which the system is universally controllable in its irreducible subspaces. We believe that the results obtained here will contribute to quantum controlling on symmetric quantum systems.

Physical Review A•Sep 3, 2020•8 citations

Universality in quantum computation

Jennifer L. Dodd

A quantum computer is similar to an ordinary computer, except that instead of bits it uses two-level quantum systems (qubits), and the usual logical operations on bits are replaced with noiseless quantum dynamics in the form of unitary gates or Hamiltonian interactions. Many sets of resources that are universal for quantum computation (that is, capable of implementing any quantum computation) have been found, but general conditions for universality are still only partially understood. Improving our understanding of these conditions contributes to two broad goals. On the one hand, understanding what class of physical systems is suitable for quantum computation allows us choose the systems that are most easily controlled or built in the laboratory. On the other hand, identifying the unifying characteristics of such a class provides insight into the fundamental physics responsible for the much greater computational power of quantum computers.        The original results presented in this thesis are a contribution to our understanding of the physical requirements for universal quantum computation. These results lead to the identification of a new, large class of universal dynamics. More specifically, the main problem that is addressed is the following: consider a physical system that is made up of a finite number of qubits that are subject to a natural, fixed interaction described by a two-body Hamiltonian. Suppose we have the ability to control the system only by applying fast one-qubit operations. Under what conditions is this system capable of universal quantum computation? The first original result of the thesis is to prove that universal quantum computation is possible under these conditions given the single extra constraint that the Hamiltonian must entangle, or connect, all of the qubits. In other words, since a two-body Hamiltonian is expressible as a sum of coupling terms each of which acts nontrivially on a pair of qubits, consider the graph whose vertices correspond to qubits and whose edges connect qubits that are coupled by a term in the Hamiltonian. Then this Hamiltonian, together with fast one-qubit unitaries, is universal for quantum computation precisely when the corresponding graph is connected.       This result suggests many potential generalizations, three of which are explored in this thesis. The first generalization is to show that the same result holds for a two-body Hamiltonian that acts on D-dimensional quantum systems (qudits), given fast one-qudit unitaries. A second extension is to the case of a many-body Hamiltonian, that is, a Hamiltonian that has coupling terms that act on more than two qubits. Again, we find that under mild restrictions, such Hamiltonians are universal provided they are connected and that arbitrary one-qubit unitaries are available. We also discover and explore some surprising structure in many-body Hamiltonians that is associated with the parity of the couplings. A third related problem that is addressed is the question of what two-qubit unitaries are universal for quantum computation. This problem was originally solved by J.-L. and R. Brylinski [BB02], who gave a technical proof of the universality of any two-qudit gate that is not the swap gate or a product of one-qudit unitaries, given one-qudit unitaries as a free resource. We develop an elementary and constructive proof for the case of qubits, and prove that our construction is very close to optimal in the number of uses of the two-qubit gate.       Given a qualitative understanding of what dynamical resources are universal for quantum computation, it is natural to consider developing a quantitative measure of the usefulness of quantum dynamics for quantum information processing. This is done in the final chapter of the thesis, in which the beginnings of a quantitative theory of quantum dynamics are developed.

•Jan 1, 2004•7 citations

Irreducibility and regularisation properties of Gaussian quantum Markov semigroups

Franco Fagnola, Federico Girotti

We study regularisation and irreducibility properties of Gaussian quantum Markov semigroups (GQMSs) acting on continuous-variable quantum systems. We first identify a natural notion of regularity for operators in this setting, which allows us to formulate and characterise the smoothing effects of GQMSs in terms of algebraic conditions involving the drift and quantum diffusion matrices. These conditions establish a connection with the controllability theory of quantum linear systems and with the structure of decoherence-free subsystems. We then characterise irreducibility through several equivalent algebraic criteria: one formulated in terms of the drift and quantum diffusion matrices, one in terms of the operators appearing in the generalised GKLS representation of the generator, and a third given by a quantum analogue of Hörmander's condition. A central and somewhat surprising consequence is that, in contrast with the classical case, irreducibility is strictly stronger than conditions ensuring regularisation. Our results provide an algebraic framework for analysing these properties and lay the groundwork for a broader study of reducible Gaussian quantum Markov semigroups and, more generally, more general relevant quantum Markov semigroups on continuous-variable systems.

quant-pharXiv:2609.01547•Sep 2, 2026•2 citations
We describe a broad dynamical-algebraic framework for analyzing the quantum control properties of a set of naturally available interactions. General conditions under which universal control is achieved over a set of subspaces/subsystems are found in terms of the representation theory of the group UA{\mathcal{U}}_{A}UA​ of allowed quantum evolutions. In some cases universal control can be achieved in all the state-space sectors carrying an irreducible action of UA.{\mathcal{U}}_{A}.UA​. All known physical examples of universal control on subspaces/systems are related to the framework developed here. Implications for quantum-information processing are discussed.
We analyze the dynamical-algebraic approach to universal quantum control introduced in P. Zanardi and S. Lloyd, e-print quant-ph/0305013. The quantum state space H\mathcal{H}H encoding information decomposes into irreducible sectors and subsystems associated with the group of available evolutions. If this group coincides with the unitary part of the group algebra CKC\mathcal{K}CK of some group K\mathcal{K}K then universal control is achievable over the K-irreducible components of H.\mathcal{H}.H. This general strategy is applied to different kinds of bosonic systems. We first consider massive bosons in a double well and show how to achieve universal control over all finite-dimensional Fock sectors. We then discuss a multimode massless case giving the conditions for generating the whole infinite-dimensional multimode Heisenberg-Weyl enveloping algebra. Finally we show how to use an auxiliary bosonic mode coupled to finite-dimensional systems to generate high-order nonlinearities needed for universal control.
We revisit the question of universality in quantum computing and propose a new paradigm. Instead of forcing a physical system to enact a predetermined set of universal gates (e.g., single-qubit operations and CNOT), we focus on the intrinsic ability of a system to act as a universal quantum computer using only its naturally available interactions. A key element of this approach is the realization that the fungible nature of quantum information allows for universal manipulations using quantum information encoded in a subspace of the full system Hilbert space, as an alternative to using physical qubits directly. Starting with the interactions intrinsic to the physical system, we show how to determine the possible universality resulting from these interactions over an encoded subspace. We outline a general Lie-algebraic framework which can be used to find the encoding for universality and give several examples relevant to solid-state quantum computing.
Any quantum system with a non-trivial Hamiltonian is able to simulate any other Hamiltonian evolution provided that a sufficiently large group of unitary control operations is available. We show that there exist finite groups with this property and present a sufficient condition in terms of group characters. We give examples of such groups in dimension 2 and 3. Furthermore, we show that it is possible to simulate an arbitrary bipartite interaction by a given one using such groups acting locally on the subsystems.
Controlling the dynamics of quantum systems has been a long-standing goal of quantum physics. To understand the controllability of a finite-dimensional quantum system is a fundamental problem in quantum control theory, but can be very challenging in many cases. In particular, results on controllability of open-loop coherently controlled closed quantum systems under symmetry constraints have been elusive. In this paper, we study the controllability of spin systems with some specific symmetry where spins are coupled via Ising interaction and manipulated collectively by a global control field. Based on Lie group and Lie algebra techniques, we find the conditions under which the system is universally controllable in its irreducible subspaces. We believe that the results obtained here will contribute to quantum controlling on symmetric quantum systems.
A quantum computer is similar to an ordinary computer, except that instead of bits it uses two-level quantum systems (qubits), and the usual logical operations on bits are replaced with noiseless quantum dynamics in the form of unitary gates or Hamiltonian interactions. Many sets of resources that are universal for quantum computation (that is, capable of implementing any quantum computation) have been found, but general conditions for universality are still only partially understood. Improving our understanding of these conditions contributes to two broad goals. On the one hand, understanding what class of physical systems is suitable for quantum computation allows us choose the systems that are most easily controlled or built in the laboratory. On the other hand, identifying the unifying characteristics of such a class provides insight into the fundamental physics responsible for the much greater computational power of quantum computers.        The original results presented in this thesis are a contribution to our understanding of the physical requirements for universal quantum computation. These results lead to the identification of a new, large class of universal dynamics. More specifically, the main problem that is addressed is the following: consider a physical system that is made up of a finite number of qubits that are subject to a natural, fixed interaction described by a two-body Hamiltonian. Suppose we have the ability to control the system only by applying fast one-qubit operations. Under what conditions is this system capable of universal quantum computation? The first original result of the thesis is to prove that universal quantum computation is possible under these conditions given the single extra constraint that the Hamiltonian must entangle, or connect, all of the qubits. In other words, since a two-body Hamiltonian is expressible as a sum of coupling terms each of which acts nontrivially on a pair of qubits, consider the graph whose vertices correspond to qubits and whose edges connect qubits that are coupled by a term in the Hamiltonian. Then this Hamiltonian, together with fast one-qubit unitaries, is universal for quantum computation precisely when the corresponding graph is connected.       This result suggests many potential generalizations, three of which are explored in this thesis. The first generalization is to show that the same result holds for a two-body Hamiltonian that acts on D-dimensional quantum systems (qudits), given fast one-qudit unitaries. A second extension is to the case of a many-body Hamiltonian, that is, a Hamiltonian that has coupling terms that act on more than two qubits. Again, we find that under mild restrictions, such Hamiltonians are universal provided they are connected and that arbitrary one-qubit unitaries are available. We also discover and explore some surprising structure in many-body Hamiltonians that is associated with the parity of the couplings. A third related problem that is addressed is the question of what two-qubit unitaries are universal for quantum computation. This problem was originally solved by J.-L. and R. Brylinski [BB02], who gave a technical proof of the universality of any two-qudit gate that is not the swap gate or a product of one-qudit unitaries, given one-qudit unitaries as a free resource. We develop an elementary and constructive proof for the case of qubits, and prove that our construction is very close to optimal in the number of uses of the two-qubit gate.       Given a qualitative understanding of what dynamical resources are universal for quantum computation, it is natural to consider developing a quantitative measure of the usefulness of quantum dynamics for quantum information processing. This is done in the final chapter of the thesis, in which the beginnings of a quantitative theory of quantum dynamics are developed.
We study regularisation and irreducibility properties of Gaussian quantum Markov semigroups (GQMSs) acting on continuous-variable quantum systems. We first identify a natural notion of regularity for operators in this setting, which allows us to formulate and characterise the smoothing effects of GQMSs in terms of algebraic conditions involving the drift and quantum diffusion matrices. These conditions establish a connection with the controllability theory of quantum linear systems and with the structure of decoherence-free subsystems. We then characterise irreducibility through several equivalent algebraic criteria: one formulated in terms of the drift and quantum diffusion matrices, one in terms of the operators appearing in the generalised GKLS representation of the generator, and a third given by a quantum analogue of Hörmander's condition. A central and somewhat surprising consequence is that, in contrast with the classical case, irreducibility is strictly stronger than conditions ensuring regularisation. Our results provide an algebraic framework for analysing these properties and lay the groundwork for a broader study of reducible Gaussian quantum Markov semigroups and, more generally, more general relevant quantum Markov semigroups on continuous-variable systems.