This thesis contributes to the design and optimization of quantum memories, which are crucial components of many quantum information processing tasks. In the thesis, we introduce a generalization of the Pauli stabilizer formalism, investigate the feasibility of preparing ground states of topological Hamiltonians through adiabatic evolutions, and show that it is possible to use machine learning to optimize dynamical decoupling sequences for quantum memories.
This thesis contributes to the design and optimization of quantum memories, which are crucial components of many quantum information processing tasks. In the thesis, we introduce a generalization of the Pauli stabilizer formalism, investigate the feasibility of preparing ground states of topological Hamiltonians through adiabatic evolutions, and show that it is possible to use machine learning to optimize dynamical decoupling sequences for quantum memories.
This thesis is devoted to the study of coherent storage of quantum information as well as its potential applications. Quantum memories are crucial to harnessing the potential of quantum physics for information processing tasks. They are required for almost all quantum computation proposals. However, despite the large arsenal of theoretical techniques and proposals dedicated to their implementation, the realization of long-lived quantum memories remains an elusive task. Encoding information in quantum states associated to many-body topological phases of matter and protecting them by means of a static Hamiltonian is one of the leading proposals to achieve quantum memories. While many genuine and well publicized virtues have been demonstrated for this approach, equally real limitations were widely disregarded. In the first two projects of this thesis, we study limitations of passive Hamiltonian protection of quantum information under two different noise models. Chapter 2 deals with arbitrary passive Hamiltonian protection for a many body system under the effect of local depolarizing noise. It is shown that for both constant and time dependent Hamiltonians, the optimal enhancement over the natural single-particle memory time is logarithmic in the number of particles composing the system. The main argument involves a monotonic increase of entropy against which a Hamiltonian can provide little protection. Chapter 3 considers the recoverability of quantum information when it is encoded in a many-body state and evolved under a Hamiltonian composed of known geometrically local interactions and a weak yet unknown Hamiltonian perturbation. We obtain some generic criteria which must be fulfilled by the encoding of information. For specific proposals of protecting Hamiltonian and encodings such as Kitaev's toric code and a subsystem code proposed by Bacon, we additionally provide example perturbations capable of destroying the memory which imply upper bounds for the provable memory times. Chapter 4 proposes engineered dissipation as a natural solution for continuously extracting the entropy introduced by noise and keeping the accumulation of errors under control. Persuasive evidence is provided supporting that engineered dissipation is capable of preserving quantum degrees of freedom from all previously considered noise models. Furthermore, it is argued that it provides additional flexibility over Hamiltonian thermalization models and constitutes a promising approach to quantum memories. Chapter 5 introduces a particular experimental realization of coherent storage, shifting the focus in many regards with respect to previous chapters. First of all, the system is very concrete, a room-temperature nitrogen-vacancy centre in diamond, which is subject to actual experimental control and noise restrictions which must be adequately modelled. Second, the relevant degrees of freedom reduce to a single electronic spin and a carbon 13 spin used to store a qubit. Finally, the approach taken to battle decoherence consists of inducing motional narrowing and applying dynamical decoupling pulse sequences, and is tailored to address the systems dominant noise sources. Chapter 6 analyses unforgeable tokens as a potential application of these room-temperature qubit memories. Quantum information protocols based on Wiesner's quantum money scheme are proposed and analysed. We provide the first rigorous proof that such unentangled tokens may be resistant to counterfeiting attempts while tolerating a certain amount of noise. In summary, this thesis provides contributions to quantum memories in four different aspects. Two projects were dedicated to understanding and exposing the limitations of existing proposals. This is followed by a constructive proposal of a new counter-intuitive theoretical model for quantum memories. An applied experimental project achieves record coherent storage times in room-temperature solids. Finally, we provide rigorous analysis for a quantum information application of quantum memories. This completes a broad picture of quantum memories which integrates different perspectives, from theoretical critique and constructive proposal, to technological application going through a down-to-earth experimental implementation.
We utilize machine learning models that are based on recurrent neural networks to optimize dynamical decoupling (DD) sequences. Dynamical decoupling is a relatively simple technique for suppressing the errors in quantum memory for certain noise models. In numerical simulations, we show that with minimum use of prior knowledge and starting from random sequences, the models are able to improve over time and eventually output DD sequences with performance better than that of the well known DD families. Furthermore, our algorithm is easy to implement in experiments to find solutions tailored to the specific hardware, as it treats the figure of merit as a black box.
Quantum computers have the potential to push the limits of computation in areas such as quantum chemistry, cryptography, optimization, and machine learning. Even though many quantum algorithms show asymptotic improvement compared to classical ones, the overhead of running quantum computers limits when quantum computing becomes useful. Thus, by optimizing components of quantum algorithms, we can bring the regime of quantum advantage closer. My work focuses on developing efficient subroutines for quantum computation. I focus specifically on algorithms for scalable, fault-tolerant quantum computers. While it is possible that even noisy quantum computers can outperform classical ones for specific tasks, high-depth and therefore fault-tolerance is likely required for most applications. In this thesis, I introduce three sets of techniques that can be used by themselves or as subroutines in other algorithms. The first components are coherent versions of classical sort and shuffle. We require that a quantum shuffle prepares a uniform superposition over all permutations of a sequence. The quantum sort is used within the shuffle and as well as in the next algorithm in this thesis. The quantum shuffle is an essential part of state preparation for quantum chemistry computation in first quantization. Second, I review the progress of Hamiltonian simulations and give a new algorithm for simulating time-dependent Hamiltonians. This algorithm scales polylogarithmic in the inverse error, and the query complexity does not depend on the derivatives of the Hamiltonian. A time-dependent Hamiltonian simulation was recently used for interaction picture simulation with applications to quantum chemistry. Next, I present a fully quantum Boltzmann machine. I show that our algorithm can train on quantum data and learn a classical description of quantum states. This type of machine learning can be used for tomography, Hamiltonian learning, and approximate quantum cloning.
Quantum mechanical computers can solve certain problems asymptotically faster than any classical computing device. Several fast quantum algorithms are known, but the nature of quantum speedup is not well understood, and inventing new quantum algorithms seems to be difficult. In this thesis, we explore two approaches to designing quantum algorithms based on continuous-time Hamiltonian dynamics. In quantum computation by adiabatic evolution, the computer is prepared in the known ground state of a simple Hamiltonian, which is slowly modified so that its ground state encodes the solution to a problem. We argue that this approach should be inherently robust against low-temperature thermal noise and certain control errors, and we support this claim using simulations. We then show that any adiabatic algorithm can be implemented in a different way, using only a sequence of measurements of the Hamiltonian. We illustrate how this approach can achieve quadratic speedup for the unstructured search problem. We also demonstrate two examples of quantum speedup by quantum walk, a quantum mechanical analog of random walk. First, we consider the problem of searching a region
All the data stored and processed by our computers is encoded as sequences of zeros and ones, called bits. Quantum computers offer an alternative to this traditional way of encoding and manipulating information. The information in a collection of qubits can be a combination, also called a superposition, over many possible sequences of zeros and ones. Where classical computation consists of flipping zeros and ones, quantum computation consists of manipulating high-dimensional vectors called quantum states. Researchers have found ways to use this to engineer quantum algorithms that solve some tasks much faster than any classical computer would. These are called quantum advantages, and are proven for specific tasks, such as breaking some encryption schemes and solving certain large linear systems. The goal of this thesis was to find new tasks for which quantum computers provably have an advantage over classical computers. In this thesis, I present two such advantages and associated results. The first one revolves around a physically relevant learning task. In other words, I explore how quantum computers can be used to help solve specialized machine learning tasks. The second one addresses the simulation of classical systems. One of the first high-potential and natural uses of quantum computers was the simulation of quantum systems. A lot of real-world problems, however, are ruled by classical physics. It turns out that quantum computers are well suited for the simulation of some exponentially large classical systems. In this thesis, I add a new problem to this list.
In the field of quantum information, a major challenge is to protect and shield quantum systems from environmental influences, which cause dissipation and decoherence. One approach to address this problem is called dynamical decoupling, where we act on a quantum system with a series of fast and strong local control operations. If done correctly, the system's state gets rotated in discrete steps in its state space in such a way that the effects of the environment cancel up to a certain order. In the first part of this thesis, we will introduce the basics of dynamical decoupling and present a new approach for constructing dynamical decoupling schemes based on sequences of Weyl operators on networks of qudits. This approach goes beyond merely protecting a quantum system, as it is also capable of altering existing Hamiltonian interactions in ways suitable for quantum simulation purposes. We will also investigate how imperfect controls influence the effectiveness of dynamical decoupling and focus particularly on stochastic noise. In the second part of the thesis, we study concrete scenarios for the application of dynamical decoupling. First, we consider the task of quantum state transfer on a linear chain of qubits and use decoupling to protect the transfer from detrimental influences caused by a bend in the chain. We also look at how to design the specific interaction strengths required on the chain to make the state transfer work and extend this result to chains of qudits. Another chapter deals with decoupling the atomic centre-of-mass motion of a trapped atom or ion in a cavity interacting with a radiation field. Finally, we use decoupling to execute sequences of one- and two-qubit quantum gates on a chain of coupled qubits. Particular care is taken to ensure high fidelity operations in the presence of imperfect decoupling pulses.