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

Toys for quantum computation

A. Keimpema

Published Jan 1, 2004• 0 citations
OpenAlex

Abstract

A formal definition of a computer would be that it is a system whose mechanical time evolution is used to do computation. A computer just like an dassical computer has the bit as unit of information, in the context of computation called a qubit. Because a computer operates in the mechanical domain, a collection of qubits can hold not one value but a superposition of many values. This quantum parallelism is a fundamental advantage that a computer has over a classical computer and algorithms that exploit this feature can be significantly faster than any classical algorithm. That said, the number of algorithm available today is small and their usefulness is limited. Several hardware implementations of computers have been made. Unfortunately existing hardware technology limits the size of these experimental computers to just a few qubits. In chapter 1 we review the field of computation and introduce an interesting new hardware candidate, dubbed the quantum by its creators. This toy is a metallic ring with three embedded ferromagnets. In certain configurations these ferromagnets can induce a current in the ring. In fact the configurations that will or will not induce a current can be identified with an CNOT(XOR) gate. This motivates us to explore the viability of this system using computer simulations. The toy system is related to a long standing problem in condensed matter physics, that of the persistent currents. When a small metal ring is placed in a static magnetic field, the magnetic field will induce a current in the ring. Persistent currents have been observed experimentally and a great discrepancy between theory and experiment was found. The qualitative features of the phenomenon are explained well by theory, but the size of the current measured was one to two orders of magnitude larger then that predicted by experiment. As a second object of this master thesis we will study persistent current numerically using a simple fight-binding model and compare this to existing theory and experiment. In chapter two we review the field of persistent currents and we give an overview of existing theory. To make a simulation tool of a mechanical system basically means that we have to solve the Schrodinger equation numerically. In chapter 3 we briefly discuss two such method, namely the Cranck- Nicholson method and the Suzuki-Trotter method. We will use the latter in our simulation tool. The actual simulation is described in chapter 4. In this chapter we detail the development of the numerical tool and show its correctness at each step. We find that the simulations qualitatively show the same features as we would expect theoretically and experimentally. The size of current is a different matter. When compared to experiment we find that although our results are of the same order of magnitude we cannot make an accurate fit to the experimental data using our simple model. In the last chapter we investigate the properties of the toy system by computer simulations. We will explore its application for computation and its use as a measurement device. Upon investigating how a toy system can be used in a circuit, we find that the toy is not useful for computation. We then focus on the second application1 that of a measurement device. The idea being that we can exploit the dependence of the induced current to the direction of the embedded ferromagnets. To verify if such a scheme will work, we need to investigate if we can reproduce the theoretical values of the induced current. We found major discrepancies between theory and our simulations. We found for instance that the induced current has an erratic dependence on the electron density. We then split our investigation between the single electron case and the half-filled case found in most metals. The single electron case only matches the theory qualitatively. We find that indeed such a single electron system can be build and be used as a measurement device. In the half-filled case we find that the dependence of the current on the various parameters is so erratic that we condude that according to our simulations, a metallic toy could not be used as a measurement device. An explanation for the difference between theory and our simulations could unfortunately not be found. To investigate this we would have to repeat the original calculations, which is outside the scope of this master thesis

Related papers

Long-range interactions, weak magnetic fields amplification, and end states for quantum computing

Luka Trifunovic

