Advanced Visual Quantum Mechanics

CERN Document Server

Thaller, Bernd

2005-01-01

Advanced Visual Quantum Mechanics is a systematic effort to investigate and to teach quantum mechanics with the aid of computer-generated animations. It is a self-contained textbook that combines selected topics from atomic physics (spherical symmetry, the hydrogen atom, and particles with spin) with an introduction to quantum information theory (qubits, EPR paradox, teleportation, quantum computers). It explores relativistic quantum mechanics and the strange behavior of Dirac equation solutions. A series of appendices covers important topics from perturbation and scattering theory. The book places an emphasis on ideas and concepts, with a fair to moderate amount of mathematical rigor. Though this book stands alone, it can also be paired with Thaller Visual Quantum Mechanics to form a comprehensive course in quantum mechanics. The software for the first book earned the European Academic Software Award 2000 for outstanding innovation in its field.

Non-Mechanism in Quantum Oracle Computing

OpenAIRE

Castagnoli, Giuseppe

1999-01-01

A typical oracle problem is finding which software program is installed on a computer, by running the computer and testing its input-output behaviour. The program is randomly chosen from a set of programs known to the problem solver. As well known, some oracle problems are solved more efficiently by using quantum algorithms; this naturally implies changing the computer to quantum, while the choice of the software program remains sharp. In order to highlight the non-mechanistic origin of this ...

Quantum computers and quantum computations

International Nuclear Information System (INIS)

Valiev, Kamil' A

2005-01-01

This review outlines the principles of operation of quantum computers and their elements. The theory of ideal computers that do not interact with the environment and are immune to quantum decohering processes is presented. Decohering processes in quantum computers are investigated. The review considers methods for correcting quantum computing errors arising from the decoherence of the state of the quantum computer, as well as possible methods for the suppression of the decohering processes. A brief enumeration of proposed quantum computer realizations concludes the review. (reviews of topical problems)

Quantum computing and probability.

Science.gov (United States)

Ferry, David K

2009-11-25

Over the past two decades, quantum computing has become a popular and promising approach to trying to solve computationally difficult problems. Missing in many descriptions of quantum computing is just how probability enters into the process. Here, we discuss some simple examples of how uncertainty and probability enter, and how this and the ideas of quantum computing challenge our interpretations of quantum mechanics. It is found that this uncertainty can lead to intrinsic decoherence, and this raises challenges for error correction.

Quantum computing and probability

International Nuclear Information System (INIS)

Ferry, David K

2009-01-01

Over the past two decades, quantum computing has become a popular and promising approach to trying to solve computationally difficult problems. Missing in many descriptions of quantum computing is just how probability enters into the process. Here, we discuss some simple examples of how uncertainty and probability enter, and how this and the ideas of quantum computing challenge our interpretations of quantum mechanics. It is found that this uncertainty can lead to intrinsic decoherence, and this raises challenges for error correction. (viewpoint)

Quantum computing from the ground up

CERN Document Server

Perry, Riley Tipton

2012-01-01

Quantum computing - the application of quantum mechanics to information - represents a fundamental break from classical information and promises to dramatically increase a computer's power. Many difficult problems, such as the factorization of large numbers, have so far resisted attack by classical computers yet are easily solved with quantum computers. If they become feasible, quantum computers will end standard practices such as RSA encryption. Most of the books or papers on quantum computing require (or assume) prior knowledge of certain areas such as linear algebra or quantum mechanics. The majority of the currently-available literature is hard to understand for the average computer enthusiast or interested layman. This text attempts to teach quantum computing from the ground up in an easily readable way, providing a comprehensive tutorial that includes all the necessary mathematics, computer science and physics.

Foundations of Quantum Mechanics and Quantum Computation

Science.gov (United States)

Aspect, Alain; Leggett, Anthony; Preskill, John; Durt, Thomas; Pironio, Stefano

2013-03-01

I ask the question: What can we infer about the nature and structure of the physical world (a) from experiments already done to test the predictions of quantum mechanics (b) from the assumption that all future experiments will agree with those predictions? I discuss existing and projected experiments related to the two classic paradoxes of quantum mechanics, named respectively for EPR and Schrödinger's Cat, and show in particular that one natural conclusion from both types of experiment implies the abandonment of the concept of macroscopic counterfactual definiteness.

Quantum steady computation

International Nuclear Information System (INIS)

Castagnoli, G.

1991-01-01

This paper reports that current conceptions of quantum mechanical computers inherit from conventional digital machines two apparently interacting features, machine imperfection and temporal development of the computational process. On account of machine imperfection, the process would become ideally reversible only in the limiting case of zero speed. Therefore the process is irreversible in practice and cannot be considered to be a fundamental quantum one. By giving up classical features and using a linear, reversible and non-sequential representation of the computational process - not realizable in classical machines - the process can be identified with the mathematical form of a quantum steady state. This form of steady quantum computation would seem to have an important bearing on the notion of cognition

Quantum steady computation

Energy Technology Data Exchange (ETDEWEB)

Castagnoli, G. (Dipt. di Informatica, Sistemistica, Telematica, Univ. di Genova, Viale Causa 13, 16145 Genova (IT))

1991-08-10

This paper reports that current conceptions of quantum mechanical computers inherit from conventional digital machines two apparently interacting features, machine imperfection and temporal development of the computational process. On account of machine imperfection, the process would become ideally reversible only in the limiting case of zero speed. Therefore the process is irreversible in practice and cannot be considered to be a fundamental quantum one. By giving up classical features and using a linear, reversible and non-sequential representation of the computational process - not realizable in classical machines - the process can be identified with the mathematical form of a quantum steady state. This form of steady quantum computation would seem to have an important bearing on the notion of cognition.

Quantum Analog Computing

Science.gov (United States)

Zak, M.

1998-01-01

Quantum analog computing is based upon similarity between mathematical formalism of quantum mechanics and phenomena to be computed. It exploits a dynamical convergence of several competing phenomena to an attractor which can represent an externum of a function, an image, a solution to a system of ODE, or a stochastic process.

Renormalisation in Quantum Mechanics, Quantum Instantons and Quantum Chaos

OpenAIRE

Jirari, H.; Kröger, H.; Luo, X. Q.; Moriarty, K. J. M.

2001-01-01

We suggest how to construct non-perturbatively a renormalized action in quantum mechanics. We discuss similarties and differences with the standard effective action. We propose that the new quantum action is suitable to define and compute quantum instantons and quantum chaos.

Quantum computer games: quantum minesweeper

Science.gov (United States)

Gordon, Michal; Gordon, Goren

2010-07-01

The computer game of quantum minesweeper is introduced as a quantum extension of the well-known classical minesweeper. Its main objective is to teach the unique concepts of quantum mechanics in a fun way. Quantum minesweeper demonstrates the effects of superposition, entanglement and their non-local characteristics. While in the classical minesweeper the goal of the game is to discover all the mines laid out on a board without triggering them, in the quantum version there are several classical boards in superposition. The goal is to know the exact quantum state, i.e. the precise layout of all the mines in all the superposed classical boards. The player can perform three types of measurement: a classical measurement that probabilistically collapses the superposition; a quantum interaction-free measurement that can detect a mine without triggering it; and an entanglement measurement that provides non-local information. The application of the concepts taught by quantum minesweeper to one-way quantum computing are also presented.

Bananaworld quantum mechanics for primates

CERN Document Server

Bub, Jeffrey

2016-01-01

What on earth do bananas have to do with quantum mechanics? From a modern perspective, quantum mechanics is about strangely counterintuitive correlations between separated systems, which can be exploited in feats like quantum teleportation, unbreakable cryptographic schemes, and computers with enormously enhanced computing power. Schro?dinger coined the term "entanglement" to describe these bizarre correlations. Bananaworld -- an imaginary island with "entangled" bananas -- brings to life the fascinating discoveries of the new field of quantum information without the mathematical machinery of quantum mechanics. The connection with quantum correlations is fully explained in sections written for the non-physicist reader with a serious interest in understanding the mysteries of the quantum world. The result is a subversive but entertaining book that is accessible and interesting to a wide range of readers, with the novel thesis that quantum mechanics is about the structure of information. What we have discovered...

Research progress on quantum informatics and quantum computation

Science.gov (United States)

Zhao, Yusheng

2018-03-01

Quantum informatics is an emerging interdisciplinary subject developed by the combination of quantum mechanics, information science, and computer science in the 1980s. The birth and development of quantum information science has far-reaching significance in science and technology. At present, the application of quantum information technology has become the direction of people’s efforts. The preparation, storage, purification and regulation, transmission, quantum coding and decoding of quantum state have become the hotspot of scientists and technicians, which have a profound impact on the national economy and the people’s livelihood, technology and defense technology. This paper first summarizes the background of quantum information science and quantum computer and the current situation of domestic and foreign research, and then introduces the basic knowledge and basic concepts of quantum computing. Finally, several quantum algorithms are introduced in detail, including Quantum Fourier transform, Deutsch-Jozsa algorithm, Shor’s quantum algorithm, quantum phase estimation.

Quantum Computation: Entangling with the Future

Science.gov (United States)

Jiang, Zhang

2017-01-01

Commercial applications of quantum computation have become viable due to the rapid progress of the field in the recent years. Efficient quantum algorithms are discovered to cope with the most challenging real-world problems that are too hard for classical computers. Manufactured quantum hardware has reached unprecedented precision and controllability, enabling fault-tolerant quantum computation. Here, I give a brief introduction on what principles in quantum mechanics promise its unparalleled computational power. I will discuss several important quantum algorithms that achieve exponential or polynomial speedup over any classical algorithm. Building a quantum computer is a daunting task, and I will talk about the criteria and various implementations of quantum computers. I conclude the talk with near-future commercial applications of a quantum computer.

Quantum computers: Definition and implementations

International Nuclear Information System (INIS)

Perez-Delgado, Carlos A.; Kok, Pieter

2011-01-01

The DiVincenzo criteria for implementing a quantum computer have been seminal in focusing both experimental and theoretical research in quantum-information processing. These criteria were formulated specifically for the circuit model of quantum computing. However, several new models for quantum computing (paradigms) have been proposed that do not seem to fit the criteria well. Therefore, the question is what are the general criteria for implementing quantum computers. To this end, a formal operational definition of a quantum computer is introduced. It is then shown that, according to this definition, a device is a quantum computer if it obeys the following criteria: Any quantum computer must consist of a quantum memory, with an additional structure that (1) facilitates a controlled quantum evolution of the quantum memory; (2) includes a method for information theoretic cooling of the memory; and (3) provides a readout mechanism for subsets of the quantum memory. The criteria are met when the device is scalable and operates fault tolerantly. We discuss various existing quantum computing paradigms and how they fit within this framework. Finally, we present a decision tree for selecting an avenue toward building a quantum computer. This is intended to help experimentalists determine the most natural paradigm given a particular physical implementation.

Elements of quantum computing history, theories and engineering applications

CERN Document Server

Akama, Seiki

2015-01-01

A quantum computer is a computer based on a computational model which uses quantum mechanics, which is a subfield of physics to study phenomena at the micro level. There has been a growing interest on quantum computing in the 1990's, and some quantum computers at the experimental level were recently implemented. Quantum computers enable super-speed computation, and can solve some important problems whose solutions were regarded impossible or intractable with traditional computers. This book provides a quick introduction to quantum computing for readers who have no backgrounds of both theory of computation and quantum mechanics. “Elements of Quantum Computing” presents the history, theories, and engineering applications of quantum computing. The book is suitable to computer scientists, physicist, and software engineers.

A quantum computer only needs one universe

OpenAIRE

Steane, A. M.

2000-01-01

The nature of quantum computation is discussed. It is argued that, in terms of the amount of information manipulated in a given time, quantum and classical computation are equally efficient. Quantum superposition does not permit quantum computers to ``perform many computations simultaneously'' except in a highly qualified and to some extent misleading sense. Quantum computation is therefore not well described by interpretations of quantum mechanics which invoke the concept of vast numbers of ...

Computational comparison of quantum-mechanical models for multistep direct reactions

International Nuclear Information System (INIS)

Koning, A.J.; Akkermans, J.M.

1993-01-01

