What is the simplest Hamiltonian which can implement quantum computation without requiring any control operations during the computation process? In a previous paper we have constructed a ten-local finite-range interaction among qubits on a two-dimensional (2D) lattice having this property. Here we show that pair-interactions among qutrits on a 2D lattice are sufficient, too, and can also implement an ergodic computer where the result can be read out from the time average state after some postselection with high success probability. Two of the three qutrit states are given by the two levels of a spin-$1∕2$ particle located at a specific lattice site, the third state is its absence. Usual hopping terms together with an attractive force among adjacent particles induce a coupled quantum walk where the particle spins are subjected to spatially inhomogeneous interactions implementing holonomic quantum computing. The holonomic method ensures that the implemented circuit does not depend on the time needed for the walk. Even though the implementation of the required type of spin-spin interactions is currently unclear, the model shows that quite simple Hamiltonians are powerful enough to allow for universal quantum computing in a closed physical system.
What is the simplest Hamiltonian which can implement quantum computation without requiring any control operations during the computation process? In a previous paper we have constructed a ten-local finite-range interaction among qubits on a two-dimensional (2D) lattice having this property. Here we show that pair-interactions among qutrits on a 2D lattice are sufficient, too, and can also implement an ergodic computer where the result can be read out from the time average state after some postselection with high success probability. Two of the three qutrit states are given by the two levels of a spin-1∕2 particle located at a specific lattice site, the third state is its absence. Usual hopping terms together with an attractive force among adjacent particles induce a coupled quantum walk where the particle spins are subjected to spatially inhomogeneous interactions implementing holonomic quantum computing. The holonomic method ensures that the implemented circuit does not depend on the time needed for the walk. Even though the implementation of the required type of spin-spin interactions is currently unclear, the model shows that quite simple Hamiltonians are powerful enough to allow for universal quantum computing in a closed physical system.
We show how to perform universal Hamiltonian and adiabatic computing using a time-independent Hamiltonian on a 2D grid describing a system of hopping particles which string together and interact to perform the computation. In this construction, the movement of one particle is controlled by the presence or absence of other particles, an effective quantum field effect transistor that allows the construction of controlled-NOT and controlled-rotation gates. The construction translates into a model for universal quantum computation with time-independent two-qubit ZZ and XX + YY interactions on an (almost) planar grid. The effective Hamiltonian is arrived at by a single use of first-order perturbation theory avoiding the use of perturbation gadgets. The dynamics and spectral properties of the effective Hamiltonian can be fully determined as it corresponds to a particular realization of a mapping between a quantum circuit and a Hamiltonian called the space–time circuit-to-Hamiltonian construction. Because of the simple interactions required, and because no higher-order perturbation gadgets are employed, our construction is potentially realizable using superconducting or other solid-state qubits.
We construct a simple translationally invariant, nearest-neighbor Hamiltonian on a chain of ten-dimensional qudits that makes it possible to realize universal quantum computing without any external control during the computational process. We only require the ability to prepare an initial computational basis state that encodes both the quantum circuit and its input. The computational process is then carried out by the autonomous Hamiltonian time evolution. After a time polynomially long in the size of the quantum circuit has passed, the result of the computation is obtained with high probability by measuring a few qudits in the computational basis. This result also implies that there cannot exist efficient classical simulation methods for generic translationally invariant nearest-neighbor Hamiltonians on qudit chains, unless quantum computers can be efficiently simulated by classical computers (or, put in complexity theoretic terms, unless BPP=BQP).
We introduce a scheme for realizing universal quantum computing in a linear nearest neighbor architecture with fixed couplings. We first show how to realize a controlled-NOT gate operation between two adjacent qubits without having to isolate the two qubits from qubits adjacent to them. The gate operation is implemented by applying two consecutive pulses of equal duration, but varying amplitudes, on the target qubit. Since only a single control parameter is required in implementing our scheme, it is very efficient. We next show how our scheme can be used to realize single qubit rotations and two-qubit controlled-unitary operations. As most proposals for solid state implementations of a quantum computer use a one-dimensional line of qubits, the schemes presented here will be extremely useful.
We construct a family of time-independent nearest-neighbor Hamiltonians coupling eight-state systems on a 1D ring that enables universal quantum computation. Hamiltonians in this family can achieve universality either by driving a continuous-time quantum walk or by terminating an adiabatic algorithm. In either case, the universality property can be understood as arising from an efficient simulation of a programmable quantum circuit. Using gadget perturbation theory, one can demonstrate the same kind of universality for related Hamiltonian families acting on qubits in 2D. Our results demonstrate that simulating 1D chains of spin-7/2 particles is BQP-hard, and indeed BQP-complete because the outputs of decision problems can be encoded in the outputs of such simulations.
Since the seminal work by Shor who proposed a quantum algorithm factorizing integers into prime factors, it has become manifest that the laws of quantum mechanics provide resources for computation that overpower classical physics. The computational advantages that quantum physics offers have stimulated a tremendous amount of theoretical and experimental research. In this context, spin systems have played a major role, given that the spin degree of freedom -- with the paradigmatic case of the spin-1/2 of electrons -- represents an obvious candidate for the encoding of an elementary bit of quantum information (qubit). \n \nOn the other hand, however, quantum objects are very fragile entities, being very susceptible to the environment they reside in. This fragility of qubits is one of the main obstacles in the realization of a quantum computer. \n \nIn this thesis, we mainly address the two following questions relevant to quantum computation. \n \ni) How is it possible to realize quantum gates both in a reliable and scalable way? \n \nii) How can we store quantum information in a way that is resilient to the errors caused by the thermal environment? \n \nWe focus on spin systems and demonstrate that long-range spin-spin interactions in the models considered can have beneficial effects. \n \nIn their pioneering work, Loss and DiVincenzo proposed a way to perform quantum computation in a semiconductor-based architecture where the spin state of an electron trapped in a quantum dot is chosen to encode the elementary qubit. In this proposal, the spins are required to lie spatially close to each other, and this might complicate the realization of a scalable architecture. \n \nIn the first part of the thesis we thus propose a scheme that allows the constraint on the positioning of the qubits to be relaxed. This is achieved by introducing a ferromagnetic coupler between the distant qubits, to which it is coupled via a dipolar interaction. Most importantly, our proposal is applicable to any type of spin qubits and in particular to the technologically very relevant silicon-based qubits and NV-centers in diamond to which previous coupling schemes do not apply. \n \nAs additional key element, a quantum computer needs a memory capable of reliably storing quantum information in the presence of thermal fluctuations. \n \nThis brings us to the second part of this thesis, where we consider self-correcting memories, for which the protection against thermal noise is built-in at the hardware level. We propose physical models that exhibit these self-correcting properties, using as a starting point the well known topologically ordered toric code. In particular, we investigate how to induce long-range interactions between the spins of the toric code, since such interactions help increase the memory lifetime. \n \nAs a first step, we study a honeycomb quantum spin model coupled to delocalized cavity modes. We investigate the properties of the low-energy toric code Hamiltonian and show that the coupling to cavity modes prolongs the lifetime of the memory and offers a method to detect the presence of excitations. \nWhile the introduction of extended bosonic modes makes the model non-local, we also propose a purely local model consisting of a toric code embedded in a three-dimensional cubic lattice of hopping bosons; the low-energy sector of a toric code coupled to a three-dimensional Heisenberg ferromagnet in a broken-symmetry state realizes this model. Our analysis leads to an energy penalty for the creation of defects that grows linearly with the size L of the memory and thus to a lifetime increasing exponentially with L. \n \nIn the third part of this thesis, we study spin systems that support anyons, i.e., particles with fractional statistics. Similar to the toric code, such systems are topologically ordered: they are immune to local perturbations and quantum gates are implemented by non-local operations, namely the exchange of anyons, whose outcomes depend only on the topology of the exchange. Here again the fault-tolerance is achieved at the level of the hardware and physical systems supporting non-abelian anyons are thus promising platforms for quantum computation. \n \nWe focus on spin systems that exhibit some of these properties and specifically on variations of the honeycomb quantum spin model. We first investigate the exact solution of the honeycomb model in detail and derive an explicit formula for the projector onto the physical subspace. We use this result to study inhomogeneous open spin ladders, related to the honeycomb model, which can be tuned between topological and non-topological phases. We test the robustness of Majorana end states (MES) which emerge at the boundary between sections in different topological phases. Furthermore, we present a trijunction setup where MES can be braided. This is of interest since MES in these spin ladders potentially follow non-abelian braiding statistics. Finally, we study the ground states of the aforementioned ladders and show that they are free of vortices when the signs of the spin couplings are all positive or negative. To prove this, we use exact reflection-positivity-based methods as well as approximate methods. \n \nIn the last part of the thesis, we provide an extension of the Mermin-Wagner theorem to a system of lattice spins that are spin-coupled to itinerant and interacting charge carriers. We prove that neither (anti-) ferromagnetic nor helical long-range order is possible in one and two dimensions at any finite temperature (in the absence of spin-orbit). The fundamental question whether spontaneous ordering of the lattice spins occurs in these systems is of interest in the context of quantum computation; the polarization of nuclear spins coupled to a two-dimensional electron gas is a possible route towards the reduction of decoherence induced by the fluctuating Overhauser field in gate-defined quantum dots. \n \n
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.