It was Richard Feynman who first proposed, in 1982, the far-reaching concept of \na ”quantum computer”—a device more powerful than classical computers. The idea \nof a quantum computer is to employ the fascinating and often counterintuitive \nlaws of quantum mechanics to process information. It is far from obvious that \nthe proposed concept of a quantum computer is more powerful than its classical \ncounterpart, it was only in 1994 when Peter Shor theoretically demonstrated the \nexistence of a quantum algorithm for factorizing integers into prime factors \nthat runs in polynomial time unlike its classical counterpart which works in \nsub-exponential time. The factorization of integers into prime factors is the \nbasis of asymmetric cryptography. These early theoretical results lunched an \nimmense interest of the scientific community. Already during ’90s, the first \nproposals for the physical implementation of quantum computation emerged. Ever \nsince, many experimental groups around the world pursued different physical \nimplementations of quantum bits (qubits). The first decade of the new century \nsaw a steady improvement in the control and decoherence time (the time over \nwhich the information carried by the qubit is lost) for various qubits by many \norders of magnitude. The natural next step in this context is to answer the \nquestion of how to scale the system up to include many qubits and thus build a \nquantum computer? One of the main parts of this thesis addresses exactly this \nquestion, namely the question of architecture and scalability of future quantum \ncomputer. \n \nAmong various different physical realizations of qubits, the idea of using \nelectron spins trapped in electrostatic semiconductor quantum dots as the \nbuilding blocks of a quantum computer (the so-called spin qubits), put forward \nby Daniel Loss and David DiVincenzo in 1997, triggered tremendous interest in \nscientific community. Nevertheless, the implementation of the original \nLoss-DiVincenzo proposal posed a considerable technical challenge. It used \nquantum tunneling between qubits to enable their communication with each other, \nand thus required that the qubits to be placed very close to each other. This \nrequirement not only leaves little \nspace for the placement of the vast amount of gates and wirings needed to define \nthe electrostatic quantum dots, but also makes it challenging to control the \nlocal magnetic field needed for single-qubit operations. For these reasons, no \nsystem with more than a couple of spin qubits has been \nsuccessfully implemented thus far. In the first part of this thesis, we leap \nover this long-standing problem with an entirely different strategy of using \nmetallic floating gates or ferromagnets to couple together qubits that are \nseparated over a long distance. Our scheme works for any type of \nspin qubits, including the qubits based on nitrogen-vacancy center (NV-center) \nin diamond and technologically very important silicon qubits. \n \nThe main topic of this thesis is related to quantum computer. Still, quite \nunexpectedly, some of the ideas we employed in order to tackle the problem of \nquantum computer scalability can be utilized in a completely different field of \nresearch, namely, in the field of magnetic field sensing. Qubit are not only a \nnecessary ingredient of quantum computer but they also provide a way to measure \nvery accurately magnetic fields. The magnetometer build upon the qubit based on \nNV-center, so-called NV-magnetometer, emerged in recent years as most sensitive \nmagnetic moment sensor. These magnetometers are able to detect about hundred \nnuclear spins within a minute of acquisition time. In the second part of this \nthesis, we propose an entirely novel experimental realization of \nNV-magnetometers which increases present NV-center sensitivities by four orders \nof magnitude at room temperature. This unprecedented amplification of \nsensitivity will render magnetometers capable of detecting individual nuclear \nspins. This amplification is achieved by introducing a ferromagnetic particle \nbetween the nuclear spin that needs to be detected and the NV-magnetometer. Our \nsetup, in contrast to existing schemes, is particularly advantageous because, \ndue to the large amplification of sensitivity, the nuclear spin need not lie \nwithin a few nanometers of the surface but rather can be detectable at a \ndistance of 30 nm. With these novelties, our scheme provides chemically \nsensitive spin detection under ambient conditions allowing nanoscale resolution \nof nuclear magnetic moments in biological systems—the holy grail of nuclear \nmagneticresonance. \n \nIn the last part of the thesis we focus our attention to a new direction in \nquantum computer implementation that deals with topological quantum computer \nintroduced by Alexei Kitaev in 1997; in this approach the idea is to use \nquasiparticles with ”fractional” statistics and to perform the single- and \ntwo-qubit gates by merely exchanging these quasiparticles. Additionally, \ninformation in this system is stored non-locally thus it mitigates the problem \nof decoherence caused by local noise from the environment. Majorana fermions are \none of the most well known examples of such excitations. We analyze transport \nsignatures of different topological states in one-dimensional systems, like \nMajorana fermions and fractionally charged states. We envision an Aharonov-Bohm \nsetup wherein conductance measurement provides a clear signature of presence of \nfractionally charged fermionic states, since oscillations with double period \nemerge in this case. Additionally, we propose a very simple setup that enables \nexistence of degenerate mid-gap states, so-called Tamm-Shockley states that are \ncharacterized by fractional charge and discuss possible ways of detecting these \nstates experimentally. \n

•Jan 1, 2015•0 citations

UNDAMENTALS OF INFORMATION AND COMPUTATION IN THE REALM OF THE QUANTA

John Henry Reina

Information is a physical. Physical systems register and process information. These facts generated enormus interest in the development of novel quantum tecnologies, especially because the construction of smaller electronic devices ultimately leads to a consideration of quantum mechanical effects in electronic and computer desingns. The notion of the classical bit of information theory was formally pushed into the realm of the quanta with the introduction of the quantum bit or qubit, in the seminal works of Deutsch (Deutsch, 1985) and Shor (Shor, 1994). They demostrated that, indeed, controlled multipartite qubit interference effects could provide the means for a radical new way of computing, allowing the computation of many intractable computational problems, such as the factoring of large number or exact simulation of large quantum systems. The field of experimental and theoretical research in quantum information and computation has emerged as very important player in the understanding of quantum phenomena the both the basic and technological levels. This has attracted the attention of numerous researchers with backgrounds ranging from computer science, mathematics and engineerin, to the physical sciences, and we now have an interdisciplinary field where great efforts are being made in order to build devices that allow the progressing of information at a quantum level. A concise introduction to the field of quantum information and quantum computation is presented. This stars with the bassic definitions of bits, quantum registers, through to the universal gate-set for building the universal quantum computer, from a quantum network model of computation. The work shows how two-qubit gates suffice for quantum computation, emphasing the power of the quantum circuit representation for entagling and disentagling quantum states. This leads to the “no-cloning theorem”, which leads us to many interesting applications, such as quantum cryptography. Two alternative approaches or performing quantum computation are also described i) the one-way or measurement based quantum computer method, and ii) holonomic or geometric quantum computation. Following this, quantum entaglement quantification is highlighted, particulary its usefulness as a communication resource, in order to describe some of its most celebrated practical applications to date: quantum teleportation, cryptography, dens coding, and data compression. Deutsch’s concept of quantum parallelism is enphasized in order to gain insight into the potential for efficiently solving certain classically intratable algorithms. A subject central to the field of QIP- quantum decoherence- is then introduced.. Possible ways to overcome it, in particular quantum error correction, are discussed. A descriptios of some of the currently available hardware of the practical implementation of quantum computation is provided with a discussion of the main physical quantum bits that are currently employed (or proposed) for a such a purpose.

