Higher-order spin and charge dynamics in a quantum dot-lead hybrid system.

Science.gov (United States)

Otsuka, Tomohiro; Nakajima, Takashi; Delbecq, Matthieu R; Amaha, Shinichi; Yoneda, Jun; Takeda, Kenta; Allison, Giles; Stano, Peter; Noiri, Akito; Ito, Takumi; Loss, Daniel; Ludwig, Arne; Wieck, Andreas D; Tarucha, Seigo

2017-09-22

Understanding the dynamics of open quantum systems is important and challenging in basic physics and applications for quantum devices and quantum computing. Semiconductor quantum dots offer a good platform to explore the physics of open quantum systems because we can tune parameters including the coupling to the environment or leads. Here, we apply the fast single-shot measurement techniques from spin qubit experiments to explore the spin and charge dynamics due to tunnel coupling to a lead in a quantum dot-lead hybrid system. We experimentally observe both spin and charge time evolution via first- and second-order tunneling processes, and reveal the dynamics of the spin-flip through the intermediate state. These results enable and stimulate the exploration of spin dynamics in dot-lead hybrid systems, and may offer useful resources for spin manipulation and simulation of open quantum systems.

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)

Spectroscopy of Charged Quantum Dot Molecules

Science.gov (United States)

Stinaff, E. A.; Scheibner, M.; Bracker, A. S.; Ponomarev, I. V.; Ware, M. E.; Doty, M. F.; Reinecke, T. L.; Gammon, D.; Korenev, V. L.

2006-03-01

Spins of single charges in quantum dots are attractive for many quantum information and spintronic proposals. Scalable quantum information applications require the ability to entangle and operate on multiple spins in coupled quantum dots (CQDs). To further the understanding of these systems, we present detailed spectroscopic studies of InAs CQDs with control of the discrete electron or hole charging of the system. The optical spectrum reveals a pattern of energy anticrossings and crossings in the photoluminescence as a function of applied electric field. These features can be understood as a superposition of charge and spin configurations of the two dots and represent clear signatures of quantum mechanical coupling. The molecular resonance leading to these anticrossings is achieved at different electric fields for the optically excited (trion) states and the ground (hole) states allowing for the possibility of using the excited states for optically induced coupling of the qubits.

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

Charge Dynamics and Spin Blockade in a Hybrid Double Quantum Dot in Silicon

Directory of Open Access Journals (Sweden)

Matias Urdampilleta

2015-08-01

Full Text Available Electron spin qubits in silicon, whether in quantum dots or in donor atoms, have long been considered attractive qubits for the implementation of a quantum computer because of silicon’s “semiconductor vacuum” character and its compatibility with the microelectronics industry. While donor electron spins in silicon provide extremely long coherence times and access to the nuclear spin via the hyperfine interaction, quantum dots have the complementary advantages of fast electrical operations, tunability, and scalability. Here, we present an approach to a novel hybrid double quantum dot by coupling a donor to a lithographically patterned artificial atom. Using gate-based rf reflectometry, we probe the charge stability of this double quantum-dot system and the variation of quantum capacitance at the interdot charge transition. Using microwave spectroscopy, we find a tunnel coupling of 2.7 GHz and characterize the charge dynamics, which reveals a charge T_{2}^{*} of 200 ps and a relaxation time T_{1} of 100 ns. Additionally, we demonstrate a spin blockade at the inderdot transition, opening up the possibility to operate this coupled system as a singlet-triplet qubit or to transfer a coherent spin state between the quantum dot and the donor electron and nucleus.

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)

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.

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

Milestones Toward Majorana-Based Quantum Computing

Directory of Open Access Journals (Sweden)

David Aasen

2016-08-01

