Adiabatic topological quantum computing
NASA Astrophysics Data System (ADS)
Cesare, Chris; Landahl, Andrew J.; Bacon, Dave; Flammia, Steven T.; Neels, Alice
2015-07-01
Topological quantum computing promises error-resistant quantum computation without active error correction. However, there is a worry that during the process of executing quantum gates by braiding anyons around each other, extra anyonic excitations will be created that will disorder the encoded quantum information. Here, we explore this question in detail by studying adiabatic code deformations on Hamiltonians based on topological codes, notably Kitaev's surface codes and the more recently discovered color codes. We develop protocols that enable universal quantum computing by adiabatic evolution in a way that keeps the energy gap of the system constant with respect to the computation size and introduces only simple local Hamiltonian interactions. This allows one to perform holonomic quantum computing with these topological quantum computing systems. The tools we develop allow one to go beyond numerical simulations and understand these processes analytically.
Entanglement and adiabatic quantum computation
NASA Astrophysics Data System (ADS)
Ahrensmeier, D.
2006-06-01
Adiabatic quantum computation provides an alternative approach to quantum computation using a time-dependent Hamiltonian. The time evolution of entanglement during the adiabatic quantum search algorithm is studied, and its relevance as a resource is discussed.
NASA Astrophysics Data System (ADS)
Landahl, Andrew
2012-10-01
Quantum computers promise to exploit counterintuitive quantum physics principles like superposition, entanglement, and uncertainty to solve problems using fundamentally fewer steps than any conventional computer ever could. The mere possibility of such a device has sharpened our understanding of quantum coherent information, just as lasers did for our understanding of coherent light. The chief obstacle to developing quantum computer technology is decoherence--one of the fastest phenomena in all of physics. In principle, decoherence can be overcome by using clever entangled redundancies in a process called fault-tolerant quantum error correction. However, the quality and scale of technology required to realize this solution appears distant. An exciting alternative is a proposal called ``adiabatic'' quantum computing (AQC), in which adiabatic quantum physics keeps the computer in its lowest-energy configuration throughout its operation, rendering it immune to many decoherence sources. The Adiabatic Quantum Architectures In Ultracold Systems (AQUARIUS) Grand Challenge Project at Sandia seeks to demonstrate this robustness in the laboratory and point a path forward for future hardware development. We are building devices in AQUARIUS that realize the AQC architecture on up to three quantum bits (``qubits'') in two platforms: Cs atoms laser-cooled to below 5 microkelvin and Si quantum dots cryo-cooled to below 100 millikelvin. We are also expanding theoretical frontiers by developing methods for scalable universal AQC in these platforms. We have successfully demonstrated operational qubits in both platforms and have even run modest one-qubit calculations using our Cs device. In the course of reaching our primary proof-of-principle demonstrations, we have developed multiple spinoff technologies including nanofabricated diffractive optical elements that define optical-tweezer trap arrays and atomic-scale Si lithography commensurate with placing individual donor atoms with
Graph isomorphism and adiabatic quantum computing
NASA Astrophysics Data System (ADS)
Gaitan, Frank; Clark, Lane
2014-02-01
In the graph isomorphism (GI) problem two N-vertex graphs G and G' are given and the task is to determine whether there exists a permutation of the vertices of G that preserves adjacency and transforms G →G'. If yes, then G and G' are said to be isomorphic; otherwise they are nonisomorphic. The GI problem is an important problem in computer science and is thought to be of comparable difficulty to integer factorization. In this paper we present a quantum algorithm that solves arbitrary instances of GI and which also provides an approach to determining all automorphisms of a given graph. We show how the GI problem can be converted to a combinatorial optimization problem that can be solved using adiabatic quantum evolution. We numerically simulate the algorithm's quantum dynamics and show that it correctly (i) distinguishes nonisomorphic graphs; (ii) recognizes isomorphic graphs and determines the permutation(s) that connect them; and (iii) finds the automorphism group of a given graph G. We then discuss the GI quantum algorithm's experimental implementation, and close by showing how it can be leveraged to give a quantum algorithm that solves arbitrary instances of the NP-complete subgraph isomorphism problem. The computational complexity of an adiabatic quantum algorithm is largely determined by the minimum energy gap Δ (N) separating the ground and first-excited states in the limit of large problem size N ≫1. Calculating Δ (N) in this limit is a fundamental open problem in adiabatic quantum computing, and so it is not possible to determine the computational complexity of adiabatic quantum algorithms in general, nor consequently, of the specific adiabatic quantum algorithms presented here. Adiabatic quantum computing has been shown to be equivalent to the circuit model of quantum computing, and so development of adiabatic quantum algorithms continues to be of great interest.
Trapped Ion Quantum Computation by Adiabatic Passage
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.
Random matrix model of adiabatic quantum computing
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.
Decoherence in a scalable adiabatic quantum computer
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.
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.
Graph isomorphism and adiabatic quantum computing
NASA Astrophysics Data System (ADS)
Gaitan, Frank; Clark, Lane
2014-03-01
In the Graph Isomorphism (GI) problem two N-vertex graphs G and G' are given and the task is to determine whether there exists a permutation of the vertices of G that preserves adjacency and maps G --> G'. If yes (no), then G and G' are said to be isomorphic (non-isomorphic). The GI problem is an important problem in computer science and is thought to be of comparable difficulty to integer factorization. We present a quantum algorithm that solves arbitrary instances of GI, and which provides a novel approach to determining all automorphisms of a graph. The algorithm converts a GI instance to a combinatorial optimization problem that can be solved using adiabatic quantum evolution. Numerical simulation of the algorithm's quantum dynamics shows that it correctly distinguishes non-isomorphic graphs; recognizes isomorphic graphs; and finds the automorphism group of a graph. We also discuss the algorithm's experimental implementation and show how it can be leveraged to solve arbitrary instances of the NP-Complete Sub-Graph Isomorphism problem.
Adiabatic Quantum Computation with Neutral Atoms
NASA Astrophysics Data System (ADS)
Biedermann, Grant
2013-03-01
We are implementing a new platform for adiabatic quantum computation (AQC)[2] based on trapped neutral atoms whose coupling is mediated by the dipole-dipole interactions of Rydberg states. Ground state cesium atoms are dressed by laser fields in a manner conditional on the Rydberg blockade mechanism,[3,4] thereby providing the requisite entangling interactions. As a benchmark we study a Quadratic Unconstrained Binary Optimization (QUBO) problem whose solution is found in the ground state spin configuration of an Ising-like model. In collaboration with Lambert Parazzoli, Sandia National Laboratories; Aaron Hankin, Center for Quantum Information and Control (CQuIC), University of New Mexico; James Chin-Wen Chou, Yuan-Yu Jau, Peter Schwindt, Cort Johnson, and George Burns, Sandia National Laboratories; Tyler Keating, Krittika Goyal, and Ivan Deutsch, Center for Quantum Information and Control (CQuIC), University of New Mexico; and Andrew Landahl, Sandia National Laboratories. This work was supported by the Laboratory Directed Research and Development program at Sandia National Laboratories
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.
Digitized adiabatic quantum computing with a superconducting circuit.
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-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. PMID:27279216
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.
Adiabatically implementing quantum gates
Sun, Jie; Lu, Songfeng Liu, Fang
2014-06-14
We show that, through the approach of quantum adiabatic evolution, all of the usual quantum gates can be implemented efficiently, yielding running time of order O(1). This may be considered as a useful alternative to the standard quantum computing approach, which involves quantum gates transforming quantum states during the computing process.
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.
Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network
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
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.
Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network.
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
Adiabatic quantum computing with phase modulated laser pulses
Goswami, Debabrata
2005-01-01
Implementation of quantum logical gates for multilevel systems is demonstrated through decoherence control under the quantum adiabatic method using simple phase modulated laser pulses. We make use of selective population inversion and Hamiltonian evolution with time to achieve such goals robustly instead of the standard unitary transformation language. PMID:17195865
Differential geometric treewidth estimation in adiabatic quantum computation
NASA Astrophysics Data System (ADS)
Wang, Chi; Jonckheere, Edmond; Brun, Todd
2016-07-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.
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.
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.
Non-adiabatic holonomic quantum computation in linear system-bath coupling
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
Non-adiabatic holonomic quantum computation in linear system-bath coupling
NASA Astrophysics Data System (ADS)
Sun, Chunfang; Wang, Gangcheng; Wu, Chunfeng; Liu, Haodi; Feng, Xun-Li; Chen, Jing-Ling; Xue, Kang
2016-02-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.
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.
NASA Astrophysics Data System (ADS)
Marvian, Milad; Lidar, Daniel
We investigate the performance of error suppression schemes for adiabatic quantum computation. Assuming a Markovian environment and using an adiabatic master equation we compare the rate of excitation from the ground subspace of the encoded Hamiltonian during the evolution to that of the unprotected Hamiltonian. For different forms of Markovian environments -- such as sub-Ohmic, Ohmic and super-Ohmic -- we identify the parameter thresholds for which encoding starts exhibiting its benefits.
Digitized adiabatic quantum computing with a superconducting circuit, part I: Theory
NASA Astrophysics Data System (ADS)
Lamata, L.; Barends, R.; Shabani, A.; 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.; Solano, E.; Neven, H.; Martinis, John M.
Adiabatic quantum computing (AQC) is a general-purpose optimization algorithm that in contrast to circuit-model quantum algorithms can be applied to a large set of computational problems. An analog physical realization of AQC has certain limitations that we propose can be overcome by a gate-model equivalence of the AQC. In this talk we discuss the hardware advantages of digitized AQC in particular arbitrary interactions, precision, and coherence. We could experimentally realize the principles of digitized AQC on a chain of nine qubits, and highlight the physics of adiabatic evolutions as well as the Kibble-Zurek mechanism.
Universal adiabatic quantum computation via the space-time circuit-to-Hamiltonian construction.
Gosset, David; Terhal, Barbara M; Vershynina, Anna
2015-04-10
We show how to perform universal adiabatic quantum computation using a Hamiltonian which describes a set of particles with local interactions on a two-dimensional grid. A single parameter in the Hamiltonian is adiabatically changed as a function of time to simulate the quantum circuit. We bound the eigenvalue gap above the unique ground state by mapping our model onto the ferromagnetic XXZ chain with kink boundary conditions; the gap of this spin chain was computed exactly by Koma and Nachtergaele using its q-deformed version of SU(2) symmetry. We also discuss a related time-independent Hamiltonian which was shown by Janzing to be capable of universal computation. We observe that in the limit of large system size, the time evolution is equivalent to the exactly solvable quantum walk on Young's lattice. PMID:25910098
NASA Astrophysics Data System (ADS)
Song, Xue-Ke; Zhang, Hao; Ai, Qing; Qiu, Jing; Deng, Fu-Guo
2016-02-01
By using transitionless quantum driving algorithm (TQDA), we present an efficient scheme for the shortcuts to the holonomic quantum computation (HQC). It works in decoherence-free subspace (DFS) and the adiabatic process can be speeded up in the shortest possible time. More interestingly, we give a physical implementation for our shortcuts to HQC with nitrogen-vacancy centers in diamonds dispersively coupled to a whispering-gallery mode microsphere cavity. It can be efficiently realized by controlling appropriately the frequencies of the external laser pulses. Also, our scheme has good scalability with more qubits. Different from previous works, we first use TQDA to realize a universal HQC in DFS, including not only two noncommuting accelerated single-qubit holonomic gates but also a accelerated two-qubit holonomic controlled-phase gate, which provides the necessary shortcuts for the complete set of gates required for universal quantum computation. Moreover, our experimentally realizable shortcuts require only two-body interactions, not four-body ones, and they work in the dispersive regime, which relax greatly the difficulty of their physical implementation in experiment. Our numerical calculations show that the present scheme is robust against decoherence with current experimental parameters.
NASA Astrophysics Data System (ADS)
Dattani, Nike; Tanburn, Richard; Lunt, Oliver
We introduce two methods for speeding up adiabatic quantum computations by increasing the energy between the ground and first excited states. Our methods are even more general. They can be used to shift a Hamiltonian's density of states away from the ground state, so that fewer states occupy the low-lying energies near the minimum, hence allowing for faster adiabatic passages to find the ground state with less risk of getting caught in an undesired low-lying excited state during the passage. Even more generally, our methods can be used to transform a discrete optimization problem into a new one whose unique minimum still encodes the desired answer, but with the objective function's values forming a different landscape. Aspects of the landscape such as the objective function's range, or the values of certain coefficients, or how many different inputs lead to a given output value, can be decreased *or* increased. One of the many examples for which these methods are useful is in finding the ground state of a Hamiltonian using NMR. We apply our methods to an AQC algorithm for integer factorization, and the first method reduces the maximum runtime in our example by up to 754%, and the second method reduces the maximum runtime of another example by up to 250%.
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.
Do multipartite correlations speed up adiabatic quantum computation or quantum annealing?
NASA Astrophysics Data System (ADS)
Batle, J.; Ooi, C. H. Raymond; Farouk, Ahmed; Abutalib, M.; Abdalla, S.
2016-08-01
Quantum correlations are thought to be the reason why certain quantum algorithms overcome their classical counterparts. Since the nature of this resource is still not fully understood, we shall investigate how multipartite entanglement and non-locality among qubits vary as the quantum computation runs. We shall encounter that quantum measures on the whole system cannot account for their corresponding speedup.
Do multipartite correlations speed up adiabatic quantum computation or quantum annealing?
NASA Astrophysics Data System (ADS)
Batle, J.; Ooi, C. H. Raymond; Farouk, Ahmed; Abutalib, M.; Abdalla, S.
2016-04-01
Quantum correlations are thought to be the reason why certain quantum algorithms overcome their classical counterparts. Since the nature of this resource is still not fully understood, we shall investigate how multipartite entanglement and non-locality among qubits vary as the quantum computation runs. We shall encounter that quantum measures on the whole system cannot account for their corresponding speedup.
Comment on ``Adiabatic quantum computation with a one-dimensional projector Hamiltonian''
NASA Astrophysics Data System (ADS)
Kay, Alastair
2013-10-01
The partial adiabatic search algorithm was introduced in Tulsi's paper [Phys. Rev. APLRAAN1050-294710.1103/PhysRevA.80.052328 80, 052328 (2009)] as a modification of the usual adiabatic algorithm for a quantum search with the idea that most of the interesting computation only happens over a very short range of the adiabatic path. By focusing on that restricted range, one can potentially gain an advantage by reducing the control requirements on the system, enabling a uniform rate of evolution. In this Comment, we point out an oversight in Tulsi's paper [Phys. Rev. APLRAAN1050-294710.1103/PhysRevA.80.052328 80, 052328 (2009)] that invalidates its proof. However, the argument can be corrected, and the calculations in Tulsi's paper [Phys. Rev. APLRAAN1050-294710.1103/PhysRevA.80.052328 80, 052328 (2009)] are then sufficient to show that the scheme still works. Nevertheless, subsequent works [Phys. Rev. APLRAAN1050-294710.1103/PhysRevA.82.034304 82, 034304 (2010), Chin. Phys. BCPBHAJ1674-105610.1088/1674-1056/20/4/040309 20, 040309 (2011), Chin. Phys. BCPBHAJ1674-105610.1088/1674-1056/21/1/010306 21, 010306 (2012), AASRI Procedia 1, 5862 (2012), and Quantum Inf. Process.10.1007/s11128-013-0557-1 12, 2689 (2013)] cannot all be recovered in the same way.
Quasi-Adiabatic Quantum Computing Treated with c-Numbers Using the Local-Field Response
NASA Astrophysics Data System (ADS)
Tomaru, Tatsuya
2016-03-01
A computational method called the local-field response method is proposed, where spins evolve by responding to an effective field consisting of gradually decreasing external fields and spin-spin interactions, similarly to what is carried out in adiabatic quantum computing (AQC). This method is partly quantum-mechanical. That is, spins are treated as classical variables, but the response function of the spins to the effective field is determined a priori by referring to a quantum-mechanical calculation that was carried out for similar problems. This novel response function improves the performance of the ground state being maintained in the time evolution compared with the case without a priori information. The performance is numerically checked in an eight-qubit system by solving random-interaction problems of finding their ground states. The false probability decreases by about half as a result of using a priori information. The operation of this method is classical, but it has a quantum-mechanical advantage through a priori information. This method is practically useful because obtaining a complete quantum system is difficult as it stands.
Adiabaticity in open quantum systems
NASA Astrophysics Data System (ADS)
Venuti, Lorenzo Campos; Albash, Tameem; Lidar, Daniel A.; Zanardi, Paolo
2016-03-01
We provide a rigorous generalization of the quantum adiabatic theorem for open systems described by a Markovian master equation with time-dependent Liouvillian L (t ) . We focus on the finite system case relevant for adiabatic quantum computing and quantum annealing. Adiabaticity is defined in terms of closeness to the instantaneous steady state. While the general result is conceptually similar to the closed-system case, there are important differences. Namely, a system initialized in the zero-eigenvalue eigenspace of L (t ) will remain in this eigenspace with a deviation that is inversely proportional to the total evolution time T . In the case of a finite number of level crossings, the scaling becomes T-η with an exponent η that we relate to the rate of the gap closing. For master equations that describe relaxation to thermal equilibrium, we show that the evolution time T should be long compared to the corresponding minimum inverse gap squared of L (t ) . Our results are illustrated with several examples.
Complexity of the Quantum Adiabatic Algorithm
NASA Technical Reports Server (NTRS)
Hen, Itay
2013-01-01
The Quantum Adiabatic Algorithm (QAA) has been proposed as a mechanism for efficiently solving optimization problems on a quantum computer. Since adiabatic computation is analog in nature and does not require the design and use of quantum gates, it can be thought of as a simpler and perhaps more profound method for performing quantum computations that might also be easier to implement experimentally. While these features have generated substantial research in QAA, to date there is still a lack of solid evidence that the algorithm can outperform classical optimization algorithms.
Adiabatic Quantum Simulation of Quantum Chemistry
Babbush, Ryan; Love, Peter J.; Aspuru-Guzik, Alán
2014-01-01
We show how to apply the quantum adiabatic algorithm directly to the quantum computation of molecular properties. We describe a procedure to map electronic structure Hamiltonians to 2-body qubit Hamiltonians with a small set of physically realizable couplings. By combining the Bravyi-Kitaev construction to map fermions to qubits with perturbative gadgets to reduce the Hamiltonian to 2-body, we obtain precision requirements on the coupling strengths and a number of ancilla qubits that scale polynomially in the problem size. Hence our mapping is efficient. The required set of controllable interactions includes only two types of interaction beyond the Ising interactions required to apply the quantum adiabatic algorithm to combinatorial optimization problems. Our mapping may also be of interest to chemists directly as it defines a dictionary from electronic structure to spin Hamiltonians with physical interactions. PMID:25308187
Symmetry-Protected Quantum Adiabatic Transistors
NASA Astrophysics Data System (ADS)
Williamson, Dominic J.; Bartlett, Stephen D.
2014-03-01
An essential development in the history of computing was the invention of the transistor as it allowed logic circuits to be implemented in a robust and modular way. The physical characteristics of semiconductor materials were the key to building these devices. We aim to present an analogous development for quantum computing by showing that quantum adiabatic transistors (as defined by Flammia et al.) are built upon the essential qualities of symmetry-protected (SP) quantum ordered phases in one dimension. Flammia et al. and Renes et al. have demonstrated schemes for universal adiabatic quantum computation using quantum adiabatic transistors described by interacting spin chain models with specifically chosen Hamiltonian terms. We show that these models can be understood as specific examples of the generic situation in which all SP phases lead to quantum computation on encoded edge degrees of freedom by adiabatically traversing a symmetric phase transition into a trivial symmetric phase. This point of view is advantageous as it allows us to readily see that the computational properties of a quantum adiabatic transistor arise from a phase of matter rather than due to carefully tuned interactions.
Anderson localization makes adiabatic quantum optimization fail
Altshuler, Boris; Krovi, Hari; Roland, Jérémie
2010-01-01
Understanding NP-complete problems is a central topic in computer science (NP stands for nondeterministic polynomial time). This is why adiabatic quantum optimization has attracted so much attention, as it provided a new approach to tackle NP-complete problems using a quantum computer. The efficiency of this approach is limited by small spectral gaps between the ground and excited states of the quantum computer’s Hamiltonian. We show that the statistics of the gaps can be analyzed in a novel way, borrowed from the study of quantum disordered systems in statistical mechanics. It turns out that due to a phenomenon similar to Anderson localization, exponentially small gaps appear close to the end of the adiabatic algorithm for large random instances of NP-complete problems. This implies that unfortunately, adiabatic quantum optimization fails: The system gets trapped in one of the numerous local minima. PMID:20616043
NASA Astrophysics Data System (ADS)
Kaminsky, William; Lloyd, Seth
2006-03-01
We argue theoretically that adiabatic quantum computation using only polynomial resources can solve almost all members of a nontrivial randomly generated set of NP-complete problem instances, namely the problem of finding the ground states of spin glasses on 3D cubic lattices having independent, identically Gaussian-distributed couplings. The argument uses the droplet model of quantum spin glasses, particularly its prediction that the paramagnet-spin glass transition is unstable to even infinitesimal longitudinal fields. We then review the ongoing debate as to how well the droplet model describes 3D spin glasses and note that those inclined to view the intractability of NP-complete problems as a guiding physical intuition could take the results presented here as justifying greater suspicion toward the droplet model. Finally, due to this uncertainty as well as uncertainty in regard to the typical case classical complexity of this random NP-complete problem, we outline work using rigorous mean-field methods on a NP-complete problem whose typical-case classical complexity on random instances is better established, namely MAX CLIQUE on random graphs.
An Integrated Development Environment for Adiabatic Quantum Programming
Humble, Travis S; McCaskey, Alex; Bennink, Ryan S; Billings, Jay Jay; D'Azevedo, Eduardo; Sullivan, Blair D; Klymko, Christine F; Seddiqi, Hadayat
2014-01-01
Adiabatic quantum computing is a promising route to the computational power afforded by quantum information processing. The recent availability of adiabatic hardware raises the question of how well quantum programs perform. Benchmarking behavior is challenging since the multiple steps to synthesize an adiabatic quantum program are highly tunable. We present an adiabatic quantum programming environment called JADE that provides control over all the steps taken during program development. JADE captures the workflow needed to rigorously benchmark performance while also allowing a variety of problem types, programming techniques, and processor configurations. We have also integrated JADE with a quantum simulation engine that enables program profiling using numerical calculation. The computational engine supports plug-ins for simulation methodologies tailored to various metrics and computing resources. We present the design, integration, and deployment of JADE and discuss its use for benchmarking adiabatic quantum programs.
Quantum adiabatic algorithm for factorization and its experimental implementation.
Peng, Xinhua; Liao, Zeyang; Xu, Nanyang; Qin, Gan; Zhou, Xianyi; Suter, Dieter; Du, Jiangfeng
2008-11-28
We propose an adiabatic quantum algorithm capable of factorizing numbers, using fewer qubits than Shor's algorithm. We implement the algorithm in a NMR quantum information processor and experimentally factorize the number 21. In the range that our classical computer could simulate, the quantum adiabatic algorithm works well, providing evidence that the running time of this algorithm scales polynomially with the problem size. PMID:19113467
An integrated programming and development environment for adiabatic quantum optimization
NASA Astrophysics Data System (ADS)
Humble, T. S.; McCaskey, A. J.; Bennink, R. S.; Billings, J. J.; DʼAzevedo, E. F.; Sullivan, B. D.; Klymko, C. F.; Seddiqi, H.
2014-01-01
Adiabatic quantum computing is a promising route to the computational power afforded by quantum information processing. The recent availability of adiabatic hardware has raised challenging questions about how to evaluate adiabatic quantum optimization (AQO) programs. Processor behavior depends on multiple steps to synthesize an adiabatic quantum program, which are each highly tunable. We present an integrated programming and development environment for AQO called Jade Adiabatic Development Environment (JADE) that provides control over all the steps taken during program synthesis. JADE captures the workflow needed to rigorously specify the AQO algorithm while allowing a variety of problem types, programming techniques, and processor configurations. We have also integrated JADE with a quantum simulation engine that enables program profiling using numerical calculation. The computational engine supports plug-ins for simulation methodologies tailored to various metrics and computing resources. We present the design, integration, and deployment of JADE and discuss its potential use for benchmarking AQO programs by the quantum computer science community.
NASA Astrophysics Data System (ADS)
Chandra, Rishabh
Partial differential equation-constrained combinatorial optimization (PDECCO) problems are a mixture of continuous and discrete optimization problems. PDECCO problems have discrete controls, but since the partial differential equations (PDE) are continuous, the optimization space is continuous as well. Such problems have several applications, such as gas/water network optimization, traffic optimization, micro-chip cooling optimization, etc. Currently, no efficient classical algorithm which guarantees a global minimum for PDECCO problems exists. A new mapping has been developed that transforms PDECCO problem, which only have linear PDEs as constraints, into quadratic unconstrained binary optimization (QUBO) problems that can be solved using an adiabatic quantum optimizer (AQO). The mapping is efficient, it scales polynomially with the size of the PDECCO problem, requires only one PDE solve to form the QUBO problem, and if the QUBO problem is solved correctly and efficiently on an AQO, guarantees a global optimal solution for the original PDECCO problem.
Generalized Ramsey numbers through adiabatic quantum optimization
NASA Astrophysics Data System (ADS)
Ranjbar, Mani; Macready, William G.; Clark, Lane; Gaitan, Frank
2016-06-01
Ramsey theory is an active research area in combinatorics whose central theme is the emergence of order in large disordered structures, with Ramsey numbers marking the threshold at which this order first appears. For generalized Ramsey numbers r(G, H), the emergent order is characterized by graphs G and H. In this paper we: (i) present a quantum algorithm for computing generalized Ramsey numbers by reformulating the computation as a combinatorial optimization problem which is solved using adiabatic quantum optimization; and (ii) determine the Ramsey numbers r({{T}}m,{{T}}n) for trees of order m,n = 6,7,8 , most of which were previously unknown.
Quantum gates with controlled adiabatic evolutions
NASA Astrophysics Data System (ADS)
Hen, Itay
2015-02-01
We introduce a class of quantum adiabatic evolutions that we claim may be interpreted as the equivalents of the unitary gates of the quantum gate model. We argue that these gates form a universal set and may therefore be used as building blocks in the construction of arbitrary "adiabatic circuits," analogously to the manner in which gates are used in the circuit model. One implication of the above construction is that arbitrary classical boolean circuits as well as gate model circuits may be directly translated to adiabatic algorithms with no additional resources or complexities. We show that while these adiabatic algorithms fail to exhibit certain aspects of the inherent fault tolerance of traditional quantum adiabatic algorithms, they may have certain other experimental advantages acting as quantum gates.
Adiabatic Quantum Programming: Minor Embedding With Hard Faults
Klymko, Christine F; Sullivan, Blair D; Humble, Travis S
2013-01-01
Adiabatic quantum programming defines the time-dependent mapping of a quantum algorithm into the hardware or logical fabric. An essential programming step is the embedding of problem-specific information into the logical fabric to define the quantum computational transformation. We present algorithms for embedding arbitrary instances of the adiabatic quantum optimization algorithm into a square lattice of specialized unit cells. Our methods are shown to be extensible in fabric growth, linear in time, and quadratic in logical footprint. In addition, we provide methods for accommodating hard faults in the logical fabric without invoking approximations to the original problem. These hard fault-tolerant embedding algorithms are expected to prove useful for benchmarking the adiabatic quantum optimization algorithm on existing quantum logical hardware. We illustrate this versatility through numerical studies of embeddabilty versus hard fault rates in square lattices of complete bipartite unit cells.
Geometric Adiabatic Transport in Quantum Hall States
NASA Astrophysics Data System (ADS)
Klevtsov, S.; Wiegmann, P.
2015-08-01
We argue that in addition to the Hall conductance and the nondissipative component of the viscous tensor, there exists a third independent transport coefficient, which is precisely quantized. It takes constant values along quantum Hall plateaus. We show that the new coefficient is the Chern number of a vector bundle over moduli space of surfaces of genus 2 or higher and therefore cannot change continuously along the plateau. As such, it does not transpire on a sphere or a torus. In the linear response theory, this coefficient determines intensive forces exerted on electronic fluid by adiabatic deformations of geometry and represents the effect of the gravitational anomaly. We also present the method of computing the transport coefficients for quantum Hall states.
Geometric Adiabatic Transport in Quantum Hall States.
Klevtsov, S; Wiegmann, P
2015-08-21
We argue that in addition to the Hall conductance and the nondissipative component of the viscous tensor, there exists a third independent transport coefficient, which is precisely quantized. It takes constant values along quantum Hall plateaus. We show that the new coefficient is the Chern number of a vector bundle over moduli space of surfaces of genus 2 or higher and therefore cannot change continuously along the plateau. As such, it does not transpire on a sphere or a torus. In the linear response theory, this coefficient determines intensive forces exerted on electronic fluid by adiabatic deformations of geometry and represents the effect of the gravitational anomaly. We also present the method of computing the transport coefficients for quantum Hall states. PMID:26340197
Quantum Monte Carlo simulations of tunneling in quantum adiabatic optimization
NASA Astrophysics Data System (ADS)
Brady, Lucas T.; van Dam, Wim
2016-03-01
We explore to what extent path-integral quantum Monte Carlo methods can efficiently simulate quantum adiabatic optimization algorithms during a quantum tunneling process. Specifically we look at symmetric cost functions defined over n bits with a single potential barrier that a successful quantum adiabatic optimization algorithm will have to tunnel through. The height and width of this barrier depend on n , and by tuning these dependencies, we can make the optimization algorithm succeed or fail in polynomial time. In this article we compare the strength of quantum adiabatic tunneling with that of path-integral quantum Monte Carlo methods. We find numerical evidence that quantum Monte Carlo algorithms will succeed in the same regimes where quantum adiabatic optimization succeeds.
General conditions for quantum adiabatic evolution
Comparat, Daniel
2009-07-15
Adiabaticity occurs when, during its evolution, a physical system remains in the instantaneous eigenstate of the Hamiltonian. Unfortunately, existing results, such as the quantum adiabatic theorem based on a slow down evolution [H({epsilon}t),{epsilon}{yields}0], are insufficient to describe an evolution driven by the Hamiltonian H(t) itself. Here we derive general criteria and exact bounds, for the state and its phase, ensuring an adiabatic evolution for any Hamiltonian H(t). As a corollary, we demonstrate that the commonly used condition of a slow Hamiltonian variation rate, compared to the spectral gap, is indeed sufficient to ensure adiabaticity but only when the Hamiltonian is real and nonoscillating (for instance, containing exponential or polynomial but no sinusoidal functions)
Adiabatic Quantum Optimization for Associative Memory Recall
NASA Astrophysics Data System (ADS)
Seddiqi, Hadayat; Humble, Travis
2014-12-01
Hopfield networks are a variant of associative memory that recall patterns stored in the couplings of an Ising model. Stored memories are conventionally accessed as fixed points in the network dynamics that correspond to energetic minima of the spin state. We show that memories stored in a Hopfield network may also be recalled by energy minimization using adiabatic quantum optimization (AQO). Numerical simulations of the underlying quantum dynamics allow us to quantify AQO recall accuracy with respect to the number of stored memories and noise in the input key. We investigate AQO performance with respect to how memories are stored in the Ising model according to different learning rules. Our results demonstrate that AQO recall accuracy varies strongly with learning rule, a behavior that is attributed to differences in energy landscapes. Consequently, learning rules offer a family of methods for programming adiabatic quantum optimization that we expect to be useful for characterizing AQO performance.
Adiabatic quantum optimization for associative memory recall
Seddiqi, Hadayat; Humble, Travis S.
2014-12-22
Hopfield networks are a variant of associative memory that recall patterns stored in the couplings of an Ising model. Stored memories are conventionally accessed as fixed points in the network dynamics that correspond to energetic minima of the spin state. We show that memories stored in a Hopfield network may also be recalled by energy minimization using adiabatic quantum optimization (AQO). Numerical simulations of the underlying quantum dynamics allow us to quantify AQO recall accuracy with respect to the number of stored memories and noise in the input key. We investigate AQO performance with respect to how memories are storedmore » in the Ising model according to different learning rules. Our results demonstrate that AQO recall accuracy varies strongly with learning rule, a behavior that is attributed to differences in energy landscapes. Consequently, learning rules offer a family of methods for programming adiabatic quantum optimization that we expect to be useful for characterizing AQO performance.« less
Adiabatic quantum optimization for associative memory recall
Seddiqi, Hadayat; Humble, Travis S.
2014-12-22
Hopfield networks are a variant of associative memory that recall patterns stored in the couplings of an Ising model. Stored memories are conventionally accessed as fixed points in the network dynamics that correspond to energetic minima of the spin state. We show that memories stored in a Hopfield network may also be recalled by energy minimization using adiabatic quantum optimization (AQO). Numerical simulations of the underlying quantum dynamics allow us to quantify AQO recall accuracy with respect to the number of stored memories and noise in the input key. We investigate AQO performance with respect to how memories are stored in the Ising model according to different learning rules. Our results demonstrate that AQO recall accuracy varies strongly with learning rule, a behavior that is attributed to differences in energy landscapes. Consequently, learning rules offer a family of methods for programming adiabatic quantum optimization that we expect to be useful for characterizing AQO performance.
Non-adiabatic effect on quantum pumping
NASA Astrophysics Data System (ADS)
Uchiyama, Chikako
2014-03-01
We study quantum pumping for an anharmonic junction model which interacts with two kinds of bosonic environments. We provide an expression for the quantum pumping under a piecewise modulation of environmental temperatures with including non-adiabatic effect under Markovian approximation. The obtained formula is an extension of the one expressed with the geometrical phase(Phys. Rev. Lett. 104,170601 (2010)). This extension shows that the quantum pumping depends on the initial condition of the anharmonic junction just before the modulation, as well as the characteristic environmental parameters such as interaction strength and cut-off frequencies of spectral density other than the conditions of modulation. We clarify that the pumping current including non-adiabatic effect can be larger than that under the adiabatic condition. This means that we can find the optimal condition of the current by adjusting these parameters. (The article has been submitted as http://arxiv.org/submit/848201 and will be appeared soon.) This work is supported by a Grant-in-Aid for Scientific Research (B) (KAKENHI 25287098).
Symmetry-protected adiabatic quantum transistors
NASA Astrophysics Data System (ADS)
Williamson, Dominic J.; Bartlett, Stephen D.
2015-05-01
Adiabatic quantum transistors (AQT) allow quantum logic gates to be performed by applying a large field to a quantum many-body system prepared in its ground state, without the need for local control. The basic operation of such a device can be viewed as driving a spin chain from a symmetry-protected (SP) phase to a trivial phase. This perspective offers an avenue to generalize the AQT and to design several improvements. The performance of quantum logic gates is shown to depend only on universal symmetry properties of a SP phase rather than any fine tuning of the Hamiltonian, and it is possible to implement a universal set of logic gates in this way by combining several different types of SP matter. Such SP AQTs are argued to be robust to a range of relevant noise processes.
Dynamics of Quantum Adiabatic Evolution Algorithm for Number Partitioning
NASA Technical Reports Server (NTRS)
Smelyanskiy, V. N.; Toussaint, U. V.; Timucin, D. A.
2002-01-01
We have developed a general technique to study the dynamics of the quantum adiabatic evolution algorithm applied to random combinatorial optimization problems in the asymptotic limit of large problem size n. We use as an example the NP-complete Number Partitioning problem and map the algorithm dynamics to that of an auxiliary quantum spin glass system with the slowly varying Hamiltonian. We use a Green function method to obtain the adiabatic eigenstates and the minimum excitation gap. g min, = O(n 2(exp -n/2), corresponding to the exponential complexity of the algorithm for Number Partitioning. The key element of the analysis is the conditional energy distribution computed for the set of all spin configurations generated from a given (ancestor) configuration by simultaneous flipping of a fixed number of spins. For the problem in question this distribution is shown to depend on the ancestor spin configuration only via a certain parameter related to 'the energy of the configuration. As the result, the algorithm dynamics can be described in terms of one-dimensional quantum diffusion in the energy space. This effect provides a general limitation of a quantum adiabatic computation in random optimization problems. Analytical results are in agreement with the numerical simulation of the algorithm.
Dynamics of Quantum Adiabatic Evolution Algorithm for Number Partitioning
NASA Technical Reports Server (NTRS)
Smelyanskiy, Vadius; vonToussaint, Udo V.; Timucin, Dogan A.; Clancy, Daniel (Technical Monitor)
2002-01-01
We have developed a general technique to study the dynamics of the quantum adiabatic evolution algorithm applied to random combinatorial optimization problems in the asymptotic limit of large problem size n. We use as an example the NP-complete Number Partitioning problem and map the algorithm dynamics to that of an auxiliary quantum spin glass system with the slowly varying Hamiltonian. We use a Green function method to obtain the adiabatic eigenstates and the minimum exitation gap, gmin = O(n2(sup -n/2)), corresponding to the exponential complexity of the algorithm for Number Partitioning. The key element of the analysis is the conditional energy distribution computed for the set of all spin configurations generated from a given (ancestor) configuration by simultaneous flipping of a fixed number of spins. For the problem in question this distribution is shown to depend on the ancestor spin configuration only via a certain parameter related to the energy of the configuration. As the result, the algorithm dynamics can be described in terms of one-dimensional quantum diffusion in the energy space. This effect provides a general limitation of a quantum adiabatic computation in random optimization problems. Analytical results are in agreement with the numerical simulation of the algorithm.
Quantum adiabatic evolution with energy degeneracy levels
NASA Astrophysics Data System (ADS)
Zhang, Qi
2016-01-01
A classical-kind phase-space formalism is developed to address the tiny intrinsic dynamical deviation from what is predicted by Wilczek-Zee theorem during quantum adiabatic evolution on degeneracy levels. In this formalism, the Hilbert space and the aggregate of degenerate eigenstates become the classical-kind phase space and a high-dimensional subspace in the phase space, respectively. Compared with the previous analogous study by a different method, the current result is qualitatively different in that the first-order deviation derived here is always perpendicular to the degeneracy subspace. A tripod-scheme Hamiltonian with two degenerate dark states is employed to illustrate the adiabatic deviation with degeneracy levels.
Quantum Adiabatic Pumping by Modulating Tunnel Phase in Quantum Dots
NASA Astrophysics Data System (ADS)
Taguchi, Masahiko; Nakajima, Satoshi; Kubo, Toshihiro; Tokura, Yasuhiro
2016-08-01
In a mesoscopic system, under zero bias voltage, a finite charge is transferred by quantum adiabatic pumping by adiabatically and periodically changing two or more control parameters. We obtained expressions for the pumped charge for a ring of three quantum dots (QDs) by choosing the magnetic flux penetrating the ring as one of the control parameters. We found that the pumped charge shows a steplike behavior with respect to the variance of the flux. The value of the step heights is not universal but depends on the trajectory of the control parameters. We discuss the physical origin of this behavior on the basis of the Fano resonant condition of the ring.
Adiabatic Quantum Algorithm for Search Engine Ranking
NASA Astrophysics Data System (ADS)
Garnerone, Silvano; Zanardi, Paolo; Lidar, Daniel A.
2012-06-01
We propose an adiabatic quantum algorithm for generating a quantum pure state encoding of the PageRank vector, the most widely used tool in ranking the relative importance of internet pages. We present extensive numerical simulations which provide evidence that this algorithm can prepare the quantum PageRank state in a time which, on average, scales polylogarithmically in the number of web pages. We argue that the main topological feature of the underlying web graph allowing for such a scaling is the out-degree distribution. The top-ranked log(n) entries of the quantum PageRank state can then be estimated with a polynomial quantum speed-up. Moreover, the quantum PageRank state can be used in “q-sampling” protocols for testing properties of distributions, which require exponentially fewer measurements than all classical schemes designed for the same task. This can be used to decide whether to run a classical update of the PageRank.
Quantum Adiabatic Algorithms and Large Spin Tunnelling
NASA Technical Reports Server (NTRS)
Boulatov, A.; Smelyanskiy, V. N.
2003-01-01
We provide a theoretical study of the quantum adiabatic evolution algorithm with different evolution paths proposed in this paper. The algorithm is applied to a random binary optimization problem (a version of the 3-Satisfiability problem) where the n-bit cost function is symmetric with respect to the permutation of individual bits. The evolution paths are produced, using the generic control Hamiltonians H (r) that preserve the bit symmetry of the underlying optimization problem. In the case where the ground state of H(0) coincides with the totally-symmetric state of an n-qubit system the algorithm dynamics is completely described in terms of the motion of a spin-n/2. We show that different control Hamiltonians can be parameterized by a set of independent parameters that are expansion coefficients of H (r) in a certain universal set of operators. Only one of these operators can be responsible for avoiding the tunnelling in the spin-n/2 system during the quantum adiabatic algorithm. We show that it is possible to select a coefficient for this operator that guarantees a polynomial complexity of the algorithm for all problem instances. We show that a successful evolution path of the algorithm always corresponds to the trajectory of a classical spin-n/2 and provide a complete characterization of such paths.
Quantum Adiabatic Optimization and Combinatorial Landscapes
NASA Technical Reports Server (NTRS)
Smelyanskiy, V. N.; Knysh, S.; Morris, R. D.
2003-01-01
In this paper we analyze the performance of the Quantum Adiabatic Evolution (QAE) algorithm on a variant of Satisfiability problem for an ensemble of random graphs parametrized by the ratio of clauses to variables, gamma = M / N. We introduce a set of macroscopic parameters (landscapes) and put forward an ansatz of universality for random bit flips. We then formulate the problem of finding the smallest eigenvalue and the excitation gap as a statistical mechanics problem. We use the so-called annealing approximation with a refinement that a finite set of macroscopic variables (verses only energy) is used, and are able to show the existence of a dynamic threshold gamma = gammad, beyond which QAE should take an exponentially long time to find a solution. We compare the results for extended and simplified sets of landscapes and provide numerical evidence in support of our universality ansatz.
Differential topology of adiabatically controlled quantum processes
NASA Astrophysics Data System (ADS)
Jonckheere, Edmond A.; Rezakhani, Ali T.; Ahmad, Farooq
2013-03-01
It is shown that in a controlled adiabatic homotopy between two Hamiltonians, H 0 and H 1, the gap or "anti-crossing" phenomenon can be viewed as the development of cusps and swallow tails in the region of the complex plane where two critical value curves of the quadratic map associated with the numerical range of H 0 + i H 1 come close. The "near crossing" in the energy level plots happens to be a generic situation, in the sense that a crossing is a manifestation of the quadratic numerical range map being unstable in the sense of differential topology. The stable singularities that can develop are identified and it is shown that they could occur near the gap, making those singularities of paramount importance. Various applications, including the quantum random walk, are provided to illustrate this theory.
On the Role of Prior Probability in Adiabatic Quantum Algorithms
NASA Astrophysics Data System (ADS)
Sun, Jie; Lu, Songfeng; Yang, Liping
2016-03-01
In this paper, we study the role of prior probability on the efficiency of quantum local adiabatic search algorithm. The following aspects for prior probability are found here: firstly, only the probabilities of marked states affect the running time of the adiabatic evolution; secondly, the prior probability can be used for improving the efficiency of the adiabatic algorithm; thirdly, like the usual quantum adiabatic evolution, the running time for the case of multiple solution states where the number of marked elements are smaller enough than the size of the set assigned that contains them can be significantly bigger than that of the case where the assigned set only contains all the marked states.
Computer Code For Turbocompounded Adiabatic Diesel Engine
NASA Technical Reports Server (NTRS)
Assanis, D. N.; Heywood, J. B.
1988-01-01
Computer simulation developed to study advantages of increased exhaust enthalpy in adiabatic turbocompounded diesel engine. Subsytems of conceptual engine include compressor, reciprocator, turbocharger turbine, compounded turbine, ducting, and heat exchangers. Focus of simulation of total system is to define transfers of mass and energy, including release and transfer of heat and transfer of work in each subsystem, and relationship among subsystems. Written in FORTRAN IV.
NASA Astrophysics Data System (ADS)
Steffen, Matthias
2013-03-01
Quantum mechanics plays a crucial role in many day-to-day products, and has been successfully used to explain a wide variety of observations in Physics. While some quantum effects such as tunneling limit the degree to which modern CMOS devices can be scaled to ever reducing dimensions, others may potentially be exploited to build an entirely new computing architecture: The quantum computer. In this talk I will review several basic concepts of a quantum computer. Why quantum computing and how do we do it? What is the status of several (but not all) approaches towards building a quantum computer, including IBM's approach using superconducting qubits? And what will it take to build a functional machine? The promise is that a quantum computer could solve certain interesting computational problems such as factoring using exponentially fewer computational steps than classical systems. Although the most sophisticated modern quantum computing experiments to date do not outperform simple classical computations, it is increasingly becoming clear that small scale demonstrations with as many as 100 qubits are beginning to be within reach over the next several years. Such a demonstration would undoubtedly be a thrilling feat, and usher in a new era of controllably testing quantum mechanics or quantum computing aspects. At the minimum, future demonstrations will shed much light on what lies ahead.
Communication: Adiabatic and non-adiabatic electron-nuclear motion: Quantum and classical dynamics
NASA Astrophysics Data System (ADS)
Albert, Julian; Kaiser, Dustin; Engel, Volker
2016-05-01
Using a model for coupled electronic-nuclear motion we investigate the range from negligible to strong non-adiabatic coupling. In the adiabatic case, the quantum dynamics proceeds in a single electronic state, whereas for strong coupling a complete transition between two adiabatic electronic states takes place. It is shown that in all coupling regimes the short-time wave-packet dynamics can be described using ensembles of classical trajectories in the phase space spanned by electronic and nuclear degrees of freedom. We thus provide an example which documents that the quantum concept of non-adiabatic transitions is not necessarily needed if electronic and nuclear motion is treated on the same footing.
Acceleration of adiabatic quantum dynamics in electromagnetic fields
Masuda, Shumpei; Nakamura, Katsuhiro
2011-10-15
We show a method to accelerate quantum adiabatic dynamics of wave functions under electromagnetic field (EMF) by developing the preceding theory [Masuda and Nakamura, Proc. R. Soc. London Ser. A 466, 1135 (2010)]. Treating the orbital dynamics of a charged particle in EMF, we derive the driving field which accelerates quantum adiabatic dynamics in order to obtain the final adiabatic states in any desired short time. The scheme is consolidated by describing a way to overcome possible singularities in both the additional phase and driving potential due to nodes proper to wave functions under EMF. As explicit examples, we exhibit the fast forward of adiabatic squeezing and transport of excited Landau states with nonzero angular momentum, obtaining the result consistent with the transitionless quantum driving applied to the orbital dynamics in EMF.
Superadiabatic Controlled Evolutions and Universal Quantum Computation
Santos, Alan C.; Sarandy, Marcelo S.
2015-01-01
Adiabatic state engineering is a powerful technique in quantum information and quantum control. However, its performance is limited by the adiabatic theorem of quantum mechanics. In this scenario, shortcuts to adiabaticity, such as provided by the superadiabatic theory, constitute a valuable tool to speed up the adiabatic quantum behavior. Here, we propose a superadiabatic route to implement universal quantum computation. Our method is based on the realization of piecewise controlled superadiabatic evolutions. Remarkably, they can be obtained by simple time-independent counter-diabatic Hamiltonians. In particular, we discuss the implementation of fast rotation gates and arbitrary n-qubit controlled gates, which can be used to design different sets of universal quantum gates. Concerning the energy cost of the superadiabatic implementation, we show that it is dictated by the quantum speed limit, providing an upper bound for the corresponding adiabatic counterparts. PMID:26511064
Superadiabatic Controlled Evolutions and Universal Quantum Computation
NASA Astrophysics Data System (ADS)
Santos, Alan C.; Sarandy, Marcelo S.
2015-10-01
Adiabatic state engineering is a powerful technique in quantum information and quantum control. However, its performance is limited by the adiabatic theorem of quantum mechanics. In this scenario, shortcuts to adiabaticity, such as provided by the superadiabatic theory, constitute a valuable tool to speed up the adiabatic quantum behavior. Here, we propose a superadiabatic route to implement universal quantum computation. Our method is based on the realization of piecewise controlled superadiabatic evolutions. Remarkably, they can be obtained by simple time-independent counter-diabatic Hamiltonians. In particular, we discuss the implementation of fast rotation gates and arbitrary n-qubit controlled gates, which can be used to design different sets of universal quantum gates. Concerning the energy cost of the superadiabatic implementation, we show that it is dictated by the quantum speed limit, providing an upper bound for the corresponding adiabatic counterparts.
Adiabatic quantum programming: minor embedding with hard faults
NASA Astrophysics Data System (ADS)
Klymko, Christine; Sullivan, Blair D.; Humble, Travis S.
2013-11-01
Adiabatic quantum programming defines the time-dependent mapping of a quantum algorithm into an underlying hardware or logical fabric. An essential step is embedding problem-specific information into the quantum logical fabric. We present algorithms for embedding arbitrary instances of the adiabatic quantum optimization algorithm into a square lattice of specialized unit cells. These methods extend with fabric growth while scaling linearly in time and quadratically in footprint. We also provide methods for handling hard faults in the logical fabric without invoking approximations to the original problem and illustrate their versatility through numerical studies of embeddability versus fault rates in square lattices of complete bipartite unit cells. The studies show that these algorithms are more resilient to faulty fabrics than naive embedding approaches, a feature which should prove useful in benchmarking the adiabatic quantum optimization algorithm on existing faulty hardware.
Quantum Computation and Quantum Information
NASA Astrophysics Data System (ADS)
Nielsen, Michael A.; Chuang, Isaac L.
2010-12-01
Part I. Fundamental Concepts: 1. Introduction and overview; 2. Introduction to quantum mechanics; 3. Introduction to computer science; Part II. Quantum Computation: 4. Quantum circuits; 5. The quantum Fourier transform and its application; 6. Quantum search algorithms; 7. Quantum computers: physical realization; Part III. Quantum Information: 8. Quantum noise and quantum operations; 9. Distance measures for quantum information; 10. Quantum error-correction; 11. Entropy and information; 12. Quantum information theory; Appendices; References; Index.
Geometric Phase for Adiabatic Evolutions of General Quantum States
Wu, Biao; Liu, Jie; Niu, Qian; Singh, David J
2005-01-01
The concept of a geometric phase (Berry's phase) is generalized to the case of noneigenstates, which is applicable to both linear and nonlinear quantum systems. This is particularly important to nonlinear quantum systems, where, due to the lack of the superposition principle, the adiabatic evolution of a general state cannot be described in terms of eigenstates. For linear quantum systems, our new geometric phase reduces to a statistical average of Berry's phases. Our results are demonstrated with a nonlinear two-level model.
Adiabatic Quantization of Andreev Quantum Billiard Levels
NASA Astrophysics Data System (ADS)
Silvestrov, P. G.; Goorden, M. C.; Beenakker, C. W.
2003-03-01
We identify the time T between Andreev reflections as a classical adiabatic invariant in a ballistic chaotic cavity (Lyapunov exponent λ), coupled to a superconductor by an N-mode constriction. Quantization of the adiabatically invariant torus in phase space gives a discrete set of periods Tn, which in turn generate a ladder of excited states ɛnm=(m+1/2)πℏ/Tn. The largest quantized period is the Ehrenfest time T0=λ-1ln(N. Projection of the invariant torus onto the coordinate plane shows that the wave functions inside the cavity are squeezed to a transverse dimension W/(N), much below the width W of the constriction.
Adiabatic condition and the quantum hitting time of Markov chains
Krovi, Hari; Ozols, Maris; Roland, Jeremie
2010-08-15
We present an adiabatic quantum algorithm for the abstract problem of searching marked vertices in a graph, or spatial search. Given a random walk (or Markov chain) P on a graph with a set of unknown marked vertices, one can define a related absorbing walk P{sup '} where outgoing transitions from marked vertices are replaced by self-loops. We build a Hamiltonian H(s) from the interpolated Markov chain P(s)=(1-s)P+sP{sup '} and use it in an adiabatic quantum algorithm to drive an initial superposition over all vertices to a superposition over marked vertices. The adiabatic condition implies that, for any reversible Markov chain and any set of marked vertices, the running time of the adiabatic algorithm is given by the square root of the classical hitting time. This algorithm therefore demonstrates a novel connection between the adiabatic condition and the classical notion of hitting time of a random walk. It also significantly extends the scope of previous quantum algorithms for this problem, which could only obtain a full quadratic speedup for state-transitive reversible Markov chains with a unique marked vertex.
NASA Astrophysics Data System (ADS)
Ekert, Artur
1994-08-01
As computers become faster they must become smaller because of the finiteness of the speed of light. The history of computer technology has involved a sequence of changes from one type of physical realisation to another - from gears to relays to valves to transistors to integrated circuits and so on. Quantum mechanics is already important in the design of microelectronic components. Soon it will be necessary to harness quantum mechanics rather than simply take it into account, and at that point it will be possible to give data processing devices new functionality.
NASA Astrophysics Data System (ADS)
Mandrà, Salvatore; Guerreschi, Gian Giacomo; Aspuru-Guzik, Alán
2015-12-01
Adiabatic quantum optimization is a procedure to solve a vast class of optimization problems by slowly changing the Hamiltonian of a quantum system. The evolution time necessary for the algorithm to be successful scales inversely with the minimum energy gap encountered during the dynamics. Unfortunately, the direct calculation of the gap is strongly limited by the exponential growth in the dimensionality of the Hilbert space associated to the quantum system. Although many special-purpose methods have been devised to reduce the effective dimensionality, they are strongly limited to particular classes of problems with evident symmetries. Moreover, little is known about the computational power of adiabatic quantum optimizers in real-world conditions. Here we propose and implement a general purposes reduction method that does not rely on any explicit symmetry and which requires, under certain general conditions, only a polynomial amount of classical resources. Thanks to this method, we are able to analyze the performance of "nonideal" quantum adiabatic optimizers to solve the well-known Grover problem, namely the search of target entries in an unsorted database, in the presence of discrete local defects. In this case, we show that adiabatic quantum optimization, even if affected by random noise, is still potentially faster than any classical algorithm.
Non-adiabatic molecular dynamics with complex quantum trajectories. II. The adiabatic representation
NASA Astrophysics Data System (ADS)
Zamstein, Noa; Tannor, David J.
2012-12-01
We present a complex quantum trajectory method for treating non-adiabatic dynamics. Each trajectory evolves classically on a single electronic surface but with complex position and momentum. The equations of motion are derived directly from the time-dependent Schrödinger equation, and the population exchange arises naturally from amplitude-transfer terms. In this paper the equations of motion are derived in the adiabatic representation to complement our work in the diabatic representation [N. Zamstein and D. J. Tannor, J. Chem. Phys. 137, 22A517 (2012)], 10.1063/1.4739845. We apply our method to two benchmark models introduced by John Tully [J. Chem. Phys. 93, 1061 (1990)], 10.1063/1.459170, and get very good agreement with converged quantum-mechanical calculations. Specifically, we show that decoherence (spatial separation of wavepackets on different surfaces) is already contained in the equations of motion and does not require ad hoc augmentation.
Non-adiabatic molecular dynamics with complex quantum trajectories. II. The adiabatic representation
Zamstein, Noa; Tannor, David J.
2012-12-14
We present a complex quantum trajectory method for treating non-adiabatic dynamics. Each trajectory evolves classically on a single electronic surface but with complex position and momentum. The equations of motion are derived directly from the time-dependent Schroedinger equation, and the population exchange arises naturally from amplitude-transfer terms. In this paper the equations of motion are derived in the adiabatic representation to complement our work in the diabatic representation [N. Zamstein and D. J. Tannor, J. Chem. Phys. 137, 22A517 (2012)]. We apply our method to two benchmark models introduced by John Tully [J. Chem. Phys. 93, 1061 (1990)], and get very good agreement with converged quantum-mechanical calculations. Specifically, we show that decoherence (spatial separation of wavepackets on different surfaces) is already contained in the equations of motion and does not require ad hoc augmentation.
Nonadiabatic quantum Liouville and master equations in the adiabatic basis
Jang, Seogjoo
2012-12-14
A compact form of nonadiabatic molecular Hamiltonian in the basis of adiabatic electronic states and nuclear position states is presented. The Hamiltonian, which includes both the first and the second derivative couplings, is Hermitian and thus leads to a standard expression for the quantum Liouville equation for the density operator. With the application of a projection operator technique, a quantum master equation for the diagonal components of the density operator is derived. Under the assumption that nuclear states are much more short ranged compared to electronic states and assuming no singularity, a semi-adiabatic approximation is invoked, which results in expressions for the nonadiabatic molecular Hamiltonian and the quantum Liouville equation that are much more amenable to advanced quantum dynamics calculation. The semi-adiabatic approximation is also applied to a resonance energy transfer system consisting of a donor and an acceptor interacting via Coulomb terms, and explicit detailed expressions for exciton-bath Hamiltonian including all the non-adiabatic terms are derived.
Fluctuations of work in nearly adiabatically driven open quantum systems.
Suomela, S; Salmilehto, J; Savenko, I G; Ala-Nissila, T; Möttönen, M
2015-02-01
We extend the quantum jump method to nearly adiabatically driven open quantum systems in a way that allows for an accurate account of the external driving in the system-environment interaction. Using this framework, we construct the corresponding trajectory-dependent work performed on the system and derive the integral fluctuation theorem and the Jarzynski equality for nearly adiabatic driving. We show that such identities hold as long as the stochastic dynamics and work variable are consistently defined. We numerically study the emerging work statistics for a two-level quantum system and find that the conventional diabatic approximation is unable to capture some prominent features arising from driving, such as the continuity of the probability density of work. Our results reveal the necessity of using accurate expressions for the drive-dressed heat exchange in future experiments probing jump time distributions. PMID:25768477
Quantum state engineering with flux-biased Josephson phase qubits by rapid adiabatic passages
Nie, W.; Huang, J. S.; Shi, X.; Wei, L. F.
2010-09-15
In this article, the scheme of quantum computing based on the Stark-chirped rapid adiabatic passage (SCRAP) technique [L. F. Wei, J. R. Johansson, L. X. Cen, S. Ashhab, and F. Nori, Phys. Rev. Lett. 100, 113601 (2008)] is extensively applied to implement quantum state manipulations in flux-biased Josephson phase qubits. The broken-parity symmetries of bound states in flux-biased Josephson junctions are utilized to conveniently generate the desirable Stark shifts. Then, assisted by various transition pulses, universal quantum logic gates as well as arbitrary quantum state preparations can be implemented. Compared with the usual {pi}-pulse operations widely used in experiments, the adiabatic population passages proposed here are insensitive to the details of the applied pulses and thus the desirable population transfers can be satisfyingly implemented. The experimental feasibility of the proposal is also discussed.
Using the J1-J2 quantum spin chain as an adiabatic quantum data bus
NASA Astrophysics Data System (ADS)
Chancellor, Nicholas; Haas, Stephan
2012-09-01
This paper investigates numerically a phenomenon which can be used to transport a single q-bit down a J1-J2 Heisenberg spin chain using a quantum adiabatic process. The motivation for investigating such processes comes from the idea that this method of transport could potentially be used as a means of sending data to various parts of a quantum computer made of artificial spins, and that this method could take advantage of the easily prepared ground state at the so-called Majumdar-Ghosh point. We examine several annealing protocols for this process and find similar results for all of them. The annealing process works well up to a critical frustration threshold. There is also a brief section examining what other models this protocol could be used for, examining its use in the XXZ and XYZ models.
Quantum corrections during inflation and conservation of adiabatic perturbations
Campo, David
2010-02-15
The possibility that quantum corrections break the conservation of superhorizon adiabatic perturbations in single field inflation is examined. I consider the lowest order corrections from massless matter fields in the Hamiltonian formalism. Particular emphasis is therefore laid on the renormalization. The counterterms are the same as in the Lagrangian formalism. The renormalized value of the tadpole is zero. I find a possible secular dependence of the power spectrum at one loop due to the trace anomaly, but this result depends on the approximation of the modes and is inconclusive. The symmetry (not) violated by the quantum corrections is the invariance by dilatation. Perspectives on the backreaction problem are briefly discussed.
More bang for your buck: Super-adiabatic quantum engines
Campo, A. del; Goold, J.; Paternostro, M.
2014-01-01
The practical untenability of the quasi-static assumption makes any realistic engine intrinsically irreversible and its operating time finite, thus implying friction effects at short cycle times. An important technological goal is thus the design of maximally efficient engines working at the maximum possible power. We show that, by utilising shortcuts to adiabaticity in a quantum engine cycle, one can engineer a thermodynamic cycle working at finite power and zero friction. Our findings are illustrated using a harmonic oscillator undergoing a quantum Otto cycle. PMID:25163421
More bang for your buck: super-adiabatic quantum engines.
del Campo, A; Goold, J; Paternostro, M
2014-01-01
The practical untenability of the quasi-static assumption makes any realistic engine intrinsically irreversible and its operating time finite, thus implying friction effects at short cycle times. An important technological goal is thus the design of maximally efficient engines working at the maximum possible power. We show that, by utilising shortcuts to adiabaticity in a quantum engine cycle, one can engineer a thermodynamic cycle working at finite power and zero friction. Our findings are illustrated using a harmonic oscillator undergoing a quantum Otto cycle. PMID:25163421
Local shortcut to adiabaticity for quantum many-body systems
NASA Astrophysics Data System (ADS)
Mukherjee, Victor; Montangero, Simone; Fazio, Rosario
2016-06-01
We study the environmentally assisted local transitionless dynamics in closed spin systems driven through quantum critical points. In general the shortcut to adaiabaticity (STA) in quantum critical systems requires highly nonlocal control Hamiltonians. In this work we develop an approach to achieve local shortcuts to adiabaticity (LSTA) in spin chains, using local control fields which scale polynomially with the system size, following universal critical exponents. We relate the control fields to reduced fidelity susceptibility and use the transverse Ising model in one dimension to exemplify our generic results. We also extend our analysis to achieve LSTA in central spin models.
Random matrix approach to quantum adiabatic evolution algorithms
Boulatov, A.; Smelyanskiy, V.N.
2005-05-15
We analyze the power of the quantum adiabatic evolution algorithm (QAA) for solving random computationally hard optimization problems within a theoretical framework based on random matrix theory (RMT). We present two types of driven RMT models. In the first model, the driving Hamiltonian is represented by Brownian motion in the matrix space. We use the Brownian motion model to obtain a description of multiple avoided crossing phenomena. We show that nonadiabatic corrections in the QAA are due to the interaction of the ground state with the 'cloud' formed by most of the excited states, confirming that in driven RMT models, the Landau-Zener scenario of pairwise level repulsions is not relevant for the description of nonadiabatic corrections. We show that the QAA has a finite probability of success in a certain range of parameters, implying a polynomial complexity of the algorithm. The second model corresponds to the standard QAA with the problem Hamiltonian taken from the RMT Gaussian unitary ensemble (GUE). We show that the level dynamics in this model can be mapped onto the dynamics in the Brownian motion model. For this reason, the driven GUE model can also lead to polynomial complexity of the QAA. The main contribution to the failure probability of the QAA comes from the nonadiabatic corrections to the eigenstates, which only depend on the absolute values of the transition amplitudes. Due to the mapping between the two models, these absolute values are the same in both cases. Our results indicate that this 'phase irrelevance' is the leading effect that can make both the Markovian- and GUE-type QAAs successful.
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.
Adiabatic response and quantum thermoelectrics for ac-driven quantum systems
NASA Astrophysics Data System (ADS)
Ludovico, María Florencia; Battista, Francesca; von Oppen, Felix; Arrachea, Liliana
2016-02-01
We generalize the theory of thermoelectrics to include coherent electron systems under adiabatic ac driving, accounting for quantum pumping of charge and heat, as well as for the work exchanged between the electron system and driving potentials. We derive the relevant response coefficients in the adiabatic regime and show that they obey generalized Onsager reciprocity relations. We analyze the consequences of our generalized thermoelectric framework for quantum motors, generators, heat engines, and heat pumps, characterizing them in terms of efficiencies and figures of merit. We illustrate these concepts in a model for a quantum pump.
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.
Novel latch for adiabatic quantum-flux-parametron logic
Takeuchi, Naoki Yamanashi, Yuki; Yoshikawa, Nobuyuki; Ortlepp, Thomas
2014-03-14
We herein propose the quantum-flux-latch (QFL) as a novel latch for adiabatic quantum-flux-parametron (AQFP) logic. A QFL is very compact and compatible with AQFP logic gates and can be read out in one clock cycle. Simulation results revealed that the QFL operates at 5 GHz with wide parameter margins of more than ±22%. The calculated energy dissipation was only ∼0.1 aJ/bit, which yields a small energy delay product of 20 aJ·ps. We also designed shift registers using QFLs to demonstrate more complex circuits with QFLs. Finally, we experimentally demonstrated correct operations of the QFL and a 1-bit shift register (a D flip-flop)
Shortcut to Adiabaticity for an Anisotropic Gas Containing Quantum Defects.
Papoular, D J; Stringari, S
2015-07-10
We present a shortcut to adiabaticity (STA) protocol applicable to 3D unitary Fermi gases and 2D weakly interacting Bose gases containing defects such as vortices or solitons. Our protocol relies on a new class of exact scaling solutions in the presence of anisotropic time-dependent harmonic traps. It connects stationary states in initial and final traps having the same frequency ratios. The resulting scaling laws exhibit a universal form and also apply to the classical Boltzmann gas. The duration of the STA can be made very short so as to realize a quantum quench from one stationary state to another. When applied to an anisotropically trapped superfluid gas, the STA conserves the shape of the quantum defects hosted by the cloud, thereby acting like a perfect microscope, which sharply contrasts with their strong distortion occurring during the free expansion of the cloud. PMID:26207476
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…
Conceptual aspects of geometric quantum computation
NASA Astrophysics Data System (ADS)
Sjöqvist, Erik; Azimi Mousolou, Vahid; Canali, Carlo M.
2016-07-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.
Scaling of the running time of the quantum adiabatic algorithm for propositional satisfiability
Znidaric, Marko
2005-06-15
We numerically study the quantum adiabatic algorithm for propositional satisfiability. A new class of previously unknown hard instances is identified among random problems. We numerically find that the running time for such instances grows exponentially with their size. The worst case complexity of the quantum adiabatic algorithm therefore seems to be exponential.
Quantum robots and quantum computers
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.
Applications and error correction for adiabatic quantum optimization
NASA Astrophysics Data System (ADS)
Pudenz, Kristen
Adiabatic quantum optimization (AQO) is a fast-developing subfield of quantum information processing which holds great promise in the relatively near future. Here we develop an application, quantum anomaly detection, and an error correction code, Quantum Annealing Correction (QAC), for use with AQO. The motivation for the anomaly detection algorithm is the problematic nature of classical software verification and validation (V&V). The number of lines of code written for safety-critical applications such as cars and aircraft increases each year, and with it the cost of finding errors grows exponentially (the cost of overlooking errors, which can be measured in human safety, is arguably even higher). We approach the V&V problem by using a quantum machine learning algorithm to identify charateristics of software operations that are implemented outside of specifications, then define an AQO to return these anomalous operations as its result. Our error correction work is the first large-scale experimental demonstration of quantum error correcting codes. We develop QAC and apply it to USC's equipment, the first and second generation of commercially available D-Wave AQO processors. We first show comprehensive experimental results for the code's performance on antiferromagnetic chains, scaling the problem size up to 86 logical qubits (344 physical qubits) and recovering significant encoded success rates even when the unencoded success rates drop to almost nothing. A broader set of randomized benchmarking problems is then introduced, for which we observe similar behavior to the antiferromagnetic chain, specifically that the use of QAC is almost always advantageous for problems of sufficient size and difficulty. Along the way, we develop problem-specific optimizations for the code and gain insight into the various on-chip error mechanisms (most prominently thermal noise, since the hardware operates at finite temperature) and the ways QAC counteracts them. We finish by showing
Adiabatic passage in photon-echo quantum memories
NASA Astrophysics Data System (ADS)
Demeter, Gabor
2013-11-01
Photon-echo-based quantum memories use inhomogeneously broadened, optically thick ensembles of absorbers to store a weak optical signal and employ various protocols to rephase the atomic coherences for information retrieval. We study the application of two consecutive, frequency-chirped control pulses for coherence rephasing in an ensemble with a “natural” inhomogeneous broadening. Although propagation effects distort the two control pulses differently, chirped pulses that drive adiabatic passage can rephase atomic coherences in an optically thick storage medium. Combined with spatial phase-mismatching techniques to prevent primary echo emission, coherences can be rephased around the ground state to achieve secondary echo emission with close to unit efficiency. Potential advantages over similar schemes working with π pulses include greater potential signal fidelity, reduced noise due to spontaneous emission, and better capability for the storage of multiple memory channels.
Adiabatic quantum-flux-parametron cell library adopting minimalist design
NASA Astrophysics Data System (ADS)
Takeuchi, Naoki; Yamanashi, Yuki; Yoshikawa, Nobuyuki
2015-05-01
We herein build an adiabatic quantum-flux-parametron (AQFP) cell library adopting minimalist design and a symmetric layout. In the proposed minimalist design, every logic cell is designed by arraying four types of building block cells: buffer, NOT, constant, and branch cells. Therefore, minimalist design enables us to effectively build and customize an AQFP cell library. The symmetric layout reduces unwanted parasitic magnetic coupling and ensures a large mutual inductance in an output transformer, which enables very long wiring between logic cells. We design and fabricate several logic circuits using the minimal AQFP cell library so as to test logic cells in the library. Moreover, we experimentally investigate the maximum wiring length between logic cells. Finally, we present an experimental demonstration of an 8-bit carry look-ahead adder designed using the minimal AQFP cell library and demonstrate that the proposed cell library is sufficiently robust to realize large-scale digital circuits.
Adiabatic quantum-flux-parametron cell library adopting minimalist design
Takeuchi, Naoki; Yamanashi, Yuki; Yoshikawa, Nobuyuki
2015-05-07
We herein build an adiabatic quantum-flux-parametron (AQFP) cell library adopting minimalist design and a symmetric layout. In the proposed minimalist design, every logic cell is designed by arraying four types of building block cells: buffer, NOT, constant, and branch cells. Therefore, minimalist design enables us to effectively build and customize an AQFP cell library. The symmetric layout reduces unwanted parasitic magnetic coupling and ensures a large mutual inductance in an output transformer, which enables very long wiring between logic cells. We design and fabricate several logic circuits using the minimal AQFP cell library so as to test logic cells in the library. Moreover, we experimentally investigate the maximum wiring length between logic cells. Finally, we present an experimental demonstration of an 8-bit carry look-ahead adder designed using the minimal AQFP cell library and demonstrate that the proposed cell library is sufficiently robust to realize large-scale digital circuits.
Necessary and sufficient condition for quantum adiabatic evolution by unitary control fields
NASA Astrophysics Data System (ADS)
Wang, Zhen-Yu; Plenio, Martin B.
2016-05-01
We decompose the quantum adiabatic evolution as the products of gauge invariant unitary operators and obtain the exact nonadiabatic correction in the adiabatic approximation. A necessary and sufficient condition that leads to adiabatic evolution with geometric phases is provided, and we determine that in the adiabatic evolution, while the eigenstates are slowly varying, the eigenenergies and degeneracy of the Hamiltonian can change rapidly. We exemplify this result by the example of the adiabatic evolution driven by parametrized pulse sequences. For driving fields that are rotating slowly with the same average energy and evolution path, fast modulation fields can have smaller nonadiabatic errors than obtained under the traditional approach with a constant amplitude.
Decoherence in current induced forces: Application to adiabatic quantum motors
NASA Astrophysics Data System (ADS)
Fernández-Alcázar, Lucas J.; Bustos-Marún, Raúl A.; Pastawski, Horacio M.
2015-08-01
Current induced forces are not only related with the discrete nature of electrons but also with its quantum character. It is natural then to wonder about the effect of decoherence. Here, we develop the theory of current induced forces including dephasing processes and we apply it to study adiabatic quantum motors (AQMs). The theory is based on Büttiker's fictitious probe model, which here is reformulated for this particular case. We prove that it accomplishes the fluctuation-dissipation theorem. We also show that, in spite of decoherence, the total work performed by the current induced forces remains equal to the pumped charge per cycle times the voltage. We find that decoherence affects not only the current induced forces of the system but also its intrinsic friction and noise, modifying in a nontrivial way the efficiency of AQMs. We apply the theory to study an AQM inspired by a classical peristaltic pump where we surprisingly find that decoherence can play a crucial role by triggering its operation. Our results can help to understand how environmentally induced dephasing affects the quantum behavior of nanomechanical devices.
Quantum and classical non-adiabatic dynamics of Li_{2}^{+}Ne photodissociation
NASA Astrophysics Data System (ADS)
Pouilly, Brigitte; Monnerville, Maurice; Zanuttini, David; Gervais, Benoît
2015-01-01
The 3D photodissociation dynamics of Li2+Ne system is investigated by quantum calculations using the multi-configuration time-dependent Hartree (MCTDH) method and by classical simulations with the trajectory surface hopping (TSH) approach. Six electronic states of A’ symmetry and two states of A” symmetry are involved in the process. Couplings in the excitation region and two conical intersections in the vicinity of the Franck-Condon zone control the non-adiabatic nuclear dynamics. A diabatic representation including all the states and the couplings is determined. Diabatic and adiabatic populations calculated for initial excitation to pure diabatic and adiabatic states lead to a clear understanding of the mechanisms governing the non-adiabatic photodissociation process. The classical and quantum photodissociation cross-sections for absorption in two adiabatic states of the A’ symmetry are calculated. A remarkable agreement between quantum and classical results is obtained regarding the populations and the absorption cross-sections.
Introduction to Quantum Computation
NASA Astrophysics Data System (ADS)
Ekert, A.
A computation is a physical process. It may be performed by a piece of electronics or on an abacus, or in your brain, but it is a process that takes place in nature and as such it is subject to the laws of physics. Quantum computers are machines that rely on characteristically quantum phenomena, such as quantum interference and quantum entanglement in order to perform computation. In this series of lectures I want to elaborate on the computational power of such machines.
Random Matrix Approach to Quantum Adiabatic Evolution Algorithms
NASA Technical Reports Server (NTRS)
Boulatov, Alexei; Smelyanskiy, Vadier N.
2004-01-01
We analyze the power of quantum adiabatic evolution algorithms (Q-QA) for solving random NP-hard optimization problems within a theoretical framework based on the random matrix theory (RMT). We present two types of the driven RMT models. In the first model, the driving Hamiltonian is represented by Brownian motion in the matrix space. We use the Brownian motion model to obtain a description of multiple avoided crossing phenomena. We show that the failure mechanism of the QAA is due to the interaction of the ground state with the "cloud" formed by all the excited states, confirming that in the driven RMT models. the Landau-Zener mechanism of dissipation is not important. We show that the QAEA has a finite probability of success in a certain range of parameters. implying the polynomial complexity of the algorithm. The second model corresponds to the standard QAEA with the problem Hamiltonian taken from the Gaussian Unitary RMT ensemble (GUE). We show that the level dynamics in this model can be mapped onto the dynamics in the Brownian motion model. However, the driven RMT model always leads to the exponential complexity of the algorithm due to the presence of the long-range intertemporal correlations of the eigenvalues. Our results indicate that the weakness of effective transitions is the leading effect that can make the Markovian type QAEA successful.
Scalable optical quantum computer
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)
Quantum computer games: quantum minesweeper
NASA Astrophysics Data System (ADS)
Gordon, Michal; Gordon, Goren
2010-07-01
The computer game of quantum minesweeper is introduced as a quantum extension of the well-known classical minesweeper. Its main objective is to teach the unique concepts of quantum mechanics in a fun way. Quantum minesweeper demonstrates the effects of superposition, entanglement and their non-local characteristics. While in the classical minesweeper the goal of the game is to discover all the mines laid out on a board without triggering them, in the quantum version there are several classical boards in superposition. The goal is to know the exact quantum state, i.e. the precise layout of all the mines in all the superposed classical boards. The player can perform three types of measurement: a classical measurement that probabilistically collapses the superposition; a quantum interaction-free measurement that can detect a mine without triggering it; and an entanglement measurement that provides non-local information. The application of the concepts taught by quantum minesweeper to one-way quantum computing are also presented.
Adiabatic two-photon quantum gate operations using a long-range photonic bus
NASA Astrophysics Data System (ADS)
Hope, Anthony P.; Nguyen, Thach G.; Mitchell, Arnan; Greentree, Andrew D.
2015-03-01
Adiabatic techniques have much potential to realize practical and robust optical waveguide devices. Traditionally, photonic elements are limited to coupling schemes that rely on proximity to nearest neighbour elements. We combine adiabatic passage with a continuum based long-range optical bus to break free from such topological restraints and thereby outline a new approach to photonic quantum gate design. We explicitly show designs for adiabatic quantum gates that produce a Hadamard, 50:50 and 1/3:2/3 beam splitter, and non-deterministic controlled NOT gate based on planar thin, shallow ridge waveguides. Our calculations are performed under conditions of one and two-photon inputs.
Quantum information and computation
Bennett, C.H.
1995-10-01
A new quantum theory of communication and computation is emerging, in which the stuff transmitted or processed is not classical information, but arbitrary superpositions of quantum states. {copyright} 1995 {ital American} {ital Institute} {ital of} {ital Physics}.
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.
Ultrafast adiabatic quantum algorithm for the NP-complete exact cover problem
Wang, Hefeng; Wu, Lian-Ao
2016-01-01
An adiabatic quantum algorithm may lose quantumness such as quantum coherence entirely in its long runtime, and consequently the expected quantum speedup of the algorithm does not show up. Here we present a general ultrafast adiabatic quantum algorithm. We show that by applying a sequence of fast random or regular signals during evolution, the runtime can be reduced substantially, whereas advantages of the adiabatic algorithm remain intact. We also propose a randomized Trotter formula and show that the driving Hamiltonian and the proposed sequence of fast signals can be implemented simultaneously. We illustrate the algorithm by solving the NP-complete 3-bit exact cover problem (EC3), where NP stands for nondeterministic polynomial time, and put forward an approach to implementing the problem with trapped ions. PMID:26923834
Ultrafast adiabatic quantum algorithm for the NP-complete exact cover problem.
Wang, Hefeng; Wu, Lian-Ao
2016-01-01
An adiabatic quantum algorithm may lose quantumness such as quantum coherence entirely in its long runtime, and consequently the expected quantum speedup of the algorithm does not show up. Here we present a general ultrafast adiabatic quantum algorithm. We show that by applying a sequence of fast random or regular signals during evolution, the runtime can be reduced substantially, whereas advantages of the adiabatic algorithm remain intact. We also propose a randomized Trotter formula and show that the driving Hamiltonian and the proposed sequence of fast signals can be implemented simultaneously. We illustrate the algorithm by solving the NP-complete 3-bit exact cover problem (EC3), where NP stands for nondeterministic polynomial time, and put forward an approach to implementing the problem with trapped ions. PMID:26923834
NASA Astrophysics Data System (ADS)
Barz, Stefanie
2013-05-01
Quantum physics has revolutionized our understanding of information processing and enables computational speed-ups that are unattainable using classical computers. In this talk I will present a series of experiments in the field of photonic quantum computing. The first experiment is in the field of photonic state engineering and realizes the generation of heralded polarization-entangled photon pairs. It overcomes the limited applicability of photon-based schemes for quantum information processing tasks, which arises from the probabilistic nature of photon generation. The second experiment uses polarization-entangled photonic qubits to implement ``blind quantum computing,'' a new concept in quantum computing. Blind quantum computing enables a nearly-classical client to access the resources of a more computationally-powerful quantum server without divulging the content of the requested computation. Finally, the concept of blind quantum computing is applied to the field of verification. A new method is developed and experimentally demonstrated, which verifies the entangling capabilities of a quantum computer based on a blind Bell test.
Dissipative quantum computing with open quantum walks
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.
Probabilistic Cloning and Quantum Computation
NASA Astrophysics Data System (ADS)
Gao, Ting; Yan, Feng-Li; Wang, Zhi-Xi
2004-06-01
We discuss the usefulness of quantum cloning and present examples of quantum computation tasks for which the cloning offers an advantage which cannot be matched by any approach that does not resort to quantum cloning. In these quantum computations, we need to distribute quantum information contained in the states about which we have some partial information. To perform quantum computations, we use a state-dependent probabilistic quantum cloning procedure to distribute quantum information in the middle of a quantum computation.
NASA Astrophysics Data System (ADS)
Chen, Jingwei; Wei, L. F.
2015-10-01
We show that a set of universal quantum gates could be implemented robustly in a circuit QED system by using Stark-chirped rapid adiabatic passage (SCRAP) technique. Under the adiabatic limit we find that the population transfers could be deterministically passaged from one selected quantum states to the others, and thus the desired quantum gates can be implemented. The proposed SCRAP-based gates are insensitive to the details of the operations and thus relax the designs of the applied pulses, operational imperfections, and the decoherence of the system.
Di Lisi, Antonio; De Siena, Silvio; Illuminati, Fabrizio; Vitali, David
2005-09-15
We introduce an efficient, quasideterministic scheme to generate maximally entangled states of two atomic ensembles. The scheme is based on quantum nondemolition measurements of total atomic populations and on adiabatic quantum feedback conditioned by the measurements outputs. The high efficiency of the scheme is tested and confirmed numerically for ideal photodetection as well as in the presence of losses.
Adiabatic many-body state preparation and information transfer in quantum dot arrays
NASA Astrophysics Data System (ADS)
Farooq, Umer; Bayat, Abolfazl; Mancini, Stefano; Bose, Sougato
2015-04-01
Quantum simulation of many-body systems are one of the most interesting tasks of quantum technology. Among them is the preparation of a many-body system in its ground state when the vanishing energy gap makes the cooling mechanisms ineffective. Adiabatic theorem, as an alternative to cooling, can be exploited for driving the many-body system to its ground state. In this paper, we study two most common disorders in quantum dot arrays, namely exchange coupling fluctuations and hyperfine interaction, in adiabatic preparation of ground state in such systems. We show that the adiabatic ground-state preparation is highly robust against those disorder effects making it a good analog simulator. Moreover, we also study the adiabatic quantum information transfer, using singlet-triplet states, across a spin chain. In contrast to ground-state preparation the transfer mechanism is highly affected by disorder and in particular, the hyperfine interaction is very destructive for the performance. This suggests that for communication tasks across such arrays adiabatic evolution is not as effective and quantum quenches could be preferable.
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.
Quantum dynamics by the constrained adiabatic trajectory method
Leclerc, A.; Jolicard, G.; Guerin, S.; Killingbeck, J. P.
2011-03-15
We develop the constrained adiabatic trajectory method (CATM), which allows one to solve the time-dependent Schroedinger equation constraining the dynamics to a single Floquet eigenstate, as if it were adiabatic. This constrained Floquet state (CFS) is determined from the Hamiltonian modified by an artificial time-dependent absorbing potential whose forms are derived according to the initial conditions. The main advantage of this technique for practical implementation is that the CFS is easy to determine even for large systems since its corresponding eigenvalue is well isolated from the others through its imaginary part. The properties and limitations of the CATM are explored through simple examples.
Speeding up Adiabatic Quantum State Transfer by Using Dressed States
NASA Astrophysics Data System (ADS)
Baksic, Alexandre; Ribeiro, Hugo; Clerk, Aashish A.
2016-06-01
We develop new pulse schemes to significantly speed up adiabatic state transfer protocols. Our general strategy involves adding corrections to an initial control Hamiltonian that harness nonadiabatic transitions. These corrections define a set of dressed states that the system follows exactly during the state transfer. We apply this approach to stimulated Raman adiabatic passage protocols and show that a suitable choice of dressed states allows one to design fast protocols that do not require additional couplings, while simultaneously minimizing the occupancy of the "intermediate" level.
Nanomagnet coupled to quantum spin Hall edge: An adiabatic quantum motor
NASA Astrophysics Data System (ADS)
Arrachea, Liliana; von Oppen, Felix
2015-11-01
The precessing magnetization of a magnetic islands coupled to a quantum spin Hall edge pumps charge along the edge. Conversely, a bias voltage applied to the edge makes the magnetization precess. We point out that this device realizes an adiabatic quantum motor and discuss the efficiency of its operation based on a scattering matrix approach akin to Landauer-Büttiker theory. Scattering theory provides a microscopic derivation of the Landau-Lifshitz-Gilbert equation for the magnetization dynamics of the device, including spin-transfer torque, Gilbert damping, and Langevin torque. We find that the device can be viewed as a Thouless motor, attaining unit efficiency when the chemical potential of the edge states falls into the magnetization-induced gap. For more general parameters, we characterize the device by means of a figure of merit analogous to the ZT value in thermoelectrics.
Reprint of : Nanomagnet coupled to quantum spin Hall edge: An adiabatic quantum motor
NASA Astrophysics Data System (ADS)
Arrachea, Liliana; von Oppen, Felix
2016-08-01
The precessing magnetization of a magnetic islands coupled to a quantum spin Hall edge pumps charge along the edge. Conversely, a bias voltage applied to the edge makes the magnetization precess. We point out that this device realizes an adiabatic quantum motor and discuss the efficiency of its operation based on a scattering matrix approach akin to Landauer-Büttiker theory. Scattering theory provides a microscopic derivation of the Landau-Lifshitz-Gilbert equation for the magnetization dynamics of the device, including spin-transfer torque, Gilbert damping, and Langevin torque. We find that the device can be viewed as a Thouless motor, attaining unit efficiency when the chemical potential of the edge states falls into the magnetization-induced gap. For more general parameters, we characterize the device by means of a figure of merit analogous to the ZT value in thermoelectrics.
Adiabatic and Hamiltonian computing on a 2D lattice with simple two-qubit interactions
NASA Astrophysics Data System (ADS)
Lloyd, Seth; Terhal, Barbara M.
2016-02-01
We show how to perform universal Hamiltonian and adiabatic computing using a time-independent Hamiltonian on a 2D grid describing a system of hopping particles which string together and interact to perform the computation. In this construction, the movement of one particle is controlled by the presence or absence of other particles, an effective quantum field effect transistor that allows the construction of controlled-NOT and controlled-rotation gates. The construction translates into a model for universal quantum computation with time-independent two-qubit ZZ and XX+YY interactions on an (almost) planar grid. The effective Hamiltonian is arrived at by a single use of first-order perturbation theory avoiding the use of perturbation gadgets. The dynamics and spectral properties of the effective Hamiltonian can be fully determined as it corresponds to a particular realization of a mapping between a quantum circuit and a Hamiltonian called the space-time circuit-to-Hamiltonian construction. Because of the simple interactions required, and because no higher-order perturbation gadgets are employed, our construction is potentially realizable using superconducting or other solid-state qubits.
NASA Astrophysics Data System (ADS)
Tian, Si-Cong; Wan, Ren-Gang; Wang, Chun-Liang; Shu, Shi-Li; Wang, Li-Jie; Tong, Chun-Zhu
2016-04-01
We propose a scheme for creation and transfer of coherence among ground state and indirect exciton states of triple quantum dots via the technique of stimulated Raman adiabatic passage. Compared with the traditional stimulated Raman adiabatic passage, the Stokes laser pulse is replaced by the tunneling pulse, which can be controlled by the externally applied voltages. By varying the amplitudes and sequences of the pump and tunneling pulses, a complete coherence transfer or an equal coherence distribution among multiple states can be obtained. The investigations can provide further insight for the experimental development of controllable coherence transfer in semiconductor structure and may have potential applications in quantum information processing.
Tian, Si-Cong; Wan, Ren-Gang; Wang, Chun-Liang; Shu, Shi-Li; Wang, Li-Jie; Tong, Chun-Zhu
2016-12-01
We propose a scheme for creation and transfer of coherence among ground state and indirect exciton states of triple quantum dots via the technique of stimulated Raman adiabatic passage. Compared with the traditional stimulated Raman adiabatic passage, the Stokes laser pulse is replaced by the tunneling pulse, which can be controlled by the externally applied voltages. By varying the amplitudes and sequences of the pump and tunneling pulses, a complete coherence transfer or an equal coherence distribution among multiple states can be obtained. The investigations can provide further insight for the experimental development of controllable coherence transfer in semiconductor structure and may have potential applications in quantum information processing. PMID:27107772
Quantum computing with trapped ions
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.
Quantum computation: Honesty test
NASA Astrophysics Data System (ADS)
Morimae, Tomoyuki
2013-11-01
Alice does not have a quantum computer so she delegates a computation to Bob, who does own one. But how can Alice check whether the computation that Bob performs for her is correct? An experiment with photonic qubits demonstrates such a verification protocol.
Multi-qubit non-adiabatic holonomic controlled quantum gates in decoherence-free subspaces
NASA Astrophysics Data System (ADS)
Hu, Shi; Cui, Wen-Xue; Guo, Qi; Wang, Hong-Fu; Zhu, Ai-Dong; Zhang, Shou
2016-06-01
Non-adiabatic holonomic quantum gate in decoherence-free subspaces is of greatly practical importance due to its built-in fault tolerance, coherence stabilization virtues, and short run-time. Here, we propose some compact schemes to implement two- and three-qubit controlled unitary quantum gates and Fredkin gate. For the controlled unitary quantum gates, the unitary operator acting on the target qubit is an arbitrary single-qubit gate operation. The controlled quantum gates can be directly implemented by utilizing non-adiabatic holonomy in decoherence-free subspaces and the required resource for the decoherence-free subspace encoding is minimal by using only two neighboring physical qubits undergoing collective dephasing to encode a logical qubit.
Shortcuts to adiabaticity in classical and quantum processes for scale-invariant driving
NASA Astrophysics Data System (ADS)
Deffner, Sebastian; Jarzynski, Christopher; Del Campo, Adolfo
2014-03-01
All real physical processes in classical as well as in quantum devices operate in finite-time. For most applications, however, adiabatic, i.e. infinitely-slow processes, are more favorable, as these do not cause unwanted, parasitic excitations. A shortcut to adiabaticity is a driving protocol which reproduces in a short time the same final state that would result from an adiabatic process. A particular powerful technique to engineer such shortcuts is transitionless quantum driving by means of counterdiabatic fields. However, determining closed form expressions for the counterdiabatic field has generally proven to be a daunting task. In this paper, we introduce a novel approach, with which we find the explicit form of the counterdiabatic driving field in arbitrary scale-invariant dynamical processes, encompassing expansions and transport. Our approach originates in the formalism of generating functions, and unifies previous approaches independently developed for classical and quantum systems. We show how this new approach allows to design shortcuts to adiabaticity for a large class of classical and quantum, single-particle, non-linear, and many-body systems. SD and CJ acknowledge support from the National Science Foundation (USA) under grant DMR-1206971. This research is further supported by the U.S Department of Energy through the LANL/LDRD Program and a LANL J. Robert Oppenheimer fellowship (AdC).
From Classical Nonlinear Integrable Systems to Quantum Shortcuts to Adiabaticity
NASA Astrophysics Data System (ADS)
Okuyama, Manaka; Takahashi, Kazutaka
2016-08-01
Using shortcuts to adiabaticity, we solve the time-dependent Schrödinger equation that is reduced to a classical nonlinear integrable equation. For a given time-dependent Hamiltonian, the counterdiabatic term is introduced to prevent nonadiabatic transitions. Using the fact that the equation for the dynamical invariant is equivalent to the Lax equation in nonlinear integrable systems, we obtain the counterdiabatic term exactly. The counterdiabatic term is available when the corresponding Lax pair exists and the solvable systems are classified in a unified and systematic way. Multisoliton potentials obtained from the Korteweg-de Vries equation and isotropic X Y spin chains from the Toda equations are studied in detail.
NASA Astrophysics Data System (ADS)
Kashefi, Elham
Over the next five to ten years we will see a state of flux as quantum devices become part of the mainstream computing landscape. However adopting and applying such a highly variable and novel technology is both costly and risky as this quantum approach has an acute verification and validation problem: On the one hand, since classical computations cannot scale up to the computational power of quantum mechanics, verifying the correctness of a quantum-mediated computation is challenging; on the other hand, the underlying quantum structure resists classical certification analysis. Our grand aim is to settle these key milestones to make the translation from theory to practice possible. Currently the most efficient ways to verify a quantum computation is to employ cryptographic methods. I will present the current state of the art of various existing protocols where generally there exists a trade-off between the practicality of the scheme versus their generality, trust assumptions and security level. EK gratefully acknowledges funding through EPSRC Grants EP/N003829/1 and EP/M013243/1.
Scaling-Up Quantum Heat Engines Efficiently via Shortcuts to Adiabaticity
NASA Astrophysics Data System (ADS)
Beau, Mathieu; Jaramillo, Juan; del Campo, Adolfo
2016-04-01
The finite-time operation of a quantum heat engine that uses a single particle as a working medium generally increases the output power at the expense of inducing friction that lowers the cycle efficiency. We propose to scale up a quantum heat engine utilizing a many-particle working medium in combination with the use of shortcuts to adiabaticity to boost the nonadiabatic performance by eliminating quantum friction and reducing the cycle time. To this end, we first analyze the finite-time thermodynamics of a quantum Otto cycle implemented with a quantum fluid confined in a time-dependent harmonic trap. We show that nonadiabatic effects can be controlled and tailored to match the adiabatic performance using a variety of shortcuts to adiabaticity. As a result, the nonadiabatic dynamics of the scaled-up many-particle quantum heat engine exhibits no friction and the cycle can be run at maximum efficiency with a tunable output power. We demonstrate our results with a working medium consisting of particles with inverse-square pairwise interactions, that includes noninteracting and hard-core bosons as limiting cases.
Topological Code Architectures for Quantum Computation
NASA Astrophysics Data System (ADS)
Cesare, Christopher Anthony
This dissertation is concerned with quantum computation using many-body quantum systems encoded in topological codes. The interest in these topological systems has increased in recent years as devices in the lab begin to reach the fidelities required for performing arbitrarily long quantum algorithms. The most well-studied system, Kitaev's toric code, provides both a physical substrate for performing universal fault-tolerant quantum computations and a useful pedagogical tool for explaining the way other topological codes work. In this dissertation, I first review the necessary formalism for quantum information and quantum stabilizer codes, and then I introduce two families of topological codes: Kitaev's toric code and Bombin's color codes. I then present three chapters of original work. First, I explore the distinctness of encoding schemes in the color codes. Second, I introduce a model of quantum computation based on the toric code that uses adiabatic interpolations between static Hamiltonians with gaps constant in the system size. Lastly, I describe novel state distillation protocols that are naturally suited for topological architectures and show that they provide resource savings in terms of the number of required ancilla states when compared to more traditional approaches to quantum gate approximation.
Robust quantum logic in neutral atoms via adiabatic Rydberg dressing
Keating, Tyler; Cook, Robert L.; Hankin, Aaron M.; Jau, Yuan -Yu; Biedermann, Grant W.; Deutsch, Ivan H.
2015-01-28
We study a scheme for implementing a controlled-Z (CZ) gate between two neutral-atom qubits based on the Rydberg blockade mechanism in a manner that is robust to errors caused by atomic motion. By employing adiabatic dressing of the ground electronic state, we can protect the gate from decoherence due to random phase errors that typically arise because of atomic thermal motion. In addition, the adiabatic protocol allows for a Doppler-free configuration that involves counterpropagating lasers in a σ_{+}/σ_{-} orthogonal polarization geometry that further reduces motional errors due to Doppler shifts. The residual motional error is dominated by dipole-dipole forces acting on doubly-excited Rydberg atoms when the blockade is imperfect. As a result, for reasonable parameters, with qubits encoded into the clock states of ^{133}Cs, we predict that our protocol could produce a CZ gate in < 10 μs with error probability on the order of 10^{-3}.
Robust quantum logic in neutral atoms via adiabatic Rydberg dressing
Keating, Tyler; Cook, Robert L.; Hankin, Aaron M.; Jau, Yuan -Yu; Biedermann, Grant W.; Deutsch, Ivan H.
2015-01-28
We study a scheme for implementing a controlled-Z (CZ) gate between two neutral-atom qubits based on the Rydberg blockade mechanism in a manner that is robust to errors caused by atomic motion. By employing adiabatic dressing of the ground electronic state, we can protect the gate from decoherence due to random phase errors that typically arise because of atomic thermal motion. In addition, the adiabatic protocol allows for a Doppler-free configuration that involves counterpropagating lasers in a σ+/σ- orthogonal polarization geometry that further reduces motional errors due to Doppler shifts. The residual motional error is dominated by dipole-dipole forces actingmore » on doubly-excited Rydberg atoms when the blockade is imperfect. As a result, for reasonable parameters, with qubits encoded into the clock states of 133Cs, we predict that our protocol could produce a CZ gate in < 10 μs with error probability on the order of 10-3.« less
NASA Astrophysics Data System (ADS)
He, Shuang; Su, Shi-Lei; Wang, Dong-Yang; Sun, Wen-Mei; Bai, Cheng-Hua; Zhu, Ai-Dong; Wang, Hong-Fu; Zhang, Shou
2016-08-01
We propose an effective scheme of shortcuts to adiabaticity for generating a three-dimensional entanglement of two atoms trapped in a cavity using the transitionless quantum driving (TQD) approach. The key point of this approach is to construct an effective Hamiltonian that drives the dynamics of a system along instantaneous eigenstates of a reference Hamiltonian to reproduce the same final state as that of an adiabatic process within a much shorter time. In this paper, the shortcuts to adiabatic passage are constructed by introducing two auxiliary excited levels in each atom and applying extra cavity modes and classical fields to drive the relevant transitions. Thereby, the three-dimensional entanglement is obtained with a faster rate than that in the adiabatic passage. Moreover, the influences of atomic spontaneous emission and photon loss on the fidelity are discussed by numerical simulation. The results show that the speed of entanglement implementation is greatly improved by the use of adiabatic shortcuts and that this entanglement implementation is robust against decoherence. This will be beneficial to the preparation of high-dimensional entanglement in experiment and provides the necessary conditions for the application of high-dimensional entangled states in quantum information processing.
He, Shuang; Su, Shi-Lei; Wang, Dong-Yang; Sun, Wen-Mei; Bai, Cheng-Hua; Zhu, Ai-Dong; Wang, Hong-Fu; Zhang, Shou
2016-01-01
We propose an effective scheme of shortcuts to adiabaticity for generating a three-dimensional entanglement of two atoms trapped in a cavity using the transitionless quantum driving (TQD) approach. The key point of this approach is to construct an effective Hamiltonian that drives the dynamics of a system along instantaneous eigenstates of a reference Hamiltonian to reproduce the same final state as that of an adiabatic process within a much shorter time. In this paper, the shortcuts to adiabatic passage are constructed by introducing two auxiliary excited levels in each atom and applying extra cavity modes and classical fields to drive the relevant transitions. Thereby, the three-dimensional entanglement is obtained with a faster rate than that in the adiabatic passage. Moreover, the influences of atomic spontaneous emission and photon loss on the fidelity are discussed by numerical simulation. The results show that the speed of entanglement implementation is greatly improved by the use of adiabatic shortcuts and that this entanglement implementation is robust against decoherence. This will be beneficial to the preparation of high-dimensional entanglement in experiment and provides the necessary conditions for the application of high-dimensional entangled states in quantum information processing. PMID:27499169
He, Shuang; Su, Shi-Lei; Wang, Dong-Yang; Sun, Wen-Mei; Bai, Cheng-Hua; Zhu, Ai-Dong; Wang, Hong-Fu; Zhang, Shou
2016-01-01
We propose an effective scheme of shortcuts to adiabaticity for generating a three-dimensional entanglement of two atoms trapped in a cavity using the transitionless quantum driving (TQD) approach. The key point of this approach is to construct an effective Hamiltonian that drives the dynamics of a system along instantaneous eigenstates of a reference Hamiltonian to reproduce the same final state as that of an adiabatic process within a much shorter time. In this paper, the shortcuts to adiabatic passage are constructed by introducing two auxiliary excited levels in each atom and applying extra cavity modes and classical fields to drive the relevant transitions. Thereby, the three-dimensional entanglement is obtained with a faster rate than that in the adiabatic passage. Moreover, the influences of atomic spontaneous emission and photon loss on the fidelity are discussed by numerical simulation. The results show that the speed of entanglement implementation is greatly improved by the use of adiabatic shortcuts and that this entanglement implementation is robust against decoherence. This will be beneficial to the preparation of high-dimensional entanglement in experiment and provides the necessary conditions for the application of high-dimensional entangled states in quantum information processing. PMID:27499169
Quantum Computing using Photons
NASA Astrophysics Data System (ADS)
Elhalawany, Ahmed; Leuenberger, Michael
2013-03-01
In this work, we propose a theoretical model of two-quantum bit gates for quantum computation using the polarization states of two photons in a microcavity. By letting the two photons interact non-resonantly with four quantum dots inside the cavity, we obtain an effective photon-photon interaction which we exploit for the implementation of an universal XOR gate. The two-photon Hamiltonian is written in terms of the photons' total angular momentum operators and their states are written using the Schwinger representation of the total angular momentum.
Computational quantum chemistry website
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.
Adiabatic quantum pump in a zigzag graphene nanoribbon junction
NASA Astrophysics Data System (ADS)
Zhang, Lin
2015-11-01
The adiabatic electron transport is theoretically studied in a zigzag graphene nanoribbon (ZGNR) junction with two time-dependent pumping electric fields. By modeling a ZGNR p-n junction and applying the Keldysh Green’s function method, we find that a pumped charge current is flowing in the device at a zero external bias, which mainly comes from the photon-assisted tunneling process and the valley selection rule in an even-chain ZGNR junction. The pumped charge current and its ON and OFF states can be efficiently modulated by changing the system parameters such as the pumping frequency, the pumping phase difference, and the Fermi level. A ferromagnetic ZGNR device is also studied to generate a pure spin current and a fully polarized spin current due to the combined spin pump effect and the valley valve effect. Our finding might pave the way to manipulate the degree of freedom of electrons in a graphene-based electronic device. Project supported by the National Natural Science Foundation of China (Grant No. 110704033), the Natural Science Foundation of Jiangsu Province, China (Grant No. BK2010416), and the Natural Science Foundation for Colleges and Universities in Jiangsu Province, China (Grant No. 13KJB140005).
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.
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
Quantum state transfer between atomic ensembles trapped in separate cavities via adiabatic passage
NASA Astrophysics Data System (ADS)
Zhang, Chun-Ling; Chen, Mei-Feng
2015-07-01
We propose a new approach for quantum state transfer (QST) between atomic ensembles separately trapped in two distant cavities connected by an optical fiber via adiabatic passage. The three-level Λ-type atoms in each ensemble dispersively interact with the nonresonant classical field and cavity mode. By choosing appropriate parameters of the system, the effective Hamiltonian describes two atomic ensembles interacting with “the same cavity mode” and has a dark state. Consequently, the QST between atomic ensembles can be implemented via adiabatic passage. Numerical calculations show that the scheme is robust against moderate fluctuations of the experimental parameters. In addition, the effect of decoherence can be suppressed effectively. The idea provides a scalable way to an atomic-ensemble-based quantum network, which may be reachable with currently available technology. Project supported by the Funding (type B) from the Fujian Education Department, China (Grant No. JB13261).
Non-adiabatic molecular dynamics with complex quantum trajectories. I. The diabatic representation
NASA Astrophysics Data System (ADS)
Zamstein, Noa; Tannor, David J.
2012-12-01
We extend a recently developed quantum trajectory method [Y. Goldfarb, I. Degani, and D. J. Tannor, J. Chem. Phys. 125, 231103 (2006)], 10.1063/1.2400851 to treat non-adiabatic transitions. Each trajectory evolves on a single surface according to Newton's laws with complex positions and momenta. The transfer of amplitude between surfaces stems naturally from the equations of motion, without the need for surface hopping. In this paper we derive the equations of motion and show results in the diabatic representation, which is rarely used in trajectory methods for calculating non-adiabatic dynamics. We apply our method to the first two benchmark models introduced by Tully [J. Chem. Phys. 93, 1061 (1990)], 10.1063/1.459170. Besides giving the probability branching ratios between the surfaces, the method also allows the reconstruction of the time-dependent wavepacket. Our results are in quantitative agreement with converged quantum mechanical calculations.
Non-adiabatic molecular dynamics with complex quantum trajectories. I. The diabatic representation.
Zamstein, Noa; Tannor, David J
2012-12-14
We extend a recently developed quantum trajectory method [Y. Goldfarb, I. Degani, and D. J. Tannor, J. Chem. Phys. 125, 231103 (2006)] to treat non-adiabatic transitions. Each trajectory evolves on a single surface according to Newton's laws with complex positions and momenta. The transfer of amplitude between surfaces stems naturally from the equations of motion, without the need for surface hopping. In this paper we derive the equations of motion and show results in the diabatic representation, which is rarely used in trajectory methods for calculating non-adiabatic dynamics. We apply our method to the first two benchmark models introduced by Tully [J. Chem. Phys. 93, 1061 (1990)]. Besides giving the probability branching ratios between the surfaces, the method also allows the reconstruction of the time-dependent wavepacket. Our results are in quantitative agreement with converged quantum mechanical calculations. PMID:23249054
Effects of dephasing on quantum adiabatic pumping with nonequilibrium initial states
NASA Astrophysics Data System (ADS)
Zhou, Longwen; Tan, Da Yang; Gong, Jiangbin
2015-12-01
Thouless's quantum adiabatic pumping is of fundamental interest to condensed-matter physics. It originally considered a zero-temperature equilibrium state uniformly occupying all the bands below a Fermi surface. In light of recent direct simulations of Thouless's concept in cold-atom systems, this paper investigates the dynamics of quantum adiabatic pumping subject to dephasing for rather general initial states with nonuniform populations and possibly interband coherence. Using a theory based on pure-dephasing Lindblad evolution, we find that the pumping is contributed by two parts of different nature: a dephasing-modified geometric part weighted by initial Bloch state populations and an interband-coherence-induced part compromised by dephasing, both of them being independent of the pumping time scale. The overall pumping reflects an interplay of the band topology, initial state populations, initial state coherence, and dephasing. Theoretical results are carefully checked in a Chern insulator model coupled to a pure-dephasing environment, providing a useful starting point to understand and coherently control quantum adiabatic pumping in general situations.
Calarco, T.; Datta, A.; Fedichev, P.; Zoller, P.; Pazy, E.
2003-07-01
We present an all-optical implementation of quantum computation using semiconductor quantum dots. Quantum memory is represented by the spin of an excess electron stored in each dot. Two-qubit gates are realized by switching on trion-trion interactions between different dots. State selectivity is achieved via conditional laser excitation exploiting Pauli exclusion principle. Read out is performed via a quantum-jump technique. We analyze the effect on our scheme's performance of the main imperfections present in real quantum dots: exciton decay, hole mixing, and phonon decoherence. We introduce an adiabatic gate procedure that allows one to circumvent these effects and evaluate quantitatively its fidelity.
ADIABATIC MASS LOSS IN BINARY STARS. I. COMPUTATIONAL METHOD
Ge Hongwei; Chen Xuefei; Han Zhanwen; Webbink, Ronald F. E-mail: mshjell@gmail.co
2010-07-10
The asymptotic response of donor stars in interacting binary systems to very rapid mass loss is characterized by adiabatic expansion throughout their interiors. In this limit, energy generation and heat flow through the stellar interior can be neglected. We model this response by constructing model sequences, beginning with a donor star filling its Roche lobe at an arbitrary point in its evolution, holding its specific entropy and composition profiles fixed as mass is removed from the surface. The stellar interior remains in hydrostatic equilibrium. Luminosity profiles in these adiabatic models of mass-losing stars can be reconstructed from the specific entropy profiles and their gradients. These approximations are validated by comparison with time-dependent binary mass transfer calculations. We describe how adiabatic mass-loss sequences can be used to quantify threshold conditions for dynamical timescale mass transfer, and to establish the range of post-common envelope binaries that are allowed energetically. In dynamical timescale mass transfer, the adiabatic response of the donor star drives it to expand beyond its Roche lobe, leading to runaway mass transfer and the formation of a common envelope with its companion star. For donor stars with surface convection zones of any significant depth, this runaway condition is encountered early in mass transfer, if at all; but for main-sequence stars with radiative envelopes, it may be encountered after a prolonged phase of thermal timescale mass transfer, a so-called delayed dynamical instability. We identify the critical binary mass ratio for the onset of dynamical timescale mass transfer as that ratio for which the adiabatic response of the donor star radius to mass loss matches that of its Roche lobe at some point during mass transfer; if the ratio of donor to accretor masses exceeds this critical value, dynamical timescale mass transfer ensues. In common envelope evolution, the dissipation of orbital energy of the
Quantum computers: Definition and implementations
Perez-Delgado, Carlos A.; Kok, Pieter
2011-01-15
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.
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.
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.
Quantum computing on encrypted data.
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. PMID:24445949
Quantum Computing's Classical Problem, Classical Computing's Quantum Problem
NASA Astrophysics Data System (ADS)
Van Meter, Rodney
2014-08-01
Tasked with the challenge to build better and better computers, quantum computing and classical computing face the same conundrum: the success of classical computing systems. Small quantum computing systems have been demonstrated, and intermediate-scale systems are on the horizon, capable of calculating numeric results or simulating physical systems far beyond what humans can do by hand. However, to be commercially viable, they must surpass what our wildly successful, highly advanced classical computers can already do. At the same time, those classical computers continue to advance, but those advances are now constrained by thermodynamics, and will soon be limited by the discrete nature of atomic matter and ultimately quantum effects. Technological advances benefit both quantum and classical machinery, altering the competitive landscape. Can we build quantum computing systems that out-compute classical systems capable of some logic gates per month? This article will discuss the interplay in these competing and cooperating technological trends.
Quantum computing with defects.
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. PMID:20404195
Adiabatic path to fractional quantum Hall states of a few bosonic atoms
Popp, M.; Paredes, B.; Cirac, J.I.
2004-11-01
We propose a realistic scheme to create motionally entangled states of a few bosonic atoms. It can experimentally be realized with a gas of ultracold bosonic atoms trapped in a deep optical lattice potential. By simultaneously deforming and rotating the trapping potential on each lattice site it is feasible to adiabatically create a variety of entangled states on each lattice well. We fully address the case of N=2 and 4 atoms per well and identify a sequence of fractional quantum Hall states: the Pfaffian state, the 1/2-Laughlin quasiparticle, and the 1/2-Laughlin state. Exact knowledge of the spectrum has allowed us to design adiabatic paths to these states, with all times and parameters well within the reach of current experimental setups. We further discuss the detection of these states by measuring different properties as their density profile, angular momentum, or correlation functions.
Holonomic quantum computation on microwave photons with all resonant interactions
NASA Astrophysics Data System (ADS)
Dong, Ping; Yu, Long-Bao; Zhou, Jian
2016-08-01
The intrinsic difficulties of holonomic quantum computation on superconducting circuits are originated from the use of three levels in superconducting transmon qubits and the complicated dispersive interaction between them. Due to the limited anharmonicity of transmon qubits, the experimental realization seems to be very challenging. However, with recent experimental progress, coherent control over microwave photons in superconducting circuit cavities is well achieved, and thus provides a promising platform for quantum information processing with photonic qubits. Here, with all resonant inter-cavity photon–photon interactions, we propose a scheme for implementing scalable holonomic quantum computation on a circuit QED lattice. In our proposal, three cavities, connected by a SQUID, are used to encode a logical qubit. By tuning the inter-cavity photon–photon interaction, we can construct all the holonomies needed for universal quantum computation in a non-adiabatic way. Therefore, our scheme presents a promising alternative for robust quantum computation with microwave photons.
Regular and Irregular Correspondences ---Adiabatic Invariants in Classical and Quantum Mechanics---
NASA Astrophysics Data System (ADS)
Reinhardt, W. P.
We outline a rather extraordinary series of similarities between classical and quantal behavior in the limit of adiabatic time changes. These include the power laws for the goodness of the respective invariants for isolated eigenstates and invariant tori for integrable systems, the nature of the breakdown of the invariances--level crossing in quantum systems and the role of ever present non-linear resonances is examined in the case of generically non-integrable classical dynamics--and the perhaps surprising relationship for fully chaotic systems where sufficiently slow switching in either classical or quantal systems precisely preserves the number of energy levels up to a given energy. For suitably small values of Planck's constant these similarities yield clear examples of the Bohr correspondence principle linking classical and quantum mechanics; for larger values the details in the classical picture are quenched in the quantum.
Universal quantum computation by discontinuous quantum walk
Underwood, Michael S.; Feder, David L.
2010-10-15
Quantum walks are the quantum-mechanical analog of random walks, in which a quantum ''walker'' evolves between initial and final states by traversing the edges of a graph, either in discrete steps from node to node or via continuous evolution under the Hamiltonian furnished by the adjacency matrix of the graph. We present a hybrid scheme for universal quantum computation in which a quantum walker takes discrete steps of continuous evolution. This ''discontinuous'' quantum walk employs perfect quantum-state transfer between two nodes of specific subgraphs chosen to implement a universal gate set, thereby ensuring unitary evolution without requiring the introduction of an ancillary coin space. The run time is linear in the number of simulated qubits and gates. The scheme allows multiple runs of the algorithm to be executed almost simultaneously by starting walkers one time step apart.
Zhang, Z; Duan, L-M
2013-11-01
We propose a method to generate massive entanglement in a spinor Bose-Einstein condensate from an initial product state through an adiabatic sweep of the magnetic field across a quantum phase transition induced by competition between the spin-dependent collision interaction and the quadratic Zeeman effect. The generated many-body entanglement is characterized by the experimentally measurable entanglement depth in the proximity of the Dicke state. We show that the scheme is robust to practical noise and experimental imperfection and under realistic conditions it is possible to generate genuine entanglement for hundreds of atoms. PMID:24237490
Implementation of a quantum adiabatic algorithm for factorization on two qudits
Zobov, V. E. Ermilov, A. S.
2012-06-15
Implementation of an adiabatic quantum algorithm for factorization on two qudits with the number of levels d{sub 1} and d{sub 2} is considered. A method is proposed for obtaining a time-dependent effective Hamiltonian by means of a sequence of rotation operators that are selective with respect to the transitions between neighboring levels of a qudit. A sequence of RF magnetic field pulses is obtained, and a factorization of the numbers 35, 21, and 15 is numerically simulated on two quadrupole nuclei with spins 3/2 (d{sub 1} = 4) and 1 (d{sub 2} = 3).
Parallelizable adiabatic gate teleportation
NASA Astrophysics Data System (ADS)
Nakago, Kosuke; Hajdušek, Michal; Nakayama, Shojun; Murao, Mio
2015-12-01
To investigate how a temporally ordered gate sequence can be parallelized in adiabatic implementations of quantum computation, we modify adiabatic gate teleportation, a model of quantum computation proposed by Bacon and Flammia [Phys. Rev. Lett. 103, 120504 (2009), 10.1103/PhysRevLett.103.120504], to a form deterministically simulating parallelized gate teleportation, which is achievable only by postselection. We introduce a twisted Heisenberg-type interaction Hamiltonian, a Heisenberg-type spin interaction where the coordinates of the second qubit are twisted according to a unitary gate. We develop parallelizable adiabatic gate teleportation (PAGT) where a sequence of unitary gates is performed in a single step of the adiabatic process. In PAGT, numeric calculations suggest the necessary time for the adiabatic evolution implementing a sequence of L unitary gates increases at most as O (L5) . However, we show that it has the interesting property that it can map the temporal order of gates to the spatial order of interactions specified by the final Hamiltonian. Using this property, we present a controlled-PAGT scheme to manipulate the order of gates by a control qubit. In the controlled-PAGT scheme, two differently ordered sequential unitary gates F G and G F are coherently performed depending on the state of a control qubit by simultaneously applying the twisted Heisenberg-type interaction Hamiltonians implementing unitary gates F and G . We investigate why the twisted Heisenberg-type interaction Hamiltonian allows PAGT. We show that the twisted Heisenberg-type interaction Hamiltonian has an ability to perform a transposed unitary gate by just modifying the space ordering of the final Hamiltonian implementing a unitary gate in adiabatic gate teleportation. The dynamics generated by the time-reversed Hamiltonian represented by the transposed unitary gate enables deterministic simulation of a postselected event of parallelized gate teleportation in adiabatic
Communication Capacity of Quantum Computation
NASA Astrophysics Data System (ADS)
Bose, S.; Rallan, L.; Vedral, V.
2000-12-01
By considering quantum computation as a communication process, we relate its efficiency to its classical communication capacity. This formalism allows us to derive lower bounds on the complexity of search algorithms in the most general context. It enables us to link the mixedness of a quantum computer to its efficiency and also allows us to derive the critical level of mixedness beyond which there is no quantum advantage in computation.
Benabbas, Abdelkrim; Salna, Bridget; Sage, J. Timothy; Champion, Paul M.
2015-03-21
Analytical models describing the temperature dependence of the deep tunneling rate, useful for proton, hydrogen, or hydride transfer in proteins, are developed and compared. Electronically adiabatic and non-adiabatic expressions are presented where the donor-acceptor (D-A) motion is treated either as a quantized vibration or as a classical “gating” distribution. We stress the importance of fitting experimental data on an absolute scale in the electronically adiabatic limit, which normally applies to these reactions, and find that vibrationally enhanced deep tunneling takes place on sub-ns timescales at room temperature for typical H-bonding distances. As noted previously, a small room temperature kinetic isotope effect (KIE) does not eliminate deep tunneling as a major transport channel. The quantum approach focuses on the vibrational sub-space composed of the D-A and hydrogen atom motions, where hydrogen bonding and protein restoring forces quantize the D-A vibration. A Duschinsky rotation is mandated between the normal modes of the reactant and product states and the rotation angle depends on the tunneling particle mass. This tunnel-mass dependent rotation contributes substantially to the KIE and its temperature dependence. The effect of the Duschinsky rotation is solved exactly to find the rate in the electronically non-adiabatic limit and compared to the Born-Oppenheimer (B-O) approximation approach. The B-O approximation is employed to find the rate in the electronically adiabatic limit, where we explore both harmonic and quartic double-well potentials for the hydrogen atom bound states. Both the electronically adiabatic and non-adiabatic rates are found to diverge at high temperature unless the proton coupling includes the often neglected quadratic term in the D-A displacement from equilibrium. A new expression is presented for the electronically adiabatic tunnel rate in the classical limit for D-A motion that should be useful to experimentalists working
Benabbas, Abdelkrim; Salna, Bridget; Sage, J Timothy; Champion, Paul M
2015-03-21
Analytical models describing the temperature dependence of the deep tunneling rate, useful for proton, hydrogen, or hydride transfer in proteins, are developed and compared. Electronically adiabatic and non-adiabatic expressions are presented where the donor-acceptor (D-A) motion is treated either as a quantized vibration or as a classical "gating" distribution. We stress the importance of fitting experimental data on an absolute scale in the electronically adiabatic limit, which normally applies to these reactions, and find that vibrationally enhanced deep tunneling takes place on sub-ns timescales at room temperature for typical H-bonding distances. As noted previously, a small room temperature kinetic isotope effect (KIE) does not eliminate deep tunneling as a major transport channel. The quantum approach focuses on the vibrational sub-space composed of the D-A and hydrogen atom motions, where hydrogen bonding and protein restoring forces quantize the D-A vibration. A Duschinsky rotation is mandated between the normal modes of the reactant and product states and the rotation angle depends on the tunneling particle mass. This tunnel-mass dependent rotation contributes substantially to the KIE and its temperature dependence. The effect of the Duschinsky rotation is solved exactly to find the rate in the electronically non-adiabatic limit and compared to the Born-Oppenheimer (B-O) approximation approach. The B-O approximation is employed to find the rate in the electronically adiabatic limit, where we explore both harmonic and quartic double-well potentials for the hydrogen atom bound states. Both the electronically adiabatic and non-adiabatic rates are found to diverge at high temperature unless the proton coupling includes the often neglected quadratic term in the D-A displacement from equilibrium. A new expression is presented for the electronically adiabatic tunnel rate in the classical limit for D-A motion that should be useful to experimentalists working near
NASA Astrophysics Data System (ADS)
Benabbas, Abdelkrim; Salna, Bridget; Sage, J. Timothy; Champion, Paul M.
2015-03-01
Analytical models describing the temperature dependence of the deep tunneling rate, useful for proton, hydrogen, or hydride transfer in proteins, are developed and compared. Electronically adiabatic and non-adiabatic expressions are presented where the donor-acceptor (D-A) motion is treated either as a quantized vibration or as a classical "gating" distribution. We stress the importance of fitting experimental data on an absolute scale in the electronically adiabatic limit, which normally applies to these reactions, and find that vibrationally enhanced deep tunneling takes place on sub-ns timescales at room temperature for typical H-bonding distances. As noted previously, a small room temperature kinetic isotope effect (KIE) does not eliminate deep tunneling as a major transport channel. The quantum approach focuses on the vibrational sub-space composed of the D-A and hydrogen atom motions, where hydrogen bonding and protein restoring forces quantize the D-A vibration. A Duschinsky rotation is mandated between the normal modes of the reactant and product states and the rotation angle depends on the tunneling particle mass. This tunnel-mass dependent rotation contributes substantially to the KIE and its temperature dependence. The effect of the Duschinsky rotation is solved exactly to find the rate in the electronically non-adiabatic limit and compared to the Born-Oppenheimer (B-O) approximation approach. The B-O approximation is employed to find the rate in the electronically adiabatic limit, where we explore both harmonic and quartic double-well potentials for the hydrogen atom bound states. Both the electronically adiabatic and non-adiabatic rates are found to diverge at high temperature unless the proton coupling includes the often neglected quadratic term in the D-A displacement from equilibrium. A new expression is presented for the electronically adiabatic tunnel rate in the classical limit for D-A motion that should be useful to experimentalists working near
Spin Glass a Bridge Between Quantum Computation and Statistical Mechanics
NASA Astrophysics Data System (ADS)
Ohzeki, Masayuki
2013-09-01
quantum annealing. The most typical instance is quantum adiabatic computation based on the adiabatic theorem. The quantum adiabatic computation as discussed in the other chapter, unfortunately, has a crucial bottleneck for a part of the optimization problems. We here introduce several recent trials to overcome such a weakpoint by use of developments in statistical mechanics. Through both of the topics, we would shed light on the birth of the interdisciplinary field between quantum mechanics and statistical mechanics.
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.
Adiabatic Edge Channel Transport in a Nanowire Quantum Point Contact Register.
Heedt, S; Manolescu, A; Nemnes, G A; Prost, W; Schubert, J; Grützmacher, D; Schäpers, Th
2016-07-13
We report on a prototype device geometry where a number of quantum point contacts are connected in series in a single quasi-ballistic InAs nanowire. At finite magnetic field the backscattering length is increased up to the micron-scale and the quantum point contacts are connected adiabatically. Hence, several input gates can control the outcome of a ballistic logic operation. The absence of backscattering is explained in terms of selective population of spatially separated edge channels. Evidence is provided by regular Aharonov-Bohm-type conductance oscillations in transverse magnetic fields, in agreement with magnetoconductance calculations. The observation of the Shubnikov-de Haas effect at large magnetic fields corroborates the existence of spatially separated edge channels and provides a new means for nanowire characterization. PMID:27347816
Kadmensky, S. G.
2007-09-15
In the framework of the quantum theory of spontaneous and low-energy induced fission, the nature of quantum and thermodynamical properties of a fissioning system is analyzed taking into account adiabatic and nonadiabatic modes of motion for different fission stages. It is shown that, owing to the influence of the Coriolis interaction, the states of the fissile nucleus and of primary fission products are cold and strongly nonequilibrium. The important role of superfluid and pairing nucleon-nucleon correlations for binary and ternary fission is demonstrated. The mechanism of pumping of high values of relative orbital momenta and spins of fission fragments for binary and ternary fission and the nonevaporation mechanism of formation of third particles for ternary fission are investigated. The anisotropies and P-odd, P-even, and T-odd asymmetries for angular distributions of fission products are analyzed.
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
Hoang, Thai M.; Bharath, Hebbe M.; Boguslawski, Matthew J.; Anquez, Martin; Robbins, Bryce A.; Chapman, Michael S.
2016-01-01
Spontaneous symmetry breaking occurs in a physical system whenever the ground state does not share the symmetry of the underlying theory, e.g., the Hamiltonian. This mechanism gives rise to massless Nambu–Goldstone modes and massive Anderson–Higgs modes. These modes provide a fundamental understanding of matter in the Universe and appear as collective phase or amplitude excitations of an order parameter in a many-body system. The amplitude excitation plays a crucial role in determining the critical exponents governing universal nonequilibrium dynamics in the Kibble–Zurek mechanism (KZM). Here, we characterize the amplitude excitations in a spin-1 condensate and measure the energy gap for different phases of the quantum phase transition. At the quantum critical point of the transition, finite-size effects lead to a nonzero gap. Our measurements are consistent with this prediction, and furthermore, we demonstrate an adiabatic quench through the phase transition, which is forbidden at the mean field level. This work paves the way toward generating entanglement through an adiabatic phase transition. PMID:27503886
Hoang, Thai M; Bharath, Hebbe M; Boguslawski, Matthew J; Anquez, Martin; Robbins, Bryce A; Chapman, Michael S
2016-08-23
Spontaneous symmetry breaking occurs in a physical system whenever the ground state does not share the symmetry of the underlying theory, e.g., the Hamiltonian. This mechanism gives rise to massless Nambu-Goldstone modes and massive Anderson-Higgs modes. These modes provide a fundamental understanding of matter in the Universe and appear as collective phase or amplitude excitations of an order parameter in a many-body system. The amplitude excitation plays a crucial role in determining the critical exponents governing universal nonequilibrium dynamics in the Kibble-Zurek mechanism (KZM). Here, we characterize the amplitude excitations in a spin-1 condensate and measure the energy gap for different phases of the quantum phase transition. At the quantum critical point of the transition, finite-size effects lead to a nonzero gap. Our measurements are consistent with this prediction, and furthermore, we demonstrate an adiabatic quench through the phase transition, which is forbidden at the mean field level. This work paves the way toward generating entanglement through an adiabatic phase transition. PMID:27503886
Quantum computing with defects
NASA Astrophysics Data System (ADS)
Varley, Joel
2011-03-01
The development of a quantum computer is contingent upon the identification and design of systems for use as qubits, the basic units of quantum information. One of the most promising candidates consists of a defect in diamond known as the nitrogen-vacancy (NV-1) center, since it is an individually-addressable quantum system that can be initialized, manipulated, and measured with high fidelity at room temperature. While the success of the NV-1 stems from its nature as a localized ``deep-center'' point defect, no systematic effort has been made to identify other defects that might behave in a similar way. We provide guidelines for identifying other defect centers with similar 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 systems. To elucidate these points, we compare electronic structure calculations of the NV-1 center in diamond with those of several deep centers in 4H silicon carbide (SiC). Using hybrid functionals, we report formation energies, configuration-coordinate diagrams, and defect-level diagrams to compare and contrast the properties of these defects. We find that the NC VSi - 1 center in SiC, a structural analog of the NV-1 center in diamond, may be a suitable center with very different optical transition energies. We also discuss how the proposed criteria can be translated into guidelines to discover NV analogs in other tetrahedrally coordinated materials. This work was performed in collaboration with J. R. Weber, W. F. Koehl, B. B. Buckley, A. Janotti, C. G. Van de Walle, and D. D. Awschalom. This work was supported by ARO, AFOSR, and NSF.
Quantum Computing: Solving Complex Problems
DiVincenzo, David [IBM Watson Research Center
2009-09-01
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.
Quantum Computing: Solving Complex Problems
DiVincenzo, David
2007-04-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.
Quantum Computing: Solving Complex Problems
DiVincenzo, David
2007-04-11
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.
Preparing ground states of quantum many-body systems on a quantum computer
NASA Astrophysics Data System (ADS)
Poulin, David
2009-03-01
The simulation of quantum many-body systems is a notoriously hard problem in condensed matter physics, but it could easily be handled by a quantum computer [4,1]. There is however one catch: while a quantum computer can naturally implement the dynamics of a quantum system --- i.e. solve Schr"odinger's equation --- there was until now no general method to initialize the computer in a low-energy state of the simulated system. We present a quantum algorithm [5] that can prepare the ground state and thermal states of a quantum many-body system in a time proportional to the square-root of its Hilbert space dimension. This is the same scaling as required by the best known algorithm to prepare the ground state of a classical many-body system on a quantum computer [3,2]. This provides strong evidence that for a quantum computer, preparing the ground state of a quantum system is in the worst case no more difficult than preparing the ground state of a classical system. 1 D. Aharonov and A. Ta-Shma, Adiabatic quantum state generation and statistical zero knowledge, Proc. 35th Annual ACM Symp. on Theo. Comp., (2003), p. 20. F. Barahona, On the computational complexity of ising spin glass models, J. Phys. A. Math. Gen., 15 (1982), p. 3241. C. H. Bennett, E. Bernstein, G. Brassard, and U. Vazirani, Strengths and weaknessess of quantum computing, SIAM J. Comput., 26 (1997), pp. 1510--1523, quant-ph/9701001. S. Lloyd, Universal quantum simulators, Science, 273 (1996), pp. 1073--1078. D. Poulin and P. Wocjan, Preparing ground states of quantum many-body systems on a quantum computer, 2008, arXiv:0809.2705.
The Physics of Quantum Computation
NASA Astrophysics Data System (ADS)
Falci, Giuseppe; Paladino, Elisabette
2015-10-01
Quantum Computation has emerged in the past decades as a consequence of down-scaling of electronic devices to the mesoscopic regime and of advances in the ability of controlling and measuring microscopic quantum systems. QC has many interdisciplinary aspects, ranging from physics and chemistry to mathematics and computer science. In these lecture notes we focus on physical hardware, present day challenges and future directions for design of quantum architectures.
Realization of a holonomic quantum computer in a chain of three-level systems
NASA Astrophysics Data System (ADS)
Gürkan, Zeynep Nilhan; Sjöqvist, Erik
2015-12-01
Holonomic quantum computation is the idea to use non-Abelian geometric phases to implement universal quantum gates that are robust to fluctuations in control parameters. Here, we propose a compact design for a holonomic quantum computer based on coupled three-level systems. The scheme does not require adiabatic evolution and can be implemented in arrays of atoms or ions trapped in tailored standing wave potentials.
Efficient universal blind quantum computation.
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(Jlog2(N)) single-qubit states, where J is the computational depth and N is the number of qubits needed for the computation. PMID:24476238
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(Jlog2(N)) single-qubit states, where J is the computational depth and N is the number of qubits needed for the computation.
Duality quantum computer and the efficient quantum simulations
NASA Astrophysics Data System (ADS)
Wei, Shi-Jie; Long, Gui-Lu
2016-03-01
Duality quantum computing is a new mode of a quantum computer to simulate a moving quantum computer passing through a multi-slit. It exploits the particle wave duality property for computing. A quantum computer with n qubits and a qudit simulates a moving quantum computer with n qubits passing through a d-slit. Duality quantum computing can realize an arbitrary sum of unitaries and therefore a general quantum operator, which is called a generalized quantum gate. All linear bounded operators can be realized by the generalized quantum gates, and unitary operators are just the extreme points of the set of generalized quantum gates. Duality quantum computing provides flexibility and a clear physical picture in designing quantum algorithms, and serves as a powerful bridge between quantum and classical algorithms. In this paper, after a brief review of the theory of duality quantum computing, we will concentrate on the applications of duality quantum computing in simulations of Hamiltonian systems. We will show that duality quantum computing can efficiently simulate quantum systems by providing descriptions of the recent efficient quantum simulation algorithm of Childs and Wiebe (Quantum Inf Comput 12(11-12):901-924, 2012) for the fast simulation of quantum systems with a sparse Hamiltonian, and the quantum simulation algorithm by Berry et al. (Phys Rev Lett 114:090502, 2015), which provides exponential improvement in precision for simulating systems with a sparse Hamiltonian.
Fault-tolerant Holonomic Quantum Computation in Surface Codes
NASA Astrophysics Data System (ADS)
Zheng, Yicong; Brun, Todd; USC QIP Team Team
2015-03-01
We show that universal holonomic quantum computation (HQC) can be achieved by adiabatically deforming the gapped stabilizer Hamiltonian of the surface code, where quantum information is encoded in the degenerate ground space of the system Hamiltonian. We explicitly propose procedures to perform each logical operation, including logical state initialization, logical state measurement, logical CNOT, state injection and distillation,etc. In particular, adiabatic braiding of different types of holes on the surface leads to a topologically protected, non-Abelian geometric logical CNOT. Throughout the computation, quantum information is protected from both small perturbations and low weight thermal excitations by a constant energy gap, and is independent of the system size. Also the Hamiltonian terms have weight at most four during the whole process. The effect of thermal error propagation is considered during the adiabatic code deformation. With the help of active error correction, this scheme is fault-tolerant, in the sense that the computation time can be arbitrarily long for large enough lattice size. It is shown that the frequency of error correction and the physical resources needed can be greatly reduced by the constant energy gap.
Toward a superconducting quantum computer
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. PMID:20431256
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
Diestler, D J
2012-03-22
The Born-Oppenheimer (BO) description of electronically adiabatic molecular processes predicts a vanishing electronic flux density (j(e)),
Wang, Li; Tu, Tao; Gong, Bo; Zhou, Cheng; Guo, Guang-Can
2016-01-01
High fidelity universal gates for quantum bits form an essential ingredient of quantum information processing. In particular, geometric gates have attracted attention because they have a higher intrinsic resistance to certain errors. However, their realization remains a challenge because of the need for complicated quantum control on a multi-level structure as well as meeting the adiabatic condition within a short decoherence time. Here, we demonstrate non-adiabatic quantum operations for a two-level system by applying a well-controlled geometric Landau-Zener-Stückelberg interferometry. By characterizing the gate quality, we also investigate the operation in the presence of realistic dephasing. Furthermore, the result provides an essential model suitable for understanding an interplay of geometric phase and Landau-Zener-Stückelberg process which are well explored separately. PMID:26738875
NASA Astrophysics Data System (ADS)
Wang, Li; Tu, Tao; Gong, Bo; Zhou, Cheng; Guo, Guang-Can
2016-01-01
High fidelity universal gates for quantum bits form an essential ingredient of quantum information processing. In particular, geometric gates have attracted attention because they have a higher intrinsic resistance to certain errors. However, their realization remains a challenge because of the need for complicated quantum control on a multi-level structure as well as meeting the adiabatic condition within a short decoherence time. Here, we demonstrate non-adiabatic quantum operations for a two-level system by applying a well-controlled geometric Landau-Zener-Stückelberg interferometry. By characterizing the gate quality, we also investigate the operation in the presence of realistic dephasing. Furthermore, the result provides an essential model suitable for understanding an interplay of geometric phase and Landau-Zener-Stückelberg process which are well explored separately.
Wang, Li; Tu, Tao; Gong, Bo; Zhou, Cheng; Guo, Guang-Can
2016-01-01
High fidelity universal gates for quantum bits form an essential ingredient of quantum information processing. In particular, geometric gates have attracted attention because they have a higher intrinsic resistance to certain errors. However, their realization remains a challenge because of the need for complicated quantum control on a multi-level structure as well as meeting the adiabatic condition within a short decoherence time. Here, we demonstrate non-adiabatic quantum operations for a two-level system by applying a well-controlled geometric Landau-Zener-Stückelberg interferometry. By characterizing the gate quality, we also investigate the operation in the presence of realistic dephasing. Furthermore, the result provides an essential model suitable for understanding an interplay of geometric phase and Landau-Zener-Stückelberg process which are well explored separately. PMID:26738875
Quantum computation and hidden variables
NASA Astrophysics Data System (ADS)
Aristov, V. V.; Nikulov, A. V.
2008-03-01
Many physicists limit oneself to an instrumentalist description of quantum phenomena and ignore the problems of foundation and interpretation of quantum mechanics. This instrumentalist approach results to "specialization barbarism" and mass delusion concerning the problem, how a quantum computer can be made. The idea of quantum computation can be described within the limits of quantum formalism. But in order to understand how this idea can be put into practice one should realize the question: "What could the quantum formalism describe?", in spite of the absence of an universally recognized answer. Only a realization of this question and the undecided problem of quantum foundations allows to see in which quantum systems the superposition and EPR correlation could be expected. Because of the "specialization barbarism" many authors are sure that Bell proved full impossibility of any hidden-variables interpretation. Therefore it is important to emphasize that in reality Bell has restricted to validity limits of the no-hidden-variables proof and has shown that two-state quantum system can be described by hidden variables. The later means that no experimental result obtained on two-state quantum system can prove the existence of superposition and violation of the realism. One should not assume before unambiguous experimental evidence that any two-state quantum system is quantum bit. No experimental evidence of superposition of macroscopically distinct quantum states and of a quantum bit on base of superconductor structure was obtained for the present. Moreover same experimental results can not be described in the limits of the quantum formalism.
Quantum Lattice Fluctuations in the Charge Density Wave State beyond the Adiabatic Approximation
NASA Astrophysics Data System (ADS)
Shida, Keisuke; Watanabe, Yuko; Gomi, Hiroki; Takahashi, Akira; Tomita, Norikazu
2015-12-01
We have developed a tractable numerical method in which large-amplitude quantum lattice fluctuations can be described beyond the adiabatic approximation using the coherent state representation of phonons. A many-body wave function is constructed by the superposition of direct products of non-orthogonal Slater determinants for electrons and coherent states of phonons. Both orbitals in all the Slater determinants and the amplitudes of all the coherent states are simultaneously optimized. We apply the method to the one-dimensional Su-Schrieffer-Heeger model with the on-site and nearest-neighbor-site Coulomb interactions. It is shown the lattice fluctuations in doped charge density wave (CDW) systems are described by the translational and vibrational motion of lattice solitons. Such lattice solitons induce bond alternation in the doped CDW system while the lattice becomes equidistant in the half-filled CDW system.
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.
Cryptography, quantum computation and trapped ions
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.
Using computer algebra in quantum computation and quantum games
NASA Astrophysics Data System (ADS)
Bolívar, David A.
2011-05-01
Research in contemporary physics is emphasizing the development and evolution of computer systems to facilitate the calculations. Quantum computing is a branch of modern physics is believed promising results for the future, Thanks to the ability of qubits to store more information than a bit. The work of this paper focuses on the simulation of certain quantum algorithms such as the prisoner's dilemma in its quantum version using the MATHEMATICA® software and implementing stochastic version of the software MAPLE ® and the Grover search algorithm that simulates finding a needle in a haystack.
Effect of noise on geometric logic gates for quantum computation
Blais, A.; Tremblay, A.-M.S.
2003-01-01
We introduce the nonadiabatic, or Aharonov-Anandan, geometric phase as a tool for quantum computation and show how this phase on one qubit can be monitored by a second qubit without any dynamical contribution. We also discuss how this geometric phase could be implemented with superconducting charge qubits. While the nonadiabatic geometric phase may circumvent many of the drawbacks related to the adiabatic (Berry) version of geometric gates, we show that the effect of fluctuations of the control parameters on nonadiabatic phase gates is more severe than for the standard dynamic gates. Similarly, fluctuations also affect to a greater extent quantum gates that use the Berry phase instead of the dynamic phase.
Quantum chromodynamics with advanced computing
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.
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
Massively parallel quantum computer simulator
NASA Astrophysics Data System (ADS)
De Raedt, K.; Michielsen, K.; De Raedt, H.; Trieu, B.; Arnold, G.; Richter, M.; Lippert, Th.; Watanabe, H.; Ito, N.
2007-01-01
We describe portable software to simulate universal quantum computers on massive parallel computers. We illustrate the use of the simulation software by running various quantum algorithms on different computer architectures, such as a IBM BlueGene/L, a IBM Regatta p690+, a Hitachi SR11000/J1, a Cray X1E, a SGI Altix 3700 and clusters of PCs running Windows XP. We study the performance of the software by simulating quantum computers containing up to 36 qubits, using up to 4096 processors and up to 1 TB of memory. Our results demonstrate that the simulator exhibits nearly ideal scaling as a function of the number of processors and suggest that the simulation software described in this paper may also serve as benchmark for testing high-end parallel computers.
Chen, Ye-Hong; Xia, Yan; Song, Jie; Chen, Qing-Qin
2015-01-01
Berry’s approach on “transitionless quantum driving” shows how to set a Hamiltonian which drives the dynamics of a system along instantaneous eigenstates of a reference Hamiltonian to reproduce the same final result of an adiabatic process in a shorter time. In this paper, motivated by transitionless quantum driving, we construct shortcuts to adiabatic passage in a three-atom system to create the Greenberger-Horne-Zeilinger states with the help of quantum Zeno dynamics and of non-resonant lasers. The influence of various decoherence processes is discussed by numerical simulation and the result proves that the scheme is fast and robust against decoherence and operational imperfection. PMID:26508283
NASA Astrophysics Data System (ADS)
Heaps, Charles W.; Mazziotti, David A.
2016-08-01
Quantum molecular dynamics requires an accurate representation of the molecular potential energy surface from a minimal number of electronic structure calculations, particularly for nonadiabatic dynamics where excited states are required. In this paper, we employ pseudospectral sampling of time-dependent Gaussian basis functions for the simulation of non-adiabatic dynamics. Unlike other methods, the pseudospectral Gaussian molecular dynamics tests the Schrödinger equation with N Dirac delta functions located at the centers of the Gaussian functions reducing the scaling of potential energy evaluations from O ( N 2 ) to O ( N ) . By projecting the Gaussian basis onto discrete points in space, the method is capable of efficiently and quantitatively describing the nonadiabatic population transfer and intra-surface quantum coherence. We investigate three model systems: the photodissociation of three coupled Morse oscillators, the bound state dynamics of two coupled Morse oscillators, and a two-dimensional model for collinear triatomic vibrational dynamics. In all cases, the pseudospectral Gaussian method is in quantitative agreement with numerically exact calculations. The results are promising for nonadiabatic molecular dynamics in molecular systems where strongly correlated ground or excited states require expensive electronic structure calculations.
Pfaffian States: Quantum Computation
Shrivastava, Keshav N.
2009-09-14
The Pfaffian determinant is sometimes used to multiply the Laughlin's wave function at the half filled Landau level. The square of the Pfaffian gives the ordinary determinant. We find that the Pfaffian wave function leads to four times larger energies and two times faster time. By the same logic, the Pfaffian breaks the supersymmetry of the Dirac equation. By using the spin properties and the Landau levels, we correctly interpret the state with 5/2 filling. The quantum numbers which represent the state vectors are now products of n (Landau level quantum number), l(orbital angular momentum quantum number and the spin, s |n, l, s>. In a circuit, the noise measures the resistivity and hence the charge. The Pfaffian velocity is different from that of the single-particle states and hence it has important consequences in the measurement of the charge of the quasiparticles.
Quantumness, Randomness and Computability
NASA Astrophysics Data System (ADS)
Solis, Aldo; Hirsch, Jorge G.
2015-06-01
Randomness plays a central role in the quantum mechanical description of our interactions. We review the relationship between the violation of Bell inequalities, non signaling and randomness. We discuss the challenge in defining a random string, and show that algorithmic information theory provides a necessary condition for randomness using Borel normality. We close with a view on incomputablity and its implications in physics.
Chao, Fa-An; Byrd, R Andrew
2016-06-15
A new computational strategy is reported that provides a fast approximation of numerical solutions of differential equations in general. The method is demonstrated with the analysis of NMR adiabatic relaxation dispersion experiments to reveal biomolecular dynamics. When an analytical solution to the theoretical equations describing a physical process is not available, the new approach can significantly accelerate the computational speed of the conventional numerical integration up to 10(5) times. NMR adiabatic relaxation dispersion experiments enhanced with optimized proton-decoupled pulse sequences, although extremely powerful, have previously been refractory to quantitative analysis. Both simulations and experimental validation demonstrate detectable "slow" (microsecond to millisecond) conformational exchange rates from 10(2) to 10(5) s(-1). This greatly expanded time-scale range enables the characterization of a wide array of conformational fluctuations for individual residues, which correlate with biomolecular function and were previously inaccessible. Moreover, the new computational method can be potentially generalized for analysis of new types of relaxation dispersion experiments to characterize the various dynamics of biomolecular systems. PMID:27225523
NASA Astrophysics Data System (ADS)
Dorofeev, Dmitry L.; Elfimov, Sergei V.; Zon, Boris A.
2012-02-01
This paper is dedicated to the implementation of a generalized approach for calculating quantum defects in high Rydberg states of polar molecules with an account for the dipole moment of the molecular core and l uncoupling of the Rydberg electron. Adiabatic (Born-Oppenheimer) and nonadiabatic (inverse Born-Oppenheimer) regions of the spectrum are considered. The nonadiabatic case with a nonzero projection of the core momentum on the core axis is considered and is illustrated by the example of the SO molecule.
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
Quantum Computing and Number Theory
NASA Astrophysics Data System (ADS)
Sasaki, Yoshitaka
2013-09-01
The prime factorization can be efficiently solved on a quantum computer. This result was given by Shor in 1994. In the first half of this article, a review of Shor's algorithm with mathematical setups is given. In the second half of this article, the prime number theorem which is an essential tool to understand the distribution of prime numbers is given.
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.
ASCR Workshop on Quantum Computing for Science
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.
General Quantum Interference Principle and Duality Computer
NASA Astrophysics Data System (ADS)
Long, Gui-Lu
2006-05-01
In this article, we propose a general principle of quantum interference for quantum system, and based on this we propose a new type of computing machine, the duality computer, that may outperform in principle both classical computer and the quantum computer. According to the general principle of quantum interference, the very essence of quantum interference is the interference of the sub-waves of the quantum system itself. A quantum system considered here can be any quantum system: a single microscopic particle, a composite quantum system such as an atom or a molecule, or a loose collection of a few quantum objects such as two independent photons. In the duality computer, the wave of the duality computer is split into several sub-waves and they pass through different routes, where different computing gate operations are performed. These sub-waves are then re-combined to interfere to give the computational results. The quantum computer, however, has only used the particle nature of quantum object. In a duality computer, it may be possible to find a marked item from an unsorted database using only a single query, and all NP-complete problems may have polynomial algorithms. Two proof-of-the-principle designs of the duality computer are presented: the giant molecule scheme and the nonlinear quantum optics scheme. We also propose thought experiment to check the related fundamental issues, the measurement efficiency of a partial wave function.
Quantum computing with parafermions
NASA Astrophysics Data System (ADS)
Hutter, Adrian; Loss, Daniel
2016-03-01
Zd parafermions are exotic non-Abelian quasiparticles generalizing Majorana fermions, which correspond to the case d =2 . In contrast to Majorana fermions, braiding of parafermions with d >2 allows one to perform an entangling gate. This has spurred interest in parafermions, and a variety of condensed matter systems have been proposed as potential hosts for them. In this work, we study the computational power of braiding parafermions more systematically. We make no assumptions on the underlying physical model but derive all our results from the algebraical relations that define parafermions. We find a family of 2 d representations of the braid group that are compatible with these relations. The braiding operators derived this way reproduce those derived previously from physical grounds as special cases. We show that if a d -level qudit is encoded in the fusion space of four parafermions, braiding of these four parafermions allows one to generate the entire single-qudit Clifford group (up to phases), for any d . If d is odd, then we show that in fact the entire many-qudit Clifford group can be generated.
A counterexample and a modification to the adiabatic approximation theorem in quantum mechanics
NASA Technical Reports Server (NTRS)
Gingold, H.
1991-01-01
A counterexample to the adiabatic approximation theorem is given when degeneracies are present. A formulation of an alternative version is proposed. A complete asymptotic decomposition for n dimensional self-adjoint Hamiltonian systems is restated and used.
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.
Quantum dissonance and deterministic quantum computation with a single qubit
NASA Astrophysics Data System (ADS)
Ali, Mazhar
2014-11-01
Mixed state quantum computation can perform certain tasks which are believed to be efficiently intractable on a classical computer. For a specific model of mixed state quantum computation, namely, deterministic quantum computation with a single qubit (DQC1), recent investigations suggest that quantum correlations other than entanglement might be responsible for the power of DQC1 model. However, strictly speaking, the role of entanglement in this model of computation was not entirely clear. We provide conclusive evidence that there are instances where quantum entanglement is not present in any part of this model, nevertheless we have advantage over classical computation. This establishes the fact that quantum dissonance (a kind of quantum correlations) present in fully separable (FS) states provide power to DQC1 model.
Geometry of discrete quantum computing
NASA Astrophysics Data System (ADS)
Hanson, Andrew J.; Ortiz, Gerardo; Sabry, Amr; Tai, Yu-Tsung
2013-05-01
Conventional quantum computing entails a geometry based on the description of an n-qubit state using 2n infinite precision complex numbers denoting a vector in a Hilbert space. Such numbers are in general uncomputable using any real-world resources, and, if we have the idea of physical law as some kind of computational algorithm of the universe, we would be compelled to alter our descriptions of physics to be consistent with computable numbers. Our purpose here is to examine the geometric implications of using finite fields Fp and finite complexified fields \\mathbf {F}_{p^2} (based on primes p congruent to 3 (mod4)) as the basis for computations in a theory of discrete quantum computing, which would therefore become a computable theory. Because the states of a discrete n-qubit system are in principle enumerable, we are able to determine the proportions of entangled and unentangled states. In particular, we extend the Hopf fibration that defines the irreducible state space of conventional continuous n-qubit theories (which is the complex projective space \\mathbf {CP}^{2^{n}-1}) to an analogous discrete geometry in which the Hopf circle for any n is found to be a discrete set of p + 1 points. The tally of unit-length n-qubit states is given, and reduced via the generalized Hopf fibration to \\mathbf {DCP}^{2^{n}-1}, the discrete analogue of the complex projective space, which has p^{2^{n}-1} (p-1)\\,\\prod _{k=1}^{n-1} ( p^{2^{k}}+1) irreducible states. Using a measure of entanglement, the purity, we explore the entanglement features of discrete quantum states and find that the n-qubit states based on the complexified field \\mathbf {F}_{p^2} have pn(p - 1)n unentangled states (the product of the tally for a single qubit) with purity 1, and they have pn + 1(p - 1)(p + 1)n - 1 maximally entangled states with purity zero.
Degenerate adiabatic perturbation theory: Foundations and applications
NASA Astrophysics Data System (ADS)
Rigolin, Gustavo; Ortiz, Gerardo
2014-08-01
We present details and expand on the framework leading to the recently introduced degenerate adiabatic perturbation theory [Phys. Rev. Lett. 104, 170406 (2010), 10.1103/PhysRevLett.104.170406], and on the formulation of the degenerate adiabatic theorem, along with its necessary and sufficient conditions [given in Phys. Rev. A 85, 062111 (2012), 10.1103/PhysRevA.85.062111]. We start with the adiabatic approximation for degenerate Hamiltonians that paves the way to a clear and rigorous statement of the associated degenerate adiabatic theorem, where the non-Abelian geometric phase (Wilczek-Zee phase) plays a central role to its quantitative formulation. We then describe the degenerate adiabatic perturbation theory, whose zeroth-order term is the degenerate adiabatic approximation, in its full generality. The parameter in the perturbative power-series expansion of the time-dependent wave function is directly associated to the inverse of the time it takes to drive the system from its initial to its final state. With the aid of the degenerate adiabatic perturbation theory we obtain rigorous necessary and sufficient conditions for the validity of the adiabatic theorem of quantum mechanics. Finally, to illustrate the power and wide scope of the methodology, we apply the framework to a degenerate Hamiltonian, whose closed-form time-dependent wave function is derived exactly, and also to other nonexactly solvable Hamiltonians whose solutions are numerically computed.
Universal computation by multiparticle quantum walk.
Childs, Andrew M; Gosset, David; Webb, Zak
2013-02-15
A quantum walk is a time-homogeneous quantum-mechanical process on a graph defined by analogy to classical random walk. The quantum walker is a particle that moves from a given vertex to adjacent vertices in quantum superposition. We consider a generalization to interacting systems with more than one walker, such as the Bose-Hubbard model and systems of fermions or distinguishable particles with nearest-neighbor interactions, and show that multiparticle quantum walk is capable of universal quantum computation. Our construction could, in principle, be used as an architecture for building a scalable quantum computer with no need for time-dependent control. PMID:23413349
Computational multiqubit tunnelling in programmable quantum annealers.
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
Computational multiqubit tunnelling in programmable quantum annealers
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
Paramagnetic materials and practical algorithmic cooling for NMR quantum computing
NASA Astrophysics Data System (ADS)
Fernandez, Jose M.; Mor, Tal; Weinstein, Yossi
2003-08-01
Algorithmic cooling is a method devised by Boykin, Mor Rowchodhury, Vatan and Vrijen (PNAS Mar '02) for initializing NMR systems in general and NMR quantum computers in particular. The algorithm recursively employs two steps. The first is an adiabatic entropy compression of the computation qubits of the system. The second step is an isothermal heat transfer from the system to the environment through a set of reset qubits that reach thermal relaxation rapidly. To allow experimental algorithmic cooling, the thermalization time of the reset qubits must be much shorter than the thermalization time of the computation qubits. We investigated the effect of the paramagnetic material Chromium Acetylacetonate on the thermalization times of computation qubits (carbons) and reset qubit (hydrogen). We report here the accomplishment of an improved ratio of the thermalization times from T1(H)/T1(C) of approximately 5 to around 15. The magnetic ions from the Chromium Acetylacetonate interact with the reset qubit reducing their thermalization time, while their effect on the less exposed computation qubits is found to be weaker. An experimental demonstrating of non adiabatic cooling by thermalization and magnetic ion is currently performed by our group based on these results.
Universal quantum computation using the discrete-time quantum walk
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.
Nanophotonic quantum computer based on atomic quantum transistor
NASA Astrophysics Data System (ADS)
Andrianov, S. N.; Moiseev, S. A.
2015-10-01
We propose a scheme of a quantum computer based on nanophotonic elements: two buses in the form of nanowaveguide resonators, two nanosized units of multiatom multiqubit quantum memory and a set of nanoprocessors in the form of photonic quantum transistors, each containing a pair of nanowaveguide ring resonators coupled via a quantum dot. The operation modes of nanoprocessor photonic quantum transistors are theoretically studied and the execution of main logical operations by means of them is demonstrated. We also discuss the prospects of the proposed nanophotonic quantum computer for operating in high-speed optical fibre networks.
Layered Architectures for Quantum Computers and Quantum Repeaters
NASA Astrophysics Data System (ADS)
Jones, Nathan C.
This chapter examines how to organize quantum computers and repeaters using a systematic framework known as layered architecture, where machine control is organized in layers associated with specialized tasks. The framework is flexible and could be used for analysis and comparison of quantum information systems. To demonstrate the design principles in practice, we develop architectures for quantum computers and quantum repeaters based on optically controlled quantum dots, showing how a myriad of technologies must operate synchronously to achieve fault-tolerance. Optical control makes information processing in this system very fast, scalable to large problem sizes, and extendable to quantum communication.
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…
Cotton, Stephen J.; Miller, William H.
2013-12-21
A recently described symmetrical windowing methodology [S. J. Cotton and W. H. Miller, J. Phys. Chem. A 117, 7190 (2013)] for quasi-classical trajectory simulations is applied here to the Meyer-Miller [H.-D. Meyer and W. H. Miller, J. Chem. Phys. 70, 3214 (1979)] model for the electronic degrees of freedom in electronically non-adiabatic dynamics. Results generated using this classical approach are observed to be in very good agreement with accurate quantum mechanical results for a variety of test applications, including problems where coherence effects are significant such as the challenging asymmetric spin-boson system.
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.
NASA Astrophysics Data System (ADS)
Fishman, S.; Soffer, A.
2016-07-01
We employ the recently developed multi-time scale averaging method to study the large time behavior of slowly changing (in time) Hamiltonians. We treat some known cases in a new way, such as the Zener problem, and we give another proof of the adiabatic theorem in the gapless case. We prove a new uniform ergodic theorem for slowly changing unitary operators. This theorem is then used to derive the adiabatic theorem, do the scattering theory for such Hamiltonians, and prove some classical propagation estimates and asymptotic completeness.
Zeno effect for quantum computation and control.
Paz-Silva, Gerardo A; Rezakhani, A T; Dominy, Jason M; Lidar, D A
2012-02-24
It is well known that the quantum Zeno effect can protect specific quantum states from decoherence by using projective measurements. Here we combine the theory of weak measurements with stabilizer quantum error correction and detection codes. We derive rigorous performance bounds which demonstrate that the Zeno effect can be used to protect appropriately encoded arbitrary states to arbitrary accuracy while at the same time allowing for universal quantum computation or quantum control. PMID:22463507
Blind topological measurement-based quantum computation
NASA Astrophysics Data System (ADS)
Morimae, Tomoyuki; Fujii, Keisuke
2012-09-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.
Mineo, H.; Kuo, J. L.; Niu, Y. L.; Lin, S. H.; Fujimura, Y.
2015-08-28
The results of application of the quantum-mechanical adiabatic theory to vibrational predissociation (VPD) of water dimers, (H{sub 2}O){sub 2} and (D{sub 2}O){sub 2}, are presented. We consider the VPD processes including the totally symmetric OH mode of the dimer and the bending mode of the fragment. The VPD in the adiabatic representation is induced by breakdown of the vibrational adiabatic approximation, and two types of nonadiabatic coupling matrix elements are involved: one provides the VPD induced by the low-frequency dissociation mode and the other provides the VPD through channel interactions induced by the low-frequency modes. The VPD rate constants were calculated using the Fermi golden rule expression. A closed form for the nonadiabatic transition matrix element between the discrete and continuum states was derived in the Morse potential model. All of the parameters used were obtained from the potential surfaces of the water dimers, which were calculated by the density functional theory procedures. The VPD rate constants for the two processes were calculated in the non-Condon scheme beyond the so-called Condon approximation. The channel interactions in and between the initial and final states were taken into account, and those are found to increase the VPD rates by 3(1) orders of magnitude for the VPD processes in (H{sub 2}O){sub 2} ((D{sub 2}O){sub 2}). The fraction of the bending-excited donor fragments is larger than that of the bending-excited acceptor fragments. The results obtained by quantum-mechanical approach are compared with both experimental and quasi-classical trajectory calculation results.
Contextuality supplies the `magic' for quantum computation
NASA Astrophysics Data System (ADS)
Howard, Mark; Wallman, Joel; Veitch, Victor; Emerson, Joseph
2014-06-01
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.
Contextuality supplies the 'magic' for quantum computation.
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. PMID:24919152
Stimulated Raman adiabatic passage in a three-level superconducting circuit
Kumar, K. S.; Vepsäläinen, A.; Danilin, S.; Paraoanu, G. S.
2016-01-01
The adiabatic manipulation of quantum states is a powerful technique that opened up new directions in quantum engineering—enabling tests of fundamental concepts such as geometrical phases and topological transitions, and holding the promise of alternative models of quantum computation. Here we benchmark the stimulated Raman adiabatic passage for circuit quantum electrodynamics by employing the first three levels of a transmon qubit. In this ladder configuration, we demonstrate a population transfer efficiency >80% between the ground state and the second excited state using two adiabatic Gaussian-shaped control microwave pulses. By doing quantum tomography at successive moments during the Raman pulses, we investigate the transfer of the population in time domain. Furthermore, we show that this protocol can be reversed by applying a third adiabatic pulse, we study a hybrid nondiabatic–adiabatic sequence, and we present experimental results for a quasi-degenerate intermediate level. PMID:26902454
Stimulated Raman adiabatic passage in a three-level superconducting circuit
NASA Astrophysics Data System (ADS)
Kumar, K. S.; Vepsäläinen, A.; Danilin, S.; Paraoanu, G. S.
2016-02-01
The adiabatic manipulation of quantum states is a powerful technique that opened up new directions in quantum engineering--enabling tests of fundamental concepts such as geometrical phases and topological transitions, and holding the promise of alternative models of quantum computation. Here we benchmark the stimulated Raman adiabatic passage for circuit quantum electrodynamics by employing the first three levels of a transmon qubit. In this ladder configuration, we demonstrate a population transfer efficiency >80% between the ground state and the second excited state using two adiabatic Gaussian-shaped control microwave pulses. By doing quantum tomography at successive moments during the Raman pulses, we investigate the transfer of the population in time domain. Furthermore, we show that this protocol can be reversed by applying a third adiabatic pulse, we study a hybrid nondiabatic-adiabatic sequence, and we present experimental results for a quasi-degenerate intermediate level.
Stimulated Raman adiabatic passage in a three-level superconducting circuit.
Kumar, K S; Vepsäläinen, A; Danilin, S; Paraoanu, G S
2016-01-01
The adiabatic manipulation of quantum states is a powerful technique that opened up new directions in quantum engineering--enabling tests of fundamental concepts such as geometrical phases and topological transitions, and holding the promise of alternative models of quantum computation. Here we benchmark the stimulated Raman adiabatic passage for circuit quantum electrodynamics by employing the first three levels of a transmon qubit. In this ladder configuration, we demonstrate a population transfer efficiency >80% between the ground state and the second excited state using two adiabatic Gaussian-shaped control microwave pulses. By doing quantum tomography at successive moments during the Raman pulses, we investigate the transfer of the population in time domain. Furthermore, we show that this protocol can be reversed by applying a third adiabatic pulse, we study a hybrid nondiabatic-adiabatic sequence, and we present experimental results for a quasi-degenerate intermediate level. PMID:26902454
Quantum Computation: Theory, Practice, and Future Prospects
NASA Astrophysics Data System (ADS)
Chuang, Isaac
2000-03-01
Information is physical, and computation obeys physical laws. Ones and zeros -- elementary classical bits of information -- must be represented in physical media to be stored and processed. Traditionally, these objects are well described by classical physics, but increasingly, as we edge towards the limits of semiconductor technology, we reach a new regime where the laws of quantum physics become dominant. Strange new phenomena, like entanglement and quantum coherence, become available as new resources. How can such resources be utilized for computation? What physical systems allow construction and control of quantum phenomena? How is this relevant to future directions in information technology? The theoretical promise of quantum computation is polynomial speedup of searches, and exponentially speedups for other certain problems such as factoring. But the experimental challenge to realize such algorithms in practice is enormous: to date, quantum computers with only a handful of quantum bits have been realized in the laboratory, using electromagnetically trapped ions, and with magnetic resonance techniques. On the other hand, quantum information has been communicated over long distances using single photons. The future of quantum computation is currently subject to intense scrutiny. It may well be that these machines will not be practical. More quantum algorithms must be discovered, and new physical implementations must be realized. Quantum computation and quantum information are young fields with major issues to be overcome, but already, they have forever changed the way we think of the physical world and what can be computed with it.
Wireless adiabatic power transfer
Rangelov, A.A.; Suchowski, H.; Silberberg, Y.; Vitanov, N.V.
2011-03-15
Research Highlights: > Efficient and robust mid-range wireless energy transfer between two coils. > The adiabatic energy transfer is analogous to adiabatic passage in quantum optics. > Wireless energy transfer is insensitive to any resonant constraints. > Wireless energy transfer is insensitive to noise in the neighborhood of the coils. - Abstract: We propose a technique for efficient mid-range wireless power transfer between two coils, by adapting the process of adiabatic passage for a coherently driven two-state quantum system to the realm of wireless energy transfer. The proposed technique is shown to be robust to noise, resonant constraints, and other interferences that exist in the neighborhood of the coils.
Quantum computing. Defining and detecting quantum speedup.
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. PMID:25061205
Prospects for quantum computation with trapped ions
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.
Molecular Realizations of Quantum Computing 2007
NASA Astrophysics Data System (ADS)
Nakahara, Mikio; Ota, Yukihiro; Rahimi, Robabeh; Kondo, Yasushi; Tada-Umezaki, Masahito
2009-06-01
Liquid-state NMR quantum computer: working principle and some examples / Y. Kondo -- Flux qubits, tunable coupling and beyond / A. O. Niskanen -- Josephson phase qubits, and quantum communication via a resonant cavity / M. A. Sillanpää -- Quantum computing using pulse-based electron-nuclear double resonance (ENDOR): molecular spin-qubits / K. Sato ... [et al.] -- Fullerene C[symbol]: a possible molecular quantum computer / T. Wakabayashi -- Molecular magnets for quantum computation / T. Kuroda -- Errors in a plausible scheme of quantum gates in Kane's model / Y. Ota -- Yet another formulation for quantum simultaneous noncooperative bimatrix games / A. SaiToh, R. Rahimi, M. Nakahara -- Continuous-variable teleportation of single-photon states and an accidental cloning of a photonic qubit in two-channel teleportation / T. Ide.
Quantum Computational Logics and Possible Applications
NASA Astrophysics Data System (ADS)
Chiara, Maria Luisa Dalla; Giuntini, Roberto; Leporini, Roberto; di Francia, Giuliano Toraldo
2008-01-01
In quantum computational logics meanings of formulas are identified with quantum information quantities: systems of qubits or, more generally, mixtures of systems of qubits. We consider two kinds of quantum computational semantics: (1) a compositional semantics, where the meaning of a compound formula is determined by the meanings of its parts; (2) a holistic semantics, which makes essential use of the characteristic “holistic” features of the quantum-theoretic formalism. The compositional and the holistic semantics turn out to characterize the same logic. In this framework, one can introduce the notion of quantum-classical truth table, which corresponds to the most natural way for a quantum computer to calculate classical tautologies. Quantum computational logics can be applied to investigate different kinds of semantic phenomena where holistic, contextual and gestaltic patterns play an essential role (from natural languages to musical compositions).
Disciplines, models, and computers: the path to computational quantum chemistry.
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. PMID:25571750
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.
The Heisenberg representation of quantum computers
Gottesman, D.
1998-06-24
Since Shor`s discovery of an algorithm to factor numbers on a quantum computer in polynomial time, quantum computation has become a subject of immense interest. Unfortunately, one of the key features of quantum computers--the difficulty of describing them on classical computers--also makes it difficult to describe and understand precisely what can be done with them. A formalism describing the evolution of operators rather than states has proven extremely fruitful in understanding an important class of quantum operations. States used in error correction and certain communication protocols can be described by their stabilizer, a group of tensor products of Pauli matrices. Even this simple group structure is sufficient to allow a rich range of quantum effects, although it falls short of the full power of quantum computation.
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…
Computational quantum-classical boundary of noisy commuting quantum circuits.
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
Computational quantum-classical boundary of noisy commuting quantum circuits
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
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.
Geometry of Quantum Computation with Qudits
Luo, Ming-Xing; Chen, Xiu-Bo; Yang, Yi-Xian; Wang, Xiaojun
2014-01-01
The circuit complexity of quantum qubit system evolution as a primitive problem in quantum computation has been discussed widely. We investigate this problem in terms of qudit system. Using the Riemannian geometry the optimal quantum circuits are equivalent to the geodetic evolutions in specially curved parametrization of SU(dn). And the quantum circuit complexity is explicitly dependent of controllable approximation error bound. PMID:24509710
NASA Astrophysics Data System (ADS)
Rousseaux, B.; Dzsotjan, D.; Colas des Francs, G.; Jauslin, H. R.; Couteau, C.; Guérin, S.
2016-01-01
We show that the interaction of surface plasmons with quantum emitters can be described by an effective model that has the same structure as a lossy multimode cavity quantum electromagnetic interaction. This allows the coherent manipulation of quantum emitters dressed by surface plasmons at the nanoscale. We show that strong coupling in quantum plasmonics can be used to mediate efficiently the interaction between emitters via a decoherence-free channel, immune to the strong plasmon dissipation. Efficient and robust population transfer, as well as the deterministic generation of entanglement between emitters are numerically shown. These results pave the way for an efficient use of the quantum plasmonic platform beyond its inherent losses.
Determining Ramsey numbers on a quantum computer
NASA Astrophysics Data System (ADS)
Wang, Hefeng
2016-03-01
We present a quantum algorithm for computing the Ramsey numbers whose computational complexity grows superexponentially with the number of vertices of a graph on a classical computer. The problem is mapped to a decision problem on a quantum computer, and a probe qubit is coupled to a register that represents the problem and detects the energy levels of the problem Hamiltonian. The decision problem is solved by detecting the decay dynamics of the probe qubit.
Adiabatic state preparation study of methylene
Veis, Libor Pittner, Jiří
2014-06-07
Quantum computers attract much attention as they promise to outperform their classical counterparts in solving certain type of problems. One of them with practical applications in quantum chemistry is simulation of complex quantum systems. An essential ingredient of efficient quantum simulation algorithms are initial guesses of the exact wave functions with high enough fidelity. As was proposed in Aspuru-Guzik et al. [Science 309, 1704 (2005)], the exact ground states can in principle be prepared by the adiabatic state preparation method. Here, we apply this approach to preparation of the lowest lying multireference singlet electronic state of methylene and numerically investigate preparation of this state at different molecular geometries. We then propose modifications that lead to speeding up the preparation process. Finally, we decompose the minimal adiabatic state preparation employing the direct mapping in terms of two-qubit interactions.
Geometry of the Adiabatic Theorem
ERIC Educational Resources Information Center
Lobo, Augusto Cesar; Ribeiro, Rafael Antunes; Ribeiro, Clyffe de Assis; Dieguez, Pedro Ruas
2012-01-01
We present a simple and pedagogical derivation of the quantum adiabatic theorem for two-level systems (a single qubit) based on geometrical structures of quantum mechanics developed by Anandan and Aharonov, among others. We have chosen to use only the minimum geometric structure needed for the understanding of the adiabatic theorem for this case.…
Experimental demonstration of deterministic one-way quantum computation on a NMR quantum computer
Ju, Chenyong; Zhu Jing; Peng Xinhua; Chong Bo; Zhou Xianyi; Du Jiangfeng
2010-01-15
One-way quantum computing is an important and novel approach to quantum computation. By exploiting the existing particle-particle interactions, we report an experimental realization of the complete process of deterministic one-way quantum Deutsch-Josza algorithm in NMR, including graph state preparation, single-qubit measurements, and feed-forward corrections. The findings in our experiment may shed light on the future scalable one-way quantum computation.
Kaestner, Bernd; Kashcheyevs, Vyacheslavs
2015-10-01
Precise manipulation of individual charge carriers in nanoelectronic circuits underpins practical applications of their most basic quantum property--the universality and invariance of the elementary charge. A charge pump generates a net current from periodic external modulation of parameters controlling a nanostructure connected to source and drain leads; in the regime of quantized pumping the current varies in steps of [Formula: see text] as function of control parameters, where [Formula: see text] is the electron charge and f is the frequency of modulation. In recent years, robust and accurate quantized charge pumps have been developed based on semiconductor quantum dots with tunable tunnel barriers. These devices allow modulation of charge exchange rates between the dot and the leads over many orders of magnitude and enable trapping of a precise number of electrons far away from equilibrium with the leads. The corresponding non-adiabatic pumping protocols focus on understanding of separate parts of the pumping cycle associated with charge loading, capture and release. In this report we review realizations, models and metrology applications of quantized charge pumps based on tunable-barrier quantum dots. PMID:26394066
NASA Astrophysics Data System (ADS)
Kaestner, Bernd; Kashcheyevs, Vyacheslavs
2015-10-01
Precise manipulation of individual charge carriers in nanoelectronic circuits underpins practical applications of their most basic quantum property—the universality and invariance of the elementary charge. A charge pump generates a net current from periodic external modulation of parameters controlling a nanostructure connected to source and drain leads; in the regime of quantized pumping the current varies in steps of {{q}\\text{e}} f as function of control parameters, where {{q}\\text{e}} is the electron charge and f is the frequency of modulation. In recent years, robust and accurate quantized charge pumps have been developed based on semiconductor quantum dots with tunable tunnel barriers. These devices allow modulation of charge exchange rates between the dot and the leads over many orders of magnitude and enable trapping of a precise number of electrons far away from equilibrium with the leads. The corresponding non-adiabatic pumping protocols focus on understanding of separate parts of the pumping cycle associated with charge loading, capture and release. In this report we review realizations, models and metrology applications of quantized charge pumps based on tunable-barrier quantum dots.
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.
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.
Numerical computation for teaching quantum statistics
NASA Astrophysics Data System (ADS)
Price, Tyson; Swendsen, Robert H.
2013-11-01
The study of ideal quantum gases reveals surprising quantum effects that can be observed in macroscopic systems. The properties of bosons are particularly unusual because a macroscopic number of particles can occupy a single quantum state. We describe a computational approach that supplements the usual analytic derivations applicable in the thermodynamic limit. The approach involves directly summing over the quantum states for finite systems and avoids the need for doing difficult integrals. The results display the unusual behavior of quantum gases even for relatively small systems.
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.
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.
Effective pure states for bulk quantum computation
Knill, E.; Chuang, I.; Laflamme, R.
1997-11-01
In bulk quantum computation one can manipulate a large number of indistinguishable quantum computers by parallel unitary operations and measure expectation values of certain observables with limited sensitivity. The initial state of each computer in the ensemble is known but not pure. Methods for obtaining effective pure input states by a series of manipulations have been described by Gershenfeld and Chuang (logical labeling) and Corey et al. (spatial averaging) for the case of quantum computation with nuclear magnetic resonance. We give a different technique called temporal averaging. This method is based on classical randomization, requires no ancilla qubits and can be implemented in nuclear magnetic resonance without using gradient fields. We introduce several temporal averaging algorithms suitable for both high temperature and low temperature bulk quantum computing and analyze the signal to noise behavior of each.
Concatenated codes for fault tolerant quantum computing
Knill, E.; Laflamme, R.; Zurek, W.
1995-05-01
The application of concatenated codes to fault tolerant quantum computing is discussed. We have previously shown that for quantum memories and quantum communication, a state can be transmitted with error {epsilon} provided each gate has error at most c{epsilon}. We show how this can be used with Shor`s fault tolerant operations to reduce the accuracy requirements when maintaining states not currently participating in the computation. Viewing Shor`s fault tolerant operations as a method for reducing the error of operations, we give a concatenated implementation which promises to propagate the reduction hierarchically. This has the potential of reducing the accuracy requirements in long computations.
Hyper-parallel photonic quantum computation with coupled quantum dots
NASA Astrophysics Data System (ADS)
Ren, Bao-Cang; Deng, Fu-Guo
2014-04-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.
Quantum state specific reactant preparation in a molecular beam by rapid adiabatic passage
Chadwick, Helen Hundt, P. Morten; Reijzen, Maarten E. van; Yoder, Bruce L.; Beck, Rainer D.
2014-01-21
Highly efficient preparation of molecules in a specific rovibrationally excited state for gas/surface reactivity measurements is achieved in a molecular beam using tunable infrared (IR) radiation from a single mode continuous wave optical parametric oscillator (cw-OPO). We demonstrate that with appropriate focusing of the IR radiation, molecules in the molecular beam crossing the fixed frequency IR field experience a Doppler tuning that can be adjusted to achieve complete population inversion of a two-level system by rapid adiabatic passage (RAP). A room temperature pyroelectric detector is used to monitor the excited fraction in the molecular beam and the population inversion is detected and quantified using IR bleaching by a second IR-OPO. The second OPO is also used for complete population transfer to an overtone or combination vibration via double resonance excitation using two spatially separated RAP processes.
Quantum state specific reactant preparation in a molecular beam by rapid adiabatic passage
NASA Astrophysics Data System (ADS)
Chadwick, Helen; Hundt, P. Morten; van Reijzen, Maarten E.; Yoder, Bruce L.; Beck, Rainer D.
2014-01-01
Highly efficient preparation of molecules in a specific rovibrationally excited state for gas/surface reactivity measurements is achieved in a molecular beam using tunable infrared (IR) radiation from a single mode continuous wave optical parametric oscillator (cw-OPO). We demonstrate that with appropriate focusing of the IR radiation, molecules in the molecular beam crossing the fixed frequency IR field experience a Doppler tuning that can be adjusted to achieve complete population inversion of a two-level system by rapid adiabatic passage (RAP). A room temperature pyroelectric detector is used to monitor the excited fraction in the molecular beam and the population inversion is detected and quantified using IR bleaching by a second IR-OPO. The second OPO is also used for complete population transfer to an overtone or combination vibration via double resonance excitation using two spatially separated RAP processes.
Quantum state specific reactant preparation in a molecular beam by rapid adiabatic passage.
Chadwick, Helen; Hundt, P Morten; van Reijzen, Maarten E; Yoder, Bruce L; Beck, Rainer D
2014-01-21
Highly efficient preparation of molecules in a specific rovibrationally excited state for gas/surface reactivity measurements is achieved in a molecular beam using tunable infrared (IR) radiation from a single mode continuous wave optical parametric oscillator (cw-OPO). We demonstrate that with appropriate focusing of the IR radiation, molecules in the molecular beam crossing the fixed frequency IR field experience a Doppler tuning that can be adjusted to achieve complete population inversion of a two-level system by rapid adiabatic passage (RAP). A room temperature pyroelectric detector is used to monitor the excited fraction in the molecular beam and the population inversion is detected and quantified using IR bleaching by a second IR-OPO. The second OPO is also used for complete population transfer to an overtone or combination vibration via double resonance excitation using two spatially separated RAP processes. PMID:25669393
One-way quantum computation with circuit quantum electrodynamics
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.
Faster quantum chemistry simulation on fault-tolerant quantum computers
NASA Astrophysics Data System (ADS)
Cody Jones, N.; Whitfield, James D.; McMahon, Peter L.; Yung, Man-Hong; Van Meter, Rodney; Aspuru-Guzik, Alán; Yamamoto, Yoshihisa
2012-11-01
Quantum computers can in principle simulate quantum physics exponentially faster than their classical counterparts, but some technical hurdles remain. We propose methods which substantially improve the performance of a particular form of simulation, ab initio quantum chemistry, on fault-tolerant quantum computers; these methods generalize readily to other quantum simulation problems. Quantum teleportation plays a key role in these improvements and is used extensively as a computing resource. To improve execution time, we examine techniques for constructing arbitrary gates which perform substantially faster than circuits based on the conventional Solovay-Kitaev algorithm (Dawson and Nielsen 2006 Quantum Inform. Comput. 6 81). For a given approximation error ɛ, arbitrary single-qubit gates can be produced fault-tolerantly and using a restricted set of gates in time which is O(log ɛ) or O(log log ɛ) with sufficient parallel preparation of ancillas, constant average depth is possible using a method we call programmable ancilla rotations. Moreover, we construct and analyze efficient implementations of first- and second-quantized simulation algorithms using the fault-tolerant arbitrary gates and other techniques, such as implementing various subroutines in constant time. A specific example we analyze is the ground-state energy calculation for lithium hydride.
Materials Frontiers to Empower Quantum Computing
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.
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.
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…
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.
Iterated Gate Teleportation and Blind Quantum Computation.
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. PMID:26196609
Braid group representation on quantum computation
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.
Delayed commutation in quantum computer networks.
García-Escartín, Juan Carlos; Chamorro-Posada, Pedro
2006-09-15
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. PMID:17025870
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.
Waveguide-QED-Based Photonic Quantum Computation
NASA Astrophysics Data System (ADS)
Zheng, Huaixiu; Gauthier, Daniel J.; Baranger, Harold U.
2013-08-01
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.
Hamiltonian quantum computer in one dimension
NASA Astrophysics Data System (ADS)
Wei, Tzu-Chieh; Liang, John C.
2015-12-01
Quantum computation can be achieved by preparing an appropriate initial product state of qudits and then letting it evolve under a fixed Hamiltonian. The readout is made by measurement on individual qudits at some later time. This approach is called the Hamiltonian quantum computation and it includes, for example, the continuous-time quantum cellular automata and the universal quantum walk. We consider one spatial dimension and study the compromise between the locality k and the local Hilbert space dimension d . For geometrically 2-local (i.e., k =2 ), it is known that d =8 is already sufficient for universal quantum computation but the Hamiltonian is not translationally invariant. As the locality k increases, it is expected that the minimum required d should decrease. We provide a construction of a Hamiltonian quantum computer for k =3 with d =5 . One implication is that simulating one-dimensional chains of spin-2 particles is BQP-complete (BQP denotes "bounded error, quantum polynomial time"). Imposing translation invariance will increase the required d . For this we also construct another 3-local (k =3 ) Hamiltonian that is invariant under translation of a unit cell of two sites but that requires d to be 8.
Shortcut to adiabatic gate teleportation
NASA Astrophysics Data System (ADS)
Santos, Alan C.; Silva, Raphael D.; Sarandy, Marcelo S.
2016-01-01
We introduce a shortcut to the adiabatic gate teleportation model of quantum computation. More specifically, we determine fast local counterdiabatic Hamiltonians able to implement teleportation as a universal computational primitive. In this scenario, we provide the counterdiabatic driving for arbitrary n -qubit gates, which allows to achieve universality through a variety of gate sets. Remarkably, our approach maps the superadiabatic Hamiltonian HSA for an arbitrary n -qubit gate teleportation into the implementation of a rotated superadiabatic dynamics of an n -qubit state teleportation. This result is rather general, with the speed of the evolution only dictated by the quantum speed limit. In particular, we analyze the energetic cost for different Hamiltonian interpolations in the context of the energy-time complementarity.
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
Prospects for quantum computing: Extremely doubtful
NASA Astrophysics Data System (ADS)
Dyakonov, M. I.
2014-09-01
The quantum computer is supposed to process information by applying unitary transformations to 2N complex amplitudes defining the state of N qubits. A useful machine needing N 103 or more, the number of continuous parameters describing the state of a quantum computer at any given moment is at least 21000 10300 which is much greater than the number of protons in the Universe. However, the theorists believe that the feasibility of large-scale quantum computing has been proved via the “threshold theorem”. Like for any theorem, the proof is based on a number of assumptions considered as axioms. However, in the physical world none of these assumptions can be fulfilled exactly. Any assumption can be only approached with some limited precision. So, the rather meaningless “error per qubit per gate” threshold must be supplemented by a list of the precisions with which all assumptions behind the threshold theorem should hold. Such a list still does not exist. The theory also seems to ignore the undesired free evolution of the quantum computer caused by the energy differences of quantum states entering any given superposition. Another important point is that the hypothetical quantum computer will be a system of 103 -106 qubits PLUS an extremely complex and monstrously sophisticated classical apparatus. This huge and strongly nonlinear system will generally exhibit instabilities and chaotic behavior.
Quantum-cellular-automata quantum computing with endohedral fullerenes
NASA Astrophysics Data System (ADS)
Twamley, J.
2003-05-01
We present a scheme to perform universal quantum computation using global addressing techniques as applied to a physical system of endohedrally doped fullerenes. The system consists of an ABAB linear array of group-V endohedrally doped fullerenes. Each molecule spin site consists of a nuclear spin coupled via a hyperfine interaction to an electron spin. The electron spin of each molecule is in a quartet ground state S=3/2. Neighboring molecular electron spins are coupled via a magnetic dipole interaction. We find that an all-electron construction of a quantum cellular automaton is frustrated due to the degeneracy of the electronic transitions. However, we can construct a quantum-cellular-automata quantum computing architecture using these molecules by encoding the quantum information on the nuclear spins while using the electron spins as a local bus. We deduce the NMR and ESR pulses required to execute the basic cellular automaton operation and obtain a rough figure of merit for the number of gate operations per decoherence time. We find that this figure of merit compares well with other physical quantum computer proposals. We argue that the proposed architecture meets well the first four DiVincenzo criteria and we outline various routes toward meeting the fifth criterion: qubit readout.
Classical versus quantum errors in quantum computation of dynamical systems.
Rossini, Davide; Benenti, Giuliano; Casati, Giulio
2004-11-01
We analyze the stability of a quantum algorithm simulating the quantum dynamics of a system with different regimes, ranging from global chaos to integrability. We compare, in these different regimes, the behavior of the fidelity of quantum motion when the system's parameters are perturbed or when there are unitary errors in the quantum gates implementing the quantum algorithm. While the first kind of errors has a classical limit, the second one has no classical analog. It is shown that, whereas in the first case ("classical errors") the decay of fidelity is very sensitive to the dynamical regime, in the second case ("quantum errors") it is almost independent of the dynamical behavior of the simulated system. Therefore, the rich variety of behaviors found in the study of the stability of quantum motion under "classical" perturbations has no correspondence in the fidelity of quantum computation under its natural perturbations. In particular, in this latter case it is not possible to recover the semiclassical regime in which the fidelity decays with a rate given by the classical Lyapunov exponent. PMID:15600737
Qubus ancilla-driven quantum computation
Brown, Katherine Louise; De, Suvabrata; Kendon, Viv; Munro, Bill
2014-12-04
Hybrid matter-optical systems offer a robust, scalable path to quantum computation. Such systems have an ancilla which acts as a bus connecting the qubits. We demonstrate how using a continuous variable qubus as the ancilla provides savings in the total number of operations required when computing with many qubits.
Biologically inspired path to quantum computer
NASA Astrophysics Data System (ADS)
Ogryzko, Vasily; Ozhigov, Yuri
2014-12-01
We describe an approach to quantum computer inspired by the information processing at the molecular level in living cells. It is based on the separation of a small ensemble of qubits inside the living system (e.g., a bacterial cell), such that coherent quantum states of this ensemble remain practically unchanged for a long time. We use the notion of a quantum kernel to describe such an ensemble. Quantum kernel is not strictly connected with certain particles; it permanently exchanges atoms and molecules with the environment, which makes quantum kernel a virtual notion. There are many reasons to expect that the state of quantum kernel of a living system can be treated as the stationary state of some Hamiltonian. While the quantum kernel is responsible for the stability of dynamics at the time scale of cellular life, at the longer inter-generation time scale it can change, varying smoothly in the course of biological evolution. To the first level of approximation, quantum kernel can be described in the framework of qubit modification of Jaynes-Cummings-Hubbard model, in which the relaxation corresponds to the exchange of matter between quantum kernel and the rest of the cell and is represented as Lindblad super-operators.
Transitionless driving on adiabatic search algorithm
Oh, Sangchul; Kais, Sabre
2014-12-14
We study quantum dynamics of the adiabatic search algorithm with the equivalent two-level system. Its adiabatic and non-adiabatic evolution is studied and visualized as trajectories of Bloch vectors on a Bloch sphere. We find the change in the non-adiabatic transition probability from exponential decay for the short running time to inverse-square decay in asymptotic running time. The scaling of the critical running time is expressed in terms of the Lambert W function. We derive the transitionless driving Hamiltonian for the adiabatic search algorithm, which makes a quantum state follow the adiabatic path. We demonstrate that a uniform transitionless driving Hamiltonian, approximate to the exact time-dependent driving Hamiltonian, can alter the non-adiabatic transition probability from the inverse square decay to the inverse fourth power decay with the running time. This may open up a new but simple way of speeding up adiabatic quantum dynamics.
Transitionless driving on adiabatic search algorithm
NASA Astrophysics Data System (ADS)
Oh, Sangchul; Kais, Sabre
2014-12-01
We study quantum dynamics of the adiabatic search algorithm with the equivalent two-level system. Its adiabatic and non-adiabatic evolution is studied and visualized as trajectories of Bloch vectors on a Bloch sphere. We find the change in the non-adiabatic transition probability from exponential decay for the short running time to inverse-square decay in asymptotic running time. The scaling of the critical running time is expressed in terms of the Lambert W function. We derive the transitionless driving Hamiltonian for the adiabatic search algorithm, which makes a quantum state follow the adiabatic path. We demonstrate that a uniform transitionless driving Hamiltonian, approximate to the exact time-dependent driving Hamiltonian, can alter the non-adiabatic transition probability from the inverse square decay to the inverse fourth power decay with the running time. This may open up a new but simple way of speeding up adiabatic quantum dynamics.
Transitionless driving on adiabatic search algorithm.
Oh, Sangchul; Kais, Sabre
2014-12-14
We study quantum dynamics of the adiabatic search algorithm with the equivalent two-level system. Its adiabatic and non-adiabatic evolution is studied and visualized as trajectories of Bloch vectors on a Bloch sphere. We find the change in the non-adiabatic transition probability from exponential decay for the short running time to inverse-square decay in asymptotic running time. The scaling of the critical running time is expressed in terms of the Lambert W function. We derive the transitionless driving Hamiltonian for the adiabatic search algorithm, which makes a quantum state follow the adiabatic path. We demonstrate that a uniform transitionless driving Hamiltonian, approximate to the exact time-dependent driving Hamiltonian, can alter the non-adiabatic transition probability from the inverse square decay to the inverse fourth power decay with the running time. This may open up a new but simple way of speeding up adiabatic quantum dynamics. PMID:25494733
NASA Astrophysics Data System (ADS)
Das, Kunal; Gajdacz, Miroslav; Opatrny, Tomas
2011-05-01
In an optical super-lattice of triple wells, containing two mutually interacting atom species in every cell, we show that one species (A) can be transported from the left well to the right well without ever significantly occupying the central well. This occurs simultaneously in every unit cell in the lattice. We demonstrate that this can be achieved with or without the presence of an atom of the second species (B) in the intermediate well of each cell, thereby allowing species-selective transport that avoids spatial overlap and direct interaction among the two species. Furthermore, by using optimal quantum control, we also demonstrate the lattice-wide parallel implementation of CNOT quantum gates in this configuration by using the presence or absence of an atom B in the central well of each cell as a control bit, and the localization of an atom A in the left well or the right well as the target bit. Supported by a NSF grant PHY-0970012 for Kunal Das, and a Czech Science Foundation grant P205/10/1657 for Tomas Opatrny.
Effective pure states for bulk quantum computation
Knill, E.; Chuang, I.; Laflamme, R.
1998-05-01
In bulk quantum computation one can manipulate a large number of indistinguishable quantum computers by parallel unitary operations and measure expectation values of certain observables with limited sensitivity. The initial state of each computer in the ensemble is known but not pure. Methods for obtaining effective pure input states by a series of manipulations have been described by Gershenfeld and Chuang (logical labeling) [Science {bold 275}, 350 (1997)] and Cory {ital et al.} (spatial averaging) [Proc. Natl. Acad. Sci. USA {bold 94}, 1634 (1997)] for the case of quantum computation with nuclear magnetic resonance. We give a different technique called temporal averaging. This method is based on classical randomization, requires no ancilla quantum bits, and can be implemented in nuclear magnetic resonance without using gradient fields. We introduce several temporal averaging algorithms suitable for both high-temperature and low-temperature bulk quantum computing and analyze the signal-to-noise behavior of each. Most of these algorithms require only a constant multiple of the number of experiments needed by the other methods for creating effective pure states. {copyright} {ital 1998} {ital The American Physical Society}
Quantum computations: algorithms and error correction
NASA Astrophysics Data System (ADS)
Kitaev, A. Yu
1997-12-01
Contents §0. Introduction §1. Abelian problem on the stabilizer §2. Classical models of computations2.1. Boolean schemes and sequences of operations2.2. Reversible computations §3. Quantum formalism3.1. Basic notions and notation3.2. Transformations of mixed states3.3. Accuracy §4. Quantum models of computations4.1. Definitions and basic properties4.2. Construction of various operators from the elements of a basis4.3. Generalized quantum control and universal schemes §5. Measurement operators §6. Polynomial quantum algorithm for the stabilizer problem §7. Computations with perturbations: the choice of a model §8. Quantum codes (definitions and general properties)8.1. Basic notions and ideas8.2. One-to-one codes8.3. Many-to-one codes §9. Symplectic (additive) codes9.1. Algebraic preparation9.2. The basic construction9.3. Error correction procedure9.4. Torus codes §10. Error correction in the computation process: general principles10.1. Definitions and results10.2. Proofs §11. Error correction: concrete procedures11.1. The symplecto-classical case11.2. The case of a complete basis Bibliography
Power of one qumode for quantum computation
NASA Astrophysics Data System (ADS)
Liu, Nana; Thompson, Jayne; Weedbrook, Christian; Lloyd, Seth; Vedral, Vlatko; Gu, Mile; Modi, Kavan
2016-05-01
Although quantum computers are capable of solving problems like factoring exponentially faster than the best-known classical algorithms, determining the resources responsible for their computational power remains unclear. An important class of problems where quantum computers possess an advantage is phase estimation, which includes applications like factoring. We introduce a computational model based on a single squeezed state resource that can perform phase estimation, which we call the power of one qumode. This model is inspired by an interesting computational model known as deterministic quantum computing with one quantum bit (DQC1). Using the power of one qumode, we identify that the amount of squeezing is sufficient to quantify the resource requirements of different computational problems based on phase estimation. In particular, we can use the amount of squeezing to quantitatively relate the resource requirements of DQC1 and factoring. Furthermore, we can connect the squeezing to other known resources like precision, energy, qudit dimensionality, and qubit number. We show the circumstances under which they can likewise be considered good resources.
Universal quantum computation with unlabelled qubits
NASA Astrophysics Data System (ADS)
Severini, Simone
2006-06-01
We show that an nth root of the Walsh-Hadamard transform (obtained from the Hadamard gate and a cyclic permutation of the qubits), together with two diagonal matrices, namely a local qubit-flip (for a fixed but arbitrary qubit) and a non-local phase-flip (for a fixed but arbitrary coefficient), can do universal quantum computation on n qubits. A quantum computation, making use of n qubits and based on these operations, is then a word of variable length, but whose letters are always taken from an alphabet of cardinality three. Therefore, in contrast with other universal sets, no choice of qubit lines is needed for the application of the operations described here. A quantum algorithm based on this set can be interpreted as a discrete diffusion of a quantum particle on a de Bruijn graph, corrected on-the-fly by auxiliary modifications of the phases associated with the arcs.
Semiconductor-inspired superconducting quantum computing
NASA Astrophysics Data System (ADS)
Shim, Yun-Pil
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 present an architecture for superconducting quantum computing based on selective design principles deduced from spin-based systems. We propose 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 especially suited to qubits based on variable super-semi junctions.
Accelerating commutation circuits in quantum computer networks
NASA Astrophysics Data System (ADS)
Jiang, Min; Huang, Xu; Chen, Xiaoping; Zhang, Zeng-ke
2012-12-01
In a high speed and packet-switched quantum computer network, a packet routing delay often leads to traffic jams, becoming a severe bottleneck for speeding up the transmission rate. Based on the delayed commutation circuit proposed in Phys. Rev. Lett. 97, 110502 (2006), we present an improved scheme for accelerating network transmission. For two more realistic scenarios, we utilize the characteristic of a quantum state to simultaneously implement a data switch and transmission that makes it possible to reduce the packet delay and route a qubit packet even before its address is determined. This circuit is further extended to the quantum network for the transmission of the unknown quantum information. The analysis demonstrates that quantum communication technology can considerably reduce the processing delay time and build faster and more efficient packet-switched networks.
Quantum learning in a quantum lattice gas computer
NASA Astrophysics Data System (ADS)
Behrman, Elizabeth; Steck, James
2015-04-01
Quantum lattice gas is the logical generalization of quantum cellular automata. At low energy the dynamics are well described by the Gross-Pitaevskii equation in the mean field limit, which is an effective nonlinear interaction model of a Bose-Einstein condensate. In previous work, we have shown in simulation that both spatial and temporal models of quantum learning computers can be used to ``design'' non-trivial quantum algorithms. The advantages of quantum learning over the usual practice of using quantum gate building blocks are, first, the rapidity with which the problem can be solved, without having to decompose the problem; second, the fact that our technique can be used readily even when the problem, or the operator, is not well understood; and, third, that because the interactions are a natural part of the physical system, connectivity is automatic. The advantage to quantum learning obviously grows with the size and the complexity of the problem. We develop and present our learning algorithm as applied to the mean field lattice gas equation, and present a few preliminary results.
Quantum learning for a quantum lattice gas computer
NASA Astrophysics Data System (ADS)
Behrman, Elizabeth; Steck, James
2015-03-01
Quantum lattice gas is the logical generalization of quantum cellular automata. In low energy the dynamics are well described by the Gross-Pitaevskii equation in the mean field limit, which is an effective nonlinear interaction model of a Bose-Einstein condensate. In previous work, we have shown in simulation that both spatial and temporal models of quantum learning computers can be used to ``design'' non-trivial quantum algorithms. The advantages of quantum learning over the usual practice of using quantum gate building blocks are, first, the rapidity with which the problem can be solved, without having to decompose the problem; second, the fact that our technique can be used readily even when the problem, or the operator, is not well understood; and, third, that because the interactions are a natural part of the physical system, connectivity is automatic. The advantage to quantum learning obviously grows with the size and the complexity of the problem. We develop and present our learning algorithm as applied to the mean field lattice gas equation, and present a few preliminary results.
Entanglement and Quantum Computation: An Overview
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.
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.
Information-theoretic temporal Bell inequality and quantum computation
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.
NASA Technical Reports Server (NTRS)
Borovsky, Joseph E.; Hansen, Paul J.
1991-01-01
The mechanics of the first adiabatic invariant mu of nonrelativistic charged particles in time-dependent magnetic inductions B (t) are studied by means of computer simulations and analytic theory. Linear-ramp magnetic-induction profiles are utilized, as well as hyperbolic-tangent ramps and sine half-wave ramps. The change in mu that results from an induction change Delta B that occurs over a time Delta t is quantified for all values of Delta B and Delta t, as well as for all values of the particle position. It is found that the cases fall into two categories with very different mu behavior: cases in which the change in the magnetic induction occurs over a time Delta t that is exactly equal to an integer number of gyroperiods (textbook case) or cases in which the change in the induction occurs over a time Delta t that is not equal to an integer number of gyroperiods (more general case). In both categories mu is an adiabatic invariant, although the conservation of mu is much poorer in the latter category.
Silicon enhancement mode nanostructures for quantum computing.
Carroll, Malcolm S.
2010-03-01
Development of silicon, enhancement mode nanostructures for solid-state quantum computing will be described. A primary motivation of this research is the recent unprecedented manipulation of single electron spins in GaAs quantum dots, which has been used to demonstrate a quantum bit. Long spin decoherence times are predicted possible in silicon qubits. This talk will focus on silicon enhancement mode quantum dot structures that emulate the GaAs lateral quantum dot qubit but use an enhancement mode field effect transistor (FET) structure. One critical concern for silicon quantum dots that use oxides as insulators in the FET structure is that defects in the metal oxide semiconductor (MOS) stack can produce both detrimental electrostatic and paramagnetic effects on the qubit. Understanding the implications of defects in the Si MOS system is also relevant for other qubit architectures that have nearby dielectric passivated surfaces. Stable, lithographically defined, single-period Coulomb-blockade and single-electron charge sensing in a quantum dot nanostructure using a MOS stack will be presented. A combination of characterization of defects, modeling and consideration of modified approaches that incorporate SiGe or donors provides guidance about the enhancement mode MOS approach for future qubits and quantum circuit micro-architecture.
Trading Classical and Quantum Computational Resources
NASA Astrophysics Data System (ADS)
Bravyi, Sergey; Smith, Graeme; Smolin, John A.
2016-04-01
We propose examples of a hybrid quantum-classical simulation where a classical computer assisted by a small quantum processor can efficiently simulate a larger quantum system. First, we consider sparse quantum circuits such that each qubit participates in O (1 ) two-qubit gates. It is shown that any sparse circuit on n +k qubits can be simulated by sparse circuits on n qubits and a classical processing that takes time 2O (k )poly (n ) . Second, we study Pauli-based computation (PBC), where allowed operations are nondestructive eigenvalue measurements of n -qubit Pauli operators. The computation begins by initializing each qubit in the so-called magic state. This model is known to be equivalent to the universal quantum computer. We show that any PBC on n +k qubits can be simulated by PBCs on n qubits and a classical processing that takes time 2O (k )poly (n ). Finally, we propose a purely classical algorithm that can simulate a PBC on n qubits in a time 2α npoly (n ) , where α ≈0.94 . This improves upon the brute-force simulation method, which takes time 2npoly (n ). Our algorithm exploits the fact that n -fold tensor products of magic states admit a low-rank decomposition into n -qubit stabilizer states.
Theoretical studies for experimental implementation of quantum computing with trapped ions
NASA Astrophysics Data System (ADS)
Yoshimura, Bryce T.
Certain quantum many-body physics problems, such as the transverse field Ising model are intractable on a classical computer, meaning that as the number of particles grows, or spins, the amount of memory and computational time required to solve the problem exactly increases faster than a polynomial behavior. However, quantum simulators are being developed to efficiently solve quantum problems that are intractable via conventional computing. Some of the most successful quantum simulators are based on ion traps. Their success depends on the ability to achieve long coherence time, precise spin control, and high fidelity in state preparation. In this work, I present calculations that characterizes the oblate Paul trap that creates two-dimensional Coulomb crystals in a triangular lattice and phonon modes. We also calculate the spin-spin Ising-like interaction that can be generated in the oblate Paul trap using the same techinques as the linear radiofrequency Paul trap. In addition, I discuss two possible challenges that arise in the Penning trap: the effects of defects ( namely when Be+ → BeH+) and the creation of a more uniform spin-spin Ising-like interaction. We show that most properties are not significantly influenced by the appearance of defects, and that by adding two potentials to the Penning trap a more uniform spin-spin Ising-like interaction can be achieved. Next, I discuss techniques tfor preparing the ground state of the Ising-like Hamiltonian. In particular, we explore the use of the bang-bang protocol to prepare the ground state and compare optimized results to conventional adiabatic ramps ( the exponential and locally adiabatic ramp ). The bang-bang optimization in general outperforms the exponential; however the locally adiabatic ramp consistently is somewhat better. However, compared to the locally adiabatic ramp, the bang-bang optimization is simpler to implement, and it has the advantage of providingrovide a simple procedure for estimating the
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. PMID:22553483
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. PMID:22553483
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…
Towards universal quantum computation through relativistic motion
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
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.
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
A surface code quantum computer in silicon.
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. PMID:26601310
A surface code quantum computer in silicon
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
Universality of computation in real quantum theory
NASA Astrophysics Data System (ADS)
Belenchia, A.; D'Ariano, G. M.; Perinotti, P.
2013-10-01
Recently de la Torre et al. (Phys. Rev. Lett., 109 (2012) 090403) reconstructed Quantum Theory from its local structure on the basis of local discriminability and the existence of a one-parameter group of bipartite transformations containing an entangling gate. This result relies on universality of any entangling gate for quantum computation. Here we prove universality of C-NOT with local gates for Real Quantum Theory (RQT), showing that the universality requirement would not be sufficient for the result, whereas local discriminability and the local qubit structure play a crucial role. For reversible computation, generally an extra rebit is needed for RQT. As a by-product we also provide a short proof of universality of C-NOT for CQT.
Ion photon networks for quantum computing and quantum repeaters
NASA Astrophysics Data System (ADS)
Clark, Susan; Hayes, David; Hucul, David; Inlek, I. Volkan; Monroe, Christopher
2013-03-01
Quantum information based on ion-trap technology is well regarded for its stability, high detection fidelity, and ease of manipulation. Here we demonstrate a proof of principle experiment for scaling this technology to large numbers of ions in separate traps by linking the ions via photons. We give results for entanglement between distant ions via probabilistic photonic gates that is then swapped between ions in the same trap via deterministic Coulombic gates. We report fidelities above 65% and show encouraging preliminary results for the next stage of experimental improvement. Such a system could be used for quantum computing requiring large numbers of qubits or for quantum repeaters requiring the qubits to be separated by large distances.
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.
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.
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.
Hybrid quantum computing: semicloning for general database retrieval
NASA Astrophysics Data System (ADS)
Lanzagorta, Marco; Uhlmann, Jeffrey K.
2005-05-01
Quantum computing (QC) 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 (CC). In particular, QC is able to exploit the special properties of quantum superposition to achieve computational parallelism beyond what can be achieved with parallel CC computers. However, these special properties are not applicable for general computation. Therefore, we propose the use of "hybrid quantum computers" (HQCs) that combine both classical and quantum computing architectures in order to leverage the benefits of both. We demonstrate how an HQC can exploit quantum search to support general database operations more efficiently than is possible with CC. Our solution is based on new quantum results that are of independent significance to the field of quantum computing. More specifically, we demonstrate that the most restrictive implications of the quantum No-Cloning Theorem can be avoided through the use of semiclones.
Yu Longbao; Ye Liu; Zhang Wenhai
2007-09-15
We propose a simple scheme to realize 1{yields}M economical phase-covariant quantum cloning machine (EPQCM) with superconducting quantum interference device (SQUID) qubits. In our scheme, multi-SQUIDs are fixed into a microwave cavity by adiabatic passage for their manipulation. Based on this model, we can realize the EPQCM with high fidelity via adiabatic quantum computation.
NASA Astrophysics Data System (ADS)
Wu, Jin-Lei; Song, Chong; Xu, Jing; Yu, Lin; Ji, Xin; Zhang, Shou
2016-06-01
An efficient scheme is proposed for generating n-qubit Greenberger-Horne-Zeilinger states of n superconducting qubits separated by (n-1 ) coplanar waveguide resonators capacitively via adiabatic passage with the help of quantum Zeno dynamics in one step. In the scheme, it is not necessary to precisely control the time of the whole operation and the Rabi frequencies of classical fields because of the introduction of adiabatic passage. The numerical simulations for three-qubit Greenberger-Horne-Zeilinger state show that the scheme is insensitive to the dissipation of the resonators and the energy relaxation of the superconducting qubits. The three-qubit Greenberger-Horne-Zeilinger state can be deterministically generated with comparatively high fidelity in the current experimental conditions, though the scheme is somewhat sensitive to the dephasing of superconducting qubits.
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.
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
Quantum Computation with Phase Drift Errors
NASA Astrophysics Data System (ADS)
Miquel, César; Paz, Juan Pablo; Zurek, Wojciech Hubert
1997-05-01
We numerically simulate the evolution of an ion trap quantum computer made out of 18 ions subject to a sequence of nearly 15 000 laser pulses in order to find the prime factors of N = 15. We analyze the effect of random and systematic phase drift errors arising from inaccuracies in the laser pulses which induce over (under) rotation of the quantum state. Simple analytic estimates of the tolerance for the quality of driving pulses are presented. We examine the use of watchdog stabilization to partially correct phase drift errors concluding that, in the regime investigated, it is rather inefficient.
Discrete Wigner functions and quantum computational speedup
Galvao, Ernesto F.
2005-04-01
Gibbons et al. [Phys. Rev. A 70, 062101 (2004)] have recently defined a class of discrete Wigner functions W to represent quantum states in a finite Hilbert space dimension d. I characterize the set C{sub d} of states having non-negative W simultaneously in all definitions of W in this class. For d{<=}5 I show C{sub d} is the convex hull of stabilizer states. This supports the conjecture that negativity of W is necessary for exponential speedup in pure-state quantum computation.
Measurement and Information Extraction in Complex Dynamics Quantum Computation
NASA Astrophysics Data System (ADS)
Casati, Giulio; Montangero, Simone
Quantum Information processing has several di.erent applications: some of them can be performed controlling only few qubits simultaneously (e.g. quantum teleportation or quantum cryptography) [1]. Usually, the transmission of large amount of information is performed repeating several times the scheme implemented for few qubits. However, to exploit the advantages of quantum computation, the simultaneous control of many qubits is unavoidable [2]. This situation increases the experimental di.culties of quantum computing: maintaining quantum coherence in a large quantum system is a di.cult task. Indeed a quantum computer is a many-body complex system and decoherence, due to the interaction with the external world, will eventually corrupt any quantum computation. Moreover, internal static imperfections can lead to quantum chaos in the quantum register thus destroying computer operability [3]. Indeed, as it has been shown in [4], a critical imperfection strength exists above which the quantum register thermalizes and quantum computation becomes impossible. We showed such e.ects on a quantum computer performing an e.cient algorithm to simulate complex quantum dynamics [5,6].
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
Scalable Quantum Computing Over the Rainbow
NASA Astrophysics Data System (ADS)
Pfister, Olivier; Menicucci, Nicolas C.; Flammia, Steven T.
2011-03-01
The physical implementation of nontrivial quantum computing is an experimental challenge due to decoherence and the need for scalability. Recently we proved a novel theoretical scheme for realizing a scalable quantum register of very large size, entangled in a cluster state, in the optical frequency comb (OFC) defined by the eigenmodes of a single optical parametric oscillator (OPO). The classical OFC is well known as implemented by the femtosecond, carrier-envelope-phase- and mode-locked lasers which have redefined frequency metrology in recent years. The quantum OFC is a set of harmonic oscillators, or Qmodes, whose amplitude and phase quadratures are continuous variables, the manipulation of which is a mature field for one or two Qmodes. We have shown that the nonlinear optical medium of a single OPO can be engineered, in a sophisticated but already demonstrated manner, so as to entangle in constant time the OPO's OFC into a finitely squeezed, Gaussian cluster state suitable for universal quantum computing over continuous variables. Here we summarize our theoretical result and survey the ongoing experimental efforts in this direction.
Dual field theories of quantum computation
NASA Astrophysics Data System (ADS)
Vanchurin, Vitaly
2016-06-01
Given two quantum states of N q-bits we are interested to find the shortest quantum circuit consisting of only one- and two- q-bit gates that would transfer one state into another. We call it the quantum maze problem for the reasons described in the paper. We argue that in a large N limit the quantum maze problem is equivalent to the problem of finding a semiclassical trajectory of some lattice field theory (the dual theory) on an N +1 dimensional space-time with geometrically flat, but topologically compact spatial slices. The spatial fundamental domain is an N dimensional hyper-rhombohedron, and the temporal direction describes transitions from an arbitrary initial state to an arbitrary target state and so the initial and final dual field theory conditions are described by these two quantum computational states. We first consider a complex Klein-Gordon field theory and argue that it can only be used to study the shortest quantum circuits which do not involve generators composed of tensor products of multiple Pauli Z matrices. Since such situation is not generic we call it the Z-problem. On the dual field theory side the Z-problem corresponds to massless excitations of the phase (Goldstone modes) that we attempt to fix using Higgs mechanism. The simplest dual theory which does not suffer from the massless excitation (or from the Z-problem) is the Abelian-Higgs model which we argue can be used for finding the shortest quantum circuits. Since every trajectory of the field theory is mapped directly to a quantum circuit, the shortest quantum circuits are identified with semiclassical trajectories. We also discuss the complexity of an actual algorithm that uses a dual theory prospective for solving the quantum maze problem and compare it with a geometric approach. We argue that it might be possible to solve the problem in sub-exponential time in 2 N , but for that we must consider the Klein-Gordon theory on curved spatial geometry and/or more complicated (than N -torus
Quantum computing with quantum dots using the Heisenberg exchange interaction
NASA Astrophysics Data System (ADS)
Dewaele, Nick J.
One of the most promising systems for creating a working quantum computer is the triple quantum dots in a linear semiconductor. One of the biggest advantages is that we are able to perform Heisenberg exchange gates on the physical qubits. These exchanges are both fast and relatively low energy. Which means that they would be excellent for producing fast and accurate operations. In order to prevent leakage errors we use a 3 qubit DFS to encode a logical qubit. Here we determine the theoretical time dependent affects of applying the Heisenberg exchange gates in the DFS basis as well as the effect of applying multiple exchange gates at the same time. we also find that applying two heisenberg exchange gates at the same time is an effective way of implementing a leakage elimination operator.
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.
Scalable quantum computer architecture with coupled donor-quantum dot qubits
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.
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.
Universal quantum computation with metaplectic anyons
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.
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
Hard chaos, quantum billiards, and quantum dot computers
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.
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.
Computer simulations to study the effect of adiabatic heating on rod penetration
Reaugh, J.E.
1993-08-01
We use computer simulations to help us understand the experimental observation that depleted uranium (DU) rods penetrate more steel than equal density tungsten alloy (WA) rods, and that this advantage depends on velocity and fineness ratio. Our simulations used thermal softening. Although the DU rods exhibit shear fracture instead, both phenomena result in a loss of hoop strength, and help to keep the projectile residue from interfering with the incoming rod. Our simulations show that rods of DU (or other alloy with strong thermal softening) penetrate more steel than rods of WA (for alloys with little thermal softening), and show velocity and fineness ratio dependencies that are in qualitative agreement with experiment.
Novel systems and methods for quantum communication, quantum computation, and quantum simulation
NASA Astrophysics Data System (ADS)
Gorshkov, Alexey Vyacheslavovich
Precise control over quantum systems can enable the realization of fascinating applications such as powerful computers, secure communication devices, and simulators that can elucidate the physics of complex condensed matter systems. However, the fragility of quantum effects makes it very difficult to harness the power of quantum mechanics. In this thesis, we present novel systems and tools for gaining fundamental insights into the complex quantum world and for bringing practical applications of quantum mechanics closer to reality. We first optimize and show equivalence between a wide range of techniques for storage of photons in atomic ensembles. We describe experiments demonstrating the potential of our optimization algorithms for quantum communication and computation applications. Next, we combine the technique of photon storage with strong atom-atom interactions to propose a robust protocol for implementing the two-qubit photonic phase gate, which is an important ingredient in many quantum computation and communication tasks. In contrast to photon storage, many quantum computation and simulation applications require individual addressing of closely-spaced atoms, ions, quantum dots, or solid state defects. To meet this requirement, we propose a method for coherent optical far-field manipulation of quantum systems with a resolution that is not limited by the wavelength of radiation. While alkali atoms are currently the system of choice for photon storage and many other applications, we develop new methods for quantum information processing and quantum simulation with ultracold alkaline-earth atoms in optical lattices. We show how multiple qubits can be encoded in individual alkaline-earth atoms and harnessed for quantum computing and precision measurements applications. We also demonstrate that alkaline-earth atoms can be used to simulate highly symmetric systems exhibiting spin-orbital interactions and capable of providing valuable insights into strongly
Quantum computation over the butterfly network
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.
NASA Astrophysics Data System (ADS)
Li, Dafa
2016-05-01
The adiabatic theorem was proposed about 90 years ago and has played an important role in quantum physics. The quantitative adiabatic condition constructed from eigenstates and eigenvalues of a Hamiltonian is a traditional tool to estimate adiabaticity and has proven to be the necessary and sufficient condition for adiabaticity. However, recently the condition has become a controversial subject. In this paper, we list some expressions to estimate the validity of the adiabatic approximation. We show that the quantitative adiabatic condition is invalid for the adiabatic approximation via the Euclidean distance between the adiabatic state and the evolution state. Furthermore, we deduce general necessary and sufficient conditions for the validity of the adiabatic approximation by different definitions.
Multiple-server Flexible Blind Quantum Computation in Networks
NASA Astrophysics Data System (ADS)
Kong, Xiaoqin; Li, Qin; Wu, Chunhui; Yu, Fang; He, Jinjun; Sun, Zhiyuan
2016-06-01
Blind quantum computation (BQC) can allow a client with limited quantum power to delegate his quantum computation to a powerful server and still keep his own data private. In this paper, we present a multiple-server flexible BQC protocol, where a client who only needs the ability of accessing qua ntum channels can delegate the computational task to a number of servers. Especially, the client's quantum computation also can be achieved even when one or more delegated quantum servers break down in networks. In other words, when connections to certain quantum servers are lost, clients can adjust flexibly and delegate their quantum computation to other servers. Obviously it is trivial that the computation will be unsuccessful if all servers are interrupted.
Multiple-server Flexible Blind Quantum Computation in Networks
NASA Astrophysics Data System (ADS)
Kong, Xiaoqin; Li, Qin; Wu, Chunhui; Yu, Fang; He, Jinjun; Sun, Zhiyuan
2016-02-01
Blind quantum computation (BQC) can allow a client with limited quantum power to delegate his quantum computation to a powerful server and still keep his own data private. In this paper, we present a multiple-server flexible BQC protocol, where a client who only needs the ability of accessing qua ntum channels can delegate the computational task to a number of servers. Especially, the client's quantum computation also can be achieved even when one or more delegated quantum servers break down in networks. In other words, when connections to certain quantum servers are lost, clients can adjust flexibly and delegate their quantum computation to other servers. Obviously it is trivial that the computation will be unsuccessful if all servers are interrupted.
Possible topological quantum computation via Khovanov homology: D-brane topological quantum computer
NASA Astrophysics Data System (ADS)
Vélez, Mario; Ospina, Juan
2009-05-01
A model of a D-Brane Topological Quantum Computer (DBTQC) is presented and sustained. The model is based on four-dimensional TQFTs of the Donaldson-Witten and Seiber-Witten kinds. It is argued that the DBTQC is able to compute Khovanov homology for knots, links and graphs. The DBTQC physically incorporates the mathematical process of categorification according to which the invariant polynomials for knots, links and graphs such as Jones, HOMFLY, Tutte and Bollobás-Riordan polynomials can be computed as the Euler characteristics corresponding to special homology complexes associated with knots, links and graphs. The DBTQC is conjectured as a powerful universal quantum computer in the sense that the DBTQC computes Khovanov homology which is considered like powerful that the Jones polynomial.
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.
Non-adiabatic generation of NOON states in a Tonks-Girardeau gas
NASA Astrophysics Data System (ADS)
Schloss, James; Benseny, Albert; Gillet, Jérémie; Swain, Jacob; Busch, Thomas
2016-03-01
Adiabatic techniques can be used to control quantum states with high fidelity while exercising limited control over the parameters of a system. However, because these techniques are slow compared to other timescales in the system, they are usually not suitable for creating highly unstable states or performing time-critical processes. Both of these situations arise in quantum information processing, where entangled states may be isolated from the environment only for a short time and where quantum computers require high-fidelity operations to be performed quickly. Recently it has been shown that techniques like optimal control and shortcuts to adiabaticity can be used to prepare quantum states non-adiabatically with high fidelity. Here we present two examples of how these techniques can be used to create maximally entangled many-body NOON states in one-dimensional Tonks-Girardeau gases. Dedicated to the memory of Marvin D Girardeau.
Minimal computational-space implementation of multiround quantum protocols
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.
Semiquantum key distribution with secure delegated quantum computation
NASA Astrophysics Data System (ADS)
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.
Semiquantum key distribution with secure delegated quantum computation.
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
Semiquantum key distribution with secure delegated quantum computation
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
Quantum gates by periodic driving
Shi, Z. C.; Wang, W.; Yi, X. X.
2016-01-01
Topological quantum computation has been extensively studied in the past decades due to its robustness against decoherence. One way to realize the topological quantum computation is by adiabatic evolutions—it requires relatively long time to complete a gate, so the speed of quantum computation slows down. In this work, we present a method to realize single qubit quantum gates by periodic driving. Compared to adiabatic evolution, the single qubit gates can be realized at a fixed time much shorter than that by adiabatic evolution. The driving fields can be sinusoidal or square-well field. With the sinusoidal driving field, we derive an expression for the total operation time in the high-frequency limit, and an exact analytical expression for the evolution operator without any approximations is given for the square well driving. This study suggests that the period driving could provide us with a new direction in regulations of the operation time in topological quantum computation. PMID:26911900
Fast graph operations in quantum computation
NASA Astrophysics Data System (ADS)
Zhao, Liming; Pérez-Delgado, Carlos A.; Fitzsimons, Joseph F.
2016-03-01
The connection between certain entangled states and graphs has been heavily studied in the context of measurement-based quantum computation as a tool for understanding entanglement. Here we show that this correspondence can be harnessed in the reverse direction to yield a graph data structure, which allows for more efficient manipulation and comparison of graphs than any possible classical structure. We introduce efficient algorithms for many transformation and comparison operations on graphs represented as graph states, and prove that no classical data structure can have similar performance for the full set of operations studied.
Quantum computing accelerator I/O : LDRD 52750 final report.
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.
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.
Algorithmic cooling and scalable NMR quantum computers
Boykin, P. Oscar; Mor, Tal; Roychowdhury, Vwani; Vatan, Farrokh; Vrijen, Rutger
2002-01-01
We present here algorithmic cooling (via polarization heat bath)—a powerful method for obtaining a large number of highly polarized spins in liquid nuclear-spin systems at finite temperature. Given that spin-half states represent (quantum) bits, algorithmic cooling cleans dirty bits beyond the Shannon's bound on data compression, by using a set of rapidly thermal-relaxing bits. Such auxiliary bits could be implemented by using spins that rapidly get into thermal equilibrium with the environment, e.g., electron spins. Interestingly, the interaction with the environment, usually a most undesired interaction, is used here to our benefit, allowing a cooling mechanism. Cooling spins to a very low temperature without cooling the environment could lead to a breakthrough in NMR experiments, and our “spin-refrigerating” method suggests that this is possible. The scaling of NMR ensemble computers is currently one of the main obstacles to building larger-scale quantum computing devices, and our spin-refrigerating method suggests that this problem can be resolved. PMID:11904402
Multiple network alignment on quantum computers
NASA Astrophysics Data System (ADS)
Daskin, Anmer; Grama, Ananth; Kais, Sabre
2014-09-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 $k$ graphs as input, alignment algorithms use topological information to assign a similarity score to each $k$-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.
Control aspects of quantum computing using pure and mixed states
Schulte-Herbrüggen, Thomas; Marx, Raimund; Fahmy, Amr; Kauffman, Louis; Lomonaco, Samuel; Khaneja, Navin; Glaser, Steffen J.
2012-01-01
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. PMID:22946034
Measurement-only topological quantum computation via anyonic interferometry
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.
Surface code quantum computing by lattice surgery
NASA Astrophysics Data System (ADS)
Horsman, Clare; Fowler, Austin G.; Devitt, Simon; Van Meter, Rodney
2012-12-01
In recent years, surface codes have become a leading method for quantum error correction in theoretical large-scale computational and communications architecture designs. Their comparatively high fault-tolerant thresholds and their natural two-dimensional nearest-neighbour (2DNN) structure make them an obvious choice for large scale designs in experimentally realistic systems. While fundamentally based on the toric code of Kitaev, there are many variants, two of which are the planar- and defect-based codes. Planar codes require fewer qubits to implement (for the same strength of error correction), but are restricted to encoding a single qubit of information. Interactions between encoded qubits are achieved via transversal operations, thus destroying the inherent 2DNN nature of the code. In this paper we introduce a new technique enabling the coupling of two planar codes without transversal operations, maintaining the 2DNN of the encoded computer. Our lattice surgery technique comprises splitting and merging planar code surfaces, and enables us to perform universal quantum computation (including magic state injection) while removing the need for braided logic in a strictly 2DNN design, and hence reduces the overall qubit resources for logic operations. Those resources are further reduced by the use of a rotated lattice for the planar encoding. We show how lattice surgery allows us to distribute encoded GHZ states in a more direct (and overhead friendly) manner, and how a demonstration of an encoded CNOT between two distance-3 logical states is possible with 53 physical qubits, half of that required in any other known construction in 2D.
Quantum computation of multifractal exponents through the quantum wavelet transform
Garcia-Mata, Ignacio; Giraud, Olivier; Georgeot, Bertrand
2009-05-15
We study the use of the quantum wavelet transform to extract efficiently information about the multifractal exponents for multifractal quantum states. We show that, combined with quantum simulation algorithms, it enables to build quantum algorithms for multifractal exponents with a polynomial gain compared to classical simulations. Numerical results indicate that a rough estimate of fractality could be obtained exponentially fast. Our findings are relevant, e.g., for quantum simulations of multifractal quantum maps and of the Anderson model at the metal-insulator transition.
NASA Astrophysics Data System (ADS)
Diniz, Leonardo G.; Alijah, Alexander; Adamowicz, Ludwik; Mohallem, José R.
2015-07-01
Non-adiabatic vibrational calculations performed with the accuracy of 0.2 cm-1 spanning the whole energy spectrum up to the dissociation limit for 7LiH are reported. A so far unknown v = 23 energy level is predicted. The key feature of the approach used in the calculations is a valence-bond (VB) based procedure for determining the effective masses of the two vibrating atoms, which depend on the internuclear distance, R. It is found that all LiH electrons participate in the vibrational motion. The R-dependent masses are obtained from the analysis of the simple VB two-configuration ionic-covalent representation of the electronic wave function. These findings are consistent with an interpretation of the chemical bond in LiH as a quantum mechanical superposition of one-electron ionic and covalent states.
Computer Visualization of Many-Particle Quantum Dynamics
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.
Computer Visualization of Many-Particle Quantum Dynamics
NASA Astrophysics Data System (ADS)
Ozhigov, A. Y.
2009-03-01
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.
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
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.
A scheme for efficient quantum computation with linear optics
NASA Astrophysics Data System (ADS)
Knill, E.; Laflamme, R.; Milburn, G. J.
2001-01-01
Quantum computers promise to increase greatly the efficiency of solving problems such as factoring large integers, combinatorial optimization and quantum physics simulation. One of the greatest challenges now is to implement the basic quantum-computational elements in a physical system and to demonstrate that they can be reliably and scalably controlled. One of the earliest proposals for quantum computation is based on implementing a quantum bit with two optical modes containing one photon. The proposal is appealing because of the ease with which photon interference can be observed. Until now, it suffered from the requirement for non-linear couplings between optical modes containing few photons. Here we show that efficient quantum computation is possible using only beam splitters, phase shifters, single photon sources and photo-detectors. Our methods exploit feedback from photo-detectors and are robust against errors from photon loss and detector inefficiency. The basic elements are accessible to experimental investigation with current technology.
Gate sequence for continuous variable one-way quantum computation
Su, Xiaolong; Hao, Shuhong; Deng, Xiaowei; Ma, Lingyu; Wang, Meihong; Jia, Xiaojun; Xie, Changde; Peng, Kunchi
2013-01-01
Measurement-based one-way quantum computation using cluster states as resources provides an efficient model to perform computation and information processing of quantum codes. Arbitrary Gaussian quantum computation can be implemented sufficiently by long single-mode and two-mode gate sequences. However, continuous variable gate sequences have not been realized so far due to an absence of cluster states larger than four submodes. Here we present the first continuous variable gate sequence consisting of a single-mode squeezing gate and a two-mode controlled-phase gate based on a six-mode cluster state. The quantum property of this gate sequence is confirmed by the fidelities and the quantum entanglement of two output modes, which depend on both the squeezing and controlled-phase gates. The experiment demonstrates the feasibility of implementing Gaussian quantum computation by means of accessible gate sequences.
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.
Enhanced Fault-Tolerant Quantum Computing in d -Level Systems
NASA Astrophysics Data System (ADS)
Campbell, Earl T.
2014-12-01
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 .
Parallel Photonic Quantum Computation Assisted by Quantum Dots in One-Side Optical Microcavities
NASA Astrophysics Data System (ADS)
Luo, Ming-Xing; Wang, Xiaojun
2014-07-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.
Parallel photonic quantum computation assisted by quantum dots in one-side optical microcavities.
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
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…
Scalable quantum computation via local control of only two qubits
Burgarth, Daniel; Maruyama, Koji; Murphy, Michael; Montangero, Simone; Calarco, Tommaso; Nori, Franco; Plenio, Martin B.
2010-04-15
We apply quantum control techniques to a long spin chain by acting only on two qubits at one of its ends, thereby implementing universal quantum computation by a combination of quantum gates on these qubits and indirect swap operations across the chain. It is shown that the control sequences can be computed and implemented efficiently. We discuss the application of these ideas to physical systems such as superconducting qubits in which full control of long chains is challenging.
Computational Modeling: From Remote Sensing to Quantum Computing
NASA Astrophysics Data System (ADS)
Healy, Dennis
2001-03-01
Recent DARPA investments have contributed to significant advances in numerically sound and computationally efficient physics-based modeling, enabling a wide variety of applications of critical interest to the DoD and Industry. Specific examples may be found in a wide variety of applications ranging from the design and operation of advanced synthetic aperture radar systems to the virtual integrated prototyping of reactors and control loops for the manufacture of thin-film functional material systems. This talk will survey the development and application of well-conditioned fast operators for particular physical problems and their critical contributions to various real world problems. We'll conclude with an indication of how these methods may contribute to exploring the revolutionary potential of quantum information theory.
Demonstration of a small programmable quantum computer with atomic qubits.
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. PMID:27488798
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.
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.
Cluster State Quantum Computation and the Repeat-Until Scheme
NASA Astrophysics Data System (ADS)
Kwek, L. C.
Cluster state computation or the one way quantum computation (1WQC) relies on an initially highly entangled state (called a cluster state) and an appropriate sequence of single qubit measurements along different directions, together with feed-forward based on the measurement results, to realize a quantum computation process. The final result of the computation is obtained by measuring the last remaining qubits in the computational basis. In this short tutorial on cluster state quantum computation, we will also describe the basic ideas of a cluster state and proceed to describe how a single qubit operation can be done on a cluster state. Recently, we proposed a repeat-until-success (RUS) scheme that could effectively be used to realize one-way quantum computer on a hybrid system of photons and atoms. We will briefly describe this RUS scheme and show how it can be used to entangled two distant stationary qubits.
Quantum Monte Carlo Endstation for Petascale Computing
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
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.
The Power of Qutrit Logic for Quantum Computation
NASA Astrophysics Data System (ADS)
Luo, Ming-Xing; Ma, Song-Ya; Chen, Xiu-Bo; Yang, Yi-Xian
2013-08-01
The critical merits acquired from quantum computation require running in parallel, which cannot be benefited from previous multi-level extensions and are exact our purposes. In this paper, with qutrit subsystems the general quantum computation further reduces into qutrit gates or its controlled operations. This extension plays parallizable and integrable with same construction independent of the qutrit numbers. The qutrit swapping as its basic operations for controlling can be integrated into quantum computers with present physical techniques. Our generalizations are free of elevating the system spaces, and feasible for the universal computation.
Secure Multiparty Quantum Computation for Summation and Multiplication
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
Secure Multiparty Quantum Computation for Summation and Multiplication.
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
Computable measure of total quantum correlations of multipartite systems
NASA Astrophysics Data System (ADS)
Behdani, Javad; Akhtarshenas, Seyed Javad; Sarbishaei, Mohsen
2016-04-01
Quantum discord as a measure of the quantum correlations cannot be easily computed for most of density operators. In this paper, we present a measure of the total quantum correlations that is operationally simple and can be computed effectively for an arbitrary mixed state of a multipartite system. The measure is based on the coherence vector of the party whose quantumness is investigated as well as the correlation matrix of this part with the remainder of the system. Being able to detect the quantumness of multipartite systems, such as detecting the quantum critical points in spin chains, alongside with the computability characteristic of the measure, makes it a useful indicator to be exploited in the cases which are out of the scope of the other known measures.
Noisy one-way quantum computations: The role of correlations
Chaves, Rafael; Melo, Fernando de
2011-08-15
A scheme to evaluate computation fidelities within the one-way model is developed and explored to understand the role of correlations in the quality of noisy quantum computations. The formalism is promptly applied to many computation instances and unveils that a higher amount of entanglement in the noisy resource state does not necessarily imply a better computation.
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.
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.
Quantum Nondeterministic Computation based on Statistics Superselection Rules
NASA Astrophysics Data System (ADS)
Castagnoli, G.
Quantum states which obey certain symmetry superselection rules under identical particles permutation can be interpreted as computational states satisfying corresponding Boolean predicates. Given the NP-complete problem of testing the satisfiability of a generic Boolean predicate P, we investigate the possibility of achieving quantum nondeterministic computation by deriving, from P, a physical situation in which the computational states satisfy P iff they satisfy a special fermion statistics.
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.
NASA Astrophysics Data System (ADS)
Barz, Stefanie
2015-04-01
Quantum physics has revolutionized our understanding of information processing and enables computational speed-ups that are unattainable using classical computers. This tutorial reviews the fundamental tools of photonic quantum information processing. The basics of theoretical quantum computing are presented and the quantum circuit model as well as measurement-based models of quantum computing are introduced. Furthermore, it is shown how these concepts can be implemented experimentally using photonic qubits, where information is encoded in the photons’ polarization.
NASA Astrophysics Data System (ADS)
Cao, Zhenwei
Over the years, people have found Quantum Mechanics to be extremely useful in explaining various physical phenomena from a microscopic point of view. Anderson localization, named after physicist P. W. Anderson, states that disorder in a crystal can cause non-spreading of wave packets, which is one possible mechanism (at single electron level) to explain metal-insulator transitions. The theory of quantum computation promises to bring greater computational power over classical computers by making use of some special features of Quantum Mechanics. The first part of this dissertation considers a 3D alloy-type model, where the Hamiltonian is the sum of the finite difference Laplacian corresponding to free motion of an electron and a random potential generated by a sign-indefinite single-site potential. The result shows that localization occurs in the weak disorder regime, i.e., when the coupling parameter lambda is very small, for energies E ≤ --Clambda 2. The second part of this dissertation considers adiabatic quantum computing (AQC) algorithms for the unstructured search problem to the case when the number of marked items is unknown. In an ideal situation, an explicit quantum algorithm together with a counting subroutine are given that achieve the optimal Grover speedup over classical algorithms, i.e., roughly speaking, reduce O(2n) to O(2n/2), where n is the size of the problem. However, if one considers more realistic settings, the result shows this quantum speedup is achievable only under a very rigid control precision requirement (e.g., exponentially small control error).
Fast CNOT gate between two spatially separated atoms via shortcuts to adiabatic passage.
Liang, Yan; Song, Chong; Ji, Xin; Zhang, Shou
2015-09-01
Quantum logic gate is indispensable to quantum computation. One of the important qubit operations is the quantum controlled-not (CNOT) gate that performs a NOT operation on a target qubit depending on the state of the control qubit. In this paper we present a scheme to realize the quantum CNOT gate between two spatially separated atoms via shortcuts to adiabatic passage. The influence of various decoherence processes on the fidelity is discussed. The strict numerical simulation results show that the fidelity for the CNOT gate is relatively high. PMID:26368473
Protecting software agents from malicious hosts using quantum computing
NASA Astrophysics Data System (ADS)
Reisner, John; Donkor, Eric
2000-07-01
We evaluate how quantum computing can be applied to security problems for software agents. Agent-based computing, which merges technological advances in artificial intelligence and mobile computing, is a rapidly growing domain, especially in applications such as electronic commerce, network management, information retrieval, and mission planning. System security is one of the more eminent research areas in agent-based computing, and the specific problem of protecting a mobile agent from a potentially hostile host is one of the most difficult of these challenges. In this work, we describe our agent model, and discuss the capabilities and limitations of classical solutions to the malicious host problem. Quantum computing may be extremely helpful in addressing the limitations of classical solutions to this problem. This paper highlights some of the areas where quantum computing could be applied to agent security.
Time independent universal computing with spin chains: quantum plinko machine
NASA Astrophysics Data System (ADS)
Thompson, K. F.; Gokler, C.; Lloyd, S.; Shor, P. W.
2016-07-01
We present a scheme for universal quantum computing using XY Heisenberg spin chains. Information is encoded into packets propagating down these chains, and they interact with each other to perform universal quantum computation. A circuit using g gate blocks on m qubits can be encoded into chains of length O({g}3+δ {m}3+δ ) for all δ \\gt 0 with vanishingly small error.
Quantum computation for large-scale image classification
NASA Astrophysics Data System (ADS)
Ruan, Yue; Chen, Hanwu; Tan, Jianing; Li, Xi
2016-07-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.
Universal linear Bogoliubov transformations through one-way quantum computation
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.
The geometric approach to quantum correlations: computability versus reliability
NASA Astrophysics Data System (ADS)
Tufarelli, Tommaso; MacLean, Tom; Girolami, Davide; Vasile, Ruggero; Adesso, Gerardo
2013-07-01
We propose a modified metric based on the Hilbert-Schmidt norm and adopt it to define a rescaled version of the geometric measure of quantum discord. Such a measure is found not to suffer from pathological dependence on state purity. Although the employed metric is still non-contractive under quantum operations, we show that the resulting indicator of quantum correlations is in agreement with other bona fide discord measures in a number of physical examples. We present a critical assessment of the requirements of reliability versus computability when approaching the task of quantifying, or measuring, general quantum correlations in a bipartite state.
Continuous-Variable Quantum Computation of Oracle Decision Problems
NASA Astrophysics Data System (ADS)
Adcock, Mark R. A.
Quantum information processing is appealing due its ability to solve certain problems quantitatively faster than classical information processing. Most quantum algorithms have been studied in discretely parameterized systems, but many quantum systems are continuously parameterized. The field of quantum optics in particular has sophisticated techniques for manipulating continuously parameterized quantum states of light, but the lack of a code-state formalism has hindered the study of quantum algorithms in these systems. To address this situation, a code-state formalism for the solution of oracle decision problems in continuously-parameterized quantum systems is developed. Quantum information processing is appealing due its ability to solve certain problems quantitatively faster than classical information processing. Most quantum algorithms have been studied in discretely parameterized systems, but many quantum systems are continuously parameterized. The field of quantum optics in particular has sophisticated techniques for manipulating continuously parameterized quantum states of light, but the lack of a code-state formalism has hindered the study of quantum algorithms in these systems. To address this situation, a code-state formalism for the solution of oracle decision problems in continuously-parameterized quantum systems is developed. In the infinite-dimensional case, we study continuous-variable quantum algorithms for the solution of the Deutsch--Jozsa oracle decision problem implemented within a single harmonic-oscillator. Orthogonal states are used as the computational bases, and we show that, contrary to a previous claim in the literature, this implementation of quantum information processing has limitations due to a position-momentum trade-off of the Fourier transform. We further demonstrate that orthogonal encoding bases are not unique, and using the coherent states of the harmonic oscillator as the computational bases, our formalism enables quantifying
Conduction pathways in microtubules, biological quantum computation, and consciousness.
Hameroff, Stuart; Nip, Alex; Porter, Mitchell; Tuszynski, Jack
2002-01-01
Technological computation is entering the quantum realm, focusing attention on biomolecular information processing systems such as proteins, as presaged by the work of Michael Conrad. Protein conformational dynamics and pharmacological evidence suggest that protein conformational states-fundamental information units ('bits') in biological systems-are governed by quantum events, and are thus perhaps akin to quantum bits ('qubits') as utilized in quantum computation. 'Real time' dynamic activities within cells are regulated by the cell cytoskeleton, particularly microtubules (MTs) which are cylindrical lattice polymers of the protein tubulin. Recent evidence shows signaling, communication and conductivity in MTs, and theoretical models have predicted both classical and quantum information processing in MTs. In this paper we show conduction pathways for electron mobility and possible quantum tunneling and superconductivity among aromatic amino acids in tubulins. The pathways within tubulin match helical patterns in the microtubule lattice structure, which lend themselves to topological quantum effects resistant to decoherence. The Penrose-Hameroff 'Orch OR' model of consciousness is reviewed as an example of the possible utility of quantum computation in MTs. PMID:11755497
QDENSITY/QCWAVE: A Mathematica quantum computer simulation update
NASA Astrophysics Data System (ADS)
Tabakin, Frank
2016-04-01
The Mathematica quantum computer simulation packages QDENSITY and QCWAVE are updated for Mathematica 9-10.3. An overview is given of the new QDensity, QCWave, BTSystem and Circuits packages, which includes: (1) improved treatment of tensor products of states and density matrices, (2) major extension to include qutrit (triplet), as well as qubit (binary) and hybrid qubit/qutrit systems in the associated BTSystem package, (3) updated sample quantum computation algorithms, (4) entanglement studies, including Schmidt decomposition, entropy, mutual information, partial transposition, and calculation of the quantum discord. Examples of Bell's theorem and concurrence are also included. This update will hopefully aid in studies of QC dynamics.
Exponential rise of dynamical complexity in quantum computing through projections
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
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
2015-09-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.
Quantum perceptron over a field and neural network architecture selection in a quantum computer.
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. PMID:26878722
Quantum Computation Based on Photons with Three Degrees of Freedom.
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
Quantum Computation Based on Photons with Three Degrees of Freedom
NASA Astrophysics Data System (ADS)
Luo, Ming-Xing; Li, Hui-Ran; Lai, Hong; Wang, Xiaojun
2016-05-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.
Quantum Computation Based on Photons with Three Degrees of Freedom
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
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…
Quantum Monte Carlo Endstation for Petascale Computing
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
On a Nonlinear Model in Adiabatic Evolutions
NASA Astrophysics Data System (ADS)
Sun, Jie; Lu, Song-Feng
2016-08-01
In this paper, we study a kind of nonlinear model of adiabatic evolution in quantum search problem. As will be seen here, for this problem, there always exists a possibility that this nonlinear model can successfully solve the problem, while the linear model can not. Also in the same setting, when the overlap between the initial state and the final stare is sufficiently large, a simple linear adiabatic evolution can achieve O(1) time efficiency, but infinite time complexity for the nonlinear model of adiabatic evolution is needed. This tells us, it is not always a wise choice to use nonlinear interpolations in adiabatic algorithms. Sometimes, simple linear adiabatic evolutions may be sufficient for using. Supported by the National Natural Science Foundation of China under Grant Nos. 61402188 and 61173050. The first author also gratefully acknowledges the support from the China Postdoctoral Science Foundation under Grant No. 2014M552041
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.
Analysis of an Atom-Optical Architecture for Quantum Computation
NASA Astrophysics Data System (ADS)
Devitt, Simon J.; Stephens, Ashley M.; Munro, William J.; Nemoto, Kae
Quantum technology based on photons has emerged as one of the most promising platforms for quantum information processing, having already been used in proof-of-principle demonstrations of quantum communication and quantum computation. However, the scalability of this technology depends on the successful integration of experimentally feasible devices in an architecture that tolerates realistic errors and imperfections. Here, we analyse an atom-optical architecture for quantum computation designed to meet the requirements of scalability. The architecture is based on a modular atom-cavity device that provides an effective photon-photon interaction, allowing for the rapid, deterministic preparation of a large class of entangled states. We begin our analysis at the physical level, where we outline the experimental cavity quantum electrodynamics requirements of the basic device. Then, we describe how a scalable network of these devices can be used to prepare a three-dimensional topological cluster state, sufficient for universal fault-tolerant quantum computation. We conclude at the application level, where we estimate the system-level requirements of the architecture executing an algorithm compiled for compatibility with the topological cluster state.
Solving strongly correlated electron models on a quantum computer
NASA Astrophysics Data System (ADS)
Wecker, Dave; Hastings, Matthew B.; Wiebe, Nathan; Clark, Bryan K.; Nayak, Chetan; Troyer, Matthias
2015-12-01
One of the main applications of future quantum computers will be the simulation of quantum models. While the evolution of a quantum state under a Hamiltonian is straightforward (if sometimes expensive), using quantum computers to determine the ground-state phase diagram of a quantum model and the properties of its phases is more involved. Using the Hubbard model as a prototypical example, we here show all the steps necessary to determine its phase diagram and ground-state properties on a quantum computer. In particular, we discuss strategies for efficiently determining and preparing the ground state of the Hubbard model starting from various mean-field states with broken symmetry. We present an efficient procedure to prepare arbitrary Slater determinants as initial states and present the complete set of quantum circuits needed to evolve from these to the ground state of the Hubbard model. We show that, using efficient nesting of the various terms, each time step in the evolution can be performed with just O (N ) gates and O (logN ) circuit depth. We give explicit circuits to measure arbitrary local observables and static and dynamic correlation functions, in both the time and the frequency domains. We further present efficient nondestructive approaches to measurement that avoid the need to reprepare the ground state after each measurement and that quadratically reduce the measurement error.
Milestones toward Majorana-based quantum computing
NASA Astrophysics Data System (ADS)
Alicea, Jason
Experiments on nanowire-based Majorana platforms now appear poised to move beyond the preliminary problem of zero-mode detection and towards loftier goals of realizing non-Abelian statistics and quantum information applications. Using an approach that synthesizes recent materials growth breakthroughs with tools long successfully deployed in quantum-dot research, I will outline a number of relatively modest milestones that progressively bridge the gap between the current state of the art and these grand longer-term challenges. The intermediate Majorana experiments surveyed in this talk should be broadly adaptable to other approaches as well. Supported by the National Science Foundation (DMR-1341822), Institute for Quantum Information and Matter, and Walter Burke Institute at Caltech.
A pseudo-spin surface-acoustic-wave quantum computer.
Barnes, C H W
2003-07-15
A modification to the surface-acoustic-wave quantum computer is described. The use of pseudo-spin qubits is introduced as a way to simplify the fabrication and programming of the computer. A form of optical readout that relies on the electrons in each surface-acoustic-wave minimum recombining with holes in a two-dimensional hole gas is suggested as a means to measure the output. The suggested modification would allow the quantum computer to be made smaller and to operate faster. PMID:12869323
Fast non-Abelian geometric gates via transitionless quantum driving
Zhang, J.; Kyaw, Thi Ha; Tong, D. M.; Sjöqvist, Erik; Kwek, Leong-Chuan
2015-01-01
A practical quantum computer must be capable of performing high fidelity quantum gates on a set of quantum bits (qubits). In the presence of noise, the realization of such gates poses daunting challenges. Geometric phases, which possess intrinsic noise-tolerant features, hold the promise for performing robust quantum computation. In particular, quantum holonomies, i.e., non-Abelian geometric phases, naturally lead to universal quantum computation due to their non-commutativity. Although quantum gates based on adiabatic holonomies have already been proposed, the slow evolution eventually compromises qubit coherence and computational power. Here, we propose a general approach to speed up an implementation of adiabatic holonomic gates by using transitionless driving techniques and show how such a universal set of fast geometric quantum gates in a superconducting circuit architecture can be obtained in an all-geometric approach. Compared with standard non-adiabatic holonomic quantum computation, the holonomies obtained in our approach tends asymptotically to those of the adiabatic approach in the long run-time limit and thus might open up a new horizon for realizing a practical quantum computer. PMID:26687580
Fast non-Abelian geometric gates via transitionless quantum driving
NASA Astrophysics Data System (ADS)
Zhang, J.; Kyaw, Thi Ha; Tong, D. M.; Sjöqvist, Erik; Kwek, Leong-Chuan
2015-12-01
A practical quantum computer must be capable of performing high fidelity quantum gates on a set of quantum bits (qubits). In the presence of noise, the realization of such gates poses daunting challenges. Geometric phases, which possess intrinsic noise-tolerant features, hold the promise for performing robust quantum computation. In particular, quantum holonomies, i.e., non-Abelian geometric phases, naturally lead to universal quantum computation due to their non-commutativity. Although quantum gates based on adiabatic holonomies have already been proposed, the slow evolution eventually compromises qubit coherence and computational power. Here, we propose a general approach to speed up an implementation of adiabatic holonomic gates by using transitionless driving techniques and show how such a universal set of fast geometric quantum gates in a superconducting circuit architecture can be obtained in an all-geometric approach. Compared with standard non-adiabatic holonomic quantum computation, the holonomies obtained in our approach tends asymptotically to those of the adiabatic approach in the long run-time limit and thus might open up a new horizon for realizing a practical quantum computer.
Fast non-Abelian geometric gates via transitionless quantum driving.
Zhang, J; Kyaw, Thi Ha; Tong, D M; Sjöqvist, Erik; Kwek, Leong-Chuan
2015-01-01
A practical quantum computer must be capable of performing high fidelity quantum gates on a set of quantum bits (qubits). In the presence of noise, the realization of such gates poses daunting challenges. Geometric phases, which possess intrinsic noise-tolerant features, hold the promise for performing robust quantum computation. In particular, quantum holonomies, i.e., non-Abelian geometric phases, naturally lead to universal quantum computation due to their non-commutativity. Although quantum gates based on adiabatic holonomies have already been proposed, the slow evolution eventually compromises qubit coherence and computational power. Here, we propose a general approach to speed up an implementation of adiabatic holonomic gates by using transitionless driving techniques and show how such a universal set of fast geometric quantum gates in a superconducting circuit architecture can be obtained in an all-geometric approach. Compared with standard non-adiabatic holonomic quantum computation, the holonomies obtained in our approach tends asymptotically to those of the adiabatic approach in the long run-time limit and thus might open up a new horizon for realizing a practical quantum computer. PMID:26687580
Quantum reactive scattering on innovative computing platforms
NASA Astrophysics Data System (ADS)
Pacifici, Leonardo; Nalli, Danilo; Laganà, Antonio
2013-05-01
The possibility of implementing quantum reactive scattering programs on cheap platforms, originally used for graphic purposes only, has been investigated using a NVIDIA GPU. After a conversion of the code considered from Fortran to C and its deep restructuring for exploiting the GPU key features, significant speedups have been obtained for RWAVEPR, a time dependent quantum reactive scattering code propagating in time a complex wavepacket. As benchmark calculations those concerned with the evaluation of the reactive probabilities of the Cl+H2 and the N+N2 reactions have been considered.
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.
Entanglement-based machine learning on a quantum computer.
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. PMID:25839250
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.
NASA Astrophysics Data System (ADS)
D'Ariano, Giacomo Mauro
2010-05-01
I will argue that the proposal of establishing operational foundations of Quantum Theory should have top-priority, and that the Lucien Hardy's program on Quantum Gravity should be paralleled by an analogous program on Quantum Field Theory (QFT), which needs to be reformulated, notwithstanding its experimental success. In this paper, after reviewing recently suggested operational "principles of the quantumness," I address the problem on whether Quantum Theory and Special Relativity are unrelated theories, or instead, if the one implies the other. I show how Special Relativity can be indeed derived from causality of Quantum Theory, within the computational paradigm "the universe is a huge quantum computer," reformulating QFT as a Quantum-Computational Field Theory (QCFT). In QCFT Special Relativity emerges from the fabric of the computational network, which also naturally embeds gauge invariance. In this scheme even the quantization rule and the Planck constant can in principle be derived as emergent from the underlying causal tapestry of space-time. In this way Quantum Theory remains the only theory operating the huge computer of the universe. Is the computational paradigm only a speculative tautology (theory as simulation of reality), or does it have a scientific value? The answer will come from Occam's razor, depending on the mathematical simplicity of QCFT. Here I will just start scratching the surface of QCFT, analyzing simple field theories, including Dirac's. The number of problems and unmotivated recipes that plague QFT strongly motivates us to undertake the QCFT project, since QCFT makes all such problems manifest, and forces a re-foundation of QFT.
Wu, Guorong; Neville, Simon P.; Worth, Graham A.; Schalk, Oliver; Sekikawa, Taro; Ashfold, Michael N. R.; Stolow, Albert
2015-02-21
The dynamics of pyrrole excited at wavelengths in the range 242-217 nm are studied using a combination of time-resolved photoelectron spectroscopy and wavepacket propagations performed using the multi-configurational time-dependent Hartree method. Excitation close to the origin of pyrrole’s electronic spectrum, at 242 and 236 nm, is found to result in an ultrafast decay of the system from the ionization window on a single timescale of less than 20 fs. This behaviour is explained fully by assuming the system to be excited to the A{sub 2}(πσ{sup ∗}) state, in accord with previous experimental and theoretical studies. Excitation at shorter wavelengths has previously been assumed to result predominantly in population of the bright A{sub 1}(ππ{sup ∗}) and B{sub 2}(ππ{sup ∗}) states. We here present time-resolved photoelectron spectra at a pump wavelength of 217 nm alongside detailed quantum dynamics calculations that, together with a recent reinterpretation of pyrrole’s electronic spectrum [S. P. Neville and G. A. Worth, J. Chem. Phys. 140, 034317 (2014)], suggest that population of the B{sub 1}(πσ{sup ∗}) state (hitherto assumed to be optically dark) may occur directly when pyrrole is excited at energies in the near UV part of its electronic spectrum. The B{sub 1}(πσ{sup ∗}) state is found to decay on a timescale of less than 20 fs by both N-H dissociation and internal conversion to the A{sub 2}(πσ{sup ∗}) state.
Computing Entanglement Entropy in Quantum Monte Carlo
NASA Astrophysics Data System (ADS)
Melko, Roger
2012-02-01
The scaling of entanglement entropy in quantum many-body wavefunctions is expected to be a fruitful resource for studying quantum phases and phase transitions in condensed matter. However, until the recent development of estimators for Renyi entropy in quantum Monte Carlo (QMC), we have been in the dark about the behaviour of entanglement in all but the simplest two-dimensional models. In this talk, I will outline the measurement techniques that allow access to the Renyi entropies in several different QMC methodologies. I will then discuss recent simulation results demonstrating the richness of entanglement scaling in 2D, including: the prevalence of the ``area law''; topological entanglement entropy in a gapped spin liquid; anomalous subleading logarithmic terms due to Goldstone modes; universal scaling at critical points; and examples of emergent conformal-like scaling in several gapless wavefunctions. Finally, I will explore the idea that ``long range entanglement'' may complement the notion of ``long range order'' for quantum phases and phase transitions which lack a conventional order parameter description.
Simulation of many-qubit quantum computation with matrix product states
Banuls, M. C.; Perez, A.; Orus, R.; Latorre, J. I.; Ruiz-Femenia, P.
2006-02-15
Matrix product states provide a natural entanglement basis to represent a quantum register and operate quantum gates on it. This scheme can be materialized to simulate a quantum adiabatic algorithm solving hard instances of an NP-complete problem. Errors inherent to truncations of the exact action of interacting gates are controlled by the size of the matrices in the representation. The property of finding the right solution for an instance and the expected value of the energy (cost function) are found to be remarkably robust against these errors. As a symbolic example, we simulate the algorithm solving a 100-qubit hard instance, that is, finding the correct product state out of {approx}10{sup 30} possibilities. Accumulated statistics for up to 60 qubits seem to point at a subexponential growth of the average minimum time to solve hard instances with highly truncated simulations of adiabatic quantum evolution.
Quantum computation in the analysis of hyperspectral data
NASA Astrophysics Data System (ADS)
Gomez, Richard B.; Ghoshal, Debabrata; Jayanna, Anil
2004-08-01
Recent research on the topic of quantum computation provides us with some quantum algorithms with higher efficiency and speedup compared to their classical counterparts. In this paper, it is our intent to provide the results of our investigation of several applications of such quantum algorithms - especially the Grover's Search algorithm - in the analysis of Hyperspectral Data. We found many parallels with Grover's method in existing data processing work that make use of classical spectral matching algorithms. Our efforts also included the study of several methods dealing with hyperspectral image analysis work where classical computation methods involving large data sets could be replaced with quantum computation methods. The crux of the problem in computation involving a hyperspectral image data cube is to convert the large amount of data in high dimensional space to real information. Currently, using the classical model, different time consuming methods and steps are necessary to analyze these data including: Animation, Minimum Noise Fraction Transform, Pixel Purity Index algorithm, N-dimensional scatter plot, Identification of Endmember spectra - are such steps. If a quantum model of computation involving hyperspectral image data can be developed and formalized - it is highly likely that information retrieval from hyperspectral image data cubes would be a much easier process and the final information content would be much more meaningful and timely. In this case, dimensionality would not be a curse, but a blessing.
Could one make a diamond-based quantum computer?
Stoneham, A Marshall; Harker, A H; Morley, Gavin W
2009-09-01
We assess routes to a diamond-based quantum computer, where we specifically look towards scalable devices, with at least 10 linked quantum gates. Such a computer should satisfy the deVincenzo rules and might be used at convenient temperatures. The specific examples that we examine are based on the optical control of electron spins. For some such devices, nuclear spins give additional advantages. Since there have already been demonstrations of basic initialization and readout, our emphasis is on routes to two-qubit quantum gate operations and the linking of perhaps 10-20 such gates. We analyse the dopant properties necessary, especially centres containing N and P, and give results using simple scoping calculations for the key interactions determining gate performance. Our conclusions are cautiously optimistic: it may be possible to develop a useful quantum information processor that works above cryogenic temperatures. PMID:21832328
Combining dynamical decoupling with fault-tolerant quantum computation
Ng, Hui Khoon; Preskill, John; Lidar, Daniel A.
2011-07-15
We study how dynamical decoupling (DD) pulse sequences can improve the reliability of quantum computers. We prove upper bounds on the accuracy of DD-protected quantum gates and derive sufficient conditions for DD-protected gates to outperform unprotected gates. Under suitable conditions, fault-tolerant quantum circuits constructed from DD-protected gates can tolerate stronger noise and have a lower overhead cost than fault-tolerant circuits constructed from unprotected gates. Our accuracy estimates depend on the dynamics of the bath that couples to the quantum computer and can be expressed either in terms of the operator norm of the bath's Hamiltonian or in terms of the power spectrum of bath correlations; we explain in particular how the performance of recursively generated concatenated pulse sequences can be analyzed from either viewpoint. Our results apply to Hamiltonian noise models with limited spatial correlations.
NASA Astrophysics Data System (ADS)
Solenov, Dmitry; Economou, Sophia E.; Reinecke, T. L.
2013-01-01
Implementations for quantum computing require fast single- and multiqubit quantum gate operations. In the case of optically controlled quantum dot qubits, theoretical designs for long-range two- or multiqubit operations satisfying all the requirements in quantum computing are not yet available. We have developed a design for a fast, long-range two-qubit gate mediated by a photonic microcavity mode using excited states of the quantum-dot-cavity system that addresses these needs. This design does not require identical qubits, it is compatible with available optically induced single-qubit operations, and it advances opportunities for scalable architectures. We show that the gate fidelity can exceed 90% in experimentally accessible systems.
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.
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.
Dupuy, Nicolas; Bouaouli, Samira; Mauri, Francesco Casula, Michele; Sorella, Sandro
2015-06-07
We study the ionization energy, electron affinity, and the π → π{sup ∗} ({sup 1}L{sub a}) excitation energy of the anthracene molecule, by means of variational quantum Monte Carlo (QMC) methods based on a Jastrow correlated antisymmetrized geminal power (JAGP) wave function, developed on molecular orbitals (MOs). The MO-based JAGP ansatz allows one to rigorously treat electron transitions, such as the HOMO → LUMO one, which underlies the {sup 1}L{sub a} excited state. We present a QMC optimization scheme able to preserve the rank of the antisymmetrized geminal power matrix, thanks to a constrained minimization with projectors built upon symmetry selected MOs. We show that this approach leads to stable energy minimization and geometry relaxation of both ground and excited states, performed consistently within the correlated QMC framework. Geometry optimization of excited states is needed to make a reliable and direct comparison with experimental adiabatic excitation energies. This is particularly important in π-conjugated and polycyclic aromatic hydrocarbons, where there is a strong interplay between low-lying energy excitations and structural modifications, playing a functional role in many photochemical processes. Anthracene is an ideal benchmark to test these effects. Its geometry relaxation energies upon electron excitation are of up to 0.3 eV in the neutral {sup 1}L{sub a} excited state, while they are of the order of 0.1 eV in electron addition and removal processes. Significant modifications of the ground state bond length alternation are revealed in the QMC excited state geometry optimizations. Our QMC study yields benchmark results for both geometries and energies, with values below chemical accuracy if compared to experiments, once zero point energy effects are taken into account.
Dupuy, Nicolas; Bouaouli, Samira; Mauri, Francesco; Sorella, Sandro; Casula, Michele
2015-06-01
We study the ionization energy, electron affinity, and the π → π(∗) ((1)La) excitation energy of the anthracene molecule, by means of variational quantum Monte Carlo (QMC) methods based on a Jastrow correlated antisymmetrized geminal power (JAGP) wave function, developed on molecular orbitals (MOs). The MO-based JAGP ansatz allows one to rigorously treat electron transitions, such as the HOMO → LUMO one, which underlies the (1)La excited state. We present a QMC optimization scheme able to preserve the rank of the antisymmetrized geminal power matrix, thanks to a constrained minimization with projectors built upon symmetry selected MOs. We show that this approach leads to stable energy minimization and geometry relaxation of both ground and excited states, performed consistently within the correlated QMC framework. Geometry optimization of excited states is needed to make a reliable and direct comparison with experimental adiabatic excitation energies. This is particularly important in π-conjugated and polycyclic aromatic hydrocarbons, where there is a strong interplay between low-lying energy excitations and structural modifications, playing a functional role in many photochemical processes. Anthracene is an ideal benchmark to test these effects. Its geometry relaxation energies upon electron excitation are of up to 0.3 eV in the neutral (1)La excited state, while they are of the order of 0.1 eV in electron addition and removal processes. Significant modifications of the ground state bond length alternation are revealed in the QMC excited state geometry optimizations. Our QMC study yields benchmark results for both geometries and energies, with values below chemical accuracy if compared to experiments, once zero point energy effects are taken into account. PMID:26049481
Quantum algorithms for spin models and simulable gate sets for quantum computation
NASA Astrophysics Data System (ADS)
van den Nest, M.; Dür, W.; Raussendorf, R.; Briegel, H. J.
2009-11-01
We present simple mappings between classical lattice models and quantum circuits, which provide a systematic formalism to obtain quantum algorithms to approximate partition functions of lattice models in certain complex-parameter regimes. We, e.g., present an efficient quantum algorithm for the six-vertex model as well as a two-dimensional Ising-type model. We show that classically simulating these (complex-parameter) spin models is as hard as simulating universal quantum computation, i.e., BQP complete (BQP denotes bounded-error quantum polynomial time). Furthermore, our mappings provide a framework to obtain efficiently simulable quantum gate sets from exactly solvable classical models. We, e.g., show that the simulability of Valiant’s match gates can be recovered by using the solvability of the free-fermion eight-vertex model.
NASA Astrophysics Data System (ADS)
Herrera, Felipe; Cao, Yudong; Kais, Sabre; Whaley, K. Birgitta
2014-07-01
Implementing a scalable quantum information processor using polar molecules in optical lattices requires precise control over the long-range dipole-dipole interaction between molecules in selected lattice sites. We present here a scheme using trapped open-shell ^{2}\\Sigma polar molecules that allows dipolar exchange processes between nearest and next-nearest neighbors to be controlled in order to construct a generalized transverse Ising spin Hamiltonian with tunable XX, YY and XY couplings in the rotating frame of the driving lasers. The scheme requires a moderately strong bias magnetic field together with near-infrared light to provide local tuning of the qubit energy gap, and mid-infrared pulses to perform rotational state transfer via stimulated Raman adiabatic passage. No interaction between qubits occurs in the absence of the infrared driving. We analyze the fidelity of the resulting two-qubit matchgate, and demonstrate its robustness as a function of the driving parameters. We discuss a realistic application of the system for universal matchgate quantum computing in optical lattices.
An Invitation to the Mathematics of Topological Quantum Computation
NASA Astrophysics Data System (ADS)
Rowell, E. C.
2016-03-01
Two-dimensional topological states of matter offer a route to quantum computation that would be topologically protected against the nemesis of the quantum circuit model: decoherence. Research groups in industry, government and academic institutions are pursuing this approach. We give a mathematician's perspective on some of the advantages and challenges of this model, highlighting some recent advances. We then give a short description of how we might extend the theory to three-dimensional materials.
Computer studies of multiple-quantum spin dynamics
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.
Universal Matchgate Quantum Computing With Cold Polar Molecules
NASA Astrophysics Data System (ADS)
Herrera, Felipe
2015-03-01
Polar molecules in optical lattices are attractive for quantum simulation and computation due to the ability to implement a variety of spin-lattice models using static, microwave and optical fields to engineer the long-range dipolar interaction between molecular qubits. Quantum simulation of spin models requires global control over the molecular ensemble, while quantum computation requires control of individual molecules with sub-wavelength resolution. In this talk, we describe the implementation of a matchgate quantum processor with an ensemble of polar molecules in an optical lattice. The scheme uses few-body qubit encoding and sequential control of two-body dipolar interactions over small plaquetes on a square lattice to perform universal quantum computing without single-site addressing. Effective spin-spin interactions with matchgate symmetry between open-shell polar molecules (e.g., SrF, OH) are driven by two infrared control pulses in the absence of static electric fields. The resulting matchgates are robust with respect to realistic imperfections in the driving fields and lattice trapping. Applications of the architecture for the simulation of interacting fermions in quantum chemistry are discussed, considering an imperfect lattice filling.
Symmetry-protected topologically ordered states for universal quantum computation
NASA Astrophysics Data System (ADS)
Poulsen Nautrup, Hendrik; Wei, Tzu-Chieh
Measurement-based quantum computation (MBQC) is a model for quantum information processing utilizing only local measurements on suitably entangled resource states for the implementation of quantum gates. A complete characterization for universal resource states is still missing. It has been shown that symmetry-protected topological order (SPTO) in one dimension can be exploited for the protection of certain quantum gates in MBQC. Here we investigate whether any 2D nontrivial SPTO states can serve as resource for MBQC. In particular, we show that the nontrivial SPTO ground state of the CZX model on the square lattice by Chen et al. [Phys. Rev. B 84, 235141 (2011)] can be reduced to a 2D cluster state by local measurement, hence a universal resource state. Such ground states have been generalized to qudits with symmetry action described by three cocycles of a finite group G of order d and shown to exhibit nontrivial SPTO. We also extend these to arbitary lattices and show that the generalized two-dimensional plaquette states on arbitrary lattices exhibit nontrivial SPTO in terms of symmetry fractionalization and that they are universal resource states for quantum computation. SPTO states therefore can provide a new playground for measurement-based quantum computation. This work was supported in part by the National Science Foundation.
Using graph states for quantum computation and communication
NASA Astrophysics Data System (ADS)
Goyal, Kovid
In this work, we describe a method to achieve fault tolerant measurement based quantum computation in two and three dimensions. The proposed scheme has an threshold of 7.8*10^-3 and poly-logarithmic overhead scaling. The overhead scaling below the threshold is also studied. The scheme uses a combination of topological error correction and magic state distillation to construct a universal quantum computer on a qubit lattice. The chapters on measurement based quantum computation are written in review form with extensive discussion and illustrative examples.In addition, we describe and analyze a family of entanglement purification protocols that provide a flexible trade-off between overhead, threshold and output quality. The protocols are studied analytically, with closed form expressions for their threshold.
Degree of quantum correlation required to speed up a computation
NASA Astrophysics Data System (ADS)
Kay, Alastair
2015-12-01
The one-clean-qubit model of quantum computation (DQC1) efficiently implements a computational task that is not known to have a classical alternative. During the computation, there is never more than a small but finite amount of entanglement present, and it is typically vanishingly small in the system size. In this paper, we demonstrate that there is nothing unexpected hidden within the DQC1 model—Grover's search, when acting on a mixed state, provably exhibits a speedup over classical, with guarantees as to the presence of only vanishingly small amounts of quantum correlations (entanglement and quantum discord)—while arguing that this is not an artifact of the oracle-based construction. We also present some important refinements in the evaluation of how much entanglement may be present in the DQC1 and how the typical entanglement of the system must be evaluated.
Time-Dependent Density Functional Theory for Universal Quantum Computation
NASA Astrophysics Data System (ADS)
Tempel, David
2015-03-01
In this talk, I will discuss how the theorems of TDDFT can be applied 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, I will discuss how TDDFT provides an exact prescription for simulating universal Hamiltonians with other universal Hamiltonians that have different, and possibly easier-to-realize two-qubit interactions.
Exploring quantum computing application to satellite data assimilation
NASA Astrophysics Data System (ADS)
Cheung, S.; Zhang, S. Q.
2015-12-01
This is an exploring work on potential application of quantum computing to a scientific data optimization problem. On classical computational platforms, the physical domain of a satellite data assimilation problem is represented by a discrete variable transform, and classical minimization algorithms are employed to find optimal solution of the analysis cost function. The computation becomes intensive and time-consuming when the problem involves large number of variables and data. The new quantum computer opens a very different approach both in conceptual programming and in hardware architecture for solving optimization problem. In order to explore if we can utilize the quantum computing machine architecture, we formulate a satellite data assimilation experimental case in the form of quadratic programming optimization problem. We find a transformation of the problem to map it into Quadratic Unconstrained Binary Optimization (QUBO) framework. Binary Wavelet Transform (BWT) will be applied to the data assimilation variables for its invertible decomposition and all calculations in BWT are performed by Boolean operations. The transformed problem will be experimented as to solve for a solution of QUBO instances defined on Chimera graphs of the quantum computer.
Quantum pattern recognition with liquid-state nuclear magnetic resonance
NASA Astrophysics Data System (ADS)
Neigovzen, Rodion; Neves, Jorge L.; Sollacher, Rudolf; Glaser, Steffen J.
2009-04-01
A quantum pattern recognition scheme is presented, which combines the idea of a classic Hopfield neural network with adiabatic quantum computation. Both the input and the memorized patterns are represented by means of the problem Hamiltonian. In contrast to classic neural networks, the algorithm can return a quantum superposition of multiple recognized patterns. A proof of principle for the algorithm for two qubits is provided using a liquid-state NMR quantum computer.
Closed timelike curves in measurement-based quantum computation
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.
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.
Quantum annealing: The fastest route to quantum computation?
NASA Astrophysics Data System (ADS)
Smorra, C.; Blaum, K.; Bojtar, L.; Borchert, M.; Franke, K. A.; Higuchi, T.; Leefer, N.; Nagahama, H.; Matsuda, Y.; Mooser, A.; Niemann, M.; Ospelkaus, C.; Quint, W.; Schneider, G.; Sellner, S.; Tanaka, T.; Van Gorp, S.; Walz, J.; Yamazaki, Y.; Ulmer, S.
2015-11-01
The Baryon Antibaryon Symmetry Experiment (BASE) aims at performing a stringent test of the combined charge parity and time reversal (CPT) symmetry by comparing the magnetic moments of the proton and the antiproton with high precision. Using single particles in a Penning trap, the proton/antiproton g-factors, i.e. the magnetic moment in units of the nuclear magneton, are determined by measuring the respective ratio of the spin-precession frequency to the cyclotron frequency. The spin precession frequency is measured by non-destructive detection of spin quantum transitions using the continuous Stern-Gerlach effect, and the cyclotron frequency is determined from the particle*s motional eigenfrequencies in the Penning trap using the invariance theorem. By application of the double Penning-trap method we expect that in our measurements a fractional precision of δ g/ g 10-9 can be achieved. The successful application of this method to the antiproton will consist a factor 1000 improvement in the fractional precision of its magnetic moment. The BASE collaboration has constructed and commissioned a new experiment at the Antiproton Decelerator (AD) of CERN. This article describes and summarizes the physical and technical aspects of this new experiment.
Magnetic resonance force microscopy and a solid state quantum computer.
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.
Single-spin measurements for quantum computation using magnetic resonance force microscopy
Berman, G. P.; Borgonovi, F.; Rinkevicius, Z.; Tsifrinovich, V. I.
2004-01-01
The quantum theory of a singlespin measurements using a magnetic resonance force microscopy is presented. We use an oscillating cantilever-driven adiabatic reversals technique. The frequency shift of the cantilever vibrations is estimated. We show that the frequency shift causes the formation of the Schroedinger cat state for the cantilever. The interaction between the cantilever and the environment quickly destroys the coherence between the two cantilever trajectories. It is shown that using partial adiabatic reversals one can obtain a significant increase in the frequency shift. We discuss the possibility of sub-magneton spin density detection in molecules using magnetic resonance force microscopy.
Computational nuclear quantum many-body problem: The UNEDF project
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.
Bound on quantum computation time: Quantum error correction in a critical environment
Novais, E.; Mucciolo, Eduardo R.; Baranger, Harold U.
2010-08-15
We obtain an upper bound on the time available for quantum computation for a given quantum computer and decohering environment with quantum error correction implemented. First, we derive an explicit quantum evolution operator for the logical qubits and show that it has the same form as that for the physical qubits but with a reduced coupling strength to the environment. Using this evolution operator, we find the trace distance between the real and ideal states of the logical qubits in two cases. For a super-Ohmic bath, the trace distance saturates, while for Ohmic or sub-Ohmic baths, there is a finite time before the trace distance exceeds a value set by the user.
Investigations in quantum computing: Causality and graph isomorphism
NASA Astrophysics Data System (ADS)
Beckman, David Eugene
In this thesis I explore two different types of limits on the time complexity of quantum computation---that is, limits on how much time is required to perform a given class of quantum operations on a quantum system. Upper limits can be found by explicit construction; I explore this approach for the problem of determining whether two graphs are isomorphic. Finding lower limits, on the other hand, usually requires appeal to some fundamental principle of the operation under consideration; I use this approach to derive lower limits placed by the requirements of relativistic causality on the time required for implementation of some nonlocal quantum operations. In some situations these limits are attainable, but for other physical spacetime geometries we exhibit classes of operations which do not violate relativistic causality but which are nevertheless not implementable.
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.
CALL FOR PAPERS: Optical implementation of quantum computers
NASA Astrophysics Data System (ADS)
Rarity, John; Weinfurter, Harald
2004-09-01
A topical issue of Journal of Optics B: Quantum and Semiclassical Optics will be devoted to recent advances in optical implementation of quantum computers. The topics to be covered will include, but are not limited to: bullet Linear optics quantum gates bullet Progress towards nonlinear optics quantum gates bullet Interface between optical qubits and atomic/solid state qubits bullet Novel architectures bullet Single-photon sources and detectors bullet Photonic quantum networks bullet Few-qubit applications The DEADLINE for submission of contributions is 15 January 2005 to allow the topical issue to be published in about October 2005. All contributions will be peer-reviewed in accordance with the normal refereeing procedures and standards of Journal of Optics B: Quantum and Semiclassical Optics. Submissions should preferably be in either standard LaTeX form or Microsoft Word. Advice on publishing your work in the journal may be found at www.iop.org/journals/authors/jopb. There are no page charges for publication. The corresponding author of each paper published will receive a complimentary copy of the topical issue. Contributions to the topical issue should preferably be submitted electronically at www.iop.org/journals/authors/jopb or by e-mail to jopb@iop.org. Authors unable to submit online or by e-mail may send hard copy contributions (enclosing the electronic code) to: Dr Claire Bedrock (Publisher), Journal of Optics B: Quantum and Semiclassical Optics, Institute of Physics Publishing, Dirac House, Temple Back, Bristol BS1 6BE, UK. All contributions should be accompanied by a readme file or covering letter, quoting `JOPB Topical Issue - Optical implementation of quantum computers', giving the postal and e-mail addresses for correspondence. Any subsequent change of address should be notified to the publishing office. We look forward to receiving your contribution to this topical issue.
Scalable neutral atom quantum computing with MEMS micromirrors
NASA Astrophysics Data System (ADS)
Knoernschild, Caleb; Lu, Felix; Ryu, Hoon; Feng, Michael; Kim, Jungsang
2010-03-01
In order to realize a useful atom-based quantum computer, a means to efficiently distribute critical laser resources to multiple trap locations is essential. Optical micro-electromechanical systems (MEMS) can provide the scalability, flexibility, and stability needed to help bridge the gap between fundamental demonstrations of quantum gates to large scale quantum computing of multiple qubits. Using controllable, broadband micromirrors, an arbitrary atom in a 1, 2, or 3 dimensional optical lattice can be addressed with a single laser source. It is straightforward to scale this base system to address n arbitrary set of atoms simultaneously using n laser sources. We explore on-demand addressability of individual atoms trapped in a 1D lattice, as well as investigate the effect the micromirrors have on the laser beam quality and phase stability.
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.
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.
Optical quantum computation with cavities in the intermediate coupling region
NASA Astrophysics Data System (ADS)
Mei, F.; Yu, Y. F.; Feng, X. L.; Zhu, S. L.; Zhang, Z. M.
2010-07-01
Large-scale quantum computation is currently a hot area of research. The scalable quantum computation scheme with cavities originally proposed by Duan and Kimble (Phys. Rev. Lett., 92 (2004) 127902) is further developed here to operate in the intermediate coupling region, which not only greatly relaxes experimental demands on the Purcell factor, but also eliminates the need to consider internal trade-off between cavity quality and efficiency. In our scheme, by controlling the reflectivity of the input single-photon pulse in the cavity, we can realize local atom-photon and nonlocal atom-atom controlled phase-flip (CPF) gates. We also introduce a theoretical model to analyze the performance of our scheme under practical noise. Furthermore, we show that the nonlocal CPF gate can be used to realize a quantum repeater.
Optimized entanglement purification schemes for modular based quantum computers
NASA Astrophysics Data System (ADS)
Krastanov, Stefan; Jiang, Liang
The choice of entanglement purification scheme strongly depends on the fidelities of quantum gates and measurements, as well as the imperfection of initial entanglement. For instance, the purification scheme optimal at low gate fidelities may not necessarily be the optimal scheme at higher gate fidelities. We employ an evolutionary algorithm that efficiently optimizes the entanglement purification circuit for given system parameters. Such optimized purification schemes will boost the performance of entanglement purification, and consequently enhance the fidelity of teleportation-based non-local coupling gates, which is an indispensible building block for modular-based quantum computers. In addition, we study how these optimized purification schemes affect the resource overhead caused by error correction in modular based quantum computers.
QNIX: A Linear Optical Architecture for Quantum Computing
NASA Astrophysics Data System (ADS)
Gimeno-Segovia, Mercedes; Shadbolt, Peter J.; Rudolph, Terry G.; Browne, Dan E.; Mendoza, Gabriel; Russell, Nicholas J.; Silverstone, Joshua W.; Santamato, Alberto; Carolan, Jacques; O'Brien, Jeremy
2015-03-01
There is currently a great deal of effort to develop a large-scale quantum computer, and one of the most promising platforms to do so is integrated linear optics. We present a proposal for a dynamical scheme for an integrated linear optics implementation of a one-way quantum computer. We go beyond the purely theoretical work and address practical issues in order to create a physically realistic design. We describe every step of cluster state construction and processing, showing the outstanding issues left to be addressed and our contributions to the different stages of the dynamical process. These include optimised interferometers for the generation of GHZ states, a universal and scalable architecture which requires entangled sources of no more than 3 photons with no active feed-forward, and loss-tolerant and fault-tolerant strategies specifically tailored to our proposed architecture. Our work demonstrates that building a linear optical quantum computer need be less challenging than previously thought, and brings large-scale switch-free linear optical architectures for quantum computing much closer to experimental realisation.
NASA Astrophysics Data System (ADS)
Chuluunbaatar, O.; Gusev, A. A.; Gerdt, V. P.; Rostovtsev, V. A.; Vinitsky, S. I.; Abrashkevich, A. G.; Kaschiev, M. S.; Serov, V. V.
2008-02-01
A FORTRAN 77 program is presented which calculates with the relative machine precision potential curves and matrix elements of the coupled adiabatic radial equations for a hydrogen-like atom in a homogeneous magnetic field. The potential curves are eigenvalues corresponding to the angular oblate spheroidal functions that compose adiabatic basis which depends on the radial variable as a parameter. The matrix elements of radial coupling are integrals in angular variables of the following two types: product of angular functions and the first derivative of angular functions in parameter, and product of the first derivatives of angular functions in parameter, respectively. The program calculates also the angular part of the dipole transition matrix elements (in the length form) expressed as integrals in angular variables involving product of a dipole operator and angular functions. Moreover, the program calculates asymptotic regular and irregular matrix solutions of the coupled adiabatic radial equations at the end of interval in radial variable needed for solving a multi-channel scattering problem by the generalized R-matrix method. Potential curves and radial matrix elements computed by the POTHMF program can be used for solving the bound state and multi-channel scattering problems. As a test desk, the program is applied to the calculation of the energy values, a short-range reaction matrix and corresponding wave functions with the help of the KANTBP program. Benchmark calculations for the known photoionization cross-sections are presented. Program summaryProgram title:POTHMF Catalogue identifier:AEAA_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEAA_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.:8123 No. of bytes in distributed program, including test data
Experimental demonstration of composite adiabatic passage
NASA Astrophysics Data System (ADS)
Schraft, Daniel; Halfmann, Thomas; Genov, Genko T.; Vitanov, Nikolay V.
2013-12-01
We report an experimental demonstration of composite adiabatic passage (CAP) for robust and efficient manipulation of two-level systems. The technique represents a altered version of rapid adiabatic passage (RAP), driven by composite sequences of radiation pulses with appropriately chosen phases. We implement CAP with radio-frequency pulses to invert (i.e., to rephase) optically prepared spin coherences in a Pr3+:Y2SiO5 crystal. We perform systematic investigations of the efficiency of CAP and compare the results with conventional π pulses and RAP. The data clearly demonstrate the superior features of CAP with regard to robustness and efficiency, even under conditions of weakly fulfilled adiabaticity. The experimental demonstration of composite sequences to support adiabatic passage is of significant relevance whenever a high efficiency or robustness of coherent excitation processes need to be maintained, e.g., as required in quantum information technology.
Human-competitive evolution of quantum computing artefacts by Genetic Programming.
Massey, Paul; Clark, John A; Stepney, Susan
2006-01-01
We show how Genetic Programming (GP) can be used to evolve useful quantum computing artefacts of increasing sophistication and usefulness: firstly specific quantum circuits, then quantum programs, and finally system-independent quantum algorithms. We conclude the paper by presenting a human-competitive Quantum Fourier Transform (QFT) algorithm evolved by GP. PMID:16536889
Computing and the electrical transport properties of coupled quantum networks
NASA Astrophysics Data System (ADS)
Cain, Casey Andrew
In this dissertation a number of investigations were conducted on ballistic quantum networks in the mesoscopic range. In this regime, the wave nature of electron transport under the influence of transverse magnetic fields leads to interesting applications for digital logic and computing circuits. The work specifically looks at characterizing a few main areas that would be of interest to experimentalists who are working in nanostructure devices, and is organized as a series of papers. The first paper analyzes scaling relations and normal mode charge distributions for such circuits in both isolated and open (terminals attached) form. The second paper compares the flux-qubit nature of quantum networks to the well-established spintronics theory. The results found exactly contradict the conventional school of thought for what is required for quantum computation. The third paper investigates the requirements and limitations of extending the Thevenin theorem in classic electric circuits to ballistic quantum transport. The fourth paper outlines the optimal functionally complete set of quantum circuits that can completely satisfy all sixteen Boolean logic operations for two variables.
Quantum computation mediated by ancillary qudits and spin coherent states
NASA Astrophysics Data System (ADS)
Proctor, Timothy J.; Dooley, Shane; Kendon, Viv
2015-01-01
Models of universal quantum computation in which the required interactions between register (computational) qubits are mediated by some ancillary system are highly relevant to experimental realizations of a quantum computer. We introduce such a universal model that employs a d -dimensional ancillary qudit. The ancilla-register interactions take the form of controlled displacements operators, with a displacement operator defined on the periodic and discrete lattice phase space of a qudit. We show that these interactions can implement controlled phase gates on the register by utilizing geometric phases that are created when closed loops are traversed in this phase space. The extra degrees of freedom of the ancilla can be harnessed to reduce the number of operations required for certain gate sequences. In particular, we see that the computational advantages of the quantum bus (qubus) architecture, which employs a field-mode ancilla, are also applicable to this model. We then explore an alternative ancilla-mediated model which employs a spin ensemble as the ancillary system and again the interactions with the register qubits are via controlled displacement operators, with a displacement operator defined on the Bloch sphere phase space of the spin coherent states of the ensemble. We discuss the computational advantages of this model and its relationship with the qubus architecture.
Optimizing Quantum Simulation for Heterogeneous Computing: a Hadamard Transformation Study
NASA Astrophysics Data System (ADS)
de Avila, Anderson B.; Schumalfuss, Murilo F.; Reiser, Renata H. S.; Pilla, Mauricio L.; Maron, Adriano K.
2015-10-01
The D-GM execution environment improves distributed simulation of quantum algorithms in heterogeneous computing environments comprising both multi-core CPUs and GPUs. The main contribution of this work consists in the optimization of the environment VirD-GM, conceived in three steps: (i) the theoretical studies and implementation of the abstractions of the Mixed Partial Process defined in the qGM model, focusing on the reduction of the memory consumption regarding multidimensional QTs; (ii) the distributed/parallel implementation of such abstractions allowing its execution on clusters of GPUs; (iii) and optimizations that predict multiplications by zero-value of the quantum states/transformations, implying reduction in the number of computations. The results obtained in this work embrace the distribute/parallel simulation of Hadamard gates up to 21 qubits, showing scalability with the increase in the number of computing nodes.
Computational complexity of nonequilibrium steady states of quantum spin chains
NASA Astrophysics Data System (ADS)
Marzolino, Ugo; Prosen, Tomaž
2016-03-01
We study nonequilibrium steady states (NESS) of spin chains with boundary Markovian dissipation from the computational complexity point of view. We focus on X X chains whose NESS are matrix product operators, i.e., with coefficients of a tensor operator basis described by transition amplitudes in an auxiliary space. Encoding quantum algorithms in the auxiliary space, we show that estimating expectations of operators, being local in the sense that each acts on disjoint sets of few spins covering all the system, provides the answers of problems at least as hard as, and believed by many computer scientists to be much harder than, those solved by quantum computers. We draw conclusions on the hardness of the above estimations.
Gamallo, P; Defazio, P; Akpinar, S; Petrongolo, C
2012-08-16
We present the Born-Oppenheimer (BO) quantum mechanical (QM) dynamics of the CH decay (d) CH(X2Π) + H(2S) → C(3P) + H2(X1Σ(g)(+)) and of the H exchange reaction (e) CH(X2Π) + H′(2S) → CH′(X2Π) + H(2S) on the CH2 X̃3A″ adiabatic potential energy surface (PES) of Harding et al. (J. Phys. Chem. 1993, 97, 5472). A thorough analysis of the correlation diagram of the four lowest CH2 electronic states, as well as Renner-Teller and spin–orbit nonadiabatic test calculations on the X̃3A″, ã1A′, and b̃1A″ coupled PESs, validate the X̃3A″ BO results, confirming that these reactions occur essentially on the uncoupled X̃3A″ ground surface. We consider the CH molecule in the ground vibrational state and in the four lowest rotational states j0. Thus, we obtain initial-state resolved reaction probabilities, cross sections, and rate constants by propagating coupled-channel real wave packets and performing flux analyses. If J is the total angular momentum quantum number and K is its projection along the body-fixed z axis, CH + H gives essentially the C + H2 products via a barrierless K-inhibited insertion, CH2 resonances at low J, and large cross sections near the threshold. These cross sections decrease strongly with collision energy and depend slightly on j0. On the other hand, the small cross sections obtained for the (e) channel are nearly independent of energy. From initial-state resolved rate constants and Boltzmann populations at temperature T, we obtain QM thermal rate constants from 100 to 400 K: at 300 K, k(d) = (9.57 ± 0.96) × 10(-11) and k(e) = (1.41 ± 0.14) × 10(-11) cm(3) s(-1) for (d) and (e) reactions, respectively. The k(d) value is in good agreement with previous quasi-classical trajectory (QCT) results on the same PES, but it is larger than that observed at 297 K by a factor of 7. On the contrary, and in agreement with the small role of CH2 excited electronic states, X̃3A″ QCT and experimental rate constants agree at high
Universal topological quantum computation from a superconductor/Abelian quantum Hall heterostructure
NASA Astrophysics Data System (ADS)
Mong, Roger
2014-03-01
Non-Abelian anyons promise to reveal spectacular features of quantum mechanics that could ultimately provide the foundation for a decoherence-free quantum computer. A key breakthrough in the pursuit of these exotic particles originated from Read and Green's observation that the Moore-Read quantum Hall state and a (relatively simple) two-dimensional p + ip superconductor both support so-called Ising non-Abelian anyons. Here we establish a similar correspondence between the Z3 Read-Rezayi quantum Hall state and a novel two-dimensional superconductor in which charge- 2 e Cooper pairs are built from fractionalized quasiparticles. In particular, both phases harbor Fibonacci anyons that--unlike Ising anyons--allow for universal topological quantum computation solely through braiding. Using a variant of Teo and Kane's construction of non-Abelian phases from weakly coupled chains, we provide a blueprint for such a superconductor using Abelian quantum Hall states interlaced with an array of superconducting islands. These results imply that one can, in principle, combine well-understood and widely available phases of matter to realize non-Abelian anyons with universal braid statistics.
Universal Topological Quantum Computation from a Superconductor-Abelian Quantum Hall Heterostructure
NASA Astrophysics Data System (ADS)
Mong, Roger S. K.; Clarke, David J.; Alicea, Jason; Lindner, Netanel H.; Fendley, Paul; Nayak, Chetan; Oreg, Yuval; Stern, Ady; Berg, Erez; Shtengel, Kirill; Fisher, Matthew P. A.
2014-01-01
Non-Abelian anyons promise to reveal spectacular features of quantum mechanics that could ultimately provide the foundation for a decoherence-free quantum computer. A key breakthrough in the pursuit of these exotic particles originated from Read and Green's observation that the Moore-Read quantum Hall state and a (relatively simple) two-dimensional p+ip superconductor both support so-called Ising non-Abelian anyons. Here, we establish a similar correspondence between the Z3 Read-Rezayi quantum Hall state and a novel two-dimensional superconductor in which charge-2e Cooper pairs are built from fractionalized quasiparticles. In particular, both phases harbor Fibonacci anyons that—unlike Ising anyons—allow for universal topological quantum computation solely through braiding. Using a variant of Teo and Kane's construction of non-Abelian phases from weakly coupled chains, we provide a blueprint for such a superconductor using Abelian quantum Hall states interlaced with an array of superconducting islands. Fibonacci anyons appear as neutral deconfined particles that lead to a twofold ground-state degeneracy on a torus. In contrast to a p+ip superconductor, vortices do not yield additional particle types, yet depending on nonuniversal energetics can serve as a trap for Fibonacci anyons. These results imply that one can, in principle, combine well-understood and widely available phases of matter to realize non-Abelian anyons with universal braid statistics. Numerous future directions are discussed, including speculations on alternative realizations with fewer experimental requirements.
Non-abelian fractional quantum hall effect for fault-resistant topological quantum computation.
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.
NASA Astrophysics Data System (ADS)
Sych, D. V.; Grishanin, Boris A.; Zadkov, Viktor N.
2005-01-01
The problem of increasing the critical error rate of quantum-cryptography protocols by varying a set of letters in a quantum alphabet for space of a fixed dimensionality is studied. Quantum alphabets forming regular polyhedra on the Bloch sphere and the continual alphabet equally including all the quantum states are considered. It is shown that, in the absence of basis reconciliation, a protocol with the tetrahedral alphabet has the highest critical error rate among the protocols considered, while after the basis reconciliation, a protocol with the continual alphabet possesses the highest critical error rate.
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. PMID:23938640
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.
Adaptive quantum computation in changing environments using projective simulation
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
Semiconductor-inspired design principles for superconducting quantum computing.
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
Semiconductor-inspired design principles for superconducting quantum computing
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
Semiconductor-inspired design principles for superconducting quantum computing
NASA Astrophysics Data System (ADS)
Shim, Yun-Pil; Tahan, Charles
2016-03-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.
A Many Body Eigenvalue Problem for Quantum Computation
NASA Astrophysics Data System (ADS)
Hershfield, Selman
2008-03-01
A one dimensional many body Hamiltonian is presented whose eigenvalues are related to the order of GN. This is the same order of GN used to decode the RSA algorithm. For some values of N the Hamiltonian is a noninteracting fermion problem. For other values of N the Hamiltonian is a quantum impurity problem with fermions interacting with a spin-like object. However, the generic case has fermions or spins interacting with higher order interactions beyond two body interactions. Because this is a mapping between two different classes of problems, one of interest in quantum computing and the other a more traditional condensed matter physics Hamiltonian, we will show (i) how knowledge of the order of GN can be used to solve some novel one dimensional strongly correlated problems and (ii) how numerical techniques, particularly for quantum impurity limit, can be used to find the order of GN.
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.
Exploring the quantum speed limit with computer games.
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. PMID:27075097
Error-corrected quantum annealing with hundreds of qubits
NASA Astrophysics Data System (ADS)
Pudenz, Kristen L.; Albash, Tameem; Lidar, Daniel A.
2014-02-01
Quantum information processing offers dramatic speedups, yet is susceptible to decoherence, whereby quantum superpositions decay into mutually exclusive classical alternatives, thus robbing quantum computers of their power. This makes the development of quantum error correction an essential aspect of quantum computing. So far, little is known about protection against decoherence for quantum annealing, a computational paradigm aiming to exploit ground-state quantum dynamics to solve optimization problems more rapidly than is possible classically. Here we develop error correction for quantum annealing and experimentally demonstrate it using antiferromagnetic chains with up to 344 superconducting flux qubits in processors that have recently been shown to physically implement programmable quantum annealing. We demonstrate a substantial improvement over the performance of the processors in the absence of error correction. These results pave the way towards large-scale noise-protected adiabatic quantum optimization devices, although a threshold theorem such as has been established in the circuit model of quantum computing remains elusive.
Quantum computer simulation using the CUDA programming model
NASA Astrophysics Data System (ADS)
Gutiérrez, Eladio; Romero, Sergio; Trenas, María A.; Zapata, Emilio L.
2010-02-01
Quantum computing emerges as a field that captures a great theoretical interest. Its simulation represents a problem with high memory and computational requirements which makes advisable the use of parallel platforms. In this work we deal with the simulation of an ideal quantum computer on the Compute Unified Device Architecture (CUDA), as such a problem can benefit from the high computational capacities of Graphics Processing Units (GPU). After all, modern GPUs are becoming very powerful computational architectures which is causing a growing interest in their application for general purpose. CUDA provides an execution model oriented towards a more general exploitation of the GPU allowing to use it as a massively parallel SIMT (Single-Instruction Multiple-Thread) multiprocessor. A simulator that takes into account memory reference locality issues is proposed, showing that the challenge of achieving a high performance depends strongly on the explicit exploitation of memory hierarchy. Several strategies have been experimentally evaluated obtaining good performance results in comparison with conventional platforms.
Local entanglement generation in the adiabatic regime
Cliche, M.; Veitia, Andrzej
2010-09-15
We study entanglement generation in a pair of qubits interacting with an initially correlated system. Using time-independent perturbation theory and the adiabatic theorem, we show conditions under which the qubits become entangled as the joint system evolves into the ground state of the interacting theory. We then apply these results to the case of qubits interacting with a scalar quantum field. We study three different variations of this setup; a quantum field subject to Dirichlet boundary conditions, a quantum field interacting with a classical potential, and a quantum field that starts in a thermal state.
Mixed Species Ion Chains for Scalable Quantum Computation
NASA Astrophysics Data System (ADS)
Wright, John Albert
Mixed species chains of barium and ytterbium ions are investigated as a tool for building scalable quantum computation devices. Ytterbium ions provide a stable, environmentally-insensitive qubit that is easily initialized and manipulated, while barium ions are easily entangled with photons that can allow quantum information to be transmitted between systems in modular quantum computation units. Barium and ytterbium are trapped together in a linear chain in a linear rf trap and their normal mode structure and the thermal occupation numbers of these modes are measured with a narrow band laser addressing an electric quadrupole transition in barium ions. Before these measurements, barium ions are directly cooled using Doppler cooling, while the ytterbium ions are sympathetically cooled by the barium. For radial modes strongly coupled to ytterbium ions the average thermal occupation numbers vary between 400 and 12,000 depending on ion species configuration and trap parameters. Ion chain temperatures are also measured using a technique based on ion species reordering. Surface traps with many dc electrodes provide the ability to controllably reorder the chain to optimize normal mode cooling, and initial work towards realizing this capability are discussed. Quantum information can be transferred between ions in a linear chain using an optical system that is well coupled to the motional degrees of freedom of the chain. For this reason, a 532 nm Raman system is developed and its expected performance is evaluated.
Phonon-based scalable quantum computing and sensing (Presentation Video)
NASA Astrophysics Data System (ADS)
El-Kady, Ihab
2015-04-01
Quantum computing fundamentally depends on the ability to concurrently entangle and individually address/control a large number of qubits. In general, the primary inhibitors of large scale entanglement are qubit dependent; for example inhomogeneity in quantum dots, spectral crowding brought about by proximity-based entanglement in ions, weak interactions of neutral atoms, and the fabrication tolerances in the case of Si-vacancies or SQUIDs. We propose an inherently scalable solid-state qubit system with individually addressable qubits based on the coupling of a phonon with an acceptor impurity in a high-Q Phononic Crystal resonant cavity. Due to their unique nonlinear properties, phonons enable new opportunities for quantum devices and physics. We present a phononic crystal-based platform for observing the phonon analogy of cavity quantum electrodynamics, called phonodynamics, in a solid-state system. Practical schemes involve selective placement of a single acceptor atom in the peak of the strain field in a high-Q phononic crystal cavity that enables strong coupling of the phonon modes to the energy levels of the atom. A qubit is then created by entangling a phonon at the resonance frequency of the cavity with the atomic acceptor states. We show theoretical optimization of the cavity design and excitation waveguides, along with estimated performance figures of the phoniton system. Qubits based on this half-sound, half-matter quasi-particle, may outcompete other quantum architectures in terms of combined emission rate, coherence lifetime, and fabrication demands.
Using computer algebra for Yang-Baxterization applied to quantum computing
NASA Astrophysics Data System (ADS)
Vélez, Mario; Ospina, Juan
2006-05-01
Using Computer Algebra Software (Mathematica and Maple), the recently introduced topic of Yang- Baxterization applied to quantum computing, is explored from the mathematical and computational views. Some algorithms of computer algebra were elaborated with the aim to make the calculations to obtain some of results that were originally presented in the paper by Shang-Kauffman-Ge. Also certain new results about computational Yang-baxterization are presented. We obtain some Hamiltonians for hypothetical physical systems which can be realized within the domain of spin chains and certain diffusion process. We conclude that it is possible to have real physical systems on which implement, via Yang-baxterization, the standard quantum gates with topological protection. Finally some lines for future research are deligned.
Numerical analysis of boosting scheme for scalable NMR quantum computation
SaiToh, Akira; Kitagawa, Masahiro
2005-02-01
Among initialization schemes for ensemble quantum computation beginning at thermal equilibrium, the scheme proposed by Schulman and Vazirani [in Proceedings of the 31st ACM Symposium on Theory of Computing (STOC'99) (ACM Press, New York, 1999), pp. 322-329] is known for the simple quantum circuit to redistribute the biases (polarizations) of qubits and small time complexity. However, our numerical simulation shows that the number of qubits initialized by the scheme is rather smaller than expected from the von Neumann entropy because of an increase in the sum of the binary entropies of individual qubits, which indicates a growth in the total classical correlation. This result--namely, that there is such a significant growth in the total binary entropy--disagrees with that of their analysis.
Geometry of an adiabatic passage at a level crossing
Cholascinski, Mateusz
2005-06-15
We discuss adiabatic quantum phenomena at a level crossing. Given a path in the parameter space which passes through a degeneracy point, we find a criterion which determines whether the adiabaticity condition can be satisfied. For paths that can be traversed adiabatically we also derive a differential equation which specifies the time dependence of the system parameters, for which transitions between distinct energy levels can be neglected. We also generalize the well-known geometric connections to the case of adiabatic paths containing arbitrarily many level-crossing points and degenerate levels.
A fault-tolerant one-way quantum computer
Raussendorf, R. . E-mail: rraussendorf@perimeterinstitute.ca; Harrington, J.; Goyal, K.
2006-09-15
We describe a fault-tolerant one-way quantum computer on cluster states in three dimensions. The presented scheme uses methods of topological error correction resulting from a link between cluster states and surface codes. The error threshold is 1.4% for local depolarizing error and 0.11% for each source in an error model with preparation-, gate-, storage-, and measurement errors.
SYMBMAT: Symbolic computation of quantum transition matrix elements
NASA Astrophysics Data System (ADS)
Ciappina, M. F.; Kirchner, T.
2012-08-01
We have developed a set of Mathematica notebooks to compute symbolically quantum transition matrices relevant for atomic ionization processes. The utilization of a symbolic language allows us to obtain analytical expressions for the transition matrix elements required in charged-particle and laser induced ionization of atoms. Additionally, by using a few simple commands, it is possible to export these symbolic expressions to standard programming languages, such as Fortran or C, for the subsequent computation of differential cross sections or other observables. One of the main drawbacks in the calculation of transition matrices is the tedious algebraic work required when initial states other than the simple hydrogenic 1s state need to be considered. Using these notebooks the work is dramatically reduced and it is possible to generate exact expressions for a large set of bound states. We present explicit examples of atomic collisions (in First Born Approximation and Distorted Wave Theory) and laser-matter interactions (within the Dipole and Strong Field Approximations and different gauges) using both hydrogenic wavefunctions and Slater-Type Orbitals with arbitrary nlm quantum numbers as initial states. Catalogue identifier: AEMI_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEMI_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC license, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 71 628 No. of bytes in distributed program, including test data, etc.: 444 195 Distribution format: tar.gz Programming language: Mathematica Computer: Single machines using Linux or Windows (with cores with any clock speed, cache memory and bits in a word) Operating system: Any OS that supports Mathematica. The notebooks have been tested under Windows and Linux and with versions 6.x, 7.x and 8.x Classification: 2.6 Nature of problem
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.
Wigner Function Negativity and Contextuality in Quantum Computation on Rebits
NASA Astrophysics Data System (ADS)
Delfosse, Nicolas; Allard Guerin, Philippe; Bian, Jacob; Raussendorf, Robert
2015-04-01
We describe a universal scheme of quantum computation by state injection on rebits (states with real density matrices). For this scheme, we establish contextuality and Wigner function negativity as computational resources, extending results of M. Howard et al. [Nature (London) 510, 351 (2014), 10.1038/nature13460] to two-level systems. For this purpose, we define a Wigner function suited to systems of n rebits and prove a corresponding discrete Hudson's theorem. We introduce contextuality witnesses for rebit states and discuss the compatibility of our result with state-independent contextuality.
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
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
Classical and quantum annealing in the median of three-satisfiability
NASA Astrophysics Data System (ADS)
Neuhaus, T.; Peschina, M.; Michielsen, K.; de Raedt, H.
2011-01-01
We determine the classical and quantum complexities of a specific ensemble of three-satisfiability problems with a unique satisfying assignment for up to N=100 and 80 variables, respectively. In the classical limit, we employ generalized ensemble techniques and measure the time that a Markovian Monte Carlo process spends in searching classical ground states. In the quantum limit, we determine the maximum finite correlation length along a quantum adiabatic trajectory determined by the linear sweep of the adiabatic control parameter in the Hamiltonian composed of the problem Hamiltonian and the constant transverse field Hamiltonian. In the median of our ensemble, both complexities diverge exponentially with the number of variables. Hence, standard, conventional adiabatic quantum computation fails to reduce the computational complexity to polynomial. Moreover, the growth-rate constant in the quantum limit is 3.8 times as large as the one in the classical limit, making classical fluctuations more beneficial than quantum fluctuations in ground-state searches.