Revista de la Academia Colombiana de Ciencias Exactas Físicas y Naturales•Dec 2, 2023•1 citation

Multimode Cavities for Quantum Science

Lukas Palm

Over the last decade, quantum simulation and computation has progressed from a purely scientific testbed of quantum mechanics to a mature field that is starting to offer new insights into materials, quantum effects, and algorithms that are intractable with even the most state-of-the-art classical computation. Simulating certain quantum Hamiltonians that are theorized to be at the heart of high-Tc superconductivity, topological quantum systems such as the fractional quantum Hall effect or fundamental questions of thermalization quickly exceed the available memory of even the most advanced supercomputers – and in fact all memory in the world – due to the exponential growth of the Hilbert space with system size. As postulated by Feynman himself, the computational system best suited for solving quantum problems is to use a quantum system itself, as it can intrinsically represent the entanglement that is the key resource making quantum computing challenging but also promising. Apart from simulating problems in physics and chemistry, there is also tremendous excitement for quantum computers to provide speedups for general algorithms in optimization at a rate that is exponentially faster than existing classical programming. So far only a small class of algorithms has been actually proven to provide such a speedup, most prominently Shor's algorithm which can factor large prime numbers, and several other search and oracle algorithms. In the last two decades, many experiments using ultracold atoms, ions, or superconducting circuits have focused on analog quantum simulation. Here, a model Hamiltonian that is believed to capture all the relevant physics of the system of study is experimentally realized using different building blocks and interactions but replicating condensed matter effects at an increased scale. This has led to a number of bespoke experiments such as BEC/Fermigass machines, quantum gas microscopes and more exotic setups that are purpose built to study a particular effect. More recently, there has been a shift to develop more universal simulation platforms and optical tweezer arrays have emerged as a leading solution due to their high degree of reconfigurability. Through tremendous improvements in the degree of control and measurement of single qubits, error correction has become a viable route to build a true universal digital quantum computer. Even as we transition into the digital age of quantum simulation, certain classes of problems with additional physics constraints such as Fermionic statistics, gauge fields and lattice gauge theories still incur too large of an overhead to be encoded on these digital simulators. In this thesis, we use a highly degenerate twisted cavity to simulate the effect of a magnetic field on a two-dimensional system of interacting photons to enable realization of states of the quantum Hall effect. We design, build, and commission a new lens based cavity apparatus realizing a lowest Landau level for a mesoscopic number of modes. We demonstrate the integration of highly excited Rydberg atoms to mediate strong interactions and demonstrate photon blockade as well as mean field interactions. As a second application of cavities to quantum information leveraging our newfound comfort with intra-cavity optics, and experience with aberration modeling in resonators, we demonstrate a new class of small waist optical resonators enabled by lens-based cavities and then apply our understanding of optical aberrations in cavities to the development of a new class of cavity array. This Cavity Array Microscope (CAM) realizes a large number of cavities (up to currently 600) using only a fixed number of free space optics and is both scalable with constant overhead as well as compatible with Rydberg atoms. This platform provides a route to highly parallel quantum repeater operation or entanglement generation between atom arrays in the future.

•Jun 1, 2026•0 citations

Numerical Treatment of the Liouville-von Neumann Equation for Quantum Spin Dynamics

Giacomo Mazzi