We have carried out a computational comparison of all existing quantum-mechanical models for multistep direct (MSD) reactions. The various MSD models, including the so-called Feshbach-Kerman-Koonin, Tamura-Udagawa-Lenske and Nishioka-Yoshida-Weidenmueller models, have been implemented in a single computer system. All model calculations thus use the same set of parameters and the same numerical techniques; only one adjustable parameter is employed. The computational results have been compared with experimental energy spectra and angular distributions for several nuclear reactions, namely, 90 Zr(p,p') at 80 MeV, 209 Bi(p,p') at 62 MeV, and 93 Nb(n,n') at 25.7 MeV. In addition, the results have been compared with the Kalbach systematics and with semiclassical exciton model calculations. All quantum MSD models provide a good fit to the experimental data. In addition, they reproduce the systematics very well and are clearly better than semiclassical model calculations. We furthermore show that the calculated predictions do not differ very strongly between the various quantum MSD models, leading to the conclusion that the simplest MSD model (the Feshbach-Kerman-Koonin model) is adequate for the analysis of experimental data

Quantum Genetic Algorithms for Computer Scientists

Directory of Open Access Journals (Sweden)

Rafael Lahoz-Beltra

2016-10-01

Full Text Available Genetic algorithms (GAs are a class of evolutionary algorithms inspired by Darwinian natural selection. They are popular heuristic optimisation methods based on simulated genetic mechanisms, i.e., mutation, crossover, etc. and population dynamical processes such as reproduction, selection, etc. Over the last decade, the possibility to emulate a quantum computer (a computer using quantum-mechanical phenomena to perform operations on data has led to a new class of GAs known as “Quantum Genetic Algorithms” (QGAs. In this review, we present a discussion, future potential, pros and cons of this new class of GAs. The review will be oriented towards computer scientists interested in QGAs “avoiding” the possible difficulties of quantum-mechanical phenomena.

Computational applications of the many-interacting-worlds interpretation of quantum mechanics.

Science.gov (United States)

Sturniolo, Simone

2018-05-01

While historically many quantum-mechanical simulations of molecular dynamics have relied on the Born-Oppenheimer approximation to separate electronic and nuclear behavior, recently a great deal of interest has arisen in quantum effects in nuclear dynamics as well. Due to the computational difficulty of solving the Schrödinger equation in full, these effects are often treated with approximate methods. In this paper, we present an algorithm to tackle these problems using an extension to the many-interacting-worlds approach to quantum mechanics. This technique uses a kernel function to rebuild the probability density, and therefore, in contrast with the approximation presented in the original paper, it can be naturally extended to n-dimensional systems. This opens up the possibility of performing quantum ground-state searches with steepest-descent methods, and it could potentially lead to real-time quantum molecular-dynamics simulations. The behavior of the algorithm is studied in different potentials and numbers of dimensions and compared both to the original approach and to exact Schrödinger equation solutions whenever possible.

An introduction to quantum computing algorithms

CERN Document Server

Pittenger, Arthur O

2000-01-01

In 1994 Peter Shor [65] published a factoring algorithm for a quantum computer that finds the prime factors of a composite integer N more efficiently than is possible with the known algorithms for a classical com­ puter. Since the difficulty of the factoring problem is crucial for the se­ curity of a public key encryption system, interest (and funding) in quan­ tum computing and quantum computation suddenly blossomed. Quan­ tum computing had arrived. The study of the role of quantum mechanics in the theory of computa­ tion seems to have begun in the early 1980s with the publications of Paul Benioff [6]' [7] who considered a quantum mechanical model of computers and the computation process. A related question was discussed shortly thereafter by Richard Feynman [35] who began from a different perspec­ tive by asking what kind of computer should be used to simulate physics. His analysis led him to the belief that with a suitable class of "quantum machines" one could imitate any quantum system.

Review of quantum computation

International Nuclear Information System (INIS)

Lloyd, S.

1992-01-01

Digital computers are machines that can be programmed to perform logical and arithmetical operations. Contemporary digital computers are ''universal,'' in the sense that a program that runs on one computer can, if properly compiled, run on any other computer that has access to enough memory space and time. Any one universal computer can simulate the operation of any other; and the set of tasks that any such machine can perform is common to all universal machines. Since Bennett's discovery that computation can be carried out in a non-dissipative fashion, a number of Hamiltonian quantum-mechanical systems have been proposed whose time-evolutions over discrete intervals are equivalent to those of specific universal computers. The first quantum-mechanical treatment of computers was given by Benioff, who exhibited a Hamiltonian system with a basis whose members corresponded to the logical states of a Turing machine. In order to make the Hamiltonian local, in the sense that its structure depended only on the part of the computation being performed at that time, Benioff found it necessary to make the Hamiltonian time-dependent. Feynman discovered a way to make the computational Hamiltonian both local and time-independent by incorporating the direction of computation in the initial condition. In Feynman's quantum computer, the program is a carefully prepared wave packet that propagates through different computational states. Deutsch presented a quantum computer that exploits the possibility of existing in a superposition of computational states to perform tasks that a classical computer cannot, such as generating purely random numbers, and carrying out superpositions of computations as a method of parallel processing. In this paper, we show that such computers, by virtue of their common function, possess a common form for their quantum dynamics

Quantum computational webs

International Nuclear Information System (INIS)

Gross, D.; Eisert, J.

2010-01-01

We discuss the notion of quantum computational webs: These are quantum states universal for measurement-based computation, which can be built up from a collection of simple primitives. The primitive elements--reminiscent of building blocks in a construction kit--are (i) one-dimensional states (computational quantum wires) with the power to process one logical qubit and (ii) suitable couplings, which connect the wires to a computationally universal web. All elements are preparable by nearest-neighbor interactions in a single pass, of the kind accessible in a number of physical architectures. We provide a complete classification of qubit wires, a physically well-motivated class of universal resources that can be fully understood. Finally, we sketch possible realizations in superlattices and explore the power of coupling mechanisms based on Ising or exchange interactions.

Quantum Computers: A New Paradigm in Information Technology

Directory of Open Access Journals (Sweden)

Mahesh S. Raisinghani

2001-01-01

Full Text Available The word 'quantum' comes from the Latin word quantus meaning 'how much'. Quantum computing is a fundamentally new mode of information processing that can be performed only by harnessing physical phenomena unique to quantum mechanics (especially quantum interference. Paul Benioff of the Argonne National Laboratory first applied quantum theory to computers in 1981 and David Deutsch of Oxford proposed quantum parallel computers in 1985, years before the realization of qubits in 1995. However, it may be well into the 21st century before we see quantum computing used at a commercial level for a variety of reasons discussed in this paper. The subject of quantum computing brings together ideas from classical information theory, computer science, and quantum physics. This paper discusses some of the current advances, applications, and chal-lenges of quantum computing as well as its impact on corporate computing and implications for management. It shows how quantum computing can be utilized to process and store information, as well as impact cryptography for perfectly secure communication, algorithmic searching, factorizing large numbers very rapidly, and simulating quantum-mechanical systems efficiently. A broad interdisciplinary effort will be needed if quantum com-puters are to fulfill their destiny as the world's fastest computing devices.

Quantum Genetic Algorithms for Computer Scientists

OpenAIRE

Lahoz Beltrá, Rafael

2016-01-01

Genetic algorithms (GAs) are a class of evolutionary algorithms inspired by Darwinian natural selection. They are popular heuristic optimisation methods based on simulated genetic mechanisms, i.e., mutation, crossover, etc. and population dynamical processes such as reproduction, selection, etc. Over the last decade, the possibility to emulate a quantum computer (a computer using quantum-mechanical phenomena to perform operations on data) has led to a new class of GAs known as “Quantum Geneti...

Supersymmetric symplectic quantum mechanics

Science.gov (United States)

de Menezes, Miralvo B.; Fernandes, M. C. B.; Martins, Maria das Graças R.; Santana, A. E.; Vianna, J. D. M.

2018-02-01

Symplectic Quantum Mechanics SQM considers a non-commutative algebra of functions on a phase space Γ and an associated Hilbert space HΓ to construct a unitary representation for the Galilei group. From this unitary representation the Schrödinger equation is rewritten in phase space variables and the Wigner function can be derived without the use of the Liouville-von Neumann equation. In this article we extend the methods of supersymmetric quantum mechanics SUSYQM to SQM. With the purpose of applications in quantum systems, the factorization method of the quantum mechanical formalism is then set within supersymmetric SQM. A hierarchy of simpler hamiltonians is generated leading to new computation tools for solving the eigenvalue problem in SQM. We illustrate the results by computing the states and spectra of the problem of a charged particle in a homogeneous magnetic field as well as the corresponding Wigner function.

Quantum mechanics

International Nuclear Information System (INIS)

Basdevant, J.L.; Dalibard, J.; Joffre, M.

2008-01-01

All physics is quantum from elementary particles to stars and to the big-bang via semi-conductors and chemistry. This theory is very subtle and we are not able to explain it without the help of mathematic tools. This book presents the principles of quantum mechanics and describes its mathematical formalism (wave function, Schroedinger equation, quantum operators, spin, Hamiltonians, collisions,..). We find numerous applications in the fields of new technologies (maser, quantum computer, cryptography,..) and in astrophysics. A series of about 90 exercises with their answers is included. This book is based on a physics course at a graduate level. (A.C.)

Quantum computing with black-box quantum subroutines

Energy Technology Data Exchange (ETDEWEB)

Thompson, Jayne [Centre for Quantum Technologies, National University of Singapore, 3 Science Drive 2, 117543 Singapore (Singapore); Gu, Mile [Center for Quantum Information, Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing (China); Centre for Quantum Technologies, National University of Singapore, 3 Science Drive 2, 117543 Singapore (Singapore); Modi, Kavan [School of Physics, Monash University, Clayton, Victoria 3800 (Australia); Vedral, Vlatko [Department of Physics, University of Oxford, Clarendon Laboratory, Oxford, OX1 3PU (United Kingdom); Centre for Quantum Technologies, National University of Singapore, 3 Science Drive 2, 117543 Singapore (Singapore); Department of Physics, National University of Singapore, 2 Science Drive 3, 117551 Singapore (Singapore)

2014-07-01

In classical computation a subroutine is treated as a black box and we do not need to know its exact physical implementation to use it. A complex problem can be decomposed into smaller problems using such modularity. We show that quantum mechanically applying an unknown quantum process as a subroutine is impossible, and this restricts computation models such as DQC1 from operating on unknown inputs. We present a method to avoid this situation for certain computational problems and apply to a modular version of Shor's factoring algorithm. We examine how quantum entanglement and discord fare in this implementation. In this way we are able to study the role of discord in Shor's factoring algorithm.

Insecurity of quantum secure computations

Science.gov (United States)

Lo, Hoi-Kwong

1997-08-01

It had been widely claimed that quantum mechanics can protect private information during public decision in, for example, the so-called two-party secure computation. If this were the case, quantum smart-cards, storing confidential information accessible only to a proper reader, could prevent fake teller machines from learning the PIN (personal identification number) from the customers' input. Although such optimism has been challenged by the recent surprising discovery of the insecurity of the so-called quantum bit commitment, the security of quantum two-party computation itself remains unaddressed. Here I answer this question directly by showing that all one-sided two-party computations (which allow only one of the two parties to learn the result) are necessarily insecure. As corollaries to my results, quantum one-way oblivious password identification and the so-called quantum one-out-of-two oblivious transfer are impossible. I also construct a class of functions that cannot be computed securely in any two-sided two-party computation. Nevertheless, quantum cryptography remains useful in key distribution and can still provide partial security in ``quantum money'' proposed by Wiesner.

DOE pushes for useful quantum computing

Science.gov (United States)

Cho, Adrian

2018-01-01

The U.S. Department of Energy (DOE) is joining the quest to develop quantum computers, devices that would exploit quantum mechanics to crack problems that overwhelm conventional computers. The initiative comes as Google and other companies race to build a quantum computer that can demonstrate "quantum supremacy" by beating classical computers on a test problem. But reaching that milestone will not mean practical uses are at hand, and the new $40 million DOE effort is intended to spur the development of useful quantum computing algorithms for its work in chemistry, materials science, nuclear physics, and particle physics. With the resources at its 17 national laboratories, DOE could play a key role in developing the machines, researchers say, although finding problems with which quantum computers can help isn't so easy.

Abstract quantum computing machines and quantum computational logics

Science.gov (United States)

Chiara, Maria Luisa Dalla; Giuntini, Roberto; Sergioli, Giuseppe; Leporini, Roberto

2016-06-01

Classical and quantum parallelism are deeply different, although it is sometimes claimed that quantum Turing machines are nothing but special examples of classical probabilistic machines. We introduce the concepts of deterministic state machine, classical probabilistic state machine and quantum state machine. On this basis, we discuss the question: To what extent can quantum state machines be simulated by classical probabilistic state machines? Each state machine is devoted to a single task determined by its program. Real computers, however, behave differently, being able to solve different kinds of problems. This capacity can be modeled, in the quantum case, by the mathematical notion of abstract quantum computing machine, whose different programs determine different quantum state machines. The computations of abstract quantum computing machines can be linguistically described by the formulas of a particular form of quantum logic, termed quantum computational logic.

Quantum Computing

OpenAIRE

Scarani, Valerio

1998-01-01

The aim of this thesis was to explain what quantum computing is. The information for the thesis was gathered from books, scientific publications, and news articles. The analysis of the information revealed that quantum computing can be broken down to three areas: theories behind quantum computing explaining the structure of a quantum computer, known quantum algorithms, and the actual physical realizations of a quantum computer. The thesis reveals that moving from classical memor...

Computing pKa Values with a Mixing Hamiltonian Quantum Mechanical/Molecular Mechanical Approach.

Science.gov (United States)

Liu, Yang; Fan, Xiaoli; Jin, Yingdi; Hu, Xiangqian; Hu, Hao

2013-09-10

Accurate computation of the pKa value of a compound in solution is important but challenging. Here, a new mixing quantum mechanical/molecular mechanical (QM/MM) Hamiltonian method is developed to simulate the free-energy change associated with the protonation/deprotonation processes in solution. The mixing Hamiltonian method is designed for efficient quantum mechanical free-energy simulations by alchemically varying the nuclear potential, i.e., the nuclear charge of the transforming nucleus. In pKa calculation, the charge on the proton is varied in fraction between 0 and 1, corresponding to the fully deprotonated and protonated states, respectively. Inspired by the mixing potential QM/MM free energy simulation method developed previously [H. Hu and W. T. Yang, J. Chem. Phys. 2005, 123, 041102], this method succeeds many advantages of a large class of λ-coupled free-energy simulation methods and the linear combination of atomic potential approach. Theory and technique details of this method, along with the calculation results of the pKa of methanol and methanethiol molecules in aqueous solution, are reported. The results show satisfactory agreement with the experimental data.

A quantum computer only needs one universe

Science.gov (United States)

Steane, A. M.

The nature of quantum computation is discussed. It is argued that, in terms of the amount of information manipulated in a given time, quantum and classical computation are equally efficient. Quantum superposition does not permit quantum computers to "perform many computations simultaneously" except in a highly qualified and to some extent misleading sense. Quantum computation is therefore not well described by interpretations of quantum mechanics which invoke the concept of vast numbers of parallel universes. Rather, entanglement makes available types of computation processes which, while not exponentially larger than classical ones, are unavailable to classical systems. The essence of quantum computation is that it uses entanglement to generate and manipulate a physical representation of the correlations between logical entities, without the need to completely represent the logical entities themselves.

Parallelism in computations in quantum and statistical mechanics

International Nuclear Information System (INIS)

Clementi, E.; Corongiu, G.; Detrich, J.H.

1985-01-01

Often very fundamental biochemical and biophysical problems defy simulations because of limitations in today's computers. We present and discuss a distributed system composed of two IBM 4341 s and/or an IBM 4381 as front-end processors and ten FPS-164 attached array processors. This parallel system - called LCAP - has presently a peak performance of about 110 Mflops; extensions to higher performance are discussed. Presently, the system applications use a modified version of VM/SP as the operating system: description of the modifications is given. Three applications programs have been migrated from sequential to parallel: a molecular quantum mechanical, a Metropolis-Monte Carlo and a molecular dynamics program. Descriptions of the parallel codes are briefly outlined. Use of these parallel codes has already opened up new capabilities for our research. The very positive performance comparisons with today's supercomputers allow us to conclude that parallel computers and programming, of the type we have considered, represent a pragmatic answer to many computationally intensive problems. (orig.)

Quantum Computers: A New Paradigm in Information Technology

OpenAIRE

Mahesh S. Raisinghani

2001-01-01

The word 'quantum' comes from the Latin word quantus meaning 'how much'. Quantum computing is a fundamentally new mode of information processing that can be performed only by harnessing physical phenomena unique to quantum mechanics (especially quantum interference). Paul Benioff of the Argonne National Laboratory first applied quantum theory to computers in 1981 and David Deutsch of Oxford proposed quantum parallel computers in 1985, years before the realization of qubits in 1995. However, i...

Diamond NV centers for quantum computing and quantum networks

NARCIS (Netherlands)

Childress, L.; Hanson, R.

2013-01-01

The exotic features of quantum mechanics have the potential to revolutionize information technologies. Using superposition and entanglement, a quantum processor could efficiently tackle problems inaccessible to current-day computers. Nonlocal correlations may be exploited for intrinsically secure

Experimental quantum computing without entanglement.

Science.gov (United States)

Lanyon, B P; Barbieri, M; Almeida, M P; White, A G

2008-11-14

Deterministic quantum computation with one pure qubit (DQC1) is an efficient model of computation that uses highly mixed states. Unlike pure-state models, its power is not derived from the generation of a large amount of entanglement. Instead it has been proposed that other nonclassical correlations are responsible for the computational speedup, and that these can be captured by the quantum discord. In this Letter we implement DQC1 in an all-optical architecture, and experimentally observe the generated correlations. We find no entanglement, but large amounts of quantum discord-except in three cases where an efficient classical simulation is always possible. Our results show that even fully separable, highly mixed, states can contain intrinsically quantum mechanical correlations and that these could offer a valuable resource for quantum information technologies.

Contextuality supplies the 'magic' for quantum computation.

Science.gov (United States)

Howard, Mark; Wallman, Joel; Veitch, Victor; Emerson, Joseph

2014-06-19

Quantum computers promise dramatic advantages over their classical counterparts, but the source of the power in quantum computing has remained elusive. Here we prove a remarkable equivalence between the onset of contextuality and the possibility of universal quantum computation via 'magic state' distillation, which is the leading model for experimentally realizing a fault-tolerant quantum computer. This is a conceptually satisfying link, because contextuality, which precludes a simple 'hidden variable' model of quantum mechanics, provides one of the fundamental characterizations of uniquely quantum phenomena. Furthermore, this connection suggests a unifying paradigm for the resources of quantum information: the non-locality of quantum theory is a particular kind of contextuality, and non-locality is already known to be a critical resource for achieving advantages with quantum communication. In addition to clarifying these fundamental issues, this work advances the resource framework for quantum computation, which has a number of practical applications, such as characterizing the efficiency and trade-offs between distinct theoretical and experimental schemes for achieving robust quantum computation, and putting bounds on the overhead cost for the classical simulation of quantum algorithms.

Quantum mechanics and quantum information a guide through the quantum world

CERN Document Server

Fayngold, Moses

2013-01-01

Alongside a thorough definition of the basic concepts and their interrelations, backed by numerous examples, this textbook features a rare discussion of the quantum information theory. It also deals with other important topics hardly found in the literature, including the Robertson-Schrodinger-relation, angle and angular momentum uncertainties, interaction-free measurements, and the limitations of the no-cloning theorem With its interpretations of quantum mechanics and its discussions of quantum computing, this book is poised to become the standard textbook for advanced undergraduate and beginning graduate quantum mechanics courses and as an essential reference for physics students and physics professionals.

Parallel quantum computing in a single ensemble quantum computer

International Nuclear Information System (INIS)

Long Guilu; Xiao, L.

2004-01-01

We propose a parallel quantum computing mode for ensemble quantum computer. In this mode, some qubits are in pure states while other qubits are in mixed states. It enables a single ensemble quantum computer to perform 'single-instruction-multidata' type of parallel computation. Parallel quantum computing can provide additional speedup in Grover's algorithm and Shor's algorithm. In addition, it also makes a fuller use of qubit resources in an ensemble quantum computer. As a result, some qubits discarded in the preparation of an effective pure state in the Schulman-Varizani and the Cleve-DiVincenzo algorithms can be reutilized

Embracing the quantum limit in silicon computing.

Science.gov (United States)

Morton, John J L; McCamey, Dane R; Eriksson, Mark A; Lyon, Stephen A

2011-11-16

Quantum computers hold the promise of massive performance enhancements across a range of applications, from cryptography and databases to revolutionary scientific simulation tools. Such computers would make use of the same quantum mechanical phenomena that pose limitations on the continued shrinking of conventional information processing devices. Many of the key requirements for quantum computing differ markedly from those of conventional computers. However, silicon, which plays a central part in conventional information processing, has many properties that make it a superb platform around which to build a quantum computer. © 2011 Macmillan Publishers Limited. All rights reserved

Quantum analogue computing.

Science.gov (United States)

Kendon, Vivien M; Nemoto, Kae; Munro, William J

2010-08-13

We briefly review what a quantum computer is, what it promises to do for us and why it is so hard to build one. Among the first applications anticipated to bear fruit is the quantum simulation of quantum systems. While most quantum computation is an extension of classical digital computation, quantum simulation differs fundamentally in how the data are encoded in the quantum computer. To perform a quantum simulation, the Hilbert space of the system to be simulated is mapped directly onto the Hilbert space of the (logical) qubits in the quantum computer. This type of direct correspondence is how data are encoded in a classical analogue computer. There is no binary encoding, and increasing precision becomes exponentially costly: an extra bit of precision doubles the size of the computer. This has important consequences for both the precision and error-correction requirements of quantum simulation, and significant open questions remain about its practicality. It also means that the quantum version of analogue computers, continuous-variable quantum computers, becomes an equally efficient architecture for quantum simulation. Lessons from past use of classical analogue computers can help us to build better quantum simulators in future.

Progress in post-quantum mechanics

Science.gov (United States)

Sarfatti, Jack

2017-05-01

Newton's mechanics in the 17th century increased the lethality of artillery. Thermodynamics in the 19th led to the steam-powered industrial revolution. Maxwell's unification of electricity, magnetism and light gave us electrical power, the telegraph, radio and television. The discovery of quantum mechanics in the 20th century by Planck, Bohr, Einstein, Schrodinger, Heisenberg led to the creation of the atomic and hydrogen bombs as well as computer chips, the world-wide-web and Silicon Valley's multibillion dollar corporations. The lesson is that breakthroughs in fundamental physics, both theoretical and experimental, have always led to profound technological wealth-creating industries and will continue to do so. There is now a new revolution brewing in quantum mechanics that can be divided into three periods. The first quantum revolution was from 1900 to about 1975. The second quantum information/computer revolution was from about 1975 to 2015. (The early part of this story is told by Kaiser in his book, How the Hippies Saved Physics, how a small group of Berkeley/San Francisco physicists triggered that second revolution.) The third quantum revolution is how an extension of quantum mechanics may lead to the understanding of consciousness as a natural physical phenomenon that can emerge in many material substrates, not only in our carbon-based biochemistry. In particular, this new post-quantum mechanics may lead to naturally conscious artificial intelligence in nano-electronic machines, as well as perhaps extending human life spans to hundreds of years and more.

Quantum information. Teleporation - cryptography - quantum computer

International Nuclear Information System (INIS)

Breuer, Reinhard

2010-01-01

The following topics are dealt with: Reality in the test house, quantum teleportation, 100 years of quantum theory, the reality of quanta, interactionless quantum measurement, rules for quantum computers, quantum computers with ions, spintronics with diamond, the limits of the quantum computers, a view into the future of quantum optics. (HSI)

Quantum Computing for Computer Architects

CERN Document Server

Metodi, Tzvetan

2011-01-01

Quantum computers can (in theory) solve certain problems far faster than a classical computer running any known classical algorithm. While existing technologies for building quantum computers are in their infancy, it is not too early to consider their scalability and reliability in the context of the design of large-scale quantum computers. To architect such systems, one must understand what it takes to design and model a balanced, fault-tolerant quantum computer architecture. The goal of this lecture is to provide architectural abstractions for the design of a quantum computer and to explore

Quantum Computers and Quantum Computer Languages: Quantum Assembly Language and Quantum C

OpenAIRE

Blaha, Stephen

2002-01-01

We show a representation of Quantum Computers defines Quantum Turing Machines with associated Quantum Grammars. We then create examples of Quantum Grammars. Lastly we develop an algebraic approach to high level Quantum Languages using Quantum Assembly language and Quantum C language as examples.

Emergent quantum mechanics without wavefunctions

Science.gov (United States)

Mesa Pascasio, J.; Fussy, S.; Schwabl, H.; Grössing, G.

2016-03-01

We present our model of an Emergent Quantum Mechanics which can be characterized by “realism without pre-determination”. This is illustrated by our analytic description and corresponding computer simulations of Bohmian-like “surreal” trajectories, which are obtained classically, i.e. without the use of any quantum mechanical tool such as wavefunctions. However, these trajectories do not necessarily represent ontological paths of particles but rather mappings of the probability density flux in a hydrodynamical sense. Modelling emergent quantum mechanics in a high-low intesity double slit scenario gives rise to the “quantum sweeper effect” with a characteristic intensity pattern. This phenomenon should be experimentally testable via weak measurement techniques.

Quantum information. Teleportation - cryptography - quantum computer

International Nuclear Information System (INIS)

Koenneker, Carsten

2012-01-01

The following topics are dealt with: Reality in the test facility, quantum teleportation, the reality of quanta, interaction-free quantum measurement, rules for quantum computers, quantum computers with ions, spintronics with diamond, the limits of the quantum computers, a view in the future of quantum optics. (HSI)

Pseudo-Hermitian Representation of Quantum Mechanics

International Nuclear Information System (INIS)

Mustafazade, A.

2008-01-01

I will outline a formulation of quantum mechanics in which the inner product on the Hilbert space of a quantum system is treated as a degree of freedom. I will outline some of the basic mathematical and conceptual features of the resulting theory and discuss some of its applications. In particular, I will present a quantum mechanical analogue of Einstein's field equations that links the inner product of the Hilbert space and the Hamiltonian of the system and discuss how the resulting theory can be used to address a variety of problems in classical electrodynamics, relativistic quantum mechanics, and quantum computation

Quantum Computation and Quantum Spin Dynamics

NARCIS (Netherlands)

Raedt, Hans De; Michielsen, Kristel; Hams, Anthony; Miyashita, Seiji; Saito, Keiji

2001-01-01

We analyze the stability of quantum computations on physically realizable quantum computers by simulating quantum spin models representing quantum computer hardware. Examples of logically identical implementations of the controlled-NOT operation are used to demonstrate that the results of a quantum

Quantum computation

International Nuclear Information System (INIS)

Deutsch, D.

1992-01-01

As computers become ever more complex, they inevitably become smaller. This leads to a need for components which are fabricated and operate on increasingly smaller size scales. Quantum theory is already taken into account in microelectronics design. This article explores how quantum theory will need to be incorporated into computers in future in order to give them their components functionality. Computation tasks which depend on quantum effects will become possible. Physicists may have to reconsider their perspective on computation in the light of understanding developed in connection with universal quantum computers. (UK)

Quantum mechanics from classical statistics

International Nuclear Information System (INIS)

Wetterich, C.

2010-01-01

Quantum mechanics can emerge from classical statistics. A typical quantum system describes an isolated subsystem of a classical statistical ensemble with infinitely many classical states. The state of this subsystem can be characterized by only a few probabilistic observables. Their expectation values define a density matrix if they obey a 'purity constraint'. Then all the usual laws of quantum mechanics follow, including Heisenberg's uncertainty relation, entanglement and a violation of Bell's inequalities. No concepts beyond classical statistics are needed for quantum physics - the differences are only apparent and result from the particularities of those classical statistical systems which admit a quantum mechanical description. Born's rule for quantum mechanical probabilities follows from the probability concept for a classical statistical ensemble. In particular, we show how the non-commuting properties of quantum operators are associated to the use of conditional probabilities within the classical system, and how a unitary time evolution reflects the isolation of the subsystem. As an illustration, we discuss a classical statistical implementation of a quantum computer.

The potential of the quantum computer

CERN Multimedia

2006-01-01

The Physics Section of the University of Geneva is continuing its series of lectures, open to the general public, on the most recent developments in the field of physics. The next lecture, given by Professor Michel Devoret of Yale University in the United States, will be on the potential of the quantum computer. The quantum computer is, as yet, a hypothetical machine which would operate on the basic principles of quantum mechanics. Compared to standard computers, it represents a significant gain in computing power for certain complex calculations. Quantum operations can simultaneously explore a very large number of possibilities. The correction of quantum errors, which until recently had been deemed impossible, has now become a well-established technique. Several prototypes for, as yet, very simple quantum processors have been developed. The lecture will begin with a demonstration in the auditorium of the detection of cosmic rays and, in collaboration with Professor E. Ellberger of the Conservatoire de M...

Blind Quantum Signature with Blind Quantum Computation

Science.gov (United States)

Li, Wei; Shi, Ronghua; Guo, Ying

2017-04-01

Blind quantum computation allows a client without quantum abilities to interact with a quantum server to perform a unconditional secure computing protocol, while protecting client's privacy. Motivated by confidentiality of blind quantum computation, a blind quantum signature scheme is designed with laconic structure. Different from the traditional signature schemes, the signing and verifying operations are performed through measurement-based quantum computation. Inputs of blind quantum computation are securely controlled with multi-qubit entangled states. The unique signature of the transmitted message is generated by the signer without leaking information in imperfect channels. Whereas, the receiver can verify the validity of the signature using the quantum matching algorithm. The security is guaranteed by entanglement of quantum system for blind quantum computation. It provides a potential practical application for e-commerce in the cloud computing and first-generation quantum computation.

Quantum simulations with noisy quantum computers

Science.gov (United States)

Gambetta, Jay

Quantum computing is a new computational paradigm that is expected to lie beyond the standard model of computation. This implies a quantum computer can solve problems that can't be solved by a conventional computer with tractable overhead. To fully harness this power we need a universal fault-tolerant quantum computer. However the overhead in building such a machine is high and a full solution appears to be many years away. Nevertheless, we believe that we can build machines in the near term that cannot be emulated by a conventional computer. It is then interesting to ask what these can be used for. In this talk we will present our advances in simulating complex quantum systems with noisy quantum computers. We will show experimental implementations of this on some small quantum computers.

Emergent quantum mechanics without wavefunctions

International Nuclear Information System (INIS)

Pascasio, J Mesa; Fussy, S; Schwabl, H; Grössing, G

2016-01-01

We present our model of an Emergent Quantum Mechanics which can be characterized by “realism without pre-determination”. This is illustrated by our analytic description and corresponding computer simulations of Bohmian-like “surreal” trajectories, which are obtained classically, i.e. without the use of any quantum mechanical tool such as wavefunctions. However, these trajectories do not necessarily represent ontological paths of particles but rather mappings of the probability density flux in a hydrodynamical sense. Modelling emergent quantum mechanics in a high-low intesity double slit scenario gives rise to the “quantum sweeper effect” with a characteristic intensity pattern. This phenomenon should be experimentally testable via weak measurement techniques. (paper)

Quantum Computers and Quantum Computer Languages: Quantum Assembly Language and Quantum C Language

OpenAIRE

Blaha, Stephen

2002-01-01

We show a representation of Quantum Computers defines Quantum Turing Machines with associated Quantum Grammars. We then create examples of Quantum Grammars. Lastly we develop an algebraic approach to high level Quantum Languages using Quantum Assembly language and Quantum C language as examples.

Quantum walk computation

International Nuclear Information System (INIS)

Kendon, Viv

2014-01-01

Quantum versions of random walks have diverse applications that are motivating experimental implementations as well as theoretical studies. Recent results showing quantum walks are “universal for quantum computation” relate to algorithms, to be run on quantum computers. We consider whether an experimental implementation of a quantum walk could provide useful computation before we have a universal quantum computer

Universal quantum computation by discontinuous quantum walk

International Nuclear Information System (INIS)

Underwood, Michael S.; Feder, David L.

2010-01-01

Quantum walks are the quantum-mechanical analog of random walks, in which a quantum ''walker'' evolves between initial and final states by traversing the edges of a graph, either in discrete steps from node to node or via continuous evolution under the Hamiltonian furnished by the adjacency matrix of the graph. We present a hybrid scheme for universal quantum computation in which a quantum walker takes discrete steps of continuous evolution. This ''discontinuous'' quantum walk employs perfect quantum-state transfer between two nodes of specific subgraphs chosen to implement a universal gate set, thereby ensuring unitary evolution without requiring the introduction of an ancillary coin space. The run time is linear in the number of simulated qubits and gates. The scheme allows multiple runs of the algorithm to be executed almost simultaneously by starting walkers one time step apart.

Application of Blind Quantum Computation to Two-Party Quantum Computation

Science.gov (United States)

Sun, Zhiyuan; Li, Qin; Yu, Fang; Chan, Wai Hong

2018-03-01

Blind quantum computation (BQC) allows a client who has only limited quantum power to achieve quantum computation with the help of a remote quantum server and still keep the client's input, output, and algorithm private. Recently, Kashefi and Wallden extended BQC to achieve two-party quantum computation which allows two parties Alice and Bob to perform a joint unitary transform upon their inputs. However, in their protocol Alice has to prepare rotated single qubits and perform Pauli operations, and Bob needs to have a powerful quantum computer. In this work, we also utilize the idea of BQC to put forward an improved two-party quantum computation protocol in which the operations of both Alice and Bob are simplified since Alice only needs to apply Pauli operations and Bob is just required to prepare and encrypt his input qubits.

Application of Blind Quantum Computation to Two-Party Quantum Computation

Science.gov (United States)

Sun, Zhiyuan; Li, Qin; Yu, Fang; Chan, Wai Hong

2018-06-01

Blind quantum computation (BQC) allows a client who has only limited quantum power to achieve quantum computation with the help of a remote quantum server and still keep the client's input, output, and algorithm private. Recently, Kashefi and Wallden extended BQC to achieve two-party quantum computation which allows two parties Alice and Bob to perform a joint unitary transform upon their inputs. However, in their protocol Alice has to prepare rotated single qubits and perform Pauli operations, and Bob needs to have a powerful quantum computer. In this work, we also utilize the idea of BQC to put forward an improved two-party quantum computation protocol in which the operations of both Alice and Bob are simplified since Alice only needs to apply Pauli operations and Bob is just required to prepare and encrypt his input qubits.

On the Completeness of Quantum Mechanics

OpenAIRE

Kupczynski, Marian

2002-01-01

Quantum cryptography, quantum computer project, space-time quantization program and recent computer experiments reported by Accardi and his collaborators show the importance and actuality of the discussion of the completeness of quantum mechanics (QM) started by Einstein more than 70 years ago. Many years ago we pointed out that the violation of Bell's inequalities is neither a proof of completeness of QM nor an indication of the violation of Einsteinian causality. We also indicated how and i...

A relational solution to the problem of time in quantum mechanics and quantum gravity: a fundamental mechanism for quantum decoherence

International Nuclear Information System (INIS)

Gambini, Rodolfo; Porto, Rafael A; Pullin, Jorge

2004-01-01

The use of a relational time in quantum mechanics is a framework in which one promotes to quantum operators all variables in a system, and later chooses one of the variables to operate like a 'clock'. Conditional probabilities are computed for variables of the system to take certain values when the 'clock' specifies a certain time. This framework is attractive in contexts where the assumption of usual quantum mechanics of the existence of an external, perfectly classical clock, appears unnatural, as in quantum cosmology. Until recently, there were problems with such constructions in ordinary quantum mechanics with additional difficulties in the context of constrained theories like general relativity. A scheme we recently introduced to consistently discretize general relativity removed such obstacles. Since the clock is now an object subject to quantum fluctuations, the resulting evolution in time is not exactly unitary and pure states decohere into mixed states. Here we work out in detail the type of decoherence generated, and we find it to be of Lindblad type. This is attractive since it implies that one can have loss of coherence without violating the conservation of energy. We apply the framework to a simple cosmological model to illustrate how a quantitative estimate of the effect could be computed. For most quantum systems it appears to be too small to be observed, although certain macroscopic quantum systems could in the future provide a testing ground for experimental observation

Enriching Elementary Quantum Mechanics with the Computer: Self-Consistent Field Problems in One Dimension

Science.gov (United States)

Bolemon, Jay S.; Etzold, David J.

1974-01-01

Discusses the use of a small computer to solve self-consistent field problems of one-dimensional systems of two or more interacting particles in an elementary quantum mechanics course. Indicates that the calculation can serve as a useful introduction to the iterative technique. (CC)

Communication: Quantum mechanics without wavefunctions

Energy Technology Data Exchange (ETDEWEB)

Schiff, Jeremy [Department of Mathematics, Bar-Ilan University, Ramat Gan 52900 (Israel); Poirier, Bill [Department of Chemistry and Biochemistry, Texas Tech University, Box 41061, Lubbock, Texas 79409-1061 (United States) and Department of Physics, Texas Tech University, Box 41051, Lubbock, Texas 79409-1051 (United States)

2012-01-21

We present a self-contained formulation of spin-free non-relativistic quantum mechanics that makes no use of wavefunctions or complex amplitudes of any kind. Quantum states are represented as ensembles of real-valued quantum trajectories, obtained by extremizing an action and satisfying energy conservation. The theory applies for arbitrary configuration spaces and system dimensionalities. Various beneficial ramifications--theoretical, computational, and interpretational--are discussed.

Communication: Quantum mechanics without wavefunctions

International Nuclear Information System (INIS)

Schiff, Jeremy; Poirier, Bill

2012-01-01

We present a self-contained formulation of spin-free non-relativistic quantum mechanics that makes no use of wavefunctions or complex amplitudes of any kind. Quantum states are represented as ensembles of real-valued quantum trajectories, obtained by extremizing an action and satisfying energy conservation. The theory applies for arbitrary configuration spaces and system dimensionalities. Various beneficial ramifications--theoretical, computational, and interpretational--are discussed.

Lectures on quantum mechanics

CERN Document Server

Weinberg, Steven

2013-01-01

Nobel Laureate Steven Weinberg combines his exceptional physical insight with his gift for clear exposition to provide a concise introduction to modern quantum mechanics. Ideally suited to a one-year graduate course, this textbook is also a useful reference for researchers. Readers are introduced to the subject through a review of the history of quantum mechanics and an account of classic solutions of the Schrödinger equation, before quantum mechanics is developed in a modern Hilbert space approach. The textbook covers many topics not often found in other books on the subject, including alternatives to the Copenhagen interpretation, Bloch waves and band structure, the Wigner–Eckart theorem, magic numbers, isospin symmetry, the Dirac theory of constrained canonical systems, general scattering theory, the optical theorem, the 'in-in' formalism, the Berry phase, Landau levels, entanglement and quantum computing. Problems are included at the ends of chapters, with solutions available for instructors at www.cam...

Quantum Walks for Computer Scientists

CERN Document Server

Venegas-Andraca, Salvador

2008-01-01

Quantum computation, one of the latest joint ventures between physics and the theory of computation, is a scientific field whose main goals include the development of hardware and algorithms based on the quantum mechanical properties of those physical systems used to implement such algorithms. Solving difficult tasks (for example, the Satisfiability Problem and other NP-complete problems) requires the development of sophisticated algorithms, many of which employ stochastic processes as their mathematical basis. Discrete random walks are a popular choice among those stochastic processes. Inspir

Quantum Computing's Classical Problem, Classical Computing's Quantum Problem

OpenAIRE

Van Meter, Rodney

2013-01-01

Tasked with the challenge to build better and better computers, quantum computing and classical computing face the same conundrum: the success of classical computing systems. Small quantum computing systems have been demonstrated, and intermediate-scale systems are on the horizon, capable of calculating numeric results or simulating physical systems far beyond what humans can do by hand. However, to be commercially viable, they must surpass what our wildly successful, highly advanced classica...

Quantum mechanics

International Nuclear Information System (INIS)

Anon.

1990-01-01

The book is on quantum mechanics. The emphasis is on the basic concepts and the methodology. The chapters include: Breakdown of classical concepts; Quantum mechanical concepts; Basic postulates of quantum mechanics; solution of problems in quantum mechanics; Simple harmonic oscillator; and Angular Momentum

Secure Multiparty Quantum Computation for Summation and Multiplication.

Science.gov (United States)

Shi, Run-hua; Mu, Yi; Zhong, Hong; Cui, Jie; Zhang, Shun

2016-01-21

As a fundamental primitive, Secure Multiparty Summation and Multiplication can be used to build complex secure protocols for other multiparty computations, specially, numerical computations. However, there is still lack of systematical and efficient quantum methods to compute Secure Multiparty Summation and Multiplication. In this paper, we present a novel and efficient quantum approach to securely compute the summation and multiplication of multiparty private inputs, respectively. Compared to classical solutions, our proposed approach can ensure the unconditional security and the perfect privacy protection based on the physical principle of quantum mechanics.

Quantum Computing

Indian Academy of Sciences (India)

In the first part of this article, we had looked at how quantum physics can be harnessed to make the building blocks of a quantum computer. In this concluding part, we look at algorithms which can exploit the power of this computational device, and some practical difficulties in building such a device. Quantum Algorithms.

Quantum computation and simulation with trapped ions using dissipation

International Nuclear Information System (INIS)

Schindler, P.

2013-01-01

Quantum information processing combines two of the most successful and fascinating ideas of the 20th century - quantum physics and computer science. A quantum computer promises to solve certain problems more efficient than classical computers. But building such a quantum computer is a cumbersome task as the quantum system needs to be manipulated with tremendous accuracy while being well shielded from the classical environment to preserve its quantum nature. An unwanted coupling to the surrounding environment manifests itself in computational errors. This coupling can be suppressed with the aid of quantum error correction schemes that are still a mainly theoretical construct. These error correcting protocols can only protect the information if they are applied multiple times subsequently. For this, it is necessary to remove the information about previous errors from the quantum system before performing the actual correction. However, this removal of information requires a controlled coupling to the environment which is beyond the standard set of operations available in a quantum computer. In this work, an experimental realization of repetitive quantum error correction in an ion-trap quantum information processor is presented, performing up to three consecutive rounds of correction. Moreover such an error correction algorithm can also be used to demonstrate a physical connection between information processing and quantum mechanics - computational errors are mapped onto quantum mechanical measurements. Therefore, a quantum error correction protocol is able to undo quantum measurements - a task that seemingly contradicts the foundations of quantum physics. In this work, we show that it is indeed possible to undo a partial measurement on a quantum register using an error correction protocol. After closer inspection it becomes obvious this does not violate the laws of quantum mechanics. However, the realization of a large-scale quantum computer lies in the far future as

Quantum Computer Games: Schrodinger Cat and Hounds

Science.gov (United States)

Gordon, Michal; Gordon, Goren

2012-01-01

The quantum computer game "Schrodinger cat and hounds" is the quantum extension of the well-known classical game fox and hounds. Its main objective is to teach the unique concepts of quantum mechanics in a fun way. "Schrodinger cat and hounds" demonstrates the effects of superposition, destructive and constructive interference, measurements and…

Quantum mechanics over sets

Science.gov (United States)

Ellerman, David

2014-03-01

In models of QM over finite fields (e.g., Schumacher's ``modal quantum theory'' MQT), one finite field stands out, Z2, since Z2 vectors represent sets. QM (finite-dimensional) mathematics can be transported to sets resulting in quantum mechanics over sets or QM/sets. This gives a full probability calculus (unlike MQT with only zero-one modalities) that leads to a fulsome theory of QM/sets including ``logical'' models of the double-slit experiment, Bell's Theorem, QIT, and QC. In QC over Z2 (where gates are non-singular matrices as in MQT), a simple quantum algorithm (one gate plus one function evaluation) solves the Parity SAT problem (finding the parity of the sum of all values of an n-ary Boolean function). Classically, the Parity SAT problem requires 2n function evaluations in contrast to the one function evaluation required in the quantum algorithm. This is quantum speedup but with all the calculations over Z2 just like classical computing. This shows definitively that the source of quantum speedup is not in the greater power of computing over the complex numbers, and confirms the idea that the source is in superposition.

Geometric phases and quantum computation

International Nuclear Information System (INIS)

Vedral, V.

2005-01-01

Full text: In my lectures I will talk about the notion of the geometric phase and explain its relevance for both fundamental quantum mechanics as well as quantum computation. The phase will be at first introduced via the idea of Pancharatnam which involves interference of three or more light beams. This notion will then be generalized to the evolving quantum systems. I will discuss both pure and mixed states as well as unitary and non-unitary evolutions. I will also show how the concept of the vacuum induced geometric phase arises in quantum optics. A simple measurement scheme involving a Mach Zehnder interferometer will be presented and will be used to illustrate all the concepts in the lecture. Finally, I will expose a simple generalization of the geometric phase to evolving degenerate states. This will be seen to lead to the possibility of universal quantum computation using geometric effects only. Moreover, this contains a promise of intrinsically fault tolerant quantum information processing, whose prospects will be outlined at the end of the lecture. (author)

Interfacing external quantum devices to a universal quantum computer.

Directory of Open Access Journals (Sweden)

Antonio A Lagana

Full Text Available We present a scheme to use external quantum devices using the universal quantum computer previously constructed. We thereby show how the universal quantum computer can utilize networked quantum information resources to carry out local computations. Such information may come from specialized quantum devices or even from remote universal quantum computers. We show how to accomplish this by devising universal quantum computer programs that implement well known oracle based quantum algorithms, namely the Deutsch, Deutsch-Jozsa, and the Grover algorithms using external black-box quantum oracle devices. In the process, we demonstrate a method to map existing quantum algorithms onto the universal quantum computer.

Experimental all-optical one-way quantum computing

International Nuclear Information System (INIS)

Prevedel, R.

2009-01-01

In recent years, the relatively new field of quantum information processing (QIP) has attracted the attention of many scientists around the world due to its promise of increased computational speed, absolute secure communication and the potential to simulate complex quantum mechanical systems. The very essence of this new quantum information technology are two concepts at the very heart of quantum mechanics, namely superposition and entanglement. The present Thesis contains the results of four different experiments that were all aimed at the demonstration of an entirely new model for quantum computing with linear optics, the 'one-way' quantum computer. For this purpose a multi-photon entangled state of four photons has been generated via the process of spontaneous parametric down-conversion and by using an interferometric setup. This entangled state acts as a resource that allowed for novel demonstrations of quantum algorithms and relevant experimental techniques. By exploiting the advances developed in both theory and experiment, in this Thesis we report the implementation of fast, active feed-forward that allowed, for the first time, the realization of deterministic linear optics quantum computing at an unprecedented speed. Further we were able to demonstrate the Deutsch algorithm on our one-way quantum computer, an important quantum algorithm that is capable of distinguishing whether a function is constant or balanced. Classically one needs to query the algorithm at least 2N/2 + 1 times for an N-bit binary input string, however, in the quantum regime, this can be done with one evaluation of the algorithm, independent of the size of the input. In another experiment we succeeded in playing an instance of a quantum game - the so-called Prisoner's dilemma - on our one-way quantum computer. Playing such a game is essentially the execution of a quantum algorithm made up of a distinct set of one- and two-qubit gates. This allows the individual players to increase their

Relativistic quantum chemistry on quantum computers

DEFF Research Database (Denmark)

Veis, L.; Visnak, J.; Fleig, T.

2012-01-01

The past few years have witnessed a remarkable interest in the application of quantum computing for solving problems in quantum chemistry more efficiently than classical computers allow. Very recently, proof-of-principle experimental realizations have been reported. However, so far only...... the nonrelativistic regime (i.e., the Schrodinger equation) has been explored, while it is well known that relativistic effects can be very important in chemistry. We present a quantum algorithm for relativistic computations of molecular energies. We show how to efficiently solve the eigenproblem of the Dirac......-Coulomb Hamiltonian on a quantum computer and demonstrate the functionality of the proposed procedure by numerical simulations of computations of the spin-orbit splitting in the SbH molecule. Finally, we propose quantum circuits with three qubits and nine or ten controlled-NOT (CNOT) gates, which implement a proof...

Moessbauer neutrinos in quantum mechanics and quantum field theory

International Nuclear Information System (INIS)

Kopp, Joachim

2009-01-01

We demonstrate the correspondence between quantum mechanical and quantum field theoretical descriptions of Moessbauer neutrino oscillations. First, we compute the combined rate Γ of Moessbauer neutrino emission, propagation, and detection in quantum field theory, treating the neutrino as an internal line of a tree level Feynman diagram. We include explicitly the effect of homogeneous line broadening due to fluctuating electromagnetic fields in the source and detector crystals and show that the resulting formula for Γ is identical to the one obtained previously [1] for the case of inhomogeneous line broadening. We then proceed to a quantum mechanical treatment of Moessbauer neutrinos and show that the oscillation, coherence, and resonance terms from the field theoretical result can be reproduced if the neutrino is described as a superposition of Lorentz-shaped wave packet with appropriately chosen energies and widths. On the other hand, the emission rate and the detection cross section, including localization and Lamb-Moessbauer terms, cannot be predicted in quantum mechanics and have to be put in by hand.

Quantum mechanics a modern development

CERN Document Server

Ballentine, Leslie E

2015-01-01

Although there are many textbooks that deal with the formal apparatus of quantum mechanics (QM) and its application to standard problems, none take into account the developments in the foundations of the subject which have taken place in the last few decades. There are specialized treatises on various aspects of the foundations of QM, but none that integrate those topics with the standard material. This book aims to remove that unfortunate dichotomy, which has divorced the practical aspects of the subject from the interpretation and broader implications of the theory. In this edition a new chapter on quantum information is added. As the topic is still in a state of rapid development, a comprehensive treatment is not feasible. The emphasis is on the fundamental principles and some key applications, including quantum cryptography, teleportation of states, and quantum computing. The impact of quantum information theory on the foundations of quantum mechanics is discussed. In addition, there are minor revisions ...

Quantum computer science

CERN Document Server

Lanzagorta, Marco

2009-01-01

In this text we present a technical overview of the emerging field of quantum computation along with new research results by the authors. What distinguishes our presentation from that of others is our focus on the relationship between quantum computation and computer science. Specifically, our emphasis is on the computational model of quantum computing rather than on the engineering issues associated with its physical implementation. We adopt this approach for the same reason that a book on computer programming doesn't cover the theory and physical realization of semiconductors. Another distin

Physics of quantum computation

International Nuclear Information System (INIS)

Belokurov, V.V.; Khrustalev, O.A.; Sadovnichij, V.A.; Timofeevskaya, O.D.

2003-01-01

In the paper, the modern status of the theory of quantum computation is considered. The fundamental principles of quantum computers and their basic notions such as quantum processors and computational basis states of the quantum Turing machine as well as the quantum Fourier transform are discussed. Some possible experimental realizations on the basis of NMR methods are given

Quantum Computing: a Quantum Group Approach

OpenAIRE

Wang, Zhenghan

2013-01-01

There is compelling theoretical evidence that quantum physics will change the face of information science. Exciting progress has been made during the last two decades towards the building of a large scale quantum computer. A quantum group approach stands out as a promising route to this holy grail, and provides hope that we may have quantum computers in our future.

A novel quantum scheme for secure two-party distance computation

Science.gov (United States)

Peng, Zhen-wan; Shi, Run-hua; Zhong, Hong; Cui, Jie; Zhang, Shun

2017-12-01

Secure multiparty computational geometry is an essential field of secure multiparty computation, which computes a computation geometric problem without revealing any private information of each party. Secure two-party distance computation is a primitive of secure multiparty computational geometry, which computes the distance between two points without revealing each point's location information (i.e., coordinate). Secure two-party distance computation has potential applications with high secure requirements in military, business, engineering and so on. In this paper, we present a quantum solution to secure two-party distance computation by subtly using quantum private query. Compared to the classical related protocols, our quantum protocol can ensure higher security and better privacy protection because of the physical principle of quantum mechanics.

Quantum Computer Science

Science.gov (United States)

Mermin, N. David

2007-08-01

Preface; 1. Cbits and Qbits; 2. General features and some simple examples; 3. Breaking RSA encryption with a quantum computer; 4. Searching with a quantum computer; 5. Quantum error correction; 6. Protocols that use just a few Qbits; Appendices; Index.

Quantum Computing

Indian Academy of Sciences (India)

Home; Journals; Resonance – Journal of Science Education; Volume 5; Issue 9. Quantum Computing - Building Blocks of a Quantum Computer. C S Vijay Vishal Gupta. General Article Volume 5 Issue 9 September 2000 pp 69-81. Fulltext. Click here to view fulltext PDF. Permanent link:

Introduction to topological quantum matter & quantum computation

CERN Document Server

Stanescu, Tudor D

2017-01-01

What is -topological- about topological quantum states? How many types of topological quantum phases are there? What is a zero-energy Majorana mode, how can it be realized in a solid state system, and how can it be used as a platform for topological quantum computation? What is quantum computation and what makes it different from classical computation? Addressing these and other related questions, Introduction to Topological Quantum Matter & Quantum Computation provides an introduction to and a synthesis of a fascinating and rapidly expanding research field emerging at the crossroads of condensed matter physics, mathematics, and computer science. Providing the big picture, this book is ideal for graduate students and researchers entering this field as it allows for the fruitful transfer of paradigms and ideas amongst different areas, and includes many specific examples to help the reader understand abstract and sometimes challenging concepts. It explores the topological quantum world beyond the well-know...

Demonstration of blind quantum computing.

Science.gov (United States)

Barz, Stefanie; Kashefi, Elham; Broadbent, Anne; Fitzsimons, Joseph F; Zeilinger, Anton; Walther, Philip

2012-01-20

Quantum computers, besides offering substantial computational speedups, are also expected to preserve the privacy of a computation. We present an experimental demonstration of blind quantum computing in which the input, computation, and output all remain unknown to the computer. We exploit the conceptual framework of measurement-based quantum computation that enables a client to delegate a computation to a quantum server. Various blind delegated computations, including one- and two-qubit gates and the Deutsch and Grover quantum algorithms, are demonstrated. The client only needs to be able to prepare and transmit individual photonic qubits. Our demonstration is crucial for unconditionally secure quantum cloud computing and might become a key ingredient for real-life applications, especially when considering the challenges of making powerful quantum computers widely available.

Quantum computing and spintronics

International Nuclear Information System (INIS)

Kantser, V.

2007-01-01

Tentative to build a computer, which can operate according to the quantum laws, has leaded to concept of quantum computing algorithms and hardware. In this review we highlight recent developments which point the way to quantum computing on the basis solid state nanostructures after some general considerations concerning quantum information science and introducing a set of basic requirements for any quantum computer proposal. One of the major direction of research on the way to quantum computing is to exploit the spin (in addition to the orbital) degree of freedom of the electron, giving birth to the field of spintronics. We address some semiconductor approach based on spin orbit coupling in semiconductor nanostructures. (authors)

Testing the foundations of quantum mechanics

CERN Document Server

Gisin, Nicolas; CERN. Geneva

1999-01-01

Quantum mechanics is certainly one of the most fascinating field of physics. In recent years, the new field of "quantum information processing" based on the most fundamental aspect of quantum mechanics, like linearity and entanglement, even increased and its peculiarities. In this series of 4 lectures we shall present some of the issues and experiments that test quantum theory. Entanglement leads, on the one hand side, to the measurement problem, to the EPR paradox and to quantum nonlocality ( distant systems). We will derive the Bell inequality, present experimental results that provide huge evidence in favor of quantum nonlocality and discuss some loopholes that are still open. On the other side, entanglement offers many new possibilities for information processing. Indeed, it provides means to carry out tasks that are either impossible classically (like quantum cryptography and quantum teleportation) or that would require significantly more steps to perform on a classical computer (like searching a databas...

Scalable optical quantum computer

International Nuclear Information System (INIS)

Manykin, E A; Mel'nichenko, E V

2014-01-01

A way of designing a scalable optical quantum computer based on the photon echo effect is proposed. Individual rare earth ions Pr 3+ , regularly located in the lattice of the orthosilicate (Y 2 SiO 5 ) crystal, are suggested to be used as optical qubits. Operations with qubits are performed using coherent and incoherent laser pulses. The operation protocol includes both the method of measurement-based quantum computations and the technique of optical computations. Modern hybrid photon echo protocols, which provide a sufficient quantum efficiency when reading recorded states, are considered as most promising for quantum computations and communications. (quantum computer)

Exploiting Locality in Quantum Computation for Quantum Chemistry.

Science.gov (United States)

McClean, Jarrod R; Babbush, Ryan; Love, Peter J; Aspuru-Guzik, Alán

2014-12-18

Accurate prediction of chemical and material properties from first-principles quantum chemistry is a challenging task on traditional computers. Recent developments in quantum computation offer a route toward highly accurate solutions with polynomial cost; however, this solution still carries a large overhead. In this Perspective, we aim to bring together known results about the locality of physical interactions from quantum chemistry with ideas from quantum computation. We show that the utilization of spatial locality combined with the Bravyi-Kitaev transformation offers an improvement in the scaling of known quantum algorithms for quantum chemistry and provides numerical examples to help illustrate this point. We combine these developments to improve the outlook for the future of quantum chemistry on quantum computers.

Fundamental gravitational limitations to quantum computing

International Nuclear Information System (INIS)

Gambini, R.; Porto, A.; Pullin, J.

2006-01-01

Lloyd has considered the ultimate limitations the fundamental laws of physics place on quantum computers. He concludes in particular that for an 'ultimate laptop' (a computer of one liter of volume and one kilogram of mass) the maximum number of operations per second is bounded by 10 51 . The limit is derived considering ordinary quantum mechanics. Here we consider additional limits that are placed by quantum gravity ideas, namely the use of a relational notion of time and fundamental gravitational limits that exist on time measurements. We then particularize for the case of an ultimate laptop and show that the maximum number of operations is further constrained to 10 47 per second. (authors)

Emergence of quantum mechanics from classical statistics

International Nuclear Information System (INIS)

Wetterich, C

2009-01-01

The conceptual setting of quantum mechanics is subject to an ongoing debate from its beginnings until now. The consequences of the apparent differences between quantum statistics and classical statistics range from the philosophical interpretations to practical issues as quantum computing. In this note we demonstrate how quantum mechanics can emerge from classical statistical systems. We discuss conditions and circumstances for this to happen. Quantum systems describe isolated subsystems of classical statistical systems with infinitely many states. While infinitely many classical observables 'measure' properties of the subsystem and its environment, the state of the subsystem can be characterized by the expectation values of only a few probabilistic observables. They define a density matrix, and all the usual laws of quantum mechanics follow. No concepts beyond classical statistics are needed for quantum physics - the differences are only apparent and result from the particularities of those classical statistical systems which admit a quantum mechanical description. In particular, we show how the non-commuting properties of quantum operators are associated to the use of conditional probabilities within the classical system, and how a unitary time evolution reflects the isolation of the subsystem.

Scalable optical quantum computer

Energy Technology Data Exchange (ETDEWEB)

Manykin, E A; Mel' nichenko, E V [Institute for Superconductivity and Solid-State Physics, Russian Research Centre ' Kurchatov Institute' , Moscow (Russian Federation)

2014-12-31

A way of designing a scalable optical quantum computer based on the photon echo effect is proposed. Individual rare earth ions Pr{sup 3+}, regularly located in the lattice of the orthosilicate (Y{sub 2}SiO{sub 5}) crystal, are suggested to be used as optical qubits. Operations with qubits are performed using coherent and incoherent laser pulses. The operation protocol includes both the method of measurement-based quantum computations and the technique of optical computations. Modern hybrid photon echo protocols, which provide a sufficient quantum efficiency when reading recorded states, are considered as most promising for quantum computations and communications. (quantum computer)

Quantum chemistry simulation on quantum computers: theories and experiments.

Science.gov (United States)

Lu, Dawei; Xu, Boruo; Xu, Nanyang; Li, Zhaokai; Chen, Hongwei; Peng, Xinhua; Xu, Ruixue; Du, Jiangfeng

2012-07-14

It has been claimed that quantum computers can mimic quantum systems efficiently in the polynomial scale. Traditionally, those simulations are carried out numerically on classical computers, which are inevitably confronted with the exponential growth of required resources, with the increasing size of quantum systems. Quantum computers avoid this problem, and thus provide a possible solution for large quantum systems. In this paper, we first discuss the ideas of quantum simulation, the background of quantum simulators, their categories, and the development in both theories and experiments. We then present a brief introduction to quantum chemistry evaluated via classical computers followed by typical procedures of quantum simulation towards quantum chemistry. Reviewed are not only theoretical proposals but also proof-of-principle experimental implementations, via a small quantum computer, which include the evaluation of the static molecular eigenenergy and the simulation of chemical reaction dynamics. Although the experimental development is still behind the theory, we give prospects and suggestions for future experiments. We anticipate that in the near future quantum simulation will become a powerful tool for quantum chemistry over classical computations.

Quantum Computing: Pro and Con

OpenAIRE

Preskill, John

1997-01-01

I assess the potential of quantum computation. Broad and important applications must be found to justify construction of a quantum computer; I review some of the known quantum algorithms and consider the prospects for finding new ones. Quantum computers are notoriously susceptible to making errors; I discuss recently developed fault-tolerant procedures that enable a quantum computer with noisy gates to perform reliably. Quantum computing hardware is still in its infancy; I comment on the spec...

Private quantum computation: an introduction to blind quantum computing and related protocols

Science.gov (United States)

Fitzsimons, Joseph F.

2017-06-01

Quantum technologies hold the promise of not only faster algorithmic processing of data, via quantum computation, but also of more secure communications, in the form of quantum cryptography. In recent years, a number of protocols have emerged which seek to marry these concepts for the purpose of securing computation rather than communication. These protocols address the task of securely delegating quantum computation to an untrusted device while maintaining the privacy, and in some instances the integrity, of the computation. We present a review of the progress to date in this emerging area.

Quantum Mechanics/Molecular Mechanics Study of the Sialyltransferase Reaction Mechanism.

Science.gov (United States)

Hamada, Yojiro; Kanematsu, Yusuke; Tachikawa, Masanori

2016-10-11

The sialyltransferase is an enzyme that transfers the sialic acid moiety from cytidine 5'-monophospho-N-acetyl-neuraminic acid (CMP-NeuAc) to the terminal position of glycans. To elucidate the catalytic mechanism of sialyltransferase, we explored the potential energy surface along the sialic acid transfer reaction coordinates by the hybrid quantum mechanics/molecular mechanics method on the basis of the crystal structure of sialyltransferase CstII. Our calculation demonstrated that CstII employed an S N 1-like reaction mechanism via the formation of a short-lived oxocarbenium ion intermediate. The computational barrier height was 19.5 kcal/mol, which reasonably corresponded with the experimental reaction rate. We also found that two tyrosine residues (Tyr156 and Tyr162) played a vital role in stabilizing the intermediate and the transition states by quantum mechanical interaction with CMP.

Extended quantum mechanics

International Nuclear Information System (INIS)

Pavel Bona

2000-01-01

The work can be considered as an essay on mathematical and conceptual structure of nonrelativistic quantum mechanics which is related here to some other (more general, but also to more special and 'approximative') theories. Quantum mechanics is here primarily reformulated in an equivalent form of a Poisson system on the phase space consisting of density matrices, where the 'observables', as well as 'symmetry generators' are represented by a specific type of real valued (densely defined) functions, namely the usual quantum expectations of corresponding selfjoint operators. It is shown in this paper that inclusion of additional ('nonlinear') symmetry generators (i. e. 'Hamiltonians') into this reformulation of (linear) quantum mechanics leads to a considerable extension of the theory: two kinds of quantum 'mixed states' should be distinguished, and operator - valued functions of density matrices should be used in the role of 'nonlinear observables'. A general framework for physical theories is obtained in this way: By different choices of the sets of 'nonlinear observables' we obtain, as special cases, e.g. classical mechanics on homogeneous spaces of kinematical symmetry groups, standard (linear) quantum mechanics, or nonlinear extensions of quantum mechanics; also various 'quasiclassical approximations' to quantum mechanics are all sub theories of the presented extension of quantum mechanics - a version of the extended quantum mechanics. A general interpretation scheme of extended quantum mechanics extending the usual statistical interpretation of quantum mechanics is also proposed. Eventually, extended quantum mechanics is shown to be (included into) a C * -algebraic (hence linear) quantum theory. Mathematical formulation of these theories is presented. The presentation includes an analysis of problems connected with differentiation on infinite-dimensional manifolds, as well as a solution of some problems connected with the work with only densely defined unbounded

The quantum computer game: citizen science

Science.gov (United States)

Damgaard, Sidse; Mølmer, Klaus; Sherson, Jacob

2013-05-01

Progress in the field of quantum computation is hampered by daunting technical challenges. Here we present an alternative approach to solving these by enlisting the aid of computer players around the world. We have previously examined a quantum computation architecture involving ultracold atoms in optical lattices and strongly focused tweezers of light. In The Quantum Computer Game (see http://www.scienceathome.org/), we have encapsulated the time-dependent Schrödinger equation for the problem in a graphical user interface allowing for easy user input. Players can then search the parameter space with real-time graphical feedback in a game context with a global high-score that rewards short gate times and robustness to experimental errors. The game which is still in a demo version has so far been tried by several hundred players. Extensions of the approach to other models such as Gross-Pitaevskii and Bose-Hubbard are currently under development. The game has also been incorporated into science education at high-school and university level as an alternative method for teaching quantum mechanics. Initial quantitative evaluation results are very positive. AU Ideas Center for Community Driven Research, CODER.

QUANTUM DISCORD AND QUANTUM COMPUTING - AN APPRAISAL

OpenAIRE

Datta, Animesh; Shaji, Anil

2011-01-01

We discuss models of computing that are beyond classical. The primary motivation is to unearth the cause of nonclassical advantages in computation. Completeness results from computational complexity theory lead to the identification of very disparate problems, and offer a kaleidoscopic view into the realm of quantum enhancements in computation. Emphasis is placed on the `power of one qubit' model, and the boundary between quantum and classical correlations as delineated by quantum discord. A ...

The interpretation of quantum mechanics

International Nuclear Information System (INIS)

Pippard, A.B.

1986-01-01

It is argued that the reduction of the wavepacket following a measurement is no more than a computational convenience to which no meaning should be attached. In a strict application of quantum mechanics all measuring instruments must be included in a single wavefunction. Thus the activity of physics is treated as the analysis of public information, as conveyed by instruments, with quantum mechanics the accepted analytical procedure rather than a model of objective reality. Finally the classical world of particle trajectories that can be agreed on by all observers is shown to be a natural corollary. (author)

Horizon quantum mechanics of rotating black holes

Energy Technology Data Exchange (ETDEWEB)

Casadio, Roberto [Universita di Bologna, Dipartimento di Fisica e Astronomia, Bologna (Italy); I.N.F.N., Sezione di Bologna, I.S. FLAG, Bologna (Italy); Giugno, Andrea [Ludwig-Maximilians-Universitaet, Arnold Sommerfeld Center, Munich (Germany); Giusti, Andrea [Universita di Bologna, Dipartimento di Fisica e Astronomia, Bologna (Italy); I.N.F.N., Sezione di Bologna, I.S. FLAG, Bologna (Italy); Ludwig-Maximilians-Universitaet, Arnold Sommerfeld Center, Munich (Germany); Micu, Octavian [Institute of Space Science, Bucharest, P.O. Box MG-23, Bucharest-Magurele (Romania)

2017-05-15

The horizon quantum mechanics is an approach that was previously introduced in order to analyze the gravitational radius of spherically symmetric systems and compute the probability that a given quantum state is a black hole. In this work, we first extend the formalism to general space-times with asymptotic (ADM) mass and angular momentum. We then apply the extended horizon quantum mechanics to a harmonic model of rotating corpuscular black holes. We find that simple configurations of this model naturally suppress the appearance of the inner horizon and seem to disfavor extremal (macroscopic) geometries. (orig.)

Layered architecture for quantum computing

OpenAIRE

Jones, N. Cody; Van Meter, Rodney; Fowler, Austin G.; McMahon, Peter L.; Kim, Jungsang; Ladd, Thaddeus D.; Yamamoto, Yoshihisa

2010-01-01

We develop a layered quantum-computer architecture, which is a systematic framework for tackling the individual challenges of developing a quantum computer while constructing a cohesive device design. We discuss many of the prominent techniques for implementing circuit-model quantum computing and introduce several new methods, with an emphasis on employing surface-code quantum error correction. In doing so, we propose a new quantum-computer architecture based on optical control of quantum dot...

Quantum computing with trapped ions

International Nuclear Information System (INIS)

Haeffner, H.; Roos, C.F.; Blatt, R.

2008-01-01

Quantum computers hold the promise of solving certain computational tasks much more efficiently than classical computers. We review recent experimental advances towards a quantum computer with trapped ions. In particular, various implementations of qubits, quantum gates and some key experiments are discussed. Furthermore, we review some implementations of quantum algorithms such as a deterministic teleportation of quantum information and an error correction scheme

Nanophotonic quantum computer based on atomic quantum transistor

International Nuclear Information System (INIS)

Andrianov, S N; Moiseev, S A

2015-01-01

We propose a scheme of a quantum computer based on nanophotonic elements: two buses in the form of nanowaveguide resonators, two nanosized units of multiatom multiqubit quantum memory and a set of nanoprocessors in the form of photonic quantum transistors, each containing a pair of nanowaveguide ring resonators coupled via a quantum dot. The operation modes of nanoprocessor photonic quantum transistors are theoretically studied and the execution of main logical operations by means of them is demonstrated. We also discuss the prospects of the proposed nanophotonic quantum computer for operating in high-speed optical fibre networks. (quantum computations)

Nanophotonic quantum computer based on atomic quantum transistor

Energy Technology Data Exchange (ETDEWEB)

Andrianov, S N [Institute of Advanced Research, Academy of Sciences of the Republic of Tatarstan, Kazan (Russian Federation); Moiseev, S A [Kazan E. K. Zavoisky Physical-Technical Institute, Kazan Scientific Center, Russian Academy of Sciences, Kazan (Russian Federation)

2015-10-31

We propose a scheme of a quantum computer based on nanophotonic elements: two buses in the form of nanowaveguide resonators, two nanosized units of multiatom multiqubit quantum memory and a set of nanoprocessors in the form of photonic quantum transistors, each containing a pair of nanowaveguide ring resonators coupled via a quantum dot. The operation modes of nanoprocessor photonic quantum transistors are theoretically studied and the execution of main logical operations by means of them is demonstrated. We also discuss the prospects of the proposed nanophotonic quantum computer for operating in high-speed optical fibre networks. (quantum computations)

Quantum computing with trapped ions

Energy Technology Data Exchange (ETDEWEB)

Hughes, R.J.

1998-01-01

The significance of quantum computation for cryptography is discussed. Following a brief survey of the requirements for quantum computational hardware, an overview of the ion trap quantum computation project at Los Alamos is presented. The physical limitations to quantum computation with trapped ions are analyzed and an assessment of the computational potential of the technology is made.

Spin-based quantum computation in multielectron quantum dots

OpenAIRE

Hu, Xuedong; Sarma, S. Das

2001-01-01

In a quantum computer the hardware and software are intrinsically connected because the quantum Hamiltonian (or more precisely its time development) is the code that runs the computer. We demonstrate this subtle and crucial relationship by considering the example of electron-spin-based solid state quantum computer in semiconductor quantum dots. We show that multielectron quantum dots with one valence electron in the outermost shell do not behave simply as an effective single spin system unles...

Applications of quantum mechanical techniques to areas outside of quantum mechanics

CERN Document Server

Khrennikov, Andrei

2018-01-01

This book deals with applications of quantum mechanical techniques to areas outside of quantum mechanics, so-called quantum-like modeling. Research in this area has grown over the last 15 years. But even already more than 50 years ago, the interaction between Physics Nobelist Pauli and the psychologist Carl Jung in the 1950's on seeking to find analogous uses of the complementarity principle from quantum mechanics in psychology needs noting. This book does NOT want to advance that society is quantum mechanical! The macroscopic world is manifestly not quantum mechanical. But this rules not out that one can use concepts and the mathematical apparatus from quantum physics in a macroscopic environment. A mainstay ingredient of quantum mechanics, is 'quantum probability' and this tool has been proven to be useful in the mathematical modelling of decision making. In the most basic experiment of quantum physics, the double slit experiment, it is known (from the works of A. Khrennikov) that the law of total probabi...

Experimental demonstration of deterministic one-way quantum computing on a NMR quantum computer

OpenAIRE

Ju, Chenyong; Zhu, Jing; Peng, Xinhua; Chong, Bo; Zhou, Xianyi; Du, Jiangfeng

2008-01-01

One-way quantum computing is an important and novel approach to quantum computation. By exploiting the existing particle-particle interactions, we report the first experimental realization of the complete process of deterministic one-way quantum Deutsch-Josza algorithm in NMR, including graph state preparation, single-qubit measurements and feed-forward corrections. The findings in our experiment may shed light on the future scalable one-way quantum computation.

Methodological testing: Are fast quantum computers illusions?

Energy Technology Data Exchange (ETDEWEB)

Meyer, Steven [Tachyon Design Automation, San Francisco, CA (United States)

2013-07-01

Popularity of the idea for computers constructed from the principles of QM started with Feynman's 'Lectures On Computation', but he called the idea crazy and dependent on statistical mechanics. In 1987, Feynman published a paper in 'Quantum Implications - Essays in Honor of David Bohm' on negative probabilities which he said gave him cultural shock. The problem with imagined fast quantum computers (QC) is that speed requires both statistical behavior and truth of the mathematical formalism. The Swedish Royal Academy 2012 Nobel Prize in physics press release touted the discovery of methods to control ''individual quantum systems'', to ''measure and control very fragile quantum states'' which enables ''first steps towards building a new type of super fast computer based on quantum physics.'' A number of examples where widely accepted mathematical descriptions have turned out to be problematic are examined: Problems with the use of Oracles in P=NP computational complexity, Paul Finsler's proof of the continuum hypothesis, and Turing's Enigma code breaking versus William tutte's Colossus. I view QC research as faith in computational oracles with wished for properties. Arther Fine's interpretation in 'The Shaky Game' of Einstein's skepticism toward QM is discussed. If Einstein's reality as space-time curvature is correct, then space-time computers will be the next type of super fast computer.

Digitized adiabatic quantum computing with a superconducting circuit.

Science.gov (United States)

Barends, R; Shabani, A; Lamata, L; Kelly, J; Mezzacapo, A; Las Heras, U; Babbush, R; Fowler, A G; Campbell, B; Chen, Yu; Chen, Z; Chiaro, B; Dunsworth, A; Jeffrey, E; Lucero, E; Megrant, A; Mutus, J Y; Neeley, M; Neill, C; O'Malley, P J J; Quintana, C; Roushan, P; Sank, D; Vainsencher, A; Wenner, J; White, T C; Solano, E; Neven, H; Martinis, John M

2016-06-09

Quantum mechanics can help to solve complex problems in physics and chemistry, provided they can be programmed in a physical device. In adiabatic quantum computing, a system is slowly evolved from the ground state of a simple initial Hamiltonian to a final Hamiltonian that encodes a computational problem. The appeal of this approach lies in the combination of simplicity and generality; in principle, any problem can be encoded. In practice, applications are restricted by limited connectivity, available interactions and noise. A complementary approach is digital quantum computing, which enables the construction of arbitrary interactions and is compatible with error correction, but uses quantum circuit algorithms that are problem-specific. Here we combine the advantages of both approaches by implementing digitized adiabatic quantum computing in a superconducting system. We tomographically probe the system during the digitized evolution and explore the scaling of errors with system size. We then let the full system find the solution to random instances of the one-dimensional Ising problem as well as problem Hamiltonians that involve more complex interactions. This digital quantum simulation of the adiabatic algorithm consists of up to nine qubits and up to 1,000 quantum logic gates. The demonstration of digitized adiabatic quantum computing in the solid state opens a path to synthesizing long-range correlations and solving complex computational problems. When combined with fault-tolerance, our approach becomes a general-purpose algorithm that is scalable.

Quantum mechanics/coarse-grained molecular mechanics (QM/CG-MM).

Science.gov (United States)

Sinitskiy, Anton V; Voth, Gregory A

2018-01-07

Numerous molecular systems, including solutions, proteins, and composite materials, can be modeled using mixed-resolution representations, of which the quantum mechanics/molecular mechanics (QM/MM) approach has become the most widely used. However, the QM/MM approach often faces a number of challenges, including the high cost of repetitive QM computations, the slow sampling even for the MM part in those cases where a system under investigation has a complex dynamics, and a difficulty in providing a simple, qualitative interpretation of numerical results in terms of the influence of the molecular environment upon the active QM region. In this paper, we address these issues by combining QM/MM modeling with the methodology of "bottom-up" coarse-graining (CG) to provide the theoretical basis for a systematic quantum-mechanical/coarse-grained molecular mechanics (QM/CG-MM) mixed resolution approach. A derivation of the method is presented based on a combination of statistical mechanics and quantum mechanics, leading to an equation for the effective Hamiltonian of the QM part, a central concept in the QM/CG-MM theory. A detailed analysis of different contributions to the effective Hamiltonian from electrostatic, induction, dispersion, and exchange interactions between the QM part and the surroundings is provided, serving as a foundation for a potential hierarchy of QM/CG-MM methods varying in their accuracy and computational cost. A relationship of the QM/CG-MM methodology to other mixed resolution approaches is also discussed.

Quantum mechanics/coarse-grained molecular mechanics (QM/CG-MM)

Science.gov (United States)

Sinitskiy, Anton V.; Voth, Gregory A.

2018-01-01

Numerous molecular systems, including solutions, proteins, and composite materials, can be modeled using mixed-resolution representations, of which the quantum mechanics/molecular mechanics (QM/MM) approach has become the most widely used. However, the QM/MM approach often faces a number of challenges, including the high cost of repetitive QM computations, the slow sampling even for the MM part in those cases where a system under investigation has a complex dynamics, and a difficulty in providing a simple, qualitative interpretation of numerical results in terms of the influence of the molecular environment upon the active QM region. In this paper, we address these issues by combining QM/MM modeling with the methodology of "bottom-up" coarse-graining (CG) to provide the theoretical basis for a systematic quantum-mechanical/coarse-grained molecular mechanics (QM/CG-MM) mixed resolution approach. A derivation of the method is presented based on a combination of statistical mechanics and quantum mechanics, leading to an equation for the effective Hamiltonian of the QM part, a central concept in the QM/CG-MM theory. A detailed analysis of different contributions to the effective Hamiltonian from electrostatic, induction, dispersion, and exchange interactions between the QM part and the surroundings is provided, serving as a foundation for a potential hierarchy of QM/CG-MM methods varying in their accuracy and computational cost. A relationship of the QM/CG-MM methodology to other mixed resolution approaches is also discussed.

Decoherence in adiabatic quantum computation

Science.gov (United States)

Albash, Tameem; Lidar, Daniel A.

2015-06-01

Recent experiments with increasingly larger numbers of qubits have sparked renewed interest in adiabatic quantum computation, and in particular quantum annealing. A central question that is repeatedly asked is whether quantum features of the evolution can survive over the long time scales used for quantum annealing relative to standard measures of the decoherence time. We reconsider the role of decoherence in adiabatic quantum computation and quantum annealing using the adiabatic quantum master-equation formalism. We restrict ourselves to the weak-coupling and singular-coupling limits, which correspond to decoherence in the energy eigenbasis and in the computational basis, respectively. We demonstrate that decoherence in the instantaneous energy eigenbasis does not necessarily detrimentally affect adiabatic quantum computation, and in particular that a short single-qubit T2 time need not imply adverse consequences for the success of the quantum adiabatic algorithm. We further demonstrate that boundary cancellation methods, designed to improve the fidelity of adiabatic quantum computing in the closed-system setting, remain beneficial in the open-system setting. To address the high computational cost of master-equation simulations, we also demonstrate that a quantum Monte Carlo algorithm that explicitly accounts for a thermal bosonic bath can be used to interpolate between classical and quantum annealing. Our study highlights and clarifies the significantly different role played by decoherence in the adiabatic and circuit models of quantum computing.

Protein Structure Validation and Refinement Using Chemical Shifts Derived from Quantum Mechanics

DEFF Research Database (Denmark)

Bratholm, Lars Andersen

to within 3 A. Furthermore, a fast quantum mechanics based chemical shift predictor was developed together with methodology for using chemical shifts in structure simulations. The developed predictor was used for renement of several protein structures and for reducing the computational cost of quantum...... mechanics / molecular mechanics (QM/MM) computations of chemical shieldings. Several improvements to the predictor is ongoing, where among other things, kernel based machine learning techniques have successfully been used to improve the quantum mechanical level of theory used in the predictions....

How to Build a Quantum Computer

Science.gov (United States)

Sanders, Barry C.

2017-11-01

Quantum computer technology is progressing rapidly with dozens of qubits and hundreds of quantum logic gates now possible. Although current quantum computer technology is distant from being able to solve computational problems beyond the reach of non-quantum computers, experiments have progressed well beyond simply demonstrating the requisite components. We can now operate small quantum logic processors with connected networks of qubits and quantum logic gates, which is a great stride towards functioning quantum computers. This book aims to be accessible to a broad audience with basic knowledge of computers, electronics and physics. The goal is to convey key notions relevant to building quantum computers and to present state-of-the-art quantum-computer research in various media such as trapped ions, superconducting circuits, photonics and beyond.

Quantum information. Teleportation - cryptography - quantum computer; Quanteninformation. Teleportation - Kryptografie - Quantencomputer

Energy Technology Data Exchange (ETDEWEB)

Koenneker, Carsten (comp.)

2012-11-01

The following topics are dealt with: Reality in the test facility, quantum teleportation, the reality of quanta, interaction-free quantum measurement, rules for quantum computers, quantum computers with ions, spintronics with diamond, the limits of the quantum computers, a view in the future of quantum optics. (HSI)

Single-server blind quantum computation with quantum circuit model

Science.gov (United States)

Zhang, Xiaoqian; Weng, Jian; Li, Xiaochun; Luo, Weiqi; Tan, Xiaoqing; Song, Tingting

2018-06-01

Blind quantum computation (BQC) enables the client, who has few quantum technologies, to delegate her quantum computation to a server, who has strong quantum computabilities and learns nothing about the client's quantum inputs, outputs and algorithms. In this article, we propose a single-server BQC protocol with quantum circuit model by replacing any quantum gate with the combination of rotation operators. The trap quantum circuits are introduced, together with the combination of rotation operators, such that the server is unknown about quantum algorithms. The client only needs to perform operations X and Z, while the server honestly performs rotation operators.

Explorations in quantum computing

CERN Document Server

Williams, Colin P

2011-01-01

By the year 2020, the basic memory components of a computer will be the size of individual atoms. At such scales, the current theory of computation will become invalid. ""Quantum computing"" is reinventing the foundations of computer science and information theory in a way that is consistent with quantum physics - the most accurate model of reality currently known. Remarkably, this theory predicts that quantum computers can perform certain tasks breathtakingly faster than classical computers -- and, better yet, can accomplish mind-boggling feats such as teleporting information, breaking suppos

Computation of Hydration Free Energies Using the Multiple Environment Single System Quantum Mechanical/Molecular Mechanical Method.

Science.gov (United States)

König, Gerhard; Mei, Ye; Pickard, Frank C; Simmonett, Andrew C; Miller, Benjamin T; Herbert, John M; Woodcock, H Lee; Brooks, Bernard R; Shao, Yihan

2016-01-12

A recently developed MESS-E-QM/MM method (multiple-environment single-system quantum mechanical molecular/mechanical calculations with a Roothaan-step extrapolation) is applied to the computation of hydration free energies for the blind SAMPL4 test set and for 12 small molecules. First, free energy simulations are performed with a classical molecular mechanics force field using fixed-geometry solute molecules and explicit TIP3P solvent, and then the non-Boltzmann-Bennett method is employed to compute the QM/MM correction (QM/MM-NBB) to the molecular mechanical hydration free energies. For the SAMPL4 set, MESS-E-QM/MM-NBB corrections to the hydration free energy can be obtained 2 or 3 orders of magnitude faster than fully converged QM/MM-NBB corrections, and, on average, the hydration free energies predicted with MESS-E-QM/MM-NBB fall within 0.10-0.20 kcal/mol of full-converged QM/MM-NBB results. Out of five density functionals (BLYP, B3LYP, PBE0, M06-2X, and ωB97X-D), the BLYP functional is found to be most compatible with the TIP3P solvent model and yields the most accurate hydration free energies against experimental values for solute molecules included in this study.

Quantum Computation--The Ultimate Frontier

OpenAIRE

Adami, Chris; Dowling, Jonathan P.

2002-01-01

The discovery of an algorithm for factoring which runs in polynomial time on a quantum computer has given rise to a concerted effort to understand the principles, advantages, and limitations of quantum computing. At the same time, many different quantum systems are being explored for their suitability to serve as a physical substrate for the quantum computer of the future. I discuss some of the theoretical foundations of quantum computer science, including algorithms and error correction, and...

Quantum Error Correction and Fault Tolerant Quantum Computing

CERN Document Server

Gaitan, Frank

2008-01-01

It was once widely believed that quantum computation would never become a reality. However, the discovery of quantum error correction and the proof of the accuracy threshold theorem nearly ten years ago gave rise to extensive development and research aimed at creating a working, scalable quantum computer. Over a decade has passed since this monumental accomplishment yet no book-length pedagogical presentation of this important theory exists. Quantum Error Correction and Fault Tolerant Quantum Computing offers the first full-length exposition on the realization of a theory once thought impo

Nonadiabatic corrections to a quantum dot quantum computer

Indian Academy of Sciences (India)

Home; Journals; Pramana – Journal of Physics; Volume 83; Issue 1. Nonadiabatic corrections to a quantum dot quantum computer working in adiabatic limit. M Ávila ... The time of operation of an adiabatic quantum computer must be less than the decoherence time, otherwise the computer would be nonoperative. So far, the ...

Blind topological measurement-based quantum computation.

Science.gov (United States)

Morimae, Tomoyuki; Fujii, Keisuke

2012-01-01

Blind quantum computation is a novel secure quantum-computing protocol that enables Alice, who does not have sufficient quantum technology at her disposal, to delegate her quantum computation to Bob, who has a fully fledged quantum computer, in such a way that Bob cannot learn anything about Alice's input, output and algorithm. A recent proof-of-principle experiment demonstrating blind quantum computation in an optical system has raised new challenges regarding the scalability of blind quantum computation in realistic noisy conditions. Here we show that fault-tolerant blind quantum computation is possible in a topologically protected manner using the Raussendorf-Harrington-Goyal scheme. The error threshold of our scheme is 4.3 × 10(-3), which is comparable to that (7.5 × 10(-3)) of non-blind topological quantum computation. As the error per gate of the order 10(-3) was already achieved in some experimental systems, our result implies that secure cloud quantum computation is within reach.

Quantum mechanics

CERN Document Server

Rae, Alastair I M

2016-01-01

A Thorough Update of One of the Most Highly Regarded Textbooks on Quantum Mechanics Continuing to offer an exceptionally clear, up-to-date treatment of the subject, Quantum Mechanics, Sixth Edition explains the concepts of quantum mechanics for undergraduate students in physics and related disciplines and provides the foundation necessary for other specialized courses. This sixth edition builds on its highly praised predecessors to make the text even more accessible to a wider audience. It is now divided into five parts that separately cover broad topics suitable for any general course on quantum mechanics. New to the Sixth Edition * Three chapters that review prerequisite physics and mathematics, laying out the notation, formalism, and physical basis necessary for the rest of the book * Short descriptions of numerous applications relevant to the physics discussed, giving students a brief look at what quantum mechanics has made possible industrially and scientifically * Additional end-of-chapter problems with...

New Approaches to Quantum Computing using Nuclear Magnetic Resonance Spectroscopy

International Nuclear Information System (INIS)

Colvin, M; Krishnan, V V

2003-01-01

The power of a quantum computer (QC) relies on the fundamental concept of the superposition in quantum mechanics and thus allowing an inherent large-scale parallelization of computation. In a QC, binary information embodied in a quantum system, such as spin degrees of freedom of a spin-1/2 particle forms the qubits (quantum mechanical bits), over which appropriate logical gates perform the computation. In classical computers, the basic unit of information is the bit, which can take a value of either 0 or 1. Bits are connected together by logic gates to form logic circuits to implement complex logical operations. The expansion of modern computers has been driven by the developments of faster, smaller and cheaper logic gates. As the size of the logic gates become smaller toward the level of atomic dimensions, the performance of such a system is no longer considered classical but is rather governed by quantum mechanics. Quantum computers offer the potentially superior prospect of solving computational problems that are intractable to classical computers such as efficient database searches and cryptography. A variety of algorithms have been developed recently, most notably Shor's algorithm for factorizing long numbers into prime factors in polynomial time and Grover's quantum search algorithm. The algorithms that were of only theoretical interest as recently, until several methods were proposed to build an experimental QC. These methods include, trapped ions, cavity-QED, coupled quantum dots, Josephson junctions, spin resonance transistors, linear optics and nuclear magnetic resonance. Nuclear magnetic resonance (NMR) is uniquely capable of constructing small QCs and several algorithms have been implemented successfully. NMR-QC differs from other implementations in one important way that it is not a single QC, but a statistical ensemble of them. Thus, quantum computing based on NMR is considered as ensemble quantum computing. In NMR quantum computing, the spins with

Quantum mechanics symmetries

CERN Document Server

Greiner, Walter

1989-01-01

"Quantum Dynamics" is a major survey of quantum theory based on Walter Greiner's long-running and highly successful courses at the University of Frankfurt. The key to understanding in quantum theory is to reinforce lecture attendance and textual study by working through plenty of representative and detailed examples. Firm belief in this principle led Greiner to develop his unique course and to transform it into a remarkable and comprehensive text. The text features a large number of examples and exercises involving many of the most advanced topics in quantum theory. These examples give practical and precise demonstrations of how to use the often subtle mathematics behind quantum theory. The text is divided into five volumes: Quantum Mechanics I - An Introduction, Quantum Mechanics II - Symmetries, Relativistic Quantum Mechanics, Quantum Electrodynamics, Gauge Theory of Weak Interactions. These five volumes take the reader from the fundamental postulates of quantum mechanics up to the latest research in partic...

Quantum computing with defects.

Science.gov (United States)

Weber, J R; Koehl, W F; Varley, J B; Janotti, A; Buckley, B B; Van de Walle, C G; Awschalom, D D

2010-05-11

Identifying and designing physical systems for use as qubits, the basic units of quantum information, are critical steps in the development of a quantum computer. Among the possibilities in the solid state, a defect in diamond known as the nitrogen-vacancy (NV(-1)) center stands out for its robustness--its quantum state can be initialized, manipulated, and measured with high fidelity at room temperature. Here we describe how to systematically identify other deep center defects with similar quantum-mechanical properties. We present a list of physical criteria that these centers and their hosts should meet and explain how these requirements can be used in conjunction with electronic structure theory to intelligently sort through candidate defect systems. To illustrate these points in detail, we compare electronic structure calculations of the NV(-1) center in diamond with those of several deep centers in 4H silicon carbide (SiC). We then discuss the proposed criteria for similar defects in other tetrahedrally coordinated semiconductors.

A quantum information approach to statistical mechanics

International Nuclear Information System (INIS)

Cuevas, G.

2011-01-01

The field of quantum information and computation harnesses and exploits the properties of quantum mechanics to perform tasks more efficiently than their classical counterparts, or that may uniquely be possible in the quantum world. Its findings and techniques have been applied to a number of fields, such as the study of entanglement in strongly correlated systems, new simulation techniques for many-body physics or, generally, to quantum optics. This thesis aims at broadening the scope of quantum information theory by applying it to problems in statistical mechanics. We focus on classical spin models, which are toy models used in a variety of systems, ranging from magnetism, neural networks, to quantum gravity. We tackle these models using quantum information tools from three different angles. First, we show how the partition function of a class of widely different classical spin models (models in different dimensions, different types of many-body interactions, different symmetries, etc) can be mapped to the partition function of a single model. We prove this by first establishing a relation between partition functions and quantum states, and then transforming the corresponding quantum states to each other. Second, we give efficient quantum algorithms to estimate the partition function of various classical spin models, such as the Ising or the Potts model. The proof is based on a relation between partition functions and quantum circuits, which allows us to determine the quantum computational complexity of the partition function by studying the corresponding quantum circuit. Finally, we outline the possibility of applying quantum information concepts and tools to certain models of dis- crete quantum gravity. The latter provide a natural route to generalize our results, insofar as the central quantity has the form of a partition function, and as classical spin models are used as toy models of matter. (author)

Bohmian mechanics with complex action: A new trajectory-based formulation of quantum mechanics

International Nuclear Information System (INIS)

Goldfarb, Yair; Degani, Ilan; Tannor, David J.

2006-01-01

In recent years there has been a resurgence of interest in Bohmian mechanics as a numerical tool because of its local dynamics, which suggest the possibility of significant computational advantages for the simulation of large quantum systems. However, closer inspection of the Bohmian formulation reveals that the nonlocality of quantum mechanics has not disappeared--it has simply been swept under the rug into the quantum force. In this paper we present a new formulation of Bohmian mechanics in which the quantum action, S, is taken to be complex. This leads to a single equation for complex S, and ultimately complex x and p but there is a reward for this complexification - a significantly higher degree of localization. The quantum force in the new approach vanishes for Gaussian wave packet dynamics, and its effect on barrier tunneling processes is orders of magnitude lower than that of the classical force. In fact, the current method is shown to be a rigorous extension of generalized Gaussian wave packet dynamics to give exact quantum mechanics. We demonstrate tunneling probabilities that are in virtually perfect agreement with the exact quantum mechanics down to 10 -7 calculated from strictly localized quantum trajectories that do not communicate with their neighbors. The new formulation may have significant implications for fundamental quantum mechanics, ranging from the interpretation of non-locality to measures of quantum complexity

Computer studies of multiple-quantum spin dynamics

Energy Technology Data Exchange (ETDEWEB)

Murdoch, J.B.

1982-11-01

The excitation and detection of multiple-quantum (MQ) transitions in Fourier transform NMR spectroscopy is an interesting problem in the quantum mechanical dynamics of spin systems as well as an important new technique for investigation of molecular structure. In particular, multiple-quantum spectroscopy can be used to simplify overly complex spectra or to separate the various interactions between a nucleus and its environment. The emphasis of this work is on computer simulation of spin-system evolution to better relate theory and experiment.

Computer studies of multiple-quantum spin dynamics

International Nuclear Information System (INIS)

Murdoch, J.B.

1982-11-01

The excitation and detection of multiple-quantum (MQ) transitions in Fourier transform NMR spectroscopy is an interesting problem in the quantum mechanical dynamics of spin systems as well as an important new technique for investigation of molecular structure. In particular, multiple-quantum spectroscopy can be used to simplify overly complex spectra or to separate the various interactions between a nucleus and its environment. The emphasis of this work is on computer simulation of spin-system evolution to better relate theory and experiment

Quantum computing on encrypted data.

Science.gov (United States)

Fisher, K A G; Broadbent, A; Shalm, L K; Yan, Z; Lavoie, J; Prevedel, R; Jennewein, T; Resch, K J

2014-01-01

The ability to perform computations on encrypted data is a powerful tool for protecting privacy. Recently, protocols to achieve this on classical computing systems have been found. Here, we present an efficient solution to the quantum analogue of this problem that enables arbitrary quantum computations to be carried out on encrypted quantum data. We prove that an untrusted server can implement a universal set of quantum gates on encrypted quantum bits (qubits) without learning any information about the inputs, while the client, knowing the decryption key, can easily decrypt the results of the computation. We experimentally demonstrate, using single photons and linear optics, the encryption and decryption scheme on a set of gates sufficient for arbitrary quantum computations. As our protocol requires few extra resources compared with other schemes it can be easily incorporated into the design of future quantum servers. These results will play a key role in enabling the development of secure distributed quantum systems.

Wilson loops, instantons and quantum mechanics

International Nuclear Information System (INIS)

Schiereck, Marc

2014-05-01

In this thesis we examine two different problems. The first is the computation of vacuum expectation values of Wilson loop operators in ABJM theory, the other problem is finding the instanton series of the refined topological string on certain local Calabi-Yau geometries in the Nekrasov-Shatashvili limit. Based on the description of ABJM theory as a matrix model, it is possible to find a description of it in terms of an ideal Fermi gas with a non-trivial one-particle Hamiltonian. The vacuum-expectation-values of Wilson loop operators in ABJM theory correspond to averages of operators in the statistical-mechanical problem. Using the WKB expansion, it is possible to extract the full 1/N expansion of the vevs, up to exponentially small contributions, for arbitrary Chern-Simons coupling. We compute these vevs for the 1/6 and 1/2 BPS Wilson loops at any winding number. These can be written in terms of the Airy function. The expressions we found reproduce the low genus results previously obtained in the 't Hooft expansion. In another problem we use mirror symmetry, quantum geometry and modularity properties of elliptic curves to calculate the refined free energies, given in terms of an instanton sum, in the Nekrasov-Shatashvili limit on non-compact toric Calabi-Yau manifolds, based on del Pezzo surfaces. Quantum geometry here is to be understood as a quantum deformed version of rigid special geometry, which has its origin in the quantum mechanical behavior of branes in the topological string B-model. We argue that in the Seiberg-Witten picture only the Coulomb parameters lead to quantum corrections, while the mass parameters remain uncorrected. In certain cases we also compute the expansion of the free energies at the orbifold point and the conifold locus. We compute the quantum corrections order by order on ℎ by deriving second order differential operators, which act on the classical periods.

Layered Architecture for Quantum Computing

Directory of Open Access Journals (Sweden)

N. Cody Jones

2012-07-01

Full Text Available We develop a layered quantum-computer architecture, which is a systematic framework for tackling the individual challenges of developing a quantum computer while constructing a cohesive device design. We discuss many of the prominent techniques for implementing circuit-model quantum computing and introduce several new methods, with an emphasis on employing surface-code quantum error correction. In doing so, we propose a new quantum-computer architecture based on optical control of quantum dots. The time scales of physical-hardware operations and logical, error-corrected quantum gates differ by several orders of magnitude. By dividing functionality into layers, we can design and analyze subsystems independently, demonstrating the value of our layered architectural approach. Using this concrete hardware platform, we provide resource analysis for executing fault-tolerant quantum algorithms for integer factoring and quantum simulation, finding that the quantum-dot architecture we study could solve such problems on the time scale of days.

Quantum computing without wavefunctions: time-dependent density functional theory for universal quantum computation.

Science.gov (United States)

Tempel, David G; Aspuru-Guzik, Alán

2012-01-01

We prove that the theorems of TDDFT can be extended to a class of qubit Hamiltonians that are universal for quantum computation. The theorems of TDDFT applied to universal Hamiltonians imply that single-qubit expectation values can be used as the basic variables in quantum computation and information theory, rather than wavefunctions. From a practical standpoint this opens the possibility of approximating observables of interest in quantum computations directly in terms of single-qubit quantities (i.e. as density functionals). Additionally, we also demonstrate that TDDFT provides an exact prescription for simulating universal Hamiltonians with other universal Hamiltonians that have different, and possibly easier-to-realize two-qubit interactions. This establishes the foundations of TDDFT for quantum computation and opens the possibility of developing density functionals for use in quantum algorithms.

Identifying mechanisms in the control of quantum dynamics through Hamiltonian encoding

International Nuclear Information System (INIS)

Mitra, Abhra; Rabitz, Herschel

2003-01-01

A variety of means are now available to design control fields for manipulating the evolution of quantum systems. However, the underlying physical mechanisms often remain obscure, especially in the cases of strong fields and high quantum state congestion. This paper proposes a method to quantitatively determine the various pathways taken by a quantum system in going from the initial state to the final target. The mechanism is revealed by encoding a signal in the system Hamiltonian and decoding the resultant nonlinear distortion of the signal in the system time-evolution operator. The relevant interfering pathways determined by this analysis give insight into the physical mechanisms operative during the evolution of the quantum system. A hierarchy of mechanism identification algorithms with increasing ability to extract more detailed pathway information is presented. The mechanism identification concept is presented in the context of analyzing computer simulations of controlled dynamics. As illustrations of the concept, mechanisms are identified in the control of several simple, discrete-state quantum systems. The mechanism analysis tools reveal the roles of multiple interacting quantum pathways to maximally take advantage of constructive and destructive interference. Similar procedures may be applied directly in the laboratory to identify control mechanisms without resort to computer modeling, although this extension is not addressed in this paper

Simulation of quantum computers

NARCIS (Netherlands)

De Raedt, H; Michielsen, K; Hams, AH; Miyashita, S; Saito, K; Landau, DP; Lewis, SP; Schuttler, HB

2001-01-01

We describe a simulation approach to study the functioning of Quantum Computer hardware. The latter is modeled by a collection of interacting spin-1/2 objects. The time evolution of this spin system maps one-to-one to a quantum program carried out by the Quantum Computer. Our simulation software

Simulation of quantum computers

NARCIS (Netherlands)

Raedt, H. De; Michielsen, K.; Hams, A.H.; Miyashita, S.; Saito, K.

2000-01-01

We describe a simulation approach to study the functioning of Quantum Computer hardware. The latter is modeled by a collection of interacting spin-1/2 objects. The time evolution of this spin system maps one-to-one to a quantum program carried out by the Quantum Computer. Our simulation software

Universal blind quantum computation for hybrid system

Science.gov (United States)

Huang, He-Liang; Bao, Wan-Su; Li, Tan; Li, Feng-Guang; Fu, Xiang-Qun; Zhang, Shuo; Zhang, Hai-Long; Wang, Xiang

2017-08-01

As progress on the development of building quantum computer continues to advance, first-generation practical quantum computers will be available for ordinary users in the cloud style similar to IBM's Quantum Experience nowadays. Clients can remotely access the quantum servers using some simple devices. In such a situation, it is of prime importance to keep the security of the client's information. Blind quantum computation protocols enable a client with limited quantum technology to delegate her quantum computation to a quantum server without leaking any privacy. To date, blind quantum computation has been considered only for an individual quantum system. However, practical universal quantum computer is likely to be a hybrid system. Here, we take the first step to construct a framework of blind quantum computation for the hybrid system, which provides a more feasible way for scalable blind quantum computation.

Towards quantum chemistry on a quantum computer.

Science.gov (United States)

Lanyon, B P; Whitfield, J D; Gillett, G G; Goggin, M E; Almeida, M P; Kassal, I; Biamonte, J D; Mohseni, M; Powell, B J; Barbieri, M; Aspuru-Guzik, A; White, A G

2010-02-01

Exact first-principles calculations of molecular properties are currently intractable because their computational cost grows exponentially with both the number of atoms and basis set size. A solution is to move to a radically different model of computing by building a quantum computer, which is a device that uses quantum systems themselves to store and process data. Here we report the application of the latest photonic quantum computer technology to calculate properties of the smallest molecular system: the hydrogen molecule in a minimal basis. We calculate the complete energy spectrum to 20 bits of precision and discuss how the technique can be expanded to solve large-scale chemical problems that lie beyond the reach of modern supercomputers. These results represent an early practical step toward a powerful tool with a broad range of quantum-chemical applications.

Adiabatic Quantum Computing

Science.gov (United States)

Landahl, Andrew

2012-10-01

Quantum computers promise to exploit counterintuitive quantum physics principles like superposition, entanglement, and uncertainty to solve problems using fundamentally fewer steps than any conventional computer ever could. The mere possibility of such a device has sharpened our understanding of quantum coherent information, just as lasers did for our understanding of coherent light. The chief obstacle to developing quantum computer technology is decoherence--one of the fastest phenomena in all of physics. In principle, decoherence can be overcome by using clever entangled redundancies in a process called fault-tolerant quantum error correction. However, the quality and scale of technology required to realize this solution appears distant. An exciting alternative is a proposal called ``adiabatic'' quantum computing (AQC), in which adiabatic quantum physics keeps the computer in its lowest-energy configuration throughout its operation, rendering it immune to many decoherence sources. The Adiabatic Quantum Architectures In Ultracold Systems (AQUARIUS) Grand Challenge Project at Sandia seeks to demonstrate this robustness in the laboratory and point a path forward for future hardware development. We are building devices in AQUARIUS that realize the AQC architecture on up to three quantum bits (``qubits'') in two platforms: Cs atoms laser-cooled to below 5 microkelvin and Si quantum dots cryo-cooled to below 100 millikelvin. We are also expanding theoretical frontiers by developing methods for scalable universal AQC in these platforms. We have successfully demonstrated operational qubits in both platforms and have even run modest one-qubit calculations using our Cs device. In the course of reaching our primary proof-of-principle demonstrations, we have developed multiple spinoff technologies including nanofabricated diffractive optical elements that define optical-tweezer trap arrays and atomic-scale Si lithography commensurate with placing individual donor atoms with

Compiling gate networks on an Ising quantum computer

International Nuclear Information System (INIS)

Bowdrey, M.D.; Jones, J.A.; Knill, E.; Laflamme, R.

2005-01-01

Here we describe a simple mechanical procedure for compiling a quantum gate network into the natural gates (pulses and delays) for an Ising quantum computer. The aim is not necessarily to generate the most efficient pulse sequence, but rather to develop an efficient compilation algorithm that can be easily implemented in large spin systems. The key observation is that it is not always necessary to refocus all the undesired couplings in a spin system. Instead, the coupling evolution can simply be tracked and then corrected at some later time. Although described within the language of NMR, the algorithm is applicable to any design of quantum computer based on Ising couplings

Prospective Algorithms for Quantum Evolutionary Computation

OpenAIRE

Sofge, Donald A.

2008-01-01

This effort examines the intersection of the emerging field of quantum computing and the more established field of evolutionary computation. The goal is to understand what benefits quantum computing might offer to computational intelligence and how computational intelligence paradigms might be implemented as quantum programs to be run on a future quantum computer. We critically examine proposed algorithms and methods for implementing computational intelligence paradigms, primarily focused on ...

Visualizing a silicon quantum computer

International Nuclear Information System (INIS)

Sanders, Barry C; Hollenberg, Lloyd C L; Edmundson, Darran; Edmundson, Andrew

2008-01-01

Quantum computation is a fast-growing, multi-disciplinary research field. The purpose of a quantum computer is to execute quantum algorithms that efficiently solve computational problems intractable within the existing paradigm of 'classical' computing built on bits and Boolean gates. While collaboration between computer scientists, physicists, chemists, engineers, mathematicians and others is essential to the project's success, traditional disciplinary boundaries can hinder progress and make communicating the aims of quantum computing and future technologies difficult. We have developed a four minute animation as a tool for representing, understanding and communicating a silicon-based solid-state quantum computer to a variety of audiences, either as a stand-alone animation to be used by expert presenters or embedded into a longer movie as short animated sequences. The paper includes a generally applicable recipe for successful scientific animation production.

Visualizing a silicon quantum computer

Science.gov (United States)

Sanders, Barry C.; Hollenberg, Lloyd C. L.; Edmundson, Darran; Edmundson, Andrew

2008-12-01

Quantum computation is a fast-growing, multi-disciplinary research field. The purpose of a quantum computer is to execute quantum algorithms that efficiently solve computational problems intractable within the existing paradigm of 'classical' computing built on bits and Boolean gates. While collaboration between computer scientists, physicists, chemists, engineers, mathematicians and others is essential to the project's success, traditional disciplinary boundaries can hinder progress and make communicating the aims of quantum computing and future technologies difficult. We have developed a four minute animation as a tool for representing, understanding and communicating a silicon-based solid-state quantum computer to a variety of audiences, either as a stand-alone animation to be used by expert presenters or embedded into a longer movie as short animated sequences. The paper includes a generally applicable recipe for successful scientific animation production.

Visualizing a silicon quantum computer

Energy Technology Data Exchange (ETDEWEB)

Sanders, Barry C [Institute for Quantum Information Science, University of Calgary, Calgary, Alberta T2N 1N4 (Canada); Hollenberg, Lloyd C L [ARC Centre of Excellence for Quantum Computer Technology, School of Physics, University of Melbourne, Victoria 3010 (Australia); Edmundson, Darran; Edmundson, Andrew [EDM Studio Inc., Level 2, 850 16 Avenue SW, Calgary, Alberta T2R 0S9 (Canada)], E-mail: bsanders@qis.ucalgary.ca, E-mail: lloydch@unimelb.edu.au, E-mail: darran@edmstudio.com

2008-12-15

Quantum computation is a fast-growing, multi-disciplinary research field. The purpose of a quantum computer is to execute quantum algorithms that efficiently solve computational problems intractable within the existing paradigm of 'classical' computing built on bits and Boolean gates. While collaboration between computer scientists, physicists, chemists, engineers, mathematicians and others is essential to the project's success, traditional disciplinary boundaries can hinder progress and make communicating the aims of quantum computing and future technologies difficult. We have developed a four minute animation as a tool for representing, understanding and communicating a silicon-based solid-state quantum computer to a variety of audiences, either as a stand-alone animation to be used by expert presenters or embedded into a longer movie as short animated sequences. The paper includes a generally applicable recipe for successful scientific animation production.

Cryptography, quantum computation and trapped ions

Energy Technology Data Exchange (ETDEWEB)

Hughes, Richard J.

1998-03-01

The significance of quantum computation for cryptography is discussed. Following a brief survey of the requirements for quantum computational hardware, an overview of the ion trap quantum computation project at Los Alamos is presented. The physical limitations to quantum computation with trapped ions are analyzed and an assessment of the computational potential of the technology is made.

Computing quantum discord is NP-complete

International Nuclear Information System (INIS)

Huang, Yichen

2014-01-01

We study the computational complexity of quantum discord (a measure of quantum correlation beyond entanglement), and prove that computing quantum discord is NP-complete. Therefore, quantum discord is computationally intractable: the running time of any algorithm for computing quantum discord is believed to grow exponentially with the dimension of the Hilbert space so that computing quantum discord in a quantum system of moderate size is not possible in practice. As by-products, some entanglement measures (namely entanglement cost, entanglement of formation, relative entropy of entanglement, squashed entanglement, classical squashed entanglement, conditional entanglement of mutual information, and broadcast regularization of mutual information) and constrained Holevo capacity are NP-hard/NP-complete to compute. These complexity-theoretic results are directly applicable in common randomness distillation, quantum state merging, entanglement distillation, superdense coding, and quantum teleportation; they may offer significant insights into quantum information processing. Moreover, we prove the NP-completeness of two typical problems: linear optimization over classical states and detecting classical states in a convex set, providing evidence that working with classical states is generically computationally intractable. (paper)

Matchgate circuits and compressed quantum computation

International Nuclear Information System (INIS)

Boyajian, W.L.

2015-01-01

Simulating a quantum system with a classical computer seems to be an un- feasible task due to the exponential growths of the dimension of the Hilbert space as a function of the number of considered systems. This is why the classical simulation of quantum behavior is usually restricted to a few qubits, although the numerical methods became very powerful. However, as pointed out by [Feynman (1982)] and proven by [Llody (1996)] quantum systems can be used to simulate the behavior of the other. The former being such that constituents can be very precisely prepared, manipulated and measured. Many experiments are realizing such a simulation nowadays. Among them experiments utilizing ions in ion-traps, NMR or atoms in optical lattices (see for instance [Bloch et al. (2012); Lanyon et al. (2011); Houck et al. (2012)] and references therein). Here we are not concerned about this direct simulation of a quantum system. We are interested in a more economical way of simulating certain quantum behaviors. To this end, we are using the fact that some classes of quantum algorithms, among them those which are based on matchgates, can be simulated classically efficiently. Moreover, it can be shown that matchgate circuits can also be simulated by an exponentially smaller quantum computer [Jozsa et al. (2009)]. There, the classical computation is restricted in space such that the computation has to be performed by the quantum computer and cannot be performed by the classical computer. In fact, it has been shown that the computational power of matchgate circuits running on n qubits is equivalent to the one of space-bounded quantum computation with space restricted to being logarithmic in n [Jozsa et al. (2009)]. This thesis is organized as follows. In Part I, we recall some basic concepts of quantum mechanics, quantum computation and quantum simulation. Furthermore we discuss the main results of matchgate circuits and compressed quantum computation. We also recall the XY model and its

Faithful conversion of propagating quantum information to mechanical motion

Science.gov (United States)

Reed, A. P.; Mayer, K. H.; Teufel, J. D.; Burkhart, L. D.; Pfaff, W.; Reagor, M.; Sletten, L.; Ma, X.; Schoelkopf, R. J.; Knill, E.; Lehnert, K. W.

2017-12-01

The motion of micrometre-sized mechanical resonators can now be controlled and measured at the fundamental limits imposed by quantum mechanics. These resonators have been prepared in their motional ground state or in squeezed states, measured with quantum-limited precision, and even entangled with microwave fields. Such advances make it possible to process quantum information using the motion of a macroscopic object. In particular, recent experiments have combined mechanical resonators with superconducting quantum circuits to frequency-convert, store and amplify propagating microwave fields. But these systems have not been used to manipulate states that encode quantum bits (qubits), which are required for quantum communication and modular quantum computation. Here we demonstrate the conversion of propagating qubits encoded as superpositions of zero and one photons to the motion of a micromechanical resonator with a fidelity in excess of the classical bound. This ability is necessary for mechanical resonators to convert quantum information between the microwave and optical domains or to act as storage elements in a modular quantum information processor. Additionally, these results are an important step towards testing speculative notions that quantum theory may not be valid for sufficiently massive systems.

Quantumness beyond quantum mechanics

International Nuclear Information System (INIS)

Sanz, Ángel S

2012-01-01

Bohmian mechanics allows us to understand quantum systems in the light of other quantum traits than the well-known ones (coherence, diffraction, interference, tunnelling, discreteness, entanglement, etc.). Here the discussion focusses precisely on two of these interesting aspects, which arise when quantum mechanics is thought within this theoretical framework: the non-crossing property, which allows for distinguishability without erasing interference patterns, and the possibility to define quantum probability tubes, along which the probability remains constant all the way. Furthermore, taking into account this hydrodynamic-like description as a link, it is also shown how this knowledge (concepts and ideas) can be straightforwardly transferred to other fields of physics (for example, the transmission of light along waveguides).

Combined quantum and molecular mechanics (QM/MM).

Science.gov (United States)

Friesner, Richard A

2004-12-01

We describe the current state of the art of mixed quantum mechanics/molecular mechanics (QM/MM) methodology, with a particular focus on modeling of enzymatic reactions. Over the past decade, the effectiveness of these methods has increased dramatically, based on improved quantum chemical methods, advances in the description of the QM/MM interface, and reductions in the cost/performance of computing hardware. Two examples of pharmaceutically relevant applications, cytochrome P450 and class C β-lactamase, are presented.: © 2004 Elsevier Ltd . All rights reserved.

Towards topological quantum computer

Science.gov (United States)

Melnikov, D.; Mironov, A.; Mironov, S.; Morozov, A.; Morozov, An.

2018-01-01

Quantum R-matrices, the entangling deformations of non-entangling (classical) permutations, provide a distinguished basis in the space of unitary evolutions and, consequently, a natural choice for a minimal set of basic operations (universal gates) for quantum computation. Yet they play a special role in group theory, integrable systems and modern theory of non-perturbative calculations in quantum field and string theory. Despite recent developments in those fields the idea of topological quantum computing and use of R-matrices, in particular, practically reduce to reinterpretation of standard sets of quantum gates, and subsequently algorithms, in terms of available topological ones. In this paper we summarize a modern view on quantum R-matrix calculus and propose to look at the R-matrices acting in the space of irreducible representations, which are unitary for the real-valued couplings in Chern-Simons theory, as the fundamental set of universal gates for topological quantum computer. Such an approach calls for a more thorough investigation of the relation between topological invariants of knots and quantum algorithms.

Towards topological quantum computer

Directory of Open Access Journals (Sweden)

D. Melnikov

2018-01-01

Full Text Available Quantum R-matrices, the entangling deformations of non-entangling (classical permutations, provide a distinguished basis in the space of unitary evolutions and, consequently, a natural choice for a minimal set of basic operations (universal gates for quantum computation. Yet they play a special role in group theory, integrable systems and modern theory of non-perturbative calculations in quantum field and string theory. Despite recent developments in those fields the idea of topological quantum computing and use of R-matrices, in particular, practically reduce to reinterpretation of standard sets of quantum gates, and subsequently algorithms, in terms of available topological ones. In this paper we summarize a modern view on quantum R-matrix calculus and propose to look at the R-matrices acting in the space of irreducible representations, which are unitary for the real-valued couplings in Chern–Simons theory, as the fundamental set of universal gates for topological quantum computer. Such an approach calls for a more thorough investigation of the relation between topological invariants of knots and quantum algorithms.

Adiabatic quantum computation

Science.gov (United States)

Albash, Tameem; Lidar, Daniel A.

2018-01-01

Adiabatic quantum computing (AQC) started as an approach to solving optimization problems and has evolved into an important universal alternative to the standard circuit model of quantum computing, with deep connections to both classical and quantum complexity theory and condensed matter physics. This review gives an account of the major theoretical developments in the field, while focusing on the closed-system setting. The review is organized around a series of topics that are essential to an understanding of the underlying principles of AQC, its algorithmic accomplishments and limitations, and its scope in the more general setting of computational complexity theory. Several variants are presented of the adiabatic theorem, the cornerstone of AQC, and examples are given of explicit AQC algorithms that exhibit a quantum speedup. An overview of several proofs of the universality of AQC and related Hamiltonian quantum complexity theory is given. Considerable space is devoted to stoquastic AQC, the setting of most AQC work to date, where obstructions to success and their possible resolutions are discussed.

A Heterogeneous Quantum Computer Architecture

NARCIS (Netherlands)

Fu, X.; Riesebos, L.; Lao, L.; Garcia Almudever, C.; Sebastiano, F.; Versluis, R.; Charbon, E.; Bertels, K.

2016-01-01

In this paper, we present a high level view of the heterogeneous quantum computer architecture as any future quantum computer will consist of both a classical and quantum computing part. The classical part is needed for error correction as well as for the execution of algorithms that contain both

Quantum opto-mechanics with micromirrors : combining nano-mechanics with quantum optics

International Nuclear Information System (INIS)

Groeblacher, S.

2010-01-01

This work describes more than four years of research on the effects of the radiation-pressure force of light on macroscopic mechanical structures. The basic system studied here is a mechanical oscillator that is highly reflective and part of an optical resonator. It interacts with the optical cavity mode via the radiation-pressure force. Both the dynamics of the mechanical oscillation and the properties of the light field are modified through this interaction. In our experiments we use quantum optical tools (such as homodyning and down-conversion) with the goal of ultimately showing quantum behavior of the mechanical center of mass motion. In this thesis we present several experiments that pave the way towards this goal and when combined should allow the demonstration of the envisioned quantum phenomena, including entanglement, teleportation and Schroeodinger cat states. The study of quantum behavior of truly macroscopic systems is a long outstanding goal, which will help to answer some of the most fundamental questions in quantum physics today: Why is the world around us classical and not quantum? Is there a size- or mass-limit to systems for them to behave according to quantum mechanics? Is quantum theory complete or do we have to extend it to include mechanisms such as decoherence? Can we use the quantum nature of macroscopic objects to, for example, improve the measurement precision of classical apparatuses? The experiments discussed in this thesis include the very first passive radiation-pressure cooling of a mechanical oscillator in a cryogenic optical resonator, as well as the experimental demonstration of radiation-pressure cooling close to the mechanical quantum ground state. Cooling of the mechanical motion is an important pre-condition for observing quantum effects of the mechanical oscillator. In another experiment, we have demonstrated that we are able to enter the strong-coupling regime of the optomechanical system a regime where coherent energy

Adiabatic quantum computation and quantum annealing theory and practice

CERN Document Server

McGeoch, Catherine C

2014-01-01

Adiabatic quantum computation (AQC) is an alternative to the better-known gate model of quantum computation. The two models are polynomially equivalent, but otherwise quite dissimilar: one property that distinguishes AQC from the gate model is its analog nature. Quantum annealing (QA) describes a type of heuristic search algorithm that can be implemented to run in the ``native instruction set'''' of an AQC platform. D-Wave Systems Inc. manufactures {quantum annealing processor chips} that exploit quantum properties to realize QA computations in hardware. The chips form the centerpiece of a nov

Searching with Quantum Computers

OpenAIRE

Grover, Lov K.

2000-01-01

This article introduces quantum computation by analogy with probabilistic computation. A basic description of the quantum search algorithm is given by representing the algorithm as a C program in a novel way.

Quantum mechanics

International Nuclear Information System (INIS)

Rae, A.I.M.

1981-01-01

This book, based on a thirty lecture course given to students at the beginning of their second year, covers the quantum mechanics required by physics undergraduates. Early chapters deal with wave mechanics, including a discussion of the energy states of the hydrogen atom. These are followed by a more formal development of the theory, leading to a discussion of some advanced applications and an introduction to the conceptual problems associated with quantum measurement theory. Emphasis is placed on the fundamentals of quantum mechanics. Problems are included at the end of each chapter. (U.K.)

Quantum mechanics

CERN Document Server

Powell, John L

2015-01-01

Suitable for advanced undergraduates, this thorough text focuses on the role of symmetry operations and the essentially algebraic structure of quantum-mechanical theory. Based on courses in quantum mechanics taught by the authors, the treatment provides numerous problems that require applications of theory and serve to supplement the textual material.Starting with a historical introduction to the origins of quantum theory, the book advances to discussions of the foundations of wave mechanics, wave packets and the uncertainty principle, and an examination of the Schrödinger equation that includ

Simulating chemistry using quantum computers.

Science.gov (United States)

Kassal, Ivan; Whitfield, James D; Perdomo-Ortiz, Alejandro; Yung, Man-Hong; Aspuru-Guzik, Alán

2011-01-01

The difficulty of simulating quantum systems, well known to quantum chemists, prompted the idea of quantum computation. One can avoid the steep scaling associated with the exact simulation of increasingly large quantum systems on conventional computers, by mapping the quantum system to another, more controllable one. In this review, we discuss to what extent the ideas in quantum computation, now a well-established field, have been applied to chemical problems. We describe algorithms that achieve significant advantages for the electronic-structure problem, the simulation of chemical dynamics, protein folding, and other tasks. Although theory is still ahead of experiment, we outline recent advances that have led to the first chemical calculations on small quantum information processors.

Layered Architectures for Quantum Computers and Quantum Repeaters

Science.gov (United States)

Jones, Nathan C.

This chapter examines how to organize quantum computers and repeaters using a systematic framework known as layered architecture, where machine control is organized in layers associated with specialized tasks. The framework is flexible and could be used for analysis and comparison of quantum information systems. To demonstrate the design principles in practice, we develop architectures for quantum computers and quantum repeaters based on optically controlled quantum dots, showing how a myriad of technologies must operate synchronously to achieve fault-tolerance. Optical control makes information processing in this system very fast, scalable to large problem sizes, and extendable to quantum communication.

Quantum entanglement and quantum computational algorithms

Indian Academy of Sciences (India)

Abstract. The existence of entangled quantum states gives extra power to quantum computers over their classical counterparts. Quantum entanglement shows up qualitatively at the level of two qubits. We demonstrate that the one- and the two-bit Deutsch-Jozsa algorithm does not require entanglement and can be mapped ...

Quantum mechanics

CERN Document Server

Mandl, Franz

1992-01-01

The Manchester Physics Series General Editors: D. J. Sandiford; F. Mandl; A. C. Phillips Department of Physics and Astronomy, University of Manchester Properties of Matter B. H. Flowers and E. Mendoza Optics Second Edition F. G. Smith and J. H. Thomson Statistical Physics Second Edition F. Mandl Electromagnetism Second Edition I. S. Grant and W. R. Phillips Statistics R. J. Barlow Solid State Physics Second Edition J. R. Hook and H. E. Hall Quantum Mechanics F. Mandl Particle Physics Second Edition B. R. Martin and G. Shaw The Physics of Stars Second Edition A. C. Phillips Computing for Scient

Building logical qubits in a superconducting quantum computing system

Science.gov (United States)

Gambetta, Jay M.; Chow, Jerry M.; Steffen, Matthias

2017-01-01

The technological world is in the midst of a quantum computing and quantum information revolution. Since Richard Feynman's famous `plenty of room at the bottom' lecture (Feynman, Engineering and Science23, 22 (1960)), hinting at the notion of novel devices employing quantum mechanics, the quantum information community has taken gigantic strides in understanding the potential applications of a quantum computer and laid the foundational requirements for building one. We believe that the next significant step will be to demonstrate a quantum memory, in which a system of interacting qubits stores an encoded logical qubit state longer than the incorporated parts. Here, we describe the important route towards a logical memory with superconducting qubits, employing a rotated version of the surface code. The current status of technology with regards to interconnected superconducting-qubit networks will be described and near-term areas of focus to improve devices will be identified. Overall, the progress in this exciting field has been astounding, but we are at an important turning point, where it will be critical to incorporate engineering solutions with quantum architectural considerations, laying the foundation towards scalable fault-tolerant quantum computers in the near future.

I, Quantum Robot: Quantum Mind control on a Quantum Computer

OpenAIRE

Zizzi, Paola

2008-01-01

The logic which describes quantum robots is not orthodox quantum logic, but a deductive calculus which reproduces the quantum tasks (computational processes, and actions) taking into account quantum superposition and quantum entanglement. A way toward the realization of intelligent quantum robots is to adopt a quantum metalanguage to control quantum robots. A physical implementation of a quantum metalanguage might be the use of coherent states in brain signals.

Minimal ancilla mediated quantum computation

International Nuclear Information System (INIS)

Proctor, Timothy J.; Kendon, Viv

2014-01-01

Schemes of universal quantum computation in which the interactions between the computational elements, in a computational register, are mediated by some ancillary system are of interest due to their relevance to the physical implementation of a quantum computer. Furthermore, reducing the level of control required over both the ancillary and register systems has the potential to simplify any experimental implementation. In this paper we consider how to minimise the control needed to implement universal quantum computation in an ancilla-mediated fashion. Considering computational schemes which require no measurements and hence evolve by unitary dynamics for the global system, we show that when employing an ancilla qubit there are certain fixed-time ancilla-register interactions which, along with ancilla initialisation in the computational basis, are universal for quantum computation with no additional control of either the ancilla or the register. We develop two distinct models based on locally inequivalent interactions and we then discuss the relationship between these unitary models and the measurement-based ancilla-mediated models known as ancilla-driven quantum computation. (orig.)

Emergent mechanics, quantum and un-quantum

Science.gov (United States)

Ralston, John P.

2013-10-01

There is great interest in quantum mechanics as an "emergent" phenomenon. The program holds that nonobvious patterns and laws can emerge from complicated physical systems operating by more fundamental rules. We find a new approach where quantum mechanics itself should be viewed as an information management tool not derived from physics nor depending on physics. The main accomplishment of quantum-style theory comes in expanding the notion of probability. We construct a map from macroscopic information as data" to quantum probability. The map allows a hidden variable description for quantum states, and efficient use of the helpful tools of quantum mechanics in unlimited circumstances. Quantum dynamics via the time-dependent Shroedinger equation or operator methods actually represents a restricted class of classical Hamiltonian or Lagrangian dynamics, albeit with different numbers of degrees of freedom. We show that under wide circumstances such dynamics emerges from structureless dynamical systems. The uses of the quantum information management tools are illustrated by numerical experiments and practical applications

Intrinsic quantum computation

International Nuclear Information System (INIS)

Crutchfield, James P.; Wiesner, Karoline

2008-01-01

We introduce ways to measure information storage in quantum systems, using a recently introduced computation-theoretic model that accounts for measurement effects. The first, the quantum excess entropy, quantifies the shared information between a quantum process's past and its future. The second, the quantum transient information, determines the difficulty with which an observer comes to know the internal state of a quantum process through measurements. We contrast these with von Neumann entropy and quantum entropy rate and provide a closed-form expression for the latter for the class of deterministic quantum processes

Fractional quantum mechanics

CERN Document Server

Laskin, Nick

2018-01-01

Fractional quantum mechanics is a recently emerged and rapidly developing field of quantum physics. This is the first monograph on fundamentals and physical applications of fractional quantum mechanics, written by its founder. The fractional Schrödinger equation and the fractional path integral are new fundamental physical concepts introduced and elaborated in the book. The fractional Schrödinger equation is a manifestation of fractional quantum mechanics. The fractional path integral is a new mathematical tool based on integration over Lévy flights. The fractional path integral method enhances the well-known Feynman path integral framework. Related topics covered in the text include time fractional quantum mechanics, fractional statistical mechanics, fractional classical mechanics and the α-stable Lévy random process. The book is well-suited for theorists, pure and applied mathematicians, solid-state physicists, chemists, and others working with the Schrödinger equation, the path integral technique...

Coherent Dynamics of a Hybrid Quantum Spin-Mechanical Oscillator System

Science.gov (United States)

Lee, Kenneth William, III

A fully functional quantum computer must contain at least two important components: a quantum memory for storing and manipulating quantum information and a quantum data bus to securely transfer information between quantum memories. Typically, a quantum memory is composed of a matter system, such as an atom or an electron spin, due to their prolonged quantum coherence. Alternatively, a quantum data bus is typically composed of some propagating degree of freedom, such as a photon, which can retain quantum information over long distances. Therefore, a quantum computer will likely be a hybrid quantum device, consisting of two or more disparate quantum systems. However, there must be a reliable and controllable quantum interface between the memory and bus in order to faithfully interconvert quantum information. The current engineering challenge for quantum computers is scaling the device to large numbers of controllable quantum systems, which will ultimately depend on the choice of the quantum elements and interfaces utilized in the device. In this thesis, we present and characterize a hybrid quantum device comprised of single nitrogen-vacancy (NV) centers embedded in a high quality factor diamond mechanical oscillator. The electron spin of the NV center is a leading candidate for the realization of a quantum memory due to its exceptional quantum coherence times. On the other hand, mechanical oscillators are highly sensitive to a wide variety of external forces, and have the potential to serve as a long-range quantum bus between quantum systems of disparate energy scales. These two elements are interfaced through crystal strain generated by vibrations of the mechanical oscillator. Importantly, a strain interface allows for a scalable architecture, and furthermore, opens the door to integration into a larger quantum network through coupling to an optical interface. There are a few important engineering challenges associated with this device. First, there have been no

Relationship between quantum walks and relativistic quantum mechanics

International Nuclear Information System (INIS)

Chandrashekar, C. M.; Banerjee, Subhashish; Srikanth, R.

2010-01-01

Quantum walk models have been used as an algorithmic tool for quantum computation and to describe various physical processes. This article revisits the relationship between relativistic quantum mechanics and the quantum walks. We show the similarities of the mathematical structure of the decoupled and coupled forms of the discrete-time quantum walk to that of the Klein-Gordon and Dirac equations, respectively. In the latter case, the coin emerges as an analog of the spinor degree of freedom. Discrete-time quantum walk as a coupled form of the continuous-time quantum walk is also shown by transforming the decoupled form of the discrete-time quantum walk to the Schroedinger form. By showing the coin to be a means to make the walk reversible and that the Dirac-like structure is a consequence of the coin use, our work suggests that the relativistic causal structure is a consequence of conservation of information. However, decoherence (modeled by projective measurements on position space) generates entropy that increases with time, making the walk irreversible and thereby producing an arrow of time. The Lieb-Robinson bound is used to highlight the causal structure of the quantum walk to put in perspective the relativistic structure of the quantum walk, the maximum speed of walk propagation, and earlier findings related to the finite spread of the walk probability distribution. We also present a two-dimensional quantum walk model on a two-state system to which the study can be extended.

Quantum Computations: Fundamentals and Algorithms

International Nuclear Information System (INIS)

Duplij, S.A.; Shapoval, I.I.

2007-01-01

Basic concepts of quantum information theory, principles of quantum calculations and the possibility of creation on this basis unique on calculation power and functioning principle device, named quantum computer, are concerned. The main blocks of quantum logic, schemes of quantum calculations implementation, as well as some known today effective quantum algorithms, called to realize advantages of quantum calculations upon classical, are presented here. Among them special place is taken by Shor's algorithm of number factorization and Grover's algorithm of unsorted database search. Phenomena of decoherence, its influence on quantum computer stability and methods of quantum errors correction are described

Hybrid quantum computation

International Nuclear Information System (INIS)

Sehrawat, Arun; Englert, Berthold-Georg; Zemann, Daniel

2011-01-01

We present a hybrid model of the unitary-evolution-based quantum computation model and the measurement-based quantum computation model. In the hybrid model, part of a quantum circuit is simulated by unitary evolution and the rest by measurements on star graph states, thereby combining the advantages of the two standard quantum computation models. In the hybrid model, a complicated unitary gate under simulation is decomposed in terms of a sequence of single-qubit operations, the controlled-z gates, and multiqubit rotations around the z axis. Every single-qubit and the controlled-z gate are realized by a respective unitary evolution, and every multiqubit rotation is executed by a single measurement on a required star graph state. The classical information processing in our model requires only an information flow vector and propagation matrices. We provide the implementation of multicontrol gates in the hybrid model. They are very useful for implementing Grover's search algorithm, which is studied as an illustrative example.

On the hypothesis that quantum mechanism manifests classical mechanics: Numerical approach to the correspondence in search of quantum chaos

International Nuclear Information System (INIS)

Lee, Sang-Bong.

1993-09-01

Quantum manifestation of classical chaos has been one of the extensively studied subjects for more than a decade. Yet clear understanding of its nature still remains to be an open question partly due to the lack of a canonical definition of quantum chaos. The classical definition seems to be unsuitable in quantum mechanics partly because of the Heisenberg quantum uncertainty. In this regard, quantum chaos is somewhat misleading and needs to be clarified at the very fundamental level of physics. Since it is well known that quantum mechanics is more fundamental than classical mechanics, the quantum description of classically chaotic nature should be attainable in the limit of large quantum numbers. The focus of my research, therefore, lies on the correspondence principle for classically chaotic systems. The chaotic damped driven pendulum is mainly studied numerically using the split operator method that solves the time-dependent Schroedinger equation. For classically dissipative chaotic systems in which (multi)fractal strange attractors often emerge, several quantum dissipative mechanisms are also considered. For instance, Hoover's and Kubo-Fox-Keizer's approaches are studied with some computational analyses. But the notion of complex energy with non-Hermiticity is extensively applied. Moreover, the Wigner and Husimi distribution functions are examined with an equivalent classical distribution in phase-space, and dynamical properties of the wave packet in configuration and momentum spaces are also explored. The results indicate that quantum dynamics embraces classical dynamics although the classicalquantum correspondence fails to be observed in the classically chaotic regime. Even in the semi-classical limits, classically chaotic phenomena would eventually be suppressed by the quantum uncertainty

Multi-party Quantum Computation

OpenAIRE

Smith, Adam

2001-01-01

We investigate definitions of and protocols for multi-party quantum computing in the scenario where the secret data are quantum systems. We work in the quantum information-theoretic model, where no assumptions are made on the computational power of the adversary. For the slightly weaker task of verifiable quantum secret sharing, we give a protocol which tolerates any t < n/4 cheating parties (out of n). This is shown to be optimal. We use this new tool to establish that any multi-party quantu...

Quantum mechanics.Text and exercise book. 2. upd. ed.

International Nuclear Information System (INIS)

Griffiths, David J.

2012-01-01

The modern life would be without quantum mechanics no more imaginable - on their laws are founded transistors, computer chips, mobile telephones, flat displays, and numerous other things of daily life. An understanding of this theory is indispensable in order to be able to settle a matter with questions of temporary physics. Griffith's ''Intorduction to Quantum Mechanics'' presents the fundamental laws of quantum mechanics, puts carefully the mathematical foundations of the theory, and presents essential applications of quantum mechanics from the hydrogen atom until Schroedinger's cat. This book applies to studyings of natural sciences, especially of physics. It is concipated for studyings of bachelor courses at universities and throws a bridge between the conceptual core of quantum mechanics and the mathematically often expensive application to real problems. For this numerous problems are completely worked out in order to fill the matter with life. Rounded off are all chapters by a manifold of problems of all degrees of difficulty, which allow the studyings to deepen their knowledge and apply immediately. Beside a course accompanying the ''Introduction to Quantum Mechanics'' is therefore also suited for the self-study.

General Quantum Interference Principle and Duality Computer

International Nuclear Information System (INIS)

Long Guilu

2006-01-01

In this article, we propose a general principle of quantum interference for quantum system, and based on this we propose a new type of computing machine, the duality computer, that may outperform in principle both classical computer and the quantum computer. According to the general principle of quantum interference, the very essence of quantum interference is the interference of the sub-waves of the quantum system itself. A quantum system considered here can be any quantum system: a single microscopic particle, a composite quantum system such as an atom or a molecule, or a loose collection of a few quantum objects such as two independent photons. In the duality computer, the wave of the duality computer is split into several sub-waves and they pass through different routes, where different computing gate operations are performed. These sub-waves are then re-combined to interfere to give the computational results. The quantum computer, however, has only used the particle nature of quantum object. In a duality computer, it may be possible to find a marked item from an unsorted database using only a single query, and all NP-complete problems may have polynomial algorithms. Two proof-of-the-principle designs of the duality computer are presented: the giant molecule scheme and the nonlinear quantum optics scheme. We also propose thought experiment to check the related fundamental issues, the measurement efficiency of a partial wave function.

Lie algebra in quantum physics by means of computer algebra

OpenAIRE

Kikuchi, Ichio; Kikuchi, Akihito

2017-01-01

This article explains how to apply the computer algebra package GAP (www.gap-system.org) in the computation of the problems in quantum physics, in which the application of Lie algebra is necessary. The article contains several exemplary computations which readers would follow in the desktop PC: such as, the brief review of elementary ideas of Lie algebra, the angular momentum in quantum mechanics, the quark eight-fold way model, and the usage of Weyl character formula (in order to construct w...

A novel quantum solution to secure two-party distance computation

Science.gov (United States)

Peng, Zhen-wan; Shi, Run-hua; Wang, Pan-hong; Zhang, Shun

2018-06-01

Secure Two-Party Distance Computation is an important primitive of Secure Multiparty Computational Geometry that it involves two parties, where each party has a private point, and the two parties want to jointly compute the distance between their points without revealing anything about their respective private information. Secure Two-Party Distance Computation has very important and potential applications in settings of high secure requirements, such as privacy-preserving Determination of Spatial Location-Relation, Determination of Polygons Similarity, and so on. In this paper, we present a quantum protocol for Secure Two-Party Distance Computation by using QKD-based Quantum Private Query. The security of the protocol is based on the physical principles of quantum mechanics, instead of difficulty assumptions, and therefore, it can ensure higher security than the classical related protocols.

Supersymmetric Quantum Mechanics and Topology

International Nuclear Information System (INIS)

Wasay, Muhammad Abdul

2016-01-01

Supersymmetric quantum mechanical models are computed by the path integral approach. In the β→0 limit, the integrals localize to the zero modes. This allows us to perform the index computations exactly because of supersymmetric localization, and we will show how the geometry of target space enters the physics of sigma models resulting in the relationship between the supersymmetric model and the geometry of the target space in the form of topological invariants. Explicit computation details are given for the Euler characteristics of the target manifold and the index of Dirac operator for the model on a spin manifold.

Quantum mechanics with quantum time

International Nuclear Information System (INIS)

Kapuscik, E.

1984-01-01

Using a non-canonical Lie structure of classical mechanics a new algebra of quantum mechanical observables is constructed. The new algebra, in addition to the notion of classical time, makes it possible to introduce the notion of quantum time. A new type of uncertainty relation is derived. (author)

Scalable quantum computer architecture with coupled donor-quantum dot qubits

Science.gov (United States)

Schenkel, Thomas; Lo, Cheuk Chi; Weis, Christoph; Lyon, Stephen; Tyryshkin, Alexei; Bokor, Jeffrey

2014-08-26

A quantum bit computing architecture includes a plurality of single spin memory donor atoms embedded in a semiconductor layer, a plurality of quantum dots arranged with the semiconductor layer and aligned with the donor atoms, wherein a first voltage applied across at least one pair of the aligned quantum dot and donor atom controls a donor-quantum dot coupling. A method of performing quantum computing in a scalable architecture quantum computing apparatus includes arranging a pattern of single spin memory donor atoms in a semiconductor layer, forming a plurality of quantum dots arranged with the semiconductor layer and aligned with the donor atoms, applying a first voltage across at least one aligned pair of a quantum dot and donor atom to control a donor-quantum dot coupling, and applying a second voltage between one or more quantum dots to control a Heisenberg exchange J coupling between quantum dots and to cause transport of a single spin polarized electron between quantum dots.

Disciplines, models, and computers: the path to computational quantum chemistry.

Science.gov (United States)

Lenhard, Johannes

2014-12-01

Many disciplines and scientific fields have undergone a computational turn in the past several decades. This paper analyzes this sort of turn by investigating the case of computational quantum chemistry. The main claim is that the transformation from quantum to computational quantum chemistry involved changes in three dimensions. First, on the side of instrumentation, small computers and a networked infrastructure took over the lead from centralized mainframe architecture. Second, a new conception of computational modeling became feasible and assumed a crucial role. And third, the field of computa- tional quantum chemistry became organized in a market-like fashion and this market is much bigger than the number of quantum theory experts. These claims will be substantiated by an investigation of the so-called density functional theory (DFT), the arguably pivotal theory in the turn to computational quantum chemistry around 1990.

A perspective on quantum mechanics calculations in ADMET predictions.

Science.gov (United States)

Bowen, J Phillip; Güner, Osman F

2013-01-01

Understanding the molecular basis of drug action has been an important objective for pharmaceutical scientists. With the increasing speed of computers and the implementation of quantum chemistry methodologies, pharmacodynamic and pharmacokinetic problems have become more computationally tractable. Historically the former has been the focus of drug design, but within the last two decades efforts to understand the latter have increased. It takes about fifteen years and over $1 billion dollars for a drug to go from laboratory hit, through lead optimization, to final approval by the U.S. Food and Drug Administration. While the costs have increased substantially, the overall clinical success rate for a compound to emerge from clinical trials is approximately 10%. Most of the attrition rate can be traced to ADMET (absorption, distribution, metabolism, excretion, and toxicity) problems, which is a powerful impetus to study these issues at an earlier stage in drug discovery. Quantum mechanics offers pharmaceutical scientists the opportunity to investigate pharmacokinetic problems at the molecular level prior to laboratory preparation and testing. This review will provide a perspective on the use of quantum mechanics or a combination of quantum mechanics coupled with other classical methods in the pharmacokinetic phase of drug discovery. A brief overview of the essential features of theory will be discussed, and a few carefully selected examples will be given to highlight the computational methods.

Quantum machine learning what quantum computing means to data mining

CERN Document Server

Wittek, Peter

2014-01-01

Quantum Machine Learning bridges the gap between abstract developments in quantum computing and the applied research on machine learning. Paring down the complexity of the disciplines involved, it focuses on providing a synthesis that explains the most important machine learning algorithms in a quantum framework. Theoretical advances in quantum computing are hard to follow for computer scientists, and sometimes even for researchers involved in the field. The lack of a step-by-step guide hampers the broader understanding of this emergent interdisciplinary body of research. Quantum Machine L

One-way quantum computing in superconducting circuits

Science.gov (United States)

Albarrán-Arriagada, F.; Alvarado Barrios, G.; Sanz, M.; Romero, G.; Lamata, L.; Retamal, J. C.; Solano, E.

2018-03-01

We propose a method for the implementation of one-way quantum computing in superconducting circuits. Measurement-based quantum computing is a universal quantum computation paradigm in which an initial cluster state provides the quantum resource, while the iteration of sequential measurements and local rotations encodes the quantum algorithm. Up to now, technical constraints have limited a scalable approach to this quantum computing alternative. The initial cluster state can be generated with available controlled-phase gates, while the quantum algorithm makes use of high-fidelity readout and coherent feedforward. With current technology, we estimate that quantum algorithms with above 20 qubits may be implemented in the path toward quantum supremacy. Moreover, we propose an alternative initial state with properties of maximal persistence and maximal connectedness, reducing the required resources of one-way quantum computing protocols.

Simple example of definitions of truth, validity, consistency, and completeness in quantum mechanics

International Nuclear Information System (INIS)

Benioff, P.

1999-01-01

Besides their use for efficient computation, quantum computers and quantum robots form a base for studying quantum systems that create valid physical theories using mathematics and physics. If quantum mechanics is universally applicable, then quantum mechanics must describe its own validation by these quantum systems. An essential part of this process is the development of a coherent theory of mathematics and quantum-mechanics together. It is expected that such a theory will include a coherent combination of mathematical logical concepts with quantum mechanics. That this might be possible is shown here by defining truth, validity, consistency, and completeness for a quantum-mechanical version of a simple (classical) expression enumeration machine described by Smullyan. Some of the expressions are chosen as sentences denoting the presence or absence of other expressions in the enumeration. Two of the sentences are self-referential. It is seen that, for an interpretation based on a Feynman path sum over expression paths, truth, consistency, and completeness for the quantum system have different properties than for the classical system. For instance, the truth of a sentence S is defined only on those paths containing S. It is undefined elsewhere. Also S and its negation can both be true provided they appear on separate paths. This satisfies the definition of consistency. The definitions of validity and completeness connect the dynamics of the system to the truth of the sentences. It is proved that validity implies consistency. It is seen that the requirements of validity and maximal completeness strongly restrict the allowable dynamics for the quantum system. Aspects of the existence of a valid, maximally complete dynamics are discussed. An exponentially efficient quantum computer is described that is also valid and complete for the set of sentences considered here. copyright 1999 The American Physical Society

ASCR Workshop on Quantum Computing for Science

Energy Technology Data Exchange (ETDEWEB)

Aspuru-Guzik, Alan [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Van Dam, Wim [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Farhi, Edward [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Gaitan, Frank [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Humble, Travis [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Jordan, Stephen [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Landahl, Andrew J [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Love, Peter [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Lucas, Robert [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Preskill, John [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Muller, Richard P. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Svore, Krysta [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Wiebe, Nathan [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Williams, Carl [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

2015-06-01

This report details the findings of the DOE ASCR Workshop on Quantum Computing for Science that was organized to assess the viability of quantum computing technologies to meet the computational requirements of the DOE’s science and energy mission, and to identify the potential impact of quantum technologies. The workshop was held on February 17-18, 2015, in Bethesda, MD, to solicit input from members of the quantum computing community. The workshop considered models of quantum computation and programming environments, physical science applications relevant to DOE's science mission as well as quantum simulation, and applied mathematics topics including potential quantum algorithms for linear algebra, graph theory, and machine learning. This report summarizes these perspectives into an outlook on the opportunities for quantum computing to impact problems relevant to the DOE’s mission as well as the additional research required to bring quantum computing to the point where it can have such impact.

Quantum mechanics. An introduction

International Nuclear Information System (INIS)

Lesch, H.

2008-01-01

The following topics are dealt with: The way to quantum mechanics starting from thermal radiation and the stability of matter, Heisenberg's uncertainty relation, the impact of quantum mechanics on technology, the description of the big bang by means of quantum mechanics

Quantum chemical approaches: semiempirical molecular orbital and hybrid quantum mechanical/molecular mechanical techniques.

Science.gov (United States)

Bryce, Richard A; Hillier, Ian H

2014-01-01

The use of computational quantum chemical methods to aid drug discovery is surveyed. An overview of the various computational models spanning ab initio, density function theory, semiempirical molecular orbital (MO), and hybrid quantum mechanical (QM)/molecular mechanical (MM) methods is given and their strengths and weaknesses are highlighted, focussing on the challenge of obtaining the accuracy essential for them to make a meaningful contribution to drug discovery. Particular attention is given to hybrid QM/MM and semiempirical MO methods which have the potential to yield the necessary accurate predictions of macromolecular structure and reactivity. These methods are shown to have advanced the study of many aspects of substrate-ligand interactions relevant to drug discovery. Thus, the successful parametrization of semiempirical MO methods and QM/MM methods can be used to model noncovalent substrate-protein interactions, and to lead to improved scoring functions. QM/MM methods can be used in crystal structure refinement and are particularly valuable for modelling covalent protein-ligand interactions and can thus aid the design of transition state analogues. An extensive collection of examples from the areas of metalloenzyme structure, enzyme inhibition, and ligand binding affinities and scoring functions are used to illustrate the power of these techniques.

Programmable architecture for quantum computing

NARCIS (Netherlands)

Chen, J.; Wang, L.; Charbon, E.; Wang, B.

2013-01-01

A programmable architecture called “quantum FPGA (field-programmable gate array)” (QFPGA) is presented for quantum computing, which is a hybrid model combining the advantages of the qubus system and the measurement-based quantum computation. There are two kinds of buses in QFPGA, the local bus and

Quantum mechanics

CERN Document Server

Fitzpatrick, Richard

2015-01-01

Quantum mechanics was developed during the first few decades of the twentieth century via a series of inspired guesses made by various physicists, including Planck, Einstein, Bohr, Schroedinger, Heisenberg, Pauli, and Dirac. All these scientists were trying to construct a self-consistent theory of microscopic dynamics that was compatible with experimental observations. The purpose of this book is to present quantum mechanics in a clear, concise, and systematic fashion, starting from the fundamental postulates, and developing the theory in as logical manner as possible. Topics covered in the book include the fundamental postulates of quantum mechanics, angular momentum, time-dependent and time-dependent perturbation theory, scattering theory, identical particles, and relativistic electron theory.

Classicality in quantum mechanics

Energy Technology Data Exchange (ETDEWEB)

Dreyer, Olaf [Theoretical Physics, Blackett Laboratory, Imperial College London, London, SW7 2AZ (United Kingdom)

2007-05-15

In this article we propose a solution to the measurement problem in quantum mechanics. We point out that the measurement problem can be traced to an a priori notion of classicality in the formulation of quantum mechanics. If this notion of classicality is dropped and instead classicality is defined in purely quantum mechanical terms the measurement problem can be avoided. We give such a definition of classicality. It identifies classicality as a property of large quantum system. We show how the probabilistic nature of quantum mechanics is a result of this notion of classicality. We also comment on what the implications of this view are for the search of a quantum theory of gravity.

Classicality in quantum mechanics

International Nuclear Information System (INIS)

Dreyer, Olaf

2007-01-01

In this article we propose a solution to the measurement problem in quantum mechanics. We point out that the measurement problem can be traced to an a priori notion of classicality in the formulation of quantum mechanics. If this notion of classicality is dropped and instead classicality is defined in purely quantum mechanical terms the measurement problem can be avoided. We give such a definition of classicality. It identifies classicality as a property of large quantum system. We show how the probabilistic nature of quantum mechanics is a result of this notion of classicality. We also comment on what the implications of this view are for the search of a quantum theory of gravity

Software Systems for High-performance Quantum Computing

Energy Technology Data Exchange (ETDEWEB)

Humble, Travis S [ORNL; Britt, Keith A [ORNL

2016-01-01

Quantum computing promises new opportunities for solving hard computational problems, but harnessing this novelty requires breakthrough concepts in the design, operation, and application of computing systems. We define some of the challenges facing the development of quantum computing systems as well as software-based approaches that can be used to overcome these challenges. Following a brief overview of the state of the art, we present models for the quantum programming and execution models, the development of architectures for hybrid high-performance computing systems, and the realization of software stacks for quantum networking. This leads to a discussion of the role that conventional computing plays in the quantum paradigm and how some of the current challenges for exascale computing overlap with those facing quantum computing.

Quantum Computing and the Limits of the Efficiently Computable

CERN Multimedia

CERN. Geneva

2015-01-01

I'll discuss how computational complexity---the study of what can and can't be feasibly computed---has been interacting with physics in interesting and unexpected ways. I'll first give a crash course about computer science's P vs. NP problem, as well as about the capabilities and limits of quantum computers. I'll then touch on speculative models of computation that would go even beyond quantum computers, using (for example) hypothetical nonlinearities in the Schrodinger equation. Finally, I'll discuss BosonSampling ---a proposal for a simple form of quantum computing, which nevertheless seems intractable to simulate using a classical computer---as well as the role of computational complexity in the black hole information puzzle.

Relativistic quantum mechanics

International Nuclear Information System (INIS)

Ollitrault, J.Y.

1998-12-01

These notes form an introduction to relativistic quantum mechanics. The mathematical formalism has been reduced to the minimum in order to enable the reader to calculate elementary physical processes. The second quantification and the field theory are the logical followings of this course. The reader is expected to know analytical mechanics (Lagrangian and Hamiltonian), non-relativistic quantum mechanics and some basis of restricted relativity. The purpose of the first 3 chapters is to define the quantum mechanics framework for already known notions about rotation transformations, wave propagation and restricted theory of relativity. The next 3 chapters are devoted to the application of relativistic quantum mechanics to a particle with 0,1/5 and 1 spin value. The last chapter deals with the processes involving several particles, these processes require field theory framework to be thoroughly described. (A.C.)

Molecular Magnets for Quantum Computation

Science.gov (United States)

Kuroda, Takayoshi

2009-06-01

We review recent progress in molecular magnets especially in the viewpoint of the application for quantum computing. After a brief introduction to single-molecule magnets (SMMs), a method for qubit manipulation by using non-equidistant spin sublevels of a SMM will be introduced. A weakly-coupled dimer of two SMMs is also a candidate for quantum computing, which shows no quantum tunneling of magnetization (QTM) at zero field. In the AF ring Cr7Ni system, the large tunnel splitting is a great advantage to reduce decoherence during manipulation, which can be a possible candidate to realize quantum computer devices in future.

Triple-server blind quantum computation using entanglement swapping

Science.gov (United States)

Li, Qin; Chan, Wai Hong; Wu, Chunhui; Wen, Zhonghua

2014-04-01

Blind quantum computation allows a client who does not have enough quantum resources or technologies to achieve quantum computation on a remote quantum server such that the client's input, output, and algorithm remain unknown to the server. Up to now, single- and double-server blind quantum computation have been considered. In this work, we propose a triple-server blind computation protocol where the client can delegate quantum computation to three quantum servers by the use of entanglement swapping. Furthermore, the three quantum servers can communicate with each other and the client is almost classical since one does not require any quantum computational power, quantum memory, and the ability to prepare any quantum states and only needs to be capable of getting access to quantum channels.

Strictly contractive quantum channels and physically realizable quantum computers

International Nuclear Information System (INIS)

Raginsky, Maxim

2002-01-01

We study the robustness of quantum computers under the influence of errors modeled by strictly contractive channels. A channel T is defined to be strictly contractive if, for any pair of density operators ρ, σ in its domain, parallel Tρ-Tσ parallel 1 ≤k parallel ρ-σ parallel 1 for some 0≤k 1 denotes the trace norm). In other words, strictly contractive channels render the states of the computer less distinguishable in the sense of quantum detection theory. Starting from the premise that all experimental procedures can be carried out with finite precision, we argue that there exists a physically meaningful connection between strictly contractive channels and errors in physically realizable quantum computers. We show that, in the absence of error correction, sensitivity of quantum memories and computers to strictly contractive errors grows exponentially with storage time and computation time, respectively, and depends only on the constant k and the measurement precision. We prove that strict contractivity rules out the possibility of perfect error correction, and give an argument that approximate error correction, which covers previous work on fault-tolerant quantum computation as a special case, is possible

Faster than Hermitian Quantum Mechanics

International Nuclear Information System (INIS)

Bender, Carl M.; Brody, Dorje C.; Jones, Hugh F.; Meister, Bernhard K.

2007-01-01

Given an initial quantum state vertical bar ψ I > and a final quantum state vertical bar ψ F >, there exist Hamiltonians H under which vertical bar ψ I > evolves into vertical bar ψ F >. Consider the following quantum brachistochrone problem: subject to the constraint that the difference between the largest and smallest eigenvalues of H is held fixed, which H achieves this transformation in the least time τ? For Hermitian Hamiltonians τ has a nonzero lower bound. However, among non-Hermitian PT-symmetric Hamiltonians satisfying the same energy constraint, τ can be made arbitrarily small without violating the time-energy uncertainty principle. This is because for such Hamiltonians the path from vertical bar ψ I > to vertical bar ψ F > can be made short. The mechanism described here is similar to that in general relativity in which the distance between two space-time points can be made small if they are connected by a wormhole. This result may have applications in quantum computing

Adiabatic quantum computing

OpenAIRE

Lobe, Elisabeth; Stollenwerk, Tobias; Tröltzsch, Anke

2015-01-01

In the recent years, the field of adiabatic quantum computing has gained importance due to the advances in the realisation of such machines, especially by the company D-Wave Systems. These machines are suited to solve discrete optimisation problems which are typically very hard to solve on a classical computer. Due to the quantum nature of the device it is assumed that there is a substantial speedup compared to classical HPC facilities. We explain the basic principles of adiabatic ...

Quantum Computing in Solid State Systems

CERN Document Server

Ruggiero, B; Granata, C

2006-01-01

The aim of Quantum Computation in Solid State Systems is to report on recent theoretical and experimental results on the macroscopic quantum coherence of mesoscopic systems, as well as on solid state realization of qubits and quantum gates. Particular attention has been given to coherence effects in Josephson devices. Other solid state systems, including quantum dots, optical, ion, and spin devices which exhibit macroscopic quantum coherence are also discussed. Quantum Computation in Solid State Systems discusses experimental implementation of quantum computing and information processing devices, and in particular observations of quantum behavior in several solid state systems. On the theoretical side, the complementary expertise of the contributors provides models of the various structures in connection with the problem of minimizing decoherence.

Machine Learning and Quantum Mechanics

Science.gov (United States)

Chapline, George

The author has previously pointed out some similarities between selforganizing neural networks and quantum mechanics. These types of neural networks were originally conceived of as away of emulating the cognitive capabilities of the human brain. Recently extensions of these networks, collectively referred to as deep learning networks, have strengthened the connection between self-organizing neural networks and human cognitive capabilities. In this note we consider whether hardware quantum devices might be useful for emulating neural networks with human-like cognitive capabilities, or alternatively whether implementations of deep learning neural networks using conventional computers might lead to better algorithms for solving the many body Schrodinger equation.

Quantum Computing and Second Quantization

International Nuclear Information System (INIS)

Makaruk, Hanna Ewa

2017-01-01

Quantum computers are by their nature many particle quantum systems. Both the many-particle arrangement and being quantum are necessary for the existence of the entangled states, which are responsible for the parallelism of the quantum computers. Second quantization is a very important approximate method of describing such systems. This lecture will present the general idea of the second quantization, and discuss shortly some of the most important formulations of second quantization.

Quantum computing for pattern classification

OpenAIRE

Schuld, Maria; Sinayskiy, Ilya; Petruccione, Francesco

2014-01-01

It is well known that for certain tasks, quantum computing outperforms classical computing. A growing number of contributions try to use this advantage in order to improve or extend classical machine learning algorithms by methods of quantum information theory. This paper gives a brief introduction into quantum machine learning using the example of pattern classification. We introduce a quantum pattern classification algorithm that draws on Trugenberger's proposal for measuring the Hamming di...

Use of Nonequilibrium Work Methods to Compute Free Energy Differences Between Molecular Mechanical and Quantum Mechanical Representations of Molecular Systems.

Science.gov (United States)

Hudson, Phillip S; Woodcock, H Lee; Boresch, Stefan

2015-12-03

Carrying out free energy simulations (FES) using quantum mechanical (QM) Hamiltonians remains an attractive, albeit elusive goal. Renewed efforts in this area have focused on using "indirect" thermodynamic cycles to connect "low level" simulation results to "high level" free energies. The main obstacle to computing converged free energy results between molecular mechanical (MM) and QM (ΔA(MM→QM)), as recently demonstrated by us and others, is differences in the so-called "stiff" degrees of freedom (e.g., bond stretching) between the respective energy surfaces. Herein, we demonstrate that this problem can be efficiently circumvented using nonequilibrium work (NEW) techniques, i.e., Jarzynski's and Crooks' equations. Initial applications of computing ΔA(NEW)(MM→QM), for blocked amino acids alanine and serine as well as to generate butane's potentials of mean force via the indirect QM/MM FES method, showed marked improvement over traditional FES approaches.

Energy Dissipation in Quantum Computers

OpenAIRE

Granik, A.; Chapline, G.

2003-01-01

A method is described for calculating the heat generated in a quantum computer due to loss of quantum phase information. Amazingly enough, this heat generation can take place at zero temperature. and may explain why it is impossible to extract energy from vacuum fluctuations. Implications for optical computers and quantum cosmology are also briefly discussed.

Efficient one-way quantum computations for quantum error correction

International Nuclear Information System (INIS)

Huang Wei; Wei Zhaohui

2009-01-01

We show how to explicitly construct an O(nd) size and constant quantum depth circuit which encodes any given n-qubit stabilizer code with d generators. Our construction is derived using the graphic description for stabilizer codes and the one-way quantum computation model. Our result demonstrates how to use cluster states as scalable resources for many multi-qubit entangled states and how to use the one-way quantum computation model to improve the design of quantum algorithms.

Models of optical quantum computing

Directory of Open Access Journals (Sweden)

Krovi Hari

2017-03-01

Full Text Available I review some work on models of quantum computing, optical implementations of these models, as well as the associated computational power. In particular, we discuss the circuit model and cluster state implementations using quantum optics with various encodings such as dual rail encoding, Gottesman-Kitaev-Preskill encoding, and coherent state encoding. Then we discuss intermediate models of optical computing such as boson sampling and its variants. Finally, we review some recent work in optical implementations of adiabatic quantum computing and analog optical computing. We also provide a brief description of the relevant aspects from complexity theory needed to understand the results surveyed.

Quantum computing

OpenAIRE

Burba, M.; Lapitskaya, T.

2017-01-01

This article gives an elementary introduction to quantum computing. It is a draft for a book chapter of the "Handbook of Nature-Inspired and Innovative Computing", Eds. A. Zomaya, G.J. Milburn, J. Dongarra, D. Bader, R. Brent, M. Eshaghian-Wilner, F. Seredynski (Springer, Berlin Heidelberg New York, 2006).

Quantum computing for physics research

International Nuclear Information System (INIS)

Georgeot, B.

2006-01-01

Quantum computers hold great promises for the future of computation. In this paper, this new kind of computing device is presented, together with a short survey of the status of research in this field. The principal algorithms are introduced, with an emphasis on the applications of quantum computing to physics. Experimental implementations are also briefly discussed

Quantum computing with incoherent resources and quantum jumps.

Science.gov (United States)

Santos, M F; Cunha, M Terra; Chaves, R; Carvalho, A R R

2012-04-27

Spontaneous emission and the inelastic scattering of photons are two natural processes usually associated with decoherence and the reduction in the capacity to process quantum information. Here we show that, when suitably detected, these photons are sufficient to build all the fundamental blocks needed to perform quantum computation in the emitting qubits while protecting them from deleterious dissipative effects. We exemplify this by showing how to efficiently prepare graph states for the implementation of measurement-based quantum computation.

Quantum mechanics for pedestrians

CERN Document Server

Pade, Jochen

2014-01-01

This book provides an introduction into the fundamentals of non-relativistic quantum mechanics. In Part 1, the essential principles are developed. Applications and extensions of the formalism can be found in Part 2. The book includes not only material that is presented in traditional textbooks on quantum mechanics, but also discusses in detail current issues such as interaction-free quantum measurements, neutrino oscillations, various topics in the field of quantum information as well as fundamental problems and epistemological questions, such as the measurement problem, entanglement, Bell's inequality, decoherence, and the realism debate. A chapter on current interpretations of quantum mechanics concludes the book. To develop quickly and clearly the main principles of quantum mechanics and its mathematical formulation, there is a systematic change between wave mechanics and algebraic representation in the first chapters. The required mathematical tools are introduced step by step. Moreover, the appendix coll...

From Monte Carlo to Quantum Computation

OpenAIRE

Heinrich, Stefan

2001-01-01

Quantum computing was so far mainly concerned with discrete problems. Recently, E. Novak and the author studied quantum algorithms for high dimensional integration and dealt with the question, which advantages quantum computing can bring over classical deterministic or randomized methods for this type of problem. In this paper we give a short introduction to the basic ideas of quantum computing and survey recent results on high dimensional integration. We discuss connections to the Monte Carl...

Self-guaranteed measurement-based quantum computation

Science.gov (United States)

Hayashi, Masahito; Hajdušek, Michal

2018-05-01

In order to guarantee the output of a quantum computation, we usually assume that the component devices are trusted. However, when the total computation process is large, it is not easy to guarantee the whole system when we have scaling effects, unexpected noise, or unaccounted for correlations between several subsystems. If we do not trust the measurement basis or the prepared entangled state, we do need to be worried about such uncertainties. To this end, we propose a self-guaranteed protocol for verification of quantum computation under the scheme of measurement-based quantum computation where no prior-trusted devices (measurement basis or entangled state) are needed. The approach we present enables the implementation of verifiable quantum computation using the measurement-based model in the context of a particular instance of delegated quantum computation where the server prepares the initial computational resource and sends it to the client, who drives the computation by single-qubit measurements. Applying self-testing procedures, we are able to verify the initial resource as well as the operation of the quantum devices and hence the computation itself. The overhead of our protocol scales with the size of the initial resource state to the power of 4 times the natural logarithm of the initial state's size.

Faster quantum chemistry simulation on fault-tolerant quantum computers

International Nuclear Information System (INIS)

Cody Jones, N; McMahon, Peter L; Yamamoto, Yoshihisa; Whitfield, James D; Yung, Man-Hong; Aspuru-Guzik, Alán; Van Meter, Rodney

2012-01-01

Quantum computers can in principle simulate quantum physics exponentially faster than their classical counterparts, but some technical hurdles remain. We propose methods which substantially improve the performance of a particular form of simulation, ab initio quantum chemistry, on fault-tolerant quantum computers; these methods generalize readily to other quantum simulation problems. Quantum teleportation plays a key role in these improvements and is used extensively as a computing resource. To improve execution time, we examine techniques for constructing arbitrary gates which perform substantially faster than circuits based on the conventional Solovay–Kitaev algorithm (Dawson and Nielsen 2006 Quantum Inform. Comput. 6 81). For a given approximation error ϵ, arbitrary single-qubit gates can be produced fault-tolerantly and using a restricted set of gates in time which is O(log ϵ) or O(log log ϵ); with sufficient parallel preparation of ancillas, constant average depth is possible using a method we call programmable ancilla rotations. Moreover, we construct and analyze efficient implementations of first- and second-quantized simulation algorithms using the fault-tolerant arbitrary gates and other techniques, such as implementing various subroutines in constant time. A specific example we analyze is the ground-state energy calculation for lithium hydride. (paper)

Principles of quantum computation and information volume II

International Nuclear Information System (INIS)

Kok, P

2007-01-01

Any new textbook in quantum information has some pretty strong competition to contend with. Not only is there the classic text by Nielsen and Chuang from 2000, but also John Preskill's lecture notes, available for free online. Nevertheless, a proper textbook seems more enduring than online notes, and the field has progressed considerably in the seven years since Nielsen and Chuang was published. A new textbook is a great opportunity to give a snapshot of our current state of knowledge in quantum information. Therein also lies a problem: The field has expanded so much that it is impossible to cover everything at the undergraduate level. Quantum information theory is relevant to an extremely large portion of physics, from solid state and condensed matter physics to particle physics. Every discipline that has some relation to quantum mechanics is affected by our understanding of quantum information theory. Those who wish to write a book on quantum information therefore have to make some profound choices: Do you keep the ultimate aim of a quantum computer in mind, or do you focus on quantum communication and precision measurements as well? Do you describe how to build a quantum computer with all possible physical systems or do you present only the underlying principles? Do you include only the tried and tested ideas, or will you also explore more speculative directions? You don't have to take a black-or-white stance on these questions, but how you approach them will profoundly determine the character of your book. The authors of 'Principles of Quantum Computation and Information (Volume II: Basic Tools and Special Topics)' have chosen to focus on the construction of quantum computers, but restrict themselves mainly to general techniques. Only in the last chapter do they explicitly address the issues that arise in the different implementations. The book is the second volume in a series, and consists of four chapters (labelled 5 to 8) called 'Quantum Information Theory

Toward a superconducting quantum computer. Harnessing macroscopic quantum coherence.

Science.gov (United States)

Tsai, Jaw-Shen

2010-01-01

Intensive research on the construction of superconducting quantum computers has produced numerous important achievements. The quantum bit (qubit), based on the Josephson junction, is at the heart of this research. This macroscopic system has the ability to control quantum coherence. This article reviews the current state of quantum computing as well as its history, and discusses its future. Although progress has been rapid, the field remains beset with unsolved issues, and there are still many new research opportunities open to physicists and engineers.

Methods for Efficiently and Accurately Computing Quantum Mechanical Free Energies for Enzyme Catalysis.

Science.gov (United States)

Kearns, F L; Hudson, P S; Boresch, S; Woodcock, H L

2016-01-01

Enzyme activity is inherently linked to free energies of transition states, ligand binding, protonation/deprotonation, etc.; these free energies, and thus enzyme function, can be affected by residue mutations, allosterically induced conformational changes, and much more. Therefore, being able to predict free energies associated with enzymatic processes is critical to understanding and predicting their function. Free energy simulation (FES) has historically been a computational challenge as it requires both the accurate description of inter- and intramolecular interactions and adequate sampling of all relevant conformational degrees of freedom. The hybrid quantum mechanical molecular mechanical (QM/MM) framework is the current tool of choice when accurate computations of macromolecular systems are essential. Unfortunately, robust and efficient approaches that employ the high levels of computational theory needed to accurately describe many reactive processes (ie, ab initio, DFT), while also including explicit solvation effects and accounting for extensive conformational sampling are essentially nonexistent. In this chapter, we will give a brief overview of two recently developed methods that mitigate several major challenges associated with QM/MM FES: the QM non-Boltzmann Bennett's acceptance ratio method and the QM nonequilibrium work method. We will also describe usage of these methods to calculate free energies associated with (1) relative properties and (2) along reaction paths, using simple test cases with relevance to enzymes examples. © 2016 Elsevier Inc. All rights reserved.

Why quantum mechanics?

International Nuclear Information System (INIS)

Landsberg, P.T.

1988-01-01

It is suggested that an oversight occurred in classical mechanics when time-derivatives of observables were treated on the same footing as the undifferentiated observables. Removal of this oversight points in the direction of quantum mechanics. Additional light is thrown on uncertainty relations and on quantum mechanics, as a possible form of a subtle statistical mechanics, by the formulation of a classical uncertainty relation for a very simple model. The existence of universal motion, i.e., of zero-point energy, is lastly made plausible in terms of a gravitational constant which is time-dependent. By these three considerations an attempt is made to link classical and quantum mechanics together more firmly, thus giving a better understanding of the latter

Computational Multiqubit Tunnelling in Programmable Quantum Annealers

Science.gov (United States)

2016-08-25

ARTICLE Received 3 Jun 2015 | Accepted 26 Nov 2015 | Published 7 Jan 2016 Computational multiqubit tunnelling in programmable quantum annealers...state itself. Quantum tunnelling has been hypothesized as an advantageous physical resource for optimization in quantum annealing. However, computational ...qubit tunnelling plays a computational role in a currently available programmable quantum annealer. We devise a probe for tunnelling, a computational

Massively parallel quantum computer simulator

NARCIS (Netherlands)

De Raedt, K.; Michielsen, K.; De Raedt, H.; Trieu, B.; Arnold, G.; Richter, M.; Lippert, Th.; Watanabe, H.; Ito, N.

2007-01-01

We describe portable software to simulate universal quantum computers on massive parallel Computers. We illustrate the use of the simulation software by running various quantum algorithms on different computer architectures, such as a IBM BlueGene/L, a IBM Regatta p690+, a Hitachi SR11000/J1, a Cray

Quantum Accelerators for High-performance Computing Systems

Energy Technology Data Exchange (ETDEWEB)

Humble, Travis S. [ORNL; Britt, Keith A. [ORNL; Mohiyaddin, Fahd A. [ORNL

2017-11-01

We define some of the programming and system-level challenges facing the application of quantum processing to high-performance computing. Alongside barriers to physical integration, prominent differences in the execution of quantum and conventional programs challenges the intersection of these computational models. Following a brief overview of the state of the art, we discuss recent advances in programming and execution models for hybrid quantum-classical computing. We discuss a novel quantum-accelerator framework that uses specialized kernels to offload select workloads while integrating with existing computing infrastructure. We elaborate on the role of the host operating system to manage these unique accelerator resources, the prospects for deploying quantum modules, and the requirements placed on the language hierarchy connecting these different system components. We draw on recent advances in the modeling and simulation of quantum computing systems with the development of architectures for hybrid high-performance computing systems and the realization of software stacks for controlling quantum devices. Finally, we present simulation results that describe the expected system-level behavior of high-performance computing systems composed from compute nodes with quantum processing units. We describe performance for these hybrid systems in terms of time-to-solution, accuracy, and energy consumption, and we use simple application examples to estimate the performance advantage of quantum acceleration.

Quantifying Quantum-Mechanical Processes.

Science.gov (United States)

Hsieh, Jen-Hsiang; Chen, Shih-Hsuan; Li, Che-Ming

2017-10-19

The act of describing how a physical process changes a system is the basis for understanding observed phenomena. For quantum-mechanical processes in particular, the affect of processes on quantum states profoundly advances our knowledge of the natural world, from understanding counter-intuitive concepts to the development of wholly quantum-mechanical technology. Here, we show that quantum-mechanical processes can be quantified using a generic classical-process model through which any classical strategies of mimicry can be ruled out. We demonstrate the success of this formalism using fundamental processes postulated in quantum mechanics, the dynamics of open quantum systems, quantum-information processing, the fusion of entangled photon pairs, and the energy transfer in a photosynthetic pigment-protein complex. Since our framework does not depend on any specifics of the states being processed, it reveals a new class of correlations in the hierarchy between entanglement and Einstein-Podolsky-Rosen steering and paves the way for the elaboration of a generic method for quantifying physical processes.

Classical Mechanics as Nonlinear Quantum Mechanics

International Nuclear Information System (INIS)

Nikolic, Hrvoje

2007-01-01

All measurable predictions of classical mechanics can be reproduced from a quantum-like interpretation of a nonlinear Schroedinger equation. The key observation leading to classical physics is the fact that a wave function that satisfies a linear equation is real and positive, rather than complex. This has profound implications on the role of the Bohmian classical-like interpretation of linear quantum mechanics, as well as on the possibilities to find a consistent interpretation of arbitrary nonlinear generalizations of quantum mechanics

Benchmarking gate-based quantum computers

Science.gov (United States)

Michielsen, Kristel; Nocon, Madita; Willsch, Dennis; Jin, Fengping; Lippert, Thomas; De Raedt, Hans

2017-11-01

With the advent of public access to small gate-based quantum processors, it becomes necessary to develop a benchmarking methodology such that independent researchers can validate the operation of these processors. We explore the usefulness of a number of simple quantum circuits as benchmarks for gate-based quantum computing devices and show that circuits performing identity operations are very simple, scalable and sensitive to gate errors and are therefore very well suited for this task. We illustrate the procedure by presenting benchmark results for the IBM Quantum Experience, a cloud-based platform for gate-based quantum computing.

Prologue to super quantum mechanics something is rotten in the state of quantum mechanics

CERN Document Server

Vaguine, Victor

2012-01-01

Since its foundation more than eight decades ago, quantum mechanics has been plagued by enigmas, mysteries and paradoxes and held hostage by quantum positivism. This fact strongly suggests that something is fundamentally wrong with the quantum mechanics paradigm. The best scientific minds, such as Albert Einstein, Louis de Broglie, David Bohm, Richard Feynman and others have spent years of their professional lives attempting to find resolution to the quantum mechanics predicament, with not much success. A shift of the quantum mechanics paradigm toward a deeper physics theory is long overdue.

Biomolecular Structure Information from High-Speed Quantum Mechanical Electronic Spectra Calculation.

Science.gov (United States)

Seibert, Jakob; Bannwarth, Christoph; Grimme, Stefan

2017-08-30

A fully quantum mechanical (QM) treatment to calculate electronic absorption (UV-vis) and circular dichroism (CD) spectra of typical biomolecules with thousands of atoms is presented. With our highly efficient sTDA-xTB method, spectra averaged along structures from molecular dynamics (MD) simulations can be computed in a reasonable time frame on standard desktop computers. This way, nonequilibrium structure and conformational, as well as purely quantum mechanical effects like charge-transfer or exciton-coupling, are included. Different from other contemporary approaches, the entire system is treated quantum mechanically and neither fragmentation nor system-specific adjustment is necessary. Among the systems considered are a large DNA fragment, oligopeptides, and even entire proteins in an implicit solvent. We propose the method in tandem with experimental spectroscopy or X-ray studies for the elucidation of complex (bio)molecular structures including metallo-proteins like myoglobin.

p-Adic quantum mechanics

International Nuclear Information System (INIS)

Vladimirov, V.S.; Volovich, I.V.

1988-01-01

Quantum mechanics above the field of p-adic numbers is constructed. Three formulations of p-adic quantum mechanics are considered: 1) quantum mechanics with complex-valued wave functions and p-adic coordinates and pulses; an approach based on Weyl representation is suggested; 2) the probability (Euclidean) formulation; 3) the secondary quantization representation (Fock representation) with p-adic wave functions

Quantum Mechanics: Fundamentals; Advanced Quantum Mechanics; Mathematical Concepts of Quantum Mechanics

International Nuclear Information System (INIS)

Whitaker, A

2004-01-01

This review is of three books, all published by Springer, all on quantum theory at a level above introductory, but very different in content, style and intended audience. That of Gottfried and Yan is of exceptional interest, historical and otherwise. It is a second edition of Gottfried's well-known book published by Benjamin in 1966. This was written as a text for a graduate quantum mechanics course, and has become one of the most used and respected accounts of quantum theory, at a level mathematically respectable but not rigorous. Topics absent from the first edition but included in the second include the Feynman path integral, seen in 1966 as an imaginative but not very useful formulation of quantum theory. Feynman methods were given only a cursory mention by Gottfried. Other new topics include semiclassical quantum mechanics, motion in a magnetic field, the S matrix and inelastic collisions, radiation and scattering of light, identical particle systems and the Dirac equation. A topic that was all but totally neglected in 1966, but which has flourished increasingly since, is that of the foundations of quantum theory. To commence with general discussion of the new book, the authors recognise that the graduate student of today almost certainly has substantial experience of wave mechanics, and is probably familiar with the Dirac formalism. The new edition has been almost entirely rewritten; even at the level of basic text, it is difficult to trace sentences or paragraphs that have moved unscathed from one edition to the next. As well as the new topics, many of the old ones are discussed in much greater depth, and the general organisation is entirely different. As compared with the steady rise in level of the 1966 edition, the level of this book is fairly consistent throughout, and from the perspective of a beginning graduate student, I would estimate, a little tough. To sum up, Gottfried and Yan's book contains a vast amount of knowledge and understanding. The

ysteries, Puzzles, and Paradoxes in Quantum Mechanics. Proceedings

International Nuclear Information System (INIS)

Rodolfo, B.

1999-01-01

These proceedings represent papers presented at the Mysteries, Puzzles, and Paradoxes in Quantum Mechanics Workshop held in Italy, in August 1998. The Workshop was devoted to recent experimental and theoretical advances such as new interference, effects, the quantum eraser, non-disturbing and Schroedinger-cat-like states, experiments, EPR correlations, teleportation, superluminal effects, quantum information and computing, locality and causality, decoherence and measurement theory. Tachyonic information transfer was also discussed. There were 45 papers presented at the conference,out of which 2 have been abstracted for the Energy, Science and Technology database

Fermionic One-Way Quantum Computation

International Nuclear Information System (INIS)

Cao Xin; Shang Yun

2014-01-01

Fermions, as another major class of quantum particles, could be taken as carriers for quantum information processing beyond spins or bosons. In this work, we consider the fermionic generalization of the one-way quantum computation model and find that one-way quantum computation can also be simulated with fermions. In detail, using the n → 2n encoding scheme from a spin system to a fermion system, we introduce the fermionic cluster state, then the universal computing power with a fermionic cluster state is demonstrated explicitly. Furthermore, we show that the fermionic cluster state can be created only by measurements on at most four modes with |+〉 f (fermionic Bell state) being free

Testing Nonassociative Quantum Mechanics.

Science.gov (United States)

Bojowald, Martin; Brahma, Suddhasattwa; Büyükçam, Umut

2015-11-27

The familiar concepts of state vectors and operators in quantum mechanics rely on associative products of observables. However, these notions do not apply to some exotic systems such as magnetic monopoles, which have long been known to lead to nonassociative algebras. Their quantum physics has remained obscure. This Letter presents the first derivation of potentially testable physical results in nonassociative quantum mechanics, based on effective potentials. They imply new effects which cannot be mimicked in usual quantum mechanics with standard magnetic fields.

Manin's quantum spaces and standard quantum mechanics

International Nuclear Information System (INIS)

Floratos, E.G.

1990-01-01

Manin's non-commutative coordinate algebra of quantum groups is shown to be identical, for unitary coordinates, with the conventional operator algebras of quantum mechanics. The deformation parameter q is a pure phase for unitary coordinates. When q is a root of unity. Manin's algebra becomes the matrix algebra of quantum mechanics for a discretized and finite phase space. Implications for quantum groups and the associated non-commutative differential calculus of Wess and Zumino are discussed. (orig.)

Numerical characteristics of quantum computer simulation

Science.gov (United States)

Chernyavskiy, A.; Khamitov, K.; Teplov, A.; Voevodin, V.; Voevodin, Vl.

2016-12-01

The simulation of quantum circuits is significantly important for the implementation of quantum information technologies. The main difficulty of such modeling is the exponential growth of dimensionality, thus the usage of modern high-performance parallel computations is relevant. As it is well known, arbitrary quantum computation in circuit model can be done by only single- and two-qubit gates, and we analyze the computational structure and properties of the simulation of such gates. We investigate the fact that the unique properties of quantum nature lead to the computational properties of the considered algorithms: the quantum parallelism make the simulation of quantum gates highly parallel, and on the other hand, quantum entanglement leads to the problem of computational locality during simulation. We use the methodology of the AlgoWiki project (algowiki-project.org) to analyze the algorithm. This methodology consists of theoretical (sequential and parallel complexity, macro structure, and visual informational graph) and experimental (locality and memory access, scalability and more specific dynamic characteristics) parts. Experimental part was made by using the petascale Lomonosov supercomputer (Moscow State University, Russia). We show that the simulation of quantum gates is a good base for the research and testing of the development methods for data intense parallel software, and considered methodology of the analysis can be successfully used for the improvement of the algorithms in quantum information science.

Nonadiabatic corrections to a quantum dot quantum computer ...

Indian Academy of Sciences (India)

2014-07-02

Jul 2, 2014 ... corrections in it. If the decoherence times of a quantum dot computer are ∼100 ns [J M Kikkawa and D D Awschalom, Phys. Rev. Lett. 80, 4313 (1998)] then the predicted number of one qubit gate (primitive) operations of the Loss–DiVincenzo quantum computer in such an interval of time must be >1010.

Plasmonic resonances of nanoparticles from large-scale quantum mechanical simulations

Science.gov (United States)

Zhang, Xu; Xiang, Hongping; Zhang, Mingliang; Lu, Gang

2017-09-01

Plasmonic resonance of metallic nanoparticles results from coherent motion of its conduction electrons, driven by incident light. For the nanoparticles less than 10 nm in diameter, localized surface plasmonic resonances become sensitive to the quantum nature of the conduction electrons. Unfortunately, quantum mechanical simulations based on time-dependent Kohn-Sham density functional theory are computationally too expensive to tackle metal particles larger than 2 nm. Herein, we introduce the recently developed time-dependent orbital-free density functional theory (TD-OFDFT) approach which enables large-scale quantum mechanical simulations of plasmonic responses of metallic nanostructures. Using TD-OFDFT, we have performed quantum mechanical simulations to understand size-dependent plasmonic response of Na nanoparticles and plasmonic responses in Na nanoparticle dimers and trimers. An outlook of future development of the TD-OFDFT method is also presented.

Quantum mechanics

CERN Document Server

Ghosh, P K

2014-01-01

Quantum mechanics, designed for advanced undergraduate and graduate students of physics, mathematics and chemistry, provides a concise yet self-contained introduction to the formal framework of quantum mechanics, its application to physical problems and the interpretation of the theory. Starting with a review of some of the necessary mathematics, the basic concepts are carefully developed in the text. After building a general formalism, detailed treatment of the standard material - the harmonic oscillator, the hydrogen atom, angular momentum theory, symmetry transformations, approximation methods, identical particle and many-particle systems, and scattering theory - is presented. The concluding chapter discusses the interpretation of quantum mechanics. Some of the important topics discussed in the book are the rigged Hilbert space, deformation quantization, path integrals, coherent states, geometric phases, decoherene, etc. This book is characterized by clarity and coherence of presentation.

Adiabatic quantum computing with spin qubits hosted by molecules.

Science.gov (United States)

Yamamoto, Satoru; Nakazawa, Shigeaki; Sugisaki, Kenji; Sato, Kazunobu; Toyota, Kazuo; Shiomi, Daisuke; Takui, Takeji

2015-01-28

A molecular spin quantum computer (MSQC) requires electron spin qubits, which pulse-based electron spin/magnetic resonance (ESR/MR) techniques can afford to manipulate for implementing quantum gate operations in open shell molecular entities. Importantly, nuclear spins, which are topologically connected, particularly in organic molecular spin systems, are client qubits, while electron spins play a role of bus qubits. Here, we introduce the implementation for an adiabatic quantum algorithm, suggesting the possible utilization of molecular spins with optimized spin structures for MSQCs. We exemplify the utilization of an adiabatic factorization problem of 21, compared with the corresponding nuclear magnetic resonance (NMR) case. Two molecular spins are selected: one is a molecular spin composed of three exchange-coupled electrons as electron-only qubits and the other an electron-bus qubit with two client nuclear spin qubits. Their electronic spin structures are well characterized in terms of the quantum mechanical behaviour in the spin Hamiltonian. The implementation of adiabatic quantum computing/computation (AQC) has, for the first time, been achieved by establishing ESR/MR pulse sequences for effective spin Hamiltonians in a fully controlled manner of spin manipulation. The conquered pulse sequences have been compared with the NMR experiments and shown much faster CPU times corresponding to the interaction strength between the spins. Significant differences are shown in rotational operations and pulse intervals for ESR/MR operations. As a result, we suggest the advantages and possible utilization of the time-evolution based AQC approach for molecular spin quantum computers and molecular spin quantum simulators underlain by sophisticated ESR/MR pulsed spin technology.

Geometry of quantum computation with qutrits.

Science.gov (United States)

Li, Bin; Yu, Zu-Huan; Fei, Shao-Ming

2013-01-01

Determining the quantum circuit complexity of a unitary operation is an important problem in quantum computation. By using the mathematical techniques of Riemannian geometry, we investigate the efficient quantum circuits in quantum computation with n qutrits. We show that the optimal quantum circuits are essentially equivalent to the shortest path between two points in a certain curved geometry of SU(3(n)). As an example, three-qutrit systems are investigated in detail.

Understand quantum mechanics

International Nuclear Information System (INIS)

Omnes, R.

2000-01-01

The author presents the interpretation of quantum mechanics in a simple and direct way. This book may be considered as a complement of specialized books whose aim is to present the mathematical developments of quantum mechanics. As early as the beginning of quantum theory, Bohr, Heisenberg and Pauli proposed the basis of what is today called the interpretation of Copenhagen. This interpretation is still valid but 2 important discoveries have led to renew some aspects of the interpretation of Copenhagen. The first one was the discovery of the decoherence phenomenon which is responsible for the absence of quantum interferences in the macroscopic world. The second discovery was the achievement of the complete derivation of classical physics from quantum physics, it means that the classical determinism fits in the framework of quantum probabilism. A short summary ends each chapter. (A.C.)

Introduction to quantum mechanics

CERN Document Server

Phillips, A C

2003-01-01

Introduction to Quantum Mechanics is an introduction to the power and elegance of quantum mechanics. Assuming little in the way of prior knowledge, quantum concepts are carefully and precisely presented, and explored through numerous applications and problems. Some of the more challenging aspects that are essential for a modern appreciation of the subject have been included, but are introduced and developed in the simplest way possible.Undergraduates taking a first course on quantum mechanics will find this text an invaluable introduction to the field and help prepare them for more adv

Lectures on Quantum Mechanics

CERN Document Server

Dirac, Paul Adrien Maurice

1964-01-01

The author of this concise, brilliant series of lectures on mathematical methods in quantum mechanics was one of the shining intellects in the field, winning a Nobel prize in 1933 for his pioneering work in the quantum mechanics of the atom. Beyond that, he developed the transformation theory of quantum mechanics (which made it possible to calculate the statistical distribution of certain variables), was one of the major authors of the quantum theory of radiation, codiscovered the Fermi-Dirac statistics, and predicted the existence of the positron.The four lectures in this book were delivered

Entangled states in quantum mechanics

Science.gov (United States)

Ruža, Jānis

2010-01-01

In some circles of quantum physicists, a view is maintained that the nonseparability of quantum systems-i.e., the entanglement-is a characteristic feature of quantum mechanics. According to this view, the entanglement plays a crucial role in the solution of quantum measurement problem, the origin of the “classicality” from the quantum physics, the explanation of the EPR paradox by a nonlocal character of the quantum world. Besides, the entanglement is regarded as a cornerstone of such modern disciplines as quantum computation, quantum cryptography, quantum information, etc. At the same time, entangled states are well known and widely used in various physics areas. In particular, this notion is widely used in nuclear, atomic, molecular, solid state physics, in scattering and decay theories as well as in other disciplines, where one has to deal with many-body quantum systems. One of the methods, how to construct the basis states of a composite many-body quantum system, is the so-called genealogical decomposition method. Genealogical decomposition allows one to construct recurrently by particle number the basis states of a composite quantum system from the basis states of its forming subsystems. These coupled states have a structure typical for entangled states. If a composite system is stable, the internal structure of its forming basis states does not manifest itself in measurements. However, if a composite system is unstable and decays onto its forming subsystems, then the measurables are the quantum numbers, associated with these subsystems. In such a case, the entangled state has a dynamical origin, determined by the Hamiltonian of the corresponding decay process. Possible correlations between the quantum numbers of resulting subsystems are determined by the symmetries-conservation laws of corresponding dynamical variables, and not by the quantum entanglement feature.

Insights into the Thiamine Diphosphate Enzyme Activation Mechanism: Computational Model for Transketolase Using a Quantum Mechanical/Molecular Mechanical Method.

Science.gov (United States)

Nauton, Lionel; Hélaine, Virgil; Théry, Vincent; Hecquet, Laurence

2016-04-12

We propose the first computational model for transketolase (TK), a thiamine diphosphate (ThDP)-dependent enzyme, using a quantum mechanical/molecular mechanical method on the basis of crystallographic TK structures from yeast and Escherichia coli, together with experimental kinetic data reported in the literature with wild-type and mutant TK. This model allowed us to define a new route for ThDP activation in the enzyme environment. We evidenced a strong interaction between ThDP and Glu418B of the TK active site, itself stabilized by Glu162A. The crucial point highlighted here is that deprotonation of ThDP C2 is not performed by ThDP N4' as reported in the literature, but by His481B, involving a HOH688A molecule bridge. Thus, ThDP N4' is converted from an amino form to an iminium form, ensuring the stabilization of the C2 carbanion or carbene. Finally, ThDP activation proceeds via an intermolecular process and not by an intramolecular one as reported in the literature. More generally, this proposed ThDP activation mechanism can be applied to some other ThDP-dependent enzymes and used to define the entire TK mechanism with donor and acceptor substrates more accurately.

QUANTUM COMPUTING: Quantum Entangled Bits Step Closer to IT.

Science.gov (United States)

Zeilinger, A

2000-07-21

In contrast to today's computers, quantum computers and information technologies may in future be able to store and transmit information not only in the state "0" or "1," but also in superpositions of the two; information will then be stored and transmitted in entangled quantum states. Zeilinger discusses recent advances toward using this principle for quantum cryptography and highlights studies into the entanglement (or controlled superposition) of several photons, atoms, or ions.

Scheme for Quantum Computing Immune to Decoherence

Science.gov (United States)

Williams, Colin; Vatan, Farrokh

2008-01-01

A constructive scheme has been devised to enable mapping of any quantum computation into a spintronic circuit in which the computation is encoded in a basis that is, in principle, immune to quantum decoherence. The scheme is implemented by an algorithm that utilizes multiple physical spins to encode each logical bit in such a way that collective errors affecting all the physical spins do not disturb the logical bit. The scheme is expected to be of use to experimenters working on spintronic implementations of quantum logic. Spintronic computing devices use quantum-mechanical spins (typically, electron spins) to encode logical bits. Bits thus encoded (denoted qubits) are potentially susceptible to errors caused by noise and decoherence. The traditional model of quantum computation is based partly on the assumption that each qubit is implemented by use of a single two-state quantum system, such as an electron or other spin-1.2 particle. It can be surprisingly difficult to achieve certain gate operations . most notably, those of arbitrary 1-qubit gates . in spintronic hardware according to this model. However, ironically, certain 2-qubit interactions (in particular, spin-spin exchange interactions) can be achieved relatively easily in spintronic hardware. Therefore, it would be fortunate if it were possible to implement any 1-qubit gate by use of a spin-spin exchange interaction. While such a direct representation is not possible, it is possible to achieve an arbitrary 1-qubit gate indirectly by means of a sequence of four spin-spin exchange interactions, which could be implemented by use of four exchange gates. Accordingly, the present scheme provides for mapping any 1-qubit gate in the logical basis into an equivalent sequence of at most four spin-spin exchange interactions in the physical (encoded) basis. The complexity of the mathematical derivation of the scheme from basic quantum principles precludes a description within this article; it must suffice to report

A repeat-until-success quantum computing scheme

Energy Technology Data Exchange (ETDEWEB)

Beige, A [School of Physics and Astronomy, University of Leeds, Leeds LS2 9JT (United Kingdom); Lim, Y L [DSO National Laboratories, 20 Science Park Drive, Singapore 118230, Singapore (Singapore); Kwek, L C [Department of Physics, National University of Singapore, 2 Science Drive 3, Singapore 117542, Singapore (Singapore)

2007-06-15

Recently we proposed a hybrid architecture for quantum computing based on stationary and flying qubits: the repeat-until-success (RUS) quantum computing scheme. The scheme is largely implementation independent. Despite the incompleteness theorem for optical Bell-state measurements in any linear optics set-up, it allows for the implementation of a deterministic entangling gate between distant qubits. Here we review this distributed quantum computation scheme, which is ideally suited for integrated quantum computation and communication purposes.

A repeat-until-success quantum computing scheme

International Nuclear Information System (INIS)

Beige, A; Lim, Y L; Kwek, L C

2007-01-01

Recently we proposed a hybrid architecture for quantum computing based on stationary and flying qubits: the repeat-until-success (RUS) quantum computing scheme. The scheme is largely implementation independent. Despite the incompleteness theorem for optical Bell-state measurements in any linear optics set-up, it allows for the implementation of a deterministic entangling gate between distant qubits. Here we review this distributed quantum computation scheme, which is ideally suited for integrated quantum computation and communication purposes

Regression relation for pure quantum states and its implications for efficient computing.

Science.gov (United States)

Elsayed, Tarek A; Fine, Boris V

2013-02-15

We obtain a modified version of the Onsager regression relation for the expectation values of quantum-mechanical operators in pure quantum states of isolated many-body quantum systems. We use the insights gained from this relation to show that high-temperature time correlation functions in many-body quantum systems can be controllably computed without complete diagonalization of the Hamiltonians, using instead the direct integration of the Schrödinger equation for randomly sampled pure states. This method is also applicable to quantum quenches and other situations describable by time-dependent many-body Hamiltonians. The method implies exponential reduction of the computer memory requirement in comparison with the complete diagonalization. We illustrate the method by numerically computing infinite-temperature correlation functions for translationally invariant Heisenberg chains of up to 29 spins 1/2. Thereby, we also test the spin diffusion hypothesis and find it in a satisfactory agreement with the numerical results. Both the derivation of the modified regression relation and the justification of the computational method are based on the notion of quantum typicality.

Quantum mechanics the theoretical minimum

CERN Document Server

Susskind, Leonard

2014-01-01

From the bestselling author of The Theoretical Minimum, an accessible introduction to the math and science of quantum mechanicsQuantum Mechanics is a (second) book for anyone who wants to learn how to think like a physicist. In this follow-up to the bestselling The Theoretical Minimum, physicist Leonard Susskind and data engineer Art Friedman offer a first course in the theory and associated mathematics of the strange world of quantum mechanics. Quantum Mechanics presents Susskind and Friedman’s crystal-clear explanations of the principles of quantum states, uncertainty and time dependence, entanglement, and particle and wave states, among other topics. An accessible but rigorous introduction to a famously difficult topic, Quantum Mechanics provides a tool kit for amateur scientists to learn physics at their own pace.

Relativistic Quantum Mechanics

International Nuclear Information System (INIS)

Antoine, J-P

2004-01-01

The aim of relativistic quantum mechanics is to describe the finer details of the structure of atoms and molecules, where relativistic effects become nonnegligible. It is a sort of intermediate realm, between the familiar nonrelativistic quantum mechanics and fully relativistic quantum field theory, and thus it lacks the simplicity and elegance of both. Yet it is a necessary tool, mostly for quantum chemists. Pilkuhn's book offers to this audience an up-to-date survey of these methods, which is quite welcome since most previous textbooks are at least ten years old. The point of view of the author is to start immediately in the relativistic domain, following the lead of Maxwell's equations rather than classical mechanics, and thus to treat the nonrelativistic version as an approximation. Thus Chapter 1 takes off from Maxwell's equations (in the noncovariant Coulomb gauge) and gradually derives the basic aspects of Quantum Mechanics in a rather pedestrian way (states and observables, Hilbert space, operators, quantum measurement, scattering,. Chapter 2 starts with the Lorentz transformations, then continues with the Pauli spin equation and the Dirac equation and some of their applications (notably the hydrogen atom). Chapter 3 is entitled 'Quantum fields and particles', but falls short of treating quantum field theory properly: only creation/annihilation operators are considered, for a particle in a box. The emphasis is on two-electron states (the Pauli principle, the Foldy--Wouthuysen elimination of small components of Dirac spinors, Breit projection operators. Chapter 4 is devoted to scattering theory and the description of relativistic bound states. Chapter 5, finally, covers hyperfine interactions and radiative corrections. As we said above, relativistic quantum mechanics is by nature limited in scope and rather inelegant and Pilkuhn's book is no exception. The notation is often heavy (mostly noncovariant) and the mathematical level rather low. The central topic

Quantum enhanced feedback cooling of a mechanical oscillator using nonclassical light.

Science.gov (United States)

Schäfermeier, Clemens; Kerdoncuff, Hugo; Hoff, Ulrich B; Fu, Hao; Huck, Alexander; Bilek, Jan; Harris, Glen I; Bowen, Warwick P; Gehring, Tobias; Andersen, Ulrik L

2016-11-29

Laser cooling is a fundamental technique used in primary atomic frequency standards, quantum computers, quantum condensed matter physics and tests of fundamental physics, among other areas. It has been known since the early 1990s that laser cooling can, in principle, be improved by using squeezed light as an electromagnetic reservoir; while quantum feedback control using a squeezed light probe is also predicted to allow improved cooling. Here we show the implementation of quantum feedback control of a micro-mechanical oscillator using squeezed probe light. This allows quantum-enhanced feedback cooling with a measurement rate greater than it is possible with classical light, and a consequent reduction in the final oscillator temperature. Our results have significance for future applications in areas ranging from quantum information networks, to quantum-enhanced force and displacement measurements and fundamental tests of macroscopic quantum mechanics.

Quantum mechanics theory and experiment

CERN Document Server

Beck, Mark

2012-01-01

This textbook presents quantum mechanics at the junior/senior undergraduate level. It is unique in that it describes not only quantum theory, but also presents five laboratories that explore truly modern aspects of quantum mechanics. These laboratories include "proving" that light contains photons, single-photon interference, and tests of local realism. The text begins by presenting the classical theory of polarization, moving on to describe the quantum theory of polarization. Analogies between the two theories minimize conceptual difficulties that students typically have when first presented with quantum mechanics. Furthermore, because the laboratories involve studying photons, using photon polarization as a prototypical quantum system allows the laboratory work to be closely integrated with the coursework. Polarization represents a two-dimensional quantum system, so the introduction to quantum mechanics uses two-dimensional state vectors and operators. This allows students to become comfortable with the mat...

Multi-party Semi-quantum Key Agreement with Delegating Quantum Computation

Science.gov (United States)

Liu, Wen-Jie; Chen, Zhen-Yu; Ji, Sai; Wang, Hai-Bin; Zhang, Jun

2017-10-01

A multi-party semi-quantum key agreement (SQKA) protocol based on delegating quantum computation (DQC) model is proposed by taking Bell states as quantum resources. In the proposed protocol, the participants only need the ability of accessing quantum channel and preparing single photons {|0〉, |1〉, |+〉, |-〉}, while the complicated quantum operations, such as the unitary operations and Bell measurement, will be delegated to the remote quantum center. Compared with previous quantum key agreement protocols, this client-server model is more feasible in the early days of the emergence of quantum computers. In order to prevent the attacks from outside eavesdroppers, inner participants and quantum center, two single photon sequences are randomly inserted into Bell states: the first sequence is used to perform the quantum channel detection, while the second is applied to disorder the positions of message qubits, which guarantees the security of the protocol.

The Foundations of Quantum Mechanics: Historical Analysis and Open Questions -- Cesena, 2004

Science.gov (United States)

Garola, Claudio; Rossi, Arcangelo; Sozzo, Sandro

Introduction / C. Garola, A. Rossi and S. Sozzo -- If Bertlmann had three feet / A. Afriat -- Macroscopic interpretability of quantum component systems / R. Ascoli -- Premeasurement versus measurement: a basic form of complementarity / G. Auletta and G. Tarozzi -- Remarks on conditioning / E. G. Beltrametti -- Entangled state preparation in experiments on quantum non-locality / V. Berardi and A. Garuccio -- The first steps of quantum electrodynamics: what is it that's being quantized? / S. Bergia -- On the meaning of element in the science of italic tradition, the question of physical objectivity (and/or physical meaning) and quantum mechanics / G. Boscarino -- Mathematics and epistemology in Planck's theoretical work (1898-1915) / P. Campogalliani -- On the free motion with noise / B. Carazza and R. Tedeschi -- Field quantization and wave/particle duality / M. Cini -- Parastatistics in econophysics? / D. Costantini and U. Garibaldi -- Theory-laden instruments and quantum mechanics / S. D'Agostino -- Quantum non-locality and the mathematical representation of experience / V. Fano -- On the notion of proposition in classical and quantum mechanics / C. Garola and S. Sozzo -- The electromagnetic conception of nature and the origins of quantum physics / E. A. Giannetto -- What we talk about when we talk about universe computability / S. Guccione -- Bohm and Bohmian mechanics / G. Introzzi and M. Rossetti -- An objective background for quantum theory relying on thermodynamic concepts / L. Lanz and B. Vacchini -- The entrance of quantum mechanics in Italy: from Garbasso to Fermi / M. Leone and N. Robotti -- The measure of momentum in quantum mechanics / F. Logiurato and C. Tarsitani -- On the two-slit interference experiment: a statistical discussion / M. Minozzo -- Why the reactivity of the elements is a relational property, and why it matters / V. Mosini -- Detecting non compatible properties in double-slit experiment without erasure / G. Nisticò -- If you can

Three-space from quantum mechanics

International Nuclear Information System (INIS)

Chew, G.F.; Stapp, H.P.

1988-01-01

We formulate a discrete quantum-mechanical precursor to spacetime geometry. The objective is to provide the foundation for a quantum mechanics that is rooted exclusively in quantum-mechanical concepts, with all classical features, including the three-dimensional spatial continuum, emerging dynamically

The Picture Book of Quantum Mechanics

CERN Document Server

Brandt, Siegmund

2012-01-01

The aim of this book is to explain the basic concepts and phenomena of quantum mechanics by means of visualization. Computer-generated illustrations in color are used extensively throughout the text, helping to establish the relation between quantum mechanics—wave functions, interference, atomic structure, and so forth—and classical physics—point mechanics, statistical mechanics, and wave optics. Even more important, by studying the pictures in parallel with the text, readers develop an intuition for such notoriously abstract phenomena as • the tunnel effect • excitation and decay of metastable states • wave-packet motion within a well • systems of distinguishable and indistinguishable particles • free wave packets and scattering in 3 dimensions • angular-momentum decomposition • stationary bound states in various 3-dimensional potentials • hybrid states • Kepler motion of wave packets in the Coulomb field • spin and magnetic resonance Illustrations from experiments in a variety of f...

Real-time dynamics of lattice gauge theories with a few-qubit quantum computer

Science.gov (United States)

Martinez, Esteban A.; Muschik, Christine A.; Schindler, Philipp; Nigg, Daniel; Erhard, Alexander; Heyl, Markus; Hauke, Philipp; Dalmonte, Marcello; Monz, Thomas; Zoller, Peter; Blatt, Rainer

2016-06-01

Gauge theories are fundamental to our understanding of interactions between the elementary constituents of matter as mediated by gauge bosons. However, computing the real-time dynamics in gauge theories is a notorious challenge for classical computational methods. This has recently stimulated theoretical effort, using Feynman’s idea of a quantum simulator, to devise schemes for simulating such theories on engineered quantum-mechanical devices, with the difficulty that gauge invariance and the associated local conservation laws (Gauss laws) need to be implemented. Here we report the experimental demonstration of a digital quantum simulation of a lattice gauge theory, by realizing (1 + 1)-dimensional quantum electrodynamics (the Schwinger model) on a few-qubit trapped-ion quantum computer. We are interested in the real-time evolution of the Schwinger mechanism, describing the instability of the bare vacuum due to quantum fluctuations, which manifests itself in the spontaneous creation of electron-positron pairs. To make efficient use of our quantum resources, we map the original problem to a spin model by eliminating the gauge fields in favour of exotic long-range interactions, which can be directly and efficiently implemented on an ion trap architecture. We explore the Schwinger mechanism of particle-antiparticle generation by monitoring the mass production and the vacuum persistence amplitude. Moreover, we track the real-time evolution of entanglement in the system, which illustrates how particle creation and entanglement generation are directly related. Our work represents a first step towards quantum simulation of high-energy theories using atomic physics experiments—the long-term intention is to extend this approach to real-time quantum simulations of non-Abelian lattice gauge theories.

The essentials of quantum mechanics

International Nuclear Information System (INIS)

Omnes, R.

2006-09-01

This book is an introduction to quantum mechanics, the author explains the foundation, interpretation and today limits of this science. The consequences of quantum concepts are reviewed through the lens of recent experimental data. In that way, issues like wave-particle duality, uncertainty principle, decoherence, relationship with classical mechanics or the unicity of reality, issues that were difficult to grasp before, appear now clearer. The book has been divided into 8 chapters: 1) possibility and chance, 2) quantum formalism, 3) fundamental quantum concepts, 4) how to deal with quantum mechanics, 5) decoherence theory, 6) the quantum logic system, 7) the emergence of classical physics, and 8) quantum measurements. (A.C.)

Quantum Mechanics A Modern and Concise Introductory Course

CERN Document Server

Bes, Daniel R

2007-01-01

Starting from basic principles, the book systematically covers both Heisenberg and Schrödinger realizations of quantum mechanics (in this order). The material traditionally presented in quantum textbooks is illustrated with applications which are (or will become) cornestones of future technologies. The emphasis in the matrix formulation focus the atention on the spin, the most important quantum observable, and paves the way to chapters on quantum information (including crytography, teleportation and computation), on recent tests of quantum physics and on decoherence. Additions and changes found in the second edition include; a more friendly presentation to Hilbert spaces; more practical applications e.g. scanning tunneling microscope (potential barrier); quantum dots (single-particle states in semiconductors); lasers and masers (induced emission); real experiments that have recently provided a qualitative change in the foundations of quantum physics; and an outline of the density matrix formalism as applied ...

The emerging quantum the physics behind quantum mechanics

CERN Document Server

Pena, Luis de la; Valdes-Hernandez, Andrea

2014-01-01

This monograph presents the latest findings from a long-term research project intended to identify the physics behind Quantum Mechanics. A fundamental theory for quantum mechanics is constructed from first physical principles, revealing quantization as an emergent phenomenon arising from a deeper stochastic process. As such, it offers the vibrant community working on the foundations of quantum mechanics an alternative contribution open to discussion. The book starts with a critical summary of the main conceptual problems that still beset quantum mechanics.  The basic consideration is then introduced that any material system is an open system in permanent contact with the random zero-point radiation field, with which it may reach a state of equilibrium. Working from this basis, a comprehensive and self-consistent theoretical framework is then developed. The pillars of the quantum-mechanical formalism are derived, as well as the radiative corrections of nonrelativistic QED, while revealing the underlying physi...

Supersymmetry and quantum mechanics

International Nuclear Information System (INIS)

Cooper, F.; Sukhatme, U.

1995-01-01

In the past ten years, the ideas of supersymmetry have been profitably applied to many nonrelativistic quantum mechanical problems. In particular, there is now a much deeper understanding of why certain potentials are analytically solvable and an array of powerful new approximation methods for handling potentials which are not exactly solvable. In this report, we review the theoretical formulation of supersymmetric quantum mechanics and discuss many applications. Exactly solvable potentials can be understood in terms of a few basic ideas which include supersymmetric partner potentials, shape invariance and operator transformations. Familiar solvable potentials all have the property of shape invariance. We describe new exactly solvable shape invariant potentials which include the recently discovered self-similar potentials as a special case. The connection between inverse scattering, isospectral potentials and supersymmetric quantum mechanics is discussed and multi-soliton solutions of the KdV equation are constructed. Approximation methods are also discussed within the framework of supersymmetric quantum mechanics and in particular it is shown that a supersymmetry inspired WKB approximation is exact for a class of shape invariant potentials. Supersymmetry ideas give particularly nice results for the tunneling rate in a double well potential and for improving large N expansions. We also discuss the problem of a charged Dirac particle in an external magnetic field and other potentials in terms of supersymmetric quantum mechanics. Finally, we discuss structures more general than supersymmetric quantum mechanics such as parasupersymmetric quantum mechanics in which there is a symmetry between a boson and a para-fermion of order p. ((orig.))

Physics: quantum mechanics

International Nuclear Information System (INIS)

Basdevant, J.L.

1983-01-01

From important experiment descriptions (sometimes, intentionally simplified), the essential concepts in Quantum Mechanics are first introduced. Wave function notion is described, Schroedinger equation is established, and, after applications rich in physical signification, quantum state and Hilbert space formalism are introduced, which will help to understand many essential phenomena. Then the quantum mechanic general formulation is written and some important consequences are deduced. This formalism is applied to a simple physical problem series (angular momentum, hydrogen atom, etc.) aiming at assimilating the theory operation and its application [fr

Introduction to Quantum Information/Computing

National Research Council Canada - National Science Library

Costianes, Peter J

2005-01-01

Quantum Information Technology (QIT) is a relatively new area of research whose purpose is to take advantage of the quantum nature of matter and energy to design and build quantum computers which have the potential of improved...

Experimental comparison of two quantum computing architectures.

Science.gov (United States)

Linke, Norbert M; Maslov, Dmitri; Roetteler, Martin; Debnath, Shantanu; Figgatt, Caroline; Landsman, Kevin A; Wright, Kenneth; Monroe, Christopher

2017-03-28

We run a selection of algorithms on two state-of-the-art 5-qubit quantum computers that are based on different technology platforms. One is a publicly accessible superconducting transmon device (www. ibm.com/ibm-q) with limited connectivity, and the other is a fully connected trapped-ion system. Even though the two systems have different native quantum interactions, both can be programed in a way that is blind to the underlying hardware, thus allowing a comparison of identical quantum algorithms between different physical systems. We show that quantum algorithms and circuits that use more connectivity clearly benefit from a better-connected system of qubits. Although the quantum systems here are not yet large enough to eclipse classical computers, this experiment exposes critical factors of scaling quantum computers, such as qubit connectivity and gate expressivity. In addition, the results suggest that codesigning particular quantum applications with the hardware itself will be paramount in successfully using quantum computers in the future.

Spacetime coarse grainings in nonrelativistic quantum mechanics

International Nuclear Information System (INIS)

Hartle, J.B.

1991-01-01

Sum-over-histories generalizations of nonrelativistic quantum mechanics are explored in which probabilities are predicted, not just for alternatives defined on spacelike surfaces, but for alternatives defined by the behavior of spacetime histories with respect to spacetime regions. Closed, nonrelativistic systems are discussed whose histories are paths in a given configuration space. The action and the initial quantum state are assumed fixed and given. A formulation of quantum mechanics is used which assigns probabilities to members of sets of alternative coarse-grained histories of the system, that is, to the individual classes of a partition of its paths into exhaustive and exclusive classes. Probabilities are assigned to those sets which decohere, that is, whose probabilities are consistent with the sum rules of probability theory. Coarse graining by the behavior of paths with respect to regions of spacetime is described. For example, given a single region, the set of all paths may be partitioned into those which never pass through the region and those which pass through the region at least once. A sum-over-histories decoherence functional is defined for sets of alternative histories coarse-grained by spacetime regions. Techniques for the definition and effective computation of the relevant sums over histories by operator-product formulas are described and illustrated by examples. Methods based on Euclidean stochastic processes are also discussed and illustrated. Models of decoherence and measurement for spacetime coarse grainings are described. Issues of causality are investigated. Such spacetime generalizations of nonrelativistic quantum mechanics may be useful models for a generalized quantum mechanics of spacetime geometry

Conceptual foundations of quantum mechanics

International Nuclear Information System (INIS)

Shimony, A.

1989-01-01

Radical innovation in the quantum mechanical framework such as objective indefiniteness, objective chance, objective probability, potentiality, entanglement and quantum nonlocality are discussed and related to the standard formalism. Examples are given which though problematic in classical mechanics are simply explained with these new concepts. Evidence is presented that the conceptual innovations of quantum mechanics cannot be separated from its predictive power. Proposals for solving ''the reduction of the wave packet'' anomaly are presented. Further radical innovations in quantum mechanics are anticipated. (U.K.)

Ramsey numbers and adiabatic quantum computing.

Science.gov (United States)

Gaitan, Frank; Clark, Lane

2012-01-06

The graph-theoretic Ramsey numbers are notoriously difficult to calculate. In fact, for the two-color Ramsey numbers R(m,n) with m, n≥3, only nine are currently known. We present a quantum algorithm for the computation of the Ramsey numbers R(m,n). We show how the computation of R(m,n) can be mapped to a combinatorial optimization problem whose solution can be found using adiabatic quantum evolution. We numerically simulate this adiabatic quantum algorithm and show that it correctly determines the Ramsey numbers R(3,3) and R(2,s) for 5≤s≤7. We then discuss the algorithm's experimental implementation, and close by showing that Ramsey number computation belongs to the quantum complexity class quantum Merlin Arthur.

Duality Quantum Information and Duality Quantum Communication

International Nuclear Information System (INIS)

Li, C. Y.; Wang, W. Y.; Wang, C.; Song, S. Y.; Long, G. L.

2011-01-01

Quantum mechanical systems exhibit particle wave duality property. This duality property has been exploited for information processing. A duality quantum computer is a quantum computer on the move and passing through a multi-slits. It offers quantum wave divider and quantum wave combiner operations in addition to those allowed in an ordinary quantum computer. It has been shown that all linear bounded operators can be realized in a duality quantum computer, and a duality quantum computer with n qubits and d-slits can be realized in an ordinary quantum computer with n qubits and a qudit in the so-called duality quantum computing mode. The quantum particle-wave duality can be used in providing secure communication. In this paper, we will review duality quantum computing and duality quantum key distribution.

Benchmarking Quantum Mechanics/Molecular Mechanics (QM/MM) Methods on the Thymidylate Synthase-Catalyzed Hydride Transfer.

Science.gov (United States)

Świderek, Katarzyna; Arafet, Kemel; Kohen, Amnon; Moliner, Vicent

2017-03-14

Given the ubiquity of hydride-transfer reactions in enzyme-catalyzed processes, identifying the appropriate computational method for evaluating such biological reactions is crucial to perform theoretical studies of these processes. In this paper, the hydride-transfer step catalyzed by thymidylate synthase (TSase) is studied by examining hybrid quantum mechanics/molecular mechanics (QM/MM) potentials via multiple semiempirical methods and the M06-2X hybrid density functional. Calculations of protium and tritium transfer in these reactions across a range of temperatures allowed calculation of the temperature dependence of kinetic isotope effects (KIE). Dynamics and quantum-tunneling effects are revealed to have little effect on the reaction rate, but are significant in determining the KIEs and their temperature dependence. A good agreement with experiments is found, especially when computed for RM1/MM simulations. The small temperature dependence of quantum tunneling corrections and the quasiclassical contribution term cancel each other, while the recrossing transmission coefficient seems to be temperature-independent over the interval of 5-40 °C.

Non-unitary probabilistic quantum computing circuit and method

Science.gov (United States)

Williams, Colin P. (Inventor); Gingrich, Robert M. (Inventor)

2009-01-01

A quantum circuit performing quantum computation in a quantum computer. A chosen transformation of an initial n-qubit state is probabilistically obtained. The circuit comprises a unitary quantum operator obtained from a non-unitary quantum operator, operating on an n-qubit state and an ancilla state. When operation on the ancilla state provides a success condition, computation is stopped. When operation on the ancilla state provides a failure condition, computation is performed again on the ancilla state and the n-qubit state obtained in the previous computation, until a success condition is obtained.

ProjectQ: an open source software framework for quantum computing

Directory of Open Access Journals (Sweden)

Damian S. Steiger

2018-01-01

Full Text Available We introduce ProjectQ, an open source software effort for quantum computing. The first release features a compiler framework capable of targeting various types of hardware, a high-performance simulator with emulation capabilities, and compiler plug-ins for circuit drawing and resource estimation. We introduce our Python-embedded domain-specific language, present the features, and provide example implementations for quantum algorithms. The framework allows testing of quantum algorithms through simulation and enables running them on actual quantum hardware using a back-end connecting to the IBM Quantum Experience cloud service. Through extension mechanisms, users can provide back-ends to further quantum hardware, and scientists working on quantum compilation can provide plug-ins for additional compilation, optimization, gate synthesis, and layout strategies.

Quantum mechanics. 2. printing (paperback).

International Nuclear Information System (INIS)

Lipkin, H.J.

1986-01-01

Intended for a first year graduate course in quantum mechanics, this collection of topics can also be considered as a set of self-contained 'monographs for pedestrians' on the Moessbauer effect, many-body quantum mechanics, kaon physics, scattering theory, Feynman diagrams, symmetries and relativistic quantum mechanics. (Auth.)

Cloud Quantum Computing of an Atomic Nucleus

Science.gov (United States)

Dumitrescu, E. F.; McCaskey, A. J.; Hagen, G.; Jansen, G. R.; Morris, T. D.; Papenbrock, T.; Pooser, R. C.; Dean, D. J.; Lougovski, P.

2018-05-01

We report a quantum simulation of the deuteron binding energy on quantum processors accessed via cloud servers. We use a Hamiltonian from pionless effective field theory at leading order. We design a low-depth version of the unitary coupled-cluster ansatz, use the variational quantum eigensolver algorithm, and compute the binding energy to within a few percent. Our work is the first step towards scalable nuclear structure computations on a quantum processor via the cloud, and it sheds light on how to map scientific computing applications onto nascent quantum devices.

Quantum wavepacket ab initio molecular dynamics: an approach for computing dynamically averaged vibrational spectra including critical nuclear quantum effects.

Science.gov (United States)

Sumner, Isaiah; Iyengar, Srinivasan S

2007-10-18

We have introduced a computational methodology to study vibrational spectroscopy in clusters inclusive of critical nuclear quantum effects. This approach is based on the recently developed quantum wavepacket ab initio molecular dynamics method that combines quantum wavepacket dynamics with ab initio molecular dynamics. The computational efficiency of the dynamical procedure is drastically improved (by several orders of magnitude) through the utilization of wavelet-based techniques combined with the previously introduced time-dependent deterministic sampling procedure measure to achieve stable, picosecond length, quantum-classical dynamics of electrons and nuclei in clusters. The dynamical information is employed to construct a novel cumulative flux/velocity correlation function, where the wavepacket flux from the quantized particle is combined with classical nuclear velocities to obtain the vibrational density of states. The approach is demonstrated by computing the vibrational density of states of [Cl-H-Cl]-, inclusive of critical quantum nuclear effects, and our results are in good agreement with experiment. A general hierarchical procedure is also provided, based on electronic structure harmonic frequencies, classical ab initio molecular dynamics, computation of nuclear quantum-mechanical eigenstates, and employing quantum wavepacket ab initio dynamics to understand vibrational spectroscopy in hydrogen-bonded clusters that display large degrees of anharmonicities.

Mathematical methods in quantum and statistical mechanics

International Nuclear Information System (INIS)

Fishman, L.

1977-01-01

The mathematical structure and closed-form solutions pertaining to several physical problems in quantum and statistical mechanics are examined in some detail. The J-matrix method, introduced previously for s-wave scattering and based upon well-established Hilbert Space theory and related generalized integral transformation techniques, is extended to treat the lth partial wave kinetic energy and Coulomb Hamiltonians within the context of square integrable (L 2 ), Laguerre (Slater), and oscillator (Gaussian) basis sets. The theory of relaxation in statistical mechanics within the context of the theory of linear integro-differential equations of the Master Equation type and their corresponding Markov processes is examined. Several topics of a mathematical nature concerning various computational aspects of the L 2 approach to quantum scattering theory are discussed

Construction of a universal quantum computer

International Nuclear Information System (INIS)

Lagana, Antonio A.; Lohe, M. A.; Smekal, Lorenz von

2009-01-01

We construct a universal quantum computer following Deutsch's original proposal of a universal quantum Turing machine (UQTM). Like Deutsch's UQTM, our machine can emulate any classical Turing machine and can execute any algorithm that can be implemented in the quantum gate array framework but under the control of a quantum program, and hence is universal. We present the architecture of the machine, which consists of a memory tape and a processor and describe the observables that comprise the registers of the processor and the instruction set, which includes a set of operations that can approximate any unitary operation to any desired accuracy and hence is quantum computationally universal. We present the unitary evolution operators that act on the machine to achieve universal computation and discuss each of them in detail and specify and discuss explicit program halting and concatenation schemes. We define and describe a set of primitive programs in order to demonstrate the universal nature of the machine. These primitive programs facilitate the implementation of more complex algorithms and we demonstrate their use by presenting a program that computes the NAND function, thereby also showing that the machine can compute any classically computable function.

Interferometric Computation Beyond Quantum Theory

Science.gov (United States)

Garner, Andrew J. P.

2018-03-01

There are quantum solutions for computational problems that make use of interference at some stage in the algorithm. These stages can be mapped into the physical setting of a single particle travelling through a many-armed interferometer. There has been recent foundational interest in theories beyond quantum theory. Here, we present a generalized formulation of computation in the context of a many-armed interferometer, and explore how theories can differ from quantum theory and still perform distributed calculations in this set-up. We shall see that quaternionic quantum theory proves a suitable candidate, whereas box-world does not. We also find that a classical hidden variable model first presented by Spekkens (Phys Rev A 75(3): 32100, 2007) can also be used for this type of computation due to the epistemic restriction placed on the hidden variable.

Questioning quantum mechanics

Science.gov (United States)

Frappier, Mélanie

2018-03-01

A century after its inception, quantum mechanics continues to puzzle us with dead-and-alive cats, waves "collapsing" into particles, and "spooky action at a distance." In his first book, What Is Real?, science writer and astrophysicist Adam Becker sets out to explore why the physics community is still arguing today about quantum mechanics's true meaning.

Quantum mechanics. A modern and concise introductory course. 3. ed.

Energy Technology Data Exchange (ETDEWEB)

Bes, Daniel R. [Comision Nacional de Energia Atomica, Buenos Aires (Argentina)

2012-07-01

The presentation in the new edition of this well-reviewed textbook is clear and goes to the core of the questions. The balance between principles, concepts and applications is optimal. The material presented is touching active areas of physics. Supplies new views on decoherence, entanglement and path integral formulation of quantum mechanics. Gives background needed to understand quantum cryptography, teleportation and computation. Starting from basic principles, the book covers a wide variety of topics, ranging from Heisenberg, Schroedinger, second quantization, density matrix and path integral formulations of quantum mechanics, to applications that are (or will be) corner stones of present and future technologies. The emphasis is on spin waves, quantum information, recent tests of quantum physics and decoherence. The book provides a large amount of information without unbalancing the flow of the main ideas by laborious detail.

Quantum mechanics. A modern and concise introductory course. 3. ed.

International Nuclear Information System (INIS)

Bes, Daniel R.

2012-01-01

The presentation in the new edition of this well-reviewed textbook is clear and goes to the core of the questions. The balance between principles, concepts and applications is optimal. The material presented is touching active areas of physics. Supplies new views on decoherence, entanglement and path integral formulation of quantum mechanics. Gives background needed to understand quantum cryptography, teleportation and computation. Starting from basic principles, the book covers a wide variety of topics, ranging from Heisenberg, Schroedinger, second quantization, density matrix and path integral formulations of quantum mechanics, to applications that are (or will be) corner stones of present and future technologies. The emphasis is on spin waves, quantum information, recent tests of quantum physics and decoherence. The book provides a large amount of information without unbalancing the flow of the main ideas by laborious detail.

Learning quantum field theory from elementary quantum mechanics

International Nuclear Information System (INIS)

Gosdzinsky, P.; Tarrach, R.

1991-01-01

The study of the Dirac delta potentials in more than one dimension allows the introduction within the framework of elementary quantum mechanics of many of the basic concepts of modern quantum field theory: regularization, renormalization group, asymptotic freedom, dimensional transmutation, triviality, etc. It is also interesting, by itself, as a nonstandard quantum mechanical problem

Non-relativistic quantum mechanics

CERN Document Server

Puri, Ravinder R

2017-01-01

This book develops and simplifies the concept of quantum mechanics based on the postulates of quantum mechanics. The text discusses the technique of disentangling the exponential of a sum of operators, closed under the operation of commutation, as the product of exponentials to simplify calculations of harmonic oscillator and angular momentum. Based on its singularity structure, the Schrödinger equation for various continuous potentials is solved in terms of the hypergeometric or the confluent hypergeometric functions. The forms of the potentials for which the one-dimensional Schrödinger equation is exactly solvable are derived in detail. The problem of identifying the states of two-level systems which have no classical analogy is addressed by going beyond Bell-like inequalities and separability. The measures of quantumness of mutual information in two two-level systems is also covered in detail. Offers a new approach to learning quantum mechanics based on the history of quantum mechanics and its postu...

EXPLORATIONS IN QUANTUM COMPUTING FOR FINANCIAL APPLICATIONS

OpenAIRE

Gare, Jesse

2010-01-01

Quantum computers have the potential to increase the solution speed for many computational problems. This paper is a first step into possible applications for quantum computing in the context of computational finance. The fundamental ideas of quantum computing are introduced, followed by an exposition of the algorithms of Deutsch and Grover. Improved mean and median estimation are shown as results of Grover?s generalized framework. The algorithm for mean estimation is refined to an improved M...

Focus on topological quantum computation

International Nuclear Information System (INIS)

Pachos, Jiannis K; Simon, Steven H

2014-01-01

Topological quantum computation started as a niche area of research aimed at employing particles with exotic statistics, called anyons, for performing quantum computation. Soon it evolved to include a wide variety of disciplines. Advances in the understanding of anyon properties inspired new quantum algorithms and helped in the characterization of topological phases of matter and their experimental realization. The conceptual appeal of topological systems as well as their promise for building fault-tolerant quantum technologies fuelled the fascination in this field. This ‘focus on’ collection brings together several of the latest developments in the field and facilitates the synergy between different approaches. (editorial)

PREFACE: Quantum Information, Communication, Computation and Cryptography

Science.gov (United States)

Benatti, F.; Fannes, M.; Floreanini, R.; Petritis, D.

2007-07-01

The application of quantum mechanics to information related fields such as communication, computation and cryptography is a fast growing line of research that has been witnessing an outburst of theoretical and experimental results, with possible practical applications. On the one hand, quantum cryptography with its impact on secrecy of transmission is having its first important actual implementations; on the other hand, the recent advances in quantum optics, ion trapping, BEC manipulation, spin and quantum dot technologies allow us to put to direct test a great deal of theoretical ideas and results. These achievements have stimulated a reborn interest in various aspects of quantum mechanics, creating a unique interplay between physics, both theoretical and experimental, mathematics, information theory and computer science. In view of all these developments, it appeared timely to organize a meeting where graduate students and young researchers could be exposed to the fundamentals of the theory, while senior experts could exchange their latest results. The activity was structured as a school followed by a workshop, and took place at The Abdus Salam International Center for Theoretical Physics (ICTP) and The International School for Advanced Studies (SISSA) in Trieste, Italy, from 12-23 June 2006. The meeting was part of the activity of the Joint European Master Curriculum Development Programme in Quantum Information, Communication, Cryptography and Computation, involving the Universities of Cergy-Pontoise (France), Chania (Greece), Leuven (Belgium), Rennes1 (France) and Trieste (Italy). This special issue of Journal of Physics A: Mathematical and Theoretical collects 22 contributions from well known experts who took part in the workshop. They summarize the present day status of the research in the manifold aspects of quantum information. The issue is opened by two review articles, the first by G Adesso and F Illuminati discussing entanglement in continuous variable

BMN gauge theory as a quantum mechanical system

DEFF Research Database (Denmark)

Beisert, N.; Kristjansen, C.; Plefka, J.

2003-01-01

We rigorously derive an effective quantum mechanical Hamiltonian from N = 4 gauge theory in the BMN limit. Its eigenvalues yield the exact one-loop anomalous dimensions of scalar two-impurity BMN operators for all genera. It is demonstrated that this reformulation vastly simplifies computations. ...

Quantum mechanics in chemistry

CERN Document Server

Schatz, George C

2002-01-01

Intended for graduate and advanced undergraduate students, this text explores quantum mechanical techniques from the viewpoint of chemistry and materials science. Dynamics, symmetry, and formalism are emphasized. An initial review of basic concepts from introductory quantum mechanics is followed by chapters examining symmetry, rotations, and angular momentum addition. Chapter 4 introduces the basic formalism of time-dependent quantum mechanics, emphasizing time-dependent perturbation theory and Fermi's golden rule. Chapter 5 sees this formalism applied to the interaction of radiation and matt

Quantum computing with photons: introduction to the circuit model, the one-way quantum computer, and the fundamental principles of photonic experiments

International Nuclear Information System (INIS)

Barz, Stefanie

2015-01-01

Quantum physics has revolutionized our understanding of information processing and enables computational speed-ups that are unattainable using classical computers. This tutorial reviews the fundamental tools of photonic quantum information processing. The basics of theoretical quantum computing are presented and the quantum circuit model as well as measurement-based models of quantum computing are introduced. Furthermore, it is shown how these concepts can be implemented experimentally using photonic qubits, where information is encoded in the photons’ polarization. (tutorial)

Proceedings of quantum field theory, quantum mechanics, and quantum optics

International Nuclear Information System (INIS)

Dodonov, V.V.; Man; ko, V.I.

1991-01-01

This book contains papers presented at the XVIII International Colloquium on Group Theoretical Methods in Physics held in Moscow on June 4-9, 1990. Topics covered include; applications of algebraic methods in quantum field theory, quantum mechanics, quantum optics, spectrum generating groups, quantum algebras, symmetries of equations, quantum physics, coherent states, group representations and space groups

Topics in linear optical quantum computation

Science.gov (United States)

Glancy, Scott Charles

This thesis covers several topics in optical quantum computation. A quantum computer is a computational device which is able to manipulate information by performing unitary operations on some physical system whose state can be described as a vector (or mixture of vectors) in a Hilbert space. The basic unit of information, called the qubit, is considered to be a system with two orthogonal states, which are assigned logical values of 0 and 1. Photons make excellent candidates to serve as qubits. They have little interactions with the environment. Many operations can be performed using very simple linear optical devices such as beam splitters and phase shifters. Photons can easily be processed through circuit-like networks. Operations can be performed in very short times. Photons are ideally suited for the long-distance communication of quantum information. The great difficulty in constructing an optical quantum computer is that photons naturally interact weakly with one another. This thesis first gives a brief review of two early approaches to optical quantum computation. It will describe how any discrete unitary operation can be performed using a single photon and a network of beam splitters, and how the Kerr effect can be used to construct a two photon logic gate. Second, this work provides a thorough introduction to the linear optical quantum computer developed by Knill, Laflamme, and Milburn. It then presents this author's results on the reliability of this scheme when implemented using imperfect photon detectors. This author finds that quantum computers of this sort cannot be built using current technology. Third, this dissertation describes a method for constructing a linear optical quantum computer using nearly orthogonal coherent states of light as the qubits. It shows how a universal set of logic operations can be performed, including calculations of the fidelity with which these operations may be accomplished. It discusses methods for reducing and

Relational quantum mechanics

International Nuclear Information System (INIS)

Rovelli, C.

1996-01-01

I suggest that the common unease with taking quantum mechanics as a fundamental description of nature (the open-quotes measurement problemclose quotes) could derive from the use of an incorrect notion, as the unease with the Lorentz transformations before Einstein derived from the notion of observer-independent time. I suggest that this incorrect notion that generates the unease with quantum mechanics is the notion of open-quotes observer-independent stateclose quotes of a system, or open-quotes observer-independent values of physical quantities.close quotes I reformulate the problem of the open-quotes interpretation of quantum mechanicsclose quotes as the problem of deriving the formalism from a set of simple physical postulates. I consider a reformulation of quantum mechanics in terms of information theory. All systems are assumed to be equivalent, there is no observer-observed distinction, and the theory describes only the information that systems have about each other; nevertheless, the theory is complete

Quantum mechanics II advanced topics

CERN Document Server

Rajasekar, S

2015-01-01

Quantum Mechanics II: Advanced Topics uses more than a decade of research and the authors’ own teaching experience to expound on some of the more advanced topics and current research in quantum mechanics. A follow-up to the authors introductory book Quantum Mechanics I: The Fundamentals, this book begins with a chapter on quantum field theory, and goes on to present basic principles, key features, and applications. It outlines recent quantum technologies and phenomena, and introduces growing topics of interest in quantum mechanics. The authors describe promising applications that include ghost imaging, detection of weak amplitude objects, entangled two-photon microscopy, detection of small displacements, lithography, metrology, and teleportation of optical images. They also present worked-out examples and provide numerous problems at the end of each chapter.

Quantum Internet: from Communication to Distributed Computing!

OpenAIRE

Caleffi, Marcello; Cacciapuoti, Angela Sara; Bianchi, Giuseppe

2018-01-01

In this invited paper, the authors discuss the exponential computing speed-up achievable by interconnecting quantum computers through a quantum internet. They also identify key future research challenges and open problems for quantum internet design and deployment.

Exploring the Quantum Speed Limit with Computer Games

DEFF Research Database (Denmark)

Sørensen, Jens Jakob Winther Hedemann; Pedersen, Mads Kock; Munch, Michael Kulmback

2016-01-01

Humans routinely solve problems of immense computational complexity by intuitively forming simple, low-dimensional heuristic strategies. Citizen science exploits this intuition by presenting scientific research problems to non-experts. Gamification is an effective tool for attracting citizen...... scientists and allowing them to provide novel solutions to the research problems. Citizen science games have been used successfully in Foldit, EteRNA and EyeWire to study protein and RNA folding and neuron mapping. However, gamification has never been applied in quantum physics. Everyday experiences of non......-experts are based on classical physics and it is \\textit{a priori} not clear that they should have an intuition for quantum dynamics. Does this premise hinder the use of citizen scientists in the realm of quantum mechanics? Here we report on Quantum Moves, an online platform gamifying optimization problems...

Adiabatic graph-state quantum computation

International Nuclear Information System (INIS)

Antonio, B; Anders, J; Markham, D

2014-01-01

Measurement-based quantum computation (MBQC) and holonomic quantum computation (HQC) are two very different computational methods. The computation in MBQC is driven by adaptive measurements executed in a particular order on a large entangled state. In contrast in HQC the system starts in the ground subspace of a Hamiltonian which is slowly changed such that a transformation occurs within the subspace. Following the approach of Bacon and Flammia, we show that any MBQC on a graph state with generalized flow (gflow) can be converted into an adiabatically driven holonomic computation, which we call adiabatic graph-state quantum computation (AGQC). We then investigate how properties of AGQC relate to the properties of MBQC, such as computational depth. We identify a trade-off that can be made between the number of adiabatic steps in AGQC and the norm of H-dot as well as the degree of H, in analogy to the trade-off between the number of measurements and classical post-processing seen in MBQC. Finally the effects of performing AGQC with orderings that differ from standard MBQC are investigated. (paper)

Quantum Computing in the NISQ era and beyond

OpenAIRE

Preskill, John

2018-01-01

Noisy Intermediate-Scale Quantum (NISQ) technology will be available in the near future. Quantum computers with 50-100 qubits may be able to perform tasks which surpass the capabilities of today's classical digital computers, but noise in quantum gates will limit the size of quantum circuits that can be executed reliably. NISQ devices will be useful tools for exploring many-body quantum physics, and may have other useful applications, but the 100-qubit quantum computer will ...

Quantum Mechanics for Everyone: Can it be done with Technology?

Science.gov (United States)

Zollman, Dean

2004-10-01

The Visual Quantum Mechanics project has created a series of teaching/learning units to introduce quantum physics to a variety of audiences ranging from high school students who normally would not study these topics to undergraduate physics majors. Most recently we have been developing materials relating modern medical procedures and contemporary physics. In all of these materials interactive computer visualizations are coupled with hands-on experiences to create a series of activities which help students learn about some aspects of quantum mechanics. Our goal is to enable students to obtain a qualitative and, where appropriate, a quantitative understanding of contemporary ideas in physics. Included in the instructional materials are student-centered activities that address a variety of concepts in quantum physics and applications to devices such as the light emitting diode, the electron microscope, an inexpensive infrared detection card, and the Star Trek Transporter. Whenever possible the students begin the study of a new concept with an experiment using inexpensive equipment. They, then, build models of the physical phenomenon using interactive computer visualization and conclude by applying those models to new situations. For physics students these visualizations are usually followed by a mathematical approach. For others the visualizations provide a framework for understanding the concepts. Thus, Visual Quantum Mechanics allows a wide range of students to begin to understand the basic concepts, implications and interpretations of quantum physics. At present we are building on this foundation to create materials which show the connection between contemporary physics and modern medical diagnosis. Additional information is available at http://web.phys.ksu.edu/.

Materials Frontiers to Empower Quantum Computing

Energy Technology Data Exchange (ETDEWEB)

Taylor, Antoinette Jane [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Sarrao, John Louis [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Richardson, Christopher [Laboratory for Physical Sciences, College Park, MD (United States)

2015-06-11

This is an exciting time at the nexus of quantum computing and materials research. The materials frontiers described in this report represent a significant advance in electronic materials and our understanding of the interactions between the local material and a manufactured quantum state. Simultaneously, directed efforts to solve materials issues related to quantum computing provide an opportunity to control and probe the fundamental arrangement of matter that will impact all electronic materials. An opportunity exists to extend our understanding of materials functionality from electronic-grade to quantum-grade by achieving a predictive understanding of noise and decoherence in qubits and their origins in materials defects and environmental coupling. Realizing this vision systematically and predictively will be transformative for quantum computing and will represent a qualitative step forward in materials prediction and control.

Quantum Mechanics for Electrical Engineers

CERN Document Server

Sullivan, Dennis M

2011-01-01

The main topic of this book is quantum mechanics, as the title indicates.  It specifically targets those topics within quantum mechanics that are needed to understand modern semiconductor theory.   It begins with the motivation for quantum mechanics and why classical physics fails when dealing with very small particles and small dimensions.  Two key features make this book different from others on quantum mechanics, even those usually intended for engineers:   First, after a brief introduction, much of the development is through Fourier theory, a topic that is at

Quantum computing: Quantum advantage deferred

Science.gov (United States)

Childs, Andrew M.

2017-12-01

A type of optics experiment called a boson sampler could be among the easiest routes to demonstrating the power of quantum computers. But recent work shows that super-classical boson sampling may be a long way off.

Provably unbounded memory advantage in stochastic simulation using quantum mechanics

Science.gov (United States)

Garner, Andrew J. P.; Liu, Qing; Thompson, Jayne; Vedral, Vlatko; Gu, mile

2017-10-01

Simulating the stochastic evolution of real quantities on a digital computer requires a trade-off between the precision to which these quantities are approximated, and the memory required to store them. The statistical accuracy of the simulation is thus generally limited by the internal memory available to the simulator. Here, using tools from computational mechanics, we show that quantum processors with a fixed finite memory can simulate stochastic processes of real variables to arbitrarily high precision. This demonstrates a provable, unbounded memory advantage that a quantum simulator can exhibit over its best possible classical counterpart.

Quantum algorithms for computational nuclear physics

Directory of Open Access Journals (Sweden)

Višňák Jakub

2015-01-01

Full Text Available While quantum algorithms have been studied as an efficient tool for the stationary state energy determination in the case of molecular quantum systems, no similar study for analogical problems in computational nuclear physics (computation of energy levels of nuclei from empirical nucleon-nucleon or quark-quark potentials have been realized yet. Although the difference between the above mentioned studies might seem negligible, it will be examined. First steps towards a particular simulation (on classical computer of the Iterative Phase Estimation Algorithm for deuterium and tritium nuclei energy level computation will be carried out with the aim to prove algorithm feasibility (and extensibility to heavier nuclei for its possible practical realization on a real quantum computer.

Logic and algebraic structures in quantum computing

CERN Document Server

Eskandarian, Ali; Harizanov, Valentina S

2016-01-01

Arising from a special session held at the 2010 North American Annual Meeting of the Association for Symbolic Logic, this volume is an international cross-disciplinary collaboration with contributions from leading experts exploring connections across their respective fields. Themes range from philosophical examination of the foundations of physics and quantum logic, to exploitations of the methods and structures of operator theory, category theory, and knot theory in an effort to gain insight into the fundamental questions in quantum theory and logic. The book will appeal to researchers and students working in related fields, including logicians, mathematicians, computer scientists, and physicists. A brief introduction provides essential background on quantum mechanics and category theory, which, together with a thematic selection of articles, may also serve as the basic material for a graduate course or seminar.

An approach to quantum-computational hydrologic inverse analysis.

Science.gov (United States)

O'Malley, Daniel

2018-05-02

Making predictions about flow and transport in an aquifer requires knowledge of the heterogeneous properties of the aquifer such as permeability. Computational methods for inverse analysis are commonly used to infer these properties from quantities that are more readily observable such as hydraulic head. We present a method for computational inverse analysis that utilizes a type of quantum computer called a quantum annealer. While quantum computing is in an early stage compared to classical computing, we demonstrate that it is sufficiently developed that it can be used to solve certain subsurface flow problems. We utilize a D-Wave 2X quantum annealer to solve 1D and 2D hydrologic inverse problems that, while small by modern standards, are similar in size and sometimes larger than hydrologic inverse problems that were solved with early classical computers. Our results and the rapid progress being made with quantum computing hardware indicate that the era of quantum-computational hydrology may not be too far in the future.

Quantum plug n’ play: modular computation in the quantum regime

Science.gov (United States)

Thompson, Jayne; Modi, Kavan; Vedral, Vlatko; Gu, Mile

2018-01-01

Classical computation is modular. It exploits plug n’ play architectures which allow us to use pre-fabricated circuits without knowing their construction. This bestows advantages such as allowing parts of the computational process to be outsourced, and permitting individual circuit components to be exchanged and upgraded. Here, we introduce a formal framework to describe modularity in the quantum regime. We demonstrate a ‘no-go’ theorem, stipulating that it is not always possible to make use of quantum circuits without knowing their construction. This has significant consequences for quantum algorithms, forcing the circuit implementation of certain quantum algorithms to be rebuilt almost entirely from scratch after incremental changes in the problem—such as changing the number being factored in Shor’s algorithm. We develop a workaround capable of restoring modularity, and apply it to design a modular version of Shor’s algorithm that exhibits increased versatility and reduced complexity. In doing so we pave the way to a realistic framework whereby ‘quantum chips’ and remote servers can be invoked (or assembled) to implement various parts of a more complex quantum computation.

Quantum Genetics in terms of Quantum Reversible Automata and Quantum Computation of Genetic Codes and Reverse Transcription

CERN Document Server

Baianu,I C

2004-01-01

The concepts of quantum automata and quantum computation are studied in the context of quantum genetics and genetic networks with nonlinear dynamics. In previous publications (Baianu,1971a, b) the formal concept of quantum automaton and quantum computation, respectively, were introduced and their possible implications for genetic processes and metabolic activities in living cells and organisms were considered. This was followed by a report on quantum and abstract, symbolic computation based on the theory of categories, functors and natural transformations (Baianu,1971b; 1977; 1987; 2004; Baianu et al, 2004). The notions of topological semigroup, quantum automaton, or quantum computer, were then suggested with a view to their potential applications to the analogous simulation of biological systems, and especially genetic activities and nonlinear dynamics in genetic networks. Further, detailed studies of nonlinear dynamics in genetic networks were carried out in categories of n-valued, Lukasiewicz Logic Algebra...

Towards scalable quantum communication and computation: Novel approaches and realizations

Science.gov (United States)

Jiang, Liang

Quantum information science involves exploration of fundamental laws of quantum mechanics for information processing tasks. This thesis presents several new approaches towards scalable quantum information processing. First, we consider a hybrid approach to scalable quantum computation, based on an optically connected network of few-qubit quantum registers. Specifically, we develop a novel scheme for scalable quantum computation that is robust against various imperfections. To justify that nitrogen-vacancy (NV) color centers in diamond can be a promising realization of the few-qubit quantum register, we show how to isolate a few proximal nuclear spins from the rest of the environment and use them for the quantum register. We also demonstrate experimentally that the nuclear spin coherence is only weakly perturbed under optical illumination, which allows us to implement quantum logical operations that use the nuclear spins to assist the repetitive-readout of the electronic spin. Using this technique, we demonstrate more than two-fold improvement in signal-to-noise ratio. Apart from direct application to enhance the sensitivity of the NV-based nano-magnetometer, this experiment represents an important step towards the realization of robust quantum information processors using electronic and nuclear spin qubits. We then study realizations of quantum repeaters for long distance quantum communication. Specifically, we develop an efficient scheme for quantum repeaters based on atomic ensembles. We use dynamic programming to optimize various quantum repeater protocols. In addition, we propose a new protocol of quantum repeater with encoding, which efficiently uses local resources (about 100 qubits) to identify and correct errors, to achieve fast one-way quantum communication over long distances. Finally, we explore quantum systems with topological order. Such systems can exhibit remarkable phenomena such as quasiparticles with anyonic statistics and have been proposed as

Demonstration of measurement-only blind quantum computing

Science.gov (United States)

Greganti, Chiara; Roehsner, Marie-Christine; Barz, Stefanie; Morimae, Tomoyuki; Walther, Philip

2016-01-01

Blind quantum computing allows for secure cloud networks of quasi-classical clients and a fully fledged quantum server. Recently, a new protocol has been proposed, which requires a client to perform only measurements. We demonstrate a proof-of-principle implementation of this measurement-only blind quantum computing, exploiting a photonic setup to generate four-qubit cluster states for computation and verification. Feasible technological requirements for the client and the device-independent blindness make this scheme very applicable for future secure quantum networks.