We consider the problem of building an arbitrary N × N real orthogonal operator using a finite set, S, of elementary quantum optics gates operating on m ≤ N modes - the problem of universality of S on N modes. In particular, we focus on the universality problem of an m-mode beamsplitter. Using methods of control theory and some properties of rotations in three dimensions, we prove that any nontrivial real 2-mode and ‘almost’ any nontrivial real 3-mode beamsplitter is universal on m ≥ 3 modes.
We consider the problem of building an arbitrary N × N real orthogonal operator using a finite set, S, of elementary quantum optics gates operating on m ≤ N modes - the problem of universality of S on N modes. In particular, we focus on the universality problem of an m-mode beamsplitter. Using methods of control theory and some properties of rotations in three dimensions, we prove that any nontrivial real 2-mode and ‘almost’ any nontrivial real 3-mode beamsplitter is universal on m ≥ 3 modes.
In 1994, Reck et al. showed how to realize any linear-optical unitary transformation using a product of beamsplitters and phaseshifters. Here we show that any single beamsplitter that nontrivially mixes two modes, also densely generates the set of m × m unitary transformations (or orthogonal transformations, in the real case) on m ≥ 3 modes. (We prove the same result for any 2-mode real optical gate, and for any 2-mode optical gate combined with a generic phaseshifter.) Experimentally, this means that one does not need tunable beamsplitters or phaseshifters for universality: any nontrivial beamsplitter is universal. Theoretically, it means that one cannot produce “intermediate” models of quantum-optical computation (analogous to the Clifford group for qubits) by restricting the allowed beamsplitters and phaseshifters: there is a dichotomy; one either gets a trivi al set or else a universal set. No similar classification theorem for gates acting on qubits is currently know n. We leave open the problem of classifying optical gates that act on 3 or more modes.
For numerous applications of quantum theory it is desirable to be able to apply arbitrary unitary operations on a given quantum system. However, in particular situations only a subset of unitary operations is easily accessible. This raises the question of what additional unitary gates should be added to a given gate set in order to attain physical universality, i.e., to be able to perform arbitrary unitary transformation on the relevant Hilbert space. In this work, we study this problem for three paradigmatic cases of naturally occurring restricted gate sets: (A) particle-number preserving bosonic linear optics, (B) particle-number preserving fermionic linear optics, and (C) general (not necessarily particle-number preserving) fermionic linear optics. Using tools from group theory and control theory, we classify, in each of these scenarios, what sets of gates are generated, if an additional gate is added to the set of allowed transformations. This allows us to solve the universality problem completely for arbitrary number of particles and for arbitrary dimensions of the single-particle Hilbert space.
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.
The first section of the work investigates light modes as a means of implementing optical qubits and qudits. The modes considered are polarization mode, path mode, transverse spatial mode, frequency mode, temporal bin-mode and temporal mode. Subsequently, mathematical model of linear optical elements like beam splitters (BS) and phase shifters are deduced and their capability of representing any single qubit optical gate is exposed. Finally Knill, Laflamme and Milburn (KLM) method of using linear optical elements to promote nonlinear operations based on nonlinear (nondeterministic) sign-flip gate (NS) is explained, and designs of two qubits conditional sign flip gate (c-z1/16) and CNOT gate, both based on KLM method, are demonstrated. So, universal set of quantum gates based on linear optics is possible.
The computational universality with an elementary gate set {H,CCZ} can be transformed to the strict universality by using a maximally imaginary state ∣+i⟩ and some non-imaginary ancillary qubits. From the viewpoint of operational resource theory, it would be intriguing to elucidate a resource for the universality transformation. In this paper, we consider the exact universality transformation in which arbitrary real orthogonal matrices can be applied and a supplied resource state is used to simulate unitary operations exactly and deterministically. Within this operational model, we explore a necessary and sufficient condition for resource states to realize the universality transformation under free real operations. We show that ∣+i⟩ is a unique resource state up to the free operations. Moreover, we obtain a stronger conclusion. If a given resource state cannot be used for the universality transformation, then realizable quantum gates are restricted to unitary matrices proportional to real orthogonal matrices. Therefore, we can tell that ∣+i⟩ is unique (up to the free operations) not only as a state whose resource measure of imaginarity is maximal, but also as a state which empowers real operations with the ability to apply at least one non-real quantum gate (regardless of the magnitudes of its imaginary parts).