This thesis is concerned with the design of numerical methods for quantum simulation and the development of improved models for quantum relaxation. Analysis is presented for the treatment of quantum systems using the density matrix formalism. This approach has been developed from the early days of quantum mechanics as a tool to describe from a statistical point of view a large number of identical quantum ensembles. Traditional methods are well established and reliable, but they perform poorly for practical simulation as the system size is scaled up. Ad hoc schemes for nuclear spin dynamics appearing in the literature can be shown to fail in certain situations. The challenge is therefore to identify efficient reduction methods for the quantum system which are also based on a rigorous foundation. The method presented in the thesis, for the time–independent Hamiltonian case, combines a quantum density matrix formalism with a procedure based on Chebyshev polynomials; application of the method to Nuclear Magnetic Resonance (NMR) spectroscopy is considered, and it is shown that the new technique outperforms existing alternatives in term of computational costs. The case of a time–dependent Hamiltonian in NMR simulation is studied as well and some splitting methods are presented. To the author’s knowledge this is the first time such methods have been applied within the NMR framework, and the numerical results show a better error–to–cost rate than traditional methods. In a separate strand of research, formulations for open quantum systems are studied and new dynamical systems approaches are considered for this problem. Motivations This thesis work is mainly focused on nuclear spin dynamics. Nuclear spin dynamics constitutes the basis for NMR, which is a very powerful spectroscopy technique that exploits the interaction between nuclear spins and magnetic fields. The same technique is used to reveal the presence of hydrogen atoms in the blood for Magnetic Resonance Imaging (MRI). Within this framework the role of simulations is extremely important, as it provides a benchmark for studies of new materials, and the development of new magnetic fields. The main computational issue is that with current software for NMR simulation it is extremely expensive to deal with systems made of more than few (7–10) spins. There is therefore a strong need to develop new algorithms capable of simulating larger systems. In recent years NMR simulations have been found to be one of the most favorable candidates for quantum computing. There are two reasons for this: nuclear quantum states maintain extremely long coherences, and it is possible to attain a very strong control on the quantum state via the application of sequences of pulses. In order to develop a proper quantum computer it is fundamental to understand how the entangled states lose coherence and relax back to equilibrium by means of external interactions. This process is described as relaxation in an open quantum system. The theory for such systems has been available for 50 years but there are still substantial limitations in the two main approaches. There are also relatively few numerical approaches for the simulation of such systems, for this reason it is important to develop numerical alternatives for the description of open quantum systems. Thesis Outline The thesis is organized as follow: the first two chapters provide background material to familiarize the reader with fundamental concepts of both quantum mechanics and nuclear spin dynamics; in this part of the thesis no new results are presented. The first chapter introduces the concept of quantum systems and the mathematical environment with which we describe those systems. We also present the main equations we need to solve to determine the dynamics of a quantum system in a statistical framework. In the second chapter we introduce the nuclear spin system, that is the physical system that has been the main reference frame in this work, for both tests and practical applications of the new algorithms. We describe how nuclear spin systems are at the basis of very important applications like NMR spectroscopy and MRI. We present in some detail the physical features of the NMR technique and the equations we need to solve to describe the dynamics of a spin system; we also focus on the relevance of numerical simulations for these systems, and consequently which must be the interest in developing new algorithms, and the major obstacles which must be overcome. In the third chapter we investigate the numerical challenges that arise in simulation of quantum systems, we describe some of the methods that have been developed in the literature, focusing on the performances and the computational costs of them, setting the new developments of this thesis in the proper research frame. We discuss one of the major issues: the evaluation of the matrix exponential. We also present the analysis we have done of a recent method called Zero Track Elimination (ZTE) that has been developed specifically for NMR simulations. This analysis shows the limitations of this method but also gives a mathematical explanation of why–and in which cases–it works. In the fourth chapter we present the main result of the thesis, the development of a new method that directly evaluates the expectation values for a quantum simulation via a different application of the well known Chebyshev expansion. We have proved that this new method can provide an excellent boost in terms of performance, with computational costs that can be reduced by a factor ten in common cases. (The results of this chapter and the new method have been presented in international conferences and recently they have been submitted for publication). We also present some attempts we have made in the application of splitting methods for the evolution of the system in a time dependent environment. To our knowledge this is the first time splitting methods have been used for NMR simulations. The results of this approach are as follows: for a particular splitting technique combined with a Lanczos iteration method it is possible to speed up the calculation by a third if compared with a Lanczos type method whilst keeping the error below a critical threshold. This last approach is still a work in progress especially in terms of developing clever ways to split the Hamiltonian. The last chapter of this thesis deals with simulation of quantum systems interacting with an external environment. After presenting the main theoretical approaches for the description of such systems we then survey several the techniques that are currently used for the numerical implementation of such theories. As a work in progress we present a considerably different new approach we have been developing aiming to overcome some of the issues that arise when treating this kind of system within usual frameworks. This is somewhat speculative work that gives rise to some new directions in the development of a numerical description for open quantum systems. We also present some numerical results. (The main core of this chapter has been presented in international conferences).

•Jan 1, 2010•1 citation

Quantum computation

Stephen Mark Barnett

In the preceding chapter we established that a suitable set of quantum gates, complemented by quantum error correction, allows us to produce a desired multiqubit unitary transformation. This transformation is one of the three steps in a quantum computation; the others, of course, are the preparation of the qubits in their initial state and the measurement of them after the transformation has been implemented. A quantum computation is designed to solve a problem or class of problems. The power of quantum computers is that they can do this, at least for some problems, very much more efficiently and quickly than any conventional computer based on classical logic operations. If we can build a quantum computer then a number of important problems which are currently intractable will become solvable. The potential for greatly enhanced computational power is, in itself, reason enough to study quantum computers, but there is another. Moore’s law is the observation that the number of transistors on a chip doubles roughly every eighteen months. A simple corollary is that computer performance also doubles on the same timescale. Associated with this exponential improvement is a dramatic reduction in the size of individual components. If the pace is to be kept up then it is inevitable that quantum effects will become increasingly important and ultimately will limit the operation of the computer. In these circumstances it is sensible to consider the possibility of harnessing quantum effects to realize quantum information processors and computers. We start with a brief introduction to the theory of computer science, the principles of which underlie the operation of what we shall refer to as classical computers. These include all existing machines and any based on the manipulation of classical bits. The development of computer science owes much to Turing, who devised a simple but powerful model of a computing device: the Turing machine. It its most elementary form, this consists of four elements. (i) A tape for data storage, which acts as a memory. This tape has a sequence of spaces, each of which has on it one of a finite set of symbols. (ii) A processor, which controls the operations of the machine.

Oxford University Press eBooks•May 28, 2009•0 citations

Simulating Quantum Computations on Classical Machines: A Survey

Kieran P. Young, Marcus Scese, Ali Ebnenasir

We present a comprehensive study of quantum simulation methods and quantum simulators for classical computers. We first study an exhaustive set of 150+ simulators and quantum libraries. Then, we short-list the simulators that are actively maintained and enable simulation of quantum algorithms for more than 10 qubits. As a result, we realize that most efficient and actively maintained simulators have been developed after 2010. We also provide a taxonomy of the most important simulation methods, namely Schrodinger-based, Feynman path integrals, Heisenberg-based, and hybrid methods. We observe that most simulators fall in the category of Schrodinger-based approaches. However, there are a few efficient simulators belonging to other categories. We also make note that quantum frameworks form their own class of software tools that provide more flexibility for algorithm designers with a choice of simulators/simulation method. Another contribution of this study includes the use and classification of optimization methods used in a variety of simulators. We observe that some state-of-the-art simulators utilize a combination of software and hardware optimization techniques to scale up the simulation of quantum circuits. We summarize this study by providing a roadmap for future research that can further enhance the use of quantum simulators in education and research.

