Science.gov

Sample records for measurement-based quantum computing

  1. Acausal measurement-based quantum computing

    NASA Astrophysics Data System (ADS)

    Morimae, Tomoyuki

    2014-07-01

    In measurement-based quantum computing, there is a natural "causal cone" among qubits of the resource state, since the measurement angle on a qubit has to depend on previous measurement results in order to correct the effect of by-product operators. If we respect the no-signaling principle, by-product operators cannot be avoided. Here we study the possibility of acausal measurement-based quantum computing by using the process matrix framework [Oreshkov, Costa, and Brukner, Nat. Commun. 3, 1092 (2012), 10.1038/ncomms2076]. We construct a resource process matrix for acausal measurement-based quantum computing restricting local operations to projective measurements. The resource process matrix is an analog of the resource state of the standard causal measurement-based quantum computing. We find that if we restrict local operations to projective measurements the resource process matrix is (up to a normalization factor and trivial ancilla qubits) equivalent to the decorated graph state created from the graph state of the corresponding causal measurement-based quantum computing. We also show that it is possible to consider a causal game whose causal inequality is violated by acausal measurement-based quantum computing.

  2. Blind topological measurement-based quantum computation.

    PubMed

    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.

  3. Measurement-Based and Universal Blind Quantum Computation

    NASA Astrophysics Data System (ADS)

    Broadbent, Anne; Fitzsimons, Joseph; Kashefi, Elham

    Measurement-based quantum computation (MBQC) is a novel approach to quantum computation where the notion of measurement is the main driving force of computation. This is in contrast with the more traditional circuit model which is based on unitary operation. We review here the mathematical model underlying MBQC and the first quantum cryptographic protocol designed using the unique features of MBQC.

  4. Hybrid architecture for encoded measurement-based quantum computation

    PubMed Central

    Zwerger, M.; Briegel, H. J.; Dür, W.

    2014-01-01

    We present a hybrid scheme for quantum computation that combines the modular structure of elementary building blocks used in the circuit model with the advantages of a measurement-based approach to quantum computation. We show how to construct optimal resource states of minimal size to implement elementary building blocks for encoded quantum computation in a measurement-based way, including states for error correction and encoded gates. The performance of the scheme is determined by the quality of the resource states, where within the considered error model a threshold of the order of 10% local noise per particle for fault-tolerant quantum computation and quantum communication. PMID:24946906

  5. Closed timelike curves in measurement-based quantum computation

    SciTech Connect

    Dias da Silva, Raphael; Galvao, Ernesto F.; Kashefi, Elham

    2011-01-15

    Many results have been recently obtained regarding the power of hypothetical closed timelike curves (CTCs) in quantum computation. Here we show that the one-way model of measurement-based quantum computation encompasses in a natural way the CTC model proposed by Bennett, Schumacher, and Svetlichny. We identify a class of CTCs in this model that can be simulated deterministically and point to a fundamental limitation of Deutsch's CTC model which leads to predictions conflicting with those of the one-way model.

  6. Fault-tolerant measurement-based quantum computing with continuous-variable cluster states.

    PubMed

    Menicucci, Nicolas C

    2014-03-28

    A long-standing open question about Gaussian continuous-variable cluster states is whether they enable fault-tolerant measurement-based quantum computation. The answer is yes. Initial squeezing in the cluster above a threshold value of 20.5 dB ensures that errors from finite squeezing acting on encoded qubits are below the fault-tolerance threshold of known qubit-based error-correcting codes. By concatenating with one of these codes and using ancilla-based error correction, fault-tolerant measurement-based quantum computation of theoretically indefinite length is possible with finitely squeezed cluster states.

  7. Hierarchy of universal entanglement in 2D measurement-based quantum computation

    NASA Astrophysics Data System (ADS)

    Miller, Jacob; Miyake, Akimasa

    2016-11-01

    Measurement-based quantum computation (MQC) is a paradigm for studying quantum computation using many-body entanglement and single-qubit measurements. Although MQC has inspired wide-ranging discoveries throughout quantum information, our understanding of the general principles underlying MQC seems to be biased by its historical reliance upon the archetypal 2D cluster state. Here we utilise recent advances in the subject of symmetry-protected topological order (SPTO) to introduce a novel MQC resource state, whose physical and computational behaviour differs fundamentally from that of the cluster state. We show that, in sharp contrast to the cluster state, our state enables universal quantum computation using only measurements of single-qubit Pauli X, Y, and Z operators. This novel computational feature is related to the 'genuine' 2D SPTO possessed by our state, and which is absent in the cluster state. Our concrete connection between the latent computational complexity of many-body systems and macroscopic quantum orders may find applications in quantum many-body simulation for benchmarking classically intractable complexity.

  8. Programming Non-Trivial Algorithms in the Measurement Based Quantum Computation Model

    SciTech Connect

    Alsing, Paul; Fanto, Michael; Lott, Capt. Gordon; Tison, Christoper C.

    2014-01-01

    We provide a set of prescriptions for implementing a quantum circuit model algorithm as measurement based quantum computing (MBQC) algorithm1, 2 via a large cluster state. As means of illustration we draw upon our numerical modeling experience to describe a large graph state capable of searching a logical 8 element list (a non-trivial version of Grover's algorithm3 with feedforward). We develop several prescriptions based on analytic evaluation of cluster states and graph state equations which can be generalized into any circuit model operations. Such a resulting cluster state will be able to carry out the desired operation with appropriate measurements and feed forward error correction. We also discuss the physical implementation and the analysis of the principal 3-qubit entangling gate (Toffoli) required for a non-trivial feedforward realization of an 8-element Grover search algorithm.

  9. HiFi-MBQC High Fidelitiy Measurement-Based Quantum Computing using Superconducting Detectors

    DTIC Science & Technology

    2016-04-04

    server. Various blind delegated computations, including one- and two-qubit gates and the Deutsch and Grover quantum algorithms , are demonstrated...we implemented various instances of the quantum algorithm for solving of systems of linear equations. Reference: S. Barz, I. Kassal, M. Ringbauer... quantum computing an algorithm is performed by measurements on highly entangled resource states. Within the EOARD project we could consider measurement

  10. Measurement-based quantum communication

    NASA Astrophysics Data System (ADS)

    Zwerger, M.; Briegel, H. J.; Dür, W.

    2016-03-01

    We review and discuss the potential of using measurement-based elements in quantum communication schemes, where certain tasks are realized with the help of entangled resource states that are processed by measurements. We consider long-range quantum communication based on the transmission of encoded quantum states, where encoding, decoding and syndrome readout are implemented using small-scale resource states. We also discuss entanglement-based schemes and consider measurement-based quantum repeaters. An important element in these schemes is entanglement purification, which can also be implemented in a measurement-based way. We analyze the influence of noise and imperfections in these schemes and show that measurement-based implementation allows for very large error thresholds of the order of 10 % noise per qubit and more. We show how to obtain optimal resource states for different tasks and discuss first experimental realizations of measurement-based quantum error correction using trapped ions and photons.

  11. Translating non-trivial algorithms from the circuit model to the measurement-based quantum computing model

    NASA Astrophysics Data System (ADS)

    Smith, A. Matthew; Alsing, P. M.; Lott, G. E.; Fanto, M. L.

    2015-11-01

    We provide a set of prescriptions for implementing a circuit model algorithm as measurement-based quantum computing algorithm via a large discrete cluster state constructed sequentially, from qubits implemented as single photons. We describe a large optical discrete graph state capable of searching logical 4 and 8 element lists as an example. To do so we have developed several prescriptions based on analytic evaluation of the evolution of discrete cluster states and graph state equations. We describe the cluster state as a sequence of repeated entanglement and measurement steps using a small number of single photons for each step. These prescriptions can be generalized to implement any logical circuit model operation with appropriate single-photon measurements and feed forward error corrections. Such a cluster state is not guaranteed to be optimal (i.e. minimum number of photons, measurements, run time).

  12. Translating non-trivial algorithms from the circuit model to the measurement-based quantum computing model

    NASA Astrophysics Data System (ADS)

    Smith, A. Matthew; Alsing, P. M.; Lott, G. E.; Fanto, M. L.

    2015-06-01

    We provide a set of prescriptions for implementing a circuit model algorithm as measurement-based quantum computing algorithm via a large discrete cluster state constructed sequentially, from qubits implemented as single photons. We describe a large optical discrete graph state capable of searching logical 4 and 8 element lists as an example. To do so we have developed several prescriptions based on analytic evaluation of the evolution of discrete cluster states and graph state equations. We describe the cluster state as a sequence of repeated entanglement and measurement steps using a small number of single photons for each step. These prescriptions can be generalized to implement any logical circuit model operation with appropriate single-photon measurements and feed forward error corrections. Such a cluster state is not guaranteed to be optimal (i.e. minimum number of photons, measurements, run time).

  13. Scalable optical quantum computer

    SciTech Connect

    Manykin, E A; Mel'nichenko, E V

    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)

  14. Blind Quantum Signature with Blind Quantum Computation

    NASA Astrophysics Data System (ADS)

    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.

  15. Blind Quantum Signature with Blind Quantum Computation

    NASA Astrophysics Data System (ADS)

    Li, Wei; Shi, Ronghua; Guo, Ying

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

  16. Quantum computers.

    PubMed

    Ladd, T D; Jelezko, F; Laflamme, R; Nakamura, Y; Monroe, C; O'Brien, J L

    2010-03-04

    Over the past several decades, quantum information science has emerged to seek answers to the question: can we gain some advantage by storing, transmitting and processing information encoded in systems that exhibit unique quantum properties? Today it is understood that the answer is yes, and many research groups around the world are working towards the highly ambitious technological goal of building a quantum computer, which would dramatically improve computational power for particular tasks. A number of physical systems, spanning much of modern physics, are being developed for quantum computation. However, it remains unclear which technology, if any, will ultimately prove successful. Here we describe the latest developments for each of the leading approaches and explain the major challenges for the future.

  17. Quantum Computers

    DTIC Science & Technology

    2010-03-04

    1227–1230 (2009). 31. Olmschenk, S. et al. Quantum teleportation between distant matter qubits. Science 323, 486–489 (2009). 32. Dür, W., Briegel, H...REVIEWS Quantum computers T. D. Ladd1{, F. Jelezko2, R. Laflamme3,4,5, Y. Nakamura6,7, C. Monroe8,9 & J. L. O’Brien10 Over the past several decades... quantum information science has emerged to seek answers to the question: can we gain some advantage by storing, transmitting and processing

  18. Demonstration of blind quantum computing.

    PubMed

    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.

  19. Quantum Computing

    DTIC Science & Technology

    1998-04-01

    information representation and processing technology, although faster than the wheels and gears of the Charles Babbage computation machine, is still in...the same computational complexity class as the Babbage machine, with bits of information represented by entities which obey classical (non-quantum...nuclear double resonances Charles M Bowden and Jonathan P. Dowling Weapons Sciences Directorate, AMSMI-RD-WS-ST Missile Research, Development, and

  20. Continuous-Variable Blind Quantum Computation

    NASA Astrophysics Data System (ADS)

    Morimae, Tomoyuki

    2012-12-01

    Blind quantum computation is a secure delegated quantum computing protocol where Alice, who does not have sufficient quantum technology at her disposal, delegates her 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. Protocols of blind quantum computation have been proposed for several qudit measurement-based computation models, such as the graph state model, the Affleck-Kennedy-Lieb-Tasaki model, and the Raussendorf-Harrington-Goyal topological model. Here, we consider blind quantum computation for the continuous-variable measurement-based model. We show that blind quantum computation is possible for the infinite squeezing case. We also show that the finite squeezing causes no additional problem in the blind setup apart from the one inherent to the continuous-variable measurement-based quantum computation.

  1. Quantum computation for quantum chemistry

    NASA Astrophysics Data System (ADS)

    Aspuru-Guzik, Alan

    2010-03-01

    Numerically exact simulation of quantum systems on classical computers is in general, an intractable computational problem. Computational chemists have made progress in the development of approximate methods to tackle complex chemical problems. The downside of these approximate methods is that their failure for certain important cases such as long-range charge transfer states in the case of traditional density functional theory. In 1982, Richard Feynman suggested that a quantum device should be able to simulate quantum systems (in our case, molecules) exactly using quantum computers in a tractable fashion. Our group has been working in the development of quantum chemistry algorithms for quantum devices. In this talk, I will describe how quantum computers can be employed to carry out numerically exact quantum chemistry and chemical reaction dynamics calculations, as well as molecular properties. Finally, I will describe our recent experimental quantum computation of the energy of the hydrogen molecule using an optical quantum computer.

  2. Quantum walk computation

    SciTech Connect

    Kendon, Viv

    2014-12-04

    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.

  3. Ancilla-driven universal blind quantum computation

    NASA Astrophysics Data System (ADS)

    Sueki, Takahiro; Koshiba, Takeshi; Morimae, Tomoyuki

    2013-06-01

    Blind quantum computation is a new quantum secure protocol, which enables Alice who does not have enough quantum technology to delegate her computation to Bob who has a fully fledged quantum power without revealing her input, output, and algorithm. So far, blind quantum computation has been considered only for the circuit model and the measurement-based model. Here we consider the possibility and the limitation of blind quantum computation in the ancilla-driven model, which is a hybrid of the circuit and the measurement-based models.

  4. Quantum Computer Games: Quantum Minesweeper

    ERIC Educational Resources Information Center

    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…

  5. Quantum robots and quantum computers

    SciTech Connect

    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.

  6. Efficient Universal Blind Quantum Computation

    NASA Astrophysics Data System (ADS)

    Giovannetti, Vittorio; Maccone, Lorenzo; Morimae, Tomoyuki; Rudolph, Terry G.

    2013-12-01

    We give a cheat sensitive protocol for blind universal quantum computation that is efficient in terms of computational and communication resources: it allows one party to perform an arbitrary computation on a second party’s quantum computer without revealing either which computation is performed, or its input and output. The first party’s computational capabilities can be extremely limited: she must only be able to create and measure single-qubit superposition states. The second party is not required to use measurement-based quantum computation. The protocol requires the (optimal) exchange of O(Jlog⁡2(N)) single-qubit states, where J is the computational depth and N is the number of qubits needed for the computation.

  7. Efficient universal blind quantum computation.

    PubMed

    Giovannetti, Vittorio; Maccone, Lorenzo; Morimae, Tomoyuki; Rudolph, Terry G

    2013-12-06

    We give a cheat sensitive protocol for blind universal quantum computation that is efficient in terms of computational and communication resources: it allows one party to perform an arbitrary computation on a second party's quantum computer without revealing either which computation is performed, or its input and output. The first party's computational capabilities can be extremely limited: she must only be able to create and measure single-qubit superposition states. The second party is not required to use measurement-based quantum computation. The protocol requires the (optimal) exchange of O(Jlog2(N)) single-qubit states, where J is the computational depth and N is the number of qubits needed for the computation.

  8. Optimal Blind Quantum Computation

    NASA Astrophysics Data System (ADS)

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

    2013-12-01

    Blind quantum computation allows a client with limited quantum capabilities to interact with a remote quantum computer to perform an arbitrary quantum computation, while keeping the description of that computation hidden from the remote quantum computer. While a number of protocols have been proposed in recent years, little is currently understood about the resources necessary to accomplish the task. Here, we present general techniques for upper and lower bounding the quantum communication necessary to perform blind quantum computation, and use these techniques to establish concrete bounds for common choices of the client’s quantum capabilities. Our results show that the universal blind quantum computation protocol of Broadbent, Fitzsimons, and Kashefi, comes within a factor of (8)/(3) of optimal when the client is restricted to preparing single qubits. However, we describe a generalization of this protocol which requires exponentially less quantum communication when the client has a more sophisticated device.

  9. Measurement-based noiseless linear amplification for quantum communication

    NASA Astrophysics Data System (ADS)

    Chrzanowski, Helen M.; Walk, Nathan; Assad, Syed M.; Janousek, Jiri; Hosseini, Sara; Ralph, Timothy C.; Symul, Thomas; Lam, Ping Koy

    2014-04-01

    Entanglement distillation is an indispensable ingredient in extended quantum communication networks. Distillation protocols are necessarily non-deterministic and require advanced experimental techniques such as noiseless amplification. Recently, it was shown that the benefits of noiseless amplification could be extracted by performing a post-selective filtering of the measurement record to improve the performance of quantum key distribution. We apply this protocol to entanglement degraded by transmission loss of up to the equivalent of 100 km of optical fibre. We measure an effective entangled resource stronger than that achievable by even a maximally entangled resource passively transmitted through the same channel. We also provide a proof-of-principle demonstration of secret key extraction from an otherwise insecure regime. The measurement-based noiseless linear amplifier offers two advantages over its physical counterpart: ease of implementation and near-optimal probability of success. It should provide an effective and versatile tool for a broad class of entanglement-based quantum communication protocols.

  10. Quantum computing and probability.

    PubMed

    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.

  11. Quantum analogue computing.

    PubMed

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

    2010-08-13

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

  12. Derandomizing Quantum Circuits with Measurement-Based Unitary Designs

    NASA Astrophysics Data System (ADS)

    Turner, Peter S.; Markham, Damian

    2016-05-01

    Entangled multipartite states are resources for universal quantum computation, but they can also give rise to ensembles of unitary transformations, a topic usually studied in the context of random quantum circuits. Using several graph state techniques, we show that these resources can "derandomize" circuit results by sampling the same kinds of ensembles quantum mechanically, analogously to a quantum random number generator. Furthermore, we find simple examples that give rise to new ensembles whose statistical moments exactly match those of the uniformly random distribution over all unitaries up to order t , while foregoing adaptive feedforward entirely. Such ensembles—known as t designs—often cannot be distinguished from the "truly" random ensemble, and so they find use in many applications that require this implied notion of pseudorandomness.

  13. Quantum computing with incoherent resources and quantum jumps.

    PubMed

    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.

  14. Measurement-based quantum communication with resource states generated by entanglement purification

    NASA Astrophysics Data System (ADS)

    Wallnöfer, J.; Dür, W.

    2017-01-01

    We investigate measurement-based quantum communication with noisy resource states that are generated by entanglement purification. We consider the transmission of encoded information via noisy quantum channels using a measurement-based implementation of encoding, error correction, and decoding. We show that such an approach offers advantages over direct transmission, gate-based error correction, and measurement-based schemes with direct generation of resource states. We analyze the noise structure of resource states generated by entanglement purification and show that a local error model, i.e., noise acting independently on all qubits of the resource state, is a good approximation in general, and provides an exact description for Greenberger-Horne-Zeilinger states. The latter are resources for a measurement-based implementation of error-correction codes for bit-flip or phase-flip errors. This provides an approach to link the recently found very high thresholds for fault-tolerant measurement-based quantum information processing based on local error models for resource states with error thresholds for gate-based computational models.

  15. Quantum Computing since Democritus

    NASA Astrophysics Data System (ADS)

    Aaronson, Scott

    2013-03-01

    1. Atoms and the void; 2. Sets; 3. Gödel, Turing, and friends; 4. Minds and machines; 5. Paleocomplexity; 6. P, NP, and friends; 7. Randomness; 8. Crypto; 9. Quantum; 10. Quantum computing; 11. Penrose; 12. Decoherence and hidden variables; 13. Proofs; 14. How big are quantum states?; 15. Skepticism of quantum computing; 16. Learning; 17. Interactive proofs and more; 18. Fun with the Anthropic Principle; 19. Free will; 20. Time travel; 21. Cosmology and complexity; 22. Ask me anything.

  16. Dissipative quantum computing with open quantum walks

    SciTech Connect

    Sinayskiy, Ilya; Petruccione, Francesco

    2014-12-04

    An open quantum walk approach to the implementation of a dissipative quantum computing scheme is presented. The formalism is demonstrated for the example of an open quantum walk implementation of a 3 qubit quantum circuit consisting of 10 gates.

  17. Cluster State Quantum Computing

    DTIC Science & Technology

    2012-12-01

    implementation of quantum computation,” Fortschr. Phys. 48, 771 (2000). [Dragoman01] D. Dragoman, “Proposal for a three-qubit teleportation experiment”, Phys...CLUSTER STATE QUANTUM COMPUTING DECEMBER 2012 INTERIM TECHNICAL REPORT APPROVED FOR PUBLIC RELEASE; DISTRIBUTION...From - To) NOV 2010 – OCT 2012 4. TITLE AND SUBTITLE CLUSTER STATE QUANTUM COMPUTING 5a. CONTRACT NUMBER IN-HOUSE 5b. GRANT NUMBER N/A 5c

  18. The Rabi Quantum Computer

    DTIC Science & Technology

    2001-04-01

    example that other students learn to make quantum computers does not quite meet the RQC specification, consider useful in many fields . I also want to...UNCLASSIFIED Defense Technical Information Center Compilation Part Notice ADP010869 TITLE: The Rabi Quantum Computer DISTRIBUTION: Approved for...comprise the compilation report: ADP010865 thru ADP010894 UNCLASSIFIED 5-1 The Rabi Quantum Computer Rudolph A. Krutar Advanced Information Technology’ U.S

  19. Cluster State Quantum Computation

    DTIC Science & Technology

    2014-02-01

    nearest neighbor cluster state has been shown to be a universal resource for MBQC thus we can say our quantum computer is universal. We note that...CLUSTER STATE QUANTUM COMPUTATION FEBRUARY 2014 FINAL TECHNICAL REPORT APPROVED FOR PUBLIC RELEASE; DISTRIBUTION UNLIMITED STINFO COPY AIR FORCE...TITLE AND SUBTITLE CLUSTER STATE QUANTUM COMPUTATION 5a. CONTRACT NUMBER IN-HOUSE 5b. GRANT NUMBER N/A 5c. PROGRAM ELEMENT NUMBER 62788F 6

  20. Measurement-based noiseless linear amplification for quantum communication

    NASA Astrophysics Data System (ADS)

    Chrzanowski, H. M.; Walk, N.; Haw, J. Y.; Thearle, O.; Assad, S. M.; Janousek, J.; Hosseini, S.; Ralph, T. C.; Symul, T.; Lam, P. K.

    2014-11-01

    Entanglement distillation is an indispensable ingredient in extended quantum communication networks. Distillation protocols are necessarily non-deterministic and require non-trivial experimental techniques such as noiseless amplification. We show that noiseless amplification could be achieved by performing a post-selective filtering of measurement outcomes. We termed this protocol measurement-based noiseless linear amplification (MBNLA). We apply this protocol to entanglement that suffers transmission loss of up to the equivalent of 100km of optical fibre and show that it is capable of distilling entanglement to a level stronger than that achievable by transmitting a maximally entangled state through the same channel. We also provide a proof-of-principle demonstration of secret key extraction from an otherwise insecure regime via MBNLA. Compared to its physical counterpart, MBNLA not only is easier in term of implementation, but also allows one to achieve near optimal probability of success.

  1. Quantum Analog Computing

    NASA Technical Reports Server (NTRS)

    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.

  2. Quantum Computational Cryptography

    NASA Astrophysics Data System (ADS)

    Kawachi, Akinori; Koshiba, Takeshi

    As computational approaches to classical cryptography have succeeded in the establishment of the foundation of the network security, computational approaches even to quantum cryptography are promising, since quantum computational cryptography could offer richer applications than the quantum key distribution. Our project focused especially on the quantum one-wayness and quantum public-key cryptosystems. The one-wayness of functions (or permutations) is one of the most important notions in computational cryptography. First, we give an algorithmic characterization of quantum one-way permutations. In other words, we show a necessary and sufficient condition for quantum one-way permutations in terms of reflection operators. Second, we introduce a problem of distinguishing between two quantum states as a new underlying problem that is harder to solve than the graph automorphism problem. The new problem is a natural generalization of the distinguishability problem between two probability distributions, which are commonly used in computational cryptography. We show that the problem has several cryptographic properties and they enable us to construct a quantum publickey cryptosystem, which is likely to withstand any attack of a quantum adversary.

  3. Quantum Information, Computation and Communication

    NASA Astrophysics Data System (ADS)

    Jones, Jonathan A.; Jaksch, Dieter

    2012-07-01

    Part I. Quantum Information: 1. Quantum bits and quantum gates; 2. An atom in a laser field; 3. Spins in magnetic fields; 4. Photon techniques; 5. Two qubits and beyond; 6. Measurement and entanglement; Part II. Quantum Computation: 7. Principles of quantum computing; 8. Elementary quantum algorithms; 9. More advanced quantum algorithms; 10. Trapped atoms and ions; 11. Nuclear magnetic resonance; 12. Large scale quantum computers; Part III. Quantum Communication: 13. Basics of information theory; 14. Quantum information; 15. Quantum communication; 16. Testing EPR; 17. Quantum cryptography; Appendixes; References; Index.

  4. Quantum computing with trapped ions

    SciTech Connect

    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.

  5. Ion Trap Quantum Computing

    DTIC Science & Technology

    2011-12-01

    an inspiring speech at the MIT Physics of Computation 1st Conference in 1981, Feynman proposed the development of a computer that would obey the...on ion trap based 36 quantum computing for physics and computer science students would include lecture notes, slides, lesson plans, a syllabus...reading lists, videos, demonstrations, and laboratories. 37 LIST OF REFERENCES [1] R. P. Feynman , “Simulating physics with computers,” Int. J

  6. Quantum computing: towards reality

    NASA Astrophysics Data System (ADS)

    Trabesinger, Andreas

    2017-03-01

    The concept of computers that harness the laws of quantum mechanics has transformed our thinking about how information can be processed. Now the environment exists to make prototype devices a reality.

  7. Computational quantum-classical boundary of noisy commuting quantum circuits

    NASA Astrophysics Data System (ADS)

    Fujii, Keisuke; Tamate, Shuhei

    2016-05-01

    It is often said that the transition from quantum to classical worlds is caused by decoherence originated from an interaction between a system of interest and its surrounding environment. Here we establish a computational quantum-classical boundary from the viewpoint of classical simulatability of a quantum system under decoherence. Specifically, we consider commuting quantum circuits being subject to decoherence. Or equivalently, we can regard them as measurement-based quantum computation on decohered weighted graph states. To show intractability of classical simulation in the quantum side, we utilize the postselection argument and crucially strengthen it by taking noise effect into account. Classical simulatability in the classical side is also shown constructively by using both separable criteria in a projected-entangled-pair-state picture and the Gottesman-Knill theorem for mixed state Clifford circuits. We found that when each qubit is subject to a single-qubit complete-positive-trace-preserving noise, the computational quantum-classical boundary is sharply given by the noise rate required for the distillability of a magic state. The obtained quantum-classical boundary of noisy quantum dynamics reveals a complexity landscape of controlled quantum systems. This paves a way to an experimentally feasible verification of quantum mechanics in a high complexity limit beyond classically simulatable region.

  8. Computational quantum-classical boundary of noisy commuting quantum circuits

    PubMed Central

    Fujii, Keisuke; Tamate, Shuhei

    2016-01-01

    It is often said that the transition from quantum to classical worlds is caused by decoherence originated from an interaction between a system of interest and its surrounding environment. Here we establish a computational quantum-classical boundary from the viewpoint of classical simulatability of a quantum system under decoherence. Specifically, we consider commuting quantum circuits being subject to decoherence. Or equivalently, we can regard them as measurement-based quantum computation on decohered weighted graph states. To show intractability of classical simulation in the quantum side, we utilize the postselection argument and crucially strengthen it by taking noise effect into account. Classical simulatability in the classical side is also shown constructively by using both separable criteria in a projected-entangled-pair-state picture and the Gottesman-Knill theorem for mixed state Clifford circuits. We found that when each qubit is subject to a single-qubit complete-positive-trace-preserving noise, the computational quantum-classical boundary is sharply given by the noise rate required for the distillability of a magic state. The obtained quantum-classical boundary of noisy quantum dynamics reveals a complexity landscape of controlled quantum systems. This paves a way to an experimentally feasible verification of quantum mechanics in a high complexity limit beyond classically simulatable region. PMID:27189039

  9. Computational quantum-classical boundary of noisy commuting quantum circuits.

    PubMed

    Fujii, Keisuke; Tamate, Shuhei

    2016-05-18

    It is often said that the transition from quantum to classical worlds is caused by decoherence originated from an interaction between a system of interest and its surrounding environment. Here we establish a computational quantum-classical boundary from the viewpoint of classical simulatability of a quantum system under decoherence. Specifically, we consider commuting quantum circuits being subject to decoherence. Or equivalently, we can regard them as measurement-based quantum computation on decohered weighted graph states. To show intractability of classical simulation in the quantum side, we utilize the postselection argument and crucially strengthen it by taking noise effect into account. Classical simulatability in the classical side is also shown constructively by using both separable criteria in a projected-entangled-pair-state picture and the Gottesman-Knill theorem for mixed state Clifford circuits. We found that when each qubit is subject to a single-qubit complete-positive-trace-preserving noise, the computational quantum-classical boundary is sharply given by the noise rate required for the distillability of a magic state. The obtained quantum-classical boundary of noisy quantum dynamics reveals a complexity landscape of controlled quantum systems. This paves a way to an experimentally feasible verification of quantum mechanics in a high complexity limit beyond classically simulatable region.

  10. Quantum Computational Geodesics

    DTIC Science & Technology

    2010-01-01

    equation, a well-known nonlinear differential matrix equation, and L and iF (L) are Lax pairs (30–32). Some solutions to the geodesic equation...D2J j Dt2 +Rjikl ∂xi ∂t ∂xl ∂t Jk + Cj = 0, (91) the so-called “lifted Jacobi equation” (1). Nielsen and Dowling used the lifted Jacobi equation...quantum circuits (1, 28, 2). 27 6. References 1. Dowling , M. R.; Nielsen, M. A. The Geometry of Quantum Computation. Quantum Information and

  11. REVIEWS OF TOPICAL PROBLEMS: Quantum computers and quantum computations

    NASA Astrophysics Data System (ADS)

    Valiev, Kamil'A.

    2005-01-01

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

  12. Optical quantum computing.

    PubMed

    O'Brien, Jeremy L

    2007-12-07

    In 2001, all-optical quantum computing became feasible with the discovery that scalable quantum computing is possible using only single-photon sources, linear optical elements, and single-photon detectors. Although it was in principle scalable, the massive resource overhead made the scheme practically daunting. However, several simplifications were followed by proof-of-principle demonstrations, and recent approaches based on cluster states or error encoding have dramatically reduced this worrying resource overhead, making an all-optical architecture a serious contender for the ultimate goal of a large-scale quantum computer. Key challenges will be the realization of high-efficiency sources of indistinguishable single photons, low-loss, scalable optical circuits, high-efficiency single-photon detectors, and low-loss interfacing of these components.

  13. Computational quantum chemistry website

    SciTech Connect

    1997-08-22

    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.

  14. Five Measurement Bases Determine Pure Quantum States on Any Dimension.

    PubMed

    Goyeneche, D; Cañas, G; Etcheverry, S; Gómez, E S; Xavier, G B; Lima, G; Delgado, A

    2015-08-28

    A long-standing problem in quantum mechanics is the minimum number of observables required for the characterization of unknown pure quantum states. The solution to this problem is especially important for the developing field of high-dimensional quantum information processing. In this work we demonstrate that any pure d-dimensional state is unambiguously reconstructed by measuring five observables, that is, via projective measurements onto the states of five orthonormal bases. Thus, in our method the total number of different measurement outcomes (5d) scales linearly with d. The state reconstruction is robust against experimental errors and requires simple postprocessing, regardless of d. We experimentally demonstrate the feasibility of our scheme through the reconstruction of eight-dimensional quantum states, encoded in the momentum of single photons.

  15. Abstract quantum computing machines and quantum computational logics

    NASA Astrophysics Data System (ADS)

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

    2016-06-01

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

  16. Undergraduate computational physics projects on quantum computing

    NASA Astrophysics Data System (ADS)

    Candela, D.

    2015-08-01

    Computational projects on quantum computing suitable for students in a junior-level quantum mechanics course are described. In these projects students write their own programs to simulate quantum computers. Knowledge is assumed of introductory quantum mechanics through the properties of spin 1/2. Initial, more easily programmed projects treat the basics of quantum computation, quantum gates, and Grover's quantum search algorithm. These are followed by more advanced projects to increase the number of qubits and implement Shor's quantum factoring algorithm. The projects can be run on a typical laptop or desktop computer, using most programming languages. Supplementing resources available elsewhere, the projects are presented here in a self-contained format especially suitable for a short computational module for physics students.

  17. Measurements-based Moving Target Detection in Quantum Video

    NASA Astrophysics Data System (ADS)

    Yan, Fei; Iliyasu, Abdullah M.; Khan, Asif R.; Yang, Huamin

    2016-04-01

    A method to detect a moving target in multi-channel quantum video is proposed based on multiple measurements on the video strip. The proposed method is capable of detecting the location of the moving target in each frame of the quantum video thereby ensuring that the motion trail of the object is easily and efficiently retrieved. Three experiments, i.e. moving target detection (MTD) of a pixel, MTD of an object in complex shape, and MTD of a pixel whose color is conterminous with that of its background, are implemented to demonstrate the feasibility of the proposal. This study presents a modest attempt to focus on the moving target detection and its applications in quantum video.

  18. Quantum computers: Definition and implementations

    NASA Astrophysics Data System (ADS)

    Pérez-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.

  19. Measurement-based teleportation along quantum spin chains.

    PubMed

    Barjaktarevic, J P; McKenzie, R H; Links, J; Milburn, G J

    2005-12-02

    We examine the teleportation of an unknown spin-1/2 quantum state along a quantum spin chain with an even number of sites. Our protocol, using a sequence of Bell measurements, may be viewed as an iterated version of the 2-qubit protocol of C. H. Bennett et al. [Phys. Rev. Lett. 70, 1895 (1993)]. A decomposition of the Hilbert space of the spin chain into 4 vector spaces, called Bell subspaces, is given. It is established that any state from a Bell subspace may be used as a channel to perform unit fidelity teleportation. The space of all spin-0 many-body states, which includes the ground states of many known antiferromagnetic systems, belongs to a common Bell subspace. A channel-dependent teleportation parameter [symbol: see text] is introduced, and a bound on the teleportation fidelity is given in terms of [symbol: see text].

  20. Layered Architecture for Quantum Computing

    NASA Astrophysics Data System (ADS)

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

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

  1. Quantum Walk Schemes for Universal Quantum Computation

    NASA Astrophysics Data System (ADS)

    Underwood, Michael S.

    Random walks are a powerful tool for the efficient implementation of algorithms in classical computation. Their quantum-mechanical analogues, called quantum walks, hold similar promise. Quantum walks provide a model of quantum computation that has recently been shown to be equivalent in power to the standard circuit model. As in the classical case, quantum walks take place on graphs and can undergo discrete or continuous evolution, though quantum evolution is unitary and therefore deterministic until a measurement is made. This thesis considers the usefulness of continuous-time quantum walks to quantum computation from the perspectives of both their fundamental power under various formulations, and their applicability in practical experiments. In one extant scheme, logical gates are effected by scattering processes. The results of an exhaustive search for single-qubit operations in this model are presented. It is shown that the number of distinct operations increases exponentially with the number of vertices in the scattering graph. A catalogue of all graphs on up to nine vertices that implement single-qubit unitaries at a specific set of momenta is included in an appendix. I develop a novel scheme for universal quantum computation called the discontinuous quantum walk, in which a continuous-time quantum walker takes discrete steps of evolution via perfect quantum state transfer through small 'widget' graphs. The discontinuous quantum-walk scheme requires an exponentially sized graph, as do prior discrete and continuous schemes. To eliminate the inefficient vertex resource requirement, a computation scheme based on multiple discontinuous walkers is presented. In this model, n interacting walkers inhabiting a graph with 2n vertices can implement an arbitrary quantum computation on an input of length n, an exponential savings over previous universal quantum walk schemes. This is the first quantum walk scheme that allows for the application of quantum error correction

  2. Non-Markovianity Measure Based on Brukner–Zeilinger Invariant Information for Unital Quantum Dynamical Maps

    NASA Astrophysics Data System (ADS)

    He, Zhi; Zhu, Lie-Qiang; Li, Li

    2017-03-01

    A non-Markovianity measure based on Brukner–Zeilinger invariant information to characterize non-Markovian effect of open systems undergoing unital dynamical maps is proposed. The method takes advantage of non-increasing property of the Brukner–Zeilinger invariant information under completely positive and trace-preserving unital maps. The simplicity of computing the Brukner–Zeilinger invariant information is the advantage of the proposed measure because of mainly depending on the purity of quantum state. The measure effectively captures the characteristics of non-Markovianity of unital dynamical maps. As some concrete application, we consider two typical non-Markovian noise channels, i.e., the phase damping channel and the random unitary channel to show the sensitivity of the proposed measure. By investigation, we find that the conditions of detecting the non-Markovianity for the phase damping channel are consistent with the results of existing measures for non-Markovianity, i.e., information flow, divisibility and quantum mutual information. However, for the random unitary channel non-Markovian conditions are same to that of the information flow, but is different from that of the divisibility and quantum mutual information. Supported by the National Natural Science Foundation of China under Grant No. 61505053, the Natural Science Foundation of Hunan Province under Grant No. 2015JJ3092, the Research Foundation of Education Bureau of Hunan Province, China under Grant No. 16B177, the School Foundation from the Hunan University of Arts and Science under Grant No. 14ZD01

  3. Quantum computing of semiclassical formulas.

    PubMed

    Georgeot, B; Giraud, O

    2008-04-01

    We show that semiclassical formulas such as the Gutzwiller trace formula can be implemented on a quantum computer more efficiently than on a classical device. We give explicit quantum algorithms which yield quantum observables from classical trajectories, and which alternatively test the semiclassical approximation by computing classical actions from quantum evolution. The gain over classical computation is in general quadratic, and can be larger in some specific cases.

  4. Quantum Computing for Quantum Chemistry

    DTIC Science & Technology

    2010-09-01

    random walks as the decoherence became strong. Recent experiments on photosynthetic light -harvesting complexes observed long-lived excitonic coherences...by the light -harvesting complex. In Environment-assisted quantum walks in energy transfer of photosynthetic complexes, J. Chem. Phys. 129 (2008...a decohered quantum walk. Motivated by the experiments on the Fenna-Matthews-Olson (FMO) light -harvesting complex of green sulfur bacteria, we

  5. Quantum computing on encrypted data

    NASA Astrophysics Data System (ADS)

    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.

  6. Quantum computing on encrypted data.

    PubMed

    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.

  7. Fluxon-controlled quantum computer

    NASA Astrophysics Data System (ADS)

    Fujii, Toshiyuki; Matsuo, Shigemasa; Hatakenaka, Noriyuki

    2016-11-01

    We propose a fluxon-controlled quantum computer incorporated with three-qubit quantum error correction using special gate operations, i.e. joint-phase and SWAP gate operations, inherent in capacitively coupled superconducting flux qubits. The proposed quantum computer acts exactly like a knitting machine at home.

  8. Quantum computing with defects.

    PubMed

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

    2010-05-11

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

  9. Quantum computing: Efficient fault tolerance

    NASA Astrophysics Data System (ADS)

    Gottesman, Daniel

    2016-12-01

    Dealing with errors in a quantum computer typically requires complex programming and many additional quantum bits. A technique for controlling errors has been proposed that alleviates both of these problems.

  10. Measurement-based quantum lattice gas model of fluid dynamics in 2+1 dimensions.

    PubMed

    Micci, Michael M; Yepez, Jeffrey

    2015-09-01

    Presented are quantum simulation results using a measurement-based quantum lattice gas algorithm for Navier-Stokes fluid dynamics in 2+1 dimensions. Numerical prediction of the kinematic viscosity was measured by the decay rate of an initial sinusoidal flow profile. Due to local quantum entanglement in the quantum lattice gas, the minimum kinematic viscosity in the measurement-based quantum lattice gas is lower than achievable in a classical lattice gas. The numerically predicted viscosities precisely match the theoretical predictions obtained with a mean field approximation. Uniform flow profile with double shear layers, on a 16K×8K lattice, leads to the Kelvin-Helmholtz instability, breaking up the shear layer into pairs of counter-rotating vortices that eventually merge via vortex fusion and dissipate because of the nonzero shear viscosity.

  11. Open Quantum Walks and Dissipative Quantum Computing

    NASA Astrophysics Data System (ADS)

    Petruccione, Francesco

    2012-02-01

    Open Quantum Walks (OQWs) have been recently introduced as quantum Markov chains on graphs [S. Attal, F. Petruccione, C. Sabot, and I. Sinayskiy, E-print: http://hal.archives-ouvertes.fr/hal-00581553/fr/]. The formulation of the OQWs is exclusively based upon the non-unitary dynamics induced by the environment. It will be shown that OQWs are a very useful tool for the formulation of dissipative quantum computing and quantum state preparation. In particular, it will be shown how to implement single qubit gates and the CNOT gate as OQWs on fully connected graphs. Also, OQWS make possible the dissipative quantum state preparation of arbitrary single qubit states and of all two-qubit Bell states. Finally, it will be shown how to reformulate efficiently a discrete time version of dissipative quantum computing in the language of OQWs.

  12. Interfacing external quantum devices to a universal quantum computer.

    PubMed

    Lagana, Antonio A; Lohe, Max A; von Smekal, Lorenz

    2011-01-01

    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.

  13. Towards quantum chemistry on a quantum computer.

    PubMed

    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.

  14. Ancilla-driven universal quantum computation

    SciTech Connect

    Anders, Janet; Browne, Dan E.; Oi, Daniel K. L.; Kashefi, Elham; Andersson, Erika

    2010-08-15

    We introduce a model of quantum computation intermediate between the gate-based and measurement-based models. A quantum register is manipulated remotely with the help of a single ancilla that ''drives'' the evolution of the register. The fully controlled ancilla qubit is coupled to the computational register only via a fixed unitary two-qubit interaction and then measured in suitable bases, driving both single- and two-qubit operations on the register. Arbitrary single-qubit operations directly on register qubits are not needed. We characterize all interactions E that induce a unitary, stepwise deterministic measurement back-action on the register sufficient to implement any quantum channel. Our scheme offers experimental advantages for computation, state preparation, and generalized measurements, since no tunable control of the register is required.

  15. Towards Quantum Computing With Light

    NASA Astrophysics Data System (ADS)

    Pysher, Matthew

    This thesis presents experimental progress towards the realization of an optical quantum computer. Quantum computers replace the bits used in classical computing with quantum systems and promise an exponential speedup over their classical counterparts for certain tasks such as integer factoring and the simulation of quantum systems. A recently proposed quantum computing protocol known as one-way quantum computing has paved the way for the use of light in a functional quantum computer. One-way quantum computing calls for the generation of a large (consisting of many subsystems) entangled state known as a cluster state to serve as a quantum register. Entangled states are comprised of subsystems linked in such a way that the state cannot be separated into individual components. A recent proposal has shown that is possible to make arbitrarily large cluster states by linking the resonant frequency modes of a single optical parametric oscillator (OPO). In this thesis, we present two major steps towards the creation of such a cluster state. Namely, we successfully design and test the exotic nonlinear crystal needed in this proposal and use a slight variation on this proposal to simultaneously create over 15 four-mode cluster states in a single OPO. We also explore the possibility of scaling down the physical size of an optical quantum computer by generating squeezed states of light in a compact optical waveguide. Additionally, we investigate photon-number-resolving measurements on continuous quantum light sources, which will be necessary to obtain the desired speedups for a quantum computer over a classical computer.

  16. Quantum Nash Equilibria and Quantum Computing

    NASA Astrophysics Data System (ADS)

    Fellman, Philip Vos; Post, Jonathan Vos

    In 2004, At the Fifth International Conference on Complex Systems, we drew attention to some remarkable findings by researchers at the Santa Fe Institute (Sato, Farmer and Akiyama, 2001) about hitherto unsuspected complexity in the Nash Equilibrium. As we progressed from these findings about heteroclinic Hamiltonians and chaotic transients hidden within the learning patterns of the simple rock-paper-scissors game to some related findings on the theory of quantum computing, one of the arguments we put forward was just as in the late 1990's a number of new Nash equilibria were discovered in simple bi-matrix games (Shubik and Quint, 1996; Von Stengel, 1997, 2000; and McLennan and Park, 1999) we would begin to see new Nash equilibria discovered as the result of quantum computation. While actual quantum computers remain rather primitive (Toibman, 2004), and the theory of quantum computation seems to be advancing perhaps a bit more slowly than originally expected, there have, nonetheless, been a number of advances in computation and some more radical advances in an allied field, quantum game theory (Huberman and Hogg, 2004) which are quite significant. In the course of this paper we will review a few of these discoveries and illustrate some of the characteristics of these new "Quantum Nash Equilibria". The full text of this research can be found at http://necsi.org/events/iccs6/viewpaper.php?id-234

  17. Simulating chemistry using quantum computers.

    PubMed

    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.

  18. Algorithms on ensemble quantum computers.

    PubMed

    Boykin, P Oscar; Mor, Tal; Roychowdhury, Vwani; Vatan, Farrokh

    2010-06-01

    In ensemble (or bulk) quantum computation, all computations are performed on an ensemble of computers rather than on a single computer. Measurements of qubits in an individual computer cannot be performed; instead, only expectation values (over the complete ensemble of computers) can be measured. As a result of this limitation on the model of computation, many algorithms cannot be processed directly on such computers, and must be modified, as the common strategy of delaying the measurements usually does not resolve this ensemble-measurement problem. Here we present several new strategies for resolving this problem. Based on these strategies we provide new versions of some of the most important quantum algorithms, versions that are suitable for implementing on ensemble quantum computers, e.g., on liquid NMR quantum computers. These algorithms are Shor's factorization algorithm, Grover's search algorithm (with several marked items), and an algorithm for quantum fault-tolerant computation. The first two algorithms are simply modified using a randomizing and a sorting strategies. For the last algorithm, we develop a classical-quantum hybrid strategy for removing measurements. We use it to present a novel quantum fault-tolerant scheme. More explicitly, we present schemes for fault-tolerant measurement-free implementation of Toffoli and σ(z)(¼) as these operations cannot be implemented "bitwise", and their standard fault-tolerant implementations require measurement.

  19. Quantum Computing: Solving Complex Problems

    ScienceCinema

    DiVincenzo, David [IBM Watson Research Center

    2016-07-12

    One of the motivating ideas of quantum computation was that there could be a new kind of machine that would solve hard problems in quantum mechanics. There has been significant progress towards the experimental realization of these machines (which I will review), but there are still many questions about how such a machine could solve computational problems of interest in quantum physics. New categorizations of the complexity of computational problems have now been invented to describe quantum simulation. The bad news is that some of these problems are believed to be intractable even on a quantum computer, falling into a quantum analog of the NP class. The good news is that there are many other new classifications of tractability that may apply to several situations of physical interest.

  20. Quasicrystals and Quantum Computing

    NASA Astrophysics Data System (ADS)

    Berezin, Alexander A.

    1997-03-01

    In Quantum (Q) Computing qubits form Q-superpositions for macroscopic times. One scheme for ultra-fast (Q) computing can be based on quasicrystals. Ultrafast processing in Q-coherent structures (and the very existence of durable Q-superpositions) may be 'consequence' of presence of entire manifold of integer arithmetic (A0, aleph-naught of Georg Cantor) at any 4-point of space-time, furthermore, at any point of any multidimensional phase space of (any) N-particle Q-system. The latter, apart from quasicrystals, can include dispersed and/or diluted systems (Berezin, 1994). In such systems such alleged centrepieces of Q-Computing as ability for fast factorization of long integers can be processed by sheer virtue of the fact that entire infinite pattern of prime numbers is instantaneously available as 'free lunch' at any instant/point. Infinitely rich pattern of A0 (including pattern of primes and almost primes) acts as 'independent' physical effect which directly generates Q-dynamics (and physical world) 'out of nothing'. Thus Q-nonlocality can be ultimately based on instantaneous interconnectedness through ever- the-same structure of A0 ('Platonic field' of integers).

  1. Geometric methods in quantum computation

    NASA Astrophysics Data System (ADS)

    Zhang, Jun

    Recent advances in the physical sciences and engineering have created great hopes for new computational paradigms and substrates. One such new approach is the quantum computer, which holds the promise of enhanced computational power. Analogous to the way a classical computer is built from electrical circuits containing wires and logic gates, a quantum computer is built from quantum circuits containing quantum wires and elementary quantum gates to transport and manipulate quantum information. Therefore, design of quantum gates and quantum circuits is a prerequisite for any real application of quantum computation. In this dissertation we apply geometric control methods from differential geometry and Lie group representation theory to analyze the properties of quantum gates and to design optimal quantum circuits. Using the Cartan decomposition and the Weyl group, we show that the geometric structure of nonlocal two-qubit gates is a 3-Torus. After further reducing the symmetry, the geometric representation of nonlocal gates is seen to be conveniently visualized as a tetrahedron. Each point in this tetrahedron except on the base corresponds to a different equivalent class of nonlocal gates. This geometric representation is one of the cornerstones for the discussion on quantum computation in this dissertation. We investigate the properties of those two-qubit operations that can generate maximal entanglement. It is an astonishing finding that if we randomly choose a two-qubit operation, the probability that we obtain a perfect entangler is exactly one half. We prove that given a two-body interaction Hamiltonian, it is always possible to explicitly construct a quantum circuit for exact simulation of any arbitrary nonlocal two-qubit gate by turning on the two-body interaction for at most three times, together with at most four local gates. We also provide an analytic approach to construct a universal quantum circuit from any entangling gate supplemented with local gates

  2. Appearance and Disappearance of Quantum Correlations in Measurement-Based Feedback Control of a Mechanical Oscillator

    NASA Astrophysics Data System (ADS)

    Sudhir, V.; Wilson, D. J.; Schilling, R.; Schütz, H.; Fedorov, S. A.; Ghadimi, A. H.; Nunnenkamp, A.; Kippenberg, T. J.

    2017-01-01

    Quantum correlations between imprecision and backaction are a hallmark of continuous linear measurements. Here, we study how measurement-based feedback can be used to improve the visibility of quantum correlations due to the interaction of a laser field with a nanomechanical oscillator. Backaction imparted by the meter laser, due to radiation-pressure quantum fluctuations, gives rise to correlations between its phase and amplitude quadratures. These quantum correlations are observed in the experiment both as squeezing of the meter field fluctuations below the vacuum level in a homodyne measurement and as sideband asymmetry in a heterodyne measurement, demonstrating the common origin of both phenomena. We show that quantum feedback, i.e., feedback that suppresses measurement backaction, can be used to increase the visibility of the sideband asymmetry ratio. In contrast, by operating the feedback loop in the regime of noise squashing, where the in-loop photocurrent variance is reduced below the vacuum level, the visibility of the sideband asymmetry is reduced. This is due to backaction arising from vacuum noise in the homodyne detector. These experiments demonstrate the possibility, as well as the fundamental limits, of measurement-based feedback as a tool to manipulate quantum correlations.

  3. Quantum Information and Computing

    NASA Astrophysics Data System (ADS)

    Accardi, L.; Ohya, Masanori; Watanabe, N.

    2006-03-01

    Preface -- Coherent quantum control of [symbol]-atoms through the stochastic limit / L. Accardi, S. V. Kozyrev and A. N. Pechen -- Recent advances in quantum white noise calculus / L. Accardi and A. Boukas -- Control of quantum states by decoherence / L. Accardi and K. Imafuku -- Logical operations realized on the Ising chain of N qubits / M. Asano, N. Tateda and C. Ishii -- Joint extension of states of fermion subsystems / H. Araki -- Quantum filtering and optimal feedback control of a Gaussian quantum free particle / S. C. Edwards and V. P. Belavkin -- On existence of quantum zeno dynamics / P. Exner and T. Ichinose -- Invariant subspaces and control of decoherence / P. Facchi, V. L. Lepore and S. Pascazio -- Clauser-Horner inequality for electron counting statistics in multiterminal mesoscopic conductors / L. Faoro, F. Taddei and R. Fazio -- Fidelity of quantum teleportation model using beam splittings / K.-H. Fichtner, T. Miyadera and M. Ohya -- Quantum logical gates realized by beam splittings / W. Freudenberg ... [et al.] -- Information divergence for quantum channels / S. J. Hammersley and V. P. Belavkin -- On the uniqueness theorem in quantum information geometry / H. Hasegawa -- Noncanonical representations of a multi-dimensional Brownian motion / Y. Hibino -- Some of future directions of white noise theory / T. Hida -- Information, innovation and elemental random field / T. Hida -- Generalized quantum turing machine and its application to the SAT chaos algorithm / S. Iriyama, M. Ohya and I. Volovich -- A Stroboscopic approach to quantum tomography / A. Jamiolkowski -- Positive maps and separable states in matrix algebras / A. Kossakowski -- Simulating open quantum systems with trapped ions / S. Maniscalco -- A purification scheme and entanglement distillations / H. Nakazato, M. Unoki and K. Yuasa -- Generalized sectors and adjunctions to control micro-macro transitions / I. Ojima -- Saturation of an entropy bound and quantum Markov states / D. Petz -- An

  4. Insecurity of quantum secure computations

    NASA Astrophysics Data System (ADS)

    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.

  5. Adiabatic graph-state quantum computation

    NASA Astrophysics Data System (ADS)

    Antonio, B.; Markham, D.; Anders, J.

    2014-11-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 \\dot{H} 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.

  6. Qudit quantum computation on matrix product states with global symmetry

    NASA Astrophysics Data System (ADS)

    Wang, Dong-Sheng; Stephen, David T.; Raussendorf, Robert

    2017-03-01

    Resource states that contain nontrivial symmetry-protected topological order are identified for universal single-qudit measurement-based quantum computation. Our resource states fall into two classes: one as the qudit generalizations of the one-dimensional qubit cluster state, and the other as the higher-symmetry generalizations of the spin-1 Affleck-Kennedy-Lieb-Tasaki (AKLT) state, namely, with unitary, orthogonal, or symplectic symmetry. The symmetry in cluster states protects information propagation (identity gate), while the higher symmetry in AKLT-type states enables nontrivial gate computation. This work demonstrates a close connection between measurement-based quantum computation and symmetry-protected topological order.

  7. Cryptography, quantum computation and trapped ions

    SciTech Connect

    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.

  8. Quantum Estimation, meet Computational Statistics; Computational Statistics, meet Quantum Estimation

    NASA Astrophysics Data System (ADS)

    Ferrie, Chris; Granade, Chris; Combes, Joshua

    2013-03-01

    Quantum estimation, that is, post processing data to obtain classical descriptions of quantum states and processes, is an intractable problem--scaling exponentially with the number of interacting systems. Thankfully there is an entire field, Computational Statistics, devoted to designing algorithms to estimate probabilities for seemingly intractable problems. So, why not look to the most advanced machine learning algorithms for quantum estimation tasks? We did. I'll describe how we adapted and combined machine learning methodologies to obtain an online learning algorithm designed to estimate quantum states and processes.

  9. Computational Power of Quantum Machines, Quantum Grammars and Feasible Computation

    NASA Astrophysics Data System (ADS)

    Krishnamurthy, E. V.

    This paper studies the computational power of quantum computers to explore as to whether they can recognize properties which are in nondeterministic polynomial-time class (NP) and beyond. To study the computational power, we use the Feynman's path integral (FPI) formulation of quantum mechanics. From a computational point of view the Feynman's path integral computes a quantum dynamical analogue of the k-ary relation computed by an Alternating Turing machine (ATM) using AND-OR Parallelism. Hence, if we can find a suitable mapping function between an instance of a mathematical problem and the corresponding interference problem, using suitable potential functions for which FPI can be integrated exactly, the computational power of a quantum computer can be bounded to that of an alternating Turing machine that can solve problems in NP (e.g, factorization problem) and in polynomial space. Unfortunately, FPI is exactly integrable only for a few problems (e.g., the harmonic oscillator) involving quadratic potentials; otherwise, they may be only approximately computable or noncomputable. This means we cannot in general solve all quantum dynamical problems exactly except for those special cases of quadratic potentials, e.g., harmonic oscillator. Since there is a one to one correspondence between the quantum mechanical problems that can be analytically solved and the path integrals that can be exactly evaluated, we can say that the noncomputability of FPI implies quantum unsolvability. This is the analogue of classical unsolvability. The Feynman's path graph can be considered as a semantic parse graph for the quantum mechanical sentence. It provides a semantic valuation function of the terminal sentence based on probability amplitudes to disambiguate a given quantum description and obtain an interpretation in a linear time. In Feynman's path integral, the kernels are partially ordered over time (different alternate paths acting concurrently at the same time) and multiplied

  10. Quantum computation using geometric algebra

    NASA Astrophysics Data System (ADS)

    Matzke, Douglas James

    This dissertation reports that arbitrary Boolean logic equations and operators can be represented in geometric algebra as linear equations composed entirely of orthonormal vectors using only addition and multiplication Geometric algebra is a topologically based algebraic system that naturally incorporates the inner and anticommutative outer products into a real valued geometric product, yet does not rely on complex numbers or matrices. A series of custom tools was designed and built to simplify geometric algebra expressions into a standard sum of products form, and automate the anticommutative geometric product and operations. Using this infrastructure, quantum bits (qubits), quantum registers and EPR-bits (ebits) are expressed symmetrically as geometric algebra expressions. Many known quantum computing gates, measurement operators, and especially the Bell/magic operators are also expressed as geometric products. These results demonstrate that geometric algebra can naturally and faithfully represent the central concepts, objects, and operators necessary for quantum computing, and can facilitate the design and construction of quantum computing tools.

  11. Experimental quantum computing without entanglement.

    PubMed

    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.

  12. Quantum chromodynamics with advanced computing

    SciTech Connect

    Kronfeld, Andreas S.; /Fermilab

    2008-07-01

    We survey results in lattice quantum chromodynamics from groups in the USQCD Collaboration. The main focus is on physics, but many aspects of the discussion are aimed at an audience of computational physicists.

  13. Quantum computing measurement and intelligence

    NASA Astrophysics Data System (ADS)

    Ezziane, Zoheir

    One of the grand challenges in the nanoscopic computing era is guarantees of robustness. Robust computing system design is confronted with quantum physical, probabilistic, and even biological phenomena, and guaranteeing high-reliability is much more difficult than ever before. Scaling devices down to the level of single electron operation will bring forth new challenges due to probabilistic effects and uncertainty in guaranteeing "zero-one" based computing. Minuscule devices imply billions of devices on a single chip, which may help mitigate the challenge of uncertainty by replication and redundancy. However, such device densities will create a design and validation nightmare with the sheer scale. The questions that confront computer engineers regarding the current status of nanocomputing material and the reliability of systems built from such minuscule devices are difficult to articulate and answer. This article illustrates and discusses two types of quantum algorithms as follows: (1) a simple quantum algorithm and (2) a quantum search algorithm. This article also presents a review of recent advances in quantum computing and intelligence and presents major achievements and obstacles for researchers in the near future.

  14. Delegating private quantum computations12

    NASA Astrophysics Data System (ADS)

    Broadbent, Anne

    2015-09-01

    We give a protocol for the delegation of quantum computation on encrypted data. More specifically, we show that in a client-server scenario, where the client holds the encryption key for an encrypted quantum register held by the server, it is possible for the server to perform a universal set of quantum gates on the quantum data. All Clifford group gates are non-interactive, while the remaining non-Clifford group gate that we implement (the p/8 gate) requires the client to prepare and send a single random auxiliary qubit (chosen among four possibilities), and exchange classical communication. This construction improves on previous work, which requires either multiple auxiliary qubits or two-way quantum communication. Using a reduction to an entanglement-based protocol, we show privacy against any adversarial server according to a simulation-based security definition.

  15. Quantum-enhanced Sensing and Efficient Quantum Computation

    DTIC Science & Technology

    2015-07-27

    AFRL-AFOSR-UK-TR-2015-0039 Quantum -enhanced sensing and efficient quantum computation Ian Walmsley THE UNIVERSITY OF...COVERED (From - To) 1 February 2013 - 31 January 2015 4. TITLE AND SUBTITLE Quantum -enhanced sensing and efficient quantum computation 5a. CONTRACT...accuracy. The system was used to improve quantum boson sampling tests. 15. SUBJECT TERMS EOARD, Quantum Information Processing, Transition Edge Sensors

  16. A Short Survey on Quantum Computers

    SciTech Connect

    Kanamori, Yoshito; Yoo, Seong-Moo; Pan, W. D.; Sheldon, Frederick T

    2006-01-01

    Quantum computing is an emerging technology. The clock frequency of current computer processor systems may reach about 40 GHz within the next 10 years. By then, one atom may represent one bit. Electrons under such conditions are no longer described by classical physics and a new model of the computer may be necessary by then. The quantum computer is one proposal that may have merit in dealing with the problems associated with the fact that certain important computationally intense problems present that current (classical) computers cannot solve because they require too much processing time. For example, Shor's algorithm performs factoring a large integer in polynomial time while classical factoring algorithms can do it in exponential time. In this paper we briefly survey the current status of quantum computers, quantum computer systems, and quantum simulators. Keywords Classical computers, quantum computers, quantum computer systems, quantum simulators, Shor's algorithm.

  17. Weak measurement-based state estimation of Gaussian states of one-variable quantum systems

    NASA Astrophysics Data System (ADS)

    Das, Debmalya; Arvind

    2017-04-01

    We present a scheme to estimate Gaussian states of one-dimensional continuous variable systems, based on weak (unsharp) quantum measurements. The estimation of a Gaussian state requires us to find position (q), momentum (p) and their second order moments. We measure q weakly and follow it up with a projective measurement of p on half of the ensemble, and on the other half we measure p weakly followed by a projective measurement of q. In each case we use the state twice before discarding it. We compare our results with projective measurements and demonstrate that under certain conditions such weak measurement-based estimation schemes, where recycling of the states is possible, can outperform projective measurement-based state estimation schemes. We establish beyond statistical fluctuations that our method works better for small ensemble sizes.

  18. Atomic physics: A milestone in quantum computing

    NASA Astrophysics Data System (ADS)

    Bartlett, Stephen D.

    2016-08-01

    Quantum computers require many quantum bits to perform complex calculations, but devices with more than a few bits are difficult to program. A device based on five atomic quantum bits shows a way forward. See Letter p.63

  19. Nanophotonic quantum computer based on atomic quantum transistor

    SciTech Connect

    Andrianov, S N; Moiseev, S A

    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)

  20. ASCR Workshop on Quantum Computing for Science

    SciTech Connect

    Aspuru-Guzik, Alan; Van Dam, Wim; Farhi, Edward; Gaitan, Frank; Humble, Travis; Jordan, Stephen; Landahl, Andrew J; Love, Peter; Lucas, Robert; Preskill, John; Muller, Richard P.; Svore, Krysta; Wiebe, Nathan; Williams, Carl

    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.

  1. Course 10: Basic Concepts in Quantum Computation

    NASA Astrophysics Data System (ADS)

    Ekert, A.; Hayden, P. M.; Inamori, H.

    Contents 1 Qubits, gates and networks 2 Quantum arithmetic and function evaluations 3 Algorithms and their complexity 4 From interferometers to computers 5 The first quantum algorithms 6 Quantum search 7 Optimal phase estimation 8 Periodicity and quantum factoring 9 Cryptography 10 Conditional quantum dynamics 11 Decoherence and recoherence 12 Concluding remarks

  2. An Early Quantum Computing Proposal

    SciTech Connect

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

    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

  3. Computational quantum field theory

    NASA Astrophysics Data System (ADS)

    Grobe, Rainer

    2006-05-01

    I will give an overview on recent attempts to solve the time-dependent Dirac equation for the electron-positron field operator. These numerical solutions permit a first temporally and spatially resolved insight into the mechanisms of how an electron-positron pair can be created from vacuum in a very strong force field. This approach has helped to illuminate a wide range of controversial questions. Some of these questions arise for complicated physical situations such as how an electron scatters off a supercritical potential barrier (Klein paradox). This requires the application of quantum field theory to study the combined effect of the pair-production due to the supercriticality of the potential together with the scattering at the barrier involving the Pauli-principle. Other phenomena include Schr"odinger's Zitterbewegung and the localization problem for a relativistic particle. This work has been supported by the NSF and Research Corporation. P. Krekora, K. Cooley, Q. Su and R. Grobe, Phys. Rev. Lett. 95, 070403 (2005). P. Krekora, Q. Su and R. Grobe, Phys. Rev. Lett. 93, 043004 (2004). P. Krekora, Q. Su and R. Grobe, Phys. Rev. Lett. 92, 040406 (2004).

  4. Measurement based controlled not gate for topological qubits in a Majorana fermion and quantum-dot hybrid system

    NASA Astrophysics Data System (ADS)

    Xue, Zheng-Yuan

    2013-04-01

    We propose a scheme to implement controlled not gate for topological qubits in a quantum-dot and Majorana fermion hybrid system. Quantum information is encoded on pairs of Majorana fermions, which live on the the interface between topologically trivial and nontrivial sections of a quantum nanowire deposited on an s-wave superconductor. A measurement based two-qubit controlled not gate is produced with the help of parity measurements assisted by the quantum-dot and followed by prescribed single-qubit gates. The parity measurement, on the quantum-dot and a topological qubit, is achieved by the Aharonov-Casher effect.

  5. Experimental demonstration of blind quantum computing

    NASA Astrophysics Data System (ADS)

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

    2012-02-01

    Quantum computers are among the most promising applications of quantum-enhanced technologies. Quantum effects such as superposition and entanglement enable computational speed-ups that are unattainable using classical computers. The challenges in realising quantum computers suggest that in the near future, only a few facilities worldwide will be capable of operating such devices. In order to exploit these computers, users would seemingly have to give up their privacy. It was recently shown that this is not the case and that, via the universal blind quantum computation protocol, quantum mechanics provides a way to guarantee that the user's data remain private. Here, we demonstrate the first experimental version of this protocol using polarisation-entangled photonic qubits. We demonstrate various blind one- and two-qubit gate operations as well as blind versions of the Deutsch's and Grover's algorithms. When the technology to build quantum computers becomes available, this will become an important privacy-preserving feature of quantum information processing.

  6. Geometry of quantum computation with qutrits.

    PubMed

    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.

  7. Brain Neurons as Quantum Computers:

    NASA Astrophysics Data System (ADS)

    Bershadskii, A.; Dremencov, E.; Bershadskii, J.; Yadid, G.

    The question: whether quantum coherent states can sustain decoherence, heating and dissipation over time scales comparable to the dynamical timescales of brain neurons, has been actively discussed in the last years. A positive answer on this question is crucial, in particular, for consideration of brain neurons as quantum computers. This discussion was mainly based on theoretical arguments. In the present paper nonlinear statistical properties of the Ventral Tegmental Area (VTA) of genetically depressive limbic brain are studied in vivo on the Flinders Sensitive Line of rats (FSL). VTA plays a key role in the generation of pleasure and in the development of psychological drug addiction. We found that the FSL VTA (dopaminergic) neuron signals exhibit multifractal properties for interspike frequencies on the scales where healthy VTA dopaminergic neurons exhibit bursting activity. For high moments the observed multifractal (generalized dimensions) spectrum coincides with the generalized dimensions spectrum calculated for a spectral measure of a quantum system (so-called kicked Harper model, actively used as a model of quantum chaos). This observation can be considered as a first experimental (in vivo) indication in the favor of the quantum (at least partially) nature of brain neurons activity.

  8. Quantum chemistry simulation on quantum computers: theories and experiments.

    PubMed

    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.

  9. Exploiting Locality in Quantum Computation for Quantum Chemistry.

    PubMed

    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.

  10. Holonomic Quantum Computation in Subsystems

    NASA Astrophysics Data System (ADS)

    Oreshkov, Ognyan

    2009-08-01

    We introduce a generalized method of holonomic quantum computation (HQC) based on encoding in subsystems. As an application, we propose a scheme for applying holonomic gates to unencoded qubits by the use of a noisy ancillary qubit. This scheme does not require initialization in a subspace since all dynamical effects factor out as a transformation on the ancilla. We use this approach to show how fault-tolerant HQC can be realized via 2-local Hamiltonians with perturbative gadgets.

  11. Multibit gates for quantum computing.

    PubMed

    Wang, X; Sørensen, A; Mølmer, K

    2001-04-23

    We present a general technique to implement products of many qubit operators communicating via a joint harmonic oscillator degree of freedom in a quantum computer. By conditional displacements and rotations we can implement Hamiltonians which are trigonometric functions of qubit operators. With such operators we can effectively implement higher order gates such as Toffoli gates and C(n)-NOT gates, and we show that the entire Grover search algorithm can be implemented in a direct way.

  12. Toward a superconducting quantum computer. Harnessing macroscopic quantum coherence.

    PubMed

    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.

  13. Quantum Computing and the Onset of Quantum Chaotic Motion

    DTIC Science & Technology

    2007-11-02

    for Nuclear Theory Program on "Chaos and Interactions: from Nuclei to Quantum Dots’", University of Washington, Seattle, USA, 17 July, 2002. I...to Quantum Dots’", University of Washington, Seattle, USA, 17 July, 2002. G. Casati “Quantum computers and quantum chaos” Institute for Nuclear...Theory Program on "Chaos and Interactions: from Nuclei to Quantum Dots’", University of Washington, Seattle, USA, 17 July, 2002. 2. Scientific

  14. Experimental one-way quantum computing.

    PubMed

    Walther, P; Resch, K J; Rudolph, T; Schenck, E; Weinfurter, H; Vedral, V; Aspelmeyer, M; Zeilinger, A

    2005-03-10

    Standard quantum computation is based on sequences of unitary quantum logic gates that process qubits. The one-way quantum computer proposed by Raussendorf and Briegel is entirely different. It has changed our understanding of the requirements for quantum computation and more generally how we think about quantum physics. This new model requires qubits to be initialized in a highly entangled cluster state. From this point, the quantum computation proceeds by a sequence of single-qubit measurements with classical feedforward of their outcomes. Because of the essential role of measurement, a one-way quantum computer is irreversible. In the one-way quantum computer, the order and choices of measurements determine the algorithm computed. We have experimentally realized four-qubit cluster states encoded into the polarization state of four photons. We characterize the quantum state fully by implementing experimental four-qubit quantum state tomography. Using this cluster state, we demonstrate the feasibility of one-way quantum computing through a universal set of one- and two-qubit operations. Finally, our implementation of Grover's search algorithm demonstrates that one-way quantum computation is ideally suited for such tasks.

  15. Computational multiqubit tunnelling in programmable quantum annealers

    PubMed Central

    Boixo, Sergio; Smelyanskiy, Vadim N.; Shabani, Alireza; Isakov, Sergei V.; Dykman, Mark; Denchev, Vasil S.; Amin, Mohammad H.; Smirnov, Anatoly Yu; Mohseni, Masoud; Neven, Hartmut

    2016-01-01

    Quantum tunnelling is a phenomenon in which a quantum state traverses energy barriers higher than the energy of the state itself. Quantum tunnelling has been hypothesized as an advantageous physical resource for optimization in quantum annealing. However, computational multiqubit tunnelling has not yet been observed, and a theory of co-tunnelling under high- and low-frequency noises is lacking. Here we show that 8-qubit tunnelling plays a computational role in a currently available programmable quantum annealer. We devise a probe for tunnelling, a computational primitive where classical paths are trapped in a false minimum. In support of the design of quantum annealers we develop a nonperturbative theory of open quantum dynamics under realistic noise characteristics. This theory accurately predicts the rate of many-body dissipative quantum tunnelling subject to the polaron effect. Furthermore, we experimentally demonstrate that quantum tunnelling outperforms thermal hopping along classical paths for problems with up to 200 qubits containing the computational primitive. PMID:26739797

  16. Universal quantum computation using the discrete-time quantum walk

    SciTech Connect

    Lovett, Neil B.; Cooper, Sally; Everitt, Matthew; Trevers, Matthew; Kendon, Viv

    2010-04-15

    A proof that continuous-time quantum walks are universal for quantum computation, using unweighted graphs of low degree, has recently been presented by A. M. Childs [Phys. Rev. Lett. 102, 180501 (2009)]. We present a version based instead on the discrete-time quantum walk. We show that the discrete-time quantum walk is able to implement the same universal gate set and thus both discrete and continuous-time quantum walks are computational primitives. Additionally, we give a set of components on which the discrete-time quantum walk provides perfect state transfer.

  17. Efficient simulation of open quantum system in duality quantum computing

    NASA Astrophysics Data System (ADS)

    Wei, Shi-Jie; Long, Gui-Lu

    2016-11-01

    Practical quantum systems are open systems due to interactions with their environment. Understanding the evolution of open systems dynamics is important for quantum noise processes , designing quantum error correcting codes, and performing simulations of open quantum systems. Here we proposed an efficient quantum algorithm for simulating the evolution of an open quantum system on a duality quantum computer. In contrast to unitary evolution in a usual quantum computer, the evolution operator in a duality quantum computer is a linear combination of unitary operators. In this duality algorithm, the time evolution of open quantum system is realized by using Kraus operators which is naturally realized in duality quantum computing. Compared to the Lloyd's quantum algorithm [Science.273, 1073(1996)] , the dependence on the dimension of the open quantum system in our algorithm is decreased. Moreover, our algorithm uses a truncated Taylor series of the evolution operators, exponentially improving the performance on the precision compared with existing quantum simulation algorithms with unitary evolution operations.

  18. The Quantum Human Computer (QHC) Hypothesis

    ERIC Educational Resources Information Center

    Salmani-Nodoushan, Mohammad Ali

    2008-01-01

    This article attempts to suggest the existence of a human computer called Quantum Human Computer (QHC) on the basis of an analogy between human beings and computers. To date, there are two types of computers: Binary and Quantum. The former operates on the basis of binary logic where an object is said to exist in either of the two states of 1 and…

  19. Non-unitary probabilistic quantum computing

    NASA Technical Reports Server (NTRS)

    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.

  20. Quantum computing: In the 'death zone'?

    NASA Astrophysics Data System (ADS)

    van Dam, Wim

    2007-04-01

    An event advertised as the first demonstration of a commercial quantum computer raises the question of how far one can go with a 'do not care' attitude towards imperfections, without losing the quantum advantage.

  1. Embracing the quantum limit in silicon computing.

    PubMed

    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.

  2. Adaptive quantum computation in changing environments using projective simulation

    PubMed Central

    Tiersch, M.; Ganahl, E. J.; Briegel, H. J.

    2015-01-01

    Quantum information processing devices need to be robust and stable against external noise and internal imperfections to ensure correct operation. In a setting of measurement-based quantum computation, we explore how an intelligent agent endowed with a projective simulator can act as controller to adapt measurement directions to an external stray field of unknown magnitude in a fixed direction. We assess the agent’s learning behavior in static and time-varying fields and explore composition strategies in the projective simulator to improve the agent’s performance. We demonstrate the applicability by correcting for stray fields in a measurement-based algorithm for Grover’s search. Thereby, we lay out a path for adaptive controllers based on intelligent agents for quantum information tasks. PMID:26260263

  3. Adaptive quantum computation in changing environments using projective simulation.

    PubMed

    Tiersch, M; Ganahl, E J; Briegel, H J

    2015-08-11

    Quantum information processing devices need to be robust and stable against external noise and internal imperfections to ensure correct operation. In a setting of measurement-based quantum computation, we explore how an intelligent agent endowed with a projective simulator can act as controller to adapt measurement directions to an external stray field of unknown magnitude in a fixed direction. We assess the agent's learning behavior in static and time-varying fields and explore composition strategies in the projective simulator to improve the agent's performance. We demonstrate the applicability by correcting for stray fields in a measurement-based algorithm for Grover's search. Thereby, we lay out a path for adaptive controllers based on intelligent agents for quantum information tasks.

  4. Adaptive quantum computation in changing environments using projective simulation

    NASA Astrophysics Data System (ADS)

    Tiersch, M.; Ganahl, E. J.; Briegel, H. J.

    2015-08-01

    Quantum information processing devices need to be robust and stable against external noise and internal imperfections to ensure correct operation. In a setting of measurement-based quantum computation, we explore how an intelligent agent endowed with a projective simulator can act as controller to adapt measurement directions to an external stray field of unknown magnitude in a fixed direction. We assess the agent’s learning behavior in static and time-varying fields and explore composition strategies in the projective simulator to improve the agent’s performance. We demonstrate the applicability by correcting for stray fields in a measurement-based algorithm for Grover’s search. Thereby, we lay out a path for adaptive controllers based on intelligent agents for quantum information tasks.

  5. Contextuality supplies the 'magic' for quantum computation.

    PubMed

    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.

  6. Quantum computing. Defining and detecting quantum speedup.

    PubMed

    Rønnow, Troels F; Wang, Zhihui; Job, Joshua; Boixo, Sergio; Isakov, Sergei V; Wecker, David; Martinis, John M; Lidar, Daniel A; Troyer, Matthias

    2014-07-25

    The development of small-scale quantum devices raises the question of how to fairly assess and detect quantum speedup. Here, we show how to define and measure quantum speedup and how to avoid pitfalls that might mask or fake such a speedup. We illustrate our discussion with data from tests run on a D-Wave Two device with up to 503 qubits. By using random spin glass instances as a benchmark, we found no evidence of quantum speedup when the entire data set is considered and obtained inconclusive results when comparing subsets of instances on an instance-by-instance basis. Our results do not rule out the possibility of speedup for other classes of problems and illustrate the subtle nature of the quantum speedup question.

  7. Prospects for quantum computation with trapped ions

    SciTech Connect

    Hughes, R.J.; James, D.F.V.

    1997-12-31

    Over the past decade information theory has been generalized to allow binary data to be represented by two-state quantum mechanical systems. (A single two-level system has come to be known as a qubit in this context.) The additional freedom introduced into information physics with quantum systems has opened up a variety of capabilities that go well beyond those of conventional information. For example, quantum cryptography allows two parties to generate a secret key even in the presence of eavesdropping. But perhaps the most remarkable capabilities have been predicted in the field of quantum computation. Here, a brief survey of the requirements for quantum computational hardware, and an overview of the in trap quantum computation project at Los Alamos are presented. The physical limitations to quantum computation with trapped ions are discussed.

  8. Some Thoughts Regarding Practical Quantum Computing

    NASA Astrophysics Data System (ADS)

    Ghoshal, Debabrata; Gomez, Richard; Lanzagorta, Marco; Uhlmann, Jeffrey

    2006-03-01

    Quantum computing has become an important area of research in computer science because of its potential to provide more efficient algorithmic solutions to certain problems than are possible with classical computing. The ability of performing parallel operations over an exponentially large computational space has proved to be the main advantage of the quantum computing model. In this regard, we are particularly interested in the potential applications of quantum computers to enhance real software systems of interest to the defense, industrial, scientific and financial communities. However, while much has been written in popular and scientific literature about the benefits of the quantum computational model, several of the problems associated to the practical implementation of real-life complex software systems in quantum computers are often ignored. In this presentation we will argue that practical quantum computation is not as straightforward as commonly advertised, even if the technological problems associated to the manufacturing and engineering of large-scale quantum registers were solved overnight. We will discuss some of the frequently overlooked difficulties that plague quantum computing in the areas of memories, I/O, addressing schemes, compilers, oracles, approximate information copying, logical debugging, error correction and fault-tolerant computing protocols.

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

    PubMed

    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.

  10. Quantum computing with realistically noisy devices.

    PubMed

    Knill, E

    2005-03-03

    In theory, quantum computers offer a means of solving problems that would be intractable on conventional computers. Assuming that a quantum computer could be constructed, it would in practice be required to function with noisy devices called 'gates'. These gates cause decoherence of the fragile quantum states that are central to the computer's operation. The goal of so-called 'fault-tolerant quantum computing' is therefore to compute accurately even when the error probability per gate (EPG) is high. Here we report a simple architecture for fault-tolerant quantum computing, providing evidence that accurate quantum computing is possible for EPGs as high as three per cent. Such EPGs have been experimentally demonstrated, but to avoid excessive resource overheads required by the necessary architecture, lower EPGs are needed. Assuming the availability of quantum resources comparable to the digital resources available in today's computers, we show that non-trivial quantum computations at EPGs of as high as one per cent could be implemented.

  11. Quantum Computer Games: Schrodinger Cat and Hounds

    ERIC Educational Resources Information Center

    Gordon, Michal; Gordon, Goren

    2012-01-01

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

  12. Nonlinear optics quantum computing with circuit QED.

    PubMed

    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.

  13. Quantum and classical dynamics in adiabatic computation

    NASA Astrophysics Data System (ADS)

    Crowley, P. J. D.; Äńurić, T.; Vinci, W.; Warburton, P. A.; Green, A. G.

    2014-10-01

    Adiabatic transport provides a powerful way to manipulate quantum states. By preparing a system in a readily initialized state and then slowly changing its Hamiltonian, one may achieve quantum states that would otherwise be inaccessible. Moreover, a judicious choice of final Hamiltonian whose ground state encodes the solution to a problem allows adiabatic transport to be used for universal quantum computation. However, the dephasing effects of the environment limit the quantum correlations that an open system can support and degrade the power of such adiabatic computation. We quantify this effect by allowing the system to evolve over a restricted set of quantum states, providing a link between physically inspired classical optimization algorithms and quantum adiabatic optimization. This perspective allows us to develop benchmarks to bound the quantum correlations harnessed by an adiabatic computation. We apply these to the D-Wave Vesuvius machine with revealing—though inconclusive—results.

  14. Quantum Computing in a Piece of Glass

    DTIC Science & Technology

    2011-01-01

    enabling technology. Additionally, we give credence to the projection operator approach of Sec. 4 by applying it to a quantum teleportation (QT...computing gates. 5. QUANTUM TELEPORTATION IN GLASS To best illustrate how a quantum algorithm can be encoded within a single hologram we will focus...our attention on quantum teleportation (QT ). This three qubit gate lives in an 8-dimensional state space. It exhibits all the essential features we

  15. Quantum Computation and NP-Complete Problems

    NASA Astrophysics Data System (ADS)

    Nishino, Tetsuro

    In this paper, we show the following two results on the relationships between quantum computers and NP-complete problems. First, we develop a theory of bulk quantum computation such as NMR (Nuclear Magnetic Resonance) quantum computation. For this purpose, we first define bulk quantum Turing machine (BQTM for short) as a model of bulk quantum computation. Then, we show that BQTMs can solve certain instances of NP-complete problems efficiently. Next, we show that the algorithm designed by Abrams and Lloyd can be simulated by a deterministic Turing machine in polynomial space. This suggests that their algorithm, which is based on non-standard quantum mechanics, can be simulated by a standard QTM with exponential time slow down.

  16. Parallel Environment for Quantum Computing

    NASA Astrophysics Data System (ADS)

    Tabakin, Frank; Diaz, Bruno Julia

    2009-03-01

    To facilitate numerical study of noise and decoherence in QC algorithms,and of the efficacy of error correction schemes, we have developed a Fortran 90 quantum computer simulator with parallel processing capabilities. It permits rapid evaluation of quantum algorithms for a large number of qubits and for various ``noise'' scenarios. State vectors are distributed over many processors, to employ a large number of qubits. Parallel processing is implemented by the Message-Passing Interface protocol. A description of how to spread the wave function components over many processors, along with how to efficiently describe the action of general one- and two-qubit operators on these state vectors will be delineated.Grover's search and Shor's factoring algorithms with noise will be discussed as examples. A major feature of this work is that concurrent versions of the algorithms can be evaluated with each version subject to diverse noise effects, corresponding to solving a stochastic Schrodinger equation. The density matrix for the ensemble of such noise cases is constructed using parallel distribution methods to evaluate its associated entropy. Applications of this powerful tool is made to delineate the stability and correction of QC processes using Hamiltonian based dynamics.

  17. Composite nonadiabatic holonomic quantum computation

    NASA Astrophysics Data System (ADS)

    Xu, G. F.; Zhao, P. Z.; Xing, T. H.; Sjöqvist, Erik; Tong, D. M.

    2017-03-01

    Nonadiabatic holonomic quantum computation has a robust feature in suppressing control errors because of its holonomic feature. However, this kind of robust feature is challenged since the usual way of realizing nonadiabatic holonomic gates introduces errors due to systematic errors in the control parameters. To resolve this problem, we here propose a composite scheme to realize nonadiabatic holonomic gates. Our scheme can suppress systematic errors while preserving holonomic robustness. It is particularly useful when the evolution period is shorter than the coherence time. We further show that our composite scheme can be protected by decoherence-free subspaces. In this case, the strengthened robust feature of our composite gates and the coherence stabilization virtue of decoherence-free subspaces are combined.

  18. Verifiable Measurement-Only Blind Quantum Computing with Stabilizer Testing.

    PubMed

    Hayashi, Masahito; Morimae, Tomoyuki

    2015-11-27

    We introduce a simple protocol for verifiable measurement-only blind quantum computing. Alice, a client, can perform only single-qubit measurements, whereas Bob, a server, can generate and store entangled many-qubit states. Bob generates copies of a graph state, which is a universal resource state for measurement-based quantum computing, and sends Alice each qubit of them one by one. Alice adaptively measures each qubit according to her program. If Bob is honest, he generates the correct graph state, and, therefore, Alice can obtain the correct computation result. Regarding the security, whatever Bob does, Bob cannot get any information about Alice's computation because of the no-signaling principle. Furthermore, malicious Bob does not necessarily send the copies of the correct graph state, but Alice can check the correctness of Bob's state by directly verifying the stabilizers of some copies.

  19. Verifiable Measurement-Only Blind Quantum Computing with Stabilizer Testing

    NASA Astrophysics Data System (ADS)

    Hayashi, Masahito; Morimae, Tomoyuki

    2015-11-01

    We introduce a simple protocol for verifiable measurement-only blind quantum computing. Alice, a client, can perform only single-qubit measurements, whereas Bob, a server, can generate and store entangled many-qubit states. Bob generates copies of a graph state, which is a universal resource state for measurement-based quantum computing, and sends Alice each qubit of them one by one. Alice adaptively measures each qubit according to her program. If Bob is honest, he generates the correct graph state, and, therefore, Alice can obtain the correct computation result. Regarding the security, whatever Bob does, Bob cannot get any information about Alice's computation because of the no-signaling principle. Furthermore, malicious Bob does not necessarily send the copies of the correct graph state, but Alice can check the correctness of Bob's state by directly verifying the stabilizers of some copies.

  20. Quantum error correction and fault-tolerant quantum computation

    NASA Astrophysics Data System (ADS)

    Lai, Ching-Yi

    Quantum computers need to be protected by quantum error-correcting codes against decoherence. One of the most interesting and useful classes of quantum codes is the class of quantum stabilizer codes. Entanglement-assisted (EA) quantum codes are a class of stabilizer codes that make use of preshared entanglement between the sender and the receiver. We provide several code constructions for entanglement-assisted quantum codes. The MacWilliams identity for quantum codes leads to linear programming bounds on the minimum distance. We find new constraints on the simplified stabilizer group and the logical group, which help improve the linear programming bounds on entanglement-assisted quantum codes. The results also can be applied to standard stabilizer codes. In the real world, quantum gates are faulty. To implement quantum computation fault-tolerantly, quantum codes with certain properties are needed. We first analyze Knill's postselection scheme in a two-dimensional architecture. The error performance of this scheme is better than other known concatenated codes. Then we propose several methods to protect syndrome extraction against measurement errors.

  1. Performing quantum computing experiments in the cloud

    NASA Astrophysics Data System (ADS)

    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.

  2. The case for biological quantum computer elements

    NASA Astrophysics Data System (ADS)

    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.

  3. Numerical characteristics of quantum computer simulation

    NASA Astrophysics Data System (ADS)

    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.

  4. Universal quantum computation with weakly integral anyons

    NASA Astrophysics Data System (ADS)

    Cui, Shawn X.; Hong, Seung-Moon; Wang, Zhenghan

    2015-08-01

    Harnessing non-abelian statistics of anyons to perform quantum computational tasks is getting closer to reality. While the existence of universal anyons by braiding alone such as the Fibonacci anyon is theoretically a possibility, accessible anyons with current technology all belong to a class that is called weakly integral—anyons whose squared quantum dimensions are integers. We analyze the computational power of the first non-abelian anyon system with only integral quantum dimensions—, the quantum double of . Since all anyons in have finite images of braid group representations, they cannot be universal for quantum computation by braiding alone. Based on our knowledge of the images of the braid group representations, we set up three qutrit computational models. Supplementing braidings with some measurements and ancillary states, we find a universal gate set for each model.

  5. Video Encryption and Decryption on Quantum Computers

    NASA Astrophysics Data System (ADS)

    Yan, Fei; Iliyasu, Abdullah M.; Venegas-Andraca, Salvador E.; Yang, Huamin

    2015-08-01

    A method for video encryption and decryption on quantum computers is proposed based on color information transformations on each frame encoding the content of the encoding the content of the video. The proposed method provides a flexible operation to encrypt quantum video by means of the quantum measurement in order to enhance the security of the video. To validate the proposed approach, a tetris tile-matching puzzle game video is utilized in the experimental simulations. The results obtained suggest that the proposed method enhances the security and speed of quantum video encryption and decryption, both properties required for secure transmission and sharing of video content in quantum communication.

  6. Quantum Computation Using Optically Coupled Quantum Dot Arrays

    NASA Technical Reports Server (NTRS)

    Pradhan, Prabhakar; Anantram, M. P.; Wang, K. L.; Roychowhury, V. P.; Saini, Subhash (Technical Monitor)

    1998-01-01

    A solid state model for quantum computation has potential advantages in terms of the ease of fabrication, characterization, and integration. The fundamental requirements for a quantum computer involve the realization of basic processing units (qubits), and a scheme for controlled switching and coupling among the qubits, which enables one to perform controlled operations on qubits. We propose a model for quantum computation based on optically coupled quantum dot arrays, which is computationally similar to the atomic model proposed by Cirac and Zoller. In this model, individual qubits are comprised of two coupled quantum dots, and an array of these basic units is placed in an optical cavity. Switching among the states of the individual units is done by controlled laser pulses via near field interaction using the NSOM technology. Controlled rotations involving two or more qubits are performed via common cavity mode photon. We have calculated critical times, including the spontaneous emission and switching times, and show that they are comparable to the best times projected for other proposed models of quantum computation. We have also shown the feasibility of accessing individual quantum dots using the NSOM technology by calculating the photon density at the tip, and estimating the power necessary to perform the basic controlled operations. We are currently in the process of estimating the decoherence times for this system; however, we have formulated initial arguments which seem to indicate that the decoherence times will be comparable, if not longer, than many other proposed models.

  7. Conceptual aspects of geometric quantum computation

    NASA Astrophysics Data System (ADS)

    Sjöqvist, Erik; Azimi Mousolou, Vahid; Canali, Carlo M.

    2016-10-01

    Geometric quantum computation is the idea that geometric phases can be used to implement quantum gates, i.e., the basic elements of the Boolean network that forms a quantum computer. Although originally thought to be limited to adiabatic evolution, controlled by slowly changing parameters, this form of quantum computation can as well be realized at high speed by using nonadiabatic schemes. Recent advances in quantum gate technology have allowed for experimental demonstrations of different types of geometric gates in adiabatic and nonadiabatic evolution. Here, we address some conceptual issues that arise in the realizations of geometric gates. We examine the appearance of dynamical phases in quantum evolution and point out that not all dynamical phases need to be compensated for in geometric quantum computation. We delineate the relation between Abelian and non-Abelian geometric gates and find an explicit physical example where the two types of gates coincide. We identify differences and similarities between adiabatic and nonadiabatic realizations of quantum computation based on non-Abelian geometric phases.

  8. Hyper-parallel photonic quantum computation with coupled quantum dots

    PubMed Central

    Ren, Bao-Cang; Deng, Fu-Guo

    2014-01-01

    It is well known that a parallel quantum computer is more powerful than a classical one. So far, there are some important works about the construction of universal quantum logic gates, the key elements in quantum computation. However, they are focused on operating on one degree of freedom (DOF) of quantum systems. Here, we investigate the possibility of achieving scalable hyper-parallel quantum computation based on two DOFs of photon systems. We construct a deterministic hyper-controlled-not (hyper-CNOT) gate operating on both the spatial-mode and the polarization DOFs of a two-photon system simultaneously, by exploiting the giant optical circular birefringence induced by quantum-dot spins in double-sided optical microcavities as a result of cavity quantum electrodynamics (QED). This hyper-CNOT gate is implemented by manipulating the four qubits in the two DOFs of a two-photon system without auxiliary spatial modes or polarization modes. It reduces the operation time and the resources consumed in quantum information processing, and it is more robust against the photonic dissipation noise, compared with the integration of several cascaded CNOT gates in one DOF. PMID:24721781

  9. One-way quantum computation with circuit quantum electrodynamics

    SciTech Connect

    Wu Chunwang; Han Yang; Chen Pingxing; Li Chengzu; Zhong Xiaojun

    2010-03-15

    In this Brief Report, we propose a potential scheme to implement one-way quantum computation with circuit quantum electrodynamics (QED). Large cluster states of charge qubits can be generated in just one step with a superconducting transmission line resonator (TLR) playing the role of a dispersive coupler. A single-qubit measurement in the arbitrary basis can be implemented using a single electron transistor with the help of one-qubit gates. By examining the main decoherence sources, we show that circuit QED is a promising architecture for one-way quantum computation.

  10. Ramsey numbers and adiabatic quantum computing.

    PubMed

    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.

  11. Materials Frontiers to Empower Quantum Computing

    SciTech Connect

    Taylor, Antoinette Jane; Sarrao, John Louis; Richardson, Christopher

    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.

  12. Reducing computational complexity of quantum correlations

    NASA Astrophysics Data System (ADS)

    Chanda, Titas; Das, Tamoghna; Sadhukhan, Debasis; Pal, Amit Kumar; SenDe, Aditi; Sen, Ujjwal

    2015-12-01

    We address the issue of reducing the resource required to compute information-theoretic quantum correlation measures such as quantum discord and quantum work deficit in two qubits and higher-dimensional systems. We show that determination of the quantum correlation measure is possible even if we utilize a restricted set of local measurements. We find that the determination allows us to obtain a closed form of quantum discord and quantum work deficit for several classes of states, with a low error. We show that the computational error caused by the constraint over the complete set of local measurements reduces fast with an increase in the size of the restricted set, implying usefulness of constrained optimization, especially with the increase of dimensions. We perform quantitative analysis to investigate how the error scales with the system size, taking into account a set of plausible constructions of the constrained set. Carrying out a comparative study, we show that the resource required to optimize quantum work deficit is usually higher than that required for quantum discord. We also demonstrate that minimization of quantum discord and quantum work deficit is easier in the case of two-qubit mixed states of fixed ranks and with positive partial transpose in comparison to the corresponding states having nonpositive partial transpose. Applying the methodology to quantum spin models, we show that the constrained optimization can be used with advantage in analyzing such systems in quantum information-theoretic language. For bound entangled states, we show that the error is significantly low when the measurements correspond to the spin observables along the three Cartesian coordinates, and thereby we obtain expressions of quantum discord and quantum work deficit for these bound entangled states.

  13. Decoherence and a simple quantum computer

    SciTech Connect

    Chuang, I.L.; Yamamoto, Y.; Laflamme, R.

    1995-10-01

    The authors analyze the effect of decoherence on the operation of part of a simple quantum computer. The results indicate that quantum bit coding techniques may be used to mitigate the effects of two sources of decoherence - amplitude damping and phase randomization.

  14. Experimental comparison of two quantum computing architectures

    PubMed Central

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

    2017-01-01

    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.research.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. PMID:28325879

  15. Is the Brain a Quantum Computer?

    ERIC Educational Resources Information Center

    Litt, Abninder; Eliasmith, Chris; Kroon, Frederick W.; Weinstein, Steven; Thagard, Paul

    2006-01-01

    We argue that computation via quantum mechanical processes is irrelevant to explaining how brains produce thought, contrary to the ongoing speculations of many theorists. First, quantum effects do not have the temporal properties required for neural information processing. Second, there are substantial physical obstacles to any organic…

  16. Algorithms Bridging Quantum Computation and Chemistry

    NASA Astrophysics Data System (ADS)

    McClean, Jarrod Ryan

    The design of new materials and chemicals derived entirely from computation has long been a goal of computational chemistry, and the governing equation whose solution would permit this dream is known. Unfortunately, the exact solution to this equation has been far too expensive and clever approximations fail in critical situations. Quantum computers offer a novel solution to this problem. In this work, we develop not only new algorithms to use quantum computers to study hard problems in chemistry, but also explore how such algorithms can help us to better understand and improve our traditional approaches. In particular, we first introduce a new method, the variational quantum eigensolver, which is designed to maximally utilize the quantum resources available in a device to solve chemical problems. We apply this method in a real quantum photonic device in the lab to study the dissociation of the helium hydride (HeH+) molecule. We also enhance this methodology with architecture specific optimizations on ion trap computers and show how linear-scaling techniques from traditional quantum chemistry can be used to improve the outlook of similar algorithms on quantum computers. We then show how studying quantum algorithms such as these can be used to understand and enhance the development of classical algorithms. In particular we use a tool from adiabatic quantum computation, Feynman's Clock, to develop a new discrete time variational principle and further establish a connection between real-time quantum dynamics and ground state eigenvalue problems. We use these tools to develop two novel parallel-in-time quantum algorithms that outperform competitive algorithms as well as offer new insights into the connection between the fermion sign problem of ground states and the dynamical sign problem of quantum dynamics. Finally we use insights gained in the study of quantum circuits to explore a general notion of sparsity in many-body quantum systems. In particular we use

  17. Quantum computing Hyper Terahertz Facility opens

    NASA Astrophysics Data System (ADS)

    Singh Chadha, Kulvinder

    2016-01-01

    A new facility has opened at the University of Surrey to use terahertz radiation for quantum computing. The Hyper Terahertz Facility (HTF) is a joint collaboration between the University of Surrey and the National Physical Laboratory (NPL).

  18. Optimised resource construction for verifiable quantum computation

    NASA Astrophysics Data System (ADS)

    Kashefi, Elham; Wallden, Petros

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

  19. Iterated Gate Teleportation and Blind Quantum Computation.

    PubMed

    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.

  20. Iterated Gate Teleportation and Blind Quantum Computation

    NASA Astrophysics Data System (ADS)

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

    2015-06-01

    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.

  1. Delayed Commutation in Quantum Computer Networks

    NASA Astrophysics Data System (ADS)

    García-Escartín, Juan Carlos; Chamorro-Posada, Pedro

    2006-09-01

    In the same way that classical computer networks connect and enhance the capabilities of classical computers, quantum networks can combine the advantages of quantum information and communication. We propose a nonclassical network element, a delayed commutation switch, that can solve the problem of switching time in packet switching networks. With the help of some local ancillary qubits and superdense codes, we can route a qubit packet after part of it has left the network node.

  2. Braid group representation on quantum computation

    SciTech Connect

    Aziz, Ryan Kasyfil; Muchtadi-Alamsyah, Intan

    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.

  3. Dilution Refrigerator Technology for Scalable Quantum Computing

    DTIC Science & Technology

    2014-05-22

    has successfully designed, built, tested, and delivered a cryogen free dilution refrigerator for scalable quantum computing. This document is intended... Cryogenics , quantum computing REPORT DOCUMENTATION PAGE 11. SPONSOR/MONITOR’S REPORT NUMBER(S) 10. SPONSOR/MONITOR’S ACRONYM(S) ARO 8. PERFORMING...W911NF-10-C-0004. High Precision Devices, Inc. has successfully designed, built, tested, and delivered a cryogen free dilution refrigerator for

  4. Quantum Computer Circuit Analysis and Design

    DTIC Science & Technology

    2009-02-01

    is a first order nonlinear differential matrix equation of the Lax type. This report gives derivations of the Levi-Civita connection, Riemann...computational paths in the )2( nSU manifold. It is a nonlinear first-order differential matrix equation of the same form as the Lax equation for...I. L. Quantum Information and Computation; Cambridge University Press, 2000. 2. Dowling , M. R.; Nielsen, M. A. The Geometry of Quantum

  5. EDITORIAL: Quantum Computing and the Feynman Festival

    NASA Astrophysics Data System (ADS)

    Brandt, Howard E.; Kim, Young S.; Man'ko, Margarita A.

    2003-12-01

    The Feynman Festival is a new interdisciplinary conference developed for studying Richard Feynman and his physics. The first meeting of this new conference series was held at the University of Maryland on 23--28 August 2002 (http://www.physics.umd.edu/robot/feynman.html) and the second meeting is scheduled for August 2004 at the same venue. According to Feynman, the different aspects of nature are different aspects of the same thing. Therefore, the ultimate purpose of the conference is to find Feynman's same thing from all different theories. For this reason, the first meeting of the Festival did not begin with a fixed formula, but composed its scientific programme based on responses from the entire physics community. The conference drew the most enthusiastic response from the community of quantum computing, the field initiated by Feynman. Encouraged by the response, we decided to edit a special issue of Journal of Optics B: Quantum and Semiclassical Optics on quantum computing in connection with the first Feynman Festival. The authorship is not restricted to the participants of the Feynman Festival, and all interested parties were encouraged to submit their papers on this subject. Needless to say, all the papers were peer reviewed according to the well-established standards of the journal. The subject of quantum computing is not restricted to building and operating computers. It requires a deeper understanding of how quantum mechanics works in materials as well as in our minds. Indeed, it covers the basic foundations of quantum mechanics, measurement theory, information theory, quantum optics, atomic physics and condensed matter physics. It may be necessary to develop new mathematical tools to accommodate the language that nature speaks. It is gratifying to note that this special issue contains papers covering all these aspects of quantum computing. As Feynman noted, we could be discussing these diversified issues to study one problem. In our case, this `one

  6. Waveguide-QED-based photonic quantum computation.

    PubMed

    Zheng, Huaixiu; Gauthier, Daniel J; Baranger, Harold U

    2013-08-30

    We propose a new scheme for quantum computation using flying qubits--propagating photons in a one-dimensional waveguide interacting with matter qubits. Photon-photon interactions are mediated by the coupling to a four-level system, based on which photon-photon π-phase gates (CONTROLLED-NOT) can be implemented for universal quantum computation. We show that high gate fidelity is possible, given recent dramatic experimental progress in superconducting circuits and photonic-crystal waveguides. The proposed system can be an important building block for future on-chip quantum networks.

  7. Quantum computing in a piece of glass

    NASA Astrophysics Data System (ADS)

    Miller, Warner A.; Alsing, Paul M.; Kreymerman, Grigoriy; McDonald, Jonathan R.; Tison, Christopher

    2011-05-01

    Quantum gates and simple quantum algorithms can be designed utilizing the diffraction phenomena of a photon within a multiplexed holographic element. The quantum eigenstates we use are the photon's linear momentum (LM) as measured by the number of waves of tilt across the aperture. Two properties of quantum computing within the circuit model make this approach attractive. First, any conditional measurement can be commuted in time with any unitary quantum gate - the timeless nature of quantum computing. Second, photon entanglement can be encoded as a superposition state of a single photon in a higher-dimensional state space afforded by LM. Our theoretical and numerical results indicate that OptiGrate's photo-thermal refractive (PTR) glass is an enabling technology. We will review our previous design of a quantum projection operator and give credence to this approach on a representative quantum gate grounded on coupled-mode theory and numerical simulations, all with parameters consistent with PTR glass. We discuss the strengths (high efficiencies, robustness to environment) and limitations (scalability, crosstalk) of this technology. While not scalable, the utility and robustness of such optical elements for broader quantum information processing applications can be substantial.

  8. Quantum Fourier transform in computational basis

    NASA Astrophysics Data System (ADS)

    Zhou, S. S.; Loke, T.; Izaac, J. A.; Wang, J. B.

    2017-03-01

    The quantum Fourier transform, with exponential speed-up compared to the classical fast Fourier transform, has played an important role in quantum computation as a vital part of many quantum algorithms (most prominently, Shor's factoring algorithm). However, situations arise where it is not sufficient to encode the Fourier coefficients within the quantum amplitudes, for example in the implementation of control operations that depend on Fourier coefficients. In this paper, we detail a new quantum scheme to encode Fourier coefficients in the computational basis, with fidelity 1 - δ and digit accuracy ɛ for each Fourier coefficient. Its time complexity depends polynomially on log (N), where N is the problem size, and linearly on 1/δ and 1/ɛ . We also discuss an application of potential practical importance, namely the simulation of circulant Hamiltonians.

  9. Simulating physical phenomena with a quantum computer

    NASA Astrophysics Data System (ADS)

    Ortiz, Gerardo

    2003-03-01

    In a keynote speech at MIT in 1981 Richard Feynman raised some provocative questions in connection to the exact simulation of physical systems using a special device named a ``quantum computer'' (QC). At the time it was known that deterministic simulations of quantum phenomena in classical computers required a number of resources that scaled exponentially with the number of degrees of freedom, and also that the probabilistic simulation of certain quantum problems were limited by the so-called sign or phase problem, a problem believed to be of exponential complexity. Such a QC was intended to mimick physical processes exactly the same as Nature. Certainly, remarks coming from such an influential figure generated widespread interest in these ideas, and today after 21 years there are still some open questions. What kind of physical phenomena can be simulated with a QC?, How?, and What are its limitations? Addressing and attempting to answer these questions is what this talk is about. Definitively, the goal of physics simulation using controllable quantum systems (``physics imitation'') is to exploit quantum laws to advantage, and thus accomplish efficient imitation. Fundamental is the connection between a quantum computational model and a physical system by transformations of operator algebras. This concept is a necessary one because in Quantum Mechanics each physical system is naturally associated with a language of operators and thus can be considered as a possible model of quantum computation. The remarkable result is that an arbitrary physical system is naturally simulatable by another physical system (or QC) whenever a ``dictionary'' between the two operator algebras exists. I will explain these concepts and address some of Feynman's concerns regarding the simulation of fermionic systems. Finally, I will illustrate the main ideas by imitating simple physical phenomena borrowed from condensed matter physics using quantum algorithms, and present experimental

  10. Robust dynamical decoupling for quantum computing and quantum memory.

    PubMed

    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.

  11. Irreconcilable difference between quantum walks and adiabatic quantum computing

    NASA Astrophysics Data System (ADS)

    Wong, Thomas G.; Meyer, David A.

    2016-06-01

    Continuous-time quantum walks and adiabatic quantum evolution are two general techniques for quantum computing, both of which are described by Hamiltonians that govern their evolutions by Schrödinger's equation. In the former, the Hamiltonian is fixed, while in the latter, the Hamiltonian varies with time. As a result, their formulations of Grover's algorithm evolve differently through Hilbert space. We show that this difference is fundamental; they cannot be made to evolve along each other's path without introducing structure more powerful than the standard oracle for unstructured search. For an adiabatic quantum evolution to evolve like the quantum walk search algorithm, it must interpolate between three fixed Hamiltonians, one of which is complex and introduces structure that is stronger than the oracle for unstructured search. Conversely, for a quantum walk to evolve along the path of the adiabatic search algorithm, it must be a chiral quantum walk on a weighted, directed star graph with structure that is also stronger than the oracle for unstructured search. Thus, the two techniques, although similar in being described by Hamiltonians that govern their evolution, compute by fundamentally irreconcilable means.

  12. Universal quantum computation in a semiconductor quantum wire network

    NASA Astrophysics Data System (ADS)

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

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

  13. Simulating fermions on a quantum computer

    NASA Astrophysics Data System (ADS)

    Ortiz, G.; Gubernatis, J. E.; Knill, E.; Laflamme, R.

    2002-07-01

    The real-time probabilistic simulation of quantum systems in classical computers is known to be limited by the so-called dynamical sign problem, a problem leading to exponential complexity. In 1981 Richard Feynman raised some provocative questions in connection to the "exact imitation" of such systems using a special device named a "quantum computer". Feynman hesitated about the possibility of imitating fermion systems using such a device. Here we address some of his concerns and, in particular, investigate the simulation of fermionic systems. We show how quantum computers avoid the sign problem in some cases by reducing the complexity from exponential to polynomial. Our demonstration is based upon the use of isomorphisms of algebras. We present specific quantum algorithms that illustrate the main points of our algebraic approach.

  14. Centrality measure based on continuous-time quantum walks and experimental realization

    NASA Astrophysics Data System (ADS)

    Izaac, Josh A.; Zhan, Xiang; Bian, Zhihao; Wang, Kunkun; Li, Jian; Wang, Jingbo B.; Xue, Peng

    2017-03-01

    Network centrality has important implications well beyond its role in physical and information transport analysis; as such, various quantum-walk-based algorithms have been proposed for measuring network vertex centrality. In this work, we propose a continuous-time quantum walk algorithm for determining vertex centrality, and show that it generalizes to arbitrary graphs via a statistical analysis of randomly generated scale-free and Erdős-Rényi networks. As a proof of concept, the algorithm is detailed on a four-vertex star graph and physically implemented via linear optics, using spatial and polarization degrees of freedoms of single photons. This paper reports a successful physical demonstration of a quantum centrality algorithm.

  15. Quantum Optical Implementations of Quantum Computing and Quantum Informatics Protocols

    DTIC Science & Technology

    2007-11-20

    REPORT NUMBER Institute for Quantum Studies and Department of Physics Texas A&M University College Station, TX 77843- 4242 9. SPONSORING / MONITORING...September 30, 2007 Principal Investigators: Marlan 0. Scully and M. Subail Zubairy Institute for Quantum Studies and Department of Physics Texas A&M...Thus, N has a simple physical meaning: It is the ratio of the delay time of the buffer and the pulse duration and corresponds to the number of

  16. Efficient quantum circuits for one-way quantum computing.

    PubMed

    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.

  17. Triple-server blind quantum computation using entanglement swapping

    NASA Astrophysics Data System (ADS)

    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.

  18. Nanoscale solid-state quantum computing

    NASA Astrophysics Data System (ADS)

    Ardavan, A.; Austwick, M.; Benjamin, S.C.; Briggs, G.A.D.; Dennis, T.J.S.; Ferguson, A.; Hasko, D.G.; Kanai, M.; Khlobystov, A.N.; Lovett, B.W.; Morley, G.W.; Oliver, R.A.; Pettifor, D.G.; Porfyrakis, K.; Reina, J.H.; Rice, J.H.; Smith, J.D.; Taylor, R.A.; Williams, D.A.; Adelmann, C.; Mariette, H.; Hamers, R.J.

    2003-07-01

    Most experts agree that it is too early to say how quantum computers will eventually be built, and several nanoscale solid-state schemes are being implemented in a range of materials. Nanofabricated quantum dots can be made in designer configurations, with established technology for controlling interactions and for reading out results. Epitaxial quantum dots can be grown in vertical arrays in semiconductors, and ultrafast optical techniques are available for controlling and measuring their excitations. Single-walled carbon nanotubes can be used for molecular self-assembly of endohedral fullerenes, which can embody quantum information in the electron spin. The challenges of individual addressing in such tiny structures could rapidly become intractable with increasing numbers of qubits, but these schemes are amenable to global addressing methods for computation.

  19. Short Introduction to Quantum Computation

    DTIC Science & Technology

    2007-11-02

    Yves Pomeau. Lattice-gas automata for the navier - stokes equa- tion. Physical Review Letters, 56(14):1505–1508, 1986. [8] Stephen Wolfram. Cellular...quantum mechanical descrip- tion. Secondly, since all nonrelativistic dynamics at the nano-scale are governed by the Schroedinger wave equation with a

  20. Plasmon Resonators for Quantum Computing

    DTIC Science & Technology

    2007-06-01

    quantum dot. For free atoms this strong coupling is achieved using high Q optical resonators, such as ultra-low-loss bulk Fabry - Perot cavities or...TR-07-0487 11. SUPPLEMENTARY NOTES 12a. DISTRIBUTION/AVAILABILITY STATEMENT 12b. DISTRIBUTION CODE Unlimited UL 13. ABSTRACT (Maximum 200 words) The

  1. Information-theoretic temporal Bell inequality and quantum computation

    SciTech Connect

    Morikoshi, Fumiaki

    2006-05-15

    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.

  2. Introduction to Quantum Information/Computing

    DTIC Science & Technology

    2005-06-01

    mωX + iP) sqrt(2mhω) BCS Theory – Named for John Bardeen , Leon Cooper, and Robert Schrieffer. According to theory, the...Theory and Reliable Communication, John Wiley & Sons 1998 2. M.A. Nielsen, I. L. Chuang, Quantum Computation and Quantum Information, Cambridge...France and by John Wiley & Sons. 6. H. Goldstein, Classical Mechanics, 1950 Addison-Wesley Publishing Company, Inc. 7. L.S. Brown and G

  3. Entanglement and Quantum Computation: An Overview

    SciTech Connect

    Perez, R.B.

    2000-06-27

    This report presents a selective compilation of basic facts from the fields of particle entanglement and quantum information processing prepared for those non-experts in these fields that may have interest in an area of physics showing counterintuitive, ''spooky'' (Einstein's words) behavior. In fact, quantum information processing could, in the near future, provide a new technology to sustain the benefits to the U.S. economy due to advanced computer technology.

  4. Efficient quantum computing of complex dynamics.

    PubMed

    Benenti, G; Casati, G; Montangero, S; Shepelyansky, D L

    2001-11-26

    We propose a quantum algorithm which uses the number of qubits in an optimal way and efficiently simulates a physical model with rich and complex dynamics described by the quantum sawtooth map. The numerical study of the effect of static imperfections in the quantum computer hardware shows that the main elements of the phase space structures are accurately reproduced up to a time scale which is polynomial in the number of qubits. The errors generated by these imperfections are more significant than the errors of random noise in gate operations.

  5. Computations in quantum mechanics made easy

    NASA Astrophysics Data System (ADS)

    Korsch, H. J.; Rapedius, K.

    2016-09-01

    Convenient and simple numerical techniques for performing quantum computations based on matrix representations of Hilbert space operators are presented and illustrated by various examples. The applications include the calculations of spectral and dynamical properties for one-dimensional and two-dimensional single-particle systems as well as bosonic many-particle and open quantum systems. Due to their technical simplicity these methods are well suited as a tool for teaching quantum mechanics to undergraduates and graduates. Explicit implementations of the presented numerical methods in Matlab are given.

  6. Universal two-body-Hamiltonian quantum computing

    NASA Astrophysics Data System (ADS)

    Nagaj, Daniel

    2012-03-01

    We present a Hamiltonian quantum-computation scheme universal for quantum computation. Our Hamiltonian is a sum of a polynomial number (in the number of gates L in the quantum circuit) of constant-norm, time-independent, two-body interaction terms. Furthermore, each qubit in the system interacts only with a constant number of other qubits in a three-layer, geometrically local layout. The computer runs in three steps—it starts in a simple initial product state, evolves according to a time-independent Hamiltonian for time of order L2 (up to logarithmic factors), and finishes with a two-qubit measurement. Our model improves previous universal two-local-Hamiltonian constructions, as it avoids using perturbation gadgets and large energy-penalty terms in the Hamiltonian, which would result in a large required run time.

  7. Superconducting Qubits for Quantum Computation

    DTIC Science & Technology

    2006-05-31

    based on the Aharonov - Casher effect for flux tunneling, and the extension of the concept of the quantum non-demolition measurements to the measurement...consists of a Bloch transistor included in the superconducting loop with finite inductance and uses the Aharonov - Casher effect to modulate the flux...tunneling amplitude. The Aharonov - Casher effect in a simple system of Josephson junctions is of considerable interest of its own, and we expect that the

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

    PubMed

    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.

  9. Towards universal quantum computation through relativistic motion

    PubMed Central

    Bruschi, David Edward; Sabín, Carlos; Kok, Pieter; Johansson, Göran; Delsing, Per; Fuentes, Ivette

    2016-01-01

    We show how to use relativistic motion to generate continuous variable Gaussian cluster states within cavity modes. Our results can be demonstrated experimentally using superconducting circuits where tuneable boundary conditions correspond to mirrors moving with velocities close to the speed of light. In particular, we propose the generation of a quadripartite square cluster state as a first example that can be readily implemented in the laboratory. Since cluster states are universal resources for universal one-way quantum computation, our results pave the way for relativistic quantum computation schemes. PMID:26860584

  10. Ultrafast quantum nondemolition measurement based on diamond-shaped artificial atom

    NASA Astrophysics Data System (ADS)

    Küng, Bruno; Dumur, Etienne; Diniz, Igor; Feofanov, Alexey; Weissl, Thomas; Naud, Cécile; Guichard, Wiebke; Auffèves, Alexia; Buisson, Olivier

    2014-03-01

    We present a theoretical study of a quantum nondemolition readout scheme based on a superconducting artificial atom with two internal degrees of freedom. In comparison with the most widely employed readout scheme for superconducting qubits, the dispersive readout in a circuit quantum electrodynamics architecture, our approach promises a significantly stronger measurement signal. This should allow for a high-fidelity readout in a single shot. Our device consists of two transmons (i.e., small capacitively shunted Josephson junctions) coupled via a large inductance. The resulting circuit exhibits a symmetric and an antisymmetric oscillation which we use as a logical and ancilla qubit, respectively. The Josephson non-linearity leads to a cross-Kerr-like coupling of the two oscillations. This allows us to read out the logical qubit state by measuring the ancilla qubit frequency. To measure the ancilla qubit frequency, we couple it to a superconducting microwave resonator, allowing for a large amplitude and a fast response of the transmitted microwave signal. At the same time, the logical qubit remains weakly coupled and far detuned from the resonator, preventing qubit relaxation due to the Purcell effect.

  11. Mimicking time evolution within a quantum ground state: Ground-state quantum computation, cloning, and teleportation

    SciTech Connect

    Mizel, Ari

    2004-07-01

    Ground-state quantum computers mimic quantum-mechanical time evolution within the amplitudes of a time-independent quantum state. We explore the principles that constrain this mimicking. A no-cloning argument is found to impose strong restrictions. It is shown, however, that there is flexibility that can be exploited using quantum teleportation methods to improve ground-state quantum computer design.

  12. Universality of quantum computation with cluster states and (X, Y)-plane measurements

    NASA Astrophysics Data System (ADS)

    Mantri, Atul; Demarie, Tommaso F.; Fitzsimons, Joseph F.

    2017-02-01

    Measurement-based quantum computing (MBQC) is a model of quantum computation where quantum information is coherently processed by means of projective measurements on highly entangled states. Following the introduction of MBQC, cluster states have been studied extensively both from the theoretical and experimental point of view. Indeed, the study of MBQC was catalysed by the realisation that cluster states are universal for MBQC with (X, Y)-plane and Z measurements. Here we examine the question of whether the requirement for Z measurements can be dropped while maintaining universality. We answer this question in the affirmative by showing that universality is possible in this scenario.

  13. Universality of quantum computation with cluster states and (X, Y)-plane measurements

    PubMed Central

    Mantri, Atul; Demarie, Tommaso F.; Fitzsimons, Joseph F.

    2017-01-01

    Measurement-based quantum computing (MBQC) is a model of quantum computation where quantum information is coherently processed by means of projective measurements on highly entangled states. Following the introduction of MBQC, cluster states have been studied extensively both from the theoretical and experimental point of view. Indeed, the study of MBQC was catalysed by the realisation that cluster states are universal for MBQC with (X, Y)-plane and Z measurements. Here we examine the question of whether the requirement for Z measurements can be dropped while maintaining universality. We answer this question in the affirmative by showing that universality is possible in this scenario. PMID:28216652

  14. Universality of quantum computation with cluster states and (X, Y)-plane measurements.

    PubMed

    Mantri, Atul; Demarie, Tommaso F; Fitzsimons, Joseph F

    2017-02-20

    Measurement-based quantum computing (MBQC) is a model of quantum computation where quantum information is coherently processed by means of projective measurements on highly entangled states. Following the introduction of MBQC, cluster states have been studied extensively both from the theoretical and experimental point of view. Indeed, the study of MBQC was catalysed by the realisation that cluster states are universal for MBQC with (X, Y)-plane and Z measurements. Here we examine the question of whether the requirement for Z measurements can be dropped while maintaining universality. We answer this question in the affirmative by showing that universality is possible in this scenario.

  15. Random Numbers and Quantum Computers

    ERIC Educational Resources Information Center

    McCartney, Mark; Glass, David

    2002-01-01

    The topic of random numbers is investigated in such a way as to illustrate links between mathematics, physics and computer science. First, the generation of random numbers by a classical computer using the linear congruential generator and logistic map is considered. It is noted that these procedures yield only pseudo-random numbers since…

  16. Quantum game simulator, using the circuit model of quantum computation

    NASA Astrophysics Data System (ADS)

    Vlachos, Panagiotis; Karafyllidis, Ioannis G.

    2009-10-01

    We present a general two-player quantum game simulator that can simulate any two-player quantum game described by a 2×2 payoff matrix (two strategy games).The user can determine the payoff matrices for both players, their strategies and the amount of entanglement between their initial strategies. The outputs of the simulator are the expected payoffs of each player as a function of the other player's strategy parameters and the amount of entanglement. The simulator also produces contour plots that divide the strategy spaces of the game in regions in which players can get larger payoffs if they choose to use a quantum strategy against any classical one. We also apply the simulator to two well-known quantum games, the Battle of Sexes and the Chicken game. Program summaryProgram title: Quantum Game Simulator (QGS) Catalogue identifier: AEED_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEED_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 3416 No. of bytes in distributed program, including test data, etc.: 583 553 Distribution format: tar.gz Programming language: Matlab R2008a (C) Computer: Any computer that can sufficiently run Matlab R2008a Operating system: Any system that can sufficiently run Matlab R2008a Classification: 4.15 Nature of problem: Simulation of two player quantum games described by a payoff matrix. Solution method: The program calculates the matrices that comprise the Eisert setup for quantum games based on the quantum circuit model. There are 5 parameters that can be altered. We define 3 of them as constant. We play the quantum game for all possible values for the other 2 parameters and store the results in a matrix. Unusual features: The software provides an easy way of simulating any two-player quantum games. Running time: Approximately

  17. Experimental realization of Deutsch's algorithm in a one-way quantum computer.

    PubMed

    Tame, M S; Prevedel, R; Paternostro, M; Böhi, P; Kim, M S; Zeilinger, A

    2007-04-06

    We report the first experimental demonstration of an all-optical one-way implementation of Deutsch's quantum algorithm on a four-qubit cluster state. All the possible configurations of a balanced or constant function acting on a two-qubit register are realized within the measurement-based model for quantum computation. The experimental results are in excellent agreement with the theoretical model, therefore demonstrating the successful performance of the algorithm.

  18. A surface code quantum computer in silicon.

    PubMed

    Hill, Charles D; Peretz, Eldad; Hile, Samuel J; House, Matthew G; Fuechsle, Martin; Rogge, Sven; Simmons, Michelle Y; Hollenberg, Lloyd C L

    2015-10-01

    The exceptionally long quantum coherence times of phosphorus donor nuclear spin qubits in silicon, coupled with the proven scalability of silicon-based nano-electronics, make them attractive candidates for large-scale quantum computing. However, the high threshold of topological quantum error correction can only be captured in a two-dimensional array of qubits operating synchronously and in parallel-posing formidable fabrication and control challenges. We present an architecture that addresses these problems through a novel shared-control paradigm that is particularly suited to the natural uniformity of the phosphorus donor nuclear spin qubit states and electronic confinement. The architecture comprises a two-dimensional lattice of donor qubits sandwiched between two vertically separated control layers forming a mutually perpendicular crisscross gate array. Shared-control lines facilitate loading/unloading of single electrons to specific donors, thereby activating multiple qubits in parallel across the array on which the required operations for surface code quantum error correction are carried out by global spin control. The complexities of independent qubit control, wave function engineering, and ad hoc quantum interconnects are explicitly avoided. With many of the basic elements of fabrication and control based on demonstrated techniques and with simulated quantum operation below the surface code error threshold, the architecture represents a new pathway for large-scale quantum information processing in silicon and potentially in other qubit systems where uniformity can be exploited.

  19. A surface code quantum computer in silicon

    PubMed Central

    Hill, Charles D.; Peretz, Eldad; Hile, Samuel J.; House, Matthew G.; Fuechsle, Martin; Rogge, Sven; Simmons, Michelle Y.; Hollenberg, Lloyd C. L.

    2015-01-01

    The exceptionally long quantum coherence times of phosphorus donor nuclear spin qubits in silicon, coupled with the proven scalability of silicon-based nano-electronics, make them attractive candidates for large-scale quantum computing. However, the high threshold of topological quantum error correction can only be captured in a two-dimensional array of qubits operating synchronously and in parallel—posing formidable fabrication and control challenges. We present an architecture that addresses these problems through a novel shared-control paradigm that is particularly suited to the natural uniformity of the phosphorus donor nuclear spin qubit states and electronic confinement. The architecture comprises a two-dimensional lattice of donor qubits sandwiched between two vertically separated control layers forming a mutually perpendicular crisscross gate array. Shared-control lines facilitate loading/unloading of single electrons to specific donors, thereby activating multiple qubits in parallel across the array on which the required operations for surface code quantum error correction are carried out by global spin control. The complexities of independent qubit control, wave function engineering, and ad hoc quantum interconnects are explicitly avoided. With many of the basic elements of fabrication and control based on demonstrated techniques and with simulated quantum operation below the surface code error threshold, the architecture represents a new pathway for large-scale quantum information processing in silicon and potentially in other qubit systems where uniformity can be exploited. PMID:26601310

  20. Blind Quantum Computing with Weak Coherent Pulses

    NASA Astrophysics Data System (ADS)

    Dunjko, Vedran; Kashefi, Elham; Leverrier, Anthony

    2012-05-01

    The universal blind quantum computation (UBQC) protocol [A. Broadbent, J. Fitzsimons, and E. Kashefi, in Proceedings of the 50th Annual IEEE Symposiumon Foundations of Computer Science (IEEE Computer Society, Los Alamitos, CA, USA, 2009), pp. 517-526.] allows a client to perform quantum computation on a remote server. In an ideal setting, perfect privacy is guaranteed if the client is capable of producing specific, randomly chosen single qubit states. While from a theoretical point of view, this may constitute the lowest possible quantum requirement, from a pragmatic point of view, generation of such states to be sent along long distances can never be achieved perfectly. We introduce the concept of ɛ blindness for UBQC, in analogy to the concept of ɛ security developed for other cryptographic protocols, allowing us to characterize the robustness and security properties of the protocol under possible imperfections. We also present a remote blind single qubit preparation protocol with weak coherent pulses for the client to prepare, in a delegated fashion, quantum states arbitrarily close to perfect random single qubit states. This allows us to efficiently achieve ɛ-blind UBQC for any ɛ>0, even if the channel between the client and the server is arbitrarily lossy.

  1. Blind quantum computing with weak coherent pulses.

    PubMed

    Dunjko, Vedran; Kashefi, Elham; Leverrier, Anthony

    2012-05-18

    The universal blind quantum computation (UBQC) protocol [A. Broadbent, J. Fitzsimons, and E. Kashefi, in Proceedings of the 50th Annual IEEE Symposiumon Foundations of Computer Science (IEEE Computer Society, Los Alamitos, CA, USA, 2009), pp. 517-526.] allows a client to perform quantum computation on a remote server. In an ideal setting, perfect privacy is guaranteed if the client is capable of producing specific, randomly chosen single qubit states. While from a theoretical point of view, this may constitute the lowest possible quantum requirement, from a pragmatic point of view, generation of such states to be sent along long distances can never be achieved perfectly. We introduce the concept of ϵ blindness for UBQC, in analogy to the concept of ϵ security developed for other cryptographic protocols, allowing us to characterize the robustness and security properties of the protocol under possible imperfections. We also present a remote blind single qubit preparation protocol with weak coherent pulses for the client to prepare, in a delegated fashion, quantum states arbitrarily close to perfect random single qubit states. This allows us to efficiently achieve ϵ-blind UBQC for any ϵ>0, even if the channel between the client and the server is arbitrarily lossy.

  2. Simulations of Probabilities for Quantum Computing

    NASA Technical Reports Server (NTRS)

    Zak, M.

    1996-01-01

    It has been demonstrated that classical probabilities, and in particular, probabilistic Turing machine, can be simulated by combining chaos and non-LIpschitz dynamics, without utilization of any man-made devices (such as random number generators). Self-organizing properties of systems coupling simulated and calculated probabilities and their link to quantum computations are discussed.

  3. Quantum computation with Turaev-Viro codes

    SciTech Connect

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

    2010-12-15

    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.

  4. The quantum computer game: citizen science

    NASA Astrophysics Data System (ADS)

    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.

  5. Optically Driven Spin Based Quantum Dots for Quantum Computing

    DTIC Science & Technology

    2008-01-01

    system approach to quantum optics, Lecture Notes in Physics (Springer, Berlin, 1993). [5] H. M. Wiseman and G. J. Milburn, Phys. Rev. Lett. 70, 548 (1993...Electrical Engineering and Computer Science Department of Physics Harrison M. Randall Laboratory of Physics The University of Michigan Ann Arbor, MI...48109 Phone: 734-764-4469 Email: dst@umich.edu Co-Principal Investigator: L.J. Sham Department of Physics The University of California – San

  6. Deterministic quantum computation with one photonic qubit

    NASA Astrophysics Data System (ADS)

    Hor-Meyll, M.; Tasca, D. S.; Walborn, S. P.; Ribeiro, P. H. Souto; Santos, M. M.; Duzzioni, E. I.

    2015-07-01

    We show that deterministic quantum computing with one qubit (DQC1) can be experimentally implemented with a spatial light modulator, using the polarization and the transverse spatial degrees of freedom of light. The scheme allows the computation of the trace of a high-dimension matrix, being limited by the resolution of the modulator panel and the technical imperfections. In order to illustrate the method, we compute the normalized trace of unitary matrices and implement the Deutsch-Jozsa algorithm. The largest matrix that can be manipulated with our setup is 1080 ×1920 , which is able to represent a system with approximately 21 qubits.

  7. Scheme for Quantum Computing Immune to Decoherence

    NASA Technical Reports Server (NTRS)

    Williams, Colin; Vatan, Farrokh

    2008-01-01

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

  8. Adiabatic cluster-state quantum computing

    SciTech Connect

    Bacon, Dave; Flammia, Steven T.

    2010-09-15

    Models of quantum computation (QC) are important because they change the physical requirements for achieving universal QC. For example, one-way QC requires the preparation of an entangled ''cluster'' state, followed by adaptive measurement on this state, a set of requirements which is different from the standard quantum-circuit model. Here we introduce a model based on one-way QC but without measurements (except for the final readout), instead using adiabatic deformation of a Hamiltonian whose initial ground state is the cluster state. Our results could help increase the feasibility of adiabatic schemes by using tools from one-way QC.

  9. Efficient quantum computing using coherent photon conversion.

    PubMed

    Langford, N K; Ramelow, S; Prevedel, R; Munro, W J; Milburn, G J; Zeilinger, A

    2011-10-12

    Single photons are excellent quantum information carriers: they were used in the earliest demonstrations of entanglement and in the production of the highest-quality entanglement reported so far. However, current schemes for preparing, processing and measuring them are inefficient. For example, down-conversion provides heralded, but randomly timed, single photons, and linear optics gates are inherently probabilistic. Here we introduce a deterministic process--coherent photon conversion (CPC)--that provides a new way to generate and process complex, multiquanta states for photonic quantum information applications. The technique uses classically pumped nonlinearities to induce coherent oscillations between orthogonal states of multiple quantum excitations. One example of CPC, based on a pumped four-wave-mixing interaction, is shown to yield a single, versatile process that provides a full set of photonic quantum processing tools. This set satisfies the DiVincenzo criteria for a scalable quantum computing architecture, including deterministic multiqubit entanglement gates (based on a novel form of photon-photon interaction), high-quality heralded single- and multiphoton states free from higher-order imperfections, and robust, high-efficiency detection. It can also be used to produce heralded multiphoton entanglement, create optically switchable quantum circuits and implement an improved form of down-conversion with reduced higher-order effects. Such tools are valuable building blocks for many quantum-enabled technologies. Finally, using photonic crystal fibres we experimentally demonstrate quantum correlations arising from a four-colour nonlinear process suitable for CPC and use these measurements to study the feasibility of reaching the deterministic regime with current technology. Our scheme, which is based on interacting bosonic fields, is not restricted to optical systems but could also be implemented in optomechanical, electromechanical and superconducting

  10. Ion Trap Quantum Computers: Performance Limits and Experimental Progress

    NASA Astrophysics Data System (ADS)

    Hughes, Richard

    1998-03-01

    In a quantum computer information would be represented by the quantum mechanical states of suitable atomic-scale systems. (A single bit of information represented by a two-level quantum system is known as a qubit.) This notion leads to the possibility of computing with quantum mechanical superpositions of numbers ("quantum parallelism"), which for certain problems would make Quantum/quantum.html>quantum computation very much more efficient than classical computation. The possibility of rapidly factoring the large integers used in public-key cryptography is an important example. (Public key cryptosystems derive their security from the difficuty of factoring, and similar problems, with conventional computers.) Quantum computational hardware development is in its infancy, but an experimental study of quantum computation with laser-cooled trapped calcium ions that is under way at Los Alamos will be described. One of the pricipal obstacles to practical quantum computation is the inevitable loss of quantum coherence of the complex quantum states involved. The results of a theoretical analysis showing that quantum factoring of small integers should be possible with trapped ions will be presented. The prospects for larger-scale computations will be discussed.

  11. Quantum computing gates via optimal control

    NASA Astrophysics Data System (ADS)

    Atia, Yosi; Elias, Yuval; Mor, Tal; Weinstein, Yossi

    2014-10-01

    We demonstrate the use of optimal control to design two entropy-manipulating quantum gates which are more complex than the corresponding, commonly used, gates, such as CNOT and Toffoli (CCNOT): A two-qubit gate called polarization exchange (PE) and a three-qubit gate called polarization compression (COMP) were designed using GRAPE, an optimal control algorithm. Both gates were designed for a three-spin system. Our design provided efficient and robust nuclear magnetic resonance (NMR) radio frequency (RF) pulses for 13C2-trichloroethylene (TCE), our chosen three-spin system. We then experimentally applied these two quantum gates onto TCE at the NMR lab. Such design of these gates and others could be relevant for near-future applications of quantum computing devices.

  12. Quantum computation: algorithms and implementation in quantum dot devices

    NASA Astrophysics Data System (ADS)

    Gamble, John King

    In this thesis, we explore several aspects of both the software and hardware of quantum computation. First, we examine the computational power of multi-particle quantum random walks in terms of distinguishing mathematical graphs. We study both interacting and non-interacting multi-particle walks on strongly regular graphs, proving some limitations on distinguishing powers and presenting extensive numerical evidence indicative of interactions providing more distinguishing power. We then study the recently proposed adiabatic quantum algorithm for Google PageRank, and show that it exhibits power-law scaling for realistic WWW-like graphs. Turning to hardware, we next analyze the thermal physics of two nearby 2D electron gas (2DEG), and show that an analogue of the Coulomb drag effect exists for heat transfer. In some distance and temperature, this heat transfer is more significant than phonon dissipation channels. After that, we study the dephasing of two-electron states in a single silicon quantum dot. Specifically, we consider dephasing due to the electron-phonon coupling and charge noise, separately treating orbital and valley excitations. In an ideal system, dephasing due to charge noise is strongly suppressed due to a vanishing dipole moment. However, introduction of disorder or anharmonicity leads to large effective dipole moments, and hence possibly strong dephasing. Building on this work, we next consider more realistic systems, including structural disorder systems. We present experiment and theory, which demonstrate energy levels that vary with quantum dot translation, implying a structurally disordered system. Finally, we turn to the issues of valley mixing and valley-orbit hybridization, which occurs due to atomic-scale disorder at quantum well interfaces. We develop a new theoretical approach to study these effects, which we name the disorder-expansion technique. We demonstrate that this method successfully reproduces atomistic tight-binding techniques

  13. Dual-code quantum computation model

    NASA Astrophysics Data System (ADS)

    Choi, Byung-Soo

    2015-08-01

    In this work, we propose the dual-code quantum computation model—a fault-tolerant quantum computation scheme which alternates between two different quantum error-correction codes. Since the chosen two codes have different sets of transversal gates, we can implement a universal set of gates transversally, thereby reducing the overall cost. We use code teleportation to convert between quantum states in different codes. The overall cost is decreased if code teleportation requires fewer resources than the fault-tolerant implementation of the non-transversal gate in a specific code. To analyze the cost reduction, we investigate two cases with different base codes, namely the Steane and Bacon-Shor codes. For the Steane code, neither the proposed dual-code model nor another variation of it achieves any cost reduction since the conventional approach is simple. For the Bacon-Shor code, the three proposed variations of the dual-code model reduce the overall cost. However, as the encoding level increases, the cost reduction decreases and becomes negative. Therefore, the proposed dual-code model is advantageous only when the encoding level is low and the cost of the non-transversal gate is relatively high.

  14. Applications of computational quantum mechanics

    NASA Astrophysics Data System (ADS)

    Temel, Burcin

    This original research dissertation is composed of a new numerical technique based on Chebyshev polynomials that is applied on scattering problems, a phenomenological kinetics study for CO oxidation on RuO2 surface, and an experimental study on methanol coupling with doped metal oxide catalysts. Minimum Error Method (MEM), a least-squares minimization method, provides an efficient and accurate alternative to solve systems of ordinary differential equations. Existing methods usually utilize matrix methods which are computationally costful. MEM, which is based on the Chebyshev polynomials as a basis set, uses the recursion relationships and fast Chebyshev transforms which scale as O(N). For large basis set calculations this provides an enormous computational efficiency in the calculations. Chebyshev polynomials are also able to represent non-periodic problems very accurately. We applied MEM on elastic and inelastic scattering problems: it is more efficient and accurate than traditionally used Kohn variational principle, and it also provides the wave function in the interaction region. Phenomenological kinetics (PK) is widely used in industry to predict the optimum conditions for a chemical reaction. PK neglects the fluctuations, assumes no lateral interactions, and considers an ideal mix of reactants. The rate equations are tested by fitting the rate constants to the results of the experiments. Unfortunately, there are numerous examples where a fitted mechanism was later shown to be erroneous. We have undertaken a thorough comparison between the phenomenological equations and the results of kinetic Monte Carlo (KMC) simulations performed on the same system. The PK equations are qualitatively consistent with the KMC results but are quantitatively erroneous as a result of interplays between the adsorption and desorption events. The experimental study on methanol coupling with doped metal oxide catalysts demonstrates the doped metal oxides as a new class of catalysts

  15. Scalable quantum computer architecture with coupled donor-quantum dot qubits

    DOEpatents

    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.

  16. Universal quantum gates for Single Cooper Pair Box based quantum computing

    NASA Technical Reports Server (NTRS)

    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.

  17. Hierarchy of Efficiently Computable and Faithful Lower Bounds to Quantum Discord.

    PubMed

    Piani, Marco

    2016-08-19

    Quantum discord expresses a fundamental nonclassicality of correlations that is more general than entanglement, but that, in its standard definition, is not easily evaluated. We derive a hierarchy of computationally efficient lower bounds to the standard quantum discord. Every nontrivial element of the hierarchy constitutes by itself a valid discordlike measure, based on a fundamental feature of quantum correlations: their lack of shareability. Our approach emphasizes how the difference between entanglement and discord depends on whether shareability is intended as a static property or as a dynamical process.

  18. Quantum computation architecture using optical tweezers

    SciTech Connect

    Weitenberg, Christof; Kuhr, Stefan; Moelmer, Klaus; Sherson, Jacob F.

    2011-09-15

    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 require the transport of atoms to neighboring sites. We numerically optimize the nonadiabatic transport of the atoms through the lattice and the intensity ramps of the optical tweezer in order to maximize the gate fidelities. We find overall gate times of a few 100 {mu}s, while keeping the error probability due to vibrational excitations and spontaneous scattering below 10{sup -3}. The requirements on the positioning error and intensity noise of the optical tweezer and the magnetic field stability are analyzed and we show that atoms in optical lattices could meet the requirements for fault-tolerant scalable quantum computing.

  19. Non-unitary probabilistic quantum computing circuit and method

    NASA Technical Reports Server (NTRS)

    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.

  20. Universal quantum computation with metaplectic anyons

    SciTech Connect

    Cui, Shawn X.; Wang, Zhenghan E-mail: zhenghwa@microsoft.com

    2015-03-15

    We show that braidings of the metaplectic anyons X{sub ϵ} in SO(3){sub 2} = SU(2){sub 4} with their total charge equal to the metaplectic mode Y supplemented with projective measurements of the total charge of two metaplectic anyons are universal for quantum computation. We conjecture that similar universal anyonic computing models can be constructed for all metaplectic anyon systems SO(p){sub 2} for any odd prime p ≥ 5. In order to prove universality, we find new conceptually appealing universal gate sets for qutrits and qupits.

  1. PREFACE: Quantum Information, Communication, Computation and Cryptography

    NASA Astrophysics Data System (ADS)

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

    2007-07-01

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

  2. Hard chaos, quantum billiards, and quantum dot computers

    SciTech Connect

    Mainieri, R.; Cvitanovic, P.; Hasslacher, B.

    1996-07-01

    This is the final report of a three-year, Laboratory-Directed Research and Development (LDRD) project at the Los Alamos National Laboratory (LANL). Research was performed in analytic and computational techniques for dealing with hard chaos, especially the powerful tool of cycle expansions. This work has direct application to the understanding of electrons in nanodevices, such as junctions of quantum wires, or in arrays of dots or antidots. We developed a series of techniques for computing the properties of quantum systems with hard chaos, in particular the flow of electrons through nanodevices. These techniques are providing the insight and tools to design computers with nanoscale components. Recent efforts concentrated on understanding the effects of noise and orbit pruning in chaotic dynamical systems. We showed that most complicated chaotic systems (not just those equivalent to a finite shift) will develop branch points in their cycle expansion. Once the singularity is known to exist, it can be removed with a dramatic increase in the speed of convergence of quantities of physical interest.

  3. Symmetrically private information retrieval based on blind quantum computing

    NASA Astrophysics Data System (ADS)

    Sun, Zhiwei; Yu, Jianping; Wang, Ping; Xu, Lingling

    2015-05-01

    Universal blind quantum computation (UBQC) is a new secure quantum computing protocol which allows a user Alice who does not have any sophisticated quantum technology to delegate her computing to a server Bob without leaking any privacy. Using the features of UBQC, we propose a protocol to achieve symmetrically private information retrieval, which allows a quantum limited Alice to query an item from Bob with a fully fledged quantum computer; meanwhile, the privacy of both parties is preserved. The security of our protocol is based on the assumption that malicious Alice has no quantum computer, which avoids the impossibility proof of Lo. For the honest Alice, she is almost classical and only requires minimal quantum resources to carry out the proposed protocol. Therefore, she does not need any expensive laboratory which can maintain the coherence of complicated quantum experimental setups.

  4. Software Systems for High-performance Quantum Computing

    SciTech Connect

    Humble, Travis S; Britt, Keith A

    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.

  5. Quantum computation over the butterfly network

    SciTech Connect

    Soeda, Akihito; Kinjo, Yoshiyuki; Turner, Peter S.; Murao, Mio

    2011-07-15

    In order to investigate distributed quantum computation under restricted network resources, we introduce a quantum computation task over the butterfly network where both quantum and classical communications are limited. We consider deterministically performing a two-qubit global unitary operation on two unknown inputs given at different nodes, with outputs at two distinct nodes. By using a particular resource setting introduced by M. Hayashi [Phys. Rev. A 76, 040301(R) (2007)], which is capable of performing a swap operation by adding two maximally entangled qubits (ebits) between the two input nodes, we show that unitary operations can be performed without adding any entanglement resource, if and only if the unitary operations are locally unitary equivalent to controlled unitary operations. Our protocol is optimal in the sense that the unitary operations cannot be implemented if we relax the specifications of any of the channels. We also construct protocols for performing controlled traceless unitary operations with a 1-ebit resource and for performing global Clifford operations with a 2-ebit resource.

  6. Milestones Toward Majorana-Based Quantum Computing

    NASA Astrophysics Data System (ADS)

    Aasen, David; Hell, Michael; Mishmash, Ryan V.; Higginbotham, Andrew; Danon, Jeroen; Leijnse, Martin; Jespersen, Thomas S.; Folk, Joshua A.; Marcus, Charles M.; Flensberg, Karsten; Alicea, Jason

    2016-07-01

    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.

  7. Minimal computational-space implementation of multiround quantum protocols

    SciTech Connect

    Bisio, Alessandro; D'Ariano, Giacomo Mauro; Perinotti, Paolo; Chiribella, Giulio

    2011-02-15

    A single-party strategy in a multiround quantum protocol can be implemented by sequential networks of quantum operations connected by internal memories. Here, we provide an efficient realization in terms of computational-space resources.

  8. Semiquantum key distribution with secure delegated quantum computation.

    PubMed

    Li, Qin; Chan, Wai Hong; Zhang, Shengyu

    2016-01-27

    Semiquantum key distribution allows a quantum party to share a random key with a "classical" party who only can prepare and measure qubits in the computational basis or reorder some qubits when he has access to a quantum channel. In this work, we present a protocol where a secret key can be established between a quantum user and an almost classical user who only needs the quantum ability to access quantum channels, by securely delegating quantum computation to a quantum server. We show the proposed protocol is robust even when the delegated quantum server is a powerful adversary, and is experimentally feasible with current technology. As one party of our protocol is the most quantum-resource efficient, it can be more practical and significantly widen the applicability scope of quantum key distribution.

  9. Semiquantum key distribution with secure delegated quantum computation

    PubMed Central

    Li, Qin; Chan, Wai Hong; Zhang, Shengyu

    2016-01-01

    Semiquantum key distribution allows a quantum party to share a random key with a “classical” party who only can prepare and measure qubits in the computational basis or reorder some qubits when he has access to a quantum channel. In this work, we present a protocol where a secret key can be established between a quantum user and an almost classical user who only needs the quantum ability to access quantum channels, by securely delegating quantum computation to a quantum server. We show the proposed protocol is robust even when the delegated quantum server is a powerful adversary, and is experimentally feasible with current technology. As one party of our protocol is the most quantum-resource efficient, it can be more practical and significantly widen the applicability scope of quantum key distribution. PMID:26813384

  10. Homomorphic encryption experiments on IBM's cloud quantum computing platform

    NASA Astrophysics Data System (ADS)

    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.

  11. One-way quantum computing in the optical frequency comb.

    PubMed

    Menicucci, Nicolas C; Flammia, Steven T; Pfister, Olivier

    2008-09-26

    One-way quantum computing allows any quantum algorithm to be implemented easily using just measurements. The difficult part is creating the universal resource, a cluster state, on which the measurements are made. We propose a scalable method that uses a single, multimode optical parametric oscillator (OPO). The method is very efficient and generates a continuous-variable cluster state, universal for quantum computation, with quantum information encoded in the quadratures of the optical frequency comb of the OPO.

  12. Measurement-only verifiable blind quantum computing with quantum input verification

    NASA Astrophysics Data System (ADS)

    Morimae, Tomoyuki

    2016-10-01

    Verifiable blind quantum computing is a secure delegated quantum computing where a client with a limited quantum technology delegates her quantum computing to a server who has a universal quantum computer. The client's privacy is protected (blindness), and the correctness of the computation is verifiable by the client despite her limited quantum technology (verifiability). There are mainly two types of protocols for verifiable blind quantum computing: the protocol where the client has only to generate single-qubit states and the protocol where the client needs only the ability of single-qubit measurements. The latter is called the measurement-only verifiable blind quantum computing. If the input of the client's quantum computing is a quantum state, whose classical efficient description is not known to the client, there was no way for the measurement-only client to verify the correctness of the input. Here we introduce a protocol of measurement-only verifiable blind quantum computing where the correctness of the quantum input is also verifiable.

  13. Decoherence in a scalable adiabatic quantum computer

    SciTech Connect

    Ashhab, S.; Johansson, J. R.; Nori, Franco

    2006-11-15

    We consider the effects of decoherence on Landau-Zener crossings encountered in a large-scale adiabatic-quantum-computing setup. We analyze the dependence of the success probability--i.e., the probability for the system to end up in its new ground state--on the noise amplitude and correlation time. We determine the optimal sweep rate that is required to maximize the success probability. We then discuss the scaling of decoherence effects with increasing system size. We find that those effects can be important for large systems, even if they are small for each of the small building blocks.

  14. A measurement-based X-ray source model characterization for CT dosimetry computations.

    PubMed

    Sommerville, Mitchell; Poirier, Yannick; Tambasco, Mauro

    2015-11-01

    The purpose of this study was to show that the nominal peak tube voltage potential (kVp) and measured half-value layer (HVL) can be used to generate energy spectra and fluence profiles for characterizing a computed tomography (CT) X-ray source, and to validate the source model and an in-house kV X-ray dose computation algorithm (kVDoseCalc) for computing machine- and patient-specific CT dose. Spatial variation of the X-ray source spectra of a Philips Brilliance and a GE Optima Big Bore CT scanner were found by measuring the HVL along the direction of the internal bow-tie filter axes. Third-party software, Spektr, and the nominal kVp settings were used to generate the energy spectra. Beam fluence was calculated by dividing the integral product of the spectra and the in-air NIST mass-energy attenuation coefficients by in-air dose measurements along the filter axis. The authors found the optimal number of photons to seed in kVDoseCalc to achieve dose convergence. The Philips Brilliance beams were modeled for 90, 120, and 140 kVp tube settings. The GE Optima beams were modeled for 80, 100, 120, and 140 kVp tube settings. Relative doses measured using a Capintec Farmer-type ionization chamber (0.65 cc) placed in a cylindrical polymethyl methacrylate (PMMA) phantom and irradiated by the Philips Brilliance, were compared to those computed with kVDoseCalc. Relative doses in an anthropomorphic thorax phantom (E2E SBRT Phantom) irradiated by the GE Optima were measured using a (0.015 cc) PTW Freiburg ionization chamber and compared to computations from kVDoseCalc. The number of photons required to reduce the average statistical uncertainty in dose to <0.3% was 2×105. The average percent difference between calculation and measurement over all 12 PMMA phantom positions was found to be 1.44%, 1.47%, and 1.41% for 90, 120, and 140 kVp, respectively. The maximum percent difference between calculation and measurement for all energies, measurement positions, and phantoms was less

  15. A measurement-based X-ray source model characterization for CT dosimetry computations.

    PubMed

    Sommerville, Mitchell; Poirier, Yannick; Tambasco, Mauro

    2015-11-08

    The purpose of this study was to show that the nominal peak tube voltage potential (kVp) and measured half-value layer (HVL) can be used to generate energy spectra and fluence profiles for characterizing a computed tomography (CT) X-ray source, and to validate the source model and an in-house kV X-ray dose computation algorithm (kVDoseCalc) for computing machine- and patient-specific CT dose. Spatial variation of the X-ray source spectra of a Philips Brilliance and a GE Optima Big Bore CT scanner were found by measuring the HVL along the direction of the internal bow-tie filter axes. Third-party software, Spektr, and the nominal kVp settings were used to generate the energy spectra. Beam fluence was calculated by dividing the integral product of the spectra and the in-air NIST mass-energy attenuation coefficients by in-air dose measurements along the filter axis. The authors found the optimal number of photons to seed in kVDoseCalc to achieve dose convergence. The Philips Brilliance beams were modeled for 90, 120, and 140 kVp tube settings. The GE Optima beams were modeled for 80, 100, 120, and 140 kVp tube settings. Relative doses measured using a Capintec Farmer-type ionization chamber (0.65 cc) placed in a cylindrical polymethyl methacrylate (PMMA) phantom and irradiated by the Philips Brilliance, were compared to those computed with kVDoseCalc. Relative doses in an anthropomorphic thorax phantom (E2E SBRT Phantom) irradiated by the GE Optima were measured using a (0.015 cc) PTW Freiburg ionization chamber and compared to computations from kVDoseCalc. The number of photons required to reduce the average statistical uncertainty in dose to < 0.3% was 2 × 105. The average percent difference between calculation and measurement over all 12 PMMA phantom positions was found to be 1.44%, 1.47%, and 1.41% for 90, 120, and 140 kVp, respectively. The maximum percent difference between calculation and measurement for all energies, measurement positions, and phantoms was

  16. Verification for measurement-only blind quantum computing

    NASA Astrophysics Data System (ADS)

    Morimae, Tomoyuki

    2014-06-01

    Blind quantum computing is a new secure quantum computing protocol where a client who does not have any sophisticated quantum technology can delegate her quantum computing to a server without leaking any privacy. It is known that a client who has only a measurement device can perform blind quantum computing [T. Morimae and K. Fujii, Phys. Rev. A 87, 050301(R) (2013), 10.1103/PhysRevA.87.050301]. It has been an open problem whether the protocol can enjoy the verification, i.e., the ability of the client to check the correctness of the computing. In this paper, we propose a protocol of verification for the measurement-only blind quantum computing.

  17. Quantum computing accelerator I/O : LDRD 52750 final report.

    SciTech Connect

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

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

  18. A Telemetric system for electromagnetic measurements based on Internet technologies and cloud computing

    NASA Astrophysics Data System (ADS)

    Tassoulas, E.; Vereses, A.; Agiakatsikas, D.; Koulouras, Gr.; Nomicos, C.

    2010-05-01

    A few years ago, real time communication, data collection and transmission from a field station measuring electromagnetic variations in the middle of nowhere, was a very expensive accomplishment. Nowadays, wireless communications and Internet access reach end users much easier and they are less expensive. WIFI, GPRS, 3G or Satellite Internet connections enable this to come true even at the most detached areas of our world where no cables can easily reach at a low cost. Except for the effective potential range, these communication technologies can also give high speed, constant and low cost Internet access. As the Internet access speeds grow, a new term is coming to the foreground. Cloud Computing. The terminology of Cloud Computing refers to a wide subset of Internet technologies usage that the clients: A)Do not need to store any valuable information in any physical infrastructure owned by themselves. B)Consume on-line resources from a third party provider, enabling them to focus on their productivity without having to worry about their data or any other possible local hardware failure. C)Collaborate and share between associates faster and easier, as they can access their work from anywhere, just with the existence of Internet access. This telemetric system, relies on Cloud Computing for the delivery of collected data from the field station to an on-line storage. Collaborators and scientists, can be synchronized with the on-line storage, make changes and synchronize vice versa. Local storage at the field station end, is only needed in the case of an Internet connection failure, so that the data can be stored until the Internet connection is regained. Local storage at the user's side is optional, however desirable thus giving the ability to work off-line and synchronize again the changes when one goes on-line.

  19. Experimental Implementation of Efficient Linear Optics Quantum Computation

    DTIC Science & Technology

    2007-11-02

    Experimental Implementation of Efficient Linear Optics Quantum Computation Final Report G. J. Milburn, T. C. Ralph, and A. G. White University of...Queensland, Australia 1. Statement of Problem. One of the earliest proposals [1] for implementing quantum computation was based on encoding...containing few photons. In 2001 Knill, Laflamme and Milburn (KLM) found a way to circumvent this restriction and implement efficient quantum computation

  20. Control aspects of quantum computing using pure and mixed states.

    PubMed

    Schulte-Herbrüggen, Thomas; Marx, Raimund; Fahmy, Amr; Kauffman, Louis; Lomonaco, Samuel; Khaneja, Navin; Glaser, Steffen J

    2012-10-13

    Steering quantum dynamics such that the target states solve classically hard problems is paramount to quantum simulation and computation. And beyond, quantum control is also essential to pave the way to quantum technologies. Here, important control techniques are reviewed and presented in a unified frame covering quantum computational gate synthesis and spectroscopic state transfer alike. We emphasize that it does not matter whether the quantum states of interest are pure or not. While pure states underly the design of quantum circuits, ensemble mixtures of quantum states can be exploited in a more recent class of algorithms: it is illustrated by characterizing the Jones polynomial in order to distinguish between different (classes of) knots. Further applications include Josephson elements, cavity grids, ion traps and nitrogen vacancy centres in scenarios of closed as well as open quantum systems.

  1. Modeling fluid dynamics on type II quantum computers

    NASA Astrophysics Data System (ADS)

    Scoville, James; Weeks, David; Yepez, Jeffrey

    2006-03-01

    A quantum algorithm is presented for modeling the time evolution of density and flow fields governed by classical equations, such as the diffusion equation, the nonlinear Burgers equation, and the damped wave equation. The algorithm is intended to run on a type-II quantum computer, a parallel quantum computer consisting of a lattice of small type I quantum computers undergoing unitary evolution and interacting via information interchanges represented by an orthogonal matrices. Information is effectively transferred between adjacent quantum computers over classical communications channels because of controlled state demolition following local quantum mechanical qubit-qubit interactions within each quantum computer. The type-II quantum algorithm presented in this paper describes a methodology for generating quantum logic operations as a generalization of classical operations associated with finite-point group symmetries. The quantum mechanical evolution of multiple qubits within each node is described. Presented is a proof that the parallel quantum system obeys a finite-difference quantum Boltzman equation at the mesoscopic scale, leading in turn to various classical linear and nonlinear effective field theories at the macroscopic scale depending on the details of the local qubit-qubit interactions.

  2. Multiple network alignment on quantum computers

    NASA Astrophysics Data System (ADS)

    Daskin, Anmer; Grama, Ananth; Kais, Sabre

    2014-12-01

    Comparative analyses of graph-structured datasets underly diverse problems. Examples of these problems include identification of conserved functional components (biochemical interactions) across species, structural similarity of large biomolecules, and recurring patterns of interactions in social networks. A large class of such analyses methods quantify the topological similarity of nodes across networks. The resulting correspondence of nodes across networks, also called node alignment, can be used to identify invariant subgraphs across the input graphs. Given graphs as input, alignment algorithms use topological information to assign a similarity score to each -tuple of nodes, with elements (nodes) drawn from each of the input graphs. Nodes are considered similar if their neighbors are also similar. An alternate, equivalent view of these network alignment algorithms is to consider the Kronecker product of the input graphs and to identify high-ranked nodes in the Kronecker product graph. Conventional methods such as PageRank and HITS (Hypertext-Induced Topic Selection) can be used for this purpose. These methods typically require computation of the principal eigenvector of a suitably modified Kronecker product matrix of the input graphs. We adopt this alternate view of the problem to address the problem of multiple network alignment. Using the phase estimation algorithm, we show that the multiple network alignment problem can be efficiently solved on quantum computers. We characterize the accuracy and performance of our method and show that it can deliver exponential speedups over conventional (non-quantum) methods.

  3. NMR quantum computation with optically polarized molecules

    NASA Astrophysics Data System (ADS)

    Verhulst, Anne; Yannoni, Constantino; Sherwood, Mark; Pomerantz, Drew; Vandersypen, Lieven; Chuang, Isaac

    2000-03-01

    Current methods for bulk NMR quantum computation rely on nuclear spin polarization present at high temperature equilibrium. This presents a challenging obstacle as the probability to find a spin in a specific state decreases exponentially in the number of spins used as qubits, causing a corresponding decrease in the signal to noise ratio of the desired NMR signal. One way to address this problem is to provide an artificial source of high polarization, such as optically pumped ^129Xe. For comparison, thermal equilibrium polarizations are only about 10-3% for ^1H in a typical NMR experiment at room temperature and in a 10 Tesla magnetic field, but with ^129Xe polarizations as high as 18% have been achieved [Happer et. al., Chem.Phys.Lett., 284, p.87-92, Feb 1998]. Using this technique, we prepare hyperpolarized liquid Xe and use it as a solvent for chloroform molecules (CHCl_3). Cross polarization (SPINOE) between ^129Xe and ^1H results in measured enhancements of the proton signal of over 300%, and evidence of transfer to ^13C. These results provide hope for the scalability of quantum computation.

  4. Measurement-only topological quantum computation via anyonic interferometry

    SciTech Connect

    Bonderson, Parsa Freedman, Michael Nayak, Chetan

    2009-04-15

    We describe measurement-only topological quantum computation using both projective and interferometrical measurement of topological charge. We demonstrate how anyonic teleportation can be achieved using 'forced measurement' protocols for both types of measurement. Using this, it is shown how topological charge measurements can be used to generate the braiding transformations used in topological quantum computation, and hence that the physical transportation of computational anyons is unnecessary. We give a detailed discussion of the anyonics for implementation of topological quantum computation (particularly, using the measurement-only approach) in fractional quantum Hall systems.

  5. A quantum computer on the basis of an atomic quantum transistor with built-in quantum memory

    NASA Astrophysics Data System (ADS)

    Moiseev, S. A.; Andrianov, S. N.

    2016-12-01

    A quantum transistor based quantum computer where the multiqubit quantum memory is a component of the quantum transistor and, correspondingly, takes part in the performance of quantum logical operations is considered. Proceeding from the generalized Jaynes-Cummings model, equations for coefficients of the wave function of the quantum system under consideration have been obtained for different stages of its evolution in processes of performing logical operations. The solution of the system of equations allows one to establish requirements that are imposed on the parameters of the initial Hamiltonian and must be satisfied for the effective operation of the computer; it also demonstrates the possibility of a universal set of quantum operations. Thus, based on the proposed approach, the possibility of constructing a compact multiatomic ensemble based on quantum computer using a quantum transistor for the implementation of two-qubit gates has been demonstrated.

  6. Quantum computing with Josephson junction circuits

    NASA Astrophysics Data System (ADS)

    Xu, Huizhong

    This work concerns the study of Josephson junction circuits in the context of their usability for quantum computing. The zero-voltage state of a current-biased Josephson junction has a set of metastable quantum energy levels. If a junction is well isolated from its environment, it will be possible to use the two lowest states as a qubit in a quantum computer. I first examine the meaning of isolation theoretically. Using a master equation, I analyzed the effect of dissipation on escape rates and suggested a simple method, population depletion technique, to measure the relaxation time (T1). Using a stochastic Bloch equation to analyze the dependence of microwave resonance peak width on current noise, I found decoherence due to current noise depends on the noise spectrum. For high frequency noise with a cutoff frequency fc much larger than 1/T1, I found decoherence due to noise can be described by a dephasing rate that is proportional to the noise spectral density. However, for low frequency noise such that its cutoff frequency fc is much smaller than 1/T 1, decoherence due to noise depends on the total rms current noise. I then analyze and test a few qubit isolation schemes, including resistive isolation, inductor-capacitor (LC) isolation, half-wavelength resonant isolation and inductor-junction (LJ) isolation. I found the resistive isolation scheme has a severe heating problem. Macroscopic quantum tunneling and energy level quantization were observed in the LC isolated Nb/AlOx/Nb and AL/ALOx/Al junction qubits at 25 mK. Relaxation times of 4--12 ns and spectroscopic coherence times of 1--3 ns were obtained for these LC isolated qubits. I found the half-wavelength isolated junction qubit has a relaxation time of about 20 ns measured by the population-depletion techniques, but no energy levels were observed in this qubit. Experimental results suggest the LJ isolated qubit has a longer relaxation and coherence times than all my previously examined samples. Using a

  7. Fast quantum computation at arbitrarily low energy

    NASA Astrophysics Data System (ADS)

    Jordan, Stephen P.

    2017-03-01

    One version of the energy-time uncertainty principle states that the minimum time T⊥ for a quantum system to evolve from a given state to any orthogonal state is h /(4 Δ E ) , where Δ E is the energy uncertainty. A related bound called the Margolus-Levitin theorem states that T⊥≥h /(2 ) , where is the expectation value of energy and the ground energy is taken to be zero. Many subsequent works have interpreted T⊥ as defining a minimal time for an elementary computational operation and correspondingly a fundamental limit on clock speed determined by a system's energy. Here we present local time-independent Hamiltonians in which computational clock speed becomes arbitrarily large relative to and Δ E as the number of computational steps goes to infinity. We argue that energy considerations alone are not sufficient to obtain an upper bound on computational speed, and that additional physical assumptions such as limits to information density and information transmission speed are necessary to obtain such a bound.

  8. Preparing projected entangled pair states on a quantum computer.

    PubMed

    Schwarz, Martin; Temme, Kristan; Verstraete, Frank

    2012-03-16

    We present a quantum algorithm to prepare injective projected entangled pair states (PEPS) on a quantum computer, a class of open tensor networks representing quantum states. The run time of our algorithm scales polynomially with the inverse of the minimum condition number of the PEPS projectors and, essentially, with the inverse of the spectral gap of the PEPS's parent Hamiltonian.

  9. Computer Visualization of Many-Particle Quantum Dynamics

    SciTech Connect

    Ozhigov, A. Y.

    2009-03-10

    In this paper I show the importance of computer visualization in researching of many-particle quantum dynamics. Such a visualization becomes an indispensable illustrative tool for understanding the behavior of dynamic swarm-based quantum systems. It is also an important component of the corresponding simulation framework, and can simplify the studies of underlying algorithms for multi-particle quantum systems.

  10. Heterotic quantum and classical computing on convergence spaces

    NASA Astrophysics Data System (ADS)

    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.

  11. Topological quantum computation--from basic concepts to first experiments.

    PubMed

    Stern, Ady; Lindner, Netanel H

    2013-03-08

    Quantum computation requires controlled engineering of quantum states to perform tasks that go beyond those possible with classical computers. Topological quantum computation aims to achieve this goal by using non-Abelian quantum phases of matter. Such phases allow for quantum information to be stored and manipulated in a nonlocal manner, which protects it from imperfections in the implemented protocols and from interactions with the environment. Recently, substantial progress in this field has been made on both theoretical and experimental fronts. We review the basic concepts of non-Abelian phases and their topologically protected use in quantum information processing tasks. We discuss different possible realizations of these concepts in experimentally available solid-state systems, including systems hosting Majorana fermions, their recently proposed fractional counterparts, and non-Abelian quantum Hall states.

  12. QCMPI: A parallel environment for quantum computing

    NASA Astrophysics Data System (ADS)

    Tabakin, Frank; Juliá-Díaz, Bruno

    2009-06-01

    QCMPI is a quantum computer (QC) simulation package written in Fortran 90 with parallel processing capabilities. It is an accessible research tool that permits rapid evaluation of quantum algorithms for a large number of qubits and for various "noise" scenarios. The prime motivation for developing QCMPI is to facilitate numerical examination of not only how QC algorithms work, but also to include noise, decoherence, and attenuation effects and to evaluate the efficacy of error correction schemes. The present work builds on an earlier Mathematica code QDENSITY, which is mainly a pedagogic tool. In that earlier work, although the density matrix formulation was featured, the description using state vectors was also provided. In QCMPI, the stress is on state vectors, in order to employ a large number of qubits. The parallel processing feature is implemented by using the Message-Passing Interface (MPI) protocol. A description of how to spread the wave function components over many processors is provided, along with how to efficiently describe the action of general one- and two-qubit operators on these state vectors. These operators include the standard Pauli, Hadamard, CNOT and CPHASE gates and also Quantum Fourier transformation. These operators make up the actions needed in QC. Codes for Grover's search and Shor's factoring algorithms are provided as examples. A major feature of this work is that concurrent versions of the algorithms can be evaluated with each version subject to alternate noise effects, which corresponds to the idea of solving a stochastic Schrödinger equation. The density matrix for the ensemble of such noise cases is constructed using parallel distribution methods to evaluate its eigenvalues and associated entropy. Potential applications of this powerful tool include studies of the stability and correction of QC processes using Hamiltonian based dynamics. Program summaryProgram title: QCMPI Catalogue identifier: AECS_v1_0 Program summary URL

  13. Blueprint for a microwave trapped ion quantum computer

    PubMed Central

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

    2017-01-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. PMID:28164154

  14. Blueprint for a microwave trapped ion quantum computer.

    PubMed

    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.

  15. From transistor to trapped-ion computers for quantum chemistry.

    PubMed

    Yung, M-H; Casanova, J; Mezzacapo, A; McClean, J; Lamata, L; Aspuru-Guzik, A; Solano, E

    2014-01-07

    Over the last few decades, quantum chemistry has progressed through the development of computational methods based on modern digital computers. However, these methods can hardly fulfill the exponentially-growing resource requirements when applied to large quantum systems. As pointed out by Feynman, this restriction is intrinsic to all computational models based on classical physics. Recently, the rapid advancement of trapped-ion technologies has opened new possibilities for quantum control and quantum simulations. Here, we present an efficient toolkit that exploits both the internal and motional degrees of freedom of trapped ions for solving problems in quantum chemistry, including molecular electronic structure, molecular dynamics, and vibronic coupling. We focus on applications that go beyond the capacity of classical computers, but may be realizable on state-of-the-art trapped-ion systems. These results allow us to envision a new paradigm of quantum chemistry that shifts from the current transistor to a near-future trapped-ion-based technology.

  16. From transistor to trapped-ion computers for quantum chemistry

    NASA Astrophysics Data System (ADS)

    Yung, M.-H.; Casanova, J.; Mezzacapo, A.; McClean, J.; Lamata, L.; Aspuru-Guzik, A.; Solano, E.

    2014-01-01

    Over the last few decades, quantum chemistry has progressed through the development of computational methods based on modern digital computers. However, these methods can hardly fulfill the exponentially-growing resource requirements when applied to large quantum systems. As pointed out by Feynman, this restriction is intrinsic to all computational models based on classical physics. Recently, the rapid advancement of trapped-ion technologies has opened new possibilities for quantum control and quantum simulations. Here, we present an efficient toolkit that exploits both the internal and motional degrees of freedom of trapped ions for solving problems in quantum chemistry, including molecular electronic structure, molecular dynamics, and vibronic coupling. We focus on applications that go beyond the capacity of classical computers, but may be realizable on state-of-the-art trapped-ion systems. These results allow us to envision a new paradigm of quantum chemistry that shifts from the current transistor to a near-future trapped-ion-based technology.

  17. Computational quantum magnetism: Role of noncollinear magnetism

    NASA Astrophysics Data System (ADS)

    Freeman, Arthur J.; Nakamura, Kohji

    2009-04-01

    We are witnessing today a golden age of innovation with novel magnetic materials and with discoveries important for both basic science and device applications. Computation and simulation have played a key role in the dramatic advances of the past and those we are witnessing today. A goal-driving computational science—simulations of every-increasing complexity of more and more realistic models has been brought into greater focus with greater computing power to run sophisticated and powerful software codes like our highly precise full-potential linearized augmented plane wave (FLAPW) method. Indeed, significant progress has been achieved from advanced first-principles FLAPW calculations for the predictions of surface/interface magnetism. One recently resolved challenging issue is the role of noncollinear magnetism (NCM) that arises not only through the SOC, but also from the breaking of symmetry at surfaces and interfaces. For this, we will further review some specific advances we are witnessing today, including complex magnetic phenomena from noncollinear magnetism with no shape approximation for the magnetization (perpendicular MCA in transition-metal overlayers and superlattices; unidirectional anisotropy and exchange bias in FM and AFM bilayers; constricted domain walls important in quantum spin interfaces; and curling magnetic nano-scale dots as new candidates for non-volatile memory applications) and most recently providing new predictions and understanding of magnetism in novel materials such as magnetic semiconductors and multi-ferroic systems.

  18. Parallel Photonic Quantum Computation Assisted by Quantum Dots in One-Side Optical Microcavities

    PubMed Central

    Luo, Ming-Xing; Wang, Xiaojun

    2014-01-01

    Universal quantum logic gates are important elements for a quantum computer. In contrast to previous constructions on one degree of freedom (DOF) of quantum systems, we investigate the possibility of parallel quantum computations dependent on two DOFs of photon systems. We construct deterministic hyper-controlled-not (hyper-CNOT) gates operating on the spatial-mode and the polarization DOFs of two-photon or one-photon systems by exploring the giant optical circular birefringence induced by quantum-dot spins in one-sided optical microcavities. These hyper-CNOT gates show that the quantum states of two DOFs can be viewed as independent qubits without requiring auxiliary DOFs in theory. This result can reduce the quantum resources by half for quantum applications with large qubit systems, such as the quantum Shor algorithm. PMID:25030424

  19. Demonstration of measurement-only blind quantum computing

    NASA Astrophysics Data System (ADS)

    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.

  20. Quantum Computing in Fock Space Systems

    NASA Astrophysics Data System (ADS)

    Berezin, Alexander A.

    1997-04-01

    Fock space system (FSS) has unfixed number (N) of particles and/or degrees of freedom. In quantum computing (QC) main requirement is sustainability of coherent Q-superpositions. This normally favoured by low noise environment. High excitation/high temperature (T) limit is hence discarded as unfeasible for QC. Conversely, if N is itself a quantized variable, the dimensionality of Hilbert basis for qubits may increase faster (say, N-exponentially) than thermal noise (likely, in powers of N and T). Hence coherency may win over T-randomization. For this type of QC speed (S) of factorization of long integers (with D digits) may increase with D (for 'ordinary' QC speed polynomially decreases with D). This (apparent) paradox rests on non-monotonic bijectivity (cf. Georg Cantor's diagonal counting of rational numbers). This brings entire aleph-null structurality ("Babylonian Library" of infinite informational content of integer field) to superposition determining state of quantum analogue of Turing machine head. Structure of integer infinititude (e.g. distribution of primes) results in direct "Platonic pressure" resembling semi-virtual Casimir efect (presure of cut-off vibrational modes). This "effect", the embodiment of Pythagorean "Number is everything", renders Godelian barrier arbitrary thin and hence FSS-based QC can in principle be unlimitedly efficient (e.g. D/S may tend to zero when D tends to infinity).

  1. Random matrix model of adiabatic quantum computing

    SciTech Connect

    Mitchell, David R.; Adami, Christoph; Lue, Waynn; Williams, Colin P.

    2005-05-15

    We present an analysis of the quantum adiabatic algorithm for solving hard instances of 3-SAT (an NP-complete problem) in terms of random matrix theory (RMT). We determine the global regularity of the spectral fluctuations of the instantaneous Hamiltonians encountered during the interpolation between the starting Hamiltonians and the ones whose ground states encode the solutions to the computational problems of interest. At each interpolation point, we quantify the degree of regularity of the average spectral distribution via its Brody parameter, a measure that distinguishes regular (i.e., Poissonian) from chaotic (i.e., Wigner-type) distributions of normalized nearest-neighbor spacings. We find that for hard problem instances - i.e., those having a critical ratio of clauses to variables - the spectral fluctuations typically become irregular across a contiguous region of the interpolation parameter, while the spectrum is regular for easy instances. Within the hard region, RMT may be applied to obtain a mathematical model of the probability of avoided level crossings and concomitant failure rate of the adiabatic algorithm due to nonadiabatic Landau-Zener-type transitions. Our model predicts that if the interpolation is performed at a uniform rate, the average failure rate of the quantum adiabatic algorithm, when averaged over hard problem instances, scales exponentially with increasing problem size.

  2. Number Partitioning via Quantum Adiabatic Computation

    NASA Technical Reports Server (NTRS)

    Smelyanskiy, Vadim N.; Toussaint, Udo; Clancy, Daniel (Technical Monitor)

    2002-01-01

    We study both analytically and numerically the complexity of the adiabatic quantum evolution algorithm applied to random instances of combinatorial optimization problems. We use as an example the NP-complete set partition problem and obtain an asymptotic expression for the minimal gap separating the ground and exited states of a system during the execution of the algorithm. We show that for computationally hard problem instances the size of the minimal gap scales exponentially with the problem size. This result is in qualitative agreement with the direct numerical simulation of the algorithm for small instances of the set partition problem. We describe the statistical properties of the optimization problem that are responsible for the exponential behavior of the algorithm.

  3. Trapped Ion Quantum Computation by Adiabatic Passage

    SciTech Connect

    Feng Xuni; Wu Chunfeng; Lai, C. H.; Oh, C. H.

    2008-11-07

    We propose a new universal quantum computation scheme for trapped ions in thermal motion via the technique of adiabatic passage, which incorporates the advantages of both the adiabatic passage and the model of trapped ions in thermal motion. Our scheme is immune from the decoherence due to spontaneous emission from excited states as the system in our scheme evolves along a dark state. In our scheme the vibrational degrees of freedom are not required to be cooled to their ground states because they are only virtually excited. It is shown that the fidelity of the resultant gate operation is still high even when the magnitude of the effective Rabi frequency moderately deviates from the desired value.

  4. Quantum Optical Implementations of Current Quantum Computing Paradigms

    DTIC Science & Technology

    2005-05-01

    Bacterial Spores,” at DARPA, Jan. 29, 2002. 10. M. O. Scully, “Quantum Maxwell demons ,” at Texas A&M University, March 19 (2002). 11. M. O...detectors,” at NEC, Princeton, April 5 (2002). 13. M. O. Scully, “Quantum thermodynamics: From quantum heat engines to Maxwell’s demons and beyond,” at...quantum heat engines to Maxwell’s demons and beyond,” International Conference on Quantum Information (ICQI), Oviedo, Spain, July 14-18, 2002. 18. M. O

  5. The Brain Is both Neurocomputer and Quantum Computer

    ERIC Educational Resources Information Center

    Hameroff, Stuart R.

    2007-01-01

    In their article, "Is the Brain a Quantum Computer,?" Litt, Eliasmith, Kroon, Weinstein, and Thagard (2006) criticize the Penrose-Hameroff "Orch OR" quantum computational model of consciousness, arguing instead for neurocomputation as an explanation for mental phenomena. Here I clarify and defend Orch OR, show how Orch OR and neurocomputation are…

  6. Quantum computing using electron-nuclear double resonances

    NASA Astrophysics Data System (ADS)

    Bowden, Charles M.; Dowling, Jonathan P.; Hotaling, Steven P.

    1997-07-01

    We consider the use of Electron-Nuclear Double Resonance (ENDOR) techniques in quantum computing. ENDOR resolution as a possible limiting factor is discussed. It is found that ENDOR and double-ENDOR techniques have sufficient resolution for quantum computing applications.

  7. Demonstration of a small programmable quantum computer with atomic qubits.

    PubMed

    Debnath, S; Linke, N M; Figgatt, C; Landsman, K A; Wright, K; Monroe, C

    2016-08-04

    Quantum computers can solve certain problems more efficiently than any possible conventional computer. Small quantum algorithms have been demonstrated on multiple quantum computing platforms, many specifically tailored in hardware to implement a particular algorithm or execute a limited number of computational paths. Here we demonstrate a five-qubit trapped-ion quantum computer that can be programmed in software to implement arbitrary quantum algorithms by executing any sequence of universal quantum logic gates. We compile algorithms into a fully connected set of gate operations that are native to the hardware and have a mean fidelity of 98 per cent. Reconfiguring these gate sequences provides the flexibility to implement a variety of algorithms without altering the hardware. As examples, we implement the Deutsch-Jozsa and Bernstein-Vazirani algorithms with average success rates of 95 and 90 per cent, respectively. We also perform a coherent quantum Fourier transform on five trapped-ion qubits for phase estimation and period finding with average fidelities of 62 and 84 per cent, respectively. This small quantum computer can be scaled to larger numbers of qubits within a single register, and can be further expanded by connecting several such modules through ion shuttling or photonic quantum channels.

  8. Demonstration of a small programmable quantum computer with atomic qubits

    NASA Astrophysics Data System (ADS)

    Debnath, S.; Linke, N. M.; Figgatt, C.; Landsman, K. A.; Wright, K.; Monroe, C.

    2016-08-01

    Quantum computers can solve certain problems more efficiently than any possible conventional computer. Small quantum algorithms have been demonstrated on multiple quantum computing platforms, many specifically tailored in hardware to implement a particular algorithm or execute a limited number of computational paths. Here we demonstrate a five-qubit trapped-ion quantum computer that can be programmed in software to implement arbitrary quantum algorithms by executing any sequence of universal quantum logic gates. We compile algorithms into a fully connected set of gate operations that are native to the hardware and have a mean fidelity of 98 per cent. Reconfiguring these gate sequences provides the flexibility to implement a variety of algorithms without altering the hardware. As examples, we implement the Deutsch-Jozsa and Bernstein-Vazirani algorithms with average success rates of 95 and 90 per cent, respectively. We also perform a coherent quantum Fourier transform on five trapped-ion qubits for phase estimation and period finding with average fidelities of 62 and 84 per cent, respectively. This small quantum computer can be scaled to larger numbers of qubits within a single register, and can be further expanded by connecting several such modules through ion shuttling or photonic quantum channels.

  9. Universal Quantum Computing with Arbitrary Continuous-Variable Encoding.

    PubMed

    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.

  10. Popescu-Rohrlich correlations imply efficient instantaneous nonlocal quantum computation

    NASA Astrophysics Data System (ADS)

    Broadbent, Anne

    2016-08-01

    In instantaneous nonlocal quantum computation, two parties cooperate in order to perform a quantum computation on their joint inputs, while being restricted to a single round of simultaneous communication. Previous results showed that instantaneous nonlocal quantum computation is possible, at the cost of an exponential amount of prior shared entanglement (in the size of the input). Here, we show that a linear amount of entanglement suffices, (in the size of the computation), as long as the parties share nonlocal correlations as given by the Popescu-Rohrlich box. This means that communication is not required for efficient instantaneous nonlocal quantum computation. Exploiting the well-known relation to position-based cryptography, our result also implies the impossibility of secure position-based cryptography against adversaries with nonsignaling correlations. Furthermore, our construction establishes a quantum analog of the classical communication complexity collapse under nonsignaling correlations.

  11. Universal Quantum Computing with Arbitrary Continuous-Variable Encoding

    NASA Astrophysics Data System (ADS)

    Lau, Hoi-Kwan; Plenio, Martin B.

    2016-09-01

    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.

  12. Measurement-Based Linear Optics

    NASA Astrophysics Data System (ADS)

    Alexander, Rafael N.; Gabay, Natasha C.; Rohde, Peter P.; Menicucci, Nicolas C.

    2017-03-01

    A major challenge in optical quantum processing is implementing large, stable interferometers. We offer a novel approach: virtual, measurement-based interferometers that are programed on the fly solely by the choice of homodyne measurement angles. The effects of finite squeezing are captured as uniform amplitude damping. We compare our proposal to existing (physical) interferometers and consider its performance for BosonSampling, which could demonstrate postclassical computational power in the near future. We prove its efficiency in time and squeezing (energy) in this setting.

  13. Experimental magic state distillation for fault-tolerant quantum computing.

    PubMed

    Souza, Alexandre M; Zhang, Jingfu; Ryan, Colm A; Laflamme, Raymond

    2011-01-25

    Any physical quantum device for quantum information processing (QIP) is subject to errors in implementation. In order to be reliable and efficient, quantum computers will need error-correcting or error-avoiding methods. Fault-tolerance achieved through quantum error correction will be an integral part of quantum computers. Of the many methods that have been discovered to implement it, a highly successful approach has been to use transversal gates and specific initial states. A critical element for its implementation is the availability of high-fidelity initial states, such as |0〉 and the 'magic state'. Here, we report an experiment, performed in a nuclear magnetic resonance (NMR) quantum processor, showing sufficient quantum control to improve the fidelity of imperfect initial magic states by distilling five of them into one with higher fidelity.

  14. Secure Multiparty Quantum Computation for Summation and Multiplication

    PubMed Central

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

    2016-01-01

    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. PMID:26792197

  15. Secure Multiparty Quantum Computation for Summation and Multiplication

    NASA Astrophysics Data System (ADS)

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

    2016-01-01

    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.

  16. Quantum Monte Carlo Endstation for Petascale Computing

    SciTech Connect

    Lubos Mitas

    2011-01-26

    NCSU research group has been focused on accomplising the key goals of this initiative: establishing new generation of quantum Monte Carlo (QMC) computational tools as a part of Endstation petaflop initiative for use at the DOE ORNL computational facilities and for use by computational electronic structure community at large; carrying out high accuracy quantum Monte Carlo demonstration projects in application of these tools to the forefront electronic structure problems in molecular and solid systems; expanding the impact of QMC methods and approaches; explaining and enhancing the impact of these advanced computational approaches. In particular, we have developed quantum Monte Carlo code (QWalk, www.qwalk.org) which was significantly expanded and optimized using funds from this support and at present became an actively used tool in the petascale regime by ORNL researchers and beyond. These developments have been built upon efforts undertaken by the PI's group and collaborators over the period of the last decade. The code was optimized and tested extensively on a number of parallel architectures including petaflop ORNL Jaguar machine. We have developed and redesigned a number of code modules such as evaluation of wave functions and orbitals, calculations of pfaffians and introduction of backflow coordinates together with overall organization of the code and random walker distribution over multicore architectures. We have addressed several bottlenecks such as load balancing and verified efficiency and accuracy of the calculations with the other groups of the Endstation team. The QWalk package contains about 50,000 lines of high quality object-oriented C++ and includes also interfaces to data files from other conventional electronic structure codes such as Gamess, Gaussian, Crystal and others. This grant supported PI for one month during summers, a full-time postdoc and partially three graduate students over the period of the grant duration, it has resulted in 13

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

    PubMed

    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.

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

    NASA Astrophysics Data System (ADS)

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

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

  19. Quantum Computation by Optically Coupled Steady Atoms/Quantum-Dots Inside a Quantum Cavity

    NASA Technical Reports Server (NTRS)

    Pradhan, P.; Wang, K. L.; Roychowdhury, V. P.; Anantram, M. P.; Mor, T.; Saini, Subhash (Technical Monitor)

    1999-01-01

    We present a model for quantum computation using $n$ steady 3-level atoms kept inside a quantum cavity, or using $n$ quantum-dots (QDs) kept inside a quantum cavity. In this model one external laser is pointed towards all the atoms/QDs, and $n$ pairs of electrodes are addressing the atoms/QDs, so that each atom is addressed by one pair. The energy levels of each atom/QD are controlled by an external Stark field given to the atom/QD by its external pair of electrodes. Transition between two energy levels of an individual atom/ QD are controlled by the voltage on its electrodes, and by the external laser. Interactions between two atoms/ QDs are performed with the additional help of the cavity mode (using on-resonance condition). Laser frequency, cavity frequency, and energy levels are far off-resonance most of the time, and they are brought to the resonance (using the Stark effect) only at the time of operations. Steps for a controlled-NOT gate between any two atoms/QDs have been described for this model. Our model demands some challenging technological efforts, such as manufacturing single-electron QDs inside a cavity. However, it promises big advantages over other existing models which are currently implemented, and might enable a much easier scale-up, to compute with many more qubits.

  20. Quantum computing with acceptor spins in silicon

    NASA Astrophysics Data System (ADS)

    Salfi, Joe; Tong, Mengyang; Rogge, Sven; Culcer, Dimitrie

    2016-06-01

    The states of a boron acceptor near a Si/SiO2 interface, which bind two low-energy Kramers pairs, have exceptional properties for encoding quantum information and, with the aid of strain, both heavy hole and light hole-based spin qubits can be designed. Whereas a light-hole spin qubit was introduced recently (arXiv:1508.04259), here we present analytical and numerical results proving that a heavy-hole spin qubit can be reliably initialised, rotated and entangled by electrical means alone. This is due to strong Rashba-like spin-orbit interaction terms enabled by the interface inversion asymmetry. Single qubit rotations rely on electric-dipole spin resonance (EDSR), which is strongly enhanced by interface-induced spin-orbit terms. Entanglement can be accomplished by Coulomb exchange, coupling to a resonator, or spin-orbit induced dipole-dipole interactions. By analysing the qubit sensitivity to charge noise, we demonstrate that interface-induced spin-orbit terms are responsible for sweet spots in the dephasing time {T}2* as a function of the top gate electric field, which are close to maxima in the EDSR strength, where the EDSR gate has high fidelity. We show that both qubits can be described using the same starting Hamiltonian, and by comparing their properties we show that the complex interplay of bulk and interface-induced spin-orbit terms allows a high degree of electrical control and makes acceptors potential candidates for scalable quantum computation in Si.

  1. Quantum computing with acceptor spins in silicon.

    PubMed

    Salfi, Joe; Tong, Mengyang; Rogge, Sven; Culcer, Dimitrie

    2016-06-17

    The states of a boron acceptor near a Si/SiO2 interface, which bind two low-energy Kramers pairs, have exceptional properties for encoding quantum information and, with the aid of strain, both heavy hole and light hole-based spin qubits can be designed. Whereas a light-hole spin qubit was introduced recently (arXiv:1508.04259), here we present analytical and numerical results proving that a heavy-hole spin qubit can be reliably initialised, rotated and entangled by electrical means alone. This is due to strong Rashba-like spin-orbit interaction terms enabled by the interface inversion asymmetry. Single qubit rotations rely on electric-dipole spin resonance (EDSR), which is strongly enhanced by interface-induced spin-orbit terms. Entanglement can be accomplished by Coulomb exchange, coupling to a resonator, or spin-orbit induced dipole-dipole interactions. By analysing the qubit sensitivity to charge noise, we demonstrate that interface-induced spin-orbit terms are responsible for sweet spots in the dephasing time [Formula: see text] as a function of the top gate electric field, which are close to maxima in the EDSR strength, where the EDSR gate has high fidelity. We show that both qubits can be described using the same starting Hamiltonian, and by comparing their properties we show that the complex interplay of bulk and interface-induced spin-orbit terms allows a high degree of electrical control and makes acceptors potential candidates for scalable quantum computation in Si.

  2. Digitized adiabatic quantum computing with a superconducting circuit.

    PubMed

    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.

  3. Digitized adiabatic quantum computing with a superconducting circuit

    NASA Astrophysics Data System (ADS)

    Barends, R.; Shabani, A.; Lamata, L.; Kelly, J.; Mezzacapo, A.; Heras, U. Las; 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-01

    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.

  4. Non-quantum implementation of quantum computation algorithm using a spatial coding technique

    NASA Astrophysics Data System (ADS)

    Tate, N.; Ogura, Y.; Tanida, J.

    2005-07-01

    Non-quantum implementation of quantum information processing is studied. A spatial coding technique, which is one effective digital optical computing technique, is utilized to implement quantum teleportation efficiently. In the coding, quantum information is represented by the intensity and the phase of elemental cells. Correct operation is confirmed within the proposed scheme, which indicates the effectiveness of the proposed approach and a motive for further investigation.

  5. Universal quantum computation with a nonlinear oscillator network

    NASA Astrophysics Data System (ADS)

    Goto, Hayato

    2016-05-01

    We theoretically show that a nonlinear oscillator network with controllable parameters can be used for universal quantum computation. The initialization is achieved by a quantum-mechanical bifurcation based on quantum adiabatic evolution, which yields a Schrödinger cat state. All the elementary quantum gates are also achieved by quantum adiabatic evolution, in which dynamical phases accompanying the adiabatic evolutions are controlled by the system parameters. Numerical simulation results indicate that high gate fidelities can be achieved, where no dissipation is assumed.

  6. Adiabatic Quantum Computing and Quantum Walks: Algorithms and Architectures

    DTIC Science & Technology

    2011-02-15

    0807.0929 Title: Environment-Assisted Quantum Transport Authors: Patrick Rebentrost, Masoud Mohseni, Ivan Kassal, Seth Lloyd, Alán Aspuru-Guzik...this effect, Environment Assisted Quantum Transport (ENAQT).The use of environmental effects to enhance transport rates appears to be ubiquitous in

  7. Symbolic Quantum Computation Simulation in SymPy

    NASA Astrophysics Data System (ADS)

    Cugini, Addison; Curry, Matt; Granger, Brian

    2010-10-01

    Quantum computing is an emerging field which aims to use quantum mechanics to solve difficult computational problems with greater efficiency than on a classical computer. There is a need to create software that i) helps newcomers to learn the field, ii) enables practitioners to design and simulate quantum circuits and iii) provides an open foundation for further research in the field. Towards these ends we have created a package, in the open-source symbolic computation library SymPy, that simulates the quantum circuit model of quantum computation using Dirac notation. This framework builds on the extant powerful symbolic capabilities of SymPy to preform its simulations in a fully symbolic manner. We use object oriented design to abstract circuits as ordered collections of quantum gate and qbit objects. The gate objects can either be applied directly to the qbit objects or be represented as matrices in different bases. The package is also capable of performing the quantum Fourier transform and Shor's algorithm. A notion of measurement is made possible through the use of a non-commutative gate object. In this talk, we describe the software and show examples of quantum circuits on single and multi qbit states that involve common algorithms, gates and measurements.

  8. Cryogenic setup for trapped ion quantum computing.

    PubMed

    Brandl, M F; van Mourik, M W; Postler, L; Nolf, A; Lakhmanskiy, K; Paiva, R R; Möller, S; Daniilidis, N; Häffner, H; Kaushal, V; Ruster, T; Warschburger, C; Kaufmann, H; Poschinger, U G; Schmidt-Kaler, F; Schindler, P; Monz, T; Blatt, R

    2016-11-01

    We report on the design of a cryogenic setup for trapped ion quantum computing containing a segmented surface electrode trap. The heat shield of our cryostat is designed to attenuate alternating magnetic field noise, resulting in 120 dB reduction of 50 Hz noise along the magnetic field axis. We combine this efficient magnetic shielding with high optical access required for single ion addressing as well as for efficient state detection by placing two lenses each with numerical aperture 0.23 inside the inner heat shield. The cryostat design incorporates vibration isolation to avoid decoherence of optical qubits due to the motion of the cryostat. We measure vibrations of the cryostat of less than ±20 nm over 2 s. In addition to the cryogenic apparatus, we describe the setup required for an operation with (40)Ca(+) and (88)Sr(+) ions. The instability of the laser manipulating the optical qubits in (40)Ca(+) is characterized by yielding a minimum of its Allan deviation of 2.4 ⋅ 10(-15) at 0.33 s. To evaluate the performance of the apparatus, we trapped (40)Ca(+) ions, obtaining a heating rate of 2.14(16) phonons/s and a Gaussian decay of the Ramsey contrast with a 1/e-time of 18.2(8) ms.

  9. Cryogenic setup for trapped ion quantum computing

    NASA Astrophysics Data System (ADS)

    Brandl, M. F.; van Mourik, M. W.; Postler, L.; Nolf, A.; Lakhmanskiy, K.; Paiva, R. R.; Möller, S.; Daniilidis, N.; Häffner, H.; Kaushal, V.; Ruster, T.; Warschburger, C.; Kaufmann, H.; Poschinger, U. G.; Schmidt-Kaler, F.; Schindler, P.; Monz, T.; Blatt, R.

    2016-11-01

    We report on the design of a cryogenic setup for trapped ion quantum computing containing a segmented surface electrode trap. The heat shield of our cryostat is designed to attenuate alternating magnetic field noise, resulting in 120 dB reduction of 50 Hz noise along the magnetic field axis. We combine this efficient magnetic shielding with high optical access required for single ion addressing as well as for efficient state detection by placing two lenses each with numerical aperture 0.23 inside the inner heat shield. The cryostat design incorporates vibration isolation to avoid decoherence of optical qubits due to the motion of the cryostat. We measure vibrations of the cryostat of less than ±20 nm over 2 s. In addition to the cryogenic apparatus, we describe the setup required for an operation with 40Ca+ and 88Sr+ ions. The instability of the laser manipulating the optical qubits in 40Ca+ is characterized by yielding a minimum of its Allan deviation of 2.4 ṡ 10-15 at 0.33 s. To evaluate the performance of the apparatus, we trapped 40Ca+ ions, obtaining a heating rate of 2.14(16) phonons/s and a Gaussian decay of the Ramsey contrast with a 1/e-time of 18.2(8) ms.

  10. Quantum Computation using Arrays of N Polar Molecules in Pendular States.

    PubMed

    Wei, Qi; Cao, Yudong; Kais, Sabre; Friedrich, Bretislav; Herschbach, Dudley

    2016-11-18

    We investigate several aspects of realizing quantum computation using entangled polar molecules in pendular states. Quantum algorithms typically start from a product state |00⋯0⟩ and we show that up to a negligible error, the ground states of polar molecule arrays can be considered as the unentangled qubit basis state |00⋯0⟩ . This state can be prepared by simply allowing the system to reach thermal equilibrium at low temperature (<1 mK). We also evaluate entanglement, characterized by concurrence of pendular state qubits in dipole arrays as governed by the external electric field, dipole-dipole coupling and number N of molecules in the array. In the parameter regime that we consider for quantum computing, we find that qubit entanglement is modest, typically no greater than 10(-4) , confirming the negligible entanglement in the ground state. We discuss methods for realizing quantum computation in the gate model, measurement-based model, instantaneous quantum polynomial time circuits and the adiabatic model using polar molecules in pendular states.

  11. Consciousness and Logic in a Quantum-Computing Universe

    NASA Astrophysics Data System (ADS)

    Zizzi, Paola

    The early inflationary universe can be described in terms of quantum information. More specifically, the inflationary universe can be viewed as a superposed state of quantum registers. Actually, during inflation, one can speak of a quantum superposition of universes. At the end of inflation, only one universe is selected, by a mechanism called self-reduction, which is consistent with Penrose's objective reduction (OR) model. The quantum gravity threshold of (OR) is reached at the end of inflation, and corresponds to a superposed state of 109 quantum registers. This is also the number of superposed tubulins — qubits in our brain, which undergo the Penrose-Hameroff orchestrated objective reduction, (Orch OR), leading to a conscious event. Then, an analogy naturally arises between the very early quantum-computing universe, and our mind. In fact, we argue that at the end of in- flation, the universe underwent a cosmic conscious event, the so-called "Big Wow", which acted as an imprinting for the future minds to come, with future modes of computation, consciousness and logic. The postinflationary universe organized itself as a cellular automaton (CA) with two computational modes: quantum and classical, like the two conformations assumed by the cellular automaton of tubulins in our brain, as in Hameroff's model. In the quantum configuration, the universe quantum-evaluates recursive functions, which are the laws of physics in their most abstract form. To do so in a very efficient way, the universe uses, as subroutines, black holes - quantum computers and quantum minds, which operate in parallel. The outcomes of the overall quantum computation are the universals, the attributes of things in themselves. These universals are partially obtained also by the quantum minds, and are endowed with subjective meaning. The units of the subjective universals are qualia, which are strictly related to the (virtual) existence of Planckian black holes. Further, we consider two aspects

  12. Universal continuous-variable quantum computation without cooling

    NASA Astrophysics Data System (ADS)

    Lau, Hoi-Kwan; Plenio, Martin B.

    2017-02-01

    One limitation of the quantum computing capability of a continuous-variable system is determined by our ability to cool it to the ground state, because pure logical states, in which we accurately encode quantum information, are conventionally pure physical states that are constructed from the ground state. In this work, we present an alternative quantum computing formalism that encodes logical quantum information in mixed physical states. We introduce a class of mixed-state protocols that are based on a parity encoding, and propose an implementation of the universal logic gates by using realistic hybrid interactions. When compared with the conventional pure-state protocols, our formalism could relax the necessity, and hence the systemic requirements, of cooling. Additionally, the mixed-state protocols are inherently resilient to a wider class of noise processes and reduce the fundamental energy consumption in initialization. Our work broadens the range of candidates for continuous-variable quantum computers.

  13. Novel Approaches to Quantum Computation Using Solid State Qubits

    DTIC Science & Technology

    2007-12-31

    Han, A scheme for the teleportation of multiqubit quantum information via the control of many agents in a network, submitted to Phys. Lett. A, 343...approach, Phys. Rev. B 70, 094513 (2004). 22. C.-P. Yang, S.-I. Chu, and S. Han, Efficient many party controlled teleportation of multiqubit quantum ...June 1, 2001- September 30, 2007 4. TITLE AND SUBTITLE Sa. CONTRACT NUMBER "Novel Approaches to Quantum Computation Using Solid State Qubits" F49620

  14. Combining Dynamical Decoupling with Fault-Tolerant Quantum Computation

    DTIC Science & Technology

    2009-11-17

    ar X iv :0 91 1. 32 02 v1 [ qu an t- ph ] 1 7 N ov 2 00 9 Combining dynamical decoupling with fault-tolerant quantum computation Hui Khoon Ng,1...Daniel A. Lidar,2 and John Preskill1 1Institute for Quantum Information, California Institute of Technology, Pasadena, CA 91125, USA 2Departments...of Chemistry, Electrical Engineering, and Physics, and Center for Quantum Information Science & Technology, University of Southern California, Los

  15. Scalable Quantum Networks for Distributed Computing and Sensing

    DTIC Science & Technology

    2016-04-01

    AFRL-AFOSR-UK-TR-2016-0007 Scalable Quantum Networks for Distributed Computing and Sensing Ian Walmsley THE UNIVERSITY OF OXFORD Final Report 04/01...MM-YYYY) 12/07/2015 2. REPORT TYPE Final 3. DATES COVERED (From - To) 01-Sep-2012 to 31-Aug-2015 4. TITLE AND SUBTITLE Scalable Quantum Networks...SUPPLEMENTARY NOTES 14. ABSTRACT We identified two barriers to the implementation of large-scale photonic quantum networks. First, as scalability requires

  16. Single Photon Holographic Qudit Elements for Linear Optical Quantum Computing

    DTIC Science & Technology

    2011-05-01

    in optical volume holography and designed and simulated practical single-photon, single-optical elements for qudit MUB-state quantum in- formation...Independent of the representation we use, the MUB states will ordinarily be modulated in both amplitude and phase. Recently a practical method has been...quantum computing with qudits (d ≥ 3) has been an efficient and practical quantum state sorter for photons whose complex fields are modulated in both

  17. Resilience to Time-Correlated Noise in Quantum Computation

    NASA Astrophysics Data System (ADS)

    Bombín, Héctor

    2016-10-01

    Fault-tolerant quantum computation techniques rely on weakly correlated noise. Here, I show that it is enough to assume weak spatial correlations: Time correlations can take any form. In particular, single-shot error-correction techniques exhibit a noise threshold for quantum memories under spatially local stochastic noise.

  18. Quantum-dot cluster-state computing with encoded qubits

    SciTech Connect

    Weinstein, Yaakov S.; Hellberg, C. Stephen; Levy, Jeremy

    2005-08-15

    A class of architectures is advanced for cluster-state quantum computation using quantum dots. These architectures include using single and multiple dots as logical qubits. Special attention is given to supercoherent qubits introduced by Bacon et al. [Phys. Rev. Lett. 87, 247902 (2001)] for which we discuss the effects of various errors and present a means of error protection.

  19. Preparing ground States of quantum many-body systems on a quantum computer.

    PubMed

    Poulin, David; Wocjan, Pawel

    2009-04-03

    Preparing the ground state of a system of interacting classical particles is an NP-hard problem. Thus, there is in general no better algorithm to solve this problem than exhaustively going through all N configurations of the system to determine the one with lowest energy, requiring a running time proportional to N. A quantum computer, if it could be built, could solve this problem in time sqrt[N]. Here, we present a powerful extension of this result to the case of interacting quantum particles, demonstrating that a quantum computer can prepare the ground state of a quantum system as efficiently as it does for classical systems.

  20. Experimental quantum computing to solve systems of linear equations.

    PubMed

    Cai, X-D; Weedbrook, C; Su, Z-E; Chen, M-C; Gu, Mile; Zhu, M-J; Li, Li; Liu, Nai-Le; Lu, Chao-Yang; Pan, Jian-Wei

    2013-06-07

    Solving linear systems of equations is ubiquitous in all areas of science and engineering. With rapidly growing data sets, such a task can be intractable for classical computers, as the best known classical algorithms require a time proportional to the number of variables N. A recently proposed quantum algorithm shows that quantum computers could solve linear systems in a time scale of order log(N), giving an exponential speedup over classical computers. Here we realize the simplest instance of this algorithm, solving 2×2 linear equations for various input vectors on a quantum computer. We use four quantum bits and four controlled logic gates to implement every subroutine required, demonstrating the working principle of this algorithm.

  1. Blind quantum computation protocol in which Alice only makes measurements

    NASA Astrophysics Data System (ADS)

    Morimae, Tomoyuki; Fujii, Keisuke

    2013-05-01

    Blind quantum computation is a new secure quantum computing protocol which enables Alice (who does not have sufficient quantum technology) to delegate her quantum computation to Bob (who has a full-fledged quantum computer) in such a way that Bob cannot learn anything about Alice's input, output, and algorithm. In previous protocols, Alice needs to have a device which generates quantum states, such as single-photon states. Here we propose another type of blind computing protocol where Alice does only measurements, such as the polarization measurements with a threshold detector. In several experimental setups, such as optical systems, the measurement of a state is much easier than the generation of a single-qubit state. Therefore our protocols ease Alice's burden. Furthermore, the security of our protocol is based on the no-signaling principle, which is more fundamental than quantum physics. Finally, our protocols are device independent in the sense that Alice does not need to trust her measurement device in order to guarantee the security.

  2. Secure entanglement distillation for double-server blind quantum computation.

    PubMed

    Morimae, Tomoyuki; Fujii, Keisuke

    2013-07-12

    Blind quantum computation is a new secure quantum computing protocol where a client, who does not have enough quantum technologies at her disposal, can delegate her quantum computation to a server, who has a fully fledged quantum computer, in such a way that the server cannot learn anything about the client's input, output, and program. If the client interacts with only a single server, the client has to have some minimum quantum power, such as the ability of emitting randomly rotated single-qubit states or the ability of measuring states. If the client interacts with two servers who share Bell pairs but cannot communicate with each other, the client can be completely classical. For such a double-server scheme, two servers have to share clean Bell pairs, and therefore the entanglement distillation is necessary in a realistic noisy environment. In this Letter, we show that it is possible to perform entanglement distillation in the double-server scheme without degrading the security of blind quantum computing.

  3. Computing protein infrared spectroscopy with quantum chemistry.

    PubMed

    Besley, Nicholas A

    2007-12-15

    Quantum chemistry is a field of science that has undergone unprecedented advances in the last 50 years. From the pioneering work of Boys in the 1950s, quantum chemistry has evolved from being regarded as a specialized and esoteric discipline to a widely used tool that underpins much of the current research in chemistry today. This achievement was recognized with the award of the 1998 Nobel Prize in Chemistry to John Pople and Walter Kohn. As the new millennium unfolds, quantum chemistry stands at the forefront of an exciting new era. Quantitative calculations on systems of the magnitude of proteins are becoming a realistic possibility, an achievement that would have been unimaginable to the early pioneers of quantum chemistry. In this article we will describe ongoing work towards this goal, focusing on the calculation of protein infrared amide bands directly with quantum chemical methods.

  4. Experimental demonstration of a programmable quantum computer by NMR.

    PubMed

    Kim, Jaehyun; Lee, Jae-Seung; Hwang, Taesoon; Lee, Soonchil

    2004-01-01

    A programmable quantum computer is experimentally demonstrated by nuclear magnetic resonance using one qubit for the program and two qubits for data. A non-separable two-qubit operation is performed in a programmable way to show the successful demonstration. Projective measurements required in the programmable quantum computer are simulated by averaging the results of experiments just like when producing an effective pure state.

  5. Thermalization in nature and on a quantum computer.

    PubMed

    Riera, Arnau; Gogolin, Christian; Eisert, Jens

    2012-02-24

    In this work, we show how Gibbs or thermal states appear dynamically in closed quantum many-body systems, building on the program of dynamical typicality. We introduce a novel perturbation theorem for physically relevant weak system-bath couplings that is applicable even in the thermodynamic limit. We identify conditions under which thermalization happens and discuss the underlying physics. Based on these results, we also present a fully general quantum algorithm for preparing Gibbs states on a quantum computer with a certified runtime and error bound. This complements quantum Metropolis algorithms, which are expected to be efficient but have no known runtime estimates and only work for local Hamiltonians.

  6. Universal linear Bogoliubov transformations through one-way quantum computation

    SciTech Connect

    Ukai, Ryuji; Yoshikawa, Jun-ichi; Iwata, Noriaki; Furusawa, Akira; Loock, Peter van

    2010-03-15

    We show explicitly how to realize an arbitrary linear unitary Bogoliubov (LUBO) transformation on a multimode quantum state through homodyne-based one-way quantum computation. Any LUBO transformation can be approximated by means of a fixed, finite-sized, sufficiently squeezed Gaussian cluster state that allows for the implementation of beam splitters (in form of three-mode connection gates) and general one-mode LUBO transformations. In particular, we demonstrate that a linear four-mode cluster state is a sufficient resource for an arbitrary one-mode LUBO transformation. Arbitrary-input quantum states including non-Gaussian states could be efficiently attached to the cluster through quantum teleportation.

  7. Quantum computation for large-scale image classification

    NASA Astrophysics Data System (ADS)

    Ruan, Yue; Chen, Hanwu; Tan, Jianing; Li, Xi

    2016-10-01

    Due to the lack of an effective quantum feature extraction method, there is currently no effective way to perform quantum image classification or recognition. In this paper, for the first time, a global quantum feature extraction method based on Schmidt decomposition is proposed. A revised quantum learning algorithm is also proposed that will classify images by computing the Hamming distance of these features. From the experimental results derived from the benchmark database Caltech 101, and an analysis of the algorithm, an effective approach to large-scale image classification is derived and proposed against the background of big data.

  8. Spin Glass a Bridge Between Quantum Computation and Statistical Mechanics

    NASA Astrophysics Data System (ADS)

    Ohzeki, Masayuki

    2013-09-01

    In this chapter, we show two fascinating topics lying between quantum information processing and statistical mechanics. First, we introduce an elaborated technique, the surface code, to prepare the particular quantum state with robustness against decoherence. Interestingly, the theoretical limitation of the surface code, accuracy threshold, to restore the quantum state has a close connection with the problem on the phase transition in a special model known as spin glasses, which is one of the most active researches in statistical mechanics. The phase transition in spin glasses is an intractable problem, since we must strive many-body system with complicated interactions with change of their signs depending on the distance between spins. Fortunately, recent progress in spin-glass theory enables us to predict the precise location of the critical point, at which the phase transition occurs. It means that statistical mechanics is available for revealing one of the most interesting parts in quantum information processing. We show how to import the special tool in statistical mechanics into the problem on the accuracy threshold in quantum computation. Second, we show another interesting technique to employ quantum nature, quantum annealing. The purpose of quantum annealing is to search for the most favored solution of a multivariable function, namely optimization problem. The most typical instance is the traveling salesman problem to find the minimum tour while visiting all the cities. In quantum annealing, we introduce quantum fluctuation to drive a particular system with the artificial Hamiltonian, in which the ground state represents the optimal solution of the specific problem we desire to solve. Induction of the quantum fluctuation gives rise to the quantum tunneling effect, which allows nontrivial hopping from state to state. We then sketch a strategy to control the quantum fluctuation efficiently reaching the ground state. Such a generic framework is called

  9. Exponential rise of dynamical complexity in quantum computing through projections.

    PubMed

    Burgarth, Daniel Klaus; Facchi, Paolo; Giovannetti, Vittorio; Nakazato, Hiromichi; Pascazio, Saverio; Yuasa, Kazuya

    2014-10-10

    The ability of quantum systems to host exponentially complex dynamics has the potential to revolutionize science and technology. Therefore, much effort has been devoted to developing of protocols for computation, communication and metrology, which exploit this scaling, despite formidable technical difficulties. Here we show that the mere frequent observation of a small part of a quantum system can turn its dynamics from a very simple one into an exponentially complex one, capable of universal quantum computation. After discussing examples, we go on to show that this effect is generally to be expected: almost any quantum dynamics becomes universal once 'observed' as outlined above. Conversely, we show that any complex quantum dynamics can be 'purified' into a simpler one in larger dimensions. We conclude by demonstrating that even local noise can lead to an exponentially complex dynamics.

  10. Exponential rise of dynamical complexity in quantum computing through projections

    PubMed Central

    Burgarth, Daniel Klaus; Facchi, Paolo; Giovannetti, Vittorio; Nakazato, Hiromichi; Pascazio, Saverio; Yuasa, Kazuya

    2014-01-01

    The ability of quantum systems to host exponentially complex dynamics has the potential to revolutionize science and technology. Therefore, much effort has been devoted to developing of protocols for computation, communication and metrology, which exploit this scaling, despite formidable technical difficulties. Here we show that the mere frequent observation of a small part of a quantum system can turn its dynamics from a very simple one into an exponentially complex one, capable of universal quantum computation. After discussing examples, we go on to show that this effect is generally to be expected: almost any quantum dynamics becomes universal once ‘observed’ as outlined above. Conversely, we show that any complex quantum dynamics can be ‘purified’ into a simpler one in larger dimensions. We conclude by demonstrating that even local noise can lead to an exponentially complex dynamics. PMID:25300692

  11. Scalable digital hardware for a trapped ion quantum computer

    NASA Astrophysics Data System (ADS)

    Mount, Emily; Gaultney, Daniel; Vrijsen, Geert; Adams, Michael; Baek, So-Young; Hudek, Kai; Isabella, Louis; Crain, Stephen; van Rynbach, Andre; Maunz, Peter; Kim, Jungsang

    2016-12-01

    Many of the challenges of scaling quantum computer hardware lie at the interface between the qubits and the classical control signals used to manipulate them. Modular ion trap quantum computer architectures address scalability by constructing individual quantum processors interconnected via a network of quantum communication channels. Successful operation of such quantum hardware requires a fully programmable classical control system capable of frequency stabilizing the continuous wave lasers necessary for loading, cooling, initialization, and detection of the ion qubits, stabilizing the optical frequency combs used to drive logic gate operations on the ion qubits, providing a large number of analog voltage sources to drive the trap electrodes, and a scheme for maintaining phase coherence among all the controllers that manipulate the qubits. In this work, we describe scalable solutions to these hardware development challenges.

  12. New Approaches to Quantum Computing using Nuclear Magnetic Resonance Spectroscopy

    SciTech Connect

    Colvin, M; Krishnan, V V

    2003-02-07

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

  13. Quantum perceptron over a field and neural network architecture selection in a quantum computer.

    PubMed

    da Silva, Adenilton José; Ludermir, Teresa Bernarda; de Oliveira, Wilson Rosa

    2016-04-01

    In this work, we propose a quantum neural network named quantum perceptron over a field (QPF). Quantum computers are not yet a reality and the models and algorithms proposed in this work cannot be simulated in actual (or classical) computers. QPF is a direct generalization of a classical perceptron and solves some drawbacks found in previous models of quantum perceptrons. We also present a learning algorithm named Superposition based Architecture Learning algorithm (SAL) that optimizes the neural network weights and architectures. SAL searches for the best architecture in a finite set of neural network architectures with linear time over the number of patterns in the training set. SAL is the first learning algorithm to determine neural network architectures in polynomial time. This speedup is obtained by the use of quantum parallelism and a non-linear quantum operator.

  14. Quantum Computing: Selected Internet Resources for Librarians, Researchers, and the Casually Curious

    ERIC Educational Resources Information Center

    Cirasella, Jill

    2009-01-01

    This article presents an annotated selection of the most important and informative Internet resources for learning about quantum computing, finding quantum computing literature, and tracking quantum computing news. All of the quantum computing resources described in this article are freely available, English-language web sites that fall into one…

  15. Quantum Computation Based on Photons with Three Degrees of Freedom

    PubMed Central

    Luo, Ming-Xing; Li, Hui-Ran; Lai, Hong; Wang, Xiaojun

    2016-01-01

    Quantum systems are important resources for quantum computer. Different from previous encoding forms using quantum systems with one degree of freedom (DoF) or two DoFs, we investigate the possibility of photon systems encoding with three DoFs consisting of the polarization DoF and two spatial DoFs. By exploring the optical circular birefringence induced by an NV center in a diamond embedded in the photonic crystal cavity, we propose several hybrid controlled-NOT (hybrid CNOT) gates operating on the two-photon or one-photon system. These hybrid CNOT gates show that three DoFs may be encoded as independent qubits without auxiliary DoFs. Our result provides a useful way to reduce quantum simulation resources by exploring complex quantum systems for quantum applications requiring large qubit systems. PMID:27174302

  16. Computational Role of Tunneling in a Programmable Quantum Annealer

    NASA Technical Reports Server (NTRS)

    Boixo, Sergio; Smelyanskiy, Vadim; Shabani, Alireza; Isakov, Sergei V.; Dykman, Mark; Amin, Mohammad; Mohseni, Masoud; Denchev, Vasil S.; Neven, Hartmut

    2016-01-01

    Quantum tunneling is a phenomenon in which a quantum state tunnels through energy barriers above the energy of the state itself. Tunneling has been hypothesized as an advantageous physical resource for optimization. Here we present the first experimental evidence of a computational role of multiqubit quantum tunneling in the evolution of a programmable quantum annealer. We developed a theoretical model based on a NIBA Quantum Master Equation to describe the multi-qubit dissipative cotunneling effects under the complex noise characteristics of such quantum devices.We start by considering a computational primitive, the simplest non-convex optimization problem consisting of just one global and one local minimum. The quantum evolutions enable tunneling to the global minimum while the corresponding classical paths are trapped in a false minimum. In our study the non-convex potentials are realized by frustrated networks of qubit clusters with strong intra-cluster coupling. We show that the collective effect of the quantum environment is suppressed in the critical phase during the evolution where quantum tunneling decides the right path to solution. In a later stage dissipation facilitates the multiqubit cotunneling leading to the solution state. The predictions of the model accurately describe the experimental data from the D-WaveII quantum annealer at NASA Ames. In our computational primitive the temperature dependence of the probability of success in the quantum model is opposite to that of the classical paths with thermal hopping. Specially, we provide an analysis of an optimization problem with sixteen qubits,demonstrating eight qubit cotunneling that increases success probabilities. Furthermore, we report results for larger problems with up to 200 qubits that contain the primitive as subproblems.

  17. Limits on the Power of Some Models of Quantum Computation

    NASA Astrophysics Data System (ADS)

    Ortiz, Gerardo; Somma, Rolando; Barnum, Howard; Knill, Emanuel

    2006-09-01

    We consider quantum computational models defined via a Lie-algebraic theory. In these models, specified initial states are acted on by Lie-algebraic quantum gates and the expectation values of Lie algebra elements are measured at the end. We show that these models can be efficiently simulated on a classical computer in time polynomial in the dimension of the algebra, regardless of the dimension of the Hilbert space where the algebra acts. Similar results hold for the computation of the expectation value of operators implemented by a gate-sequence. We introduce a Lie-algebraic notion of generalized mean-field Hamiltonians and show that they are efficiently (exactly) solvable by means of a Jacobi-like diagonalization method. Our results generalize earlier ones on fermionic linear optics computation and provide insight into the source of the power of the conventional model of quantum computation.

  18. Limits on the Power of Some Models of Quantum Computation

    NASA Astrophysics Data System (ADS)

    Ortiz, Gerardo; Somma, Rolando; Barnum, Howard; Knill, Emanuel

    We consider quantum computational models defined via a Lie-algebraic theory. In these models, specified initial states are acted on by Lie-algebraic quantum gates and the expectation values of Lie algebra elements are measured at the end. We show that these models can be efficiently simulated on a classical computer in time polynomial in the dimension of the algebra, regardless of the dimension of the Hilbert space where the algebra acts. Similar results hold for the computation of the expectation value of operators implemented by a gate-sequence. We introduce a Lie-algebraic notion of generalized mean-field Hamiltonians and show that they are efficiently (exactly) solvable by means of a Jacobi-like diagonalization method. Our results generalize earlier ones on fermionic linear optics computation and provide insight into the source of the power of the conventional model of quantum computation.

  19. Continuous-Variable Instantaneous Quantum Computing is Hard to Sample.

    PubMed

    Douce, T; Markham, D; Kashefi, E; Diamanti, E; Coudreau, T; Milman, P; van Loock, P; Ferrini, G

    2017-02-17

    Instantaneous quantum computing is a subuniversal quantum complexity class, whose circuits have proven to be hard to simulate classically in the discrete-variable realm. We extend this proof to the continuous-variable (CV) domain by using squeezed states and homodyne detection, and by exploring the properties of postselected circuits. In order to treat postselection in CVs, we consider finitely resolved homodyne detectors, corresponding to a realistic scheme based on discrete probability distributions of the measurement outcomes. The unavoidable errors stemming from the use of finitely squeezed states are suppressed through a qubit-into-oscillator Gottesman-Kitaev-Preskill encoding of quantum information, which was previously shown to enable fault-tolerant CV quantum computation. Finally, we show that, in order to render postselected computational classes in CVs meaningful, a logarithmic scaling of the squeezing parameter with the circuit size is necessary, translating into a polynomial scaling of the input energy.

  20. Continuous-Variable Instantaneous Quantum Computing is Hard to Sample

    NASA Astrophysics Data System (ADS)

    Douce, T.; Markham, D.; Kashefi, E.; Diamanti, E.; Coudreau, T.; Milman, P.; van Loock, P.; Ferrini, G.

    2017-02-01

    Instantaneous quantum computing is a subuniversal quantum complexity class, whose circuits have proven to be hard to simulate classically in the discrete-variable realm. We extend this proof to the continuous-variable (CV) domain by using squeezed states and homodyne detection, and by exploring the properties of postselected circuits. In order to treat postselection in CVs, we consider finitely resolved homodyne detectors, corresponding to a realistic scheme based on discrete probability distributions of the measurement outcomes. The unavoidable errors stemming from the use of finitely squeezed states are suppressed through a qubit-into-oscillator Gottesman-Kitaev-Preskill encoding of quantum information, which was previously shown to enable fault-tolerant CV quantum computation. Finally, we show that, in order to render postselected computational classes in CVs meaningful, a logarithmic scaling of the squeezing parameter with the circuit size is necessary, translating into a polynomial scaling of the input energy.

  1. Computational Multiqubit Tunnelling in Programmable Quantum Annealers

    DTIC Science & Technology

    2016-08-25

    Masoud Mohseni1 & Hartmut Neven1 Quantum tunnelling is a phenomenon in which a quantum state traverses energy barriers higher than the energy of the...the initial temperature must be high to overcome tall energy barriers. As the algorithm progresses, the temperature is gradually lowered to distinguish...between local minima with small energy differences. This causes the stochastic process to freeze once the thermal energy is lower than the height of

  2. Entropic Lattice Boltzmann Models and Quantum Computation

    DTIC Science & Technology

    2008-04-01

    cellular automata, quantum cellular automata, action principles, periodic orbits, turbulence U U U UL 8 Bruce M. Boghosian (617) 627–3054 Contents 1...thereof . . 6 2.5 Lattice Boltzmann algorithm for periodic unstable orbits . . . . . . . . . . . . . . . . . . . . . 7 3 Personnel Supported 7 3.1 2005...continue to work on it in the remaining period of this grant. There are reasons for optimism in the search for quantum circuits described above. First, if

  3. Computational Issues in the Control of Quantum Dynamics

    NASA Astrophysics Data System (ADS)

    Rabitz, Herschel

    2003-03-01

    Computational Issues in the Control of Quantum Dynamics Phenomena Herschel Rabitz Department of Chemistry Princeton University The control of quantum phenomena embraces a variety of applications, with the most common implementation involving tailored laser pulses to steer the dynamics of a quantum system towards some specified observable outcome. The theoretical and computational aspects of this subject are intimately tied to the growing experimental capabilities, especially the ability to perform massive numbers of high throughput experiments. Computational studies in this context have special roles. Especially important is the use of computational techniques to develop new control algorithms, which ultimately would be implemented in the laboratory to guide the control of complex quantum systems. Beyond control alone, many of the same concepts can be exploited for the performance of experiments optimally tuned for inversion, to extract Hamiltonian information. The latter scenario poses very high demands on the efficiency of solving the quantum dynamics equations to extract the information content from the experimental data. The concept of exploiting a computational quantum control tool kit will be introduced as a means for addressing many of these challenges.

  4. Quantum Monte Carlo Endstation for Petascale Computing

    SciTech Connect

    David Ceperley

    2011-03-02

    CUDA GPU platform. We restructured the CPU algorithms to express additional parallelism, minimize GPU-CPU communication, and efficiently utilize the GPU memory hierarchy. Using mixed precision on GT200 GPUs and MPI for intercommunication and load balancing, we observe typical full-application speedups of approximately 10x to 15x relative to quad-core Xeon CPUs alone, while reproducing the double-precision CPU results within statistical error. We developed an all-electron quantum Monte Carlo (QMC) method for solids that does not rely on pseudopotentials, and used it to construct a primary ultra-high-pressure calibration based on the equation of state of cubic boron nitride. We computed the static contribution to the free energy with the QMC method and obtained the phonon contribution from density functional theory, yielding a high-accuracy calibration up to 900 GPa usable directly in experiment. We computed the anharmonic Raman frequency shift with QMC simulations as a function of pressure and temperature, allowing optical pressure calibration. In contrast to present experimental approaches, small systematic errors in the theoretical EOS do not increase with pressure, and no extrapolation is needed. This all-electron method is applicable to first-row solids, providing a new reference for ab initio calculations of solids and benchmarks for pseudopotential accuracy. We compared experimental and theoretical results on the momentum distribution and the quasiparticle renormalization factor in sodium. From an x-ray Compton-profile measurement of the valence-electron momentum density, we derived its discontinuity at the Fermi wavevector finding an accurate measure of the renormalization factor that we compared with quantum-Monte-Carlo and G0W0 calculations performed both on crystalline sodium and on the homogeneous electron gas. Our calculated results are in good agreement with the experiment. We have been studying the heat of formation for various Kubas complexes of molecular

  5. LDRD final report on quantum computing using interacting semiconductor quantum wires.

    SciTech Connect

    Lyo, Sungkwun Kenneth; Dunn, Roberto G.; Lilly, Michael Patrick; Tibbetts, Denise R. ); Stephenson, Larry L.; Seamons, John Andrew; Reno, John Louis; Bielejec, Edward Salvador; Simmons, Jerry Alvon

    2006-01-01

    For several years now quantum computing has been viewed as a new paradigm for certain computing applications. Of particular importance to this burgeoning field is the development of an algorithm for factoring large numbers which obviously has deep implications for cryptography and national security. Implementation of these theoretical ideas faces extraordinary challenges in preparing and manipulating quantum states. The quantum transport group at Sandia has demonstrated world-leading, unique double quantum wires devices where we have unprecedented control over the coupling strength, number of 1 D channels, overlap and interaction strength in this nanoelectronic system. In this project, we study 1D-1D tunneling with the ultimate aim of preparing and detecting quantum states of the coupled wires. In a region of strong tunneling, electrons can coherently oscillate from one wire to the other. By controlling the velocity of the electrons, length of the coupling region and tunneling strength we will attempt to observe tunneling oscillations. This first step is critical for further development double quantum wires into the basic building block for a quantum computer, and indeed for other coupled nanoelectronic devices that will rely on coherent transport. If successful, this project will have important implications for nanoelectronics, quantum computing and information technology.

  6. Blind quantum computation over a collective-noise channel

    NASA Astrophysics Data System (ADS)

    Takeuchi, Yuki; Fujii, Keisuke; Ikuta, Rikizo; Yamamoto, Takashi; Imoto, Nobuyuki

    2016-05-01

    Blind quantum computation (BQC) allows a client (Alice), who only possesses relatively poor quantum devices, to delegate universal quantum computation to a server (Bob) in such a way that Bob cannot know Alice's inputs, algorithm, and outputs. The quantum channel between Alice and Bob is noisy, and the loss over the long-distance quantum communication should also be taken into account. Here we propose to use decoherence-free subspace (DFS) to overcome the collective noise in the quantum channel for BQC, which we call DFS-BQC. We propose three variations of DFS-BQC protocols. One of them, a coherent-light-assisted DFS-BQC protocol, allows Alice to faithfully send the signal photons with a probability proportional to a transmission rate of the quantum channel. In all cases, we combine the ideas based on DFS and the Broadbent-Fitzsimons-Kashefi protocol, which is one of the BQC protocols, without degrading unconditional security. The proposed DFS-based schemes are generic and hence can be applied to other BQC protocols where Alice sends quantum states to Bob.

  7. Geometric algebra and information geometry for quantum computational software

    NASA Astrophysics Data System (ADS)

    Cafaro, Carlo

    2017-03-01

    The art of quantum algorithm design is highly nontrivial. Grover's search algorithm constitutes a masterpiece of quantum computational software. In this article, we use methods of geometric algebra (GA) and information geometry (IG) to enhance the algebraic efficiency and the geometrical significance of the digital and analog representations of Grover's algorithm, respectively. Specifically, GA is used to describe the Grover iterate and the discretized iterative procedure that exploits quantum interference to amplify the probability amplitude of the target-state before measuring the query register. The transition from digital to analog descriptions occurs via Stone's theorem which relates the (unitary) Grover iterate to a suitable (Hermitian) Hamiltonian that controls Schrodinger's quantum mechanical evolution of a quantum state towards the target state. Once the discrete-to-continuos transition is completed, IG is used to interpret Grover's iterative procedure as a geodesic path on the manifold of the parametric density operators of pure quantum states constructed from the continuous approximation of the parametric quantum output state in Grover's algorithm. Finally, we discuss the dissipationless nature of quantum computing, recover the quadratic speedup relation, and identify the superfluity of the Walsh-Hadamard operation from an IG perspective with emphasis on statistical mechanical considerations.

  8. Quantum computing on lattices using global two-qubit gates

    SciTech Connect

    Ivanyos, G.; Massar, S.; Nagy, A. B.

    2005-08-15

    We study the computation power of lattices composed of two-dimensional systems (qubits) on which translationally invariant global two-qubit gates can be performed. We show that if a specific set of six global two qubit gates can be performed and if the initial state of the lattice can be suitably chosen, then a quantum computer can be efficiently simulated.

  9. Computational quantum chemistry and adaptive ligand modeling in mechanistic QSAR.

    PubMed

    De Benedetti, Pier G; Fanelli, Francesca

    2010-10-01

    Drugs are adaptive molecules. They realize this peculiarity by generating different ensembles of prototropic forms and conformers that depend on the environment. Among the impressive amount of available computational drug discovery technologies, quantitative structure-activity relationship approaches that rely on computational quantum chemistry descriptors are the most appropriate to model adaptive drugs. Indeed, computational quantum chemistry descriptors are able to account for the variation of the intramolecular interactions of the training compounds, which reflect their adaptive intermolecular interaction propensities. This enables the development of causative, interpretive and reasonably predictive quantitative structure-activity relationship models, and, hence, sound chemical information finalized to drug design and discovery.

  10. Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network

    PubMed Central

    Goto, Hayato

    2016-01-01

    The dynamics of nonlinear systems qualitatively change depending on their parameters, which is called bifurcation. A quantum-mechanical nonlinear oscillator can yield a quantum superposition of two oscillation states, known as a Schrödinger cat state, via quantum adiabatic evolution through its bifurcation point. Here we propose a quantum computer comprising such quantum nonlinear oscillators, instead of quantum bits, to solve hard combinatorial optimization problems. The nonlinear oscillator network finds optimal solutions via quantum adiabatic evolution, where nonlinear terms are increased slowly, in contrast to conventional adiabatic quantum computation or quantum annealing, where quantum fluctuation terms are decreased slowly. As a result of numerical simulations, it is concluded that quantum superposition and quantum fluctuation work effectively to find optimal solutions. It is also notable that the present computer is analogous to neural computers, which are also networks of nonlinear components. Thus, the present scheme will open new possibilities for quantum computation, nonlinear science, and artificial intelligence. PMID:26899997

  11. Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network

    NASA Astrophysics Data System (ADS)

    Goto, Hayato

    2016-02-01

    The dynamics of nonlinear systems qualitatively change depending on their parameters, which is called bifurcation. A quantum-mechanical nonlinear oscillator can yield a quantum superposition of two oscillation states, known as a Schrödinger cat state, via quantum adiabatic evolution through its bifurcation point. Here we propose a quantum computer comprising such quantum nonlinear oscillators, instead of quantum bits, to solve hard combinatorial optimization problems. The nonlinear oscillator network finds optimal solutions via quantum adiabatic evolution, where nonlinear terms are increased slowly, in contrast to conventional adiabatic quantum computation or quantum annealing, where quantum fluctuation terms are decreased slowly. As a result of numerical simulations, it is concluded that quantum superposition and quantum fluctuation work effectively to find optimal solutions. It is also notable that the present computer is analogous to neural computers, which are also networks of nonlinear components. Thus, the present scheme will open new possibilities for quantum computation, nonlinear science, and artificial intelligence.

  12. Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network.

    PubMed

    Goto, Hayato

    2016-02-22

    The dynamics of nonlinear systems qualitatively change depending on their parameters, which is called bifurcation. A quantum-mechanical nonlinear oscillator can yield a quantum superposition of two oscillation states, known as a Schrödinger cat state, via quantum adiabatic evolution through its bifurcation point. Here we propose a quantum computer comprising such quantum nonlinear oscillators, instead of quantum bits, to solve hard combinatorial optimization problems. The nonlinear oscillator network finds optimal solutions via quantum adiabatic evolution, where nonlinear terms are increased slowly, in contrast to conventional adiabatic quantum computation or quantum annealing, where quantum fluctuation terms are decreased slowly. As a result of numerical simulations, it is concluded that quantum superposition and quantum fluctuation work effectively to find optimal solutions. It is also notable that the present computer is analogous to neural computers, which are also networks of nonlinear components. Thus, the present scheme will open new possibilities for quantum computation, nonlinear science, and artificial intelligence.

  13. PERSPECTIVE: From computational quantum chemistry to computational biology: experiments and computations are (full) partners

    NASA Astrophysics Data System (ADS)

    Ma, Buyong; Nussinov, Ruth

    2004-12-01

    Computations are being integrated into biological research at an increasingly fast pace. This has not only changed the way in which biological information is managed; it has also changed the way in which experiments are planned in order to obtain information from nature. Can experiments and computations be full partners? Computational chemistry has expanded over the years, proceeding from computations of a hydrogen molecule toward the challenging goal of systems biology, which attempts to handle the entire living cell. Applying theories from ab initio quantum mechanics to simplified models, the virtual worlds explored by computations provide replicas of real-world phenomena. At the same time, the virtual worlds can affect our perception of the real world. Computational biology targets a world of complex organization, for which a unified theory is unlikely to exist. A computational biology model, even if it has a clear physical or chemical basis, may not reduce to physics and chemistry. At the molecular level, computational biology and experimental biology have already been partners, mutually benefiting from each other. For the perception to become reality, computation and experiment should be united as full partners in biological research.

  14. Entanglement-based machine learning on a quantum computer.

    PubMed

    Cai, X-D; Wu, D; Su, Z-E; Chen, M-C; Wang, X-L; Li, Li; Liu, N-L; Lu, C-Y; Pan, J-W

    2015-03-20

    Machine learning, a branch of artificial intelligence, learns from previous experience to optimize performance, which is ubiquitous in various fields such as computer sciences, financial analysis, robotics, and bioinformatics. A challenge is that machine learning with the rapidly growing "big data" could become intractable for classical computers. Recently, quantum machine learning algorithms [Lloyd, Mohseni, and Rebentrost, arXiv.1307.0411] were proposed which could offer an exponential speedup over classical algorithms. Here, we report the first experimental entanglement-based classification of two-, four-, and eight-dimensional vectors to different clusters using a small-scale photonic quantum computer, which are then used to implement supervised and unsupervised machine learning. The results demonstrate the working principle of using quantum computers to manipulate and classify high-dimensional vectors, the core mathematical routine in machine learning. The method can, in principle, be scaled to larger numbers of qubits, and may provide a new route to accelerate machine learning.

  15. Entanglement-Based Machine Learning on a Quantum Computer

    NASA Astrophysics Data System (ADS)

    Cai, X.-D.; Wu, D.; Su, Z.-E.; Chen, M.-C.; Wang, X.-L.; Li, Li; Liu, N.-L.; Lu, C.-Y.; Pan, J.-W.

    2015-03-01

    Machine learning, a branch of artificial intelligence, learns from previous experience to optimize performance, which is ubiquitous in various fields such as computer sciences, financial analysis, robotics, and bioinformatics. A challenge is that machine learning with the rapidly growing "big data" could become intractable for classical computers. Recently, quantum machine learning algorithms [Lloyd, Mohseni, and Rebentrost, arXiv.1307.0411] were proposed which could offer an exponential speedup over classical algorithms. Here, we report the first experimental entanglement-based classification of two-, four-, and eight-dimensional vectors to different clusters using a small-scale photonic quantum computer, which are then used to implement supervised and unsupervised machine learning. The results demonstrate the working principle of using quantum computers to manipulate and classify high-dimensional vectors, the core mathematical routine in machine learning. The method can, in principle, be scaled to larger numbers of qubits, and may provide a new route to accelerate machine learning.

  16. Continuous-variable quantum computing on encrypted data.

    PubMed

    Marshall, Kevin; Jacobsen, Christian S; Schäfermeier, Clemens; Gehring, Tobias; Weedbrook, Christian; Andersen, Ulrik L

    2016-12-14

    The ability to perform computations on encrypted data is a powerful tool for protecting a client's privacy, especially in today's era of cloud and distributed computing. In terms of privacy, the best solutions that classical techniques can achieve are unfortunately not unconditionally secure in the sense that they are dependent on a hacker's computational power. Here we theoretically investigate, and experimentally demonstrate with Gaussian displacement and squeezing operations, a quantum solution that achieves the security of a user's privacy using the practical technology of continuous variables. We demonstrate losses of up to 10 km both ways between the client and the server and show that security can still be achieved. Our approach offers a number of practical benefits (from a quantum perspective) that could one day allow the potential widespread adoption of this quantum technology in future cloud-based computing networks.

  17. Continuous-variable quantum computing on encrypted data

    NASA Astrophysics Data System (ADS)

    Marshall, Kevin; Jacobsen, Christian S.; Schäfermeier, Clemens; Gehring, Tobias; Weedbrook, Christian; Andersen, Ulrik L.

    2016-12-01

    The ability to perform computations on encrypted data is a powerful tool for protecting a client's privacy, especially in today's era of cloud and distributed computing. In terms of privacy, the best solutions that classical techniques can achieve are unfortunately not unconditionally secure in the sense that they are dependent on a hacker's computational power. Here we theoretically investigate, and experimentally demonstrate with Gaussian displacement and squeezing operations, a quantum solution that achieves the security of a user's privacy using the practical technology of continuous variables. We demonstrate losses of up to 10 km both ways between the client and the server and show that security can still be achieved. Our approach offers a number of practical benefits (from a quantum perspective) that could one day allow the potential widespread adoption of this quantum technology in future cloud-based computing networks.

  18. Continuous-variable quantum computing on encrypted data

    PubMed Central

    Marshall, Kevin; Jacobsen, Christian S.; Schäfermeier, Clemens; Gehring, Tobias; Weedbrook, Christian; Andersen, Ulrik L.

    2016-01-01

    The ability to perform computations on encrypted data is a powerful tool for protecting a client's privacy, especially in today's era of cloud and distributed computing. In terms of privacy, the best solutions that classical techniques can achieve are unfortunately not unconditionally secure in the sense that they are dependent on a hacker's computational power. Here we theoretically investigate, and experimentally demonstrate with Gaussian displacement and squeezing operations, a quantum solution that achieves the security of a user's privacy using the practical technology of continuous variables. We demonstrate losses of up to 10 km both ways between the client and the server and show that security can still be achieved. Our approach offers a number of practical benefits (from a quantum perspective) that could one day allow the potential widespread adoption of this quantum technology in future cloud-based computing networks. PMID:27966528

  19. Kochen-Specker Theorem as a Precondition for Quantum Computing

    NASA Astrophysics Data System (ADS)

    Nagata, Koji; Nakamura, Tadao

    2016-12-01

    We study the relation between the Kochen-Specker theorem (the KS theorem) and quantum computing. The KS theorem rules out a realistic theory of the KS type. We consider the realistic theory of the KS type that the results of measurements are either +1 or -1. We discuss an inconsistency between the realistic theory of the KS type and the controllability of quantum computing. We have to give up the controllability if we accept the realistic theory of the KS type. We discuss an inconsistency between the realistic theory of the KS type and the observability of quantum computing. We discuss the inconsistency by using the double-slit experiment as the most basic experiment in quantum mechanics. This experiment can be for an easy detector to a Pauli observable. We cannot accept the realistic theory of the KS type to simulate the double-slit experiment in a significant specific case. The realistic theory of the KS type can not depicture quantum detector. In short, we have to give up both the observability and the controllability if we accept the realistic theory of the KS type. Therefore, the KS theorem is a precondition for quantum computing, i.e., the realistic theory of the KS type should be ruled out.

  20. From transistor to trapped-ion computers for quantum chemistry

    PubMed Central

    Yung, M.-H.; Casanova, J.; Mezzacapo, A.; McClean, J.; Lamata, L.; Aspuru-Guzik, A.; Solano, E.

    2014-01-01

    Over the last few decades, quantum chemistry has progressed through the development of computational methods based on modern digital computers. However, these methods can hardly fulfill the exponentially-growing resource requirements when applied to large quantum systems. As pointed out by Feynman, this restriction is intrinsic to all computational models based on classical physics. Recently, the rapid advancement of trapped-ion technologies has opened new possibilities for quantum control and quantum simulations. Here, we present an efficient toolkit that exploits both the internal and motional degrees of freedom of trapped ions for solving problems in quantum chemistry, including molecular electronic structure, molecular dynamics, and vibronic coupling. We focus on applications that go beyond the capacity of classical computers, but may be realizable on state-of-the-art trapped-ion systems. These results allow us to envision a new paradigm of quantum chemistry that shifts from the current transistor to a near-future trapped-ion-based technology. PMID:24395054

  1. Towards a fullerene-based quantum computer

    NASA Astrophysics Data System (ADS)

    Benjamin, Simon C.; Ardavan, Arzhang; Briggs, G. Andrew D.; Britz, David A.; Gunlycke, Daniel; Jefferson, John; Jones, Mark A. G.; Leigh, David F.; Lovett, Brendon W.; Khlobystov, Andrei N.; Lyon, S. A.; Morton, John J. L.; Porfyrakis, Kyriakos; Sambrook, Mark R.; Tyryshkin, Alexei M.

    2006-05-01

    Molecular structures appear to be natural candidates for a quantum technology: individual atoms can support quantum superpositions for long periods, and such atoms can in principle be embedded in a permanent molecular scaffolding to form an array. This would be true nanotechnology, with dimensions of order of a nanometre. However, the challenges of realizing such a vision are immense. One must identify a suitable elementary unit and demonstrate its merits for qubit storage and manipulation, including input/output. These units must then be formed into large arrays corresponding to an functional quantum architecture, including a mechanism for gate operations. Here we report our efforts, both experimental and theoretical, to create such a technology based on endohedral fullerenes or 'buckyballs'. We describe our successes with respect to these criteria, along with the obstacles we are currently facing and the questions that remain to be addressed.

  2. Quantum computing with spin cluster qubits.

    PubMed

    Meier, Florian; Levy, Jeremy; Loss, Daniel

    2003-01-31

    We study the low energy states of finite spin chains with isotropic (Heisenberg) and anisotropic (XY and Ising-like) antiferromagnetic exchange interaction with uniform and nonuniform coupling constants. We show that for an odd number of sites a spin cluster qubit can be defined in terms of the ground state doublet. This qubit is remarkably insensitive to the placement and coupling anisotropy of spins within the cluster. One- and two-qubit quantum gates can be generated by magnetic fields and intercluster exchange, and leakage during quantum gate operation is small. Spin cluster qubits inherit the long decoherence times and short gate operation times of single spins. Control of single spins is hence not necessary for the realization of universal quantum gates.

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

    SciTech Connect

    D'Ariano, Giacomo Mauro

    2010-05-04

    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.

  4. Noise tailoring for scalable quantum computation via randomized compiling

    NASA Astrophysics Data System (ADS)

    Wallman, Joel J.; Emerson, Joseph

    2016-11-01

    Quantum computers are poised to radically outperform their classical counterparts by manipulating coherent quantum systems. A realistic quantum computer will experience errors due to the environment and imperfect control. When these errors are even partially coherent, they present a major obstacle to performing robust computations. Here, we propose a method for introducing independent random single-qubit gates into the logical circuit in such a way that the effective logical circuit remains unchanged. We prove that this randomization tailors the noise into stochastic Pauli errors, which can dramatically reduce error rates while introducing little or no experimental overhead. Moreover, we prove that our technique is robust to the inevitable variation in errors over the randomizing gates and numerically illustrate the dramatic reductions in worst-case error that are achievable. Given such tailored noise, gates with significantly lower fidelity—comparable to fidelities realized in current experiments—are sufficient to achieve fault-tolerant quantum computation. Furthermore, the worst-case error rate of the tailored noise can be directly and efficiently measured through randomized benchmarking protocols, enabling a rigorous certification of the performance of a quantum computer.

  5. A scalable architecture for quantum computation with molecular nanomagnets.

    PubMed

    Jenkins, M D; Zueco, D; Roubeau, O; Aromí, G; Majer, J; Luis, F

    2016-11-14

    A proposal for a magnetic quantum processor that consists of individual molecular spins coupled to superconducting coplanar resonators and transmission lines is carefully examined. We derive a simple magnetic quantum electrodynamics Hamiltonian to describe the underlying physics. It is shown that these hybrid devices can perform arbitrary operations on each spin qubit and induce tunable interactions between any pair of them. The combination of these two operations ensures that the processor can perform universal quantum computations. The feasibility of this proposal is critically discussed using the results of realistic calculations, based on parameters of existing devices and molecular qubits. These results show that the proposal is feasible, provided that molecules with sufficiently long coherence times can be developed and accurately integrated into specific areas of the device. This architecture has an enormous potential for scaling up quantum computation thanks to the microscopic nature of the individual constituents, the molecules, and the possibility of using their internal spin degrees of freedom.

  6. Linear optical quantum computing in a single spatial mode.

    PubMed

    Humphreys, Peter C; Metcalf, Benjamin J; Spring, Justin B; Moore, Merritt; Jin, Xian-Min; Barbieri, Marco; Kolthammer, W Steven; Walmsley, Ian A

    2013-10-11

    We present a scheme for linear optical quantum computing using time-bin-encoded qubits in a single spatial mode. We show methods for single-qubit operations and heralded controlled-phase (cphase) gates, providing a sufficient set of operations for universal quantum computing with the Knill-Laflamme-Milburn [Nature (London) 409, 46 (2001)] scheme. Our protocol is suited to currently available photonic devices and ideally allows arbitrary numbers of qubits to be encoded in the same spatial mode, demonstrating the potential for time-frequency modes to dramatically increase the quantum information capacity of fixed spatial resources. As a test of our scheme, we demonstrate the first entirely single spatial mode implementation of a two-qubit quantum gate and show its operation with an average fidelity of 0.84±0.07.

  7. Characterization of scalable ion traps for quantum computation

    NASA Astrophysics Data System (ADS)

    Epstein, R. J.; Bollinger, J. J.; Leibfried, D.; Seidelin, S.; Britton, J.; Wesenberg, J. H.; Shiga, N.; Amini, J. M.; Blakestad, R. B.; Brown, K. R.; Home, J. P.; Itano, W. M.; Jost, J. D.; Langer, C.; Ozeri, R.; Wineland, D. J.

    2007-03-01

    We discuss the experimental characterization of several scalable ion trap architectures for quantum information processing. We have developed an apparatus for testing planar ion trap chips which features: a standardized chip carrier for ease of interchanging traps, a single-laser Raman cooling scheme, and photo-ionization loading of Mg^+ ions. The primary benchmark for a given trap is the heating rate of the ion motional degrees of freedom, which can reduce multi-ion quantum gate fidelities. As the heating rate depends on the ion trap geometry and materials, our testing apparatus allows for efficient iteration and optimization of trap parameters. With the recent ability to fabricate planar traps with sufficiently low heating rates for quantum computation ^2, we describe current results on the simulation and fabrication of planar traps with multiple intersecting trapping zones for versatile ion choreography. S. Seidelin et al., Phys. Rev. Lett. 96, 253003 (2006). J. Kim, et al., Quantum Inf. Comput. 5, 515 (2005).

  8. How to simulate a universal quantum computer using negative probabilities

    NASA Astrophysics Data System (ADS)

    Hofmann, Holger F.

    2009-07-01

    The concept of negative probabilities can be used to decompose the interaction of two qubits mediated by a quantum controlled-NOT into three operations that require only classical interactions (that is, local operations and classical communication) between the qubits. For a single gate, the probabilities of the three operations are 1, 1 and -1. This decomposition can be applied in a probabilistic simulation of quantum computation by randomly choosing one of the three operations for each gate and assigning a negative statistical weight to the outcomes of sequences with an odd number of negative probability operations. The maximal exponential speed-up of a quantum computer can then be evaluated in terms of the increase in the number of sequences needed to simulate a single operation of the quantum circuit.

  9. Scheme for Entering Binary Data Into a Quantum Computer

    NASA Technical Reports Server (NTRS)

    Williams, Colin

    2005-01-01

    A quantum algorithm provides for the encoding of an exponentially large number of classical data bits by use of a smaller (polynomially large) number of quantum bits (qubits). The development of this algorithm was prompted by the need, heretofore not satisfied, for a means of entering real-world binary data into a quantum computer. The data format provided by this algorithm is suitable for subsequent ultrafast quantum processing of the entered data. Potential applications lie in disciplines (e.g., genomics) in which one needs to search for matches between parts of very long sequences of data. For example, the algorithm could be used to encode the N-bit-long human genome in only log2N qubits. The resulting log2N-qubit state could then be used for subsequent quantum data processing - for example, to perform rapid comparisons of sequences.

  10. Universal quantum computation with hybrid spin-Majorana qubits

    NASA Astrophysics Data System (ADS)

    Hoffman, Silas; Schrade, Constantin; Klinovaja, Jelena; Loss, Daniel

    2016-07-01

    We theoretically propose a set of universal quantum gates acting on a hybrid qubit formed by coupling a quantum-dot spin qubit and Majorana fermion qubit. First, we consider a quantum dot that is tunnel coupled to two topological superconductors. The effective spin-Majorana exchange facilitates a hybrid cnot gate for which either qubit can be the control or target. The second setup is a modular scalable network of topological superconductors and quantum dots. As a result of the exchange interaction between adjacent spin qubits, a cnot gate is implemented that acts on neighboring Majorana qubits and eliminates the necessity of interqubit braiding. In both setups, the spin-Majorana exchange interaction allows for a phase gate, acting on either the spin or the Majorana qubit, and for a swap or hybrid swap gate which is sufficient for universal quantum computation without projective measurements.

  11. Quantum Computational Complexity of Spin Glasses

    DTIC Science & Technology

    2011-03-19

    the absence of an external magnetic field, and the Robertson - Seymour theorem from graph theory. We gave as an example a set of quantum circuits with a...classical algorithm for the Ising partition function of any planar graph in the absence of an external magnetic field, and the Robertson - Seymour theorem

  12. Prime factorization using quantum annealing and computational algebraic geometry

    PubMed Central

    Dridi, Raouf; Alghassi, Hedayat

    2017-01-01

    We investigate prime factorization from two perspectives: quantum annealing and computational algebraic geometry, specifically Gröbner bases. We present a novel autonomous algorithm which combines the two approaches and leads to the factorization of all bi-primes up to just over 200000, the largest number factored to date using a quantum processor. We also explain how Gröbner bases can be used to reduce the degree of Hamiltonians. PMID:28220854

  13. Prime factorization using quantum annealing and computational algebraic geometry

    NASA Astrophysics Data System (ADS)

    Dridi, Raouf; Alghassi, Hedayat

    2017-02-01

    We investigate prime factorization from two perspectives: quantum annealing and computational algebraic geometry, specifically Gröbner bases. We present a novel autonomous algorithm which combines the two approaches and leads to the factorization of all bi-primes up to just over 200000, the largest number factored to date using a quantum processor. We also explain how Gröbner bases can be used to reduce the degree of Hamiltonians.

  14. Three-Dimensional Wiring for Extensible Quantum Computing: The Quantum Socket

    NASA Astrophysics Data System (ADS)

    Béjanin, J. H.; McConkey, T. G.; Rinehart, J. R.; Earnest, C. T.; McRae, C. R. H.; Shiri, D.; Bateman, J. D.; Rohanizadegan, Y.; Penava, B.; Breul, P.; Royak, S.; Zapatka, M.; Fowler, A. G.; Mariantoni, M.

    2016-10-01

    Quantum computing architectures are on the verge of scalability, a key requirement for the implementation of a universal quantum computer. The next stage in this quest is the realization of quantum error-correction codes, which will mitigate the impact of faulty quantum information on a quantum computer. Architectures with ten or more quantum bits (qubits) have been realized using trapped ions and superconducting circuits. While these implementations are potentially scalable, true scalability will require systems engineering to combine quantum and classical hardware. One technology demanding imminent efforts is the realization of a suitable wiring method for the control and the measurement of a large number of qubits. In this work, we introduce an interconnect solution for solid-state qubits: the quantum socket. The quantum socket fully exploits the third dimension to connect classical electronics to qubits with higher density and better performance than two-dimensional methods based on wire bonding. The quantum socket is based on spring-mounted microwires—the three-dimensional wires—that push directly on a microfabricated chip, making electrical contact. A small wire cross section (approximately 1 mm), nearly nonmagnetic components, and functionality at low temperatures make the quantum socket ideal for operating solid-state qubits. The wires have a coaxial geometry and operate over a frequency range from dc to 8 GHz, with a contact resistance of approximately 150 m Ω , an impedance mismatch of approximately 10 Ω , and minimal cross talk. As a proof of principle, we fabricate and use a quantum socket to measure high-quality superconducting resonators at a temperature of approximately 10 mK. Quantum error-correction codes such as the surface code will largely benefit from the quantum socket, which will make it possible to address qubits located on a two-dimensional lattice. The present implementation of the socket could be readily extended to accommodate a

  15. Topological quantum computing with Read-Rezayi states.

    PubMed

    Hormozi, L; Bonesteel, N E; Simon, S H

    2009-10-16

    Read-Rezayi fractional quantum Hall states are among the prime candidates for realizing non-Abelian anyons which, in principle, can be used for topological quantum computation. We present a prescription for efficiently finding braids which can be used to carry out a universal set of quantum gates on encoded qubits based on anyons of the Read-Rezayi states with k>2, k not equal 4. This work extends previous results which only applied to the case k=3 (Fibonacci) and clarifies why, in that case, gate constructions are simpler than for a generic Read-Rezayi state.

  16. Computer studies of multiple-quantum spin dynamics

    SciTech Connect

    Murdoch, J.B.

    1982-11-01

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

  17. Exploiting geometric degrees of freedom in topological quantum computing

    SciTech Connect

    Xu Haitan; Wan Xin

    2009-07-15

    In a topological quantum computer, braids of non-Abelian anyons in a (2+1)-dimensional space time form quantum gates, whose fault tolerance relies on the topological, rather than geometric, properties of the braids. Here we propose to create and exploit redundant geometric degrees of freedom to improve the theoretical accuracy of topological single- and two-qubit quantum gates. We demonstrate the power of the idea using explicit constructions in the Fibonacci model. We compare its efficiency with that of the Solovay-Kitaev algorithm and explain its connection to the leakage errors reduction in an earlier construction [H. Xu and X. Wan, Phys. Rev. A 78, 042325 (2008)].

  18. Positive Wigner functions render classical simulation of quantum computation efficient.

    PubMed

    Mari, A; Eisert, J

    2012-12-07

    We show that quantum circuits where the initial state and all the following quantum operations can be represented by positive Wigner functions can be classically efficiently simulated. This is true both for continuous-variable as well as discrete variable systems in odd prime dimensions, two cases which will be treated on entirely the same footing. Noting the fact that Clifford and Gaussian operations preserve the positivity of the Wigner function, our result generalizes the Gottesman-Knill theorem. Our algorithm provides a way of sampling from the output distribution of a computation or a simulation, including the efficient sampling from an approximate output distribution in the case of sampling imperfections for initial states, gates, or measurements. In this sense, this work highlights the role of the positive Wigner function as separating classically efficiently simulable systems from those that are potentially universal for quantum computing and simulation, and it emphasizes the role of negativity of the Wigner function as a computational resource.

  19. Investigation of Quantum Computing With Laughlin Quasiparticles

    DTIC Science & Technology

    2007-12-31

    Review B 72, 075342, 1-8 (2005) F.E.Camino, W.Zhou, and V.J.Goldman Aharonov - Bohm electron interferometer in the integer quantum Hall regime Physical...Review B 72, 155313, 1-6 (2005) F.E.Camino, W.Zhou, and V.J.Goldman Aharonov - Bohm Superperiod in a Laughlin Quasiparticle Interferometer Physical...is the number of particles being encircled. This quantization condition explicitly adds the Aharonov - Bohm and the statistical contributions to the

  20. Dynamical localization simulated on a few-qubit quantum computer

    SciTech Connect

    Benenti, Giuliano; Montangero, Simone; Casati, Giulio; Shepelyansky, Dima L.

    2003-05-01

    We show that a quantum computer operating with a small number of qubits can simulate the dynamical localization of classical chaos in a system described by the quantum sawtooth map model. The dynamics of the system is computed efficiently up to a time t{>=}l, and then the localization length l can be obtained with accuracy {nu} by means of order 1/{nu}{sup 2} computer runs, followed by coarse-grained projective measurements on the computational basis. We also show that in the presence of static imperfections, a reliable computation of the localization length is possible without error correction up to an imperfection threshold which drops polynomially with the number of qubits.

  1. Towards robust dynamical decoupling and high fidelity adiabatic quantum computation

    NASA Astrophysics Data System (ADS)

    Quiroz, Gregory

    Quantum computation (QC) relies on the ability to implement high-fidelity quantum gate operations and successfully preserve quantum state coherence. One of the most challenging obstacles for reliable QC is overcoming the inevitable interaction between a quantum system and its environment. Unwanted interactions result in decoherence processes that cause quantum states to deviate from a desired evolution, consequently leading to computational errors and loss of coherence. Dynamical decoupling (DD) is one such method, which seeks to attenuate the effects of decoherence by applying strong and expeditious control pulses solely to the system. Provided the pulses are applied over a time duration sufficiently shorter than the correlation time associated with the environment dynamics, DD effectively averages out undesirable interactions and preserves quantum states with a low probability of error, or fidelity loss. In this study various aspects of this approach are studied from sequence construction to applications of DD to protecting QC. First, a comprehensive examination of the error suppression properties of a near-optimal DD approach is given to understand the relationship between error suppression capabilities and the number of required DD control pulses in the case of ideal, instantaneous pulses. While such considerations are instructive for examining DD efficiency, i.e., performance vs the number of control pulses, high-fidelity DD in realizable systems is difficult to achieve due to intrinsic pulse imperfections which further contribute to decoherence. As a second consideration, it is shown how one can overcome this hurdle and achieve robustness and recover high-fidelity DD in the presence of faulty control pulses using Genetic Algorithm optimization and sequence symmetrization. Thirdly, to illustrate the implementation of DD in conjunction with QC, the utilization of DD and quantum error correction codes (QECCs) as a protection method for adiabatic quantum

  2. Efficient computations of quantum canonical Gibbs state in phase space

    NASA Astrophysics Data System (ADS)

    Bondar, Denys I.; Campos, Andre G.; Cabrera, Renan; Rabitz, Herschel A.

    2016-06-01

    The Gibbs canonical state, as a maximum entropy density matrix, represents a quantum system in equilibrium with a thermostat. This state plays an essential role in thermodynamics and serves as the initial condition for nonequilibrium dynamical simulations. We solve a long standing problem for computing the Gibbs state Wigner function with nearly machine accuracy by solving the Bloch equation directly in the phase space. Furthermore, the algorithms are provided yielding high quality Wigner distributions for pure stationary states as well as for Thomas-Fermi and Bose-Einstein distributions. The developed numerical methods furnish a long-sought efficient computation framework for nonequilibrium quantum simulations directly in the Wigner representation.

  3. Adiabatic quantum computing with spin qubits hosted by molecules.

    PubMed

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

    2015-01-28

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

  4. Magnetic resonance force microscopy and a solid state quantum computer.

    SciTech Connect

    Pelekhov, D. V.; Martin, I.; Suter, A.; Reagor, D. W.; Hammel, P. C.

    2001-01-01

    A Quantum Computer (QC) is a device that utilizes the principles of Quantum Mechanics to perform computations. Such a machine would be capable of accomplishing tasks not achievable by means of any conventional digital computer, for instance factoring large numbers. Currently it appears that the QC architecture based on an array of spin quantum bits (qubits) embedded in a solid-state matrix is one of the most promising approaches to fabrication of a scalable QC. However, the fabrication and operation of a Solid State Quantum Computer (SSQC) presents very formidable challenges; primary amongst these are: (1) the characterization and control of the fabrication process of the device during its construction and (2) the readout of the computational result. Magnetic Resonance Force Microscopy (MRFM)--a novel scanning probe technique based on mechanical detection of magnetic resonance-provides an attractive means of addressing these requirements. The sensitivity of the MRFM significantly exceeds that of conventional magnetic resonance measurement methods, and it has the potential for single electron spin detection. Moreover, the MRFM is capable of true 3D subsurface imaging. These features will make MRFM an invaluable tool for the implementation of a spin-based QC. Here we present the general principles of MRFM operation, the current status of its development and indicate future directions for its improvement.

  5. Lattice surgery translation for quantum computation

    NASA Astrophysics Data System (ADS)

    Herr, Daniel; Nori, Franco; Devitt, Simon J.

    2017-01-01

    In this paper we outline a method for a compiler to translate any non fault tolerant quantum circuit to the geometric representation of the lattice surgery error-correcting code using inherent merge and split operations. Since the efficiency of state distillation procedures has not yet been investigated in the lattice surgery model, their translation is given as an example using the proposed method. The resource requirements seem comparable or better to the defect-based state distillation process, but modularity and eventual implementability allow the lattice surgery model to be an interesting alternative to braiding.

  6. Computational nuclear quantum many-body problem: The UNEDF project

    SciTech Connect

    Fann, George I

    2013-01-01

    The UNEDF project was a large-scale collaborative effort that applied high-performance computing to the nuclear quantum many-body problem. The primary focus of the project was on constructing, validating, and applying an optimized nuclear energy density functional, which entailed a wide range of pioneering developments in microscopic nuclear structure and reactions, algorithms, high-performance computing, and uncertainty quantification. UNEDF demonstrated that close associations among nuclear physicists, mathematicians, and computer scientists can lead to novel physics outcomes built on algorithmic innovations and computational developments. This review showcases a wide range of UNEDF science results to illustrate this interplay.

  7. Implementation scheme of controlled SWAP gates for quantum fingerprinting and photonic quantum computation

    SciTech Connect

    Wang, B.; Duan, L.-M.

    2007-05-15

    We propose a scheme to implement quantum controlled SWAP gates by directing single-photon pulses to a two-sided cavity with a single trapped atom. The resultant gates can be used to realize quantum fingerprinting and universal photonic quantum computation. We present a theoretical model for our scheme and analyze its performance under practical noise, including spontaneous emission and randomness of atom-cavity coupling strength. It is shown that our scheme should be robust against practical imperfections in current cavity QED experiment setup.

  8. Reducing the overhead for quantum computation when noise is biased

    NASA Astrophysics Data System (ADS)

    Webster, Paul; Bartlett, Stephen D.; Poulin, David

    2015-12-01

    We analyze a model for fault-tolerant quantum computation with low overhead suitable for situations where the noise is biased. The basis for this scheme is a gadget for the fault-tolerant preparation of magic states that enable universal fault-tolerant quantum computation using only Clifford gates that preserve the noise bias. We analyze the distillation of |T > -type magic states using this gadget at the physical level, followed by concatenation with the 15-qubit quantum Reed-Muller code, and comparing our results with standard constructions. In the regime where the noise bias (rate of Pauli Z errors relative to other single-qubit errors) is greater than a factor of 10, our scheme has lower overhead across a broad range of relevant noise rates.

  9. Indications for quantum computation requirements from comparative brain analysis

    NASA Astrophysics Data System (ADS)

    Bernroider, Gustav; Baer, Wolfgang

    2010-04-01

    Whether or not neuronal signal properties can engage 'non-trivial', i.e. functionally significant, quantum properties, is the subject of an ongoing debate. Here we provide evidence that quantum coherence dynamics can play a functional role in ion conduction mechanism with consequences on the shape and associative character of classical membrane signals. In particular, these new perspectives predict that a specific neuronal topology (e.g. the connectivity pattern of cortical columns in the primate brain) is less important and not really required to explain abilities in perception and sensory-motor integration. Instead, this evidence is suggestive for a decisive role of the number and functional segregation of ion channel proteins that can be engaged in a particular neuronal constellation. We provide evidence from comparative brain studies and estimates of computational capacity behind visual flight functions suggestive for a possible role of quantum computation in biological systems.

  10. Towards accurate quantum simulations of large systems with small computers

    NASA Astrophysics Data System (ADS)

    Yang, Yonggang

    2017-01-01

    Numerical simulations are important for many systems. In particular, various standard computer programs have been developed for solving the quantum Schrödinger equations. However, the accuracy of these calculations is limited by computer capabilities. In this work, an iterative method is introduced to enhance the accuracy of these numerical calculations, which is otherwise prohibitive by conventional methods. The method is easily implementable and general for many systems.

  11. Towards accurate quantum simulations of large systems with small computers.

    PubMed

    Yang, Yonggang

    2017-01-24

    Numerical simulations are important for many systems. In particular, various standard computer programs have been developed for solving the quantum Schrödinger equations. However, the accuracy of these calculations is limited by computer capabilities. In this work, an iterative method is introduced to enhance the accuracy of these numerical calculations, which is otherwise prohibitive by conventional methods. The method is easily implementable and general for many systems.

  12. NMR System for a Type II Quantum Computer

    DTIC Science & Technology

    2007-06-01

    26:1484-1509, 1997. [3] R. Feynman . Simulating physics with computers. International Journal of Theoretical Physics , 21(6-7):467-488, 1982. [4] S...and J. Ford. Stochastic behavior in classical and quantum hamiltonian systems. Lecture Notes in Physics , 93:334, 1979. [17] Z. Chen, J. Yepez, and D...1987. [36] R. P. Feynman . Simulating physics with computers. International Journal of Theo- retical Physics , 21(6-7):467-488, 1981/82. [37] E. M

  13. Towards accurate quantum simulations of large systems with small computers

    PubMed Central

    Yang, Yonggang

    2017-01-01

    Numerical simulations are important for many systems. In particular, various standard computer programs have been developed for solving the quantum Schrödinger equations. However, the accuracy of these calculations is limited by computer capabilities. In this work, an iterative method is introduced to enhance the accuracy of these numerical calculations, which is otherwise prohibitive by conventional methods. The method is easily implementable and general for many systems. PMID:28117366

  14. Robust Manipulation and Computation for Inhomogeneous Quantum Ensembles

    DTIC Science & Technology

    2013-07-01

    which inspired the de- velopment of a unified computational method based on pseudospectral approximations for solving optimal ensemble control...excitation profiles of broadband π pulses. (a) The optimal broadband π pulse shape was derived by the multivariate pseudospectral method with the...design in quantum control based on multidimensional pseudospectral approximations, by which a continuous-time optimal control problem of pulse design

  15. Adapting the traveling salesman problem to an adiabatic quantum computer

    NASA Astrophysics Data System (ADS)

    Warren, Richard H.

    2013-04-01

    We show how to guide a quantum computer to select an optimal tour for the traveling salesman. This is significant because it opens a rapid solution method for the wide range of applications of the traveling salesman problem, which include vehicle routing, job sequencing and data clustering.

  16. A Computational Model for Observation in Quantum Mechanics.

    DTIC Science & Technology

    1987-03-16

    Computer Science Technical Report No. 191, May 1986. [Feynman63j Feynman , R. P., Leighton, R. B., and Sands, M. The Feynman Lectures on Physics...MIT Artificial Intelligence Laboratory Memo 380, Sept. 1976. [Wheeler83] Wheeler , J. A., and Zurek, W. H. Quantum Theory and Measuremrent 72 .4

  17. Efficient free energy calculations of quantum systems through computer simulations

    NASA Astrophysics Data System (ADS)

    Antonelli, Alex; Ramirez, Rafael; Herrero, Carlos; Hernandez, Eduardo

    2009-03-01

    In general, the classical limit is assumed in computer simulation calculations of free energy. This approximation, however, is not justifiable for a class of systems in which quantum contributions for the free energy cannot be neglected. The inclusion of quantum effects is important for the determination of reliable phase diagrams of these systems. In this work, we present a new methodology to compute the free energy of many-body quantum systems [1]. This methodology results from the combination of the path integral formulation of statistical mechanics and efficient non-equilibrium methods to estimate free energy, namely, the adiabatic switching and reversible scaling methods. A quantum Einstein crystal is used as a model to show the accuracy and reliability the methodology. This new method is applied to the calculation of solid-liquid coexistence properties of neon. Our findings indicate that quantum contributions to properties such as, melting point, latent heat of fusion, entropy of fusion, and slope of melting line can be up to 10% of the calculated values using the classical approximation. [1] R. M. Ramirez, C. P. Herrero, A. Antonelli, and E. R. Hernández, Journal of Chemical Physics 129, 064110 (2008)

  18. Effective computation of quantum discord in a multiqubit spin chain

    NASA Astrophysics Data System (ADS)

    Chernyavskiy, A.

    2016-12-01

    Quantum discord is a non-classical correlation beyond quantum entanglement, which is a possible resource for quantum information technologies. The computation of quantum discord is a difficult problem due to the necessity of global optimization. We present the original semi-algebraic method for the effective computation of discord in the multi-qubit spin chain interacting with the impurity spin. We use the random mutations algorithm in a non-standard way: not for the minimization, but for the verification of inequalities. More specifically, we use it to check the constancy condition of the minimum of conditional entropy. After that, the discord can be calculated effectively by the algebraic procedures, and we construct the discord surface for different values of the structural parameter of the model. The considered approach for the verification of inequalities by global optimization algorithms can be used in a wide variety of applications, especially, in the theory of quantum correlations, which contains a lot of definitions based on minimums and maximums.

  19. Linear Optical Quantum Computing in a Single Spatial Mode

    NASA Astrophysics Data System (ADS)

    Walmsley, Ian

    2014-05-01

    We present a scheme for linear optical quantum computing using time-bin encoded qubits in a single spatial mode. This scheme allows arbitrary numbers of qubits to be encoded in the same mode, circumventing the requirement for many spatial modes that challenges the scalability of other schemes, and exploiting the inherent stability and robustness of time-frequency optical modes. This approach leverages the architecture of modern telecommunications systems, and opens a door to very high dimensional Hilbert spaces while maintaining compact device designs. Further, temporal encodings benefit from intrinsic robustness to inhomogeneities in transmission mediums. These advantages have been recognized in works exploring the preparation of time-frequency entangled states both for tests of fundamental quantum phenomena, and for quantum communications technologies including key distribution and teleportation. Here we extend this idea to computation. In particular, we present methods for single-qubit operations and heralded controlled phase (CPhase) gates, providing a sufficient set of operations for universal quantum computing with the Knill-Laflamme-Milburn scheme. As a test of our scheme, we demonstrate the first entirely single spatial mode implementation of a two-qubit quantum gate and show its operation with an average fidelity of 0.84 /pm 0.07. An analysis of the performance of current technologies suggests that our scheme offers a promising route for the construction of quantum circuits beyond the few-qubit level. In addition, we foresee that our investigation may motivate further development of the approaches presented into a regime in which time bins are temporally overlapped and frequency based manipulations become necessary, opening up encodings of even higher densities. This work was supported by the Engineering and Physical Sciences Research Council (EP/H03031X/1), the European Commission project Q-ESSENCE (248095) and the Air Force Office of Scientific Research

  20. Holonomic Quantum Computation by Time dependent Decoherence Free Subspaces

    NASA Astrophysics Data System (ADS)

    Lin, J. N.; Liang, Y.; Yang, H. D.; Gui, J.; Wu, S. L.

    2017-01-01

    We show how to realize nonadiabatic holonomic quantum computation in time-dependent decoherence free subspaces (TDFSs). In our scheme, the holonomy is not generated by computational bases in DFSs but time-dependent bases of TDFSs. Therefore, different from the traditional DFSs, the ancillary systems are not necessary in inducing holonomy, which saves qubits used in the holonomic quantum computation. We also analyze the symmetry of the N-qubits system which couples to a common squeezed field. The results show that, there are several independent DFSs presented in Hilbert space, which is determined by eigenvalues of Lindblad operators. Combining the scheme and the model proposed in this paper, we show that, the one-qubit controllable phase gate can be realized by only two physical qubits.

  1. Holonomic Quantum Computation by Time dependent Decoherence Free Subspaces

    NASA Astrophysics Data System (ADS)

    Lin, J. N.; Liang, Y.; Yang, H. D.; Gui, J.; Wu, S. L.

    2017-04-01

    We show how to realize nonadiabatic holonomic quantum computation in time-dependent decoherence free subspaces (TDFSs). In our scheme, the holonomy is not generated by computational bases in DFSs but time-dependent bases of TDFSs. Therefore, different from the traditional DFSs, the ancillary systems are not necessary in inducing holonomy, which saves qubits used in the holonomic quantum computation. We also analyze the symmetry of the N-qubits system which couples to a common squeezed field. The results show that, there are several independent DFSs presented in Hilbert space, which is determined by eigenvalues of Lindblad operators. Combining the scheme and the model proposed in this paper, we show that, the one-qubit controllable phase gate can be realized by only two physical qubits.

  2. Novel photonic bandgap based architectures for quantum computers and networks

    NASA Astrophysics Data System (ADS)

    Guney, Durdu

    All of the approaches for quantum information processing have their own advantages, but unfortunately also their own drawbacks. Ideally, one would merge the most attractive features of those different approaches in a single technology. We envision that large-scale photonic crystal (PC) integrated circuits and fibers could be the basis for robust and compact quantum circuits and processors of the next generation quantum computers and networking devices. Cavity QED, solid-state, and (non)linear optical models for computing, and optical fiber approach for communications are the most promising candidates to be improved through this novel technology. In our work, we consider both digital and analog quantum computing. In the digital domain, we first perform gate-level analysis. To achieve this task, we solve the Jaynes-Cummings Hamiltonian with time-dependent coupling parameters under the dipole and rotating-wave approximations for a 3D PC single-mode cavity with a sufficiently high Q-factor. We then exploit the results to show how to create a maximally entangled state of two atoms and how to implement several quantum logic gates: a dual-rail Hadamard gate, a dual-rail NOT gate, and a SWAP gate. In all of these operations, we synchronize atoms, as opposed to previous studies with PCs. The method has the potential for extension to N-atom entanglement, universal quantum logic operations, and the implementation of other useful, cavity QED-based quantum information processing tasks. In the next part of the digital domain, we study circuit-level implementations. We design and simulate an integrated teleportation and readout circuit on a single PC chip. The readout part of our device can not only be used on its own but can also be integrated with other compatible optical circuits to achieve atomic state detection. Further improvement of the device in terms of compactness and robustness is possible by integrating with sources and detectors in the optical regime. In the analog

  3. Non-abelian fractional quantum hall effect for fault-resistant topological quantum computation.

    SciTech Connect

    Pan, Wei; Thalakulam, Madhu; Shi, Xiaoyan; Crawford, Matthew; Nielsen, Erik; Cederberg, Jeffrey George

    2013-10-01

    Topological quantum computation (TQC) has emerged as one of the most promising approaches to quantum computation. Under this approach, the topological properties of a non-Abelian quantum system, which are insensitive to local perturbations, are utilized to process and transport quantum information. The encoded information can be protected and rendered immune from nearly all environmental decoherence processes without additional error-correction. It is believed that the low energy excitations of the so-called =5/2 fractional quantum Hall (FQH) state may obey non-Abelian statistics. Our goal is to explore this novel FQH state and to understand and create a scientific foundation of this quantum matter state for the emerging TQC technology. We present in this report the results from a coherent study that focused on obtaining a knowledge base of the physics that underpins TQC. We first present the results of bulk transport properties, including the nature of disorder on the 5/2 state and spin transitions in the second Landau level. We then describe the development and application of edge tunneling techniques to quantify and understand the quasiparticle physics of the 5/2 state.

  4. Efficient quantum algorithm for computing n-time correlation functions.

    PubMed

    Pedernales, J S; Di Candia, R; Egusquiza, I L; Casanova, J; Solano, E

    2014-07-11

    We propose a method for computing n-time correlation functions of arbitrary spinorial, fermionic, and bosonic operators, consisting of an efficient quantum algorithm that encodes these correlations in an initially added ancillary qubit for probe and control tasks. For spinorial and fermionic systems, the reconstruction of arbitrary n-time correlation functions requires the measurement of two ancilla observables, while for bosonic variables time derivatives of the same observables are needed. Finally, we provide examples applicable to different quantum platforms in the frame of the linear response theory.

  5. Scalable photonic quantum computing assisted by quantum-dot spin in double-sided optical microcavity.

    PubMed

    Wei, Hai-Rui; Deng, Fu-Guo

    2013-07-29

    We investigate the possibility of achieving scalable photonic quantum computing by the giant optical circular birefringence induced by a quantum-dot spin in a double-sided optical microcavity as a result of cavity quantum electrodynamics. We construct a deterministic controlled-not gate on two photonic qubits by two single-photon input-output processes and the readout on an electron-medium spin confined in an optical resonant microcavity. This idea could be applied to multi-qubit gates on photonic qubits and we give the quantum circuit for a three-photon Toffoli gate. High fidelities and high efficiencies could be achieved when the side leakage to the cavity loss rate is low. It is worth pointing out that our devices work in both the strong and the weak coupling regimes.

  6. Simple proof of equivalence between adiabatic quantum computation and the circuit model.

    PubMed

    Mizel, Ari; Lidar, Daniel A; Mitchell, Morgan

    2007-08-17

    We prove the equivalence between adiabatic quantum computation and quantum computation in the circuit model. An explicit adiabatic computation procedure is given that generates a ground state from which the answer can be extracted. The amount of time needed is evaluated by computing the gap. We show that the procedure is computationally efficient.

  7. Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network

    NASA Astrophysics Data System (ADS)

    Goto, Hayato

    The dynamics of nonlinear systems qualitatively change depending on their parameters, which is called bifurcation. A quantum-mechanical nonlinear oscillator can yield a quantum superposition of two oscillation states, known as a Schrödinger cat state, via its bifurcation with a slowly varying parameter. Here we propose a quantum computer comprising such quantum nonlinear oscillators, instead of quantum bits, to solve hard combinatorial optimization problems. The nonlinear oscillator network finds optimal solutions via quantum adiabatic evolution, where nonlinear terms are increased slowly, in contrast to conventional adiabatic quantum computation or quantum annealing. To distinguish them, we refer to the present approach as bifurcation-based adiabatic quantum computation. Our numerical simulation results suggest that quantum superposition and quantum fluctuation work effectively to find optimal solutions.

  8. Semiconductor-inspired design principles for superconducting quantum computing.

    PubMed

    Shim, Yun-Pil; Tahan, Charles

    2016-03-17

    Superconducting circuits offer tremendous design flexibility in the quantum regime culminating most recently in the demonstration of few qubit systems supposedly approaching the threshold for fault-tolerant quantum information processing. Competition in the solid-state comes from semiconductor qubits, where nature has bestowed some very useful properties which can be utilized for spin qubit-based quantum computing. Here we begin to explore how selective design principles deduced from spin-based systems could be used to advance superconducting qubit science. We take an initial step along this path proposing an encoded qubit approach realizable with state-of-the-art tunable Josephson junction qubits. Our results show that this design philosophy holds promise, enables microwave-free control, and offers a pathway to future qubit designs with new capabilities such as with higher fidelity or, perhaps, operation at higher temperature. The approach is also especially suited to qubits on the basis of variable super-semi junctions.

  9. Prediction by linear regression on a quantum computer

    NASA Astrophysics Data System (ADS)

    Schuld, Maria; Sinayskiy, Ilya; Petruccione, Francesco

    2016-08-01

    We give an algorithm for prediction on a quantum computer which is based on a linear regression model with least-squares optimization. In contrast to related previous contributions suffering from the problem of reading out the optimal parameters of the fit, our scheme focuses on the machine-learning task of guessing the output corresponding to a new input given examples of data points. Furthermore, we adapt the algorithm to process nonsparse data matrices that can be represented by low-rank approximations, and significantly improve the dependency on its condition number. The prediction result can be accessed through a single-qubit measurement or used for further quantum information processing routines. The algorithm's runtime is logarithmic in the dimension of the input space provided the data is given as quantum information as an input to the routine.

  10. Quantum computation of the electromagnetic cross section of dielectric targets

    NASA Astrophysics Data System (ADS)

    Lanzagorta, Marco; Uhlmann, Jeffrey; Jitrik, Oliverio; Venegas-Andraca, Salvador E.; Wiesman, Seth

    2016-05-01

    The Radar Cross Section (RCS) is a crucial element for assessing target visibility and target characterization, and it depends not only on the target's geometry but also on its composition. However, the calculation of the RCS is a challenging task due to the mathematical description of electromagnetic phenomena as well as the computational resources needed. In this paper, we will introduce two ideas for the use of quantum information processing techniques to calculate the RCS of dielectric targets. The first is to use toolboxes of quantum functions to determine the geometric component of the RCS. The second idea is to use quantum walks, expressed in terms of scattering processes, to model radar absorbing materials.

  11. Semiconductor-inspired design principles for superconducting quantum computing

    PubMed Central

    Shim, Yun-Pil; Tahan, Charles

    2016-01-01

    Superconducting circuits offer tremendous design flexibility in the quantum regime culminating most recently in the demonstration of few qubit systems supposedly approaching the threshold for fault-tolerant quantum information processing. Competition in the solid-state comes from semiconductor qubits, where nature has bestowed some very useful properties which can be utilized for spin qubit-based quantum computing. Here we begin to explore how selective design principles deduced from spin-based systems could be used to advance superconducting qubit science. We take an initial step along this path proposing an encoded qubit approach realizable with state-of-the-art tunable Josephson junction qubits. Our results show that this design philosophy holds promise, enables microwave-free control, and offers a pathway to future qubit designs with new capabilities such as with higher fidelity or, perhaps, operation at higher temperature. The approach is also especially suited to qubits on the basis of variable super-semi junctions. PMID:26983379

  12. Quantum One Go Computation and the Physical Computation Level of Biological Information Processing

    NASA Astrophysics Data System (ADS)

    Castagnoli, Giuseppe

    2010-02-01

    By extending the representation of quantum algorithms to problem-solution interdependence, the unitary evolution part of the algorithm entangles the register containing the problem with the register containing the solution. Entanglement becomes correlation, or mutual causality, between the two measurement outcomes: the string of bits encoding the problem and that encoding the solution. In former work, we showed that this is equivalent to the algorithm knowing in advance 50% of the bits of the solution it will find in the future, which explains the quantum speed up. Mutual causality between bits of information is also equivalent to seeing quantum measurement as a many body interaction between the parts of a perfect classical machine whose normalized coordinates represent the qubit populations. This “hidden machine” represents the problem to be solved. The many body interaction (measurement) satisfies all the constraints of a nonlinear Boolean network “together and at the same time”—in one go—thus producing the solution. Quantum one go computation can formalize the physical computation level of the theories that place consciousness in quantum measurement. In fact, in visual perception, we see, thus recognize, thus process, a significant amount of information “together and at the same time”. Identifying the fundamental mechanism of consciousness with that of the quantum speed up gives quantum consciousness, with respect to classical consciousness, a potentially enormous evolutionary advantage.

  13. Exploring the quantum speed limit with computer games.

    PubMed

    Sørensen, Jens Jakob W H; Pedersen, Mads Kock; Munch, Michael; Haikka, Pinja; Jensen, Jesper Halkjær; Planke, Tilo; Andreasen, Morten Ginnerup; Gajdacz, Miroslav; Mølmer, Klaus; Lieberoth, Andreas; Sherson, Jacob F

    2016-04-14

    Humans routinely solve problems of immense computational complexity by intuitively forming simple, low-dimensional heuristic strategies. Citizen science (or crowd sourcing) is a way of exploiting this ability by presenting scientific research problems to non-experts. 'Gamification'--the application of game elements in a non-game context--is an effective tool with which to enable citizen scientists to provide solutions to research problems. The citizen science games Foldit, EteRNA and EyeWire have been used successfully to study protein and RNA folding and neuron mapping, but so far gamification has not been applied to problems in quantum physics. Here we report on Quantum Moves, an online platform gamifying optimization problems in quantum physics. We show that human players are able to find solutions to difficult problems associated with the task of quantum computing. Players succeed where purely numerical optimization fails, and analyses of their solutions provide insights into the problem of optimization of a more profound and general nature. Using player strategies, we have thus developed a few-parameter heuristic optimization method that efficiently outperforms the most prominent established numerical methods. The numerical complexity associated with time-optimal solutions increases for shorter process durations. To understand this better, we produced a low-dimensional rendering of the optimization landscape. This rendering reveals why traditional optimization methods fail near the quantum speed limit (that is, the shortest process duration with perfect fidelity). Combined analyses of optimization landscapes and heuristic solution strategies may benefit wider classes of optimization problems in quantum physics and beyond.

  14. Exploring the quantum speed limit with computer games

    NASA Astrophysics Data System (ADS)

    Sørensen, Jens Jakob W. H.; Pedersen, Mads Kock; Munch, Michael; Haikka, Pinja; Jensen, Jesper Halkjær; Planke, Tilo; Andreasen, Morten Ginnerup; Gajdacz, Miroslav; Mølmer, Klaus; Lieberoth, Andreas; Sherson, Jacob F.

    2016-04-01

    Humans routinely solve problems of immense computational complexity by intuitively forming simple, low-dimensional heuristic strategies. Citizen science (or crowd sourcing) is a way of exploiting this ability by presenting scientific research problems to non-experts. ‘Gamification’—the application of game elements in a non-game context—is an effective tool with which to enable citizen scientists to provide solutions to research problems. The citizen science games Foldit, EteRNA and EyeWire have been used successfully to study protein and RNA folding and neuron mapping, but so far gamification has not been applied to problems in quantum physics. Here we report on Quantum Moves, an online platform gamifying optimization problems in quantum physics. We show that human players are able to find solutions to difficult problems associated with the task of quantum computing. Players succeed where purely numerical optimization fails, and analyses of their solutions provide insights into the problem of optimization of a more profound and general nature. Using player strategies, we have thus developed a few-parameter heuristic optimization method that efficiently outperforms the most prominent established numerical methods. The numerical complexity associated with time-optimal solutions increases for shorter process durations. To understand this better, we produced a low-dimensional rendering of the optimization landscape. This rendering reveals why traditional optimization methods fail near the quantum speed limit (that is, the shortest process duration with perfect fidelity). Combined analyses of optimization landscapes and heuristic solution strategies may benefit wider classes of optimization problems in quantum physics and beyond.

  15. Error suppression for Hamiltonian quantum computing in Markovian environments

    NASA Astrophysics Data System (ADS)

    Marvian, Milad; Lidar, Daniel A.

    2017-03-01

    Hamiltonian quantum computing, such as the adiabatic and holonomic models, can be protected against decoherence using an encoding into stabilizer subspace codes for error detection and the addition of energy penalty terms. This method has been widely studied since it was first introduced by Jordan, Farhi, and Shor (JFS) in the context of adiabatic quantum computing. Here, we extend the original result to general Markovian environments, not necessarily in Lindblad form. We show that the main conclusion of the original JFS study holds under these general circumstances: Assuming a physically reasonable bath model, it is possible to suppress the initial decay out of the encoded ground state with an energy penalty strength that grows only logarithmically in the system size, at a fixed temperature.

  16. Computational approach to quantum encoder design for purity optimization

    SciTech Connect

    Yamamoto, Naoki; Fazel, Maryam

    2007-07-15

    In this paper, we address the problem of designing a quantum encoder that maximizes the minimum output purity of a given decohering channel, where the minimum is taken over all possible pure inputs. This problem is cast as a max-min optimization problem with a rank constraint on an appropriately defined matrix variable. The problem is computationally very hard because it is nonconvex with respect to both the objective function (output purity) and the rank constraint. Despite this difficulty, we provide a tractable computational algorithm that produces the exact optimal solution for codespace of dimension 2. Moreover, this algorithm is easily extended to cover the general class of codespaces, in which case the solution is suboptimal in the sense that the suboptimized output purity serves as a lower bound of the exact optimal purity. The algorithm consists of a sequence of semidefinite programmings and can be performed easily. Two typical quantum error channels are investigated to illustrate the effectiveness of our method.

  17. Noise thresholds for optical cluster-state quantum computation

    SciTech Connect

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

    2006-05-15

    In this paper we do a detailed numerical investigation of the fault-tolerant threshold for optical cluster-state quantum computation. Our noise model allows both photon loss and depolarizing noise, as a general proxy for all types of local noise other than photon loss noise. We 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 in the combined presence of both noise types, provided that the loss probability is less than 3x10{sup -3} and the depolarization probability is less than 10{sup -4}. Our fault-tolerant protocol involves a number of innovations, including a method for syndrome extraction known as telecorrection, whereby repeated syndrome measurements are guaranteed to agree. This paper is an extended version of Dawson et al. [Phys. Rev. Lett. 96, 020501 (2006)].

  18. Universal fault-tolerant adiabatic quantum computing with quantum dots or donors

    NASA Astrophysics Data System (ADS)

    Landahl, Andrew

    I will present a conceptual design for an adiabatic quantum computer that can achieve arbitrarily accurate universal fault-tolerant quantum computations with a constant energy gap and nearest-neighbor interactions. This machine can run any quantum algorithm known today or discovered in the future, in principle. The key theoretical idea is adiabatic deformation of degenerate ground spaces formed by topological quantum error-correcting codes. An open problem with the design is making the four-body interactions and measurements it uses more technologically accessible. I will present some partial solutions, including one in which interactions between quantum dots or donors in a two-dimensional array can emulate the desired interactions in second-order perturbation theory. I will conclude with some open problems, including the challenge of reformulating Kitaev's gadget perturbation theory technique so that it preserves fault tolerance. 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.

  19. Scalable quantum computing based on stationary spin qubits in coupled quantum dots inside double-sided optical microcavities.

    PubMed

    Wei, Hai-Rui; Deng, Fu-Guo

    2014-12-18

    Quantum logic gates are the key elements in quantum computing. Here we investigate the possibility of achieving a scalable and compact quantum computing based on stationary electron-spin qubits, by using the giant optical circular birefringence induced by quantum-dot spins in double-sided optical microcavities as a result of cavity quantum electrodynamics. We design the compact quantum circuits for implementing universal and deterministic quantum gates for electron-spin systems, including the two-qubit CNOT gate and the three-qubit Toffoli gate. They are compact and economic, and they do not require additional electron-spin qubits. Moreover, our devices have good scalability and are attractive as they both are based on solid-state quantum systems and the qubits are stationary. They are feasible with the current experimental technology, and both high fidelity and high efficiency can be achieved when the ratio of the side leakage to the cavity decay is low.

  20. Scalable quantum computing based on stationary spin qubits in coupled quantum dots inside double-sided optical microcavities

    PubMed Central

    Wei, Hai-Rui; Deng, Fu-Guo

    2014-01-01

    Quantum logic gates are the key elements in quantum computing. Here we investigate the possibility of achieving a scalable and compact quantum computing based on stationary electron-spin qubits, by using the giant optical circular birefringence induced by quantum-dot spins in double-sided optical microcavities as a result of cavity quantum electrodynamics. We design the compact quantum circuits for implementing universal and deterministic quantum gates for electron-spin systems, including the two-qubit CNOT gate and the three-qubit Toffoli gate. They are compact and economic, and they do not require additional electron-spin qubits. Moreover, our devices have good scalability and are attractive as they both are based on solid-state quantum systems and the qubits are stationary. They are feasible with the current experimental technology, and both high fidelity and high efficiency can be achieved when the ratio of the side leakage to the cavity decay is low. PMID:25518899

  1. Scalable quantum computing based on stationary spin qubits in coupled quantum dots inside double-sided optical microcavities

    NASA Astrophysics Data System (ADS)

    Wei, Hai-Rui; Deng, Fu-Guo

    2014-12-01

    Quantum logic gates are the key elements in quantum computing. Here we investigate the possibility of achieving a scalable and compact quantum computing based on stationary electron-spin qubits, by using the giant optical circular birefringence induced by quantum-dot spins in double-sided optical microcavities as a result of cavity quantum electrodynamics. We design the compact quantum circuits for implementing universal and deterministic quantum gates for electron-spin systems, including the two-qubit CNOT gate and the three-qubit Toffoli gate. They are compact and economic, and they do not require additional electron-spin qubits. Moreover, our devices have good scalability and are attractive as they both are based on solid-state quantum systems and the qubits are stationary. They are feasible with the current experimental technology, and both high fidelity and high efficiency can be achieved when the ratio of the side leakage to the cavity decay is low.

  2. Numerical simulation of NQR/NMR: Applications in quantum computing.

    PubMed

    Possa, Denimar; Gaudio, Anderson C; Freitas, Jair C C

    2011-04-01

    A numerical simulation program able to simulate nuclear quadrupole resonance (NQR) as well as nuclear magnetic resonance (NMR) experiments is presented, written using the Mathematica package, aiming especially applications in quantum computing. The program makes use of the interaction picture to compute the effect of the relevant nuclear spin interactions, without any assumption about the relative size of each interaction. This makes the program flexible and versatile, being useful in a wide range of experimental situations, going from NQR (at zero or under small applied magnetic field) to high-field NMR experiments. Some conditions specifically required for quantum computing applications are implemented in the program, such as the possibility of use of elliptically polarized radiofrequency and the inclusion of first- and second-order terms in the average Hamiltonian expansion. A number of examples dealing with simple NQR and quadrupole-perturbed NMR experiments are presented, along with the proposal of experiments to create quantum pseudopure states and logic gates using NQR. The program and the various application examples are freely available through the link http://www.profanderson.net/files/nmr_nqr.php.

  3. Gaussian quantum computation with oracle-decision problems

    NASA Astrophysics Data System (ADS)

    Adcock, Mark R. A.; Høyer, Peter; Sanders, Barry C.

    2013-04-01

    We study a simple-harmonic-oscillator quantum computer solving oracle decision problems. We show that such computers can perform better by using nonorthogonal Gaussian wave functions rather than orthogonal top-hat wave functions as input to the information encoding process. Using the Deutsch-Jozsa problem as an example, we demonstrate that Gaussian modulation with optimized width parameter results in a lower error rate than for the top-hat encoding. We conclude that Gaussian modulation can allow for an improved trade-off between encoding, processing and measurement of the information.

  4. Secure multiparty computation with a dishonest majority via quantum means

    NASA Astrophysics Data System (ADS)

    Loukopoulos, Klearchos; Browne, Daniel E.

    2010-06-01

    We introduce a scheme for secure multiparty computation utilizing the quantum correlations of entangled states. First we present a scheme for two-party computation, exploiting the correlations of a Greenberger-Horne-Zeilinger state to provide, with the help of a third party, a near-private computation scheme. We then present a variation of this scheme which is passively secure with threshold t=2, in other words, remaining secure when pairs of players conspire together provided they faithfully follow the protocol. Furthermore, we show that the passively secure variant can be modified to be secure when cheating parties are allowed to deviate from the protocol. We show that this can be generalized to computations of n-party polynomials of degree 2 with a threshold of n-1. The threshold achieved is significantly higher than the best known classical threshold, which satisfies the bound tquantum secure multiparty computation.

  5. Completeness of the classical 2D Ising model and universal quantum computation.

    PubMed

    Van den Nest, M; Dür, W; Briegel, H J

    2008-03-21

    We prove that the 2D Ising model is complete in the sense that the partition function of any classical q-state spin model (on an arbitrary graph) can be expressed as a special instance of the partition function of a 2D Ising model with complex inhomogeneous couplings and external fields. In the case where the original model is an Ising or Potts-type model, we find that the corresponding 2D square lattice requires only polynomially more spins with respect to the original one, and we give a constructive method to map such models to the 2D Ising model. For more general models the overhead in system size may be exponential. The results are established by connecting classical spin models with measurement-based quantum computation and invoking the universality of the 2D cluster states.

  6. Ultrafast quantum computation in ultrastrongly coupled circuit QED systems

    NASA Astrophysics Data System (ADS)

    Wang, Yimin; Guo, Chu; Zhang, Guo-Qiang; Wang, Gangcheng; Wu, Chunfeng

    2017-03-01

    The latest technological progress of achieving the ultrastrong-coupling regime in circuit quantum electrodynamics (QED) systems has greatly promoted the developments of quantum physics, where novel quantum optics phenomena and potential computational benefits have been predicted. Here, we propose a scheme to accelerate the nontrivial two-qubit phase gate in a circuit QED system, where superconducting flux qubits are ultrastrongly coupled to a transmission line resonator (TLR), and two more TLRs are coupled to the ultrastrongly-coupled system for assistant. The nontrivial unconventional geometric phase gate between the two flux qubits is achieved based on close-loop displacements of the three-mode intracavity fields. Moreover, as there are three resonators contributing to the phase accumulation, the requirement of the coupling strength to realize the two-qubit gate can be reduced. Further reduction in the coupling strength to achieve a specific controlled-phase gate can be realized by adding more auxiliary resonators to the ultrastrongly-coupled system through superconducting quantum interference devices. We also present a study of our scheme with realistic parameters considering imperfect controls and noisy environment. Our scheme possesses the merits of ultrafastness and noise-tolerance due to the advantages of geometric phases.

  7. Ultrafast quantum computation in ultrastrongly coupled circuit QED systems

    PubMed Central

    Wang, Yimin; Guo, Chu; Zhang, Guo-Qiang; Wang, Gangcheng; Wu, Chunfeng

    2017-01-01

    The latest technological progress of achieving the ultrastrong-coupling regime in circuit quantum electrodynamics (QED) systems has greatly promoted the developments of quantum physics, where novel quantum optics phenomena and potential computational benefits have been predicted. Here, we propose a scheme to accelerate the nontrivial two-qubit phase gate in a circuit QED system, where superconducting flux qubits are ultrastrongly coupled to a transmission line resonator (TLR), and two more TLRs are coupled to the ultrastrongly-coupled system for assistant. The nontrivial unconventional geometric phase gate between the two flux qubits is achieved based on close-loop displacements of the three-mode intracavity fields. Moreover, as there are three resonators contributing to the phase accumulation, the requirement of the coupling strength to realize the two-qubit gate can be reduced. Further reduction in the coupling strength to achieve a specific controlled-phase gate can be realized by adding more auxiliary resonators to the ultrastrongly-coupled system through superconducting quantum interference devices. We also present a study of our scheme with realistic parameters considering imperfect controls and noisy environment. Our scheme possesses the merits of ultrafastness and noise-tolerance due to the advantages of geometric phases. PMID:28281654

  8. Ultrafast quantum computation in ultrastrongly coupled circuit QED systems.

    PubMed

    Wang, Yimin; Guo, Chu; Zhang, Guo-Qiang; Wang, Gangcheng; Wu, Chunfeng

    2017-03-10

    The latest technological progress of achieving the ultrastrong-coupling regime in circuit quantum electrodynamics (QED) systems has greatly promoted the developments of quantum physics, where novel quantum optics phenomena and potential computational benefits have been predicted. Here, we propose a scheme to accelerate the nontrivial two-qubit phase gate in a circuit QED system, where superconducting flux qubits are ultrastrongly coupled to a transmission line resonator (TLR), and two more TLRs are coupled to the ultrastrongly-coupled system for assistant. The nontrivial unconventional geometric phase gate between the two flux qubits is achieved based on close-loop displacements of the three-mode intracavity fields. Moreover, as there are three resonators contributing to the phase accumulation, the requirement of the coupling strength to realize the two-qubit gate can be reduced. Further reduction in the coupling strength to achieve a specific controlled-phase gate can be realized by adding more auxiliary resonators to the ultrastrongly-coupled system through superconducting quantum interference devices. We also present a study of our scheme with realistic parameters considering imperfect controls and noisy environment. Our scheme possesses the merits of ultrafastness and noise-tolerance due to the advantages of geometric phases.

  9. High-Sensitivity Charge Detection with a Single-Lead Quantum Dot for Scalable Quantum Computation

    NASA Astrophysics Data System (ADS)

    House, M. G.; Bartlett, I.; Pakkiam, P.; Koch, M.; Peretz, E.; van der Heijden, J.; Kobayashi, T.; Rogge, S.; Simmons, M. Y.

    2016-10-01

    We report the development of a high-sensitivity semiconductor charge sensor based on a quantum dot coupled to a single lead designed to minimize the geometric requirements of a charge sensor for scalable quantum-computing architectures. The quantum dot is fabricated in Si:P using atomic precision lithography, and its charge transitions are measured with rf reflectometry. A second quantum dot with two leads placed 42 nm away serves as both a charge for the sensor to measure and as a conventional rf single-electron transistor (rf SET) with which to make a comparison of the charge-detection sensitivity. We demonstrate sensitivity equivalent to an integration time of 550 ns to detect a single charge with a signal-to-noise ratio of 1 compared with an integration time of 55 ns for the rf SET. This level of sensitivity is suitable for fast (<15 μ s ) single-spin readout in quantum-information applications, with a significantly reduced geometric footprint compared to the rf SET.

  10. Typical Unpreparability of Quantum States with Quantum Circuit Model

    NASA Astrophysics Data System (ADS)

    Luo, Mingxing

    2014-04-01

    The quantum entanglement is an interesting resource in quantum information processing, especially in measurement-based quantum computing. However, most quantum states may be too entangled to be prepared efficiently in terms of quantum circuit theory, in that high values of the geometric measure of entanglement preclude states from holding a polynomial quantum preparation circuit. We prove that this phenomenon experiences occurs in a dramatic majority of all states using a novel circuit tree-state correspondence. This work highlights new aspects of the roles both entanglement and quantum circuit theory play for quantum information processing.

  11. Entertainment Computing, Social Transformation and the Quantum Field

    NASA Astrophysics Data System (ADS)

    Rauterberg, Matthias

    The abstract should summaritinment computing is on its way getting an established academic discipline. The scope of entertainment computing is quite broad (see the scope of the international journal Entertainment Computing). One unifying idea in this diverse community of entertainment researchers and developers might be a normative position to enhance human living through social transformation. One possible option in this direction is a shared ‘conscious’ field. Several ideas about a new kind of field based on quantum effects are presented and discussed. Assuming that social transformation is based on a shared collective unconscious I propose designing entertainment technology for a new kind of user experience that can transform in a positive manner the individual unconscious and therefore the collective unconscious as well. Our ALICE project can be seen as a first attempt in this direction.

  12. An NMR quantum computer of the semiconductor CdTe

    NASA Astrophysics Data System (ADS)

    Shimizu, T.; Goto, A.; Hashi, K.; Ohki, S.

    2002-12-01

    We propose a method to implement a quantum computer by solid-state NMR. We can use the J-coupling for the quantum gate in CdTe. Both Cd and Te have two isotopes with spin 1/2, then we can have 4-qubits. The decoherence by dipole interaction may be minimized by preparing the isotope superlattice grown in the order of— 111Cd- 123Te- 113Cd- 125Te—in the [111] direction and by applying the magnetic field in the direction of [100], the magic angle of the dipole interaction. The optical pumping technique can be used in CdTe to make the initialization of the qubits.

  13. Universal quantum computation with ordered spin-chain networks

    SciTech Connect

    Tserkovnyak, Yaroslav; Loss, Daniel

    2011-09-15

    It is shown that anisotropic spin chains with gapped bulk excitations and magnetically ordered ground states offer a promising platform for quantum computation, which bridges the conventional single-spin-based qubit concept with recently developed topological Majorana-based proposals. We show how to realize the single-qubit Hadamard, phase, and {pi}/8 gates as well as the two-qubit controlled-not (cnot) gate, which together form a fault-tolerant universal set of quantum gates. The gates are implemented by judiciously controlling Ising exchange and magnetic fields along a network of spin chains, with each individual qubit furnished by a spin-chain segment. A subset of single-qubit operations is geometric in nature, relying on control of anisotropy of spin interactions rather than their strength. We contrast topological aspects of the anisotropic spin-chain networks to those of p-wave superconducting wires discussed in the literature.

  14. Fast and robust quantum computation with ionic Wigner crystals

    SciTech Connect

    Baltrusch, J. D.; Negretti, A.; Taylor, J. M.; Calarco, T.

    2011-04-15

    We present a detailed analysis of the modulated-carrier quantum phase gate implemented with Wigner crystals of ions confined in Penning traps. We elaborate on a recent scheme, proposed by two of the authors, to engineer two-body interactions between ions in such crystals. We analyze the situation in which the cyclotron ({omega}{sub c}) and the crystal rotation ({omega}{sub r}) frequencies do not fulfill the condition {omega}{sub c}=2{omega}{sub r}. It is shown that even in the presence of the magnetic field in the rotating frame the many-body (classical) Hamiltonian describing small oscillations from the ion equilibrium positions can be recast in canonical form. As a consequence, we are able to demonstrate that fast and robust two-qubit gates are achievable within the current experimental limitations. Moreover, we describe a realization of the state-dependent sign-changing dipole forces needed to realize the investigated quantum computing scheme.

  15. Milestones toward Majorana-based quantum computing (Conference Presentation)

    NASA Astrophysics Data System (ADS)

    Mishmash, Ryan V.; Aasen, David; Hell, Michael; Higginbotham, Andrew; Danon, Jeroen; Leijnse, Martin; Jespersen, Thomas S.; Folk, Joshua A.; Marcus, Charles M.; Flensberg, Karsten; Alicea, Jason

    2016-10-01

    We introduce a scheme for preparation, manipulation, and readout 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 readout schemes as well.

  16. Percolation, Renormalization, and Quantum Computing with Nondeterministic Gates

    NASA Astrophysics Data System (ADS)

    Kieling, K.; Rudolph, T.; Eisert, J.

    2007-09-01

    We apply a notion of static renormalization to the preparation of entangled states for quantum computing, exploiting ideas from percolation theory. Such a strategy yields a novel way to cope with the randomness of nondeterministic quantum gates. This is most relevant in the context of optical architectures, where probabilistic gates are common, and cold atoms in optical lattices, where hole defects occur. We demonstrate how to efficiently construct cluster states without the need for rerouting, thereby avoiding a massive amount of conditional dynamics; we furthermore show that except for a single layer of gates during the preparation, all subsequent operations can be shifted to the final adapted single-qubit measurements. Remarkably, cluster state preparation is achieved using essentially the same scaling in resources as if deterministic gates were available.

  17. Quantum dynamics of cold trapped ions with application to quantum computation

    NASA Astrophysics Data System (ADS)

    James, D. F. V.

    1998-02-01

    The theory of interactions between lasers and cold trapped ions as it pertains to the design of Cirac-Zoller quantum computers is discussed. The mean positions of the trapped ions, the eigenvalues and eigenmodes of the ions' oscillations, the magnitude of the Rabi frequencies for both allowed and forbidden internal transitions of the ions, and the validity criterion for the required Hamiltonian are calculated. Energy level data for a variety of ion species are also presented.

  18. Estimating the Resources for Quantum Computation with the QuRE Toolbox

    DTIC Science & Technology

    2013-05-31

    Martinis. Quantum -information processing with circuit quantum electrodynamics . Quant. Inf. Processing, 8:81 – 103, Jun 2009. [16] M. D. Barrett, T...Estimating the Resources for Quantum Computation with the QuRE Toolbox Martin Suchara Arvin Faruque Ching-Yi Lai Gerardo Paz Frederic Chong John D...SUBTITLE Estimating the Resources for Quantum Computation with the QuRE Toolbox 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 6

  19. Schedule path optimization for adiabatic quantum computing and optimization

    NASA Astrophysics Data System (ADS)

    Zeng, Lishan; Zhang, Jun; Sarovar, Mohan

    2016-04-01

    Adiabatic quantum computing and optimization have garnered much attention recently as possible models for achieving a quantum advantage over classical approaches to optimization and other special purpose computations. Both techniques are probabilistic in nature and the minimum gap between the ground state and first excited state of the system during evolution is a major factor in determining the success probability. In this work we investigate a strategy for increasing the minimum gap and success probability by introducing intermediate Hamiltonians that modify the evolution path between initial and final Hamiltonians. We focus on an optimization problem relevant to recent hardware implementations and present numerical evidence for the existence of a purely local intermediate Hamiltonian that achieve the optimum performance in terms of pushing the minimum gap to one of the end points of the evolution. As a part of this study we develop a convex optimization formulation of the search for optimal adiabatic schedules that makes this computation more tractable, and which may be of independent interest. We further study the effectiveness of random intermediate Hamiltonians on the minimum gap and success probability, and empirically find that random Hamiltonians have a significant probability of increasing the success probability, but only by a modest amount.

  20. Two results in topology, motivated by quantum computation

    NASA Astrophysics Data System (ADS)

    Alagic, Gorjan

    2015-03-01

    The field of quantum computation is built on the foundation of physics, mathematics, and computer science. While it has taken much from these fields, there are also interesting examples where it has given back. I will discuss two new results of this kind. In both cases, we use very basic ideas from quantum computation to prove an interesting fact about low-dimensional topology. First, we use the Solovay-Kitaev universality theorem with exponential precision to give a simple proof of the #P-hardness of certain 3-manifold invariants. We then apply this result to show the existence of rather exotic 3-manifold diagrams. Second, we show a relationship between the distinguishing power of a link invariant, and the entangling power of the linear operator associated to braiding. More precisely, we show that link invariants derived from non-entangling solutions to the Yang-Baxter equation are trivial. The former is joint work with Catharine Lo (Caltech), and the latter is joint work with Stephen Jordan and Michael Jarett (UMD).

  1. Ion traps, quantum computing, and the measurement problem^

    NASA Astrophysics Data System (ADS)

    Wineland, D. J.

    2006-05-01

    The basic requirements for quantum computing and quantum simulation (single- and multi-qubit gates, long memory times, etc.) have been demonstrated in separate experiments on trapped ions. Construction of a useful information processor will require synthesis of these elements and implementation of high- fidelity operations on a very large number of qubits. NIST and other groups are addressing this scaling issue by trying to fabricate multi-zone arrays of traps that would allow highly- parallel processing. As the number of qubits increases, the measurement problem in quantum mechanics becomes more glaring; with luck, trapped ion systems might be able to shed light on this fundamental issue. Recent NIST work in collaboration with D. Leibfried, J. C. Bergquist, R. B. Blakestad, J. J. Bollinger, J. Britton, J. Chiaverini, R. E. Drullinger, R. Epstein, D. Hume, W. M. Itano, J. D. Jost, J. Koelemeij, E. Knill, C. Langer, R. Ozeri, R. Reichle, T. Rosenband, P. O. Schmidt, S. Seidelin, N. Shiga, and J. Wesenberg, and supported by DTO, ONR, and NIST.

  2. Computational alanine scanning with linear scaling semiempirical quantum mechanical methods.

    PubMed

    Diller, David J; Humblet, Christine; Zhang, Xiaohua; Westerhoff, Lance M

    2010-08-01

    Alanine scanning is a powerful experimental tool for understanding the key interactions in protein-protein interfaces. Linear scaling semiempirical quantum mechanical calculations are now sufficiently fast and robust to allow meaningful calculations on large systems such as proteins, RNA and DNA. In particular, they have proven useful in understanding protein-ligand interactions. Here we ask the question: can these linear scaling quantum mechanical methods developed for protein-ligand scoring be useful for computational alanine scanning? To answer this question, we assembled 15 protein-protein complexes with available crystal structures and sufficient alanine scanning data. In all, the data set contains Delta Delta Gs for 400 single point alanine mutations of these 15 complexes. We show that with only one adjusted parameter the quantum mechanics-based methods outperform both buried accessible surface area and a potential of mean force and compare favorably to a variety of published empirical methods. Finally, we closely examined the outliers in the data set and discuss some of the challenges that arise from this examination.

  3. Reducing the quantum-computing overhead with complex gate distillation

    NASA Astrophysics Data System (ADS)

    Duclos-Cianci, Guillaume; Poulin, David

    2015-04-01

    In leading fault-tolerant quantum-computing schemes, accurate transformations are obtained by a two-stage process. In a first stage, a discrete universal set of fault-tolerant operations is obtained by error-correcting noisy transformations and distilling resource states. In a second stage, arbitrary transformations are synthesized to desired accuracy by combining elements of this set into a circuit. Here we present a scheme that merges these two stages into a single one, directly distilling complex transformations. We find that our scheme can reduce the total overhead to realize certain gates by up to a few orders of magnitude. In contrast to other schemes, this efficient gate synthesis does not require computationally intensive compilation algorithms and a straightforward generalization of our scheme circumvents compilation and synthesis altogether.

  4. Communication: Spin-free quantum computational simulations and symmetry adapted states

    NASA Astrophysics Data System (ADS)

    Whitfield, James Daniel

    2013-07-01

    The ideas of digital simulation of quantum systems using a quantum computer parallel the original ideas of numerical simulation using a classical computer. In order for quantum computational simulations to advance to a competitive point, many techniques from classical simulations must be imported into the quantum domain. In this article, we consider the applications of symmetry in the context of quantum simulation. Building upon well established machinery, we propose a form of first quantized simulation that only requires the spatial part of the wave function, thereby allowing spin-free quantum computational simulations. We go further and discuss the preparation of N-body states with specified symmetries based on projection techniques. We consider two simple examples, molecular hydrogen and cyclopropenyl cation, to illustrate the ideas. The methods here are the first to explicitly deal with preparing N-body symmetry-adapted states and open the door for future investigations into group theory, chemistry, and quantum simulation.

  5. Quantum Error Correction

    NASA Astrophysics Data System (ADS)

    Lidar, Daniel A.; Brun, Todd A.

    2013-09-01

    Prologue; Preface; Part I. Background: 1. Introduction to decoherence and noise in open quantum systems Daniel Lidar and Todd Brun; 2. Introduction to quantum error correction Dave Bacon; 3. Introduction to decoherence-free subspaces and noiseless subsystems Daniel Lidar; 4. Introduction to quantum dynamical decoupling Lorenza Viola; 5. Introduction to quantum fault tolerance Panos Aliferis; Part II. Generalized Approaches to Quantum Error Correction: 6. Operator quantum error correction David Kribs and David Poulin; 7. Entanglement-assisted quantum error-correcting codes Todd Brun and Min-Hsiu Hsieh; 8. Continuous-time quantum error correction Ognyan Oreshkov; Part III. Advanced Quantum Codes: 9. Quantum convolutional codes Mark Wilde; 10. Non-additive quantum codes Markus Grassl and Martin Rötteler; 11. Iterative quantum coding systems David Poulin; 12. Algebraic quantum coding theory Andreas Klappenecker; 13. Optimization-based quantum error correction Andrew Fletcher; Part IV. Advanced Dynamical Decoupling: 14. High order dynamical decoupling Zhen-Yu Wang and Ren-Bao Liu; 15. Combinatorial approaches to dynamical decoupling Martin Rötteler and Pawel Wocjan; Part V. Alternative Quantum Computation Approaches: 16. Holonomic quantum computation Paolo Zanardi; 17. Fault tolerance for holonomic quantum computation Ognyan Oreshkov, Todd Brun and Daniel Lidar; 18. Fault tolerant measurement-based quantum computing Debbie Leung; Part VI. Topological Methods: 19. Topological codes Héctor Bombín; 20. Fault tolerant topological cluster state quantum computing Austin Fowler and Kovid Goyal; Part VII. Applications and Implementations: 21. Experimental quantum error correction Dave Bacon; 22. Experimental dynamical decoupling Lorenza Viola; 23. Architectures Jacob Taylor; 24. Error correction in quantum communication Mark Wilde; Part VIII. Critical Evaluation of Fault Tolerance: 25. Hamiltonian methods in QEC and fault tolerance Eduardo Novais, Eduardo Mucciolo and

  6. A silicon-based surface code quantum computer

    NASA Astrophysics Data System (ADS)

    O'Gorman, Joe; Nickerson, Naomi H.; Ross, Philipp; Morton, John Jl; Benjamin, Simon C.

    2016-02-01

    Individual impurity atoms in silicon can make superb individual qubits, but it remains an immense challenge to build a multi-qubit processor: there is a basic conflict between nanometre separation desired for qubit-qubit interactions and the much larger scales that would enable control and addressing in a manufacturable and fault-tolerant architecture. Here we resolve this conflict by establishing the feasibility of surface code quantum computing using solid-state spins, or ‘data qubits’, that are widely separated from one another. We use a second set of ‘probe’ spins that are mechanically separate from the data qubits and move in and out of their proximity. The spin dipole-dipole interactions give rise to phase shifts; measuring a probe’s total phase reveals the collective parity of the data qubits along the probe’s path. Using a protocol that balances the systematic errors due to imperfect device fabrication, our detailed simulations show that substantial misalignments can be handled within fault-tolerant operations. We conclude that this simple ‘orbital probe’ architecture overcomes many of the difficulties facing solid-state quantum computing, while minimising the complexity and offering qubit densities that are several orders of magnitude greater than other systems.

  7. Rigidity of quantum steering and one-sided device-independent verifiable quantum computation

    NASA Astrophysics Data System (ADS)

    Gheorghiu, Alexandru; Wallden, Petros; Kashefi, Elham

    2017-02-01

    The relationship between correlations and entanglement has played a major role in understanding quantum theory since the work of Einstein et al (1935 Phys. Rev. 47 777–80). Tsirelson proved that Bell states, shared among two parties, when measured suitably, achieve the maximum non-local correlations allowed by quantum mechanics (Cirel’son 1980 Lett. Math. Phys. 4 93–100). Conversely, Reichardt et al showed that observing the maximal correlation value over a sequence of repeated measurements, implies that the underlying quantum state is close to a tensor product of maximally entangled states and, moreover, that it is measured according to an ideal strategy (Reichardt et al 2013 Nature 496 456–60). However, this strong rigidity result comes at a high price, requiring a large number of entangled pairs to be tested. In this paper, we present a significant improvement in terms of the overhead by instead considering quantum steering where the device of the one side is trusted. We first demonstrate a robust one-sided device-independent version of self-testing, which characterises the shared state and measurement operators of two parties up to a certain bound. We show that this bound is optimal up to constant factors and we generalise the results for the most general attacks. This leads us to a rigidity theorem for maximal steering correlations. As a key application we give a one-sided device-independent protocol for verifiable delegated quantum computation, and compare it to other existing protocols, to highlight the cost of trust assumptions. Finally, we show that under reasonable assumptions, the states shared in order to run a certain type of verification protocol must be unitarily equivalent to perfect Bell states.

  8. Cluster-based architecture for fault-tolerant quantum computation

    SciTech Connect

    Fujii, Keisuke; Yamamoto, Katsuji

    2010-04-15

    We present a detailed description of an architecture for fault-tolerant quantum computation, which is based on the cluster model of encoded qubits. In this cluster-based architecture, concatenated computation is implemented in a quite different way from the usual circuit-based architecture where physical gates are recursively replaced by logical gates with error-correction gadgets. Instead, some relevant cluster states, say fundamental clusters, are recursively constructed through verification and postselection in advance for the higher-level one-way computation, which namely provides error-precorrection of gate operations. A suitable code such as the Steane seven-qubit code is adopted for transversal operations. This concatenated construction of verified fundamental clusters has a simple transversal structure of logical errors, and achieves a high noise threshold {approx}3% for computation by using appropriate verification procedures. Since the postselection is localized within each fundamental cluster with the help of deterministic bare controlled-Z gates without verification, divergence of resources is restrained, which reconciles postselection with scalability.

  9. Cluster-based architecture for fault-tolerant quantum computation

    NASA Astrophysics Data System (ADS)

    Fujii, Keisuke; Yamamoto, Katsuji

    2010-04-01

    We present a detailed description of an architecture for fault-tolerant quantum computation, which is based on the cluster model of encoded qubits. In this cluster-based architecture, concatenated computation is implemented in a quite different way from the usual circuit-based architecture where physical gates are recursively replaced by logical gates with error-correction gadgets. Instead, some relevant cluster states, say fundamental clusters, are recursively constructed through verification and postselection in advance for the higher-level one-way computation, which namely provides error-precorrection of gate operations. A suitable code such as the Steane seven-qubit code is adopted for transversal operations. This concatenated construction of verified fundamental clusters has a simple transversal structure of logical errors, and achieves a high noise threshold ~3% for computation by using appropriate verification procedures. Since the postselection is localized within each fundamental cluster with the help of deterministic bare controlled-Z gates without verification, divergence of resources is restrained, which reconciles postselection with scalability.

  10. Topological and geometrical quantum computation in cohesive Khovanov homotopy type theory

    NASA Astrophysics Data System (ADS)

    Ospina, Juan

    2015-05-01

    The recently proposed Cohesive Homotopy Type Theory is exploited as a formal foundation for central concepts in Topological and Geometrical Quantum Computation. Specifically the Cohesive Homotopy Type Theory provides a formal, logical approach to concepts like smoothness, cohomology and Khovanov homology; and such approach permits to clarify the quantum algorithms in the context of Topological and Geometrical Quantum Computation. In particular we consider the so-called "open-closed stringy topological quantum computer" which is a theoretical topological quantum computer that employs a system of open-closed strings whose worldsheets are open-closed cobordisms. The open-closed stringy topological computer is able to compute the Khovanov homology for tangles and for hence it is a universal quantum computer given than any quantum computation is reduced to an instance of computation of the Khovanov homology for tangles. The universal algebra in this case is the Frobenius Algebra and the possible open-closed stringy topological quantum computers are forming a symmetric monoidal category which is equivalent to the category of knowledgeable Frobenius algebras. Then the mathematical design of an open-closed stringy topological quantum computer is involved with computations and theorem proving for generalized Frobenius algebras. Such computations and theorem proving can be performed automatically using the Automated Theorem Provers with the TPTP language and the SMT-solver Z3 with the SMT-LIB language. Some examples of application of ATPs and SMT-solvers in the mathematical setup of an open-closed stringy topological quantum computer will be provided.

  11. Quantum computers and unstructured search: finding and counting items with an arbitrarily entangled initial state

    NASA Astrophysics Data System (ADS)

    Carlini, A.; Hosoya, A.

    2001-02-01

    Grover's quantum algorithm for an unstructured search problem and the COUNT algorithm by Brassard et al. are generalized to the case when the initial state is arbitrarily and maximally entangled. This ansatz might be relevant with quantum subroutines, when the computational qubits and the environment are coupled, and in general when the control over the quantum system is partial.

  12. Data Assimilation on a Quantum Annealing Computer: Feasibility and Scalability

    NASA Astrophysics Data System (ADS)

    Nearing, G. S.; Halem, M.; Chapman, D. R.; Pelissier, C. S.

    2014-12-01

    Data assimilation is one of the ubiquitous and computationally hard problems in the Earth Sciences. In particular, ensemble-based methods require a large number of model evaluations to estimate the prior probability density over system states, and variational methods require adjoint calculations and iteration to locate the maximum a posteriori solution in the presence of nonlinear models and observation operators. Quantum annealing computers (QAC) like the new D-Wave housed at the NASA Ames Research Center can be used for optimization and sampling, and therefore offers a new possibility for efficiently solving hard data assimilation problems. Coding on the QAC is not straightforward: a problem must be posed as a Quadratic Unconstrained Binary Optimization (QUBO) and mapped to a spherical Chimera graph. We have developed a method for compiling nonlinear 4D-Var problems on the D-Wave that consists of five steps: Emulating the nonlinear model and/or observation function using radial basis functions (RBF) or Chebyshev polynomials. Truncating a Taylor series around each RBF kernel. Reducing the Taylor polynomial to a quadratic using ancilla gadgets. Mapping the real-valued quadratic to a fixed-precision binary quadratic. Mapping the fully coupled binary quadratic to a partially coupled spherical Chimera graph using ancilla gadgets. At present the D-Wave contains 512 qbits (with 1024 and 2048 qbit machines due in the next two years); this machine size allows us to estimate only 3 state variables at each satellite overpass. However, QAC's solve optimization problems using a physical (quantum) system, and therefore do not require iterations or calculation of model adjoints. This has the potential to revolutionize our ability to efficiently perform variational data assimilation, as the size of these computers grows in the coming years.

  13. Exponential vanishing of the ground-state gap of the quantum random energy model via adiabatic quantum computing

    SciTech Connect

    Adame, J.; Warzel, S.

    2015-11-15

    In this note, we use ideas of Farhi et al. [Int. J. Quantum. Inf. 6, 503 (2008) and Quantum Inf. Comput. 11, 840 (2011)] who link a lower bound on the run time of their quantum adiabatic search algorithm to an upper bound on the energy gap above the ground-state of the generators of this algorithm. We apply these ideas to the quantum random energy model (QREM). Our main result is a simple proof of the conjectured exponential vanishing of the energy gap of the QREM.

  14. Quantum computing over long time scales in a singly charged quantum dot

    NASA Astrophysics Data System (ADS)

    Sun, Bo

    In this thesis, we will study the continuous wave optical spectroscopy of self-assembled quantum dots (SAQDs), focusing on the use of these dots toward quantum computing and information processing applications. Probing the strong field interaction between an intense optical pump beam and a neutral quantum dot will reveal Autler-Townes splitting and Mollow absorption spectrum. The presence of these two phenomenon confirm the isolated nature of the exciton trapped in the quantum dot and the suppression of many-body physics due to exciton confinement. This curbs the decoherence caused by exciton-exciton interactions in higher dimensional heterostructures. After confirming the atom-like nature of the SAQD, we then charge the SAQD with a single electron and use the electron spin as our qubit. By applying a magnetic field perpendicular to the sample growth direction, we turn on the spin flip Raman transitions and create two lambda (Λ) systems that can be used to coherently manipulate the spin. A single laser resonant with one of the transitions can quickly initialize the spin state via optical pumping while two lasers, one on each leg of the lambda, can initialize the spin into an arbitrary superposition state through coherent population trapping. The developed dark state spectroscopy is then used to demonstrate interaction between the optically generated hole spin with the background nuclear spins. This hole assisted dynamic nuclear polarization creates a feedback mechanism which locks the nuclear field to the laser detunings and suppresses nuclear spin fluctuations. We use dark state spectroscopy to measure a two orders of magnitude increase of the electron spin coherence time, a result of the narrowing of the nuclear field distribution. Furthermore, we find that this nuclear spin narrowing can persist in the dark, without laser interaction, for well over 1s even in the presence of a fluctuating electron charge and electron spin polarization. We have opened the door

  15. The Quantum Hydrodynamic Model for Semiconductor Devices: Theory and Computations

    DTIC Science & Technology

    2007-11-02

    Quantum transport effects including electron or hole tunneling through potential barriers and buildup in quantum wells are important in predicting...semiconductor device. A new extension of the classical hydrodynamic model to include quantum transport effects was derived. This "smooth" quantum

  16. Parallelism in computational chemistry: Applications in quantum and statistical mechanics

    NASA Astrophysics Data System (ADS)

    Clementi, E.; Corongiu, G.; Detrich, J. H.; Kahnmohammadbaigi, H.; Chin, S.; Domingo, L.; Laaksonen, A.; Nguyen, N. L.

    1985-08-01

    Often very fundamental biochemical and biophysical problems defy simulations because of limitation in today's computers. We present and discuss a distributed system composed of two IBM-4341 and one IBM-4381, as front-end processors, and ten FPS-164 attached array processors. This parallel system-called LCAP-has presently a peak performance of about 120 MFlops; extensions to higher performance are discussed. Presently, the system applications use a modified version of VM/SP as the operating system: description of the modifications is given. Three applications programs have migrated from sequential to parallel; a molecular quantum mechanical, a Metropolis-Monte Carlo and a Molecular Dynamics program. Descriptions of the parallel codes are briefly outlined. As examples and tests of these applications we report on a study for proton tunneling in DNA base-pairs, very relevant to spontaneous mutations in genetics. As a second example, we present a Monte Carlo study of liquid water at room temperature where not only two- and three-body interactions are considered but-for the first time-also four-body interactions are included. Finally we briefly summarize a molecular dynamics study where two- and three-body interactions have been considered. These examples, and very positive performance comparison with today's supercomputers allow us to conclude that parallel computers and programming of the type we have considered, represent a pragmatic answer to many computer intensive problems.

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

    PubMed

    Sumner, Isaiah; Iyengar, Srinivasan S

    2007-10-18

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

  18. Enhanced fault-tolerant quantum computing in d-level systems.

    PubMed

    Campbell, Earl T

    2014-12-05

    Error-correcting codes protect quantum information and form the basis of fault-tolerant quantum computing. Leading proposals for fault-tolerant quantum computation require codes with an exceedingly rare property, a transversal non-Clifford gate. Codes with the desired property are presented for d-level qudit systems with prime d. The codes use n=d-1 qudits and can detect up to ∼d/3 errors. We quantify the performance of these codes for one approach to quantum computation known as magic-state distillation. Unlike prior work, we find performance is always enhanced by increasing d.

  19. An architecture for quantum computation with magnetically trapped Holmium atoms

    NASA Astrophysics Data System (ADS)

    Saffman, Mark; Hostetter, James; Booth, Donald; Collett, Jeffrey

    2016-05-01

    Outstanding challenges for scalable neutral atom quantum computation include correction of atom loss due to collisions with untrapped background gas, reduction of crosstalk during state preparation and measurement due to scattering of near resonant light, and the need to improve quantum gate fidelity. We present a scalable architecture based on loading single Holmium atoms into an array of Ioffe-Pritchard traps. The traps are formed by grids of superconducting wires giving a trap array with 40 μm period, suitable for entanglement via long range Rydberg gates. The states | F = 5 , M = 5 > and | F = 7 , M = 7 > provide a magic trapping condition at a low field of 3.5 G for long coherence time qubit encoding. The F = 11 level will be used for state preparation and measurement. The availability of different states for encoding, gate operations, and measurement, spectroscopically isolates the different operations and will prevent crosstalk to neighboring qubits. Operation in a cryogenic environment with ultra low pressure will increase atom lifetime and Rydberg gate fidelity by reduction of blackbody induced Rydberg decay. We will present a complete description of the architecture including estimates of achievable performance metrics. Work supported by NSF award PHY-1404357.

  20. Optimal pulse design in quantum control: A unified computational method

    PubMed Central

    Li, Jr-Shin; Ruths, Justin; Yu, Tsyr-Yan; Arthanari, Haribabu; Wagner, Gerhard

    2011-01-01

    Many key aspects of control of quantum systems involve manipulating a large quantum ensemble exhibiting variation in the value of parameters characterizing the system dynamics. Developing electromagnetic pulses to produce a desired evolution in the presence of such variation is a fundamental and challenging problem in this research area. We present such robust pulse designs as an optimal control problem of a continuum of bilinear systems with a common control function. We map this control problem of infinite dimension to a problem of polynomial approximation employing tools from geometric control theory. We then adopt this new notion and develop a unified computational method for optimal pulse design using ideas from pseudospectral approximations, by which a continuous-time optimal control problem of pulse design can be discretized to a constrained optimization problem with spectral accuracy. Furthermore, this is a highly flexible and efficient numerical method that requires low order of discretization and yields inherently smooth solutions. We demonstrate this method by designing effective broadband π/2 and π pulses with reduced rf energy and pulse duration, which show significant sensitivity enhancement at the edge of the spectrum over conventional pulses in 1D and 2D NMR spectroscopy experiments. PMID:21245345

  1. Computational spectroscopy using the Quantum ESPRESSO distribution (Invited)

    NASA Astrophysics Data System (ADS)

    Baroni, S.; Giannozzi, P.

    2009-12-01

    Quantum ESPRESSO (QE) [1,2] is an integrated suite of computer codes for electronic-structure calculations and materials modeling, based on density-functional theory, plane waves, and pseudopotentials. QE freely available to researchers around the world under the terms of the GNU general public licence. In this talk I will introduce the QE distribution, with emphasis on some of its features that may appeal to the Earth Sciences and Mineralogy communities. I will focus on the determination of vibrational frequencies to be used for spectroscopic purposes, for the determination of soft modes leading to mechanical instabilities, and as ingredients for the simulation of thermal properties in the (quasi-) harmonic approximations. I will conclude with some recent developments which are allowing for the simulation of electronic (absorption and photo-emission) spectroscopies, using many-body and time-dependent density-functional perturbation theories. [1] P. Giannozzi et al. J. Phys.: Condens. Matter 21, 395502 (2009); http://dx.doi.org/10.1088/0953-8984/21/39/395502 [2] http://www.quantum-espresso.org

  2. Universal holonomic quantum computing with cat-codes

    NASA Astrophysics Data System (ADS)

    Albert, Victor V.; Shu, Chi; Krastanov, Stefan; Shen, Chao; Liu, Ren-Bao; Yang, Zhen-Biao; Schoelkopf, Robert J.; Mirrahimi, Mazyar; Devoret, Michel H.; Jiang, Liang

    2016-05-01

    Universal computation of a quantum system consisting of superpositions of well-separated coherent states of multiple harmonic oscillators can be achieved by three families of adiabatic holonomic gates. The first gate consists of moving a coherent state around a closed path in phase space, resulting in a relative Berry phase between that state and the other states. The second gate consists of ``colliding'' two coherent states of the same oscillator, resulting in coherent population transfer between them. The third gate is an effective controlled-phase gate on coherent states of two different oscillators. Such gates should be realizable via reservoir engineering of systems which support tunable nonlinearities, such as trapped ions and circuit QED.

  3. Fault tolerance in parity-state linear optical quantum computing

    SciTech Connect

    Hayes, A. J. F.; Ralph, T. C.; Haselgrove, H. L.; Gilchrist, Alexei

    2010-08-15

    We use a combination of analytical and numerical techniques to calculate the noise threshold and resource requirements for a linear optical quantum computing scheme based on parity-state encoding. Parity-state encoding is used at the lowest level of code concatenation in order to efficiently correct errors arising from the inherent nondeterminism of two-qubit linear-optical gates. When combined with teleported error-correction (using either a Steane or Golay code) at higher levels of concatenation, the parity-state scheme is found to achieve a saving of approximately three orders of magnitude in resources when compared to the cluster state scheme, at a cost of a somewhat reduced noise threshold.

  4. What can quantum optics say about computational complexity theory?

    PubMed

    Rahimi-Keshari, Saleh; Lund, Austin P; Ralph, Timothy C

    2015-02-13

    Considering the problem of sampling from the output photon-counting probability distribution of a linear-optical network for input Gaussian states, we obtain results that are of interest from both quantum theory and the computational complexity theory point of view. We derive a general formula for calculating the output probabilities, and by considering input thermal states, we show that the output probabilities are proportional to permanents of positive-semidefinite Hermitian matrices. It is believed that approximating permanents of complex matrices in general is a #P-hard problem. However, we show that these permanents can be approximated with an algorithm in the BPP^{NP} complexity class, as there exists an efficient classical algorithm for sampling from the output probability distribution. We further consider input squeezed-vacuum states and discuss the complexity of sampling from the probability distribution at the output.

  5. Distillation of nonstabilizer states for universal quantum computation

    NASA Astrophysics Data System (ADS)

    Duclos-Cianci, Guillaume; Svore, Krysta M.

    2013-10-01

    Magic-state distillation is a fundamental technique for realizing fault-tolerant universal quantum computing and produces high-fidelity Clifford eigenstates, called magic states, which can be used to implement the non-Clifford π/8 gate. We propose an efficient protocol for distilling other nonstabilizer states that requires only Clifford operations, measurement, and magic states. One critical application of our protocol is efficiently and fault-tolerantly implementing arbitrary, non-Clifford, single-qubit rotations in, on average, constant online circuit depth and polylogarithmic (in precision) offline resource cost, resulting in significant improvements over state-of-the-art decomposition techniques. Finally, we show that our protocol is robust to noise in the resource states.

  6. Differential geometric treewidth estimation in adiabatic quantum computation

    NASA Astrophysics Data System (ADS)

    Wang, Chi; Jonckheere, Edmond; Brun, Todd

    2016-10-01

    The D-Wave adiabatic quantum computing platform is designed to solve a particular class of problems—the Quadratic Unconstrained Binary Optimization (QUBO) problems. Due to the particular "Chimera" physical architecture of the D-Wave chip, the logical problem graph at hand needs an extra process called minor embedding in order to be solvable on the D-Wave architecture. The latter problem is itself NP-hard. In this paper, we propose a novel polynomial-time approximation to the closely related treewidth based on the differential geometric concept of Ollivier-Ricci curvature. The latter runs in polynomial time and thus could significantly reduce the overall complexity of determining whether a QUBO problem is minor embeddable, and thus solvable on the D-Wave architecture.

  7. Resource Costs for Fault-Tolerant Linear Optical Quantum Computing

    NASA Astrophysics Data System (ADS)

    Li, Ying; Humphreys, Peter C.; Mendoza, Gabriel J.; Benjamin, Simon C.

    2015-10-01

    Linear optical quantum computing (LOQC) seems attractively simple: Information is borne entirely by light and processed by components such as beam splitters, phase shifters, and detectors. However, this very simplicity leads to limitations, such as the lack of deterministic entangling operations, which are compensated for by using substantial hardware overheads. Here, we quantify the resource costs for full-scale LOQC by proposing a specific protocol based on the surface code. With the caveat that our protocol can be further optimized, we report that the required number of physical components is at least 5 orders of magnitude greater than in comparable matter-based systems. Moreover, the resource requirements grow further if the per-component photon-loss rate is worse than 1 0-3 or the per-component noise rate is worse than 1 0-5. We identify the performance of switches in the network as the single most influential factor influencing resource scaling.

  8. Digital Control of Exchange Interaction in a Spin-based Silicon Quantum Computer

    DTIC Science & Technology

    2013-05-19

    investigate dc and ac properties of single and double vertical Si quantum dots with 3D confinement. The dots constitute the main building blocks of a...quantum computing, quantyum dots, Majorana fermions Leonid P. Rokhinson, James C. Sturm Indiana University - Purdue University Fort Wayne Sponsored Programs...of Exchange Interaction in a Spin-based Silicon Quantum Computer Report Title ABSTRACT We propose to investigate dc and ac properties of single and

  9. Engineering of an all-heteronuclear 5-qubit NMR quantum computer.

    PubMed

    Marx, Raimund; Pomplun, Nikolas; Bermel, Wolfgang; Zeiger, Heinz; Engelke, Frank; Fahmy, Amr F; Glaser, Steffen J

    2015-06-01

    The realization of an all-heteronuclear 5-qubit nuclear magnetic resonance quantum computer is reported, from the design and synthesis of a suitable molecule through the engineering of a prototype 6-channel probe head. Full control over the quantum computer is shown by a benchmark experiment.

  10. High-speed linear optics quantum computing using active feed-forward.

    PubMed

    Prevedel, Robert; Walther, Philip; Tiefenbacher, Felix; Böhi, Pascal; Kaltenbaek, Rainer; Jennewein, Thomas; Zeilinger, Anton

    2007-01-04

    As information carriers in quantum computing, photonic qubits have the advantage of undergoing negligible decoherence. However, the absence of any significant photon-photon interaction is problematic for the realization of non-trivial two-qubit gates. One solution is to introduce an effective nonlinearity by measurements resulting in probabilistic gate operations. In one-way quantum computation, the random quantum measurement error can be overcome by applying a feed-forward technique, such that the future measurement basis depends on earlier measurement results. This technique is crucial for achieving deterministic quantum computation once a cluster state (the highly entangled multiparticle state on which one-way quantum computation is based) is prepared. Here we realize a concatenated scheme of measurement and active feed-forward in a one-way quantum computing experiment. We demonstrate that, for a perfect cluster state and no photon loss, our quantum computation scheme would operate with good fidelity and that our feed-forward components function with very high speed and low error for detected photons. With present technology, the individual computational step (in our case the individual feed-forward cycle) can be operated in less than 150 ns using electro-optical modulators. This is an important result for the future development of one-way quantum computers, whose large-scale implementation will depend on advances in the production and detection of the required highly entangled cluster states.

  11. Adiabatic pipelining: a key to ternary computing with quantum dots.

    PubMed

    Pečar, P; Ramšak, A; Zimic, N; Mraz, M; Lebar Bajec, I

    2008-12-10

    The quantum-dot cellular automaton (QCA), a processing platform based on interacting quantum dots, was introduced by Lent in the mid-1990s. What followed was an exhilarating period with the development of the line, the functionally complete set of logic functions, as well as more complex processing structures, however all in the realm of binary logic. Regardless of these achievements, it has to be acknowledged that the use of binary logic is in computing systems mainly the end result of the technological limitations, which the designers had to cope with in the early days of their design. The first advancement of QCAs to multi-valued (ternary) processing was performed by Lebar Bajec et al, with the argument that processing platforms of the future should not disregard the clear advantages of multi-valued logic. Some of the elementary ternary QCAs, necessary for the construction of more complex processing entities, however, lead to a remarkable increase in size when compared to their binary counterparts. This somewhat negates the advantages gained by entering the ternary computing domain. As it turned out, even the binary QCA had its initial hiccups, which have been solved by the introduction of adiabatic switching and the application of adiabatic pipeline approaches. We present here a study that introduces adiabatic switching into the ternary QCA and employs the adiabatic pipeline approach to successfully solve the issues of elementary ternary QCAs. What is more, the ternary QCAs presented here are sizewise comparable to binary QCAs. This in our view might serve towards their faster adoption.

  12. Computational studies of quantum dot sensitized solar cells

    NASA Astrophysics Data System (ADS)

    Kolesov, Grigory

    This thesis presents a computational study of quantum dot (QD) sensitized solar cells. First part deals with the non-equilibrium many-body theory or non-equilibrium Green's function (NEGF) theory. In this approach I study electron dynamics in the quantum-dot sensitized solar cell subjected to time-dependent fields. NEGF theory, because it does not impose any conditions on a perturbation, is the fundamental one to describe ultrafast processes in small, strongly correlated systems and/or in strong fields. In this research I do not only perform analytical derivation, but also design and implement spectral numerical solution for the resulting complex system of partial integrodifferential equations. This numerical solution yielded an order of magnitude speedup over the methods used previously in the field. The forth chapter of this thesis deals with calculation of optical properties and the ground state configuration of Zn2SnO4 (ZTO). ZTO is used by experimentalists in UW to grow nanorods which are then sensitized by QDs. ZTO is a challenging material for computational analysis because of its inverse spinel structure; thus it has an immense number of configurations matching the X-ray diffraction experiments. I've applied a cluster expansion method and have found the ground state configuration and phase diagram for ZTO. Calculations of optical properties of ground state bulk ZTO were done with a recently developed DFT functional. The optical band gap obtained in these calculations matched the experimental value. The last chapter describes development of the general simulator for interdigitated array electrodes. The application of this simulation together with the experiments may lead to understanding of reaction parameters and mechanisms important for development of electrochemical solar cells.

  13. A Compact Code for Simulations of Quantum Error Correction in Classical Computers

    SciTech Connect

    Nyman, Peter

    2009-03-10

    This study considers implementations of error correction in a simulation language on a classical computer. Error correction will be necessarily in quantum computing and quantum information. We will give some examples of the implementations of some error correction codes. These implementations will be made in a more general quantum simulation language on a classical computer in the language Mathematica. The intention of this research is to develop a programming language that is able to make simulations of all quantum algorithms and error corrections in the same framework. The program code implemented on a classical computer will provide a connection between the mathematical formulation of quantum mechanics and computational methods. This gives us a clear uncomplicated language for the implementations of algorithms.

  14. Research on Quantum Authentication Methods for the Secure Access Control Among Three Elements of Cloud Computing

    NASA Astrophysics Data System (ADS)

    Dong, Yumin; Xiao, Shufen; Ma, Hongyang; Chen, Libo

    2016-12-01

    Cloud computing and big data have become the developing engine of current information technology (IT) as a result of the rapid development of IT. However, security protection has become increasingly important for cloud computing and big data, and has become a problem that must be solved to develop cloud computing. The theft of identity authentication information remains a serious threat to the security of cloud computing. In this process, attackers intrude into cloud computing services through identity authentication information, thereby threatening the security of data from multiple perspectives. Therefore, this study proposes a model for cloud computing protection and management based on quantum authentication, introduces the principle of quantum authentication, and deduces the quantum authentication process. In theory, quantum authentication technology can be applied in cloud computing for security protection. This technology cannot be cloned; thus, it is more secure and reliable than classical methods.

  15. Control and Dynamic Approach to Robust Quantum Computing

    DTIC Science & Technology

    2006-01-01

    information, quantum error correction 17. SECURITY CLASSIFICATION OF REPORT UNCLASSIFIED NSN 7540-01-280-5500 Hideo Mabuchi California Institute of...stabilization of conditional quantum state preparation, and began work on a second, quantum error correction via continuous syndrome measurement. Below we...obtain. Quantum error correction : Our successes in the state-preparation problem led us to ask whether real-time feedback analysis could also be used for

  16. Solid State Quantum Computing Using Nanostructured Logic Gates

    DTIC Science & Technology

    2007-11-02

    Quantum Dots Embedded in Aharonov-Bohm Rings,” APS March Meeting 2004 Session B37: Spin Qubits and Quantum Dots. Monday Midday, 26 March 2004, Ryan Toonen ...Physical Review B. • M. Prada, R.C. Toonen , R.H. Blick and P. Harrison, "Electron-Nuclear Spin Transfer in Quantum Dot Networks" submitted to IOP. - 23

  17. No-go theorem for passive single-rail linear optical quantum computing.

    PubMed

    Wu, Lian-Ao; Walther, Philip; Lidar, Daniel A

    2013-01-01

    Photonic quantum systems are among the most promising architectures for quantum computers. It is well known that for dual-rail photons effective non-linearities and near-deterministic non-trivial two-qubit gates can be achieved via the measurement process and by introducing ancillary photons. While in principle this opens a legitimate path to scalable linear optical quantum computing, the technical requirements are still very challenging and thus other optical encodings are being actively investigated. One of the alternatives is to use single-rail encoded photons, where entangled states can be deterministically generated. Here we prove that even for such systems universal optical quantum computing using only passive optical elements such as beam splitters and phase shifters is not possible. This no-go theorem proves that photon bunching cannot be passively suppressed even when extra ancilla modes and arbitrary number of photons are used. Our result provides useful guidance for the design of optical quantum computers.

  18. Quantum computing with atomic qubits and Rydberg interactions: progress and challenges

    NASA Astrophysics Data System (ADS)

    Saffman, M.

    2016-10-01

    We present a review of quantum computation with neutral atom qubits. After an overview of architectural options and approaches to preparing large qubit arrays we examine Rydberg mediated gate protocols and fidelity for two- and multi-qubit interactions. Quantum simulation and Rydberg dressing are alternatives to circuit based quantum computing for exploring many body quantum dynamics. We review the properties of the dressing interaction and provide a quantitative figure of merit for the complexity of the coherent dynamics that can be accessed with dressing. We conclude with a summary of the current status and an outlook for future progress.

  19. FOURTH SEMINAR TO THE MEMORY OF D.N. KLYSHKO: Quantum memory and quantum computations in the optical subradiance regime

    NASA Astrophysics Data System (ADS)

    Kalachev, A. A.; Samartsev, V. V.

    2005-08-01

    The possibilities of creation and manipulation of subradiant states in an extended atomic system by coherent 2π pulses are analysed. It is shown that excitation of the atomic system to collective subradiant states eliminates the superradiant broadening of the resonance line in quantum optical memory devices. The scheme of a nonlinear sign-shift two-qubit gate is proposed, which can be used in optical quantum computers.

  20. Holographic description of a quantum black hole on a computer.

    PubMed

    Hanada, Masanori; Hyakutake, Yoshifumi; Ishiki, Goro; Nishimura, Jun

    2014-05-23

    Black holes have been predicted to radiate particles and eventually evaporate, which has led to the information loss paradox and implies that the fundamental laws of quantum mechanics may be violated. Superstring theory, a consistent theory of quantum gravity, provides a possible solution to the paradox if evaporating black holes can actually be described in terms of standard quantum mechanical systems, as conjectured from the theory. Here, we test this conjecture by calculating the mass of a black hole in the corresponding quantum mechanical system numerically. Our results agree well with the prediction from gravity theory, including the leading quantum gravity correction. Our ability to simulate black holes offers the potential to further explore the yet mysterious nature of quantum gravity through well-established quantum mechanics.

  1. Holographic description of a quantum black hole on a computer

    NASA Astrophysics Data System (ADS)

    Hanada, Masanori; Hyakutake, Yoshifumi; Ishiki, Goro; Nishimura, Jun

    2014-05-01

    Black holes have been predicted to radiate particles and eventually evaporate, which has led to the information loss paradox and implies that the fundamental laws of quantum mechanics may be violated. Superstring theory, a consistent theory of quantum gravity, provides a possible solution to the paradox if evaporating black holes can actually be described in terms of standard quantum mechanical systems, as conjectured from the theory. Here, we test this conjecture by calculating the mass of a black hole in the corresponding quantum mechanical system numerically. Our results agree well with the prediction from gravity theory, including the leading quantum gravity correction. Our ability to simulate black holes offers the potential to further explore the yet mysterious nature of quantum gravity through well-established quantum mechanics.

  2. Fault-tolerant linear optical quantum computing with small-amplitude coherent States.

    PubMed

    Lund, A P; Ralph, T C; Haselgrove, H L

    2008-01-25

    Quantum computing using two coherent states as a qubit basis is a proposed alternative architecture with lower overheads but has been questioned as a practical way of performing quantum computing due to the fragility of diagonal states with large coherent amplitudes. We show that using error correction only small amplitudes (alpha>1.2) are required for fault-tolerant quantum computing. We study fault tolerance under the effects of small amplitudes and loss using a Monte Carlo simulation. The first encoding level resources are orders of magnitude lower than the best single photon scheme.

  3. Enabling Technologies for Scalable Trapped Ion Quantum Computing

    NASA Astrophysics Data System (ADS)

    Crain, Stephen; Gaultney, Daniel; Mount, Emily; Knoernschild, Caleb; Baek, Soyoung; Maunz, Peter; Kim, Jungsang

    2013-05-01

    Scalability is one of the main challenges of trapped ion based quantum computation, mainly limited by the lack of enabling technologies needed to trap, manipulate and process the increasing number of qubits. Microelectromechanical systems (MEMS) technology allows one to design movable micromirrors to focus laser beams on individual ions in a chain and steer the focal point in two dimensions. Our current MEMS system is designed to steer 355 nm pulsed laser beams to carry out logic gates on a chain of Yb ions with a waist of 1.5 μm across a 20 μm range. In order to read the state of the qubit chain we developed a 32-channel PMT with a custom read-out circuit operating near the thermal noise limit of the readout amplifier which increases state detection fidelity. We also developed a set of digital to analog converters (DACs) used to supply analog DC voltages to the electrodes of an ion trap. We designed asynchronous DACs to avoid added noise injection at the update rate commonly found in synchronous DACs. Effective noise filtering is expected to reduce the heating rate of a surface trap, thus improving multi-qubit logic gate fidelities. Our DAC system features 96 channels and an integrated FPGA that allows the system to be controlled in real time. This work was supported by IARPA/ARO.

  4. The superconducting quantum interference device microstrip amplifier: Computer models

    SciTech Connect

    Mu''ck, Michael; Clarke, John

    2000-12-01

    Computer models are presented for a microstrip amplifier based on a dc superconducting quantum interference device (SQUID). In this device, the signal is applied between one end of the spiral input coil and the square washer on which it is deposited. The amplifier exhibits substantial power gain when the signal frequency is such that a half wavelength is approximately equal to the length of the microstrip formed by the coil and the groundplane. The resonant frequency is lowered significantly by the inductance of the square washer transformed into the input coil; this reduction is consistent with predictions of a simple model and with analog simulations. With the washer grounded, the gain of the amplifier peaks at a frequency that is lowered from the unloaded resonant frequency by the damping of the resistance associated with the source. The position and magnitude of the peak are in good agreement with both a lumped circuit model and with a model representing the microstrip as a transmission line. When the counter electrode of the SQUID is grounded and the washer floats, feedback from the output of the SQUID to the input via the capacitance of the microstrip plays a major role and is well described by simulations using the transmission line model. Measurements of the input impedance of the microstrip amplifier show that the return loss can be positive or negative, depending on the sign of the feedback and whether the frequency is above or below the resonant frequency. This behavior is in good accord with simulations.

  5. Measurement-only topological quantum computation without forced measurements

    NASA Astrophysics Data System (ADS)

    Zheng, Huaixiu; Dua, Arpit; Jiang, Liang

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

  6. Step-by-step magic state encoding for efficient fault-tolerant quantum computation.

    PubMed

    Goto, Hayato

    2014-12-16

    Quantum error correction allows one to make quantum computers fault-tolerant against unavoidable errors due to decoherence and imperfect physical gate operations. However, the fault-tolerant quantum computation requires impractically large computational resources for useful applications. This is a current major obstacle to the realization of a quantum computer. In particular, magic state distillation, which is a standard approach to universality, consumes the most resources in fault-tolerant quantum computation. For the resource problem, here we propose step-by-step magic state encoding for concatenated quantum codes, where magic states are encoded step by step from the physical level to the logical one. To manage errors during the encoding, we carefully use error detection. Since the sizes of intermediate codes are small, it is expected that the resource overheads will become lower than previous approaches based on the distillation at the logical level. Our simulation results suggest that the resource requirements for a logical magic state will become comparable to those for a single logical controlled-NOT gate. Thus, the present method opens a new possibility for efficient fault-tolerant quantum computation.

  7. Linking computational and experimental studies of III-V quantum dots for optoelectronics and photovoltaics

    NASA Astrophysics Data System (ADS)

    Semichaevsky, A. V.; Goldman, R. S.; Johnson, H. T.

    2011-09-01

    Low-dimensional semiconductors (LDS) are semiconductor structures such as quantum dots, quantum wires, and quantum wells in which electron and hole wave functions are confined due to heterogeneous composition and often strongly affected by mismatch strain. Due to the quantum confinement, LDS exhibit unusual electronic and optical properties not found in bulk semiconductor materials. Quantum dots (QD) have found new applications in various semiconductor devices such as lasers, photodetectors, and solar cells. Precise design of QD structures requires understanding of their chemical composition and nanomechanical properties, and relies on both experimental and computational approaches. In this paper we provide an overview of computational and experimental methods for characterization of QD heterostructures. In particular, we review our own concerted efforts to bring together computation and experiment in order to better explain their optoelectronic and photovoltaic properties.

  8. Computational method for the quantum Hamilton-Jacobi equation: Bound states in one dimension

    SciTech Connect

    Chou, C.-C.; Wyatt, Robert E.

    2006-11-07

    An accurate computational method for the one-dimensional quantum Hamilton-Jacobi equation is presented. The Moebius propagation scheme, which can accurately pass through singularities, is used to numerically integrate the quantum Hamilton-Jacobi equation for the quantum momentum function. Bound state wave functions are then synthesized from the phase integral using the antithetic cancellation technique. Through this procedure, not only the quantum momentum functions but also the wave functions are accurately obtained. This computational approach is demonstrated through two solvable examples: the harmonic oscillator and the Morse potential. The excellent agreement between the computational and the exact analytical results shows that the method proposed here may be useful for solving similar quantum mechanical problems.

  9. Electron-Nuclear Spin Dynamics in a Mesoscopic Solid-State Quantum Computer

    SciTech Connect

    Berman, G.P.; Campbell, D.K.; Doolen, G.D.; Nagaev, K.E.

    1998-12-07

    We numerically simulate the process of nuclear spin measurement in Kane's quantum computer. For this purpose, we model the quantum dynamics of two coupled nuclear spins located on {sup 31}P donors implanted in Si. We estimate the minimum time of measurement necessary for the reliable transfer of quantum information from the nuclear spin subsystem to the electronic one and the probability of error for typical values of external noise.

  10. Simulation of chaos-assisted tunneling in a semiclassical regime on existing quantum computers

    SciTech Connect

    Chepelianskii, A.D.; Shepelyansky, D.L.

    2002-11-01

    We present a quantum algorithm that allows one to simulate chaos-assisted tunneling in deep semiclassical regime on existing quantum computers. This opens additional possibilities for investigation of macroscopic quantum tunneling and realization of semiclassical Schroedinger cat oscillations [E. Schroedinger, Naturwissenschaften 32, 807 (1935)]. Our numerical studies determine the decoherence rate induced by noisy gates for these oscillations and propose a suitable parameter regime for their experimental implementation.

  11. Quantum computational complexity of the N-representability problem: QMA complete.

    PubMed

    Liu, Yi-Kai; Christandl, Matthias; Verstraete, F

    2007-03-16

    We study the computational complexity of the N-representability problem in quantum chemistry. We show that this problem is quantum Merlin-Arthur complete, which is the quantum generalization of nondeterministic polynomial time complete. Our proof uses a simple mapping from spin systems to fermionic systems, as well as a convex optimization technique that reduces the problem of finding ground states to N representability.

  12. Protected quantum computing: interleaving gate operations with dynamical decoupling sequences.

    PubMed

    Zhang, Jingfu; Souza, Alexandre M; Brandao, Frederico Dias; Suter, Dieter

    2014-02-07

    Implementing precise operations on quantum systems is one of the biggest challenges for building quantum devices in a noisy environment. Dynamical decoupling attenuates the destructive effect of the environmental noise, but so far, it has been used primarily in the context of quantum memories. Here, we experimentally demonstrate a general scheme for combining dynamical decoupling with quantum logical gate operations using the example of an electron-spin qubit of a single nitrogen-vacancy center in diamond. We achieve process fidelities >98% for gate times that are 2 orders of magnitude longer than the unprotected dephasing time T2.

  13. Quantum Chemistry on Quantum Computers: A Polynomial-Time Quantum Algorithm for Constructing the Wave Functions of Open-Shell Molecules.

    PubMed

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

    2016-08-18

    Quantum computers are capable to efficiently perform full configuration interaction (FCI) calculations of atoms and molecules by using the quantum phase estimation (QPE) algorithm. Because the success probability of the QPE depends on the overlap between approximate and exact wave functions, efficient methods to prepare accurate initial guess wave functions enough to have sufficiently large overlap with the exact ones are highly desired. Here, we propose a quantum algorithm to construct the wave function consisting of one configuration state function, which is suitable for the initial guess wave function in QPE-based FCI calculations of open-shell molecules, based on the addition theorem of angular momentum. The proposed quantum algorithm enables us to prepare the wave function consisting of an exponential number of Slater determinants only by a polynomial number of quantum operations.

  14. Magnetic polyoxometalates: from molecular magnetism to molecular spintronics and quantum computing.

    PubMed

    Clemente-Juan, Juan M; Coronado, Eugenio; Gaita-Ariño, Alejandro

    2012-11-21

    In this review we discuss the relevance of polyoxometalate (POM) chemistry to provide model objects in molecular magnetism. We present several potential applications in nanomagnetism, in particular, in molecular spintronics and quantum computing.

  15. ZKCM: A C++ library for multiprecision matrix computation with applications in quantum information

    NASA Astrophysics Data System (ADS)

    SaiToh, Akira

    2013-08-01

    ZKCM is a C++ library developed for the purpose of multiprecision matrix computation, on the basis of the GNU MP and MPFR libraries. It provides an easy-to-use syntax and convenient functions for matrix manipulations including those often used in numerical simulations in quantum physics. Its extension library, ZKCM_QC, is developed for simulating quantum computing using the time-dependent matrix-product-state simulation method. This paper gives an introduction about the libraries with practical sample programs.

  16. FIFTH SEMINAR IN MEMORY OF D.N. KLYSHKO: Two schemes of logic gates for one-way quantum computing

    NASA Astrophysics Data System (ADS)

    Basharov, A. M.; Gorbachev, V. N.

    2007-12-01

    Two schemes of measurement-based gates are considered. The first scheme uses atomic cluster states generated by using the proposed cooperative process involving classical fields. The second scheme is based on the quantum correlation of biphotons and allows encoding classical information by the states of a quantum system.

  17. Computational and Mathematical Modeling of Coupled Superconducting Quantum Interference Devices

    NASA Astrophysics Data System (ADS)

    Berggren, Susan Anne Elizabeth

    This research focuses on conducting an extensive computational investigation and mathematical analysis into the average voltage response of arrays of Superconducting Quantum Interference Devices (SQUIDs). These arrays will serve as the basis for the development of a sensitive, low noise, significantly lower Size, Weight and Power (SWaP) antenna integrated with Low-Noise Amplifier (LNA) using the SQUID technology. The goal for this antenna is to be capable of meeting all requirements for Guided Missile Destroyers (DDG) 1000 class ships for Information Operations/Signals Intelligence (IO/SIGINT) applications in Very High Frequency/Ultra High Frequency (V/UHF) bands. The device will increase the listening capability of receivers by moving technology into a new regime of energy detection allowing wider band, smaller size, more sensitive, stealthier systems. The smaller size and greater sensitivity will allow for ships to be “de-cluttered” of their current large dishes and devices, replacing everything with fewer and smaller SQUID antenna devices. The fewer devices present on the deck of a ship, the more invisible the ship will be to enemy forces. We invent new arrays of SQUIDs, optimized for signal detection with very high dynamic range and excellent spur-free dynamic range, while maintaining extreme small size (and low radar cross section), wide bandwidth, and environmentally noise limited sensitivity, effectively shifting the bottle neck of receiver systems forever away from the antenna itself deeper into the receiver chain. To accomplish these goals we develop and validate mathematical models for different designs of SQUID arrays and use them to invent a new device and systems design. This design is capable of significantly exceeding, per size weight and power, state-of-the-art receiver system measures of performance, such as bandwidth, sensitivity, dynamic range, and spurious-free dynamic range.

  18. The mathematics of a quantum Hamiltonian computing half adder Boolean logic gate

    NASA Astrophysics Data System (ADS)

    Dridi, G.; Julien, R.; Hliwa, M.; Joachim, C.

    2015-08-01

    The mathematics behind the quantum Hamiltonian computing (QHC) approach of designing Boolean logic gates with a quantum system are given. Using the quantum eigenvalue repulsion effect, the QHC AND, NAND, OR, NOR, XOR, and NXOR Hamiltonian Boolean matrices are constructed. This is applied to the construction of a QHC half adder Hamiltonian matrix requiring only six quantum states to fullfil a half Boolean logical truth table. The QHC design rules open a nano-architectronic way of constructing Boolean logic gates inside a single molecule or atom by atom at the surface of a passivated semi-conductor.

  19. The mathematics of a quantum Hamiltonian computing half adder Boolean logic gate.

    PubMed

    Dridi, G; Julien, R; Hliwa, M; Joachim, C

    2015-08-28

    The mathematics behind the quantum Hamiltonian computing (QHC) approach of designing Boolean logic gates with a quantum system are given. Using the quantum eigenvalue repulsion effect, the QHC AND, NAND, OR, NOR, XOR, and NXOR Hamiltonian Boolean matrices are constructed. This is applied to the construction of a QHC half adder Hamiltonian matrix requiring only six quantum states to fullfil a half Boolean logical truth table. The QHC design rules open a nano-architectronic way of constructing Boolean logic gates inside a single molecule or atom by atom at the surface of a passivated semi-conductor.

  20. Cluster-state quantum computing enhanced by high-fidelity generalized measurements.

    PubMed

    Biggerstaff, D N; Kaltenbaek, R; Hamel, D R; Weihs, G; Rudolph, T; Resch, K J

    2009-12-11

    We introduce and implement a technique to extend the quantum computational power of cluster states by replacing some projective measurements with generalized quantum measurements (POVMs). As an experimental demonstration we fully realize an arbitrary three-qubit cluster computation by implementing a tunable linear-optical POVM, as well as fast active feedforward, on a two-qubit photonic cluster state. Over 206 different computations, the average output fidelity is 0.9832+/-0.0002; furthermore the error contribution from our POVM device and feedforward is only of O(10(-3)), less than some recent thresholds for fault-tolerant cluster computing.

  1. International journal of quantum chemistry. Quantum Chemistry Symposium Number 27: Proceedings of the International Symposium on Atomic, Molecular, and Condensed Matter Theory and Computational Methods

    NASA Astrophysics Data System (ADS)

    Lowdin, Per-Olov; Ohrn, N. Y.; Sabin, John R.; Zerner, Michael C.

    1993-03-01

    The topics covered at the 33rd annual Sanibel Symposium, organized by the faculty and staff of the Quantum Theory Project of the University of Florida, and held March 13 - 20, 1993, include advanced scientific computing, interaction of photons and matter, quantum molecular dynamics, electronic structure methods, polymeric systems, and quantum chemical methods for extended systems.

  2. Weapons of Mass Simulation: Smashing down the barriers to building a robust quantum computer

    NASA Astrophysics Data System (ADS)

    Crosswhite, Gregory Milton

    Quantum computation holds the potential to bring forth a new age of science and engineering when currently intractable problems can be routinely solved on a quantum computer. Unfortunately, it is very difficult to design a quantum computer that is robust to noise. In this thesis, we present two tools that leverage classical computational power to attack this problem. The first tool, CodeQuest, is an algorithm that computes the optimal quantum subsystem code that can be implemented using an input choice of Pauli measurement; it proves particularly useful for searching through large sets of choices of measurements to see if any of them result in a useful code. The second tool, Matrix Product States, is an ansatz that one can use to compute the lowest-lying eigenspectra of a Hamiltonian by employing the variational method. For each of these tools we describe both the theory behind them and the practice of using them to advance the science of designing robust quantum computers.

  3. Computations and interpretations: The growth of quantum chemistry, 1927-1967

    NASA Astrophysics Data System (ADS)

    Park, Buhm Soon

    1999-10-01

    This dissertation is a contribution to the historical study of scientific disciplines in the twentieth century. It seeks to examine the development of quantum chemistry during the four decades after its inception in 1927. This development was manifest in theories, tools, scientists, and institutions, all of which constituted the disciplinary identity of quantum chemistry. To characterize its identity, I deal with the origins of key ideas and concepts; the change of computational tools from desk calculators to digital computers; the formation of a network among research groups and individuals; and the institutionalization of annual meetings. The dissertation's thesis is three-fold. First, in the pre- World War II years, there were individual contributions to the development of theories in quantum chemistry, but the founding fathers worked in their disciplinary contexts of physics or chemistry with little interest in building a quantum chemistry community. Second, the introduction of electronic digital computers in the postwar years affected the resurgence of the ab initio approach-the attempt to solve the Schrödinger equation without recourse to empirical data-and also the emergence of a community of quantum chemists. But the use of computers did not give rise to a consensus over the aims, methods, or content of the discipline. Third, quantum chemistry exerted a significant influence upon the transformation of chemical education and research in general, thanks to ``chemical translators,'' who sought to explain the gist of quantum chemistry in a language that chemists could understand. In sum, quantum chemistry has been a discipline characterized by diverse traditions, and the whole of chemistry has been under the influence of computations and interpretations made by quantum chemists.

  4. Holonomic quantum computation in the ultrastrong-coupling regime of circuit QED

    NASA Astrophysics Data System (ADS)

    Wang, Yimin; Zhang, Jiang; Wu, Chunfeng; You, J. Q.; Romero, G.

    2016-07-01

    We present an experimentally feasible scheme to implement holonomic quantum computation in the ultrastrong-coupling regime of light-matter interaction. The large anharmonicity and the Z2 symmetry of the quantum Rabi model allow us to build an effective three-level Λ -structured artificial atom for quantum computation. The proposed physical implementation includes two gradiometric flux qubits and two microwave resonators where single-qubit gates are realized by a two-tone driving on one physical qubit, and a two-qubit gate is achieved with a time-dependent coupling between the field quadratures of both resonators. Our work paves the way for scalable holonomic quantum computation in ultrastrongly coupled systems.

  5. Polarization-dependent atomic dipole traps behind a circular aperture for neutral-atom quantum computing

    NASA Astrophysics Data System (ADS)

    Gillen-Christandl, Katharina; Copsey, Bert D.

    2011-02-01

    The neutral-atom quantum computing community has successfully implemented almost all necessary steps for constructing a neutral-atom quantum computer. We present computational results of a study aimed at solving the remaining problem of creating a quantum memory with individually addressable sites for quantum computing. The basis of this quantum memory is the diffraction pattern formed by laser light incident on a circular aperture. Very close to the aperture, the diffraction pattern has localized bright and dark spots that can serve as red-detuned or blue-detuned atomic dipole traps. These traps are suitable for quantum computing even for moderate laser powers. In particular, for moderate laser intensities (~100 W/cm2) and comparatively small detunings (~1000-10 000 linewidths), trap depths of ~1 mK and trap frequencies of several to tens of kilohertz are achieved. Our results indicate that these dipole traps can be moved by tilting the incident laser beams without significantly changing the trap properties. We also explored the polarization dependence of these dipole traps. We developed a code that calculates the trapping potential energy for any magnetic substate of any hyperfine ground state of any alkali-metal atom for any laser detuning much smaller than the fine-structure splitting for any given electric field distribution. We describe details of our calculations and include a summary of different notations and conventions for the reduced matrix element and how to convert it to SI units. We applied this code to these traps and found a method for bringing two traps together and apart controllably without expelling the atoms from the trap and without significant tunneling probability between the traps. This approach can be scaled up to a two-dimensional array of many pinholes, forming a quantum memory with single-site addressability, in which pairs of atoms can be brought together and apart for two-qubit gates for quantum computing.

  6. Polarization-dependent atomic dipole traps behind a circular aperture for neutral-atom quantum computing

    SciTech Connect

    Gillen-Christandl, Katharina; Copsey, Bert D.

    2011-02-15

    The neutral-atom quantum computing community has successfully implemented almost all necessary steps for constructing a neutral-atom quantum computer. We present computational results of a study aimed at solving the remaining problem of creating a quantum memory with individually addressable sites for quantum computing. The basis of this quantum memory is the diffraction pattern formed by laser light incident on a circular aperture. Very close to the aperture, the diffraction pattern has localized bright and dark spots that can serve as red-detuned or blue-detuned atomic dipole traps. These traps are suitable for quantum computing even for moderate laser powers. In particular, for moderate laser intensities ({approx}100 W/cm{sup 2}) and comparatively small detunings ({approx}1000-10 000 linewidths), trap depths of {approx}1 mK and trap frequencies of several to tens of kilohertz are achieved. Our results indicate that these dipole traps can be moved by tilting the incident laser beams without significantly changing the trap properties. We also explored the polarization dependence of these dipole traps. We developed a code that calculates the trapping potential energy for any magnetic substate of any hyperfine ground state of any alkali-metal atom for any laser detuning much smaller than the fine-structure splitting for any given electric field distribution. We describe details of our calculations and include a summary of different notations and conventions for the reduced matrix element and how to convert it to SI units. We applied this code to these traps and found a method for bringing two traps together and apart controllably without expelling the atoms from the trap and without significant tunneling probability between the traps. This approach can be scaled up to a two-dimensional array of many pinholes, forming a quantum memory with single-site addressability, in which pairs of atoms can be brought together and apart for two-qubit gates for quantum computing.

  7. A Quantum Annealing Computer Team Addresses Climate Change Predictability

    NASA Technical Reports Server (NTRS)

    Halem, M. (Principal Investigator); LeMoigne, J.; Dorband, J.; Lomonaco, S.; Yesha, Ya.; Simpson, D.; Clune, T.; Pelissier, C.; Nearing, G.; Gentine, P.; Fang, B.; Shehab, A.; Radov, Asen; Tikak, N.; Prouty, Roy; Harrison, Kenneth

    2016-01-01

    The near confluence of the successful launch of the Orbiting Carbon Observatory2 on July 2, 2014 and the acceptance on August 20, 2015 by Google, NASA Ames Research Center and USRA of a 1152 qubit D-Wave 2X Quantum Annealing Computer (QAC), offered an exceptional opportunity to explore the potential of this technology to address the scientific prediction of global annual carbon uptake by land surface processes. At UMBC,we have collected and processed 20 months of global Level 2 light CO2 data as well as fluorescence data. In addition we have collected ARM data at 2sites in the US and Ameriflux data at more than 20 stations. J. Dorband has developed and implemented a multi-hidden layer Boltzmann Machine (BM) algorithm on the QAC. Employing the BM, we are calculating CO2 fluxes by training collocated OCO-2 level 2 CO2 data with ARM ground station tower data to infer to infer measured CO2 flux data. We generate CO2 fluxes with a regression analysis using these BM derived weights on the level 2 CO2 data for three Ameriflux sites distinct from the ARM stations. P. Gentine has negotiated for the access of K34 Ameriflux data in the Amazon and is applying a neural net to infer the CO2 fluxes. N. Talik validated the accuracy of the BM performance on the QAC against a restricted BM implementation on the IBM Softlayer Cloud with the Nvidia co-processors utilizing the same data sets. G. Nearing and K. Harrison have extended the GSFC LIS model with the NCAR Noah photosynthetic parameterization and have run a 10 year global prediction of the net ecosystem exchange. C. Pellisier is preparing a BM implementation of the Kalman filter data assimilation of CO2 fluxes. At UMBC, R. Prouty is conducting OSSE experiments with the LISNoah model on the IBM iDataPlex to simulate the impact of CO2 fluxes to improve the prediction of global annual carbon uptake. J. LeMoigne and D. Simpson have developed a neural net image registration system that will be used for MODIS ENVI and will be

  8. Molecular Orbitals of NO, NO[superscript+], and NO[superscript-]: A Computational Quantum Chemistry Experiment

    ERIC Educational Resources Information Center

    Orenha, Renato P.; Galembeck, Sérgio E.

    2014-01-01

    This computational experiment presents qualitative molecular orbital (QMO) and computational quantum chemistry exercises of NO, NO[superscript+], and NO[superscript-]. Initially students explore several properties of the target molecules by Lewis diagrams and the QMO theory. Then, they compare qualitative conclusions with EHT and DFT calculations…

  9. Practical experimental certification of computational quantum gates using a twirling procedure.

    PubMed

    Moussa, Osama; da Silva, Marcus P; Ryan, Colm A; Laflamme, Raymond

    2012-08-17

    Because of the technical difficulty of building large quantum computers, it is important to be able to estimate how faithful a given implementation is to an ideal quantum computer. The common approach of completely characterizing the computation process via quantum process tomography requires an exponential amount of resources, and thus is not practical even for relatively small devices. We solve this problem by demonstrating that twirling experiments previously used to characterize the average fidelity of quantum memories efficiently can be easily adapted to estimate the average fidelity of the experimental implementation of important quantum computation processes, such as unitaries in the Clifford group, in a practical and efficient manner with applicability in current quantum devices. Using this procedure, we demonstrate state-of-the-art coherent control of an ensemble of magnetic moments of nuclear spins in a single crystal solid by implementing the encoding operation for a 3-qubit code with only a 1% degradation in average fidelity discounting preparation and measurement errors. We also highlight one of the advances that was instrumental in achieving such high fidelity control.

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

    PubMed

    Elsayed, Tarek A; Fine, Boris V

    2013-02-15

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

  11. Fault-tolerant quantum computation with a soft-decision decoder for error correction and detection by teleportation.

    PubMed

    Goto, Hayato; Uchikawa, Hironori

    2013-01-01

    Fault-tolerant quantum computation with quantum error-correcting codes has been considerably developed over the past decade. However, there are still difficult issues, particularly on the resource requirement. For further improvement of fault-tolerant quantum computation, here we propose a soft-decision decoder for quantum error correction and detection by teleportation. This decoder can achieve almost optimal performance for the depolarizing channel. Applying this decoder to Knill's C4/C6 scheme for fault-tolerant quantum computation, which is one of the best schemes so far and relies heavily on error correction and detection by teleportation, we dramatically improve its performance. This leads to substantial reduction of resources.

  12. Theoretical discussion for quantum computation in biological systems

    NASA Astrophysics Data System (ADS)

    Baer, Wolfgang

    2010-04-01

    Analysis of the brain as a physical system, that has the capacity of generating a display of every day observed experiences and contains some knowledge of the physical reality which stimulates those experiences, suggests the brain executes a self-measurement process described by quantum theory. Assuming physical reality is a universe of interacting self-measurement loops, we present a model of space as a field of cells executing such self-measurement activities. Empty space is the observable associated with the measurement of this field when the mass and charge density defining the material aspect of the cells satisfy the least action principle. Content is the observable associated with the measurement of the quantum wave function ψ interpreted as mass-charge displacements. The illusion of space and its content incorporated into cognitive biological systems is evidence of self-measurement activity that can be associated with quantum operations.

  13. Computational approach for calculating bound states in quantum field theory

    NASA Astrophysics Data System (ADS)

    Lv, Q. Z.; Norris, S.; Brennan, R.; Stefanovich, E.; Su, Q.; Grobe, R.

    2016-09-01

    We propose a nonperturbative approach to calculate bound-state energies and wave functions for quantum field theoretical models. It is based on the direct diagonalization of the corresponding quantum field theoretical Hamiltonian in an effectively discretized and truncated Hilbert space. We illustrate this approach for a Yukawa-like interaction between fermions and bosons in one spatial dimension and show where it agrees with the traditional method based on the potential picture and where it deviates due to recoil and radiative corrections. This method permits us also to obtain some insight into the spatial characteristics of the distribution of the fermions in the ground state, such as the bremsstrahlung-induced widening.

  14. Decoherence-free manipulation of photonic memories for quantum computation

    SciTech Connect

    Sangouard, N.

    2006-02-15

    We present a protocol to construct an arbitrary quantum circuit. The quantum bits (qubits) are encoded in polarization states of single photons. They are stored in spatially separated dense media deposed in an optical cavity. Specific sequences of pulses address individually the storage media to encode the qubits and to implement a universal set of gates. The proposed protocol is decoherence-free in the sense that spontaneous emission and cavity damping are avoided. We discuss a coupling scheme for experimental implementation in neon atoms.

  15. A Study of Complex Deep Learning Networks on High Performance, Neuromorphic, and Quantum Computers

    SciTech Connect

    Potok, Thomas E; Schuman, Catherine D; Young, Steven R; Patton, Robert M; Spedalieri, Federico; Liu, Jeremy; Yao, Ke-Thia; Rose, Garrett; Chakma, Gangotree

    2016-01-01

    Current Deep Learning models use highly optimized convolutional neural networks (CNN) trained on large graphical processing units (GPU)-based computers with a fairly simple layered network topology, i.e., highly connected layers, without intra-layer connections. Complex topologies have been proposed, but are intractable to train on current systems. Building the topologies of the deep learning network requires hand tuning, and implementing the network in hardware is expensive in both cost and power. In this paper, we evaluate deep learning models using three different computing architectures to address these problems: quantum computing to train complex topologies, high performance computing (HPC) to automatically determine network topology, and neuromorphic computing for a low-power hardware implementation. Due to input size limitations of current quantum computers we use the MNIST dataset for our evaluation. The results show the possibility of using the three architectures in tandem to explore complex deep learning networks that are untrainable using a von Neumann architecture. We show that a quantum computer can find high quality values of intra-layer connections and weights, while yielding a tractable time result as the complexity of the network increases; a high performance computer can find optimal layer-based topologies; and a neuromorphic computer can represent the complex topology and weights derived from the other architectures in low power memristive hardware. This represents a new capability that is not feasible with current von Neumann architecture. It potentially enables the ability to solve very complicated problems unsolvable with current computing technologies.

  16. GENERAL: Preservation of quantum states via a super-Zeno effect on ensemble quantum computers

    NASA Astrophysics Data System (ADS)

    Ren, Ting-Ting; Luo, Jun; Sun, Xian-Ping; Zhan, Ming-Sheng

    2009-11-01

    Following a recent proposal by Dhar et al (2006 Phys. Rev. Lett. 96 100405), we demonstrate experimentally the preservation of quantum states in a two-qubit system based on a super-Zeno effect using liquid-state nuclear magnetic resonance techniques. Using inverting radiofrequency pulses and delicately selecting time intervals between two pulses, we suppress the effect of decoherence of quantum states. We observe that preservation of the quantum state |11rangle with the super-Zeno effect is three times more efficient than the ordinary one with the standard Zeno effect.

  17. Designing reversible arithmetic, logic circuit to implement micro-operation in quantum computation

    NASA Astrophysics Data System (ADS)

    Kalita, Gunajit; Saikia, Navajit

    2016-10-01

    The futuristic computing is desired to be more power full with low-power consumption. That is why quantum computing has been a key area of research for quite some time and is getting more and more attention. Quantum logic being reversible, a significant amount of contributions has been reported on reversible logic in recent times. Reversible circuits are essential parts of quantum computers, and hence their designs are of great importance. In this paper, designs of reversible circuits are proposed using a recently proposed reversible gate for arithmetic and logic operations to implement various micro-operations (simple add and subtract, add with carry, subtract with borrow, transfer, incrementing, decrementing etc., and logic operations like XOR, XNOR, complementing etc.) in a reversible computer like quantum computer. The two new reversible designs proposed here for half adder and full adders are also used in the presented reversible circuits to implement various microoperations. The quantum costs of these designs are comparable. Many of the implemented micro-operations are not seen in previous literatures. The performances of the proposed circuits are compared with existing designs wherever available.

  18. Dressed qubits: a new method for eliminating inherent gate errors in quantum computation

    NASA Astrophysics Data System (ADS)

    Wu, Lian-Ao; Lidar, Daniel A.

    2003-03-01

    Inherent gate errors can arise in quantum computation when the applied Hamiltonian deviates from the desired one. Two important examples are (1) Quantum computation using spin-coupled quantum dots in the presence of spin-orbit perturbations to the Heisenberg exchange interaction; (2) Off-resonant transitions induced by strong and fast pulses. Quantum error correcting codes cannot deal with such errors if they are too strong. In this talk we propose a new solution for dealing with such inherent errors: dressed qubits. Particularly important is the fact that the dressed qubits method does not require additional operations or encoding redundancy, can be applied in the presence of large errors, and is experimentally feasible. We present the general notion of dressed qubits and then focus on the two examples of inherent errors mentioned above.

  19. Non-adiabatic holonomic quantum computation in linear system-bath coupling

    PubMed Central

    Sun, Chunfang; Wang, Gangcheng; Wu, Chunfeng; Liu, Haodi; Feng, Xun-Li; Chen, Jing-Ling; Xue, Kang

    2016-01-01

    Non-adiabatic holonomic quantum computation in decoherence-free subspaces protects quantum information from control imprecisions and decoherence. For the non-collective decoherence that each qubit has its own bath, we show the implementations of two non-commutable holonomic single-qubit gates and one holonomic nontrivial two-qubit gate that compose a universal set of non-adiabatic holonomic quantum gates in decoherence-free-subspaces of the decoupling group, with an encoding rate of . The proposed scheme is robust against control imprecisions and the non-collective decoherence, and its non-adiabatic property ensures less operation time. We demonstrate that our proposed scheme can be realized by utilizing only two-qubit interactions rather than many-qubit interactions. Our results reduce the complexity of practical implementation of holonomic quantum computation in experiments. We also discuss the physical implementation of our scheme in coupled microcavities. PMID:26846444

  20. Simulation of Si:P spin-based quantum computer architecture

    SciTech Connect

    Chang Yiachung; Fang Angbo

    2008-11-07

    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.