Full Text Available We introduce a scheme for preparation, manipulation, and read out of Majorana zero modes in semiconducting wires with mesoscopic superconducting islands. Our approach synthesizes recent advances in materials growth with tools commonly used in quantum-dot experiments, including gate control of tunnel barriers and Coulomb effects, charge sensing, and charge pumping. We outline a sequence of milestones interpolating between zero-mode detection and quantum computing that includes (1 detection of fusion rules for non-Abelian anyons using either proximal charge sensors or pumped current, (2 validation of a prototype topological qubit, and (3 demonstration of non-Abelian statistics by braiding in a branched geometry. The first two milestones require only a single wire with two islands, and additionally enable sensitive measurements of the system’s excitation gap, quasiparticle poisoning rates, residual Majorana zero-mode splittings, and topological-qubit coherence times. These pre-braiding experiments can be adapted to other manipulation and read out schemes as well.

Quantum mechanics of charged particle beam optics

CERN Document Server

Khan, Sameen Ahmed

2018-01-01

Theory of charged particle beam optics is basic to the design and working of charged particle beam devices from electron microscopes to accelerator machines. Traditionally, the optical elements of the devices are designed and operated based on classical mechanics and classical electromagnetism, and only certain specific quantum mechanical aspects are dealt with separately using quantum theory. This book provides a systematic approach to quantum theory of charged particle beam optics, particularly in the high energy cases such as accelerators or high energy electron microscopy.

Unconventional Quantum Computing Devices

OpenAIRE

Lloyd, Seth

2000-01-01

This paper investigates a variety of unconventional quantum computation devices, including fermionic quantum computers and computers that exploit nonlinear quantum mechanics. It is shown that unconventional quantum computing devices can in principle compute some quantities more rapidly than `conventional' quantum computers.

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.

Optical Spectroscopy Of Charged Quantum Dot Molecules

Science.gov (United States)

Scheibner, M.; Bracker, A. S.; Stinaff, E. A.; Doty, M. F.; Gammon, D.; Ponomarev, I. V.; Reinecke, T. L.; Korenev, V. L.

2007-04-01

Coupling between two closely spaced quantum dots is observed by means of photoluminescence spectroscopy. Hole coupling is realized by rational crystal growth and heterostructure design. We identify molecular resonances of different excitonic charge states, including the important case of a doubly charged quantum dot molecule.

Simulation of Si:P spin-based quantum computer architecture

International Nuclear Information System (INIS)

Chang Yiachung; Fang Angbo

2008-01-01

We present realistic simulation for single and double phosphorous donors in a silicon-based quantum computer design by solving a valley-orbit coupled effective-mass equation for describing phosphorous donors in strained silicon quantum well (QW). Using a generalized unrestricted Hartree-Fock method, we solve the two-electron effective-mass equation with quantum well confinement and realistic gate potentials. The effects of QW width, gate voltages, donor separation, and donor position shift on the lowest singlet and triplet energies and their charge distributions for a neighboring donor pair in the quantum computer(QC) architecture are analyzed. The gate tunability are defined and evaluated for a typical QC design. Estimates are obtained for the duration of spin half-swap gate operation.

Cartoon computation: quantum-like computing without quantum mechanics

International Nuclear Information System (INIS)

Aerts, Diederik; Czachor, Marek

2007-01-01

We present a computational framework based on geometric structures. No quantum mechanics is involved, and yet the algorithms perform tasks analogous to quantum computation. Tensor products and entangled states are not needed-they are replaced by sets of basic shapes. To test the formalism we solve in geometric terms the Deutsch-Jozsa problem, historically the first example that demonstrated the potential power of quantum computation. Each step of the algorithm has a clear geometric interpretation and allows for a cartoon representation. (fast track communication)

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...

Quantacell: powerful charging of quantum batteries

International Nuclear Information System (INIS)

Binder, Felix C; Vinjanampathy, Sai; Modi, Kavan; Goold, John

2015-01-01

We study the problem of charging a quantum battery in finite time. We demonstrate an analytical optimal protocol for the case of a single qubit. Extending this analysis to an array of N qubits, we demonstrate that an N-fold advantage in power per qubit can be achieved when global operations are permitted. The exemplary analytic argument for this quantum advantage in the charging power is backed up by numerical analysis using optimal control techniques. It is demonstrated that the quantum advantage for power holds when, with cyclic operation in mind, initial and final states are required to be separable. (paper)

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 robots and quantum computers

Energy Technology Data Exchange (ETDEWEB)

Benioff, P.

1998-07-01

Validation of a presumably universal theory, such as quantum mechanics, requires a quantum mechanical description of systems that carry out theoretical calculations and systems that carry out experiments. The description of quantum computers is under active development. No description of systems to carry out experiments has been given. A small step in this direction is taken here by giving a description of quantum robots as mobile systems with on board quantum computers that interact with different environments. Some properties of these systems are discussed. A specific model based on the literature descriptions of quantum Turing machines is presented.

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.

Spin properties of charged Mn-doped quantum dota)

Science.gov (United States)

Besombes, L.; Léger, Y.; Maingault, L.; Mariette, H.

2007-04-01

The optical properties of individual quantum dots doped with a single Mn atom and charged with a single carrier are analyzed. The emission of the neutral, negatively and positively charged excitons coupled with a single magnetic atom (Mn) are observed in the same individual quantum dot. The spectrum of the charged excitons in interaction with the Mn atom shows a rich pattern attributed to a strong anisotropy of the hole-Mn exchange interaction slightly perturbed by a small valence-band mixing. The anisotropy in the exchange interaction between a single magnetic atom and a single hole is revealed by comparing the emission of a charged Mn-doped quantum dot in longitudinal and transverse magnetic field.

The top-transmon: a hybrid superconducting qubit for parity-protected quantum computation

International Nuclear Information System (INIS)

Hassler, F; Akhmerov, A R; Beenakker, C W J

2011-01-01

Qubits constructed from uncoupled Majorana fermions are protected from decoherence, but to perform a quantum computation this topological protection needs to be broken. Parity-protected quantum computation breaks the protection in a minimally invasive way, by coupling directly to the fermion parity of the system-irrespective of any quasiparticle excitations. Here, we propose to use a superconducting charge qubit in a transmission line resonator (the so-called transmon) to perform parity-protected rotations and read-out of a topological (top) qubit. The advantage over an earlier proposal using a flux qubit is that the coupling can be switched on and off with exponential accuracy, promising a reduced sensitivity to charge noise.

Quantum and classical dissipation of charged particles

Energy Technology Data Exchange (ETDEWEB)

Ibarra-Sierra, V.G. [Departamento de Física, Universidad Autónoma Metropolitana at Iztapalapa, Av. San Rafael Atlixco 186, Col. Vicentina, 09340 México D.F. (Mexico); Anzaldo-Meneses, A.; Cardoso, J.L.; Hernández-Saldaña, H. [Área de Física Teórica y Materia Condensada, Universidad Autónoma Metropolitana at Azcapotzalco, Av. San Pablo 180, Col. Reynosa-Tamaulipas, Azcapotzalco, 02200 México D.F. (Mexico); Kunold, A., E-mail: akb@correo.azc.uam.mx [Área de Física Teórica y Materia Condensada, Universidad Autónoma Metropolitana at Azcapotzalco, Av. San Pablo 180, Col. Reynosa-Tamaulipas, Azcapotzalco, 02200 México D.F. (Mexico); Roa-Neri, J.A.E. [Área de Física Teórica y Materia Condensada, Universidad Autónoma Metropolitana at Azcapotzalco, Av. San Pablo 180, Col. Reynosa-Tamaulipas, Azcapotzalco, 02200 México D.F. (Mexico)

2013-08-15

A Hamiltonian approach is presented to study the two dimensional motion of damped electric charges in time dependent electromagnetic fields. The classical and the corresponding quantum mechanical problems are solved for particular cases using canonical transformations applied to Hamiltonians for a particle with variable mass. Green’s function is constructed and, from it, the motion of a Gaussian wave packet is studied in detail. -- Highlights: •Hamiltonian of a damped charged particle in time dependent electromagnetic fields. •Exact Green’s function of a charged particle in time dependent electromagnetic fields. •Time evolution of a Gaussian wave packet of a damped charged particle. •Classical and quantum dynamics of a damped electric charge.

Quantum and classical dissipation of charged particles

International Nuclear Information System (INIS)

Ibarra-Sierra, V.G.; Anzaldo-Meneses, A.; Cardoso, J.L.; Hernández-Saldaña, H.; Kunold, A.; Roa-Neri, J.A.E.

2013-01-01

A Hamiltonian approach is presented to study the two dimensional motion of damped electric charges in time dependent electromagnetic fields. The classical and the corresponding quantum mechanical problems are solved for particular cases using canonical transformations applied to Hamiltonians for a particle with variable mass. Green’s function is constructed and, from it, the motion of a Gaussian wave packet is studied in detail. -- Highlights: •Hamiltonian of a damped charged particle in time dependent electromagnetic fields. •Exact Green’s function of a charged particle in time dependent electromagnetic fields. •Time evolution of a Gaussian wave packet of a damped charged particle. •Classical and quantum dynamics of a damped electric charge

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...

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.

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:

Superconducting single electron transistor for charge sensing in Si/SiGe-based quantum dots

Science.gov (United States)

Yang, Zhen

Si-based quantum devices, including Si/SiGe quantum dots (QD), are promising candidates for spin-based quantum bits (quits), which are a potential platform for quantum information processing. Meanwhile, qubit readout remains a challenging task related to semiconductor-based quantum computation. This thesis describes two readout devices for Si/SiGe QDs and the techniques for developing them from a traditional single electron transistor (SET). By embedding an SET in a tank circuit and operating it in the radio-frequency (RF) regime, a superconducting RF-SET has quick response as well as ultra high charge sensitivity and can be an excellent charge sensor for the QDs. We demonstrate such RF-SETs for QDs in a Si/SiGe heterostructure. Characterization of the SET in magnetic fields is studied for future exploration of advanced techniques such as spin detection and spin state manipulation. By replacing the tank circuit with a high-quality-factor microwave cavity, the embedded SET will be operated in the supercurrent regime as a single Cooper pair transistor (CPT) to further increase the charge sensitivity and reduce any dissipation. The operating principle and implementation of the cavity-embedded CPT (cCPT) will be introduced.

Charge-field formulation of quantum electrodynamics (QEMED)

International Nuclear Information System (INIS)

Leiter, D.

1980-01-01

By expressing classical electron theory in terms of 'charge-field' functional structures, it is shown that a finite formulation of the classical electrodynamics of point charges emerges in a simple and elegant fashion. This is used to construct a 'charge-field' quantum electrodynamic theory. It is found that interacting photon states are generated as a secondary manifestation of electron-positron quantization, and do not require the usual 'free' canonical quantization scheme. The possibility is discussed that this approach may lead to a better formulation of quantum electrodynamics in the Heisenberg picture and suggests a crucial experimental test to distinguish this new 'charge-field' quantum electrodynamics 'QEMED' from the standard QED formulation. Specifically QEMED predicts that the 'Einstein principle of separability' should be found to be valid for correlated photon polarization measurements, in which the polarizers are changed more rapidly than a characteristic photon travel time. Such an experiment (Aspect 1976) can distinguish between QEMED and QED in a complete and clear-cut fashion. (U.K.)

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.

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)

Quantum Statistical Mechanics on a Quantum Computer

NARCIS (Netherlands)

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

2000-01-01

We describe a simulation method for a quantum spin model of a generic, general purpose quantum computer. The use of this quantum computer simulator is illustrated through several implementations of Grover’s database search algorithm. Some preliminary results on the stability of quantum algorithms

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)

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.

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.

Single-charge tunneling in ambipolar silicon quantum dots

NARCIS (Netherlands)

Müller, Filipp

2015-01-01

Spin qubits in coupled quantum dots (QDs) are promising for future quantum information processing (QIP). A quantum bit (qubit) is the quantum mechanical analogon of a classical bit. In general, each quantum mechanical two-level system can represent a qubit. For the spin of a single charge carrier

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.

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 mechanics and computation

International Nuclear Information System (INIS)

Cirac Sasturain, J. I.

2000-01-01

We review how some of the basic principles of Quantum Mechanics can be used in the field of computation. In particular, we explain why a quantum computer can perform certain tasks in a much more efficient way than the computers we have available nowadays. We give the requirements for a quantum system to be able to implement a quantum computer and illustrate these requirements in some particular physical situations. (Author) 16 refs

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.

Josephson junction in the quantum mesoscopic electric circuits with charge discreteness

Science.gov (United States)

Pahlavani, H.

2018-04-01

A quantum mesoscopic electrical LC-circuit with charge discreteness including a Josephson junction is considered and a nonlinear Hamiltonian that describing the dynamic of such circuit is introduced. The quantum dynamical behavior (persistent current probability) is studied in the charge and phase regimes by numerical solution approaches. The time evolution of charge and current, number-difference and the bosonic phase and also the energy spectrum of a quantum mesoscopic electric LC-circuit with charge discreteness that coupled with a Josephson junction device are investigated. We show the role of the coupling energy and the electrostatic Coulomb energy of the Josephson junction in description of the quantum behavior and the spectral properties of a quantum mesoscopic electrical LC-circuits with charge discreteness.

Quantum Computer Games: Quantum Minesweeper

Science.gov (United States)

Gordon, Michal; Gordon, Goren

2010-01-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…

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 ...

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 aspects of charged-particle beam optics

Energy Technology Data Exchange (ETDEWEB)

Khan, Sameen Ahmed, E-mail: rohelakhan@yahoo.com [Department of Mathematics and Sciences, College of Arts and Applied Sciences, Dhofar University, Salalah, Sultanate of Oman (Oman)

2016-06-10

The classical treatments have been successful in designing numerous charged-particle devices. It is natural to develop a quantum prescription, since all systems are fundamentally quantum mechanical in nature. The quantum theory leads to new insights accompanied with wavelength-dependent contributions. The action of a magnetic quadrupole is derived from the Dirac equation.

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 charged rigid membrane

Energy Technology Data Exchange (ETDEWEB)

Cordero, Ruben [Departamento de Fisica, Escuela Superior de Fisica y Matematicas del I.P.N., Unidad Adolfo Lopez Mateos, Edificio 9, 07738 Mexico, D.F. (Mexico); Molgado, Alberto [Unidad Academica de Fisica, Universidad Autonoma de Zacatecas, Zacatecas Zac. (Mexico); Rojas, Efrain, E-mail: cordero@esfm.ipn.mx, E-mail: amolgado@fisica.uaz.edu.mx, E-mail: efrojas@uv.mx [Departamento de Fisica, Facultad de Fisica e Inteligencia Artificial, Universidad Veracruzana, 91000 Xalapa, Veracruz (Mexico)

2011-03-21

The early Dirac proposal to model the electron as a charged membrane is reviewed. A rigidity term, instead of the natural membrane tension, involving linearly the extrinsic curvature of the worldvolume swept out by the membrane is considered in the action modeling the bubble in the presence of an electromagnetic field. We set up this model as a genuine second-order derivative theory by considering a non-trivial boundary term which plays a relevant part in our formulation. The Lagrangian in question is linear in the bubble acceleration and by means of the Ostrogradski-Hamiltonian approach, we observed that the theory comprises the management of both first- and second-class constraints. We thus show that our second-order approach is robust allowing for a proper quantization. We found an effective quantum potential which permits us to compute bounded states for the system. We comment on the possibility of describing brane world universes by invoking this kind of second-order correction terms.

Quantum charged rigid membrane

International Nuclear Information System (INIS)

Cordero, Ruben; Molgado, Alberto; Rojas, Efrain

2011-01-01

The early Dirac proposal to model the electron as a charged membrane is reviewed. A rigidity term, instead of the natural membrane tension, involving linearly the extrinsic curvature of the worldvolume swept out by the membrane is considered in the action modeling the bubble in the presence of an electromagnetic field. We set up this model as a genuine second-order derivative theory by considering a non-trivial boundary term which plays a relevant part in our formulation. The Lagrangian in question is linear in the bubble acceleration and by means of the Ostrogradski-Hamiltonian approach, we observed that the theory comprises the management of both first- and second-class constraints. We thus show that our second-order approach is robust allowing for a proper quantization. We found an effective quantum potential which permits us to compute bounded states for the system. We comment on the possibility of describing brane world universes by invoking this kind of second-order correction terms.

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.

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.

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...

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.

Quantum modeling of ultrafast photoinduced charge separation

Science.gov (United States)

Rozzi, Carlo Andrea; Troiani, Filippo; Tavernelli, Ivano

2018-01-01

Phenomena involving electron transfer are ubiquitous in nature, photosynthesis and enzymes or protein activity being prominent examples. Their deep understanding thus represents a mandatory scientific goal. Moreover, controlling the separation of photogenerated charges is a crucial prerequisite in many applicative contexts, including quantum electronics, photo-electrochemical water splitting, photocatalytic dye degradation, and energy conversion. In particular, photoinduced charge separation is the pivotal step driving the storage of sun light into electrical or chemical energy. If properly mastered, these processes may also allow us to achieve a better command of information storage at the nanoscale, as required for the development of molecular electronics, optical switching, or quantum technologies, amongst others. In this Topical Review we survey recent progress in the understanding of ultrafast charge separation from photoexcited states. We report the state-of-the-art of the observation and theoretical description of charge separation phenomena in the ultrafast regime mainly focusing on molecular- and nano-sized solar energy conversion systems. In particular, we examine different proposed mechanisms driving ultrafast charge dynamics, with particular regard to the role of quantum coherence and electron-nuclear coupling, and link experimental observations to theoretical approaches based either on model Hamiltonians or on first principles simulations.

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.

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.

Quantum spin and charge pumping through double quantum dots with ferromagnetic leads

Energy Technology Data Exchange (ETDEWEB)

Pan, Hui, E-mail: hpan@buaa.edu.cn [Department of Physics, Beijing University of Aeronautics and Astronautics, Beijing 100191 (China); Key Laboratory of Micro-Nano Measurement-Manipulation and Physics (Ministry of Education), Beihang University, Beijing 100191 (China); Chen, Ziyu; Zhao, Sufen [Department of Physics, Beijing University of Aeronautics and Astronautics, Beijing 100191 (China); Lue, Rong [Department of Physics, Tsinghua University, Beijing 100084 (China)

2011-06-06

The pumping of electrons through double quantum dots (DQDs) attached to ferromagnetic leads have been theoretically investigated by using the nonequilibrium Green's function method. It is found that an oscillating electric field applied to the quantum dot may give rise to the pumped charge and spin currents. In the case that both leads are ferromagnet, a pure spin current can be generated in the antiparallel magnetization configuration, where no net charge current exists. The possibility of manipulating the pumped spin current is explored by tuning the dot level and the ac field. By making use of various tunings, the magnitude and direction of the pumped spin current can be well controlled. For the case that only one lead is ferromagnetic, both of the charge and spin currents can be pumped and flow in opposite directions on the average. The control of the magnitude and direction of the pumped charge and spin currents is also discussed by means of the magnetic flux threading through the DQD ring. -- Highlights: → We theoretically investigate the pumping of electrons through double quantum dots attached to ferromagnetic leads. → An oscillating electric field applied to the quantum dot may give rise to the pumped charge and spin currents. → When both leads are ferromagnet, a pure spin current can be generated in the antiparallel magnetization configuration. → By making use of various tunings, the magnitude and direction of the pumped spin current can be well controlled. → When only one lead is ferromagnetic, both of the charge and spin currents can be pumped and flow in opposite directions.

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

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 Statistical Mechanics on a Quantum Computer

OpenAIRE

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

1999-01-01

We describe a quantum algorithm to compute the density of states and thermal equilibrium properties of quantum many-body systems. We present results obtained by running this algorithm on a software implementation of a 21-qubit quantum computer for the case of an antiferromagnetic Heisenberg model on triangular lattices of different size.

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.

Charge-extraction strategies for colloidal quantum dot photovoltaics

KAUST Repository

Lan, Xinzheng

2014-02-20

The solar-power conversion efficiencies of colloidal quantum dot solar cells have advanced from sub-1% reported in 2005 to a record value of 8.5% in 2013. Much focus has deservedly been placed on densifying, passivating and crosslinking the colloidal quantum dot solid. Here we review progress in improving charge extraction, achieved by engineering the composition and structure of the electrode materials that contact the colloidal quantum dot film. New classes of structured electrodes have been developed and integrated to form bulk heterojunction devices that enhance photocharge extraction. Control over band offsets, doping and interfacial trap state densities have been essential for achieving improved electrical communication with colloidal quantum dot solids. Quantum junction devices that not only tune the optical absorption spectrum, but also provide inherently matched bands across the interface between p-and n-materials, have proven that charge separation can occur efficiently across an all-quantum-tuned rectifying junction. © 2014 Macmillan Publishers Limited.

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.

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.

Computing and the electrical transport properties of coupled quantum networks

Science.gov (United States)

Cain, Casey Andrew

In this dissertation a number of investigations were conducted on ballistic quantum networks in the mesoscopic range. In this regime, the wave nature of electron transport under the influence of transverse magnetic fields leads to interesting applications for digital logic and computing circuits. The work specifically looks at characterizing a few main areas that would be of interest to experimentalists who are working in nanostructure devices, and is organized as a series of papers. The first paper analyzes scaling relations and normal mode charge distributions for such circuits in both isolated and open (terminals attached) form. The second paper compares the flux-qubit nature of quantum networks to the well-established spintronics theory. The results found exactly contradict the conventional school of thought for what is required for quantum computation. The third paper investigates the requirements and limitations of extending the Thevenin theorem in classic electric circuits to ballistic quantum transport. The fourth paper outlines the optimal functionally complete set of quantum circuits that can completely satisfy all sixteen Boolean logic operations for two variables.

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.

Self-screening of the quantum confined Stark effect by the polarization induced bulk charges in the quantum barriers

International Nuclear Information System (INIS)

Zhang, Zi-Hui; Liu, Wei; Ju, Zhengang; Tiam Tan, Swee; Ji, Yun; Kyaw, Zabu; Zhang, Xueliang; Wang, Liancheng; Wei Sun, Xiao; Volkan Demir, Hilmi

2014-01-01

InGaN/GaN light-emitting diodes (LEDs) grown along the polar orientations significantly suffer from the quantum confined Stark effect (QCSE) caused by the strong polarization induced electric field in the quantum wells, which is a fundamental problem intrinsic to the III-nitrides. Here, we show that the QCSE is self-screened by the polarization induced bulk charges enabled by designing quantum barriers. The InN composition of the InGaN quantum barrier graded along the growth orientation opportunely generates the polarization induced bulk charges in the quantum barrier, which well compensate the polarization induced interface charges, thus avoiding the electric field in the quantum wells. Consequently, the optical output power and the external quantum efficiency are substantially improved for the LEDs. The ability to self-screen the QCSE using polarization induced bulk charges opens up new possibilities for device engineering of III-nitrides not only in LEDs but also in other optoelectronic devices.

Self-screening of the quantum confined Stark effect by the polarization induced bulk charges in the quantum barriers

Energy Technology Data Exchange (ETDEWEB)

Zhang, Zi-Hui; Liu, Wei; Ju, Zhengang; Tiam Tan, Swee; Ji, Yun; Kyaw, Zabu; Zhang, Xueliang; Wang, Liancheng; Wei Sun, Xiao, E-mail: exwsun@ntu.edu.sg, E-mail: volkan@stanfordalumni.org [LUMINOUS Centre of Excellence for Semiconductor Lighting and Displays, School of Electrical and Electronic Engineering, School of Physical and Mathematical Sciences, Nanyang Technological University, 50 Nanyang Avenue, Singapore 639798 (Singapore); Volkan Demir, Hilmi, E-mail: exwsun@ntu.edu.sg, E-mail: volkan@stanfordalumni.org [LUMINOUS Centre of Excellence for Semiconductor Lighting and Displays, School of Electrical and Electronic Engineering, School of Physical and Mathematical Sciences, Nanyang Technological University, 50 Nanyang Avenue, Singapore 639798 (Singapore); Department of Electrical and Electronics, Department of Physics, and UNAM-Institute of Material Science and Nanotechnology, Bilkent University, TR-06800 Ankara (Turkey)

2014-06-16

InGaN/GaN light-emitting diodes (LEDs) grown along the polar orientations significantly suffer from the quantum confined Stark effect (QCSE) caused by the strong polarization induced electric field in the quantum wells, which is a fundamental problem intrinsic to the III-nitrides. Here, we show that the QCSE is self-screened by the polarization induced bulk charges enabled by designing quantum barriers. The InN composition of the InGaN quantum barrier graded along the growth orientation opportunely generates the polarization induced bulk charges in the quantum barrier, which well compensate the polarization induced interface charges, thus avoiding the electric field in the quantum wells. Consequently, the optical output power and the external quantum efficiency are substantially improved for the LEDs. The ability to self-screen the QCSE using polarization induced bulk charges opens up new possibilities for device engineering of III-nitrides not only in LEDs but also in other optoelectronic devices.

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.

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.

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.

Geodesic paths and topological charges in quantum systems

Science.gov (United States)

Grangeiro Souza Barbosa Lima, Tiago Aecio

This dissertation focuses on one question: how should one drive an experimentally prepared state of a generic quantum system into a different target-state, simultaneously minimizing energy dissipation and maximizing the fidelity between the target and evolved-states? We develop optimal adiabatic driving protocols for general quantum systems, and show that these are geodesic paths. Geometric ideas have always played a fundamental role in the understanding and unification of physical phenomena, and the recent discovery of topological insulators has drawn great interest to topology from the field of condensed matter physics. Here, we discuss the quantum geometric tensor, a mathematical object that encodes geometrical and topological properties of a quantum system. It is related to the fidelity susceptibility (an important quantity regarding quantum phase transitions) and to the Berry curvature, which enables topological characterization through Berry phases. A refined understanding of the interplay between geometry and topology in quantum mechanics is of direct relevance to several emergent technologies, such as quantum computers, quantum cryptography, and quantum sensors. As a demonstration of how powerful geometric and topological ideas can become when combined, we present the results of an experiment that we recently proposed. This experimental work was done at the Google Quantum Lab, where researchers were able to visualize the topological nature of a two-qubit system in sharp detail, a startling contrast with earlier methods. To achieve this feat, the optimal protocols described in this dissertation were used, allowing for a great improvement on the experimental apparatus, without the need for technical engineering advances. Expanding the existing literature on the quantum geometric tensor using notions from differential geometry and topology, we build on the subject nowadays known as quantum geometry. We discuss how slowly changing a parameter of a quantum

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

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)

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.

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 nano ring composed of quantum dots as a source of pure persistent spin or charge current

International Nuclear Information System (INIS)

Eslami, L.; Faizabadi, E.; Ahmadi, S.

2016-01-01

Spin-dependent persistent current in a quantum ring constituted by two normal and one magnetic quantum dots, in the presence of Rashba spin–orbit interaction is studied by using Green function technique. It is shown that the presence of the magnetic quantum dot breaks the degeneracy of the density of states of electrons with different spin states. Besides, the Rashba spin–orbit interaction along with the magnetic quantum dot develops tunable persistent spin and charge currents. Moreover, the persistent charge current induces a fully adjustable magnetic flux whose direction and magnitude can be tuned by altering the strength of the Rashba spin–orbit interaction. - Highlights: • An array of normal and magnetic quantum dots with Rashba effect is studied. • Spin-dependent persistent current and DOS are studied using Green function method. • The magnetic quantum dot breaks degeneracy of DOS of up and down spin electrons. • The persistent spin and charge currents are tuned by adjusting the Rashba constant. • The persistent charge current induces tunable magnetic field at the center of ring.

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

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.

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

Elucidating reaction mechanisms on quantum computers

Science.gov (United States)

Reiher, Markus; Wiebe, Nathan; Svore, Krysta M.; Wecker, Dave; Troyer, Matthias

2017-01-01

With rapid recent advances in quantum technology, we are close to the threshold of quantum devices whose computational powers can exceed those of classical supercomputers. Here, we show that a quantum computer can be used to elucidate reaction mechanisms in complex chemical systems, using the open problem of biological nitrogen fixation in nitrogenase as an example. We discuss how quantum computers can augment classical computer simulations used to probe these reaction mechanisms, to significantly increase their accuracy and enable hitherto intractable simulations. Our resource estimates show that, even when taking into account the substantial overhead of quantum error correction, and the need to compile into discrete gate sets, the necessary computations can be performed in reasonable time on small quantum computers. Our results demonstrate that quantum computers will be able to tackle important problems in chemistry without requiring exorbitant resources. PMID:28674011

Elucidating reaction mechanisms on quantum computers

Science.gov (United States)

Reiher, Markus; Wiebe, Nathan; Svore, Krysta M.; Wecker, Dave; Troyer, Matthias

2017-07-01

With rapid recent advances in quantum technology, we are close to the threshold of quantum devices whose computational powers can exceed those of classical supercomputers. Here, we show that a quantum computer can be used to elucidate reaction mechanisms in complex chemical systems, using the open problem of biological nitrogen fixation in nitrogenase as an example. We discuss how quantum computers can augment classical computer simulations used to probe these reaction mechanisms, to significantly increase their accuracy and enable hitherto intractable simulations. Our resource estimates show that, even when taking into account the substantial overhead of quantum error correction, and the need to compile into discrete gate sets, the necessary computations can be performed in reasonable time on small quantum computers. Our results demonstrate that quantum computers will be able to tackle important problems in chemistry without requiring exorbitant resources.

Elucidating reaction mechanisms on quantum computers.

Science.gov (United States)

Reiher, Markus; Wiebe, Nathan; Svore, Krysta M; Wecker, Dave; Troyer, Matthias

2017-07-18

With rapid recent advances in quantum technology, we are close to the threshold of quantum devices whose computational powers can exceed those of classical supercomputers. Here, we show that a quantum computer can be used to elucidate reaction mechanisms in complex chemical systems, using the open problem of biological nitrogen fixation in nitrogenase as an example. We discuss how quantum computers can augment classical computer simulations used to probe these reaction mechanisms, to significantly increase their accuracy and enable hitherto intractable simulations. Our resource estimates show that, even when taking into account the substantial overhead of quantum error correction, and the need to compile into discrete gate sets, the necessary computations can be performed in reasonable time on small quantum computers. Our results demonstrate that quantum computers will be able to tackle important problems in chemistry without requiring exorbitant resources.

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 theory of space charge limited current in solids

Energy Technology Data Exchange (ETDEWEB)

González, Gabriel, E-mail: gabriel.gonzalez@uaslp.mx [Cátedras Conacyt, Universidad Autónoma de San Luis Potosí, San Luis Potosí 78000, Mexico and Coordinación para la Innovación y la Aplicación de la Ciencia y la Tecnología, Universidad Autónoma de San Luis Potosí, San Luis Potosí 78000 (Mexico)

2015-02-28

We present a quantum model of space charge limited current transport inside trap-free solids with planar geometry in the mean field approximation. We use a simple transformation which allows us to find the exact analytical solution for the steady state current case. We use our approach to find a Mott-Gurney like behavior and the mobility for single charge carriers in the quantum regime in solids.

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 ...

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.)

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

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.

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...

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 ...

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.

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.

Quantum-mechanical computers and uncomputability

International Nuclear Information System (INIS)

Lloyd, S.

1993-01-01

The time evolution operator for any quantum-mechanical computer is diagonalizable, but to obtain the diagonal decomposition of a program state of the computer is as hard as actually performing the computation corresponding to the program. In particular, if a quantum-mechanical system is capable of universal computation, then the diagonal decomposition of program states is uncomputable. As a result, in a universe in which local variables support universal computation, a quantum-mechanical theory for that universe that supplies its spectrum cannot supply the spectral decomposition of the computational variables. A ''theory of everything'' can be simultaneously correct and fundamentally incomplete

Quantum RLC circuits: Charge discreteness and resonance

Energy Technology Data Exchange (ETDEWEB)

Utreras-Diaz, Constantino A. [Instituto de Fisica, Facultad de Ciencias, Universidad Austral de Chile, Campus Isla Teja s/n, Casilla 567, Valdivia (Chile)], E-mail: cutreras@uach.cl

2008-10-20

In a recent article [C.A. Utreras-Diaz, Phys. Lett. A 372 (2008) 5059], we have advanced a semiclassical theory of quantum circuits with discrete charge and electrical resistance. In this work, we present a few elementary applications of this theory. For the zero resistance inductive circuit, we obtain the Stark ladder energies in yet another way; for the circuit driven by a combination d.c. plus a.c. electromotive force (emf) we generalize earlier results by Chandia et al. [K. Chandia, J.C. Flores, E. Lazo, Phys. Lett. A 359 (2006) 693]. As a second application, we investigate the effect of electrical resistance and charge discreteness, in the resonance conditions of a series RLC quantum circuit.

Quantum RLC circuits: Charge discreteness and resonance

International Nuclear Information System (INIS)

Utreras-Diaz, Constantino A.

2008-01-01

In a recent article [C.A. Utreras-Diaz, Phys. Lett. A 372 (2008) 5059], we have advanced a semiclassical theory of quantum circuits with discrete charge and electrical resistance. In this work, we present a few elementary applications of this theory. For the zero resistance inductive circuit, we obtain the Stark ladder energies in yet another way; for the circuit driven by a combination d.c. plus a.c. electromotive force (emf) we generalize earlier results by Chandia et al. [K. Chandia, J.C. Flores, E. Lazo, Phys. Lett. A 359 (2006) 693]. As a second application, we investigate the effect of electrical resistance and charge discreteness, in the resonance conditions of a series RLC quantum circuit

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.

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.

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.

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.

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.

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.

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

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.

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.

Spin-charge separation in quantum wires

International Nuclear Information System (INIS)

Yacoby, A.

2004-01-01

Full Text:Using momentum resolved tunneling between two clean parallel quantum wires in a AlGaAs/GaAs heterostructure we directly measure the dispersion of the quantum many-body modes in ballistic wires and follow their dependence on Coulomb interactions by varying the electron density. We find clear signatures of three excitation modes in the data: The anti-symmetric charge mode of the coupled wire system and two spin modes. The density dependence of the anti-symmetric charge mode agrees well with Luttinger-liquid theory. As the density of electrons is lowered, the Coulomb interaction is seen to become increasingly dominant leading to excitation velocities that are up to 2.5 times faster than the bare Fermi velocity, determined experimentally from the carrier density. The symmetric charge excitation, also expected from theory, is, however, not visible in the data. The observed spin velocities are found to be 25% slower than the bare Fermi velocities and depend linearly on carrier density. The dispersions are mapped down to a critical density at which spontaneous localization is observed. Some of the experimental findings concerning this phase will be discussed

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.

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.

Measurement-only topological quantum computation without forced measurements

International Nuclear Information System (INIS)

Zheng, Huaixiu; Dua, Arpit; Jiang, Liang

2016-01-01

We investigate the measurement-only topological quantum computation (MOTQC) approach proposed by Bonderson et al (2008 Phys. Rev. Lett. 101 010501) where the braiding operation is shown to be equivalent to a series of topological charge ‘forced measurements’ of anyons. In a forced measurement, the charge measurement is forced to yield the desired outcome (e.g. charge 0) via repeatedly measuring charges in different bases. This is a probabilistic process with a certain success probability for each trial. In practice, the number of measurements needed will vary from run to run. We show that such an uncertainty associated with forced measurements can be removed by simulating the braiding operation using a fixed number of three measurements supplemented by a correction operator. Furthermore, we demonstrate that in practice we can avoid applying the correction operator in hardware by implementing it in software. Our findings greatly simplify the MOTQC proposal and only require the capability of performing charge measurements to implement topologically protected transformations generated by braiding exchanges without physically moving anyons. (paper)

Influence of the quantum dot geometry on p -shell transitions in differently charged quantum dots

Science.gov (United States)

Holtkemper, M.; Reiter, D. E.; Kuhn, T.

2018-02-01

Absorption spectra of neutral, negatively, and positively charged semiconductor quantum dots are studied theoretically. We provide an overview of the main energetic structure around the p -shell transitions, including the influence of nearby nominally dark states. Based on the envelope function approximation, we treat the four-band Luttinger theory as well as the direct and short-range exchange Coulomb interactions within a configuration interaction approach. The quantum dot confinement is approximated by an anisotropic harmonic potential. We present a detailed investigation of state mixing and correlations mediated by the individual interactions. Differences and similarities between the differently charged quantum dots are highlighted. Especially large differences between negatively and positively charged quantum dots become evident. We present a visualization of energetic shifts and state mixtures due to changes in size, in-plane asymmetry, and aspect ratio. Thereby we provide a better understanding of the experimentally hard to access question of quantum dot geometry effects. Our findings show a method to determine the in-plane asymmetry from photoluminescence excitation spectra. Furthermore, we supply basic knowledge for tailoring the strength of certain state mixtures or the energetic order of particular excited states via changes of the shape of the quantum dot. Such knowledge builds the basis to find the optimal QD geometry for possible applications and experiments using excited states.

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

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.

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.

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.

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...

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.

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)

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.

Quantum conserved charges in N=1 and N=2 supersymmetric sine-Gordon theories

International Nuclear Information System (INIS)

Kobayashi, Ken-ichiro; Uematsu, Tsuneo; Yu Yangzheng

1993-01-01

We investigate quantum conservation laws in the N=1 and N=2 supersymmetric sine-Gordon theories. We study conserved charges at the quantum level based on perturbation theory formulated in superspace. It will turn out that there exist extra conserved charges of the vertex operator type at the quantum level and they generate a quantum group symmetry in supersymmetric sine-Gordon systems. We also discuss the implication of the quantum group symmetry on the S-matrix structure. (orig.)

High-Power Collective Charging of a Solid-State Quantum Battery

Science.gov (United States)

Ferraro, Dario; Campisi, Michele; Andolina, Gian Marcello; Pellegrini, Vittorio; Polini, Marco

2018-03-01

Quantum information theorems state that it is possible to exploit collective quantum resources to greatly enhance the charging power of quantum batteries (QBs) made of many identical elementary units. We here present and solve a model of a QB that can be engineered in solid-state architectures. It consists of N two-level systems coupled to a single photonic mode in a cavity. We contrast this collective model ("Dicke QB"), whereby entanglement is genuinely created by the common photonic mode, to the one in which each two-level system is coupled to its own separate cavity mode ("Rabi QB"). By employing exact diagonalization, we demonstrate the emergence of a quantum advantage in the charging power of Dicke QBs, which scales like √{N } for N ≫1 .

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

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.

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.

Measurement Back-Action in Quantum Point-Contact Charge Sensing

Directory of Open Access Journals (Sweden)

Bruno Küng

2010-06-01

Full Text Available Charge sensing with quantum point-contacts (QPCs is a technique widely used in semiconductor quantum-dot research. Understanding the physics of this measurement process, as well as finding ways of suppressing unwanted measurement back-action, are therefore both desirable. In this article, we present experimental studies targeting these two goals. Firstly, we measure the effect of a QPC on electron tunneling between two InAs quantum dots, and show that a model based on the QPC’s shot-noise can account for it. Secondly, we discuss the possibility of lowering the measurement current (and thus the back-action used for charge sensing by correlating the signals of two independent measurement channels. The performance of this method is tested in a typical experimental setup.

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.

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.

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

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.

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.

Central charge for AdS2 quantum gravity

International Nuclear Information System (INIS)

Hartman, Thomas; Strominger, Andrew

2009-01-01

Two-dimensional Maxwell-dilaton quantum gravity on AdS 2 with radius l and a constant electric field E is studied. In conformal gauge, this is equivalent to a CFT on a strip. In order to maintain consistent boundary conditions, the usual conformal diffeomorphisms must be accompanied by a certain U(1) gauge transformation. The resulting conformal transformations are generated by a twisted stress tensor, which has a central charge c = 3kE 2 l 4 /4 where k is the level of the U(1) current. This is an AdS 2 analog of the Brown-Henneaux formula c = 3l/2G for the central charge of quantum gravity on AdS 3 .

Effects of low charge carrier wave function overlap on internal quantum efficiency in GaInN quantum wells

Energy Technology Data Exchange (ETDEWEB)

Netzel, Carsten; Hoffmann, Veit; Wernicke, Tim; Knauer, Arne; Weyers, Markus [Ferdinand-Braun-Institut fuer Hoechstfrequenztechnik, Gustav-Kirchhoff-Strasse 4, 12489 Berlin (Germany); Kneissl, Michael [Ferdinand-Braun-Institut fuer Hoechstfrequenztechnik, Gustav-Kirchhoff-Strasse 4, 12489 Berlin (Germany); Institut fuer Festkoerperphysik, Technische Universitaet Berlin, Hardenbergstrasse 36, 10623 Berlin (Germany)

2010-07-15

To determine relevant processes affecting the internal quantum efficiency in GaInN quantum well structures, we have studied the temperature and excitation power dependent photoluminescence intensity for quantum wells with different well widths on (0001) c-plane GaN and for quantum wells on nonpolar (11-20) a-plane GaN. In thick polar quantum wells, the quantum confined Stark effect (QCSE) causes a stronger intensity decrease with increasing temperature as long as the radiative recombination dominates. At higher temperatures, when the nonradiative recombination becomes more important, thick polar quantum wells feature a lower relative intensity decrease than thinner polar or nonpolar quantum wells. Excitation power dependent photoluminescence points to a transition from a recombination of excitons to a bimolecular recombination of uncorrelated charge carriers for thick polar quantum wells in the same temperature range. This transition might contribute to the limitation of nonradiative recombination by a reduced diffusivity of charge carriers. (copyright 2010 WILEY-VCH Verlag GmbH and Co. KGaA, Weinheim) (orig.)

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.

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

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...

dc Resistivity of Quantum Critical, Charge Density Wave States from Gauge-Gravity Duality.

Science.gov (United States)

Amoretti, Andrea; Areán, Daniel; Goutéraux, Blaise; Musso, Daniele

2018-04-27

In contrast to metals with weak disorder, the resistivity of weakly pinned charge density waves (CDWs) is not controlled by irrelevant processes relaxing momentum. Instead, the leading contribution is governed by incoherent, diffusive processes which do not drag momentum and can be evaluated in the clean limit. We compute analytically the dc resistivity for a family of holographic charge density wave quantum critical phases and discuss its temperature scaling. Depending on the critical exponents, the ground state can be conducting or insulating. We connect our results to dc electrical transport in underdoped cuprate high T_{c} superconductors. We conclude by speculating on the possible relevance of unstable, semilocally critical CDW states to the strange metallic region.

dc Resistivity of Quantum Critical, Charge Density Wave States from Gauge-Gravity Duality

Science.gov (United States)

Amoretti, Andrea; Areán, Daniel; Goutéraux, Blaise; Musso, Daniele

2018-04-01

In contrast to metals with weak disorder, the resistivity of weakly pinned charge density waves (CDWs) is not controlled by irrelevant processes relaxing momentum. Instead, the leading contribution is governed by incoherent, diffusive processes which do not drag momentum and can be evaluated in the clean limit. We compute analytically the dc resistivity for a family of holographic charge density wave quantum critical phases and discuss its temperature scaling. Depending on the critical exponents, the ground state can be conducting or insulating. We connect our results to dc electrical transport in underdoped cuprate high Tc superconductors. We conclude by speculating on the possible relevance of unstable, semilocally critical CDW states to the strange metallic region.

Quantum loop corrections of a charged de Sitter black hole

Science.gov (United States)

Naji, J.

2018-03-01

A charged black hole in de Sitter (dS) space is considered and logarithmic corrected entropy used to study its thermodynamics. Logarithmic corrections of entropy come from thermal fluctuations, which play a role of quantum loop correction. In that case we are able to study the effect of quantum loop on black hole thermodynamics and statistics. As a black hole is a gravitational object, it helps to obtain some information about the quantum gravity. The first and second laws of thermodynamics are investigated for the logarithmic corrected case and we find that it is only valid for the charged dS black hole. We show that the black hole phase transition disappears in the presence of logarithmic correction.

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.

Multiplexed charge-locking device for large arrays of quantum devices

Energy Technology Data Exchange (ETDEWEB)

Puddy, R. K., E-mail: rkp27@cam.ac.uk; Smith, L. W; Chong, C. H.; Farrer, I.; Griffiths, J. P.; Ritchie, D. A.; Smith, C. G. [Cavendish Laboratory, University of Cambridge, Cambridge CB3 0HE (United Kingdom); Al-Taie, H.; Kelly, M. J. [Cavendish Laboratory, University of Cambridge, Cambridge CB3 0HE (United Kingdom); Centre for Advanced Photonics and Electronics, Electrical Engineering Division, Department of Engineering, 9 J. J. Thomson Avenue, University of Cambridge, Cambridge CB3 0FA (United Kingdom); Pepper, M. [Department of Electronic and Electrical Engineering, University College London, WC1E 7JE (United Kingdom)

2015-10-05

We present a method of forming and controlling large arrays of gate-defined quantum devices. The method uses an on-chip, multiplexed charge-locking system and helps to overcome the restraints imposed by the number of wires available in cryostat measurement systems. The device architecture that we describe here utilises a multiplexer-type scheme to lock charge onto gate electrodes. The design allows access to and control of gates whose total number exceeds that of the available electrical contacts and enables the formation, modulation and measurement of large arrays of quantum devices. We fabricate such devices on n-type GaAs/AlGaAs substrates and investigate the stability of the charge locked on to the gates. Proof-of-concept is shown by measurement of the Coulomb blockade peaks of a single quantum dot formed by a floating gate in the device. The floating gate is seen to drift by approximately one Coulomb oscillation per hour.

Quantum electrodynamics with arbitrary charge on a noncommutative space

International Nuclear Information System (INIS)

Zhou Wanping; Long Zhengwen; Cai Shaohong

2009-01-01

Using the Seiberg-Witten map, we obtain a quantum electrodynamics on a noncommutative space, which has arbitrary charge and keep the gauge invariance to at the leading order in theta. The one-loop divergence and Compton scattering are reinvestigated. The noncommutative effects are larger than those in ordinary noncommutative quantum electrodynamics. (authors)

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

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

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.

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.

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.

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.

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.

Microgravity and Charge Transfer in the Neuronal Membrane: Implications for Computational Neurobiology

Science.gov (United States)

Wallace, Ron

1995-01-01

Evidence from natural and artificial membranes indicates that the neural membrane is a liquid crystal. A liquid-to-gel phase transition caused by the application of superposed electromagnetic fields to the outer membrane surface releases spin-correlated electron pairs which propagate through a charge transfer complex. The propagation generates Rydberg atoms in the lipid bilayer lattice. In the present model, charge density configurations in promoted orbitals interact as cellular automata and perform computations in Hilbert space. Due to the small binding energies of promoted orbitals, their automata are highly sensitive to microgravitational perturbations. It is proposed that spacetime is classical on the Rydberg scale, but formed of contiguous moving segments, each of which displays topological equivalence. This stochasticity is reflected in randomized Riemannian tensor values. Spacetime segments interact with charge automata as components of a computational process. At the termination of the algorithm, an orbital of high probability density is embedded in a more stabilized microscopic spacetime. This state permits the opening of an ion channel and the conversion of a quantum algorithm into a macroscopic frequency code.

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...

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)

Quantum computers based on electron spins controlled by ultrafast off-resonant single optical pulses.

Science.gov (United States)

Clark, Susan M; Fu, Kai-Mei C; Ladd, Thaddeus D; Yamamoto, Yoshihisa

2007-07-27

We describe a fast quantum computer based on optically controlled electron spins in charged quantum dots that are coupled to microcavities. This scheme uses broadband optical pulses to rotate electron spins and provide the clock signal to the system. Nonlocal two-qubit gates are performed by phase shifts induced by electron spins on laser pulses propagating along a shared waveguide. Numerical simulations of this scheme demonstrate high-fidelity single-qubit and two-qubit gates with operation times comparable to the inverse Zeeman frequency.

A quantum criticality perspective on the charging of narrow quantum-dot levels

OpenAIRE

Kashcheyevs, V.; Karrasch, C.; Hecht, T.; Weichselbaum, A.; Meden, V.; Schiller, A.

2008-01-01

Understanding the charging of exceptionally narrow levels in quantum dots in the presence of interactions remains a challenge within mesoscopic physics. We address this fundamental question in the generic model of a narrow level capacitively coupled to a broad one. Using bosonization we show that for arbitrary capacitive coupling charging can be described by an analogy to the magnetization in the anisotropic Kondo model, featuring a low-energy crossover scale that depends in a power-law fashi...

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)

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

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.

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.

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 ...

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 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.

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.

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.

Error Correction for Non-Abelian Topological Quantum Computation

Directory of Open Access Journals (Sweden)

James R. Wootton

2014-03-01

Full Text Available The possibility of quantum computation using non-Abelian anyons has been considered for over a decade. However, the question of how to obtain and process information about what errors have occurred in order to negate their effects has not yet been considered. This is in stark contrast with quantum computation proposals for Abelian anyons, for which decoding algorithms have been tailor-made for many topological error-correcting codes and error models. Here, we address this issue by considering the properties of non-Abelian error correction, in general. We also choose a specific anyon model and error model to probe the problem in more detail. The anyon model is the charge submodel of D(S_{3}. This shares many properties with important models such as the Fibonacci anyons, making our method more generally applicable. The error model is a straightforward generalization of those used in the case of Abelian anyons for initial benchmarking of error correction methods. It is found that error correction is possible under a threshold value of 7% for the total probability of an error on each physical spin. This is remarkably comparable with the thresholds for Abelian models.

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...

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.

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 not change the wor...

Universality of black hole quantum computing

Energy Technology Data Exchange (ETDEWEB)

Dvali, Gia [Muenchen Univ. (Germany). Arnold Sommerfeld Center for Theoretical Physics; Max-Planck-Institut fuer Physik, Muenchen (Germany); New York Univ., NY (United States). Center for Cosmology and Particle Physics; Gomez, Cesar [Muenchen Univ. (Germany). Arnold Sommerfeld Center for Theoretical Physics; Univ. Autonoma de Madrid (Spain). Inst. de Fisica Teorica UAM-CSIC; Luest, Dieter [Muenchen Univ. (Germany). Arnold Sommerfeld Center for Theoretical Physics; Max-Planck-Institut fuer Physik, Muenchen (Germany); Omar, Yasser [Instituto de Telecomunicacoes (Portugal). Physics of Information and Quantum Technologies Group; Lisboa Univ. (Portugal). Inst. Superior Tecnico; Richter, Benedikt [Muenchen Univ. (Germany). Arnold Sommerfeld Center for Theoretical Physics; Instituto de Telecomunicacoes (Portugal). Physics of Information and Quantum Technologies Group; Lisboa Univ. (Portugal). Inst. Superior Tecnico

2017-01-15

By analyzing the key properties of black holes from the point of view of quantum information, we derive a model-independent picture of black hole quantum computing. It has been noticed that this picture exhibits striking similarities with quantum critical condensates, allowing the use of a common language to describe quantum computing in both systems. We analyze such quantum computing by allowing coupling to external modes, under the condition that the external influence must be soft-enough in order not to offset the basic properties of the system. We derive model-independent bounds on some crucial time-scales, such as the times of gate operation, decoherence, maximal entanglement and total scrambling. We show that for black hole type quantum computers all these time-scales are of the order of the black hole half-life time. Furthermore, we construct explicitly a set of Hamiltonians that generates a universal set of quantum gates for the black hole type computer. We find that the gates work at maximal energy efficiency. Furthermore, we establish a fundamental bound on the complexity of quantum circuits encoded on these systems, and characterize the unitary operations that are implementable. It becomes apparent that the computational power is very limited due to the fact that the black hole life-time is of the same order of the gate operation time. As a consequence, it is impossible to retrieve its information, within the life-time of a black hole, by externally coupling to the black hole qubits. However, we show that, in principle, coupling to some of the internal degrees of freedom allows acquiring knowledge about the micro-state. Still, due to the trivial complexity of operations that can be performed, there is no time advantage over the collection of Hawking radiation and subsequent decoding. (copyright 2016 WILEY-VCH Verlag GmbH and Co. KGaA, Weinheim)

Information-theoretic temporal Bell inequality and quantum computation

International Nuclear Information System (INIS)

Morikoshi, Fumiaki

2006-01-01

An information-theoretic temporal Bell inequality is formulated to contrast classical and quantum computations. Any classical algorithm satisfies the inequality, while quantum ones can violate it. Therefore, the violation of the inequality is an immediate consequence of the quantumness in the computation. Furthermore, this approach suggests a notion of temporal nonlocality in quantum computation

Blueprint for a microwave trapped ion quantum computer.

Science.gov (United States)

Lekitsch, Bjoern; Weidt, Sebastian; Fowler, Austin G; Mølmer, Klaus; Devitt, Simon J; Wunderlich, Christof; Hensinger, Winfried K

2017-02-01

The availability of a universal quantum computer may have a fundamental impact on a vast number of research fields and on society as a whole. An increasingly large scientific and industrial community is working toward the realization of such a device. An arbitrarily large quantum computer may best be constructed using a modular approach. We present a blueprint for a trapped ion-based scalable quantum computer module, making it possible to create a scalable quantum computer architecture based on long-wavelength radiation quantum gates. The modules control all operations as stand-alone units, are constructed using silicon microfabrication techniques, and are within reach of current technology. To perform the required quantum computations, the modules make use of long-wavelength radiation-based quantum gate technology. To scale this microwave quantum computer architecture to a large size, we present a fully scalable design that makes use of ion transport between different modules, thereby allowing arbitrarily many modules to be connected to construct a large-scale device. A high error-threshold surface error correction code can be implemented in the proposed architecture to execute fault-tolerant operations. With appropriate adjustments, the proposed modules are also suitable for alternative trapped ion quantum computer architectures, such as schemes using photonic interconnects.

Exciton shelves for charge and energy transport in third-generation quantum-dot devices

Science.gov (United States)

Goodman, Samuel; Singh, Vivek; Noh, Hyunwoo; Casamada, Josep; Chatterjee, Anushree; Cha, Jennifer; Nagpal, Prashant

2014-03-01

Quantum dots are semiconductor nanocrystallites with size-dependent quantum-confined energy levels. While they have been intensively investigated to utilize hot-carriers for photovoltaic applications, to bridge the mismatch between incident solar photons and finite bandgap of semiconductor photocells, efficient charge or exciton transport in quantum-dot films has proven challenging. Here we show development of new coupled conjugated molecular wires with ``exciton shelves'', or different energy levels, matched with the multiple energy levels of quantum dots. Using single nanoparticle and ensemble device measurements we show successful extraction and transport of both bandedge and high-energy charge carriers, and energy transport of excitons. We demonstrate using measurements of electronic density of states, that careful matching of energy states of quantum-dot with molecular wires is important, and any mismatch can generate midgap states leading to charge recombination and reduced efficiency. Therefore, these exciton-shelves and quantum dots can lead to development of next-generation photovoltaic and photodetection devices using simultaneous transport of bandedge and hot-carriers or energy transport of excitons in these nanostructured solution-processed films.

Computational quantum chemistry website

International Nuclear Information System (INIS)

1997-01-01

This report contains the contents of a web page related to research on the development of quantum chemistry methods for computational thermochemistry and the application of quantum chemistry methods to problems in material chemistry and chemical sciences. Research programs highlighted include: Gaussian-2 theory; Density functional theory; Molecular sieve materials; Diamond thin-film growth from buckyball precursors; Electronic structure calculations on lithium polymer electrolytes; Long-distance electronic coupling in donor/acceptor molecules; and Computational studies of NOx reactions in radioactive waste storage

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

Gate errors in solid-state quantum-computer architectures

International Nuclear Information System (INIS)

Hu Xuedong; Das Sarma, S.

2002-01-01

We theoretically consider possible errors in solid-state quantum computation due to the interplay of the complex solid-state environment and gate imperfections. In particular, we study two examples of gate operations in the opposite ends of the gate speed spectrum, an adiabatic gate operation in electron-spin-based quantum dot quantum computation and a sudden gate operation in Cooper-pair-box superconducting quantum computation. We evaluate quantitatively the nonadiabatic operation of a two-qubit gate in a two-electron double quantum dot. We also analyze the nonsudden pulse gate in a Cooper-pair-box-based quantum-computer model. In both cases our numerical results show strong influences of the higher excited states of the system on the gate operation, clearly demonstrating the importance of a detailed understanding of the relevant Hilbert-space structure on the quantum-computer operations

Polarized electrons, trions, and nuclei in charged quantum dots

Science.gov (United States)

Bracker, A. S.; Tischler, J. G.; Korenev, V. L.; Gammon, D.

2003-07-01

We have investigated spin polarization in GaAs quantum dots. Excitons and trions are polarized directly by optical excitation and studied through polarization of photoluminescence. Electrons and nuclei are polarized indirectly through subsequent relaxation processes. Polarized electrons are identified by the Hanle effect for exciton and trion photoluminescence, while polarized nuclei are identified through the Overhauser effect in individual charged quantum dots.

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.

Performing quantum computing experiments in the cloud

Science.gov (United States)

Devitt, Simon J.

2016-09-01

Quantum computing technology has reached a second renaissance in the past five years. Increased interest from both the private and public sector combined with extraordinary theoretical and experimental progress has solidified this technology as a major advancement in the 21st century. As anticipated my many, some of the first realizations of quantum computing technology has occured over the cloud, with users logging onto dedicated hardware over the classical internet. Recently, IBM has released the Quantum Experience, which allows users to access a five-qubit quantum processor. In this paper we take advantage of this online availability of actual quantum hardware and present four quantum information experiments. We utilize the IBM chip to realize protocols in quantum error correction, quantum arithmetic, quantum graph theory, and fault-tolerant quantum computation by accessing the device remotely through the cloud. While the results are subject to significant noise, the correct results are returned from the chip. This demonstrates the power of experimental groups opening up their technology to a wider audience and will hopefully allow for the next stage of development in quantum information technology.

Optical Pumping of the Electronic and Nuclear Spin of Single Charge-Tunable Quantum Dots

Science.gov (United States)

Bracker, A. S.; Stinaff, E. A.; Gammon, D.; Ware, M. E.; Tischler, J. G.; Shabaev, A.; Efros, Al. L.; Park, D.; Gershoni, D.; Korenev, V. L.; Merkulov, I. A.

2005-02-01

We present a comprehensive examination of optical pumping of spins in individual GaAs quantum dots as we change the net charge from positive to neutral to negative with a charge-tunable heterostructure. Negative photoluminescence polarization memory is enhanced by optical pumping of ground state electron spins, which we prove with the first measurements of the Hanle effect on an individual quantum dot. We use the Overhauser effect in a high longitudinal magnetic field to demonstrate efficient optical pumping of nuclear spins for all three charge states of the quantum dot.

Quantum Computing With Quasiparticles of the Fractional Quantum Hall Effect

National Research Council Canada - National Science Library

Averin, Dmitri

2001-01-01

The focus of this project was the theoretical study of quantum computation based on controlled transfer of individual quasiparticles in systems of quantum antidots in the regime of the Fractional Quantum Hall Effect (FQHE...

Physical Realizations of Quantum Computing

CERN Document Server

Kanemitsu, Shigeru; Salomaa, Martti; Takagi, Shin; Are the DiVincenzo Criteria Fulfilled in 2004 ?

2006-01-01

The contributors of this volume are working at the forefront of various realizations of quantum computers. They survey the recent developments in each realization, in the context of the DiVincenzo criteria, including nuclear magnetic resonance, Josephson junctions, quantum dots, and trapped ions. There are also some theoretical contributions which have relevance in the physical realizations of a quantum computer. This book fills the gap between elementary introductions to the subject and highly specialized research papers to allow beginning graduate students to understand the cutting-edge of r

Quantum Computation

Indian Academy of Sciences (India)

Home; Journals; Resonance – Journal of Science Education; Volume 16; Issue 9. Quantum Computation - Particle and Wave Aspects of Algorithms. Apoorva Patel. General Article Volume 16 Issue 9 September 2011 pp 821-835. Fulltext. Click here to view fulltext PDF. Permanent link:

Charge injection and transport in quantum confined and disordered systems

NARCIS (Netherlands)

Houtepen, A.J.

2007-01-01

Quantum dots and conducting polymers are modern semiconductors with a high potential for applications such as lasers, LEDs, displays, solar cells etc. These applications require the controlled addition of charge carriers into the material and knowledge of the details of charge transport. This thesis

Demonstration of measurement-only blind quantum computing

International Nuclear Information System (INIS)

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

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. (paper)

Quantum simulation of superconductors on quantum computers. Toward the first applications of quantum processors

Energy Technology Data Exchange (ETDEWEB)

Dallaire-Demers, Pierre-Luc

2016-10-07

Quantum computers are the ideal platform for quantum simulations. Given enough coherent operations and qubits, such machines can be leveraged to simulate strongly correlated materials, where intricate quantum effects give rise to counter-intuitive macroscopic phenomena such as high-temperature superconductivity. Many phenomena of strongly correlated materials are encapsulated in the Fermi-Hubbard model. In general, no closed-form solution is known for lattices of more than one spatial dimension, but they can be numerically approximated using cluster methods. To model long-range effects such as order parameters, a powerful method to compute the cluster's Green's function consists in finding its self-energy through a variational principle. As is shown in this thesis, this allows the possibility of studying various phase transitions at finite temperature in the Fermi-Hubbard model. However, a classical cluster solver quickly hits an exponential wall in the memory (or computation time) required to store the computation variables. We show theoretically that the cluster solver can be mapped to a subroutine on a quantum computer whose quantum memory usage scales linearly with the number of orbitals in the simulated cluster and the number of measurements scales quadratically. We also provide a gate decomposition of the cluster Hamiltonian and a simple planar architecture for a quantum simulator that can also be used to simulate more general fermionic systems. We briefly analyze the Trotter-Suzuki errors and estimate the scaling properties of the algorithm for more complex applications. A quantum computer with a few tens of qubits could therefore simulate the thermodynamic properties of complex fermionic lattices inaccessible to classical supercomputers.

Quantum simulation of superconductors on quantum computers. Toward the first applications of quantum processors

International Nuclear Information System (INIS)

Dallaire-Demers, Pierre-Luc

2016-01-01

Quantum computers are the ideal platform for quantum simulations. Given enough coherent operations and qubits, such machines can be leveraged to simulate strongly correlated materials, where intricate quantum effects give rise to counter-intuitive macroscopic phenomena such as high-temperature superconductivity. Many phenomena of strongly correlated materials are encapsulated in the Fermi-Hubbard model. In general, no closed-form solution is known for lattices of more than one spatial dimension, but they can be numerically approximated using cluster methods. To model long-range effects such as order parameters, a powerful method to compute the cluster's Green's function consists in finding its self-energy through a variational principle. As is shown in this thesis, this allows the possibility of studying various phase transitions at finite temperature in the Fermi-Hubbard model. However, a classical cluster solver quickly hits an exponential wall in the memory (or computation time) required to store the computation variables. We show theoretically that the cluster solver can be mapped to a subroutine on a quantum computer whose quantum memory usage scales linearly with the number of orbitals in the simulated cluster and the number of measurements scales quadratically. We also provide a gate decomposition of the cluster Hamiltonian and a simple planar architecture for a quantum simulator that can also be used to simulate more general fermionic systems. We briefly analyze the Trotter-Suzuki errors and estimate the scaling properties of the algorithm for more complex applications. A quantum computer with a few tens of qubits could therefore simulate the thermodynamic properties of complex fermionic lattices inaccessible to classical supercomputers.

Quantum memory on a charge qubit in an optical microresonator

Science.gov (United States)

Tsukanov, A. V.

2017-10-01

A quantum-memory unit scheme on the base of a semiconductor structure with quantum dots is proposed. The unit includes a microresonator with single and double quantum dots performing frequencyconverter and charge-qubit functions, respectively. The writing process is carried out in several stages and it is controlled by optical fields of the resonator and laser. It is shown that, to achieve high writing probability, it is necessary to use high-Q resonators and to be able to suppress relaxation processes in quantum dots.

Non-local charges in local quantum field theory

International Nuclear Information System (INIS)

Buchholz, D.; Lopuszanski, J.T.; Rabsztyn, S.

1985-05-01

Non-local charges are studied in the general setting of local quantum field theory. It is shown, that these charges can be represented as polynomials in the incoming respectively outgoing fields with coefficients (kernels) which are subject to specific constraints. For the restricted class of models of a scalar, massive, self interacting particle in four dimensions, a more detailed analysis shows that all non-local charges of the generic type (genus 2) are products of generators of the Poincare group. This analysis, which is based on the macroscopic causality properties of the S-matrix, seems to indicate that less trivial examples of non-local charges can only exist in two dimensions. (orig.)

Non-unitary probabilistic quantum computing

Science.gov (United States)

Gingrich, Robert M.; Williams, Colin P.

2004-01-01

We present a method for designing quantum circuits that perform non-unitary quantum computations on n-qubit states probabilistically, and give analytic expressions for the success probability and fidelity.

Efficient quantum circuits for one-way quantum computing.

Science.gov (United States)

Tanamoto, Tetsufumi; Liu, Yu-Xi; Hu, Xuedong; Nori, Franco

2009-03-13

While Ising-type interactions are ideal for implementing controlled phase flip gates in one-way quantum computing, natural interactions between solid-state qubits are most often described by either the XY or the Heisenberg models. We show an efficient way of generating cluster states directly using either the imaginary SWAP (iSWAP) gate for the XY model, or the sqrt[SWAP] gate for the Heisenberg model. Our approach thus makes one-way quantum computing more feasible for solid-state devices.

Universal quantum gates for Single Cooper Pair Box based quantum computing

Science.gov (United States)

Echternach, P.; Williams, C. P.; Dultz, S. C.; Braunstein, S.; Dowling, J. P.

2000-01-01

We describe a method for achieving arbitrary 1-qubit gates and controlled-NOT gates within the context of the Single Cooper Pair Box (SCB) approach to quantum computing. Such gates are sufficient to support universal quantum computation.

Quantum Computation with Superconducting Quantum Devices

National Research Council Canada - National Science Library

Orlando, Terry P

2008-01-01

.... Important to the future implementation of these qubits for quantum computing applications is the demonstration of microwave sideband cooling of the qubits as well as a resonant read-out scheme...

Photon induced non-linear quantized double layer charging in quaternary semiconducting quantum dots.

Science.gov (United States)

Nair, Vishnu; Ananthoju, Balakrishna; Mohapatra, Jeotikanta; Aslam, M

2018-03-15

Room temperature quantized double layer charging was observed in 2 nm Cu 2 ZnSnS 4 (CZTS) quantum dots. In addition to this we observed a distinct non-linearity in the quantized double layer charging arising from UV light modulation of double layer. UV light irradiation resulted in a 26% increase in the integral capacitance at the semiconductor-dielectric (CZTS-oleylamine) interface of the quantum dot without any change in its core size suggesting that the cause be photocapacitive. The increasing charge separation at the semiconductor-dielectric interface due to highly stable and mobile photogenerated carriers cause larger electrostatic forces between the quantum dot and electrolyte leading to an enhanced double layer. This idea was supported by a decrease in the differential capacitance possible due to an enhanced double layer. Furthermore the UV illumination enhanced double layer gives us an AC excitation dependent differential double layer capacitance which confirms that the charging process is non-linear. This ultimately illustrates the utility of a colloidal quantum dot-electrolyte interface as a non-linear photocapacitor. Copyright © 2017 Elsevier Inc. All rights reserved.

Homomorphic encryption experiments on IBM's cloud quantum computing platform

Science.gov (United States)

Huang, He-Liang; Zhao, You-Wei; Li, Tan; Li, Feng-Guang; Du, Yu-Tao; Fu, Xiang-Qun; Zhang, Shuo; Wang, Xiang; Bao, Wan-Su

2017-02-01

Quantum computing has undergone rapid development in recent years. Owing to limitations on scalability, personal quantum computers still seem slightly unrealistic in the near future. The first practical quantum computer for ordinary users is likely to be on the cloud. However, the adoption of cloud computing is possible only if security is ensured. Homomorphic encryption is a cryptographic protocol that allows computation to be performed on encrypted data without decrypting them, so it is well suited to cloud computing. Here, we first applied homomorphic encryption on IBM's cloud quantum computer platform. In our experiments, we successfully implemented a quantum algorithm for linear equations while protecting our privacy. This demonstration opens a feasible path to the next stage of development of cloud quantum information technology.

Quantum Accelerators for High-Performance Computing Systems

OpenAIRE

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

2017-01-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 quantu...

Investigation on photoluminescence quenching of CdSe/ZnS quantum dots by organic charge transporting materials

Directory of Open Access Journals (Sweden)

Yuqiu Qu

2015-12-01

Full Text Available The effect of different organic charge transporting materials on the photoluminescence of CdSe/ZnS core/shell quantum dots has been studied by means of steady-state and time-resolved photoluminescence spectroscopy. With an increase in concentration of the organic charge transporting material in the quantum dots solutions, the photoluminescence intensity of CdSe/ZnS quantum dots was quenched greatly and the fluorescence lifetime was shortened gradually. The quenching efficiency of CdSe/ZnS core/shell quantum dots decreased with increasing the oxidation potential of organic charge transporting materials. Based on the analysis, two pathways in the photoluminescence quenching process have been defined: static quenching and dynamic quenching. The dynamic quenching is correlated with hole transporting from quantum dots to the charge transporting materials.

Spin networks and quantum computation

International Nuclear Information System (INIS)

Kauffman, L.; Lomonaco, S. Jr.

2008-01-01

We review the q-deformed spin network approach to Topological Quantum Field Theory and apply these methods to produce unitary representations of the braid groups that are dense in the unitary groups. The simplest case of these models is the Fibonacci model, itself universal for quantum computation. We here formulate these braid group representations in a form suitable for computation and algebraic work. (authors)

Ammonia-based quantum computer

International Nuclear Information System (INIS)

Ferguson, Andrew J.; Cain, Paul A.; Williams, David A.; Briggs, G. Andrew D.

2002-01-01

We propose a scheme for quantum computation using two eigenstates of ammonia or similar molecules. Individual ammonia molecules are confined inside fullerenes and used as two-level qubit systems. Interaction between these ammonia qubits takes place via the electric dipole moments, and in particular we show how a controlled-NOT gate could be implemented. After computation the qubit is measured with a single-electron electrometer sensitive enough to differentiate between the dipole moments of different states. We also discuss a possible implementation based on a quantum cellular automaton

Quantum Random Networks for Type 2 Quantum Computers

National Research Council Canada - National Science Library

Allara, David L; Hasslacher, Brosl

2006-01-01

Random boolean networks (RBNs) have been studied theoretically and computationally in order to be able to use their remarkable self-healing and large basins of altercation properties as quantum computing architectures, especially...

Quantum computation architecture using optical tweezers

DEFF Research Database (Denmark)

Weitenberg, Christof; Kuhr, Stefan; Mølmer, Klaus

2011-01-01

We present a complete architecture for scalable quantum computation with ultracold atoms in optical lattices using optical tweezers focused to the size of a lattice spacing. We discuss three different two-qubit gates based on local collisional interactions. The gates between arbitrary qubits...... quantum computing....

Universal quantum computation in a semiconductor quantum wire network

International Nuclear Information System (INIS)

Sau, Jay D.; Das Sarma, S.; Tewari, Sumanta

2010-01-01

Universal quantum computation (UQC) using Majorana fermions on a two-dimensional topological superconducting (TS) medium remains an outstanding open problem. This is because the quantum gate set that can be generated by braiding of the Majorana fermions does not include any two-qubit gate and also no single-qubit π/8 phase gate. In principle, it is possible to create these crucial extra gates using quantum interference of Majorana fermion currents. However, it is not clear if the motion of the various order parameter defects (vortices, domain walls, etc.), to which the Majorana fermions are bound in a TS medium, can be quantum coherent. We show that these obstacles can be overcome using a semiconductor quantum wire network in the vicinity of an s-wave superconductor, by constructing topologically protected two-qubit gates and any arbitrary single-qubit phase gate in a topologically unprotected manner, which can be error corrected using magic-state distillation. Thus our strategy, using a judicious combination of topologically protected and unprotected gate operations, realizes UQC on a quantum wire network with a remarkably high error threshold of 0.14 as compared to 10 -3 to 10 -4 in ordinary unprotected quantum computation.

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...

Quantum computation in semiconductor quantum dots of electron-spin asymmetric anisotropic exchange

International Nuclear Information System (INIS)

Hao Xiang; Zhu Shiqun

2007-01-01

The universal quantum computation is obtained when there exists asymmetric anisotropic exchange between electron spins in coupled semiconductor quantum dots. The asymmetric Heisenberg model can be transformed into the isotropic model through the control of two local unitary rotations for the realization of essential quantum gates. The rotations on each qubit are symmetrical and depend on the strength and orientation of asymmetric exchange. The implementation of the axially symmetric local magnetic fields can assist the construction of quantum logic gates in anisotropic coupled quantum dots. This proposal can efficiently use each physical electron spin as a logical qubit in the universal quantum computation

Challenging the weak cosmic censorship conjecture with charged quantum particles

International Nuclear Information System (INIS)

Richartz, Mauricio; Saa, Alberto

2011-01-01

Motivated by the recent attempts to violate the weak cosmic censorship conjecture for near-extreme black holes, we consider the possibility of overcharging a near-extreme Reissner-Nordstroem black hole by the quantum tunneling of charged particles. We consider the scattering of spin-0 and spin-(1/2) particles by the black hole in a unified framework and obtain analytically, for the first time, the pertinent reflection and transmission coefficients without any small charge approximation. Based on these results, we propose some gedanken experiments that could lead to the violation of the weak cosmic censorship conjecture due to the (classically forbidden) absorption of small energy charged particles by the black hole. As for the case of scattering in Kerr spacetimes, our results demonstrate explicitly that scalar fields are subject to (electrical) superradiance phenomenon, while spin-(1/2) fields are not. Superradiance impose some limitations on the gedanken experiments involving spin-0 fields, favoring, in this way, the mechanisms for creation of a naked singularity by the quantum tunneling of spin-(1/2) charged fermions. We also discuss the implications that vacuum polarization effects and quantum statistics might have on these gedanken experiments. In particular, we show that they are not enough to prevent the absorption of incident small energy particles and, consequently, the formation of a naked singularity.

Quantum computation with Turaev-Viro codes

International Nuclear Information System (INIS)

Koenig, Robert; Kuperberg, Greg; Reichardt, Ben W.

2010-01-01

For a 3-manifold with triangulated boundary, the Turaev-Viro topological invariant can be interpreted as a quantum error-correcting code. The code has local stabilizers, identified by Levin and Wen, on a qudit lattice. Kitaev's toric code arises as a special case. The toric code corresponds to an abelian anyon model, and therefore requires out-of-code operations to obtain universal quantum computation. In contrast, for many categories, such as the Fibonacci category, the Turaev-Viro code realizes a non-abelian anyon model. A universal set of fault-tolerant operations can be implemented by deforming the code with local gates, in order to implement anyon braiding. We identify the anyons in the code space, and present schemes for initialization, computation and measurement. This provides a family of constructions for fault-tolerant quantum computation that are closely related to topological quantum computation, but for which the fault tolerance is implemented in software rather than coming from a physical medium.

Computer assisted design of poly-silicon gated enhancement-mode, lateral double quantum dot devices for quantum computing

Science.gov (United States)

Bishop, Nathaniel; Young, Ralph; Borras Pinilla, Carlos; Stalford, Harold; Nielsen, Erik; Muller, Richard; Rahman, Rajib; Tracy, Lisa; Wendt, Joel; Lilly, Michael; Carroll, Malcolm

2012-02-01

We discuss trade-offs of different double quantum dot and charge sensor lay-outs using computer assisted design (CAD). We use primarily a semi-classical model, augmented with a self-consistent configuration interaction method. Although CAD for quantum dots is difficult due to uncontrolled factors (e.g., disorder), different ideal designs can still be compared. Comparisons of simulation and measured dot characteristics, such as capacitance, show that CAD can agree well with experiment for relevant cases. CAD results comparing several different designs will be discussed including a comparison to measurement results from the same designs. Trade-offs between poly-silicon and metal gate lay-outs will also be discussed. This work was performed, in part, at the Center for Integrated Nanotechnologies, a U.S. DOE, Office of Basic Energy Sciences user facility. The work was supported by the Sandia National Laboratories Directed Research and Development Program. Sandia National Laboratories is a multi-program laboratory managed and operated by Sandia Corporation, a wholly owned subsidiary of Lockheed Martin Corporation, for the U.S. Department of Energy's National Nuclear Security Administration under contract DE-AC04-94AL85000.

Quantum computing with defects in diamond

International Nuclear Information System (INIS)

Jelezko, F.; Gaebel, T.; Popa, I.; Domhan, M.; Wittmann, C.; Wrachtrup, J.

2005-01-01

Full text: Single spins in semiconductors, in particular associated with defect centers, are promising candidates for practical and scalable implementation of quantum computing even at room temperature. Such an implementation may also use the reliable and well known gate constructions from bulk nuclear magnetic resonance (NMR) quantum computing. Progress in development of quantum processor based on defects in diamond will be discussed. By combining optical microscopy, and magnetic resonance techniques, the first quantum logical operations on single spins in a solid are now demonstrated. The system is perspective for room temperature operation because of a weak dependence of decoherence on temperature (author)

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)

Computing Hypergraph Ramsey Numbers by Using Quantum Circuit

OpenAIRE

Qu, Ri; Li, Zong-shang; Wang, Juan; Bao, Yan-ru; Cao, Xiao-chun

2012-01-01

Gaitan and Clark [Phys. Rev. Lett. 108, 010501 (2012)] have recently shown a quantum algorithm for the computation of the Ramsey numbers using adiabatic quantum evolution. We present a quantum algorithm to compute the two-color Ramsey numbers for r-uniform hypergraphs by using the quantum counting circuit.

Quantum computing accelerator I/O : LDRD 52750 final report

International Nuclear Information System (INIS)

Schroeppel, Richard Crabtree; Modine, Normand Arthur; Ganti, Anand; Pierson, Lyndon George; Tigges, Christopher P.

2003-01-01

In a superposition of quantum states, a bit can be in both the states '0' and '1' at the same time. This feature of the quantum bit or qubit has no parallel in classical systems. Currently, quantum computers consisting of 4 to 7 qubits in a 'quantum computing register' have been built. Innovative algorithms suited to quantum computing are now beginning to emerge, applicable to sorting and cryptanalysis, and other applications. A framework for overcoming slightly inaccurate quantum gate interactions and for causing quantum states to survive interactions with surrounding environment is emerging, called quantum error correction. Thus there is the potential for rapid advances in this field. Although quantum information processing can be applied to secure communication links (quantum cryptography) and to crack conventional cryptosystems, the first few computing applications will likely involve a 'quantum computing accelerator' similar to a 'floating point arithmetic accelerator' interfaced to a conventional Von Neumann computer architecture. This research is to develop a roadmap for applying Sandia's capabilities to the solution of some of the problems associated with maintaining quantum information, and with getting data into and out of such a 'quantum computing accelerator'. We propose to focus this work on 'quantum I/O technologies' by applying quantum optics on semiconductor nanostructures to leverage Sandia's expertise in semiconductor microelectronic/photonic fabrication techniques, as well as its expertise in information theory, processing, and algorithms. The work will be guided by understanding of practical requirements of computing and communication architectures. This effort will incorporate ongoing collaboration between 9000, 6000 and 1000 and between junior and senior personnel. Follow-on work to fabricate and evaluate appropriate experimental nano/microstructures will be proposed as a result of this work

Limitations on Transversal Computation through Quantum Homomorphic Encryption

OpenAIRE

Newman, Michael; Shi, Yaoyun

2017-01-01

Transversality is a simple and effective method for implementing quantum computation fault-tolerantly. However, no quantum error-correcting code (QECC) can transversally implement a quantum universal gate set (Eastin and Knill, Phys. Rev. Lett., 102, 110502). Since reversible classical computation is often a dominating part of useful quantum computation, whether or not it can be implemented transversally is an important open problem. We show that, other than a small set of non-additive codes ...

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

Designing, programming, and optimizing a (small) quantum computer

Science.gov (United States)

Svore, Krysta

In 1982, Richard Feynman proposed to use a computer founded on the laws of quantum physics to simulate physical systems. In the more than thirty years since, quantum computers have shown promise to solve problems in number theory, chemistry, and materials science that would otherwise take longer than the lifetime of the universe to solve on an exascale classical machine. The practical realization of a quantum computer requires understanding and manipulating subtle quantum states while experimentally controlling quantum interference. It also requires an end-to-end software architecture for programming, optimizing, and implementing a quantum algorithm on the quantum device hardware. In this talk, we will introduce recent advances in connecting abstract theory to present-day real-world applications through software. We will highlight recent advancement of quantum algorithms and the challenges in ultimately performing a scalable solution on a quantum device.

Quantum computing with trapped ions, atoms and light

International Nuclear Information System (INIS)

Steane, Andrew M.

2001-01-01

We consider experimental issues relevant to quantum computing, and discuss the best way to achieve the essential requirements of reliable quantum memory and gate operations. Nuclear spins in trapped ions or atoms are a very promising candidate for the qubits. We estimate the parameters required to couple atoms using light via cavity QED in order to achieve quantum gates. We briefly comment on recent improvements to the Cirac-Zoller method for coupling trapped ions via their vibrational degree of freedom. Error processes result in a trade-off between quantum gate speed and failure probability. A useful quantum computer does appear to be feasible using a combination of ion trap and optical methods. The best understood method to stabilize a large computer relies on quantum error correction. The essential ideas of this are discussed, and recent estimates of the noise requirements in a quantum computing device are given

The case for biological quantum computer elements

Science.gov (United States)

Baer, Wolfgang; Pizzi, Rita

2009-05-01

An extension to vonNeumann's analysis of quantum theory suggests self-measurement is a fundamental process of Nature. By mapping the quantum computer to the brain architecture we will argue that the cognitive experience results from a measurement of a quantum memory maintained by biological entities. The insight provided by this mapping suggests quantum effects are not restricted to small atomic and nuclear phenomena but are an integral part of our own cognitive experience and further that the architecture of a quantum computer system parallels that of a conscious brain. We will then review the suggestions for biological quantum elements in basic neural structures and address the de-coherence objection by arguing for a self- measurement event model of Nature. We will argue that to first order approximation the universe is composed of isolated self-measurement events which guaranties coherence. Controlled de-coherence is treated as the input/output interactions between quantum elements of a quantum computer and the quantum memory maintained by biological entities cognizant of the quantum calculation results. Lastly we will present stem-cell based neuron experiments conducted by one of us with the aim of demonstrating the occurrence of quantum effects in living neural networks and discuss future research projects intended to reach this objective.

The Third Life of Quantum Logic: Quantum Logic Inspired by Quantum Computing

OpenAIRE

Dunn, J. Michael; Moss, Lawrence S.; Wang, Zhenghan

2013-01-01

We begin by discussing the history of quantum logic, dividing it into three eras or lives. The first life has to do with Birkhoff and von Neumann's algebraic approach in the 1930's. The second life has to do with attempt to understand quantum logic as logic that began in the late 1950's and blossomed in the 1970's. And the third life has to do with recent developments in quantum logic coming from its connections to quantum computation. We discuss our own work connecting quantum logic to quant...

Arbitrated Quantum Signature with Hamiltonian Algorithm Based on Blind Quantum Computation

Science.gov (United States)

Shi, Ronghua; Ding, Wanting; Shi, Jinjing

2018-03-01

A novel arbitrated quantum signature (AQS) scheme is proposed motivated by the Hamiltonian algorithm (HA) and blind quantum computation (BQC). The generation and verification of signature algorithm is designed based on HA, which enables the scheme to rely less on computational complexity. It is unnecessary to recover original messages when verifying signatures since the blind quantum computation is applied, which can improve the simplicity and operability of our scheme. It is proved that the scheme can be deployed securely, and the extended AQS has some extensive applications in E-payment system, E-government, E-business, etc.

Superadiabatic holonomic quantum computation in cavity QED

Science.gov (United States)

Liu, Bao-Jie; Huang, Zhen-Hua; Xue, Zheng-Yuan; Zhang, Xin-Ding

2017-06-01

Adiabatic quantum control is a powerful tool for quantum engineering and a key component in some quantum computation models, where accurate control over the timing of the involved pulses is not needed. However, the adiabatic condition requires that the process be very slow and thus limits its application in quantum computation, where quantum gates are preferred to be fast due to the limited coherent times of the quantum systems. Here, we propose a feasible scheme to implement universal holonomic quantum computation based on non-Abelian geometric phases with superadiabatic quantum control, where the adiabatic manipulation is sped up while retaining its robustness against errors in the timing control. Consolidating the advantages of both strategies, our proposal is thus both robust and fast. The cavity QED system is adopted as a typical example to illustrate the merits where the proposed scheme can be realized in a tripod configuration by appropriately controlling the pulse shapes and their relative strength. To demonstrate the distinct performance of our proposal, we also compare our scheme with the conventional adiabatic strategy.

Scaling of the Coulomb Energy Due to Quantum Fluctuations in the Charge on a Quantum Dot

DEFF Research Database (Denmark)

Molenkamp, L. W; Flensberg, Karsten; Kemerink, M.

1995-01-01

The charging energy of a quantum dot is measured through the effect of its potential on the conductance of a second dot. This technique allows a measurement of the scaling of the dot's charging energy with the conductance of the tunnel barriers leading to the dot. We find that the charging energy...... scales quadratically with the reflection probability of the barriers. The observed power law agrees with a recent theory....

Building an adiabatic quantum computer simulation in the classroom

Science.gov (United States)

Rodríguez-Laguna, Javier; Santalla, Silvia N.

2018-05-01

We present a didactic introduction to adiabatic quantum computation (AQC) via the explicit construction of a classical simulator of quantum computers. This constitutes a suitable route to introduce several important concepts for advanced undergraduates in physics: quantum many-body systems, quantum phase transitions, disordered systems, spin-glasses, and computational complexity theory.

Quantum State Transmission in a Superconducting Charge Qubit-Atom Hybrid

Science.gov (United States)

Yu, Deshui; Valado, María Martínez; Hufnagel, Christoph; Kwek, Leong Chuan; Amico, Luigi; Dumke, Rainer

2016-01-01

Hybrids consisting of macroscopic superconducting circuits and microscopic components, such as atoms and spins, have the potential of transmitting an arbitrary state between different quantum species, leading to the prospective of high-speed operation and long-time storage of quantum information. Here we propose a novel hybrid structure, where a neutral-atom qubit directly interfaces with a superconducting charge qubit, to implement the qubit-state transmission. The highly-excited Rydberg atom located inside the gate capacitor strongly affects the behavior of Cooper pairs in the box while the atom in the ground state hardly interferes with the superconducting device. In addition, the DC Stark shift of the atomic states significantly depends on the charge-qubit states. By means of the standard spectroscopic techniques and sweeping the gate voltage bias, we show how to transfer an arbitrary quantum state from the superconducting device to the atom and vice versa. PMID:27922087

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

Photonic entanglement as a resource in quantum computation and quantum communication

OpenAIRE

Prevedel, Robert; Aspelmeyer, Markus; Brukner, Caslav; Jennewein, Thomas; Zeilinger, Anton

2008-01-01

Entanglement is an essential resource in current experimental implementations for quantum information processing. We review a class of experiments exploiting photonic entanglement, ranging from one-way quantum computing over quantum communication complexity to long-distance quantum communication. We then propose a set of feasible experiments that will underline the advantages of photonic entanglement for quantum information processing.

Quantum and classical parallelism in parity algorithms for ensemble quantum computers

International Nuclear Information System (INIS)

Stadelhofer, Ralf; Suter, Dieter; Banzhaf, Wolfgang

2005-01-01

The determination of the parity of a string of N binary digits is a well-known problem in classical as well as quantum information processing, which can be formulated as an oracle problem. It has been established that quantum algorithms require at least N/2 oracle calls. We present an algorithm that reaches this lower bound and is also optimal in terms of additional gate operations required. We discuss its application to pure and mixed states. Since it can be applied directly to thermal states, it does not suffer from signal loss associated with pseudo-pure-state preparation. For ensemble quantum computers, the number of oracle calls can be further reduced by a factor 2 k , with k is a member of {{1,2,...,log 2 (N/2}}, provided the signal-to-noise ratio is sufficiently high. This additional speed-up is linked to (classical) parallelism of the ensemble quantum computer. Experimental realizations are demonstrated on a liquid-state NMR quantum computer

Blind quantum computation with identity authentication

Science.gov (United States)

Li, Qin; Li, Zhulin; Chan, Wai Hong; Zhang, Shengyu; Liu, Chengdong

2018-04-01

Blind quantum computation (BQC) allows a client with relatively few quantum resources or poor quantum technologies to delegate his computational problem to a quantum server such that the client's input, output, and algorithm are kept private. However, all existing BQC protocols focus on correctness verification of quantum computation but neglect authentication of participants' identity which probably leads to man-in-the-middle attacks or denial-of-service attacks. In this work, we use quantum identification to overcome such two kinds of attack for BQC, which will be called QI-BQC. We propose two QI-BQC protocols based on a typical single-server BQC protocol and a double-server BQC protocol. The two protocols can ensure both data integrity and mutual identification between participants with the help of a third trusted party (TTP). In addition, an unjammable public channel between a client and a server which is indispensable in previous BQC protocols is unnecessary, although it is required between TTP and each participant at some instant. Furthermore, the method to achieve identity verification in the presented protocols is general and it can be applied to other similar BQC protocols.

Towards a Quantum Computer?

Science.gov (United States)

Bellac, Michel Le

2014-11-01

In everyday life, practically all the information which is processed, exchanged or stored is coded in the form of discrete entities called bits, which take two values only, by convention 0 and 1. With the present technology for computers and optical fibers, bits are carried by electrical currents and electromagnetic waves corresponding to macroscopic fluxes of electrons and photons, and they are stored in memories of various kinds, for example, magnetic memories. Although quantum physics is the basic physics which underlies the operation of a transistor (Chapter 6) or of a laser (Chapter 4), each exchanged or processed bit corresponds to a large number of elementary quantum systems, and its behavior can be described classically due to the strong interaction with the environment (Chapter 9). For about thirty years, physicists have learned to manipulate with great accuracy individual quantum systems: photons, electrons, neutrons, atoms, and so forth, which opens the way to using two-state quantum systems, such as the polarization states of a photon (Chapter 2) or the two energy levels of an atom or an ion (Chapter 4) in order to process, exchange or store information. In § 2.3.2, we used the two polarization states of a photon, vertical (V) and horizontal (H), to represent the values 0 and 1 of a bit and to exchange information. In what follows, it will be convenient to use Dirac's notation (see Appendix A.2.2 for more details), where a vertical polarization state is denoted by |V> or |0> and a horizontal one by |H> or |1>, while a state with arbitrary polarization will be denoted by |ψ>. The polarization states of a photon give one possible realization of a quantum bit, or for short a qubit. Thanks to the properties of quantum physics, quantum computers using qubits, if they ever exist, would outperform classical computers for some specific, but very important, problems. In Sections 8.1 and 8.2, we describe some typical quantum algorithms and, in order to do so

Geometric quantum discord and Berry phase between two charge qubits coupled by a quantum transmission line

International Nuclear Information System (INIS)

Zhu Han-Jie; Zhang Guo-Feng

2014-01-01

Geometric quantum discord (GQD) and Berry phase between two charge qubits coupled by a quantum transmission line are investigated. We show how GQDs evolve and investigate their dependencies on the parameters of the system. We also calculate the energy and the Berry phase and compare them with GQD, finding that there are close connections between them. (general)

General-purpose parallel simulator for quantum computing

International Nuclear Information System (INIS)

Niwa, Jumpei; Matsumoto, Keiji; Imai, Hiroshi

2002-01-01

With current technologies, it seems to be very difficult to implement quantum computers with many qubits. It is therefore of importance to simulate quantum algorithms and circuits on the existing computers. However, for a large-size problem, the simulation often requires more computational power than is available from sequential processing. Therefore, simulation methods for parallel processors are required. We have developed a general-purpose simulator for quantum algorithms/circuits on the parallel computer (Sun Enterprise4500). It can simulate algorithms/circuits with up to 30 qubits. In order to test efficiency of our proposed methods, we have simulated Shor's factorization algorithm and Grover's database search, and we have analyzed robustness of the corresponding quantum circuits in the presence of both decoherence and operational errors. The corresponding results, statistics, and analyses are presented in this paper

Iterated Gate Teleportation and Blind Quantum Computation.

Science.gov (United States)

Pérez-Delgado, Carlos A; Fitzsimons, Joseph F

2015-06-05

Blind quantum computation allows a user to delegate a computation to an untrusted server while keeping the computation hidden. A number of recent works have sought to establish bounds on the communication requirements necessary to implement blind computation, and a bound based on the no-programming theorem of Nielsen and Chuang has emerged as a natural limiting factor. Here we show that this constraint only holds in limited scenarios, and show how to overcome it using a novel method of iterated gate teleportations. This technique enables drastic reductions in the communication required for distributed quantum protocols, extending beyond the blind computation setting. Applied to blind quantum computation, this technique offers significant efficiency improvements, and in some scenarios offers an exponential reduction in communication requirements.

Fabrication of a novel silicon single electron transistor for Si:P quantum computer devices

International Nuclear Information System (INIS)

Angus, S.J.; Smith, C.E.A.; Gauja, E.; Dzurak, A.S.; Clark, R.G.; Snider, G.L.

2004-01-01

Full text: Quantum computation relies on the successful measurement of quantum states. Single electron transistors (SETs) are known to be able to perform fast and sensitive charge measurements of solid state qubits. However, due to their sensitivity, SETs are also very susceptible to random charge fluctuations in a solid-state materials environment. In previous dc transport measurements, silicon-based SETs have demonstrated greater charge stability than A1/A1 2 O 3 SETs. We have designed and fabricated a novel silicon SET architecture for a comparison of the noise characteristics of silicon and aluminium based devices. The silicon SET described here is designed for controllable and reproducible low temperature operation. It is fabricated using a novel dual gate structure on a silicon-on-insulator substrate. A silicon quantum wire is formed in a 100nm thick high-resistivity superficial silicon layer using reactive ion etching. Carriers are induced in the silicon wire by a back gate in the silicon substrate. The tunnel barriers are created electrostatically, using lithographically defined metallic electrodes (∼40nm width). These tunnel barriers surround the surface of the quantum wire, thus producing excellent electrostatic confinement. This architecture provides independent control of tunnel barrier height and island occupancy, thus promising better control of Coulomb blockade oscillations than in previously investigated silicon SETs. The use of a near intrinsic silicon substrate offers compatibility with Si:P qubits in the longer term

Heterotic quantum and classical computing on convergence spaces

Science.gov (United States)

Patten, D. R.; Jakel, D. W.; Irwin, R. J.; Blair, H. A.

2015-05-01

Category-theoretic characterizations of heterotic models of computation, introduced by Stepney et al., combine computational models such as classical/quantum, digital/analog, synchronous/asynchronous, etc. to obtain increased computational power. A highly informative classical/quantum heterotic model of computation is represented by Abramsky's simple sequential imperative quantum programming language which extends the classical simple imperative programming language to encompass quantum computation. The mathematical (denotational) semantics of this classical language serves as a basic foundation upon which formal verification methods can be developed. We present a more comprehensive heterotic classical/quantum model of computation based on heterotic dynamical systems on convergence spaces. Convergence spaces subsume topological spaces but admit finer structure from which, in prior work, we obtained differential calculi in the cartesian closed category of convergence spaces allowing us to define heterotic dynamical systems, given by coupled systems of first order differential equations whose variables are functions from the reals to convergence spaces.

Dynamics of electrically charged extended bodies: classical and quantum systems

International Nuclear Information System (INIS)

Aaberge, T.

1987-01-01

The author present generalizations of classical mechanics and quantum mechanics that make it possible to describe N charged extended bodies.In particular, we are able to write down a set of coupled equations for the system of N bodies plus field. The theory is based on a theory for the description of N charged chemical fluid components

Nonlinear optics quantum computing with circuit QED.

Science.gov (United States)

Adhikari, Prabin; Hafezi, Mohammad; Taylor, J M

2013-02-08

One approach to quantum information processing is to use photons as quantum bits and rely on linear optical elements for most operations. However, some optical nonlinearity is necessary to enable universal quantum computing. Here, we suggest a circuit-QED approach to nonlinear optics quantum computing in the microwave regime, including a deterministic two-photon phase gate. Our specific example uses a hybrid quantum system comprising a LC resonator coupled to a superconducting flux qubit to implement a nonlinear coupling. Compared to the self-Kerr nonlinearity, we find that our approach has improved tolerance to noise in the qubit while maintaining fast operation.

A quantum-dot spin qubit with coherence limited by charge noise and fidelity higher than 99.9%

Science.gov (United States)

Yoneda, Jun; Takeda, Kenta; Otsuka, Tomohiro; Nakajima, Takashi; Delbecq, Matthieu R.; Allison, Giles; Honda, Takumu; Kodera, Tetsuo; Oda, Shunri; Hoshi, Yusuke; Usami, Noritaka; Itoh, Kohei M.; Tarucha, Seigo

2018-02-01

The isolation of qubits from noise sources, such as surrounding nuclear spins and spin-electric susceptibility1-4, has enabled extensions of quantum coherence times in recent pivotal advances towards the concrete implementation of spin-based quantum computation. In fact, the possibility of achieving enhanced quantum coherence has been substantially doubted for nanostructures due to the characteristic high degree of background charge fluctuations5-7. Still, a sizeable spin-electric coupling will be needed in realistic multiple-qubit systems to address single-spin and spin-spin manipulations8-10. Here, we realize a single-electron spin qubit with an isotopically enriched phase coherence time (20 μs)11,12 and fast electrical control speed (up to 30 MHz) mediated by extrinsic spin-electric coupling. Using rapid spin rotations, we reveal that the free-evolution dephasing is caused by charge noise—rather than conventional magnetic noise—as highlighted by a 1/f spectrum extended over seven decades of frequency. The qubit exhibits superior performance with single-qubit gate fidelities exceeding 99.9% on average, offering a promising route to large-scale spin-qubit systems with fault-tolerant controllability.

Quantum picturalism for topological cluster-state computing

International Nuclear Information System (INIS)

Horsman, Clare

2011-01-01

Topological quantum computing (QC) is a way of allowing precise quantum computations to run on noisy and imperfect hardware. One implementation uses surface codes created by forming defects in a highly-entangled cluster state. Such a method of computing is a leading candidate for large-scale QC. However, there has been a lack of sufficiently powerful high-level languages to describe computing in this form without resorting to single-qubit operations, which quickly become prohibitively complex as the system size increases. In this paper, we apply the category-theoretic work of Abramsky and Coecke to the topological cluster-state model of QC to give a high-level graphical language that enables direct translation between quantum processes and physical patterns of measurement in a computer-a 'compiler language'. We give the equivalence between the graphical and topological information flows, and show the applicable rewrite algebra for this computing model. We show that this gives us a native graphical language for the design and analysis of topological quantum algorithms, and finish by discussing the possibilities for automating this process on a large scale.

Towards minimal resources of measurement-based quantum computation

International Nuclear Information System (INIS)

Perdrix, Simon

2007-01-01

We improve the upper bound on the minimal resources required for measurement-only quantum computation (M A Nielsen 2003 Phys. Rev. A 308 96-100; D W Leung 2004 Int. J. Quantum Inform. 2 33; S Perdrix 2005 Int. J. Quantum Inform. 3 219-23). Minimizing the resources required for this model is a key issue for experimental realization of a quantum computer based on projective measurements. This new upper bound also allows one to reply in the negative to the open question presented by Perdrix (2004 Proc. Quantum Communication Measurement and Computing) about the existence of a trade-off between observable and ancillary qubits in measurement-only QC

Two ions coupled to an optical cavity : from an enhanced quantum computer interface towards distributed quantum computing

International Nuclear Information System (INIS)

Casabone, B.

2015-01-01

Distributed quantum computing, an approach to scale up the computational power of quantum computers, requires entanglement between nodes of a quantum network. In our research group, two building blocks of schemes to entangle two ion-based quantum computers using cavity-based quantum interfaces have recently been demonstrated: ion-photon entanglement and ion-photon state mapping. In this thesis work, we extend the first building block in order to entangle two ions located in the same optical cavity. The entanglement generated by this protocol is efficient and heralded, and as it does not rely on the fact that ions interact with the same cavity, our results are a stepping stone towards the efficient generation of entanglement of remote ion-based quantum computers. In the second part of this thesis, we discuss how collective effects can be used to improve the performance of a cavity-based quantum interface. We show that by using two ions in the so-called superradiant state, the coupling strength between the two ions and the optical cavity is effectively increased compared to the single-ion case. As a complementary result, the creation of a state of two ions that exhibits a reduced coupling strength to the optical cavity, i.e., a subradiant state, is shown. Finally, we demonstrate a direct application of the increased coupling strength that the superradiant state exhibits by showing an enhanced version of the ion-photon state mapping process. By using the current setup and a second one that is being assembled, we intend to build a quantum network. The heralded ion-ion entanglement protocol presented in this thesis work will be used to entangle ions located in both setups, an experiment that requires photons generated in both apparatuses to be indistinguishable. Collective effects then can be used to modify the waveform of photons exiting the cavity in order to effect the desired photon indistinguishability. (author) [de

Quantum Computation-Based Image Representation, Processing Operations and Their Applications

Directory of Open Access Journals (Sweden)

Fei Yan

2014-10-01

Full Text Available A flexible representation of quantum images (FRQI was proposed to facilitate the extension of classical (non-quantum-like image processing applications to the quantum computing domain. The representation encodes a quantum image in the form of a normalized state, which captures information about colors and their corresponding positions in the images. Since its conception, a handful of processing transformations have been formulated, among which are the geometric transformations on quantum images (GTQI and the CTQI that are focused on the color information of the images. In addition, extensions and applications of FRQI representation, such as multi-channel representation for quantum images (MCQI, quantum image data searching, watermarking strategies for quantum images, a framework to produce movies on quantum computers and a blueprint for quantum video encryption and decryption have also been suggested. These proposals extend classical-like image and video processing applications to the quantum computing domain and offer a significant speed-up with low computational resources in comparison to performing the same tasks on traditional computing devices. Each of the algorithms and the mathematical foundations for their execution were simulated using classical computing resources, and their results were analyzed alongside other classical computing equivalents. The work presented in this review is intended to serve as the epitome of advances made in FRQI quantum image processing over the past five years and to simulate further interest geared towards the realization of some secure and efficient image and video processing applications on quantum computers.

Blueprint for a microwave trapped-ion quantum computer

DEFF Research Database (Denmark)

Lekitsch, B.; Weidt, S.; Fowler, A. G.

2017-01-01

, are constructed using silicon microfabrication techniques and they are within reach of current technology. To perform the required quantum computations, the modules make use of long-wavelength-radiation based quantum gate technology. To scale this microwave quantum computer architecture to an arbitrary size we...

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.

Fundamentals of universality in one-way quantum computation

International Nuclear Information System (INIS)

Nest, M van den; Duer, W; Miyake, A; Briegel, H J

2007-01-01

In this paper, we build a framework allowing for a systematic investigation of the fundamental issue: 'Which quantum states serve as universal resources for measurement-based (one-way) quantum computation?' We start our study by re-examining what is exactly meant by 'universality' in quantum computation, and what the implications are for universal one-way quantum computation. Given the framework of a measurement-based quantum computer, where quantum information is processed by local operations only, we find that the most general universal one-way quantum computer is one which is capable of accepting arbitrary classical inputs and producing arbitrary quantum outputs-we refer to this property as CQ-universality. We then show that a systematic study of CQ-universality in one-way quantum computation is possible by identifying entanglement features that are required to be present in every universal resource. In particular, we find that a large class of entanglement measures must reach its supremum on every universal resource. These insights are used to identify several families of states as being not universal, such as one-dimensional (1D) cluster states, Greenberger-Horne-Zeilinger (GHZ) states, W states, and ground states of non-critical 1D spin systems. Our criteria are strengthened by considering the efficiency of a quantum computation, and we find that entanglement measures must obey a certain scaling law with the system size for all efficient universal resources. This again leads to examples of non-universal resources, such as, e.g. ground states of critical 1D spin systems. On the other hand, we provide several examples of efficient universal resources, namely graph states corresponding to hexagonal, triangular and Kagome lattices. Finally, we consider the more general notion of encoded CQ-universality, where quantum outputs are allowed to be produced in an encoded form. Again we provide entanglement-based criteria for encoded universality. Moreover, we present a

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.

Continuous-variable quantum computing in optical time-frequency modes using quantum memories.

Science.gov (United States)

Humphreys, Peter C; Kolthammer, W Steven; Nunn, Joshua; Barbieri, Marco; Datta, Animesh; Walmsley, Ian A

2014-09-26

We develop a scheme for time-frequency encoded continuous-variable cluster-state quantum computing using quantum memories. In particular, we propose a method to produce, manipulate, and measure two-dimensional cluster states in a single spatial mode by exploiting the intrinsic time-frequency selectivity of Raman quantum memories. Time-frequency encoding enables the scheme to be extremely compact, requiring a number of memories that are a linear function of only the number of different frequencies in which the computational state is encoded, independent of its temporal duration. We therefore show that quantum memories can be a powerful component for scalable photonic quantum information processing architectures.

Classical and quantum computing with C++ and Java simulations

CERN Document Server

Hardy, Y

2001-01-01

Classical and Quantum computing provides a self-contained, systematic and comprehensive introduction to all the subjects and techniques important in scientific computing. The style and presentation are readily accessible to undergraduates and graduates. A large number of examples, accompanied by complete C++ and Java code wherever possible, cover every topic. Features and benefits: - Comprehensive coverage of the theory with many examples - Topics in classical computing include boolean algebra, gates, circuits, latches, error detection and correction, neural networks, Turing machines, cryptography, genetic algorithms - For the first time, genetic expression programming is presented in a textbook - Topics in quantum computing include mathematical foundations, quantum algorithms, quantum information theory, hardware used in quantum computing This book serves as a textbook for courses in scientific computing and is also very suitable for self-study. Students, professionals and practitioners in computer...

Experimental Blind Quantum Computing for a Classical Client

Science.gov (United States)

Huang, He-Liang; Zhao, Qi; Ma, Xiongfeng; Liu, Chang; Su, Zu-En; Wang, Xi-Lin; Li, Li; Liu, Nai-Le; Sanders, Barry C.; Lu, Chao-Yang; Pan, Jian-Wei

2017-08-01

To date, blind quantum computing demonstrations require clients to have weak quantum devices. Here we implement a proof-of-principle experiment for completely classical clients. Via classically interacting with two quantum servers that share entanglement, the client accomplishes the task of having the number 15 factorized by servers who are denied information about the computation itself. This concealment is accompanied by a verification protocol that tests servers' honesty and correctness. Our demonstration shows the feasibility of completely classical clients and thus is a key milestone towards secure cloud quantum computing.

Experimental Blind Quantum Computing for a Classical Client.

Science.gov (United States)

Huang, He-Liang; Zhao, Qi; Ma, Xiongfeng; Liu, Chang; Su, Zu-En; Wang, Xi-Lin; Li, Li; Liu, Nai-Le; Sanders, Barry C; Lu, Chao-Yang; Pan, Jian-Wei

2017-08-04

To date, blind quantum computing demonstrations require clients to have weak quantum devices. Here we implement a proof-of-principle experiment for completely classical clients. Via classically interacting with two quantum servers that share entanglement, the client accomplishes the task of having the number 15 factorized by servers who are denied information about the computation itself. This concealment is accompanied by a verification protocol that tests servers' honesty and correctness. Our demonstration shows the feasibility of completely classical clients and thus is a key milestone towards secure cloud quantum computing.

Mode locking of electron spin coherences in singly charged quantum dots.

Science.gov (United States)

Greilich, A; Yakovlev, D R; Shabaev, A; Efros, Al L; Yugova, I A; Oulton, R; Stavarache, V; Reuter, D; Wieck, A; Bayer, M

2006-07-21

The fast dephasing of electron spins in an ensemble of quantum dots is detrimental for applications in quantum information processing. We show here that dephasing can be overcome by using a periodic train of light pulses to synchronize the phases of the precessing spins, and we demonstrate this effect in an ensemble of singly charged (In,Ga)As/GaAs quantum dots. This mode locking leads to constructive interference of contributions to Faraday rotation and presents potential applications based on robust quantum coherence within an ensemble of dots.

Transitions in the computational power of thermal states for measurement-based quantum computation

International Nuclear Information System (INIS)

Barrett, Sean D.; Bartlett, Stephen D.; Jennings, David; Doherty, Andrew C.; Rudolph, Terry

2009-01-01

We show that the usefulness of the thermal state of a specific spin-lattice model for measurement-based quantum computing exhibits a transition between two distinct 'phases' - one in which every state is a universal resource for quantum computation, and another in which any local measurement sequence can be simulated efficiently on a classical computer. Remarkably, this transition in computational power does not coincide with any phase transition, classical, or quantum in the underlying spin-lattice model.

Reversible logic synthesis methodologies with application to quantum computing

CERN Document Server

Taha, Saleem Mohammed Ridha

2016-01-01

This book opens the door to a new interesting and ambitious world of reversible and quantum computing research. It presents the state of the art required to travel around that world safely. Top world universities, companies and government institutions  are in a race of developing new methodologies, algorithms and circuits on reversible logic, quantum logic, reversible and quantum computing and nano-technologies. In this book, twelve reversible logic synthesis methodologies are presented for the first time in a single literature with some new proposals. Also, the sequential reversible logic circuitries are discussed for the first time in a book. Reversible logic plays an important role in quantum computing. Any progress in the domain of reversible logic can be directly applied to quantum logic. One of the goals of this book is to show the application of reversible logic in quantum computing. A new implementation of wavelet and multiwavelet transforms using quantum computing is performed for this purpose. Rese...

Instantaneous Non-Local Computation of Low T-Depth Quantum Circuits

DEFF Research Database (Denmark)

Speelman, Florian

2016-01-01

-depth of a quantum circuit, able to perform non-local computation of quantum circuits with a (poly-)logarithmic number of layers of T gates with quasi-polynomial entanglement. Our proofs combine ideas from blind and delegated quantum computation with the garden-hose model, a combinatorial model of communication......Instantaneous non-local quantum computation requires multiple parties to jointly perform a quantum operation, using pre-shared entanglement and a single round of simultaneous communication. We study this task for its close connection to position-based quantum cryptography, but it also has natural...... applications in the context of foundations of quantum physics and in distributed computing. The best known general construction for instantaneous non-local quantum computation requires a pre-shared state which is exponentially large in the number of qubits involved in the operation, while efficient...

Photon echo quantum random access memory integration in a quantum computer

International Nuclear Information System (INIS)

Moiseev, Sergey A; Andrianov, Sergey N

2012-01-01

We have analysed an efficient integration of multi-qubit echo quantum memory (QM) into the quantum computer scheme based on squids, quantum dots or atomic resonant ensembles in a quantum electrodynamics cavity. Here, one atomic ensemble with controllable inhomogeneous broadening is used for the QM node and other nodes characterized by the homogeneously broadened resonant line are used for processing. We have found the optimal conditions for the efficient integration of the multi-qubit QM modified for the analysed scheme, and we have determined the self-temporal modes providing a perfect reversible transfer of the photon qubits between the QM node and arbitrary processing nodes. The obtained results open the way for realization of a full-scale solid state quantum computing based on the efficient multi-qubit QM. (paper)

Stability of Quantum Loops and Exchange Operations in the Construction of Quantum Computation Gates

International Nuclear Information System (INIS)

Bermúdez, D; Delgado, F

2017-01-01

Quantum information and quantum computation is a rapidly emergent field where quantum systems and their applications play a central role. In the gate version of quantum computation, the construction of universal quantum gates to manipulate quantum information is currently an intensive arena for quantum engineering. Specific properties of systems should be able to reproduce such idealized gates imitating the classically inspired computational gates. Recently, for magnetic systems driven by the bipartite Heisenberg-Ising model a universal set of gates has been realized, an alternative easy design for the Boykin set but using the Bell states as grammar. Exact control can be then used to construct specific prescriptions to achieve those gates. Physical parameters impose a challenge in the gate control. This work analyzes, based on the worst case quantum fidelity, the associated instability for the proposed set of gates. An strong performance is found in those gates for the most of quantum states involved. (paper)

Universal Quantum Computing with Arbitrary Continuous-Variable Encoding.

Science.gov (United States)

Lau, Hoi-Kwan; Plenio, Martin B

2016-09-02

Implementing a qubit quantum computer in continuous-variable systems conventionally requires the engineering of specific interactions according to the encoding basis states. In this work, we present a unified formalism to conduct universal quantum computation with a fixed set of operations but arbitrary encoding. By storing a qubit in the parity of two or four qumodes, all computing processes can be implemented by basis state preparations, continuous-variable exponential-swap operations, and swap tests. Our formalism inherits the advantages that the quantum information is decoupled from collective noise, and logical qubits with different encodings can be brought to interact without decoding. We also propose a possible implementation of the required operations by using interactions that are available in a variety of continuous-variable systems. Our work separates the "hardware" problem of engineering quantum-computing-universal interactions, from the "software" problem of designing encodings for specific purposes. The development of quantum computer architecture could hence be simplified.

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 ...

An Early Quantum Computing Proposal

Energy Technology Data Exchange (ETDEWEB)

Lee, Stephen Russell [Los Alamos National Laboratory; Alexander, Francis Joseph [Los Alamos National Laboratory; Barros, Kipton Marcos [Los Alamos National Laboratory; Daniels, Marcus G. [Los Alamos National Laboratory; Gattiker, James R. [Los Alamos National Laboratory; Hamada, Michael Scott [Los Alamos National Laboratory; Howse, James Walter [Los Alamos National Laboratory; Loncaric, Josip [Los Alamos National Laboratory; Pakin, Scott D. [Los Alamos National Laboratory; Somma, Rolando Diego [Los Alamos National Laboratory; Vernon, Louis James [Los Alamos National Laboratory

2016-04-04

The D-Wave 2X is the third generation of quantum processing created by D-Wave. NASA (with Google and USRA) and Lockheed Martin (with USC), both own D-Wave systems. Los Alamos National Laboratory (LANL) purchased a D-Wave 2X in November 2015. The D-Wave 2X processor contains (nominally) 1152 quantum bits (or qubits) and is designed to specifically perform quantum annealing, which is a well-known method for finding a global minimum of an optimization problem. This methodology is based on direct execution of a quantum evolution in experimental quantum hardware. While this can be a powerful method for solving particular kinds of problems, it also means that the D-Wave 2X processor is not a general computing processor and cannot be programmed to perform a wide variety of tasks. It is a highly specialized processor, well beyond what NNSA currently thinks of as an “advanced architecture.”A D-Wave is best described as a quantum optimizer. That is, it uses quantum superposition to find the lowest energy state of a system by repeated doses of power and settling stages. The D-Wave produces multiple solutions to any suitably formulated problem, one of which is the lowest energy state solution (global minimum). Mapping problems onto the D-Wave requires defining an objective function to be minimized and then encoding that function in the Hamiltonian of the D-Wave system. The quantum annealing method is then used to find the lowest energy configuration of the Hamiltonian using the current D-Wave Two, two-level, quantum processor. This is not always an easy thing to do, and the D-Wave Two has significant limitations that restrict problem sizes that can be run and algorithmic choices that can be made. Furthermore, as more people are exploring this technology, it has become clear that it is very difficult to come up with general approaches to optimization that can both utilize the D-Wave and that can do better than highly developed algorithms on conventional computers for

Quantum computation with topological codes from qubit to topological fault-tolerance

CERN Document Server

Fujii, Keisuke

2015-01-01

This book presents a self-consistent review of quantum computation with topological quantum codes. The book covers everything required to understand topological fault-tolerant quantum computation, ranging from the definition of the surface code to topological quantum error correction and topological fault-tolerant operations. The underlying basic concepts and powerful tools, such as universal quantum computation, quantum algorithms, stabilizer formalism, and measurement-based quantum computation, are also introduced in a self-consistent way. The interdisciplinary fields between quantum information and other fields of physics such as condensed matter physics and statistical physics are also explored in terms of the topological quantum codes. This book thus provides the first comprehensive description of the whole picture of topological quantum codes and quantum computation with them.

Distributed quantum computing with single photon sources

International Nuclear Information System (INIS)

Beige, A.; Kwek, L.C.

2005-01-01

Full text: Distributed quantum computing requires the ability to perform nonlocal gate operations between the distant nodes (stationary qubits) of a large network. To achieve this, it has been proposed to interconvert stationary qubits with flying qubits. In contrast to this, we show that distributed quantum computing only requires the ability to encode stationary qubits into flying qubits but not the conversion of flying qubits into stationary qubits. We describe a scheme for the realization of an eventually deterministic controlled phase gate by performing measurements on pairs of flying qubits. Our scheme could be implemented with a linear optics quantum computing setup including sources for the generation of single photons on demand, linear optics elements and photon detectors. In the presence of photon loss and finite detector efficiencies, the scheme could be used to build large cluster states for one way quantum computing with a high fidelity. (author)

Quantum computers in phase space

International Nuclear Information System (INIS)

Miquel, Cesar; Paz, Juan Pablo; Saraceno, Marcos

2002-01-01

We represent both the states and the evolution of a quantum computer in phase space using the discrete Wigner function. We study properties of the phase space representation of quantum algorithms: apart from analyzing important examples, such as the Fourier transform and Grover's search, we examine the conditions for the existence of a direct correspondence between quantum and classical evolutions in phase space. Finally, we describe how to measure directly the Wigner function in a given phase-space point by means of a tomographic method that, itself, can be interpreted as a simple quantum algorithm

Quantum computation and Shor close-quote s factoring algorithm

International Nuclear Information System (INIS)

Ekert, A.; Jozsa, R.

1996-01-01

Current technology is beginning to allow us to manipulate rather than just observe individual quantum phenomena. This opens up the possibility of exploiting quantum effects to perform computations beyond the scope of any classical computer. Recently Peter Shor discovered an efficient algorithm for factoring whole numbers, which uses characteristically quantum effects. The algorithm illustrates the potential power of quantum computation, as there is no known efficient classical method for solving this problem. The authors give an exposition of Shor close-quote s algorithm together with an introduction to quantum computation and complexity theory. They discuss experiments that may contribute to its practical implementation. copyright 1996 The American Physical Society

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

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.

Large-scale simulations of error-prone quantum computation devices

International Nuclear Information System (INIS)

Trieu, Doan Binh

2009-01-01

The theoretical concepts of quantum computation in the idealized and undisturbed case are well understood. However, in practice, all quantum computation devices do suffer from decoherence effects as well as from operational imprecisions. This work assesses the power of error-prone quantum computation devices using large-scale numerical simulations on parallel supercomputers. We present the Juelich Massively Parallel Ideal Quantum Computer Simulator (JUMPIQCS), that simulates a generic quantum computer on gate level. It comprises an error model for decoherence and operational errors. The robustness of various algorithms in the presence of noise has been analyzed. The simulation results show that for large system sizes and long computations it is imperative to actively correct errors by means of quantum error correction. We implemented the 5-, 7-, and 9-qubit quantum error correction codes. Our simulations confirm that using error-prone correction circuits with non-fault-tolerant quantum error correction will always fail, because more errors are introduced than being corrected. Fault-tolerant methods can overcome this problem, provided that the single qubit error rate is below a certain threshold. We incorporated fault-tolerant quantum error correction techniques into JUMPIQCS using Steane's 7-qubit code and determined this threshold numerically. Using the depolarizing channel as the source of decoherence, we find a threshold error rate of (5.2±0.2) x 10 -6 . For Gaussian distributed operational over-rotations the threshold lies at a standard deviation of 0.0431±0.0002. We can conclude that quantum error correction is especially well suited for the correction of operational imprecisions and systematic over-rotations. For realistic simulations of specific quantum computation devices we need to extend the generic model to dynamic simulations, i.e. time-dependent Hamiltonian simulations of realistic hardware models. We focus on today's most advanced technology, i

Quantum Nonlocality and Beyond: Limits from Nonlocal Computation

Science.gov (United States)

Linden, Noah; Popescu, Sandu; Short, Anthony J.; Winter, Andreas

2007-11-01

We address the problem of “nonlocal computation,” in which separated parties must compute a function without any individual learning anything about the inputs. Surprisingly, entanglement provides no benefit over local classical strategies for such tasks, yet stronger nonlocal correlations allow perfect success. This provides intriguing insights into the limits of quantum information processing, the nature of quantum nonlocality, and the differences between quantum and stronger-than-quantum nonlocal correlations.

Demonstration of quantum entanglement between a single electron spin confined to an InAs quantum dot and a photon.

Science.gov (United States)

Schaibley, J R; Burgers, A P; McCracken, G A; Duan, L-M; Berman, P R; Steel, D G; Bracker, A S; Gammon, D; Sham, L J

2013-04-19

The electron spin state of a singly charged semiconductor quantum dot has been shown to form a suitable single qubit for quantum computing architectures with fast gate times. A key challenge in realizing a useful quantum dot quantum computing architecture lies in demonstrating the ability to scale the system to many qubits. In this Letter, we report an all optical experimental demonstration of quantum entanglement between a single electron spin confined to a single charged semiconductor quantum dot and the polarization state of a photon spontaneously emitted from the quantum dot's excited state. We obtain a lower bound on the fidelity of entanglement of 0.59±0.04, which is 84% of the maximum achievable given the timing resolution of available single photon detectors. In future applications, such as measurement-based spin-spin entanglement which does not require sub-nanosecond timing resolution, we estimate that this system would enable near ideal performance. The inferred (usable) entanglement generation rate is 3×10(3) s(-1). This spin-photon entanglement is the first step to a scalable quantum dot quantum computing architecture relying on photon (flying) qubits to mediate entanglement between distant nodes of a quantum dot network.

Arithmetic of quantum entropy function

International Nuclear Information System (INIS)

Sen, Ashoke

2009-01-01

Quantum entropy function is a proposal for computing the entropy associated with the horizon of a black hole in the extremal limit, and is related via AdS/CFT correspondence to the dimension of the Hilbert space in a dual quantum mechanics. We show that in N = 4 supersymmetric string theories, quantum entropy function formalism naturally explains the origin of the subtle differences between the microscopic degeneracies of quarter BPS dyons carrying different torsion, i.e. different arithmetical properties. These arise from additional saddle points in the path integral - whose existence depends on the arithmetical properties of the black hole charges - constructed as freely acting orbifolds of the original AdS 2 x S 2 near horizon geometry. During this analysis we demonstrate that the quantum entropy function is insensitive to the details of the infrared cutoff used in the computation, and the details of the boundary terms added to the action. We also discuss the role of the asymptotic symmetries of AdS 2 in carrying out the path integral in the definition of quantum entropy function. Finally we show that even though quantum entropy function is expected to compute the absolute degeneracy in a given charge and angular momentum sector, it can also be used to compute the index. This can then be compared with the microscopic computation of the index.

Quantum Heterogeneous Computing for Satellite Positioning Optimization

Science.gov (United States)

Bass, G.; Kumar, V.; Dulny, J., III

2016-12-01

Hard optimization problems occur in many fields of academic study and practical situations. We present results in which quantum heterogeneous computing is used to solve a real-world optimization problem: satellite positioning. Optimization problems like this can scale very rapidly with problem size, and become unsolvable with traditional brute-force methods. Typically, such problems have been approximately solved with heuristic approaches; however, these methods can take a long time to calculate and are not guaranteed to find optimal solutions. Quantum computing offers the possibility of producing significant speed-up and improved solution quality. There are now commercially available quantum annealing (QA) devices that are designed to solve difficult optimization problems. These devices have 1000+ quantum bits, but they have significant hardware size and connectivity limitations. We present a novel heterogeneous computing stack that combines QA and classical machine learning and allows the use of QA on problems larger than the quantum hardware could solve in isolation. We begin by analyzing the satellite positioning problem with a heuristic solver, the genetic algorithm. The classical computer's comparatively large available memory can explore the full problem space and converge to a solution relatively close to the true optimum. The QA device can then evolve directly to the optimal solution within this more limited space. Preliminary experiments, using the Quantum Monte Carlo (QMC) algorithm to simulate QA hardware, have produced promising results. Working with problem instances with known global minima, we find a solution within 8% in a matter of seconds, and within 5% in a few minutes. Future studies include replacing QMC with commercially available quantum hardware and exploring more problem sets and model parameters. Our results have important implications for how heterogeneous quantum computing can be used to solve difficult optimization problems in any

Braid group representation on quantum computation

Energy Technology Data Exchange (ETDEWEB)

Aziz, Ryan Kasyfil, E-mail: kasyfilryan@gmail.com [Department of Computational Sciences, Bandung Institute of Technology (Indonesia); Muchtadi-Alamsyah, Intan, E-mail: ntan@math.itb.ac.id [Algebra Research Group, Bandung Institute of Technology (Indonesia)

2015-09-30

There are many studies about topological representation of quantum computation recently. One of diagram representation of quantum computation is by using ZX-Calculus. In this paper we will make a diagrammatical scheme of Dense Coding. We also proved that ZX-Calculus diagram of maximally entangle state satisfies Yang-Baxter Equation and therefore, we can construct a Braid Group representation of set of maximally entangle state.

Charged particle traps II applications

CERN Document Server

Werth, Günther; Major, Fouad G

2009-01-01

This, the second volume of Charged Particle Traps, is devoted to applications, complementing the first volume’s comprehensive treatment of the theory and practice of charged particle traps, their many variants and refinements. In recent years, applications of far reaching importance have emerged ranging from the ultra-precise mass determinations of elementary particles and their antiparticles and short-lived isotopes, to high-resolution Zeeman spectroscopy on multiply-charged ions, to microwave and optical spectroscopy, some involving "forbidden" transitions from metastable states of such high resolution that optical frequency standards are realized by locking lasers to them. Further the potential application of trapped ions to quantum computing is explored, based on the extraordinary quantum state coherence made possible by the particle isolation. Consideration is given to the Paul and Penning traps as potential quantum information processors.

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.

Electrostatics with Computer-Interfaced Charge Sensors

Science.gov (United States)

Morse, Robert A.

2006-01-01

Computer interfaced electrostatic charge sensors allow both qualitative and quantitative measurements of electrostatic charge but are quite sensitive to charges accumulating on modern synthetic materials. They need to be used with care so that students can correctly interpret their measurements. This paper describes the operation of the sensors,…

Optimised resource construction for verifiable quantum computation

International Nuclear Information System (INIS)

Kashefi, Elham; Wallden, Petros

2017-01-01

Recent developments have brought the possibility of achieving scalable quantum networks and quantum devices closer. From the computational point of view these emerging technologies become relevant when they are no longer classically simulatable. Hence a pressing challenge is the construction of practical methods to verify the correctness of the outcome produced by universal or non-universal quantum devices. A promising approach that has been extensively explored is the scheme of verification via encryption through blind quantum computation. We present here a new construction that simplifies the required resources for any such verifiable protocol. We obtain an overhead that is linear in the size of the input (computation), while the security parameter remains independent of the size of the computation and can be made exponentially small (with a small extra cost). Furthermore our construction is generic and could be applied to any universal or non-universal scheme with a given underlying graph. (paper)

Manipulating quantum coherence of charge states in interacting double-dot Aharonov–Bohm interferometers

Science.gov (United States)

Jin, Jinshuang; Wang, Shikuan; Zhou, Jiahuan; Zhang, Wei-Min; Yan, YiJing

2018-04-01

We investigate the dynamics of charge-state coherence in a degenerate double-dot Aharonov–Bohm interferometer with finite inter-dot Coulomb interactions. The quantum coherence of the charge states is found to be sensitive to the transport setup configurations, involving both the single-electron impurity channels and the Coulomb-assisted ones. We numerically demonstrate the emergence of a complete coherence between the two charge states, with the relative phase being continuously controllable through the magnetic flux. Interestingly, a fully coherent charge qubit arises at the double-dots electron pair tunneling resonance condition, where the chemical potential of one electrode is tuned at the center between a single-electron impurity channel and the related Coulomb-assisted channel. This pure quantum state of charge qubit could be experimentally realized at the current–voltage characteristic turnover position, where differential conductance sign changes. We further elaborate the underlying mechanism for both the real-time and the stationary charge-states coherence in the double-dot systems of study.

Experimental realization of quantum cheque using a five-qubit quantum computer

Science.gov (United States)

Behera, Bikash K.; Banerjee, Anindita; Panigrahi, Prasanta K.

2017-12-01

Quantum cheques could be a forgery-free way to make transaction in a quantum networked banking system with perfect security against any no-signalling adversary. Here, we demonstrate the implementation of quantum cheque, proposed by Moulick and Panigrahi (Quantum Inf Process 15:2475-2486, 2016), using the five-qubit IBM quantum computer. Appropriate single qubit, CNOT and Fredkin gates are used in an optimized configuration. The accuracy of implementation is checked and verified through quantum state tomography by comparing results from the theoretical and experimental density matrices.

Type II Quantum Computing With Superconductors

National Research Council Canada - National Science Library

Orlando, Terry

2004-01-01

... for adiabatic quantum computing using these qubits. The major experimental results on single superconducting persistent current qubits have been the observation of the quantum energy level crossings in niobium qubits, and the microwave measurements...

Controlled high-fidelity navigation in the charge stability diagram of a double quantum dot

International Nuclear Information System (INIS)

Coden, Diego S Acosta; Romero, Rodolfo H; Räsänen, Esa

2015-01-01

We propose an efficient control protocol for charge transfer in a double quantum dot. We consider numerically a two-dimensional model system, where the quantum dots are subjected to time-dependent electric fields corresponding to experimental gate voltages. Our protocol enables navigation in the charge stability diagram from a state to another through controllable variation of the fields. We show that the well-known adiabatic Landau–Zener transition—when supplemented with a time-dependent field tailored with optimal control theory—can remarkably improve the transition speed. The results also lead to a simple control scheme obtained from the experimental charge stability diagram that requires only a single parameter. Eventually, we can achieve the ultrafast performance of the composite pulse protocol that allows the system to be driven at the quantum speed limit. (paper)

The limits of quantum computers

International Nuclear Information System (INIS)

Aaronson, S.

2008-01-01

Future computers, which work with quantum bits, would indeed solve some special problems extremely fastly, but for the most problems the would hardly be superior to contemporary computers. This knowledge could manifest a new fundamental physical principle

Full quantum treatment of charge dynamics in amorphous molecular semiconductors

Science.gov (United States)

de Vries, Xander; Friederich, Pascal; Wenzel, Wolfgang; Coehoorn, Reinder; Bobbert, Peter A.

2018-02-01

We present a treatment of charge dynamics in amorphous molecular semiconductors that accounts for the coupling of charges to all intramolecular phonon modes in a fully quantum mechanical way. Based on ab initio calculations, we derive charge transfer rates that improve on the widely used semiclassical Marcus rate and obtain benchmark results for the mobility and energetic relaxation of electrons and holes in three semiconductors commonly applied in organic light-emitting diodes. Surprisingly, we find very similar results when using the simple Miller-Abrahams rate. We conclude that extracting the disorder strength from temperature-dependent charge transport studies is very possible but extracting the reorganization energy is not.

Self-correcting quantum computers

International Nuclear Information System (INIS)

Bombin, H; Chhajlany, R W; Horodecki, M; Martin-Delgado, M A

2013-01-01

Is the notion of a quantum computer (QC) resilient to thermal noise unphysical? We address this question from a constructive perspective and show that local quantum Hamiltonian models provide self-correcting QCs. To this end, we first give a sufficient condition on the connectedness of excitations for a stabilizer code model to be a self-correcting quantum memory. We then study the two main examples of topological stabilizer codes in arbitrary dimensions and establish their self-correcting capabilities. Also, we address the transversality properties of topological color codes, showing that six-dimensional color codes provide a self-correcting model that allows the transversal and local implementation of a universal set of operations in seven spatial dimensions. Finally, we give a procedure for initializing such quantum memories at finite temperature. (paper)

Concatenated codes for fault tolerant quantum computing

Energy Technology Data Exchange (ETDEWEB)

Knill, E.; Laflamme, R.; Zurek, W.

1995-05-01

The application of concatenated codes to fault tolerant quantum computing is discussed. We have previously shown that for quantum memories and quantum communication, a state can be transmitted with error {epsilon} provided each gate has error at most c{epsilon}. We show how this can be used with Shor`s fault tolerant operations to reduce the accuracy requirements when maintaining states not currently participating in the computation. Viewing Shor`s fault tolerant operations as a method for reducing the error of operations, we give a concatenated implementation which promises to propagate the reduction hierarchically. This has the potential of reducing the accuracy requirements in long computations.

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.

Large-scale simulations of error-prone quantum computation devices

Energy Technology Data Exchange (ETDEWEB)

Trieu, Doan Binh

2009-07-01

The theoretical concepts of quantum computation in the idealized and undisturbed case are well understood. However, in practice, all quantum computation devices do suffer from decoherence effects as well as from operational imprecisions. This work assesses the power of error-prone quantum computation devices using large-scale numerical simulations on parallel supercomputers. We present the Juelich Massively Parallel Ideal Quantum Computer Simulator (JUMPIQCS), that simulates a generic quantum computer on gate level. It comprises an error model for decoherence and operational errors. The robustness of various algorithms in the presence of noise has been analyzed. The simulation results show that for large system sizes and long computations it is imperative to actively correct errors by means of quantum error correction. We implemented the 5-, 7-, and 9-qubit quantum error correction codes. Our simulations confirm that using error-prone correction circuits with non-fault-tolerant quantum error correction will always fail, because more errors are introduced than being corrected. Fault-tolerant methods can overcome this problem, provided that the single qubit error rate is below a certain threshold. We incorporated fault-tolerant quantum error correction techniques into JUMPIQCS using Steane's 7-qubit code and determined this threshold numerically. Using the depolarizing channel as the source of decoherence, we find a threshold error rate of (5.2{+-}0.2) x 10{sup -6}. For Gaussian distributed operational over-rotations the threshold lies at a standard deviation of 0.0431{+-}0.0002. We can conclude that quantum error correction is especially well suited for the correction of operational imprecisions and systematic over-rotations. For realistic simulations of specific quantum computation devices we need to extend the generic model to dynamic simulations, i.e. time-dependent Hamiltonian simulations of realistic hardware models. We focus on today's most advanced

Optimizing qubit resources for quantum chemistry simulations in second quantization on a quantum computer

International Nuclear Information System (INIS)

Moll, Nikolaj; Fuhrer, Andreas; Staar, Peter; Tavernelli, Ivano

2016-01-01

Quantum chemistry simulations on a quantum computer suffer from the overhead needed for encoding the Fermionic problem in a system of qubits. By exploiting the block diagonality of a Fermionic Hamiltonian, we show that the number of required qubits can be reduced while the number of terms in the Hamiltonian will increase. All operations for this reduction can be performed in operator space. The scheme is conceived as a pre-computational step that would be performed prior to the actual quantum simulation. We apply this scheme to reduce the number of qubits necessary to simulate both the Hamiltonian of the two-site Fermi–Hubbard model and the hydrogen molecule. Both quantum systems can then be simulated with a two-qubit quantum computer. Despite the increase in the number of Hamiltonian terms, the scheme still remains a useful tool to reduce the dimensionality of specific quantum systems for quantum simulators with a limited number of resources. (paper)

Noise thresholds for optical quantum computers.

Science.gov (United States)

Dawson, Christopher M; Haselgrove, Henry L; Nielsen, Michael A

2006-01-20

In this Letter we numerically investigate the fault-tolerant threshold for optical cluster-state quantum computing. We allow both photon loss noise and depolarizing noise (as a general proxy for all local noise), and obtain a threshold region of allowed pairs of values for the two types of noise. Roughly speaking, our results show that scalable optical quantum computing is possible for photon loss probabilities <3 x 10(-3), and for depolarization probabilities <10(-4).

Form factors and charge radii in a quantum chromodynamics ...

Indian Academy of Sciences (India)

tic form factors and charge radii of D, Ds,B,Bs and Bc mesons in a quantum chromodynamics. (QCD)-inspired ... as pointed out in [12,13], one can expect a similar success here too. .... 0 were large and the formalism failed to account for large ...

Robust dynamical decoupling for quantum computing and quantum memory.

Science.gov (United States)

Souza, Alexandre M; Alvarez, Gonzalo A; Suter, Dieter

2011-06-17

Dynamical decoupling (DD) is a popular technique for protecting qubits from the environment. However, unless special care is taken, experimental errors in the control pulses used in this technique can destroy the quantum information instead of preserving it. Here, we investigate techniques for making DD sequences robust against different types of experimental errors while retaining good decoupling efficiency in a fluctuating environment. We present experimental data from solid-state nuclear spin qubits and introduce a new DD sequence that is suitable for quantum computing and quantum memory.

On the 'principle of the quantumness', the quantumness of Relativity, and the computational grand-unification

International Nuclear Information System (INIS)

D'Ariano, Giacomo Mauro

2010-01-01

I will argue that the proposal of establishing operational foundations of Quantum Theory should have top-priority, and that the Lucien Hardy's program on Quantum Gravity should be paralleled by an analogous program on Quantum Field Theory (QFT), which needs to be reformulated, notwithstanding its experimental success. In this paper, after reviewing recently suggested operational 'principles of the quantumness', I address the problem on whether Quantum Theory and Special Relativity are unrelated theories, or instead, if the one implies the other. I show how Special Relativity can be indeed derived from causality of Quantum Theory, within the computational paradigm 'the universe is a huge quantum computer', reformulating QFT as a Quantum-Computational Field Theory (QCFT). In QCFT Special Relativity emerges from the fabric of the computational network, which also naturally embeds gauge invariance. In this scheme even the quantization rule and the Planck constant can in principle be derived as emergent from the underlying causal tapestry of space-time. In this way Quantum Theory remains the only theory operating the huge computer of the universe.Is the computational paradigm only a speculative tautology (theory as simulation of reality), or does it have a scientific value? The answer will come from Occam's razor, depending on the mathematical simplicity of QCFT. Here I will just start scratching the surface of QCFT, analyzing simple field theories, including Dirac's. The number of problems and unmotivated recipes that plague QFT strongly motivates us to undertake the QCFT project, since QCFT makes all such problems manifest, and forces a re-foundation of QFT.