arXiv:2311.16505•Nov 28, 2023•24 citations
A formal definition of a computer would be that it is a system whose mechanical time evolution is used to do computation. A computer just like an dassical computer has the bit as unit of information, in the context of computation called a qubit. Because a computer operates in the mechanical domain, a collection of qubits can hold not one value but a superposition of many values. This quantum parallelism is a fundamental advantage that a computer has over a classical computer and algorithms that exploit this feature can be significantly faster than any classical algorithm. That said, the number of algorithm available today is small and their usefulness is limited. Several hardware implementations of computers have been made. Unfortunately existing hardware technology limits the size of these experimental computers to just a few qubits. In chapter 1 we review the field of computation and introduce an interesting new hardware candidate, dubbed the quantum by its creators. This toy is a metallic ring with three embedded ferromagnets. In certain configurations these ferromagnets can induce a current in the ring. In fact the configurations that will or will not induce a current can be identified with an CNOT(XOR) gate. This motivates us to explore the viability of this system using computer simulations. The toy system is related to a long standing problem in condensed matter physics, that of the persistent currents. When a small metal ring is placed in a static magnetic field, the magnetic field will induce a current in the ring. Persistent currents have been observed experimentally and a great discrepancy between theory and experiment was found. The qualitative features of the phenomenon are explained well by theory, but the size of the current measured was one to two orders of magnitude larger then that predicted by experiment. As a second object of this master thesis we will study persistent current numerically using a simple fight-binding model and compare this to existing theory and experiment. In chapter two we review the field of persistent currents and we give an overview of existing theory. To make a simulation tool of a mechanical system basically means that we have to solve the Schrodinger equation numerically. In chapter 3 we briefly discuss two such method, namely the Cranck- Nicholson method and the Suzuki-Trotter method. We will use the latter in our simulation tool. The actual simulation is described in chapter 4. In this chapter we detail the development of the numerical tool and show its correctness at each step. We find that the simulations qualitatively show the same features as we would expect theoretically and experimentally. The size of current is a different matter. When compared to experiment we find that although our results are of the same order of magnitude we cannot make an accurate fit to the experimental data using our simple model. In the last chapter we investigate the properties of the toy system by computer simulations. We will explore its application for computation and its use as a measurement device. Upon investigating how a toy system can be used in a circuit, we find that the toy is not useful for computation. We then focus on the second application1 that of a measurement device. The idea being that we can exploit the dependence of the induced current to the direction of the embedded ferromagnets. To verify if such a scheme will work, we need to investigate if we can reproduce the theoretical values of the induced current. We found major discrepancies between theory and our simulations. We found for instance that the induced current has an erratic dependence on the electron density. We then split our investigation between the single electron case and the half-filled case found in most metals. The single electron case only matches the theory qualitatively. We find that indeed such a single electron system can be build and be used as a measurement device. In the half-filled case we find that the dependence of the current on the various parameters is so erratic that we condude that according to our simulations, a metallic toy could not be used as a measurement device. An explanation for the difference between theory and our simulations could unfortunately not be found. To investigate this we would have to repeat the original calculations, which is outside the scope of this master thesis
It was Richard Feynman who first proposed, in 1982, the far-reaching concept of \na ”quantum computer”—a device more powerful than classical computers. The idea \nof a quantum computer is to employ the fascinating and often counterintuitive \nlaws of quantum mechanics to process information. It is far from obvious that \nthe proposed concept of a quantum computer is more powerful than its classical \ncounterpart, it was only in 1994 when Peter Shor theoretically demonstrated the \nexistence of a quantum algorithm for factorizing integers into prime factors \nthat runs in polynomial time unlike its classical counterpart which works in \nsub-exponential time. The factorization of integers into prime factors is the \nbasis of asymmetric cryptography. These early theoretical results lunched an \nimmense interest of the scientific community. Already during ’90s, the first \nproposals for the physical implementation of quantum computation emerged. Ever \nsince, many experimental groups around the world pursued different physical \nimplementations of quantum bits (qubits). The first decade of the new century \nsaw a steady improvement in the control and decoherence time (the time over \nwhich the information carried by the qubit is lost) for various qubits by many \norders of magnitude. The natural next step in this context is to answer the \nquestion of how to scale the system up to include many qubits and thus build a \nquantum computer? One of the main parts of this thesis addresses exactly this \nquestion, namely the question of architecture and scalability of future quantum \ncomputer. \n \nAmong various different physical realizations of qubits, the idea of using \nelectron spins trapped in electrostatic semiconductor quantum dots as the \nbuilding blocks of a quantum computer (the so-called spin qubits), put forward \nby Daniel Loss and David DiVincenzo in 1997, triggered tremendous interest in \nscientific community. Nevertheless, the implementation of the original \nLoss-DiVincenzo proposal posed a considerable technical challenge. It used \nquantum tunneling between qubits to enable their communication with each other, \nand thus required that the qubits to be placed very close to each other. This \nrequirement not only leaves little \nspace for the placement of the vast amount of gates and wirings needed to define \nthe electrostatic quantum dots, but also makes it challenging to control the \nlocal magnetic field needed for single-qubit operations. For these reasons, no \nsystem with more than a couple of spin qubits has been \nsuccessfully implemented thus far. In the first part of this thesis, we leap \nover this long-standing problem with an entirely different strategy of using \nmetallic floating gates or ferromagnets to couple together qubits that are \nseparated over a long distance. Our scheme works for any type of \nspin qubits, including the qubits based on nitrogen-vacancy center (NV-center) \nin diamond and technologically very important silicon qubits. \n \nThe main topic of this thesis is related to quantum computer. Still, quite \nunexpectedly, some of the ideas we employed in order to tackle the problem of \nquantum computer scalability can be utilized in a completely different field of \nresearch, namely, in the field of magnetic field sensing. Qubit are not only a \nnecessary ingredient of quantum computer but they also provide a way to measure \nvery accurately magnetic fields. The magnetometer build upon the qubit based on \nNV-center, so-called NV-magnetometer, emerged in recent years as most sensitive \nmagnetic moment sensor. These magnetometers are able to detect about hundred \nnuclear spins within a minute of acquisition time. In the second part of this \nthesis, we propose an entirely novel experimental realization of \nNV-magnetometers which increases present NV-center sensitivities by four orders \nof magnitude at room temperature. This unprecedented amplification of \nsensitivity will render magnetometers capable of detecting individual nuclear \nspins. This amplification is achieved by introducing a ferromagnetic particle \nbetween the nuclear spin that needs to be detected and the NV-magnetometer. Our \nsetup, in contrast to existing schemes, is particularly advantageous because, \ndue to the large amplification of sensitivity, the nuclear spin need not lie \nwithin a few nanometers of the surface but rather can be detectable at a \ndistance of 30 nm. With these novelties, our scheme provides chemically \nsensitive spin detection under ambient conditions allowing nanoscale resolution \nof nuclear magnetic moments in biological systems—the holy grail of nuclear \nmagneticresonance. \n \nIn the last part of the thesis we focus our attention to a new direction in \nquantum computer implementation that deals with topological quantum computer \nintroduced by Alexei Kitaev in 1997; in this approach the idea is to use \nquasiparticles with ”fractional” statistics and to perform the single- and \ntwo-qubit gates by merely exchanging these quasiparticles. Additionally, \ninformation in this system is stored non-locally thus it mitigates the problem \nof decoherence caused by local noise from the environment. Majorana fermions are \none of the most well known examples of such excitations. We analyze transport \nsignatures of different topological states in one-dimensional systems, like \nMajorana fermions and fractionally charged states. We envision an Aharonov-Bohm \nsetup wherein conductance measurement provides a clear signature of presence of \nfractionally charged fermionic states, since oscillations with double period \nemerge in this case. Additionally, we propose a very simple setup that enables \nexistence of degenerate mid-gap states, so-called Tamm-Shockley states that are \ncharacterized by fractional charge and discuss possible ways of detecting these \nstates experimentally. \n
Information is a physical. Physical systems register and process information. These facts generated enormus interest in the development of novel quantum tecnologies, especially because the construction of smaller electronic devices ultimately leads to a consideration of quantum mechanical effects in electronic and computer desingns. The notion of the classical bit of information theory was formally pushed into the realm of the quanta with the introduction of the quantum bit or qubit, in the seminal works of Deutsch (Deutsch, 1985) and Shor (Shor, 1994). They demostrated that, indeed, controlled multipartite qubit interference effects could provide the means for a radical new way of computing, allowing the computation of many intractable computational problems, such as the factoring of large number or exact simulation of large quantum systems. The field of experimental and theoretical research in quantum information and computation has emerged as very important player in the understanding of quantum phenomena the both the basic and technological levels. This has attracted the attention of numerous researchers with backgrounds ranging from computer science, mathematics and engineerin, to the physical sciences, and we now have an interdisciplinary field where great efforts are being made in order to build devices that allow the progressing of information at a quantum level. A concise introduction to the field of quantum information and quantum computation is presented. This stars with the bassic definitions of bits, quantum registers, through to the universal gate-set for building the universal quantum computer, from a quantum network model of computation. The work shows how two-qubit gates suffice for quantum computation, emphasing the power of the quantum circuit representation for entagling and disentagling quantum states. This leads to the “no-cloning theorem”, which leads us to many interesting applications, such as quantum cryptography. Two alternative approaches or performing quantum computation are also described i) the one-way or measurement based quantum computer method, and ii) holonomic or geometric quantum computation. Following this, quantum entaglement quantification is highlighted, particulary its usefulness as a communication resource, in order to describe some of its most celebrated practical applications to date: quantum teleportation, cryptography, dens coding, and data compression. Deutsch’s concept of quantum parallelism is enphasized in order to gain insight into the potential for efficiently solving certain classically intratable algorithms. A subject central to the field of QIP- quantum decoherence- is then introduced.. Possible ways to overcome it, in particular quantum error correction, are discussed. A descriptios of some of the currently available hardware of the practical implementation of quantum computation is provided with a discussion of the main physical quantum bits that are currently employed (or proposed) for a such a purpose.
Over the last decade, quantum simulation and computation has progressed from a purely scientific testbed of quantum mechanics to a mature field that is starting to offer new insights into materials, quantum effects, and algorithms that are intractable with even the most state-of-the-art classical computation. Simulating certain quantum Hamiltonians that are theorized to be at the heart of high-Tc superconductivity, topological quantum systems such as the fractional quantum Hall effect or fundamental questions of thermalization quickly exceed the available memory of even the most advanced supercomputers – and in fact all memory in the world – due to the exponential growth of the Hilbert space with system size. As postulated by Feynman himself, the computational system best suited for solving quantum problems is to use a quantum system itself, as it can intrinsically represent the entanglement that is the key resource making quantum computing challenging but also promising. Apart from simulating problems in physics and chemistry, there is also tremendous excitement for quantum computers to provide speedups for general algorithms in optimization at a rate that is exponentially faster than existing classical programming. So far only a small class of algorithms has been actually proven to provide such a speedup, most prominently Shor's algorithm which can factor large prime numbers, and several other search and oracle algorithms. In the last two decades, many experiments using ultracold atoms, ions, or superconducting circuits have focused on analog quantum simulation. Here, a model Hamiltonian that is believed to capture all the relevant physics of the system of study is experimentally realized using different building blocks and interactions but replicating condensed matter effects at an increased scale. This has led to a number of bespoke experiments such as BEC/Fermigass machines, quantum gas microscopes and more exotic setups that are purpose built to study a particular effect. More recently, there has been a shift to develop more universal simulation platforms and optical tweezer arrays have emerged as a leading solution due to their high degree of reconfigurability. Through tremendous improvements in the degree of control and measurement of single qubits, error correction has become a viable route to build a true universal digital quantum computer. Even as we transition into the digital age of quantum simulation, certain classes of problems with additional physics constraints such as Fermionic statistics, gauge fields and lattice gauge theories still incur too large of an overhead to be encoded on these digital simulators. In this thesis, we use a highly degenerate twisted cavity to simulate the effect of a magnetic field on a two-dimensional system of interacting photons to enable realization of states of the quantum Hall effect. We design, build, and commission a new lens based cavity apparatus realizing a lowest Landau level for a mesoscopic number of modes. We demonstrate the integration of highly excited Rydberg atoms to mediate strong interactions and demonstrate photon blockade as well as mean field interactions. As a second application of cavities to quantum information leveraging our newfound comfort with intra-cavity optics, and experience with aberration modeling in resonators, we demonstrate a new class of small waist optical resonators enabled by lens-based cavities and then apply our understanding of optical aberrations in cavities to the development of a new class of cavity array. This Cavity Array Microscope (CAM) realizes a large number of cavities (up to currently 600) using only a fixed number of free space optics and is both scalable with constant overhead as well as compatible with Rydberg atoms. This platform provides a route to highly parallel quantum repeater operation or entanglement generation between atom arrays in the future.
This thesis is concerned with the design of numerical methods for quantum simulation and the development of improved models for quantum relaxation. Analysis is presented for the treatment of quantum systems using the density matrix formalism. This approach has been developed from the early days of quantum mechanics as a tool to describe from a statistical point of view a large number of identical quantum ensembles. Traditional methods are well established and reliable, but they perform poorly for practical simulation as the system size is scaled up. Ad hoc schemes for nuclear spin dynamics appearing in the literature can be shown to fail in certain situations. The challenge is therefore to identify efficient reduction methods for the quantum system which are also based on a rigorous foundation. The method presented in the thesis, for the time–independent Hamiltonian case, combines a quantum density matrix formalism with a procedure based on Chebyshev polynomials; application of the method to Nuclear Magnetic Resonance (NMR) spectroscopy is considered, and it is shown that the new technique outperforms existing alternatives in term of computational costs. The case of a time–dependent Hamiltonian in NMR simulation is studied as well and some splitting methods are presented. To the author’s knowledge this is the first time such methods have been applied within the NMR framework, and the numerical results show a better error–to–cost rate than traditional methods. In a separate strand of research, formulations for open quantum systems are studied and new dynamical systems approaches are considered for this problem. Motivations This thesis work is mainly focused on nuclear spin dynamics. Nuclear spin dynamics constitutes the basis for NMR, which is a very powerful spectroscopy technique that exploits the interaction between nuclear spins and magnetic fields. The same technique is used to reveal the presence of hydrogen atoms in the blood for Magnetic Resonance Imaging (MRI). Within this framework the role of simulations is extremely important, as it provides a benchmark for studies of new materials, and the development of new magnetic fields. The main computational issue is that with current software for NMR simulation it is extremely expensive to deal with systems made of more than few (7–10) spins. There is therefore a strong need to develop new algorithms capable of simulating larger systems. In recent years NMR simulations have been found to be one of the most favorable candidates for quantum computing. There are two reasons for this: nuclear quantum states maintain extremely long coherences, and it is possible to attain a very strong control on the quantum state via the application of sequences of pulses. In order to develop a proper quantum computer it is fundamental to understand how the entangled states lose coherence and relax back to equilibrium by means of external interactions. This process is described as relaxation in an open quantum system. The theory for such systems has been available for 50 years but there are still substantial limitations in the two main approaches. There are also relatively few numerical approaches for the simulation of such systems, for this reason it is important to develop numerical alternatives for the description of open quantum systems. Thesis Outline The thesis is organized as follow: the first two chapters provide background material to familiarize the reader with fundamental concepts of both quantum mechanics and nuclear spin dynamics; in this part of the thesis no new results are presented. The first chapter introduces the concept of quantum systems and the mathematical environment with which we describe those systems. We also present the main equations we need to solve to determine the dynamics of a quantum system in a statistical framework. In the second chapter we introduce the nuclear spin system, that is the physical system that has been the main reference frame in this work, for both tests and practical applications of the new algorithms. We describe how nuclear spin systems are at the basis of very important applications like NMR spectroscopy and MRI. We present in some detail the physical features of the NMR technique and the equations we need to solve to describe the dynamics of a spin system; we also focus on the relevance of numerical simulations for these systems, and consequently which must be the interest in developing new algorithms, and the major obstacles which must be overcome. In the third chapter we investigate the numerical challenges that arise in simulation of quantum systems, we describe some of the methods that have been developed in the literature, focusing on the performances and the computational costs of them, setting the new developments of this thesis in the proper research frame. We discuss one of the major issues: the evaluation of the matrix exponential. We also present the analysis we have done of a recent method called Zero Track Elimination (ZTE) that has been developed specifically for NMR simulations. This analysis shows the limitations of this method but also gives a mathematical explanation of why–and in which cases–it works. In the fourth chapter we present the main result of the thesis, the development of a new method that directly evaluates the expectation values for a quantum simulation via a different application of the well known Chebyshev expansion. We have proved that this new method can provide an excellent boost in terms of performance, with computational costs that can be reduced by a factor ten in common cases. (The results of this chapter and the new method have been presented in international conferences and recently they have been submitted for publication). We also present some attempts we have made in the application of splitting methods for the evolution of the system in a time dependent environment. To our knowledge this is the first time splitting methods have been used for NMR simulations. The results of this approach are as follows: for a particular splitting technique combined with a Lanczos iteration method it is possible to speed up the calculation by a third if compared with a Lanczos type method whilst keeping the error below a critical threshold. This last approach is still a work in progress especially in terms of developing clever ways to split the Hamiltonian. The last chapter of this thesis deals with simulation of quantum systems interacting with an external environment. After presenting the main theoretical approaches for the description of such systems we then survey several the techniques that are currently used for the numerical implementation of such theories. As a work in progress we present a considerably different new approach we have been developing aiming to overcome some of the issues that arise when treating this kind of system within usual frameworks. This is somewhat speculative work that gives rise to some new directions in the development of a numerical description for open quantum systems. We also present some numerical results. (The main core of this chapter has been presented in international conferences).
In the preceding chapter we established that a suitable set of quantum gates, complemented by quantum error correction, allows us to produce a desired multiqubit unitary transformation. This transformation is one of the three steps in a quantum computation; the others, of course, are the preparation of the qubits in their initial state and the measurement of them after the transformation has been implemented. A quantum computation is designed to solve a problem or class of problems. The power of quantum computers is that they can do this, at least for some problems, very much more efficiently and quickly than any conventional computer based on classical logic operations. If we can build a quantum computer then a number of important problems which are currently intractable will become solvable. The potential for greatly enhanced computational power is, in itself, reason enough to study quantum computers, but there is another. Moore’s law is the observation that the number of transistors on a chip doubles roughly every eighteen months. A simple corollary is that computer performance also doubles on the same timescale. Associated with this exponential improvement is a dramatic reduction in the size of individual components. If the pace is to be kept up then it is inevitable that quantum effects will become increasingly important and ultimately will limit the operation of the computer. In these circumstances it is sensible to consider the possibility of harnessing quantum effects to realize quantum information processors and computers. We start with a brief introduction to the theory of computer science, the principles of which underlie the operation of what we shall refer to as classical computers. These include all existing machines and any based on the manipulation of classical bits. The development of computer science owes much to Turing, who devised a simple but powerful model of a computing device: the Turing machine. It its most elementary form, this consists of four elements. (i) A tape for data storage, which acts as a memory. This tape has a sequence of spaces, each of which has on it one of a finite set of symbols. (ii) A processor, which controls the operations of the machine.
We present a comprehensive study of quantum simulation methods and quantum simulators for classical computers. We first study an exhaustive set of 150+ simulators and quantum libraries. Then, we short-list the simulators that are actively maintained and enable simulation of quantum algorithms for more than 10 qubits. As a result, we realize that most efficient and actively maintained simulators have been developed after 2010. We also provide a taxonomy of the most important simulation methods, namely Schrodinger-based, Feynman path integrals, Heisenberg-based, and hybrid methods. We observe that most simulators fall in the category of Schrodinger-based approaches. However, there are a few efficient simulators belonging to other categories. We also make note that quantum frameworks form their own class of software tools that provide more flexibility for algorithm designers with a choice of simulators/simulation method. Another contribution of this study includes the use and classification of optimization methods used in a variety of simulators. We observe that some state-of-the-art simulators utilize a combination of software and hardware optimization techniques to scale up the simulation of quantum circuits. We summarize this study by providing a roadmap for future research that can further enhance the use of quantum simulators in education and research.