WorldWideScience

Sample records for quantum adiabatic algorithm

  1. Adiabatic quantum search algorithm for structured problems

    International Nuclear Information System (INIS)

    Roland, Jeremie; Cerf, Nicolas J.

    2003-01-01

    The study of quantum computation has been motivated by the hope of finding efficient quantum algorithms for solving classically hard problems. In this context, quantum algorithms by local adiabatic evolution have been shown to solve an unstructured search problem with a quadratic speedup over a classical search, just as Grover's algorithm. In this paper, we study how the structure of the search problem may be exploited to further improve the efficiency of these quantum adiabatic algorithms. We show that by nesting a partial search over a reduced set of variables into a global search, it is possible to devise quantum adiabatic algorithms with a complexity that, although still exponential, grows with a reduced order in the problem size

  2. Quantum Adiabatic Algorithms and Large Spin Tunnelling

    Science.gov (United States)

    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.

  3. Adiabatic quantum algorithm for search engine ranking.

    Science.gov (United States)

    Garnerone, Silvano; Zanardi, Paolo; Lidar, Daniel A

    2012-06-08

    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.

  4. Decoherence in adiabatic quantum computation

    Science.gov (United States)

    Albash, Tameem; Lidar, Daniel A.

    2015-06-01

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

  5. Adiabatic quantum computation

    Science.gov (United States)

    Albash, Tameem; Lidar, Daniel A.

    2018-01-01

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

  6. Transitionless driving on adiabatic search algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Oh, Sangchul, E-mail: soh@qf.org.qa [Qatar Environment and Energy Research Institute, Qatar Foundation, Doha (Qatar); Kais, Sabre, E-mail: kais@purdue.edu [Qatar Environment and Energy Research Institute, Qatar Foundation, Doha (Qatar); Department of Chemistry, Department of Physics and Birck Nanotechnology Center, Purdue University, West Lafayette, Indiana 47907 (United States)

    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.

  7. Adiabatic Quantum Transistors

    Directory of Open Access Journals (Sweden)

    Dave Bacon

    2013-06-01

    Full Text Available We describe a many-body quantum system that can be made to quantum compute by the adiabatic application of a large applied field to the system. Prior to the application of the field, quantum information is localized on one boundary of the device, and after the application of the field, this information propagates to the other side of the device, with a quantum circuit applied to the information. The applied circuit depends on the many-body Hamiltonian of the material, and the computation takes place in a degenerate ground space with symmetry-protected topological order. Such “adiabatic quantum transistors” are universal adiabatic quantum computing devices that have the added benefit of being modular. Here, we describe this model, provide arguments for why it is an efficient model of quantum computing, and examine these many-body systems in the presence of a noisy environment.

  8. Adiabatic quantum computing

    OpenAIRE

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

    2015-01-01

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

  9. Adiabatic quantum simulators

    Directory of Open Access Journals (Sweden)

    J. D. Biamonte

    2011-06-01

    Full Text Available In his famous 1981 talk, Feynman proposed that unlike classical computers, which would presumably experience an exponential slowdown when simulating quantum phenomena, a universal quantum simulator would not. An ideal quantum simulator would be controllable, and built using existing technology. In some cases, moving away from gate-model-based implementations of quantum computing may offer a more feasible solution for particular experimental implementations. Here we consider an adiabatic quantum simulator which simulates the ground state properties of sparse Hamiltonians consisting of one- and two-local interaction terms, using sparse Hamiltonians with at most three-local interactions. Properties of such Hamiltonians can be well approximated with Hamiltonians containing only two-local terms. The register holding the simulated ground state is brought adiabatically into interaction with a probe qubit, followed by a single diabatic gate operation on the probe which then undergoes free evolution until measured. This allows one to recover e.g. the ground state energy of the Hamiltonian being simulated. Given a ground state, this scheme can be used to verify the QMA-complete problem LOCAL HAMILTONIAN, and is therefore likely more powerful than classical computing.

  10. Adiabatic Quantum Computing

    Science.gov (United States)

    Landahl, Andrew

    2012-10-01

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

  11. Interacting adiabatic quantum motor

    Science.gov (United States)

    Bruch, Anton; Kusminskiy, Silvia Viola; Refael, Gil; von Oppen, Felix

    2018-05-01

    We present a field-theoretic treatment of an adiabatic quantum motor. We explicitly discuss a motor called the Thouless motor which is based on a Thouless pump operating in reverse. When a sliding periodic potential is considered to be the motor degree of freedom, a bias voltage applied to the electron channel sets the motor in motion. We investigate a Thouless motor whose electron channel is modeled as a Luttinger liquid. Interactions increase the gap opened by the periodic potential. For an infinite Luttinger liquid the coupling-induced friction is enhanced by electron-electron interactions. When the Luttinger liquid is ultimately coupled to Fermi liquid reservoirs, the dissipation reduces to its value for a noninteracting electron system for a constant motor velocity. Our results can also be applied to a motor based on a nanomagnet coupled to a quantum spin Hall edge.

  12. Ramsey numbers and adiabatic quantum computing.

    Science.gov (United States)

    Gaitan, Frank; Clark, Lane

    2012-01-06

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

  13. Accuracy versus run time in an adiabatic quantum search

    International Nuclear Information System (INIS)

    Rezakhani, A. T.; Pimachev, A. K.; Lidar, D. A.

    2010-01-01

    Adiabatic quantum algorithms are characterized by their run time and accuracy. The relation between the two is essential for quantifying adiabatic algorithmic performance yet is often poorly understood. We study the dynamics of a continuous time, adiabatic quantum search algorithm and find rigorous results relating the accuracy and the run time. Proceeding with estimates, we show that under fairly general circumstances the adiabatic algorithmic error exhibits a behavior with two discernible regimes: The error decreases exponentially for short times and then decreases polynomially for longer times. We show that the well-known quadratic speedup over classical search is associated only with the exponential error regime. We illustrate the results through examples of evolution paths derived by minimization of the adiabatic error. We also discuss specific strategies for controlling the adiabatic error and run time.

  14. Adiabatic quantum computation and quantum annealing theory and practice

    CERN Document Server

    McGeoch, Catherine C

    2014-01-01

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

  15. Random matrix model of adiabatic quantum computing

    International Nuclear Information System (INIS)

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

    2005-01-01

    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

  16. Approximability of optimization problems through adiabatic quantum computation

    CERN Document Server

    Cruz-Santos, William

    2014-01-01

    The adiabatic quantum computation (AQC) is based on the adiabatic theorem to approximate solutions of the Schrödinger equation. The design of an AQC algorithm involves the construction of a Hamiltonian that describes the behavior of the quantum system. This Hamiltonian is expressed as a linear interpolation of an initial Hamiltonian whose ground state is easy to compute, and a final Hamiltonian whose ground state corresponds to the solution of a given combinatorial optimization problem. The adiabatic theorem asserts that if the time evolution of a quantum system described by a Hamiltonian is l

  17. Adiabatic rotation, quantum search, and preparation of superposition states

    International Nuclear Information System (INIS)

    Siu, M. Stewart

    2007-01-01

    We introduce the idea of using adiabatic rotation to generate superpositions of a large class of quantum states. For quantum computing this is an interesting alternative to the well-studied 'straight line' adiabatic evolution. In ways that complement recent results, we show how to efficiently prepare three types of states: Kitaev's toric code state, the cluster state of the measurement-based computation model, and the history state used in the adiabatic simulation of a quantum circuit. We also show that the method, when adapted for quantum search, provides quadratic speedup as other optimal methods do with the advantages that the problem Hamiltonian is time independent and that the energy gap above the ground state is strictly nondecreasing with time. Likewise the method can be used for optimization as an alternative to the standard adiabatic algorithm

  18. Digitized adiabatic quantum computing with a superconducting circuit.

    Science.gov (United States)

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

    2016-06-09

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

  19. Quantum entangling power of adiabatically connected Hamiltonians

    International Nuclear Information System (INIS)

    Hamma, Alioscia; Zanardi, Paolo

    2004-01-01

    The space of quantum Hamiltonians has a natural partition in classes of operators that can be adiabatically deformed into each other. We consider parametric families of Hamiltonians acting on a bipartite quantum state space. When the different Hamiltonians in the family fall in the same adiabatic class, one can manipulate entanglement by moving through energy eigenstates corresponding to different values of the control parameters. We introduce an associated notion of adiabatic entangling power. This novel measure is analyzed for general dxd quantum systems, and specific two-qubit examples are studied

  20. Adiabatic condition and the quantum hitting time of Markov chains

    International Nuclear Information System (INIS)

    Krovi, Hari; Ozols, Maris; Roland, Jeremie

    2010-01-01

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

  1. Hierarchical theory of quantum adiabatic evolution

    International Nuclear Information System (INIS)

    Zhang, Qi; Wu, Biao; Gong, Jiangbin

    2014-01-01

    Quantum adiabatic evolution is a dynamical evolution of a quantum system under slow external driving. According to the quantum adiabatic theorem, no transitions occur between nondegenerate instantaneous energy eigenstates in such a dynamical evolution. However, this is true only when the driving rate is infinitesimally small. For a small nonzero driving rate, there are generally small transition probabilities between the energy eigenstates. We develop a classical mechanics framework to address the small deviations from the quantum adiabatic theorem order by order. A hierarchy of Hamiltonians is constructed iteratively with the zeroth-order Hamiltonian being determined by the original system Hamiltonian. The kth-order deviations are governed by a kth-order Hamiltonian, which depends on the time derivatives of the adiabatic parameters up to the kth-order. Two simple examples, the Landau–Zener model and a spin-1/2 particle in a rotating magnetic field, are used to illustrate our hierarchical theory. Our analysis also exposes a deep, previously unknown connection between classical adiabatic theory and quantum adiabatic theory. (paper)

  2. Quantum Adiabatic Optimization and Combinatorial Landscapes

    Science.gov (United States)

    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.

  3. Quantum adiabatic Markovian master equations

    International Nuclear Information System (INIS)

    Albash, Tameem; Zanardi, Paolo; Boixo, Sergio; Lidar, Daniel A

    2012-01-01

    We develop from first principles Markovian master equations suited for studying the time evolution of a system evolving adiabatically while coupled weakly to a thermal bath. We derive two sets of equations in the adiabatic limit, one using the rotating wave (secular) approximation that results in a master equation in Lindblad form, the other without the rotating wave approximation but not in Lindblad form. The two equations make markedly different predictions depending on whether or not the Lamb shift is included. Our analysis keeps track of the various time and energy scales associated with the various approximations we make, and thus allows for a systematic inclusion of higher order corrections, in particular beyond the adiabatic limit. We use our formalism to study the evolution of an Ising spin chain in a transverse field and coupled to a thermal bosonic bath, for which we identify four distinct evolution phases. While we do not expect this to be a generic feature, in one of these phases dissipation acts to increase the fidelity of the system state relative to the adiabatic ground state. (paper)

  4. Probing Entanglement in Adiabatic Quantum Optimization with Trapped Ions

    Directory of Open Access Journals (Sweden)

    Philipp eHauke

    2015-04-01

    Full Text Available Adiabatic quantum optimization has been proposed as a route to solve NP-complete problems, with a possible quantum speedup compared to classical algorithms. However, the precise role of quantum effects, such as entanglement, in these optimization protocols is still unclear. We propose a setup of cold trapped ions that allows one to quantitatively characterize, in a controlled experiment, the interplay of entanglement, decoherence, and non-adiabaticity in adiabatic quantum optimization. We show that, in this way, a broad class of NP-complete problems becomes accessible for quantum simulations, including the knapsack problem, number partitioning, and instances of the max-cut problem. Moreover, a general theoretical study reveals correlations of the success probability with entanglement at the end of the protocol. From exact numerical simulations for small systems and linear ramps, however, we find no substantial correlations with the entanglement during the optimization. For the final state, we derive analytically a universal upper bound for the success probability as a function of entanglement, which can be measured in experiment. The proposed trapped-ion setups and the presented study of entanglement address pertinent questions of adiabatic quantum optimization, which may be of general interest across experimental platforms.

  5. Superconducting system for adiabatic quantum computing

    Energy Technology Data Exchange (ETDEWEB)

    Corato, V [Dipartimento di Ingegneria dell' Informazione, Second University of Naples, 81031 Aversa (Italy); Roscilde, T [Department of Physics and Astronomy, University of Southern California, Los Angeles, CA 90089-0484 (Canada); Ruggiero, B [Istituto di Cibernetica ' E.Caianiello' del CNR, I-80078, Pozzuoli (Italy); Granata, C [Istituto di Cibernetica ' E.Caianiello' del CNR, I-80078, Pozzuoli (Italy); Silvestrini, P [Dipartimento di Ingegneria dell' Informazione, Second University of Naples, 81031 Aversa (Italy)

    2006-06-01

    We study the Hamiltonian of a system of inductively coupled flux qubits, which has been theoretically proposed for adiabatic quantum computation to handle NP problems. We study the evolution of a basic structure consisting of three coupled rf-SQUIDs upon tuning the external flux bias, and we show that the adiabatic nature of the evolution is guaranteed by the presence of the single-SQUID gap. We further propose a scheme and the first realization of an experimental device suitable for verifying the theoretical results.

  6. Adiabatic Quantum Optimization for Associative Memory Recall

    Directory of Open Access Journals (Sweden)

    Hadayat eSeddiqi

    2014-12-01

    Full Text Available 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.

  7. Adiabatic Quantum Optimization for Associative Memory Recall

    Science.gov (United States)

    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.

  8. Adiabatic Theorem for Quantum Spin Systems

    Science.gov (United States)

    Bachmann, S.; De Roeck, W.; Fraas, M.

    2017-08-01

    The first proof of the quantum adiabatic theorem was given as early as 1928. Today, this theorem is increasingly applied in a many-body context, e.g., in quantum annealing and in studies of topological properties of matter. In this setup, the rate of variation ɛ of local terms is indeed small compared to the gap, but the rate of variation of the total, extensive Hamiltonian, is not. Therefore, applications to many-body systems are not covered by the proofs and arguments in the literature. In this Letter, we prove a version of the adiabatic theorem for gapped ground states of interacting quantum spin systems, under assumptions that remain valid in the thermodynamic limit. As an application, we give a mathematical proof of Kubo's linear response formula for a broad class of gapped interacting systems. We predict that the density of nonadiabatic excitations is exponentially small in the driving rate and the scaling of the exponent depends on the dimension.

  9. Quantum adiabatic approximation and the geometric phase

    International Nuclear Information System (INIS)

    Mostafazadeh, A.

    1997-01-01

    A precise definition of an adiabaticity parameter ν of a time-dependent Hamiltonian is proposed. A variation of the time-dependent perturbation theory is presented which yields a series expansion of the evolution operator U(τ)=summation scr(l) U (scr(l)) (τ) with U (scr(l)) (τ) being at least of the order ν scr(l) . In particular, U (0) (τ) corresponds to the adiabatic approximation and yields Berry close-quote s adiabatic phase. It is shown that this series expansion has nothing to do with the 1/τ expansion of U(τ). It is also shown that the nonadiabatic part of the evolution operator is generated by a transformed Hamiltonian which is off-diagonal in the eigenbasis of the initial Hamiltonian. This suggests the introduction of an adiabatic product expansion for U(τ) which turns out to yield exact expressions for U(τ) for a large number of quantum systems. In particular, a simple application of the adiabatic product expansion is used to show that for the Hamiltonian describing the dynamics of a magnetic dipole in an arbitrarily changing magnetic field, there exists another Hamiltonian with the same eigenvectors for which the Schroedinger equation is exactly solvable. Some related issues concerning geometric phases and their physical significance are also discussed. copyright 1997 The American Physical Society

  10. Adiabatic graph-state quantum computation

    International Nuclear Information System (INIS)

    Antonio, B; Anders, J; Markham, D

    2014-01-01

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

  11. Trapped Ion Quantum Computation by Adiabatic Passage

    International Nuclear Information System (INIS)

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

    2008-01-01

    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.

  12. Adiabatic perturbation theory in quantum dynamics

    CERN Document Server

    Teufel, Stefan

    2003-01-01

    Separation of scales plays a fundamental role in the understanding of the dynamical behaviour of complex systems in physics and other natural sciences. A prominent example is the Born-Oppenheimer approximation in molecular dynamics. This book focuses on a recent approach to adiabatic perturbation theory, which emphasizes the role of effective equations of motion and the separation of the adiabatic limit from the semiclassical limit. A detailed introduction gives an overview of the subject and makes the later chapters accessible also to readers less familiar with the material. Although the general mathematical theory based on pseudodifferential calculus is presented in detail, there is an emphasis on concrete and relevant examples from physics. Applications range from molecular dynamics to the dynamics of electrons in a crystal and from the quantum mechanics of partially confined systems to Dirac particles and nonrelativistic QED.

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

    Science.gov (United States)

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

    2015-01-28

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

  14. Decoherence in a scalable adiabatic quantum computer

    International Nuclear Information System (INIS)

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

    2006-01-01

    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

  15. Quantum tunneling in the adiabatic Dicke model

    International Nuclear Information System (INIS)

    Chen Gang; Chen Zidong; Liang Jiuqing

    2007-01-01

    The Dicke model describes N two-level atoms interacting with a single-mode bosonic field and exhibits a second-order phase transition from the normal to the superradiant phase. The energy levels are not degenerate in the normal phase but have degeneracy in the superradiant phase, where quantum tunneling occurs. By means of the Born-Oppenheimer approximation and the instanton method in quantum field theory, the tunneling splitting, inversely proportional to the tunneling rate for the adiabatic Dicke model, in the superradiant phase can be evaluated explicitly. It is shown that the tunneling splitting vanishes as exp(-N) for large N, whereas for small N it disappears as √(N)/exp(N). The dependence of the tunneling splitting on the relevant parameters, especially on the atom-field coupling strength, is also discussed

  16. Optimization using quantum mechanics: quantum annealing through adiabatic evolution

    International Nuclear Information System (INIS)

    Santoro, Giuseppe E; Tosatti, Erio

    2006-01-01

    We review here some recent work in the field of quantum annealing, alias adiabatic quantum computation. The idea of quantum annealing is to perform optimization by a quantum adiabatic evolution which tracks the ground state of a suitable time-dependent Hamiltonian, where 'ℎ' is slowly switched off. We illustrate several applications of quantum annealing strategies, starting from textbook toy-models-double-well potentials and other one-dimensional examples, with and without disorder. These examples display in a clear way the crucial differences between classical and quantum annealing. We then discuss applications of quantum annealing to challenging hard optimization problems, such as the random Ising model, the travelling salesman problem and Boolean satisfiability problems. The techniques used to implement quantum annealing are either deterministic Schroedinger's evolutions, for the toy models, or path-integral Monte Carlo and Green's function Monte Carlo approaches, for the hard optimization problems. The crucial role played by disorder and the associated non-trivial Landau-Zener tunnelling phenomena is discussed and emphasized. (topical review)

  17. Adiabatic quantum pumping and charge quantization

    International Nuclear Information System (INIS)

    Kashcheyevs, V; Aharony, A.; Entin-Wohlmanl, O.

    2004-01-01

    Full Text:Modern techniques for coherent manipulation of electrons at the nano scale (electrostatic gating, surface acoustic waves) allow for studies of the adiabatic quantum pumping effect - a directed current induced by a slowly varying external perturbation. Scattering theory of pumping predicts transfer of an almost integer number of electrons per cycle if instantaneous transmission is determined by a sequence of resonances. We show that this quantization can be explained in terms of loading/unloading quasi-bound virtual states, and derive a tool for analyzing quantized pumping induced by a general potential. This theory is applied to a simple model of pumping due to surface acoustic waves. The results reproduce all the qualitative features observed in actual experiments

  18. Majorization arrow in quantum-algorithm design

    International Nuclear Information System (INIS)

    Latorre, J.I.; Martin-Delgado, M.A.

    2002-01-01

    We apply majorization theory to study the quantum algorithms known so far and find that there is a majorization principle underlying the way they operate. Grover's algorithm is a neat instance of this principle where majorization works step by step until the optimal target state is found. Extensions of this situation are also found in algorithms based in quantum adiabatic evolution and the family of quantum phase-estimation algorithms, including Shor's algorithm. We state that in quantum algorithms the time arrow is a majorization arrow

  19. Building an adiabatic quantum computer simulation in the classroom

    Science.gov (United States)

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

    2018-05-01

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

  20. Quantum theory of NMR adiabatic pulses and their applications

    International Nuclear Information System (INIS)

    Ke, Y.

    1993-01-01

    Recently explosive developments of in vivo NMR spectroscopy (NMRS) and imaging (NMRI) in biological and medical sciences have resulted in the establishment of NMR as one of the most advanced major technique in life sciences. These developments have created huge demands for a variety of NMR adiabatic pulses with play a very important role in NMR experiments in vivo. In order to develop new NMR adiabatic pulses, a rigorous systematical quantum theory for this kind of pulses is greatly needed. Providing such a theory is one of the important goals of this dissertation. Quantum density matrix theory and product operator method have been used throughout this dissertation. Another goal, which is the major goal of this thesis research, is to use the quantum theory as a guide to develop new NMR adiabatic pulses and their applications. To fill this goal, a technique to construct a new type of adiabatic pulses, narrow band selective adiabatic pulses, has been invented, which is described through the example of constructing an adiabatic DANTE inversion pulse. This new adiabatic pulse is the first narrow band selective adiabatic pulses: Adiabatic homonuclear and heteronuclear spectral editing sequences. Unique to the first pulse sequence is a B 1 -field filter which is built by using two non-refocusing adiabatic full passage pulses to refocus the wanted signal and dephase unwanted signals. This extra filter greatly enhance the editing efficiency. Unlike commonly used heteronuclear spectral editing sequences which depend on the polarization transfer or spectral subtraction by phase cycling techniques, the second pulse sequences accomplishes the editing of heteronuclear J-coupled signals based on the fact that this sequence is transparent to the uncoupled spins and is equivalent a 90 degrees excitation pulse to the heteronuclear J-coupled spins. Experimental results have confirmed the ability of spectral editing with these two new sequences

  1. Quantum-circuit model of Hamiltonian search algorithms

    International Nuclear Information System (INIS)

    Roland, Jeremie; Cerf, Nicolas J.

    2003-01-01

    We analyze three different quantum search algorithms, namely, the traditional circuit-based Grover's algorithm, its continuous-time analog by Hamiltonian evolution, and the quantum search by local adiabatic evolution. We show that these algorithms are closely related in the sense that they all perform a rotation, at a constant angular velocity, from a uniform superposition of all states to the solution state. This makes it possible to implement the two Hamiltonian-evolution algorithms on a conventional quantum circuit, while keeping the quadratic speedup of Grover's original algorithm. It also clarifies the link between the adiabatic search algorithm and Grover's algorithm

  2. Adiabatically steered open quantum systems: Master equation and optimal phase

    International Nuclear Information System (INIS)

    Salmilehto, J.; Solinas, P.; Ankerhold, J.; Moettoenen, M.

    2010-01-01

    We introduce an alternative way to derive the generalized form of the master equation recently presented by J. P. Pekola et al. [Phys. Rev. Lett. 105, 030401 (2010)] for an adiabatically steered two-level quantum system interacting with a Markovian environment. The original derivation employed the effective Hamiltonian in the adiabatic basis with the standard interaction picture approach but without the usual secular approximation. Our approach is based on utilizing a master equation for a nonsteered system in the first superadiabatic basis. It is potentially efficient in obtaining higher-order equations. Furthermore, we show how to select the phases of the adiabatic eigenstates to minimize the local adiabatic parameter and how this selection leads to states which are invariant under a local gauge change. We also discuss the effects of the adiabatic noncyclic geometric phase on the master equation.

  3. Reducing multi-qubit interactions in adiabatic quantum computation without adding auxiliary qubits. Part 1: The "deduc-reduc" method and its application to quantum factorization of numbers

    OpenAIRE

    Tanburn, Richard; Okada, Emile; Dattani, Nike

    2015-01-01

    Adiabatic quantum computing has recently been used to factor 56153 [Dattani & Bryans, arXiv:1411.6758] at room temperature, which is orders of magnitude larger than any number attempted yet using Shor's algorithm (circuit-based quantum computation). However, this number is still vastly smaller than RSA-768 which is the largest number factored thus far on a classical computer. We address a major issue arising in the scaling of adiabatic quantum factorization to much larger numbers. Namely, the...

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

    Science.gov (United States)

    Adame, J.; Warzel, S.

    2015-11-01

    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.

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

    International Nuclear Information System (INIS)

    Adame, J.; Warzel, S.

    2015-01-01

    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

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

    Science.gov (United States)

    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.

  7. Adiabatic passage and ensemble control of quantum systems

    International Nuclear Information System (INIS)

    Leghtas, Z; Sarlette, A; Rouchon, P

    2011-01-01

    This paper considers population transfer between eigenstates of a finite quantum ladder controlled by a classical electric field. Using an appropriate change of variables, we show that this setting can be set in the framework of adiabatic passage, which is known to facilitate ensemble control of quantum systems. Building on this insight, we present a mathematical proof of robustness for a control protocol-chirped pulse-practised by experimentalists to drive an ensemble of quantum systems from the ground state to the most excited state. We then propose new adiabatic control protocols using a single chirped and amplitude-shaped pulse, to robustly perform any permutation of eigenstate populations, on an ensemble of systems with unknown coupling strengths. These adiabatic control protocols are illustrated by simulations on a four-level ladder.

  8. Quantum trajectories for time-dependent adiabatic master equations

    Science.gov (United States)

    Yip, Ka Wa; Albash, Tameem; Lidar, Daniel A.

    2018-02-01

    We describe a quantum trajectories technique for the unraveling of the quantum adiabatic master equation in Lindblad form. By evolving a complex state vector of dimension N instead of a complex density matrix of dimension N2, simulations of larger system sizes become feasible. The cost of running many trajectories, which is required to recover the master equation evolution, can be minimized by running the trajectories in parallel, making this method suitable for high performance computing clusters. In general, the trajectories method can provide up to a factor N advantage over directly solving the master equation. In special cases where only the expectation values of certain observables are desired, an advantage of up to a factor N2 is possible. We test the method by demonstrating agreement with direct solution of the quantum adiabatic master equation for 8-qubit quantum annealing examples. We also apply the quantum trajectories method to a 16-qubit example originally introduced to demonstrate the role of tunneling in quantum annealing, which is significantly more time consuming to solve directly using the master equation. The quantum trajectories method provides insight into individual quantum jump trajectories and their statistics, thus shedding light on open system quantum adiabatic evolution beyond the master equation.

  9. Quantum Computation and Algorithms

    International Nuclear Information System (INIS)

    Biham, O.; Biron, D.; Biham, E.; Grassi, M.; Lidar, D.A.

    1999-01-01

    It is now firmly established that quantum algorithms provide a substantial speedup over classical algorithms for a variety of problems, including the factorization of large numbers and the search for a marked element in an unsorted database. In this talk I will review the principles of quantum algorithms, the basic quantum gates and their operation. The combination of superposition and interference, that makes these algorithms efficient, will be discussed. In particular, Grover's search algorithm will be presented as an example. I will show that the time evolution of the amplitudes in Grover's algorithm can be found exactly using recursion equations, for any initial amplitude distribution

  10. Fast-forward of quantum adiabatic dynamics in electro-magnetic field

    OpenAIRE

    Masuda, Shumpei; Nakamura, Katsuhiro

    2010-01-01

    We show a method to accelerate quantum adiabatic dynamics of wavefunctions under electro-magnetic field by developing the previous theory (Masuda & Nakamura 2008 and 2010). Firstly we investigate the orbital dynamics of a charged particle. We derive the driving field which accelerates quantum adiabatic dynamics in order to obtain the final adiabatic states except for the spatially uniform phase such as the adiabatic phase in any desired short time. Fast-forward of adiabatic squeezing and tran...

  11. Quantum gate decomposition algorithms.

    Energy Technology Data Exchange (ETDEWEB)

    Slepoy, Alexander

    2006-07-01

    Quantum computing algorithms can be conveniently expressed in a format of a quantum logical circuits. Such circuits consist of sequential coupled operations, termed ''quantum gates'', or quantum analogs of bits called qubits. We review a recently proposed method [1] for constructing general ''quantum gates'' operating on an qubits, as composed of a sequence of generic elementary ''gates''.

  12. Quantum tunneling, adiabatic invariance and black hole spectroscopy

    Energy Technology Data Exchange (ETDEWEB)

    Li, Guo-Ping; Zu, Xiao-Tao [University of Electronic Science and Technology of China, School of Physical Electronics, Chengdu (China); Pu, Jin [University of Electronic Science and Technology of China, School of Physical Electronics, Chengdu (China); China West Normal University, College of Physics and Space Science, Nanchong (China); Jiang, Qing-Quan [China West Normal University, College of Physics and Space Science, Nanchong (China)

    2017-05-15

    In the tunneling framework, one of us, Jiang, together with Han has studied the black hole spectroscopy via adiabatic invariance, where the adiabatic invariant quantity has been intriguingly obtained by investigating the oscillating velocity of the black hole horizon. In this paper, we attempt to improve Jiang-Han's proposal in two ways. Firstly, we once again examine the fact that, in different types (Schwarzschild and Painleve) of coordinates as well as in different gravity frames, the adiabatic invariant I{sub adia} = circular integral p{sub i}dq{sub i} introduced by Jiang and Han is canonically invariant. Secondly, we attempt to confirm Jiang-Han's proposal reasonably in more general gravity frames (including Einstein's gravity, EGB gravity and HL gravity). Concurrently, for improving this proposal, we interestingly find in more general gravity theories that the entropy of the black hole is an adiabatic invariant action variable, but the horizon area is only an adiabatic invariant. In this sense, we emphasize the concept that the quantum of the black hole entropy is more natural than that of the horizon area. (orig.)

  13. Quantum tunneling, adiabatic invariance and black hole spectroscopy

    Science.gov (United States)

    Li, Guo-Ping; Pu, Jin; Jiang, Qing-Quan; Zu, Xiao-Tao

    2017-05-01

    In the tunneling framework, one of us, Jiang, together with Han has studied the black hole spectroscopy via adiabatic invariance, where the adiabatic invariant quantity has been intriguingly obtained by investigating the oscillating velocity of the black hole horizon. In this paper, we attempt to improve Jiang-Han's proposal in two ways. Firstly, we once again examine the fact that, in different types (Schwarzschild and Painlevé) of coordinates as well as in different gravity frames, the adiabatic invariant I_adia = \\oint p_i dq_i introduced by Jiang and Han is canonically invariant. Secondly, we attempt to confirm Jiang-Han's proposal reasonably in more general gravity frames (including Einstein's gravity, EGB gravity and HL gravity). Concurrently, for improving this proposal, we interestingly find in more general gravity theories that the entropy of the black hole is an adiabatic invariant action variable, but the horizon area is only an adiabatic invariant. In this sense, we emphasize the concept that the quantum of the black hole entropy is more natural than that of the horizon area.

  14. Portfolios of quantum algorithms.

    Science.gov (United States)

    Maurer, S M; Hogg, T; Huberman, B A

    2001-12-17

    Quantum computation holds promise for the solution of many intractable problems. However, since many quantum algorithms are stochastic in nature they can find the solution of hard problems only probabilistically. Thus the efficiency of the algorithms has to be characterized by both the expected time to completion and the associated variance. In order to minimize both the running time and its uncertainty, we show that portfolios of quantum algorithms analogous to those of finance can outperform single algorithms when applied to the NP-complete problems such as 3-satisfiability.

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

    Science.gov (United States)

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

    2008-12-01

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

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

    International Nuclear Information System (INIS)

    Pecar, P; Zimic, N; Mraz, M; Lebar Bajec, I; Ramsak, A

    2008-01-01

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

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

    Science.gov (United States)

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

    2008-12-10

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

  18. Novel latch for adiabatic quantum-flux-parametron logic

    International Nuclear Information System (INIS)

    Takeuchi, Naoki; Yamanashi, Yuki; Yoshikawa, Nobuyuki; Ortlepp, Thomas

    2014-01-01

    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)

  19. Quantum Computations: Fundamentals and Algorithms

    International Nuclear Information System (INIS)

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

    2007-01-01

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

  20. Algorithmic complexity of quantum capacity

    Science.gov (United States)

    Oskouei, Samad Khabbazi; Mancini, Stefano

    2018-04-01

    We analyze the notion of quantum capacity from the perspective of algorithmic (descriptive) complexity. To this end, we resort to the concept of semi-computability in order to describe quantum states and quantum channel maps. We introduce algorithmic entropies (like algorithmic quantum coherent information) and derive relevant properties for them. Then we show that quantum capacity based on semi-computable concept equals the entropy rate of algorithmic coherent information, which in turn equals the standard quantum capacity. Thanks to this, we finally prove that the quantum capacity, for a given semi-computable channel, is limit computable.

  1. Adiabatic quantum-flux-parametron cell library adopting minimalist design

    Energy Technology Data Exchange (ETDEWEB)

    Takeuchi, Naoki, E-mail: takeuchi-naoki-kx@ynu.jp [Institute of Advanced Sciences, Yokohama National University, 79-5 Tokiwadai, Hodogaya, Yokohama 240-8501 (Japan); Yamanashi, Yuki; Yoshikawa, Nobuyuki [Institute of Advanced Sciences, Yokohama National University, 79-5 Tokiwadai, Hodogaya, Yokohama 240-8501 (Japan); Department of Electrical and Computer Engineering, Yokohama National University, 79-5 Tokiwadai, Hodogaya, Yokohama 240-8501 (Japan)

    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.

  2. Adiabatic quantum-flux-parametron cell library adopting minimalist design

    International Nuclear Information System (INIS)

    Takeuchi, Naoki; Yamanashi, Yuki; Yoshikawa, Nobuyuki

    2015-01-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

  3. Quantum learning algorithms for quantum measurements

    Energy Technology Data Exchange (ETDEWEB)

    Bisio, Alessandro, E-mail: alessandro.bisio@unipv.it [QUIT Group, Dipartimento di Fisica ' A. Volta' and INFN, via Bassi 6, 27100 Pavia (Italy); D' Ariano, Giacomo Mauro, E-mail: dariano@unipv.it [QUIT Group, Dipartimento di Fisica ' A. Volta' and INFN, via Bassi 6, 27100 Pavia (Italy); Perinotti, Paolo, E-mail: paolo.perinotti@unipv.it [QUIT Group, Dipartimento di Fisica ' A. Volta' and INFN, via Bassi 6, 27100 Pavia (Italy); Sedlak, Michal, E-mail: michal.sedlak@unipv.it [QUIT Group, Dipartimento di Fisica ' A. Volta' and INFN, via Bassi 6, 27100 Pavia (Italy); Institute of Physics, Slovak Academy of Sciences, Dubravska cesta 9, 845 11 Bratislava (Slovakia)

    2011-09-12

    We study quantum learning algorithms for quantum measurements. The optimal learning algorithm is derived for arbitrary von Neumann measurements in the case of training with one or two examples. The analysis of the case of three examples reveals that, differently from the learning of unitary gates, the optimal algorithm for learning of quantum measurements cannot be parallelized, and requires quantum memories for the storage of information. -- Highlights: → Optimal learning algorithm for von Neumann measurements. → From 2 copies to 1 copy: the optimal strategy is parallel. → From 3 copies to 1 copy: the optimal strategy must be non-parallel.

  4. Quantum learning algorithms for quantum measurements

    International Nuclear Information System (INIS)

    Bisio, Alessandro; D'Ariano, Giacomo Mauro; Perinotti, Paolo; Sedlak, Michal

    2011-01-01

    We study quantum learning algorithms for quantum measurements. The optimal learning algorithm is derived for arbitrary von Neumann measurements in the case of training with one or two examples. The analysis of the case of three examples reveals that, differently from the learning of unitary gates, the optimal algorithm for learning of quantum measurements cannot be parallelized, and requires quantum memories for the storage of information. -- Highlights: → Optimal learning algorithm for von Neumann measurements. → From 2 copies to 1 copy: the optimal strategy is parallel. → From 3 copies to 1 copy: the optimal strategy must be non-parallel.

  5. Quasi-adiabatic Switching for Metal-Island Quantum-dot Cellular Automata

    OpenAIRE

    Toth, Geza; Lent, Craig S.

    2000-01-01

    Recent experiments have demonstrated a working cell suitable for implementing the Quantum-dot Cellular Automata (QCA) paradigm. These experiments have been performed using metal island clusters. The most promising approach to QCA operation involves quasi-adiabatically switching the cells. This has been analyzed extensively in gated semiconductor cells. Here we present a metal island cell structure that makes quasi-adiabatic switching possible. We show how this permits quasi-adiabatic clocking...

  6. Connection between optimal control theory and adiabatic-passage techniques in quantum systems

    Science.gov (United States)

    Assémat, E.; Sugny, D.

    2012-08-01

    This work explores the relationship between optimal control theory and adiabatic passage techniques in quantum systems. The study is based on a geometric analysis of the Hamiltonian dynamics constructed from Pontryagin's maximum principle. In a three-level quantum system, we show that the stimulated Raman adiabatic passage technique can be associated to a peculiar Hamiltonian singularity. One deduces that the adiabatic pulse is solution of the optimal control problem only for a specific cost functional. This analysis is extended to the case of a four-level quantum system.

  7. Topological structures of adiabatic phase for multi-level quantum systems

    International Nuclear Information System (INIS)

    Liu Zhengxin; Zhou Xiaoting; Liu Xin; Liu Xiongjun; Chen Jingling

    2007-01-01

    The topological properties of adiabatic gauge fields for multi-level (three-level in particular) quantum systems are studied in detail. Similar to the result that the adiabatic gauge field for SU(2) systems (e.g. two-level quantum system or angular momentum systems, etc) has a monopole structure, the curvature 2-forms of the adiabatic holonomies for SU(3) three-level and SU(3) eight-level quantum systems are shown to have monopole-like (for all levels) or instanton-like (for the degenerate levels) structures

  8. Quantum algorithms and learning theory

    NARCIS (Netherlands)

    Arunachalam, S.

    2018-01-01

    This thesis studies strengths and weaknesses of quantum computers. In the first part we present three contributions to quantum algorithms. 1) consider a search space of N elements. One of these elements is "marked" and our goal is to find this. We describe a quantum algorithm to solve this problem

  9. Quantum entanglement and quantum computational algorithms

    Indian Academy of Sciences (India)

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

  10. Non-adiabatic effect on Laughlin's argument of the quantum Hall effect

    International Nuclear Information System (INIS)

    Maruyama, I; Hatsugai, Y

    2009-01-01

    We have numerically studied a non-adiabatic charge transport in the quantum Hall system pumped by a magnetic flux, as one of the simplest theoretical realizations of non-adiabatic Thouless pumping. In the adiabatic limit, a pumped charge is quantized, known as Laughlin's argument in a cylindrical lattice. In a uniform electric field, we obtained a formula connecting quantized pumping in the adiabatic limit and no-pumping in the sudden limit. The intermediate region between the two limits is determined by the Landau gap. A randomness or impurity effect is also discussed.

  11. Quantum walks and search algorithms

    CERN Document Server

    Portugal, Renato

    2013-01-01

    This book addresses an interesting area of quantum computation called quantum walks, which play an important role in building quantum algorithms, in particular search algorithms. Quantum walks are the quantum analogue of classical random walks. It is known that quantum computers have great power for searching unsorted databases. This power extends to many kinds of searches, particularly to the problem of finding a specific location in a spatial layout, which can be modeled by a graph. The goal is to find a specific node knowing that the particle uses the edges to jump from one node to the next. This book is self-contained with main topics that include: Grover's algorithm, describing its geometrical interpretation and evolution by means of the spectral decomposition of the evolution operater Analytical solutions of quantum walks on important graphs like line, cycles, two-dimensional lattices, and hypercubes using Fourier transforms Quantum walks on generic graphs, describing methods to calculate the limiting d...

  12. A quantum causal discovery algorithm

    Science.gov (United States)

    Giarmatzi, Christina; Costa, Fabio

    2018-03-01

    Finding a causal model for a set of classical variables is now a well-established task—but what about the quantum equivalent? Even the notion of a quantum causal model is controversial. Here, we present a causal discovery algorithm for quantum systems. The input to the algorithm is a process matrix describing correlations between quantum events. Its output consists of different levels of information about the underlying causal model. Our algorithm determines whether the process is causally ordered by grouping the events into causally ordered non-signaling sets. It detects if all relevant common causes are included in the process, which we label Markovian, or alternatively if some causal relations are mediated through some external memory. For a Markovian process, it outputs a causal model, namely the causal relations and the corresponding mechanisms, represented as quantum states and channels. Our algorithm opens the route to more general quantum causal discovery methods.

  13. On the adiabatic theorem in quantum statistical mechanics

    International Nuclear Information System (INIS)

    Narnhofer, H.; Thirring, W.

    1982-01-01

    We show that with suitable assumptions the equilibrium states are exactly the states invariant under adiabatic local perturbations. The relevance of this fact to the problem of ergodicity is discussed. (Author)

  14. Adiabatic approximation with exponential accuracy for many-body systems and quantum computation

    International Nuclear Information System (INIS)

    Lidar, Daniel A.; Rezakhani, Ali T.; Hamma, Alioscia

    2009-01-01

    We derive a version of the adiabatic theorem that is especially suited for applications in adiabatic quantum computation, where it is reasonable to assume that the adiabatic interpolation between the initial and final Hamiltonians is controllable. Assuming that the Hamiltonian is analytic in a finite strip around the real-time axis, that some number of its time derivatives vanish at the initial and final times, and that the target adiabatic eigenstate is nondegenerate and separated by a gap from the rest of the spectrum, we show that one can obtain an error between the final adiabatic eigenstate and the actual time-evolved state which is exponentially small in the evolution time, where this time itself scales as the square of the norm of the time derivative of the Hamiltonian divided by the cube of the minimal gap.

  15. Adiabatic evolution, quantum phases, and Landau-Zener transitions in strong radiation fields

    International Nuclear Information System (INIS)

    Breuer, H.P.; Dietz, K.; Holthaus, M.

    1990-07-01

    We develop a method that allows the investigation of adiabatic evolution in periodically driven quantum systems. It is shown how Berry's geometrical phase emerges in quantum optics. We analyse microwave experiments performed on Rydberg atoms and suggest a new, non-perturbative mechanism to produce excited atomic states. (orig.)

  16. Quasideterministic generation of maximally entangled states of two mesoscopic atomic ensembles by adiabatic quantum feedback

    International Nuclear Information System (INIS)

    Di Lisi, Antonio; De Siena, Silvio; Illuminati, Fabrizio; Vitali, David

    2005-01-01

    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

  17. Rapid adiabatic passage in quantum dots: Influence of scattering and dephasing

    DEFF Research Database (Denmark)

    Schuh, K.; Jahnke, F.; Lorke, Michael

    2011-01-01

    Theoretical investigations for the realization of population inversion of semiconductor quantum dot ground-state transitions by means of adiabatic passage with chirped optical pulses are presented. While the inversion due to Rabi oscillations depends sensitively on the resonance condition...... to describe carrier scattering and dephasing in the corresponding simulations and allow to quantify the conditions to simultaneously invert an ensamble of quantum dots....

  18. Boosting work characteristics and overall heat engine performance via shortcuts to adiabaticity: quantum and classical systems

    OpenAIRE

    Deng, Jiawen; Wang, Qing-hai; Liu, Zhihao; Hanggi, Peter; Gong, Jiangbin

    2013-01-01

    Under a general framework, shortcuts to adiabatic processes are shown to be possible in classical systems. We then study the distribution function of the work done on a small system initially prepared at thermal equilibrium. It is found that the work fluctuations can be significantly reduced via shortcuts to adiabatic processes. For example, in the classical case probabilities of having very large or almost zero work values are suppressed. In the quantum case negative work may be totally remo...

  19. Gossip algorithms in quantum networks

    Science.gov (United States)

    Siomau, Michael

    2017-01-01

    Gossip algorithms is a common term to describe protocols for unreliable information dissemination in natural networks, which are not optimally designed for efficient communication between network entities. We consider application of gossip algorithms to quantum networks and show that any quantum network can be updated to optimal configuration with local operations and classical communication. This allows to speed-up - in the best case exponentially - the quantum information dissemination. Irrespective of the initial configuration of the quantum network, the update requiters at most polynomial number of local operations and classical communication.

  20. Quantum Algorithms and Protocols

    National Research Council Canada - National Science Library

    Huntsman, Steve

    2001-01-01

    .... Foremost among the efforts in this vein is quantum information, which, largely on the basis of startling results on quantum teleportation and polynomial-time factoring, has evolved into a major scientific initiative...

  1. Gossip algorithms in quantum networks

    International Nuclear Information System (INIS)

    Siomau, Michael

    2017-01-01

    Gossip algorithms is a common term to describe protocols for unreliable information dissemination in natural networks, which are not optimally designed for efficient communication between network entities. We consider application of gossip algorithms to quantum networks and show that any quantum network can be updated to optimal configuration with local operations and classical communication. This allows to speed-up – in the best case exponentially – the quantum information dissemination. Irrespective of the initial configuration of the quantum network, the update requiters at most polynomial number of local operations and classical communication. - Highlights: • We analyze the performance of gossip algorithms in quantum networks. • Local operations and classical communication (LOCC) can speed the performance up. • The speed-up is exponential in the best case; the number of LOCC is polynomial.

  2. Gossip algorithms in quantum networks

    Energy Technology Data Exchange (ETDEWEB)

    Siomau, Michael, E-mail: siomau@nld.ds.mpg.de [Physics Department, Jazan University, P.O. Box 114, 45142 Jazan (Saudi Arabia); Network Dynamics, Max Planck Institute for Dynamics and Self-Organization (MPIDS), 37077 Göttingen (Germany)

    2017-01-23

    Gossip algorithms is a common term to describe protocols for unreliable information dissemination in natural networks, which are not optimally designed for efficient communication between network entities. We consider application of gossip algorithms to quantum networks and show that any quantum network can be updated to optimal configuration with local operations and classical communication. This allows to speed-up – in the best case exponentially – the quantum information dissemination. Irrespective of the initial configuration of the quantum network, the update requiters at most polynomial number of local operations and classical communication. - Highlights: • We analyze the performance of gossip algorithms in quantum networks. • Local operations and classical communication (LOCC) can speed the performance up. • The speed-up is exponential in the best case; the number of LOCC is polynomial.

  3. Optimally stopped variational quantum algorithms

    Science.gov (United States)

    Vinci, Walter; Shabani, Alireza

    2018-04-01

    Quantum processors promise a paradigm shift in high-performance computing which needs to be assessed by accurate benchmarking measures. In this article, we introduce a benchmark for the variational quantum algorithm (VQA), recently proposed as a heuristic algorithm for small-scale quantum processors. In VQA, a classical optimization algorithm guides the processor's quantum dynamics to yield the best solution for a given problem. A complete assessment of the scalability and competitiveness of VQA should take into account both the quality and the time of dynamics optimization. The method of optimal stopping, employed here, provides such an assessment by explicitly including time as a cost factor. Here, we showcase this measure for benchmarking VQA as a solver for some quadratic unconstrained binary optimization. Moreover, we show that a better choice for the cost function of the classical routine can significantly improve the performance of the VQA algorithm and even improve its scaling properties.

  4. Analysis of adiabatic transfer in cavity quantum electrodynamics

    Indian Academy of Sciences (India)

    adiabatic transfer process through the 'dark state' by a slow variation of the control laser intensity. ... control field of Rabi frequency C(t) transfers one photon in the cavity mode to a long- .... It gives an approximate statistical description of the.

  5. How do quantum numbers generally vary in the adiabatic transformation of an ideal gas?

    International Nuclear Information System (INIS)

    Yarman, T.; Kholmetskii, A. L.

    2011-01-01

    We continue to analyse the known law of adiabatic transformation for an ideal gas PV 5/3 = Constant, where P is the pressure and V is the volume, and following the approach of non-relativistic quantum mechanics which we suggested in a previous work (Yarman et al. 2010 Int. J. Phys. Sci. 5 1524). We explicitly determine the constant for the general parallelepiped geometry of a container. We also disclose how the quantum numbers associated with molecules of an ideal gas vary through an arbitrary adiabatic transformation. Physical implications of the results obtained are discussed. (physics of gases, plasmas, and electric discharges)

  6. Accuracy of the adiabatic-impulse approximation for closed and open quantum systems

    Science.gov (United States)

    Tomka, Michael; Campos Venuti, Lorenzo; Zanardi, Paolo

    2018-03-01

    We study the adiabatic-impulse approximation (AIA) as a tool to approximate the time evolution of quantum states when driven through a region of small gap. Such small-gap regions are a common situation in adiabatic quantum computing and having reliable approximations is important in this context. The AIA originates from the Kibble-Zurek theory applied to continuous quantum phase transitions. The Kibble-Zurek mechanism was developed to predict the power-law scaling of the defect density across a continuous quantum phase transition. Instead, here we quantify the accuracy of the AIA via the trace norm distance with respect to the exact evolved state. As expected, we find that for short times or fast protocols, the AIA outperforms the simple adiabatic approximation. However, for large times or slow protocols, the situation is actually reversed and the AIA provides a worse approximation. Nevertheless, we found a variation of the AIA that can perform better than the adiabatic one. This counterintuitive modification consists in crossing the region of small gap twice. Our findings are illustrated by several examples of driven closed and open quantum systems.

  7. Inhomogeneous quasi-adiabatic driving of quantum critical dynamics in weakly disordered spin chains

    International Nuclear Information System (INIS)

    Rams, Marek M; Mohseni, Masoud; Campo, Adolfo del

    2016-01-01

    We introduce an inhomogeneous protocol to drive a weakly disordered quantum spin chain quasi-adiabatically across a quantum phase transition and minimize the residual energy of the final state. The number of spins that simultaneously reach the critical point is controlled by the length scale in which the magnetic field is modulated, introducing an effective size that favors adiabatic dynamics. The dependence of the residual energy on this length scale and the velocity at which the magnetic field sweeps out the chain is shown to be nonmonotonic. We determine the conditions for an optimal suppression of the residual energy of the final state and show that inhomogeneous driving can outperform conventional adiabatic schemes based on homogeneous control fields by several orders of magnitude. (paper)

  8. Quantum state engineering with flux-biased Josephson phase qubits by rapid adiabatic passages

    Science.gov (United States)

    Nie, W.; Huang, J. S.; Shi, X.; Wei, L. F.

    2010-09-01

    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.PRLTAO0031-900710.1103/PhysRevLett.100.113601 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 π-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.

  9. Quantum state engineering with flux-biased Josephson phase qubits by rapid adiabatic passages

    International Nuclear Information System (INIS)

    Nie, W.; Huang, J. S.; Shi, X.; Wei, L. F.

    2010-01-01

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

  10. Non-adiabatic quantum state preparation and quantum state transport in chains of Rydberg atoms

    Science.gov (United States)

    Ostmann, Maike; Minář, Jiří; Marcuzzi, Matteo; Levi, Emanuele; Lesanovsky, Igor

    2017-12-01

    Motivated by recent progress in the experimental manipulation of cold atoms in optical lattices, we study three different protocols for non-adiabatic quantum state preparation and state transport in chains of Rydberg atoms. The protocols we discuss are based on the blockade mechanism between atoms which, when excited to a Rydberg state, interact through a van der Waals potential, and rely on single-site addressing. Specifically, we discuss protocols for efficient creation of an antiferromagnetic GHZ state, a class of matrix product states including a so-called Rydberg crystal and for the state transport of a single-qubit quantum state between two ends of a chain of atoms. We identify system parameters allowing for the operation of the protocols on timescales shorter than the lifetime of the Rydberg states while yielding high fidelity output states. We discuss the effect of positional disorder on the resulting states and comment on limitations due to other sources of noise such as radiative decay of the Rydberg states. The proposed protocols provide a testbed for benchmarking the performance of quantum information processing platforms based on Rydberg atoms.

  11. Scaling-Up Quantum Heat Engines Efficiently via Shortcuts to Adiabaticity

    Directory of Open Access Journals (Sweden)

    Mathieu Beau

    2016-04-01

    Full Text Available 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 non-interacting and hard-core bosons as limiting cases.

  12. Quantum algorithm for linear regression

    Science.gov (United States)

    Wang, Guoming

    2017-07-01

    We present a quantum algorithm for fitting a linear regression model to a given data set using the least-squares approach. Differently from previous algorithms which yield a quantum state encoding the optimal parameters, our algorithm outputs these numbers in the classical form. So by running it once, one completely determines the fitted model and then can use it to make predictions on new data at little cost. Moreover, our algorithm works in the standard oracle model, and can handle data sets with nonsparse design matrices. It runs in time poly( log2(N ) ,d ,κ ,1 /ɛ ) , where N is the size of the data set, d is the number of adjustable parameters, κ is the condition number of the design matrix, and ɛ is the desired precision in the output. We also show that the polynomial dependence on d and κ is necessary. Thus, our algorithm cannot be significantly improved. Furthermore, we also give a quantum algorithm that estimates the quality of the least-squares fit (without computing its parameters explicitly). This algorithm runs faster than the one for finding this fit, and can be used to check whether the given data set qualifies for linear regression in the first place.

  13. Continuous-time quantum algorithms for unstructured problems

    International Nuclear Information System (INIS)

    Hen, Itay

    2014-01-01

    We consider a family of unstructured optimization problems, for which we propose a method for constructing analogue, continuous-time (not necessarily adiabatic) quantum algorithms that are faster than their classical counterparts. In this family of problems, which we refer to as ‘scrambled input’ problems, one has to find a minimum-cost configuration of a given integer-valued n-bit black-box function whose input values have been scrambled in some unknown way. Special cases within this set of problems are Grover’s search problem of finding a marked item in an unstructured database, certain random energy models, and the functions of the Deutsch–Josza problem. We consider a couple of examples in detail. In the first, we provide an O(1) deterministic analogue quantum algorithm to solve the seminal problem of Deutsch and Josza, in which one has to determine whether an n-bit boolean function is constant (gives 0 on all inputs or 1 on all inputs) or balanced (returns 0 on half the input states and 1 on the other half). We also study one variant of the random energy model, and show that, as one might expect, its minimum energy configuration can be found quadratically faster with a quantum adiabatic algorithm than with classical algorithms. (paper)

  14. A review on quantum search algorithms

    Science.gov (United States)

    Giri, Pulak Ranjan; Korepin, Vladimir E.

    2017-12-01

    The use of superposition of states in quantum computation, known as quantum parallelism, has significant advantage in terms of speed over the classical computation. It is evident from the early invented quantum algorithms such as Deutsch's algorithm, Deutsch-Jozsa algorithm and its variation as Bernstein-Vazirani algorithm, Simon algorithm, Shor's algorithms, etc. Quantum parallelism also significantly speeds up the database search algorithm, which is important in computer science because it comes as a subroutine in many important algorithms. Quantum database search of Grover achieves the task of finding the target element in an unsorted database in a time quadratically faster than the classical computer. We review Grover's quantum search algorithms for a singe and multiple target elements in a database. The partial search algorithm of Grover and Radhakrishnan and its optimization by Korepin called GRK algorithm are also discussed.

  15. Quantum gas in the fast forward scheme of adiabatically expanding cavities: Force and equation of state

    Science.gov (United States)

    Babajanova, Gulmira; Matrasulov, Jasur; Nakamura, Katsuhiro

    2018-04-01

    With use of the scheme of fast forward which realizes quasistatic or adiabatic dynamics in shortened timescale, we investigate a thermally isolated ideal quantum gas confined in a rapidly dilating one-dimensional (1D) cavity with the time-dependent size L =L (t ) . In the fast-forward variants of equation of states, i.e., Bernoulli's formula and Poisson's adiabatic equation, the force or 1D analog of pressure can be expressed as a function of the velocity (L ˙) and acceleration (L ̈) of L besides rapidly changing state variables like effective temperature (T ) and L itself. The force is now a sum of nonadiabatic (NAD) and adiabatic contributions with the former caused by particles moving synchronously with kinetics of L and the latter by ideal bulk particles insensitive to such a kinetics. The ratio of NAD and adiabatic contributions does not depend on the particle number (N ) in the case of the soft-wall confinement, whereas such a ratio is controllable in the case of hard-wall confinement. We also reveal the condition when the NAD contribution overwhelms the adiabatic one and thoroughly changes the standard form of the equilibrium equation of states.

  16. Interpolation approach to Hamiltonian-varying quantum systems and the adiabatic theorem

    International Nuclear Information System (INIS)

    Pan, Yu; James, Matthew R.; Miao, Zibo; Amini, Nina H.; Ugrinovskii, Valery

    2015-01-01

    Quantum control could be implemented by varying the system Hamiltonian. According to adiabatic theorem, a slowly changing Hamiltonian can approximately keep the system at the ground state during the evolution if the initial state is a ground state. In this paper we consider this process as an interpolation between the initial and final Hamiltonians. We use the mean value of a single operator to measure the distance between the final state and the ideal ground state. This measure resembles the excitation energy or excess work performed in thermodynamics, which can be taken as the error of adiabatic approximation. We prove that under certain conditions, this error can be estimated for an arbitrarily given interpolating function. This error estimation could be used as guideline to induce adiabatic evolution. According to our calculation, the adiabatic approximation error is not linearly proportional to the average speed of the variation of the system Hamiltonian and the inverse of the energy gaps in many cases. In particular, we apply this analysis to an example in which the applicability of the adiabatic theorem is questionable. (orig.)

  17. Quantum signature scheme based on a quantum search algorithm

    International Nuclear Information System (INIS)

    Yoon, Chun Seok; Kang, Min Sung; Lim, Jong In; Yang, Hyung Jin

    2015-01-01

    We present a quantum signature scheme based on a two-qubit quantum search algorithm. For secure transmission of signatures, we use a quantum search algorithm that has not been used in previous quantum signature schemes. A two-step protocol secures the quantum channel, and a trusted center guarantees non-repudiation that is similar to other quantum signature schemes. We discuss the security of our protocol. (paper)

  18. Non-adiabatic molecular dynamics with complex quantum trajectories. I. The diabatic representation.

    Science.gov (United States)

    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.

  19. Adiabatic quantum games and phase-transition-like behavior between optimal strategies

    Science.gov (United States)

    de Ponte, M. A.; Santos, Alan C.

    2018-06-01

    In this paper we propose a game of a single qubit whose strategies can be implemented adiabatically. In addition, we show how to implement the strategies of a quantum game through controlled adiabatic evolutions, where we analyze the payment of a quantum player for various situations of interest: (1) when the players receive distinct payments, (2) when the initial state is an arbitrary superposition, and (3) when the device that implements the strategy is inefficient. Through a graphical analysis, it is possible to notice that the curves that represent the gains of the players present a behavior similar to the curves that give rise to a phase transition in thermodynamics. These transitions are associated with optimal strategy changes and occur in the absence of entanglement and interaction between the players.

  20. A Hybrid Chaotic Quantum Evolutionary Algorithm

    DEFF Research Database (Denmark)

    Cai, Y.; Zhang, M.; Cai, H.

    2010-01-01

    A hybrid chaotic quantum evolutionary algorithm is proposed to reduce amount of computation, speed up convergence and restrain premature phenomena of quantum evolutionary algorithm. The proposed algorithm adopts the chaotic initialization method to generate initial population which will form a pe...... tests. The presented algorithm is applied to urban traffic signal timing optimization and the effect is satisfied....

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

    Science.gov (United States)

    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

  2. Recall Performance for Content-Addressable Memory Using Adiabatic Quantum Optimization

    Energy Technology Data Exchange (ETDEWEB)

    Imam, Neena [ORNL; Humble, Travis S. [ORNL; McCaskey, Alex [ORNL; Schrock, Jonathan [ORNL; Hamilton, Kathleen E. [ORNL

    2017-09-01

    A content-addressable memory (CAM) stores key-value associations such that the key is recalled by providing its associated value. While CAM recall is traditionally performed using recurrent neural network models, we show how to solve this problem using adiabatic quantum optimization. Our approach maps the recurrent neural network to a commercially available quantum processing unit by taking advantage of the common underlying Ising spin model. We then assess the accuracy of the quantum processor to store key-value associations by quantifying recall performance against an ensemble of problem sets. We observe that different learning rules from the neural network community influence recall accuracy but performance appears to be limited by potential noise in the processor. The strong connection established between quantum processors and neural network problems supports the growing intersection of these two ideas.

  3. Path-integral isomorphic Hamiltonian for including nuclear quantum effects in non-adiabatic dynamics

    Science.gov (United States)

    Tao, Xuecheng; Shushkov, Philip; Miller, Thomas F.

    2018-03-01

    We describe a path-integral approach for including nuclear quantum effects in non-adiabatic chemical dynamics simulations. For a general physical system with multiple electronic energy levels, a corresponding isomorphic Hamiltonian is introduced such that Boltzmann sampling of the isomorphic Hamiltonian with classical nuclear degrees of freedom yields the exact quantum Boltzmann distribution for the original physical system. In the limit of a single electronic energy level, the isomorphic Hamiltonian reduces to the familiar cases of either ring polymer molecular dynamics (RPMD) or centroid molecular dynamics Hamiltonians, depending on the implementation. An advantage of the isomorphic Hamiltonian is that it can easily be combined with existing mixed quantum-classical dynamics methods, such as surface hopping or Ehrenfest dynamics, to enable the simulation of electronically non-adiabatic processes with nuclear quantum effects. We present numerical applications of the isomorphic Hamiltonian to model two- and three-level systems, with encouraging results that include improvement upon a previously reported combination of RPMD with surface hopping in the deep-tunneling regime.

  4. Duality quantum algorithm efficiently simulates open quantum systems

    Science.gov (United States)

    Wei, Shi-Jie; Ruan, Dong; Long, Gui-Lu

    2016-01-01

    Because of inevitable coupling with the environment, nearly all practical quantum systems are open system, where the evolution is not necessarily unitary. In this paper, we propose a duality quantum algorithm for simulating Hamiltonian evolution of an open quantum system. In contrast to unitary evolution in a usual quantum computer, the evolution operator in a duality quantum computer is a linear combination of unitary operators. In this duality quantum algorithm, the time evolution of the open quantum system is realized by using Kraus operators which is naturally implemented in duality quantum computer. This duality quantum algorithm has two distinct advantages compared to existing quantum simulation algorithms with unitary evolution operations. Firstly, the query complexity of the algorithm is O(d3) in contrast to O(d4) in existing unitary simulation algorithm, where d is the dimension of the open quantum system. Secondly, By using a truncated Taylor series of the evolution operators, this duality quantum algorithm provides an exponential improvement in precision compared with previous unitary simulation algorithm. PMID:27464855

  5. Approximate Quantum Adders with Genetic Algorithms: An IBM Quantum Experience

    Directory of Open Access Journals (Sweden)

    Li Rui

    2017-07-01

    Full Text Available It has been proven that quantum adders are forbidden by the laws of quantum mechanics. We analyze theoretical proposals for the implementation of approximate quantum adders and optimize them by means of genetic algorithms, improving previous protocols in terms of efficiency and fidelity. Furthermore, we experimentally realize a suitable approximate quantum adder with the cloud quantum computing facilities provided by IBM Quantum Experience. The development of approximate quantum adders enhances the toolbox of quantum information protocols, paving the way for novel applications in quantum technologies.

  6. Design and demonstration of adiabatic quantum-flux-parametron logic circuits with superconductor magnetic shields

    International Nuclear Information System (INIS)

    Inoue, Kenta; Narama, Tatsuya; Yamanashi, Yuki; Yoshikawa, Nobuyuki; Takeuchi, Naoki

    2015-01-01

    Adiabatic quantum-flux-parametron (AQFP) logic is an energy-efficient superconductor logic with zero static power and very small dynamic power due to adiabatic switching operations. In order to build large-scale digital circuits, we built AQFP logic cells using superconductor magnetic shields, which are necessary in order to avoid unwanted magnetic couplings between the cells and excitation currents. In preliminary experimental tests, we confirmed that the unwanted coupling became negligibly small thanks to the superconductor shields. As a demonstration, we designed a four-to-one multiplexor and a 16-junction full adder using the shielded logic cells. In both circuits, we confirmed correct logic operations with wide operation margins of excitation currents. These results indicate that large-scale AQFP digital circuits can be realized using the shielded logic cells. (paper)

  7. Quantum random-walk search algorithm

    International Nuclear Information System (INIS)

    Shenvi, Neil; Whaley, K. Birgitta; Kempe, Julia

    2003-01-01

    Quantum random walks on graphs have been shown to display many interesting properties, including exponentially fast hitting times when compared with their classical counterparts. However, it is still unclear how to use these novel properties to gain an algorithmic speedup over classical algorithms. In this paper, we present a quantum search algorithm based on the quantum random-walk architecture that provides such a speedup. It will be shown that this algorithm performs an oracle search on a database of N items with O(√(N)) calls to the oracle, yielding a speedup similar to other quantum search algorithms. It appears that the quantum random-walk formulation has considerable flexibility, presenting interesting opportunities for development of other, possibly novel quantum algorithms

  8. Shortcuts to adiabatic passage for fast generation of Greenberger-Horne-Zeilinger states by transitionless quantum driving.

    Science.gov (United States)

    Chen, Ye-Hong; Xia, Yan; Song, Jie; Chen, Qing-Qin

    2015-10-28

    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.

  9. Search for New Quantum Algorithms

    National Research Council Canada - National Science Library

    Lomonaco, Samuel J; Kauffman, Louis H

    2006-01-01

    .... Additionally, methods and techniques of quantum topology have been used to obtain new results in quantum computing including discovery of a relationship between quantum entanglement and topological linking...

  10. Deep proton tunneling in the electronically adiabatic and non-adiabatic limits: Comparison of the quantum and classical treatment of donor-acceptor motion in a protein environment

    Energy Technology Data Exchange (ETDEWEB)

    Benabbas, Abdelkrim; Salna, Bridget; Sage, J. Timothy; Champion, Paul M., E-mail: champ@neu.edu [Department of Physics and Center for Interdisciplinary Research on Complex Systems,Northeastern University, Boston, Massachusetts 02115 (United States)

    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

  11. Quantum algorithm for support matrix machines

    Science.gov (United States)

    Duan, Bojia; Yuan, Jiabin; Liu, Ying; Li, Dan

    2017-09-01

    We propose a quantum algorithm for support matrix machines (SMMs) that efficiently addresses an image classification problem by introducing a least-squares reformulation. This algorithm consists of two core subroutines: a quantum matrix inversion (Harrow-Hassidim-Lloyd, HHL) algorithm and a quantum singular value thresholding (QSVT) algorithm. The two algorithms can be implemented on a universal quantum computer with complexity O[log(npq) ] and O[log(pq)], respectively, where n is the number of the training data and p q is the size of the feature space. By iterating the algorithms, we can find the parameters for the SMM classfication model. Our analysis shows that both HHL and QSVT algorithms achieve an exponential increase of speed over their classical counterparts.

  12. Solving the Ternary Quantum-Dot Cellular Automata Logic Gate Problem by Means of Adiabatic Switching

    Science.gov (United States)

    Pecar, Primoz; Mraz, Miha; Zimic, Nikolaj; Janez, Miha; Lebar Bajec, Iztok

    2008-06-01

    Quantum-dot cellular automata (QCA) are one of the most promising alternative platforms of the future. Recent years have witnessed the development of basic logic structures as well as more complex processing structures, however most in the realm of binary logic. On the grounds that future platforms should not disregard the advantages of multi-valued logic, Lebar Bajec et al. were the first to show that quantum-dot cellular automata can be used for the implementation of ternary logic as well. In their study the ternary AND and OR logic functions proved to be the most troublesome primitive to implement. This research presents a revised solution that is based on adiabatic switching.

  13. Robust adiabatic approach to optical spin entangling in coupled quantum dots

    International Nuclear Information System (INIS)

    Gauger, Erik M; Benjamin, Simon C; Lovett, Brendon W; Nazir, Ahsan; Stace, Thomas M

    2008-01-01

    Excitonic transitions offer a possible route to ultrafast optical spin manipulation in coupled nanostructures. We perform here a detailed study of the three principal exciton-mediated decoherence channels for optically controlled electron spin qubits in coupled quantum dots: radiative decay of the excitonic state, exciton-phonon interactions, and Landau-Zener transitions between laser-dressed states. We consider a scheme for producing an entangling controlled-phase gate on a pair of coupled spins which, in its simplest dynamic form, renders the system subject to fast decoherence rates associated with exciton creation during the gating operation. In contrast, we show that an adiabatic approach employing off-resonant laser excitation allows us to suppress all sources of decoherence simultaneously, significantly increasing the fidelity of operations at only a relatively small gating time cost. We find that controlled-phase gates accurate to one part in 10 2 can realistically be achieved with the adiabatic approach, whereas the conventional dynamic approach does not appear to support a fidelity suitable for scalable quantum computation. Our predictions could be demonstrated experimentally in the near future

  14. Dissipation in adiabatic quantum computers: lessons from an exactly solvable model

    Science.gov (United States)

    Keck, Maximilian; Montangero, Simone; Santoro, Giuseppe E.; Fazio, Rosario; Rossini, Davide

    2017-11-01

    We introduce and study the adiabatic dynamics of free-fermion models subject to a local Lindblad bath and in the presence of a time-dependent Hamiltonian. The merit of these models is that they can be solved exactly, and will help us to study the interplay between nonadiabatic transitions and dissipation in many-body quantum systems. After the adiabatic evolution, we evaluate the excess energy (the average value of the Hamiltonian) as a measure of the deviation from reaching the final target ground state. We compute the excess energy in a variety of different situations, where the nature of the bath and the Hamiltonian is modified. We find robust evidence of the fact that an optimal working time for the quantum annealing protocol emerges as a result of the competition between the nonadiabatic effects and the dissipative processes. We compare these results with the matrix-product-operator simulations of an Ising system and show that the phenomenology we found also applies for this more realistic case.

  15. Exciton spectrum of surface-corrugated quantum wells: the adiabatic self-consistent approach

    International Nuclear Information System (INIS)

    Atenco A, N.; Perez R, F.; Makarov, N.M.

    2005-01-01

    A theory for calculating the relaxation frequency ν and the shift δ ω of exciton resonances in quantum wells with finite potential barriers and adiabatic surface disorder is developed. The adiabaticity implies that the correlation length R C for the well width fluctuations is much larger than the exciton radius a 0 (R C >> a 0 ). Our theory is based on the self-consistent Green's function method, and therefore takes into account the inherent action of the exciton scattering on itself. The self-consistent approach is shown to describe quantitatively the sharp exciton resonance. It also gives the qualitatively correct resonance picture for the transition to the classical limit, as well as within the domain of the classical limit itself. We present and analyze results for h h-exciton in a GaAs quantum well with Al 0.3 Ga 0.7 As barriers. It is established that the self-consistency and finite height of potential barriers significantly influence on the line-shape of exciton resonances, and make the values of ν and δ ω be quite realistic. In particular, the relaxation frequency ν for the ground-state resonance has a broad, almost symmetric maximum near the resonance frequency ω 0 , while the surface-induced resonance shift δ ω vanishes near ω 0 , and has different signs on the sides of the exciton resonance. (Author) 43 refs., 4 figs

  16. Error suppression and error correction in adiabatic quantum computation: non-equilibrium dynamics

    International Nuclear Information System (INIS)

    Sarovar, Mohan; Young, Kevin C

    2013-01-01

    While adiabatic quantum computing (AQC) has some robustness to noise and decoherence, it is widely believed that encoding, error suppression and error correction will be required to scale AQC to large problem sizes. Previous works have established at least two different techniques for error suppression in AQC. In this paper we derive a model for describing the dynamics of encoded AQC and show that previous constructions for error suppression can be unified with this dynamical model. In addition, the model clarifies the mechanisms of error suppression and allows the identification of its weaknesses. In the second half of the paper, we utilize our description of non-equilibrium dynamics in encoded AQC to construct methods for error correction in AQC by cooling local degrees of freedom (qubits). While this is shown to be possible in principle, we also identify the key challenge to this approach: the requirement of high-weight Hamiltonians. Finally, we use our dynamical model to perform a simplified thermal stability analysis of concatenated-stabilizer-code encoded many-body systems for AQC or quantum memories. This work is a companion paper to ‘Error suppression and error correction in adiabatic quantum computation: techniques and challenges (2013 Phys. Rev. X 3 041013)’, which provides a quantum information perspective on the techniques and limitations of error suppression and correction in AQC. In this paper we couch the same results within a dynamical framework, which allows for a detailed analysis of the non-equilibrium dynamics of error suppression and correction in encoded AQC. (paper)

  17. An efficient quantum algorithm for spectral estimation

    Science.gov (United States)

    Steffens, Adrian; Rebentrost, Patrick; Marvian, Iman; Eisert, Jens; Lloyd, Seth

    2017-03-01

    We develop an efficient quantum implementation of an important signal processing algorithm for line spectral estimation: the matrix pencil method, which determines the frequencies and damping factors of signals consisting of finite sums of exponentially damped sinusoids. Our algorithm provides a quantum speedup in a natural regime where the sampling rate is much higher than the number of sinusoid components. Along the way, we develop techniques that are expected to be useful for other quantum algorithms as well—consecutive phase estimations to efficiently make products of asymmetric low rank matrices classically accessible and an alternative method to efficiently exponentiate non-Hermitian matrices. Our algorithm features an efficient quantum-classical division of labor: the time-critical steps are implemented in quantum superposition, while an interjacent step, requiring much fewer parameters, can operate classically. We show that frequencies and damping factors can be obtained in time logarithmic in the number of sampling points, exponentially faster than known classical algorithms.

  18. Quantum Genetic Algorithms for Computer Scientists

    OpenAIRE

    Lahoz Beltrá, Rafael

    2016-01-01

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

  19. Prospective Algorithms for Quantum Evolutionary Computation

    OpenAIRE

    Sofge, Donald A.

    2008-01-01

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

  20. Using the J1–J2 quantum spin chain as an adiabatic quantum data bus

    International Nuclear Information System (INIS)

    Chancellor, Nicholas; Haas, Stephan

    2012-01-01

    This paper investigates numerically a phenomenon which can be used to transport a single q-bit down a J 1 –J 2 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. (paper)

  1. Hamiltonian Dynamics and Adiabatic Invariants for Time-Dependent Superconducting Qubit-Oscillators and Resonators in Quantum Computing Systems

    Directory of Open Access Journals (Sweden)

    Jeong Ryeol Choi

    2015-01-01

    Full Text Available An adiabatic invariant, which is a conserved quantity, is useful for studying quantum and classical properties of dynamical systems. Adiabatic invariants for time-dependent superconducting qubit-oscillator systems and resonators are investigated using the Liouville-von Neumann equation. At first, we derive an invariant for a simple superconducting qubit-oscillator through the introduction of its reduced Hamiltonian. Afterwards, an adiabatic invariant for a nanomechanical resonator linearly interfaced with a superconducting circuit, via a coupling with a time-dependent strength, is evaluated using the technique of unitary transformation. The accuracy of conservation for such invariant quantities is represented in detail. Based on the results of our developments in this paper, perturbation theory is applicable to the research of quantum characteristics of more complicated qubit systems that are described by a time-dependent Hamiltonian involving nonlinear terms.

  2. Quantum algorithms for testing Boolean functions

    Directory of Open Access Journals (Sweden)

    Erika Andersson

    2010-06-01

    Full Text Available We discuss quantum algorithms, based on the Bernstein-Vazirani algorithm, for finding which variables a Boolean function depends on. There are 2^n possible linear Boolean functions of n variables; given a linear Boolean function, the Bernstein-Vazirani quantum algorithm can deterministically identify which one of these Boolean functions we are given using just one single function query. The same quantum algorithm can also be used to learn which input variables other types of Boolean functions depend on, with a success probability that depends on the form of the Boolean function that is tested, but does not depend on the total number of input variables. We also outline a procedure to futher amplify the success probability, based on another quantum algorithm, the Grover search.

  3. Quantum Algorithms for Compositional Natural Language Processing

    Directory of Open Access Journals (Sweden)

    William Zeng

    2016-08-01

    Full Text Available We propose a new application of quantum computing to the field of natural language processing. Ongoing work in this field attempts to incorporate grammatical structure into algorithms that compute meaning. In (Coecke, Sadrzadeh and Clark, 2010, the authors introduce such a model (the CSC model based on tensor product composition. While this algorithm has many advantages, its implementation is hampered by the large classical computational resources that it requires. In this work we show how computational shortcomings of the CSC approach could be resolved using quantum computation (possibly in addition to existing techniques for dimension reduction. We address the value of quantum RAM (Giovannetti,2008 for this model and extend an algorithm from Wiebe, Braun and Lloyd (2012 into a quantum algorithm to categorize sentences in CSC. Our new algorithm demonstrates a quadratic speedup over classical methods under certain conditions.

  4. Chaos induced by quantum effect due to breakdown of the Born-Oppenheimer adiabaticity

    International Nuclear Information System (INIS)

    Fujisaki, Hiroshi; Takatsuka, Kazuo

    2001-01-01

    Chaos in the multimode nonadiabatic system constructed by Heller [J. Chem. Phys. >92, 1718 (1990)], which consists of two diabatic two-dimensional harmonic potentials with the Condon coupling, is studied. A thorough investigation is carried out by scanning the magnitudes of the Condon coupling and the Duschinsky angle. To elucidate mechanisms that can cause chaos in this quantum system, the statistical properties of the energy levels and eigenfunctions of the system are investigated. We find an evidence in terms of the nearest-neighbor spacing distribution of energy levels and other measures that a certain class of chaos is purely induced by the nonadiabatic interaction due to breakdown of the Born-Oppenheimer approximation. Since the nonadiabatic transition can induce repeated bifurcation and merging of a wave packet around the region of quasicrossing between two potential surfaces, and since this interaction does not have a counterpart in the lower adiabatic system, the present chaos deserves being called 'nonadiabatic chaos.' Another type of chaos in a nonadiabatic system was previously identified [D. M. Leitner et al., J. Chem. Phys. >104, 434 (1996)] that reflects the inherent chaos of a corresponding adiabatic potential. We present a comparative study to establish the similarity and difference between these kinds of chaos

  5. Approximations of time-dependent phenomena in quantum mechanics: adiabatic versus sudden processes

    International Nuclear Information System (INIS)

    Melnichuk, S V; Dijk, W van; Nogami, Y

    2005-01-01

    By means of a one-dimensional model of a particle in an infinite square-well potential with one wall moving at a constant speed, we examine aspects of time-dependent phenomena in quantum mechanics such as adiabatic and sudden processes. The particle is assumed to be initially in the ground state of the potential with its initial width. The time dependence of the wavefunction of the particle in the well is generally more complicated when the potential well is compressed than when it is expanded. We are particularly interested in the case in which the potential well is suddenly compressed. The so-called sudden approximation is not applicable in this case. We also study the energy of the particle in the changing well as a function of time for expansion and contraction as well as for expansion followed by contraction and vice versa

  6. Coherent states of quantum systems. [Hamiltonians, variable magnetic field, adiabatic approximation

    Energy Technology Data Exchange (ETDEWEB)

    Trifonov, D A

    1975-01-01

    Time-evolution of coherent states and uncertainty relations for quantum systems are considered as well as the relation between the various types of coherent states. The most general form of the Hamiltonians that keep the uncertainty products at a minimum is found using the coherent states. The minimum uncertainty packets are shown to be coherent states of the type nonstationary-system coherent states. Two specific systems, namely that of a generalized N-dimensional oscillator and that of a charged particle moving in a variable magnetic field, are treated as examples. The adiabatic approximation to the uncertainty products for these systems is also discussed and the minimality is found to be retained with an exponential accuracy.

  7. Quantum-classical dynamics of scattering processes in adiabatic and diabatic representations

    International Nuclear Information System (INIS)

    Puzari, Panchanan; Sarkar, Biplab; Adhikari, Satrajit

    2004-01-01

    We demonstrate the workability of a TDDVR based [J. Chem. Phys. 118, 5302 (2003)], novel quantum-classical approach, for simulating scattering processes on a quasi-Jahn-Teller model [J. Chem. Phys. 105, 9141 (1996)] surface. The formulation introduces a set of DVR grid points defined by the Hermite part of the basis set in each dimension and allows the movement of grid points around the central trajectory. With enough trajectories (grid points), the method converges to the exact quantum formulation whereas with only one grid point, we recover the conventional molecular dynamics approach. The time-dependent Schroedinger equation and classical equations of motion are solved self-consistently and electronic transitions are allowed anywhere in the configuration space among any number of coupled states. Quantum-classical calculations are performed on diabatic surfaces (two and three) to reveal the effects of symmetry on inelastic and reactive state-to-state transition probabilities, along with calculations on an adiabatic surface with ordinary Born-Oppenheimer approximation. Excellent agreement between TDDVR and DVR results is obtained in both the representations

  8. Non-adiabatic quantum evolution: The S matrix as a geometrical phase factor

    Energy Technology Data Exchange (ETDEWEB)

    Saadi, Y., E-mail: S_yahiadz@yahoo.fr [Laboratoire de Physique Quantique et Systèmes Dynamiques, Faculté des Sciences, Université Ferhat Abbas de Sétif, Sétif 19000 (Algeria); Maamache, M. [Laboratoire de Physique Quantique et Systèmes Dynamiques, Faculté des Sciences, Université Ferhat Abbas de Sétif, Sétif 19000 (Algeria)

    2012-03-19

    We present a complete derivation of the exact evolution of quantum mechanics for the case when the underlying spectrum is continuous. We base our discussion on the use of the Weyl eigendifferentials. We show that a quantum system being in an eigenstate of an invariant will remain in the subspace generated by the eigenstates of the invariant, thereby acquiring a generalized non-adiabatic or Aharonov–Anandan geometric phase linked to the diagonal element of the S matrix. The modified Pöschl–Teller potential and the time-dependent linear potential are worked out as illustrations. -- Highlights: ► In this Letter we study the exact quantum evolution for continuous spectra problems. ► We base our discussion on the use of the Weyl eigendifferentials. ► We give a generalized Lewis and Riesenfeld phase for continuous spectra. ► This generalized phase or Aharonov–Anandan geometric phase is linked to the S matrix. ► The modified Pöschl–Teller and the linear potential are worked out as illustrations.

  9. Exciton spectrum of surface-corrugated quantum wells: the adiabatic self-consistent approach

    Energy Technology Data Exchange (ETDEWEB)

    Atenco A, N.; Perez R, F. [lnstituto de Fisica, Universidad Autonoma de Puebla, A.P. J-48, 72570 Puebla (Mexico); Makarov, N.M. [lnstituto de Ciencias, Universidad Autonoma de Puebla, Priv. 17 Norte No 3417, Col. San Miguel Hueyotlipan, 72050 Puebla (Mexico)

    2005-07-01

    A theory for calculating the relaxation frequency {nu} and the shift {delta} {omega} of exciton resonances in quantum wells with finite potential barriers and adiabatic surface disorder is developed. The adiabaticity implies that the correlation length R{sub C} for the well width fluctuations is much larger than the exciton radius a{sub 0} (R{sub C} >> a{sub 0}). Our theory is based on the self-consistent Green's function method, and therefore takes into account the inherent action of the exciton scattering on itself. The self-consistent approach is shown to describe quantitatively the sharp exciton resonance. It also gives the qualitatively correct resonance picture for the transition to the classical limit, as well as within the domain of the classical limit itself. We present and analyze results for h h-exciton in a GaAs quantum well with Al{sub 0.3} Ga{sub 0.7}As barriers. It is established that the self-consistency and finite height of potential barriers significantly influence on the line-shape of exciton resonances, and make the values of {nu} and {delta} {omega} be quite realistic. In particular, the relaxation frequency {nu} for the ground-state resonance has a broad, almost symmetric maximum near the resonance frequency {omega}{sub 0}, while the surface-induced resonance shift {delta} {omega} vanishes near {omega}{sub 0}, and has different signs on the sides of the exciton resonance. (Author) 43 refs., 4 figs.

  10. LSB Based Quantum Image Steganography Algorithm

    Science.gov (United States)

    Jiang, Nan; Zhao, Na; Wang, Luo

    2016-01-01

    Quantum steganography is the technique which hides a secret message into quantum covers such as quantum images. In this paper, two blind LSB steganography algorithms in the form of quantum circuits are proposed based on the novel enhanced quantum representation (NEQR) for quantum images. One algorithm is plain LSB which uses the message bits to substitute for the pixels' LSB directly. The other is block LSB which embeds a message bit into a number of pixels that belong to one image block. The extracting circuits can regain the secret message only according to the stego cover. Analysis and simulation-based experimental results demonstrate that the invisibility is good, and the balance between the capacity and the robustness can be adjusted according to the needs of applications.

  11. Quantum entanglement and quantum computational algorithms

    Indian Academy of Sciences (India)

    We demonstrate that the one- and the two-bit Deutsch-Jozsa algorithm does not require entanglement and can be mapped onto a classical optical scheme. It is only for three and more input bits that the DJ algorithm requires the implementation of entangling transformations and in these cases it is impossible to implement ...

  12. Research on Palmprint Identification Method Based on Quantum Algorithms

    Directory of Open Access Journals (Sweden)

    Hui Li

    2014-01-01

    Full Text Available Quantum image recognition is a technology by using quantum algorithm to process the image information. It can obtain better effect than classical algorithm. In this paper, four different quantum algorithms are used in the three stages of palmprint recognition. First, quantum adaptive median filtering algorithm is presented in palmprint filtering processing. Quantum filtering algorithm can get a better filtering result than classical algorithm through the comparison. Next, quantum Fourier transform (QFT is used to extract pattern features by only one operation due to quantum parallelism. The proposed algorithm exhibits an exponential speed-up compared with discrete Fourier transform in the feature extraction. Finally, quantum set operations and Grover algorithm are used in palmprint matching. According to the experimental results, quantum algorithm only needs to apply square of N operations to find out the target palmprint, but the traditional method needs N times of calculation. At the same time, the matching accuracy of quantum algorithm is almost 100%.

  13. PLQP & Company: Decidable Logics for Quantum Algorithms

    Science.gov (United States)

    Baltag, Alexandru; Bergfeld, Jort; Kishida, Kohei; Sack, Joshua; Smets, Sonja; Zhong, Shengyang

    2014-10-01

    We introduce a probabilistic modal (dynamic-epistemic) quantum logic PLQP for reasoning about quantum algorithms. We illustrate its expressivity by using it to encode the correctness of the well-known quantum search algorithm, as well as of a quantum protocol known to solve one of the paradigmatic tasks from classical distributed computing (the leader election problem). We also provide a general method (extending an idea employed in the decidability proof in Dunn et al. (J. Symb. Log. 70:353-359, 2005)) for proving the decidability of a range of quantum logics, interpreted on finite-dimensional Hilbert spaces. We give general conditions for the applicability of this method, and in particular we apply it to prove the decidability of PLQP.

  14. Diffusion Monte Carlo approach versus adiabatic computation for local Hamiltonians

    Science.gov (United States)

    Bringewatt, Jacob; Dorland, William; Jordan, Stephen P.; Mink, Alan

    2018-02-01

    Most research regarding quantum adiabatic optimization has focused on stoquastic Hamiltonians, whose ground states can be expressed with only real non-negative amplitudes and thus for whom destructive interference is not manifest. This raises the question of whether classical Monte Carlo algorithms can efficiently simulate quantum adiabatic optimization with stoquastic Hamiltonians. Recent results have given counterexamples in which path-integral and diffusion Monte Carlo fail to do so. However, most adiabatic optimization algorithms, such as for solving MAX-k -SAT problems, use k -local Hamiltonians, whereas our previous counterexample for diffusion Monte Carlo involved n -body interactions. Here we present a 6-local counterexample which demonstrates that even for these local Hamiltonians there are cases where diffusion Monte Carlo cannot efficiently simulate quantum adiabatic optimization. Furthermore, we perform empirical testing of diffusion Monte Carlo on a standard well-studied class of permutation-symmetric tunneling problems and similarly find large advantages for quantum optimization over diffusion Monte Carlo.

  15. Boosting work characteristics and overall heat-engine performance via shortcuts to adiabaticity: quantum and classical systems.

    Science.gov (United States)

    Deng, Jiawen; Wang, Qing-hai; Liu, Zhihao; Hänggi, Peter; Gong, Jiangbin

    2013-12-01

    Under a general framework, shortcuts to adiabatic processes are shown to be possible in classical systems. We study the distribution function of the work done on a small system initially prepared at thermal equilibrium. We find that the work fluctuations can be significantly reduced via shortcuts to adiabatic processes. For example, in the classical case, probabilities of having very large or almost zero work values are suppressed. In the quantum case, negative work may be totally removed from the otherwise non-positive-definite work values. We also apply our findings to a micro Otto-cycle-based heat engine. It is shown that the use of shortcuts, which directly enhances the engine output power, can also increase the heat-engine efficiency substantially, in both quantum and classical regimes.

  16. Quantum Genetic Algorithms for Computer Scientists

    Directory of Open Access Journals (Sweden)

    Rafael Lahoz-Beltra

    2016-10-01

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

  17. Quantum algorithms for computational nuclear physics

    Directory of Open Access Journals (Sweden)

    Višňák Jakub

    2015-01-01

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

  18. Quantum control using genetic algorithms in quantum communication: superdense coding

    International Nuclear Information System (INIS)

    Domínguez-Serna, Francisco; Rojas, Fernando

    2015-01-01

    We present a physical example model of how Quantum Control with genetic algorithms is applied to implement the quantum superdense code protocol. We studied a model consisting of two quantum dots with an electron with spin, including spin-orbit interaction. The electron and the spin get hybridized with the site acquiring two degrees of freedom, spin and charge. The system has tunneling and site energies as time dependent control parameters that are optimized by means of genetic algorithms to prepare a hybrid Bell-like state used as a transmission channel. This state is transformed to obtain any state of the four Bell basis as required by superdense protocol to transmit two bits of classical information. The control process protocol is equivalent to implement one of the quantum gates in the charge subsystem. Fidelities larger than 99.5% are achieved for the hybrid entangled state preparation and the superdense operations. (paper)

  19. Matrix Product Operator Simulations of Quantum Algorithms

    Science.gov (United States)

    2015-02-01

    parallel to the Grover subspace parametrically: (Zi|φ〉)‖ = s cos γ|α〉+ s sin γ|β〉, s = √ a(k)2 (N − 1)2 + b(k)2, γ = tan −1 ( b(k)(N − 1) a(k) ) (6.32) Each...of this vector parallel to the Grover subspace in parametric form: (XiZi|φ〉)‖ = s cos(γ)|α〉+ s sin(γ)|β〉, s = 1√ N − 1 , γ = tan −1 ( cot (( k + 1 2 ) θ...quant- ph/0001106, 2000. Bibliography 146 [30] Jérémie Roland and Nicolas J Cerf. Quantum search by local adiabatic evolution. Physical Review A, 65(4

  20. Rational approximations and quantum algorithms with postselection

    NARCIS (Netherlands)

    Mahadev, U.; de Wolf, R.

    2015-01-01

    We study the close connection between rational functions that approximate a given Boolean function, and quantum algorithms that compute the same function using post-selection. We show that the minimal degree of the former equals (up to a factor of 2) the minimal query complexity of the latter. We

  1. An introduction to quantum computing algorithms

    CERN Document Server

    Pittenger, Arthur O

    2000-01-01

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

  2. Gradient algorithm applied to laboratory quantum control

    International Nuclear Information System (INIS)

    Roslund, Jonathan; Rabitz, Herschel

    2009-01-01

    The exploration of a quantum control landscape, which is the physical observable as a function of the control variables, is fundamental for understanding the ability to perform observable optimization in the laboratory. For high control variable dimensions, trajectory-based methods provide a means for performing such systematic explorations by exploiting the measured gradient of the observable with respect to the control variables. This paper presents a practical, robust, easily implemented statistical method for obtaining the gradient on a general quantum control landscape in the presence of noise. In order to demonstrate the method's utility, the experimentally measured gradient is utilized as input in steepest-ascent trajectories on the landscapes of three model quantum control problems: spectrally filtered and integrated second harmonic generation as well as excitation of atomic rubidium. The gradient algorithm achieves efficiency gains of up to approximately three times that of the standard genetic algorithm and, as such, is a promising tool for meeting quantum control optimization goals as well as landscape analyses. The landscape trajectories directed by the gradient should aid in the continued investigation and understanding of controlled quantum phenomena.

  3. A counterexample and a modification to the adiabatic approximation theorem in quantum mechanics

    Science.gov (United States)

    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.

  4. Quantum algorithm for association rules mining

    Science.gov (United States)

    Yu, Chao-Hua; Gao, Fei; Wang, Qing-Le; Wen, Qiao-Yan

    2016-10-01

    Association rules mining (ARM) is one of the most important problems in knowledge discovery and data mining. Given a transaction database that has a large number of transactions and items, the task of ARM is to acquire consumption habits of customers by discovering the relationships between itemsets (sets of items). In this paper, we address ARM in the quantum settings and propose a quantum algorithm for the key part of ARM, finding frequent itemsets from the candidate itemsets and acquiring their supports. Specifically, for the case in which there are Mf(k ) frequent k -itemsets in the Mc(k ) candidate k -itemsets (Mf(k )≤Mc(k ) ), our algorithm can efficiently mine these frequent k -itemsets and estimate their supports by using parallel amplitude estimation and amplitude amplification with complexity O (k/√{Mc(k )Mf(k ) } ɛ ) , where ɛ is the error for estimating the supports. Compared with the classical counterpart, i.e., the classical sampling-based algorithm, whose complexity is O (k/Mc(k ) ɛ2) , our quantum algorithm quadratically improves the dependence on both ɛ and Mc(k ) in the best case when Mf(k )≪Mc(k ) and on ɛ alone in the worst case when Mf(k )≈Mc(k ) .

  5. Nonstationary quantum mechanics. 4. Nonadiabatic properties of the Schroedinger equation in adiabatic processes

    Energy Technology Data Exchange (ETDEWEB)

    Todorov, N S [Low Temperature Department of the Institute of Solid State Physics of the Bulgarian Academy of Sciences, Sofia

    1981-04-01

    It is shown that the nonstationary Schroedinger equation does not satisfy a well-known adiabatical principle in thermodynamics. A ''renormalization procedure'' based on the possible existence of a time-irreversible basic evolution equation is proposed with the help of which one comes to agreement in a variety of specific cases of an adiabatic inclusion of a perturbing potential. The ideology of the present article rests essentially on the ideology of the preceding articles, in particular article I.

  6. Nonstationary quantum mechanics. IV. Nonadiabatic properties of the Schroedinger equation in adiabatic processes

    Energy Technology Data Exchange (ETDEWEB)

    Todorov, N S

    1981-04-01

    It is shown that the nonstationary Schroedinger equation does not satisfy a well-known adiabatical principle in thermodynamics. A ''renormalization procedure'' based on the possible existence of a time-irreversible basic evolution equation is proposed with the help of which one comes to agreement in a variety of specific cases of an adiabatic inclusion of a perturbing potential. The ideology of the present article IV rests essentially on the ideology of the preceding articles, in particular article I.

  7. Quantum algorithms and quantum maps - implementation and error correction

    International Nuclear Information System (INIS)

    Alber, G.; Shepelyansky, D.

    2005-01-01

    Full text: We investigate the dynamics of the quantum tent map under the influence of errors and explore the possibilities of quantum error correcting methods for the purpose of stabilizing this quantum algorithm. It is known that static but uncontrollable inter-qubit couplings between the qubits of a quantum information processor lead to a rapid Gaussian decay of the fidelity of the quantum state. We present a new error correcting method which slows down this fidelity decay to a linear-in-time exponential one. One of its advantages is that it does not require redundancy so that all physical qubits involved can be used for logical purposes. We also study the influence of decoherence due to spontaneous decay processes which can be corrected by quantum jump-codes. It is demonstrated how universal encoding can be performed in these code spaces. For this purpose we discuss a new entanglement gate which can be used for lowest level encoding in concatenated error-correcting architectures. (author)

  8. A low-resource quantum factoring algorithm

    NARCIS (Netherlands)

    Bernstein, D.J.; Biasse, J. F.; Mosca, M.; Lange, T.; Takagi, T.

    2017-01-01

    In this paper, we present a factoring algorithm that, assuming standard heuristics, uses just (log N)2/3+o(1) qubits to factor an integer N in time Lq+o(1) where L = exp((log N)1/3 (log log N)2/3) and q =3√8/3 ≈ 1.387. For comparison, the lowest asymptotic time complexity for known pre-quantum

  9. Creating Very True Quantum Algorithms for Quantum Energy Based Computing

    Science.gov (United States)

    Nagata, Koji; Nakamura, Tadao; Geurdes, Han; Batle, Josep; Abdalla, Soliman; Farouk, Ahmed; Diep, Do Ngoc

    2018-04-01

    An interpretation of quantum mechanics is discussed. It is assumed that quantum is energy. An algorithm by means of the energy interpretation is discussed. An algorithm, based on the energy interpretation, for fast determining a homogeneous linear function f( x) := s. x = s 1 x 1 + s 2 x 2 + ⋯ + s N x N is proposed. Here x = ( x 1, … , x N ), x j ∈ R and the coefficients s = ( s 1, … , s N ), s j ∈ N. Given the interpolation values (f(1), f(2),...,f(N))=ěc {y}, the unknown coefficients s = (s1(ěc {y}),\\dots , sN(ěc {y})) of the linear function shall be determined, simultaneously. The speed of determining the values is shown to outperform the classical case by a factor of N. Our method is based on the generalized Bernstein-Vazirani algorithm to qudit systems. Next, by using M parallel quantum systems, M homogeneous linear functions are determined, simultaneously. The speed of obtaining the set of M homogeneous linear functions is shown to outperform the classical case by a factor of N × M.

  10. The formation of spiral galaxies: adiabatic compression with Young's algorithm and the relation of dark matter haloes to their primordial antecedents

    NARCIS (Netherlands)

    Katz, Harley; McGaugh, Stacy S.; Sellwood, J. A.; de Blok, W. J. G.

    We utilize Young's algorithm to model the adiabatic compression of the dark matter haloes of galaxies in the THINGS survey to determine the relationship between the halo fit to the rotation curve and the corresponding primordial halo prior to compression. Young's algorithm conserves radial action

  11. Quantum crystal growing: adiabatic preparation of a bosonic antiferromagnet in the presence of a parabolic inhomogeneity

    DEFF Research Database (Denmark)

    Gammelmark, Søren; Eckardt, André

    2013-01-01

    felt by the two species. Using numerical simulations we predict that a finite parabolic potential can assist the adiabatic preparation of the antiferromagnet. The optimal strength of the parabolic inhomogeneity depends sensitively on the number imbalance between the two species. We also find...

  12. Scalable implementation of ancilla-free optimal 1→M phase-covariant quantum cloning by combining quantum Zeno dynamics and adiabatic passage

    International Nuclear Information System (INIS)

    Shao, Xiao-Qiang; Zheng, Tai-Yu; Zhang, Shou

    2011-01-01

    A scalable way for implementation of ancilla-free optimal 1→M phase-covariant quantum cloning (PCC) is proposed by combining quantum Zeno dynamics and adiabatic passage. An optimal 1→M PCC can be achieved directly from the existed optimal 1→(M-1) PCC without excited states population during the whole process. The cases for optimal 1→3 (4) PCCs are discussed detailedly to show that the scheme is robust against the effect of decoherence. Moreover, the time for carrying out each cloning transformation is regular, which may reduce the complexity for achieving the optimal PCC in experiment. -- Highlights: → We implement the ancilla-free optimal 1→M phase-covariant quantum cloning machine. → This scheme is robust against the cavity decay and the spontaneous emission of atom. → The time for carrying out each cloning transformation is regular.

  13. Scalable implementation of ancilla-free optimal 1→M phase-covariant quantum cloning by combining quantum Zeno dynamics and adiabatic passage

    Energy Technology Data Exchange (ETDEWEB)

    Shao, Xiao-Qiang, E-mail: xqshao83@yahoo.cn [School of Physics, Northeast Normal University, Changchun 130024 (China); Zheng, Tai-Yu, E-mail: zhengty@nenu.edu.cn [School of Physics, Northeast Normal University, Changchun 130024 (China); Zhang, Shou [Department of Physics, College of Science, Yanbian University, Yanji, Jilin 133002 (China)

    2011-09-19

    A scalable way for implementation of ancilla-free optimal 1→M phase-covariant quantum cloning (PCC) is proposed by combining quantum Zeno dynamics and adiabatic passage. An optimal 1→M PCC can be achieved directly from the existed optimal 1→(M-1) PCC without excited states population during the whole process. The cases for optimal 1→3 (4) PCCs are discussed detailedly to show that the scheme is robust against the effect of decoherence. Moreover, the time for carrying out each cloning transformation is regular, which may reduce the complexity for achieving the optimal PCC in experiment. -- Highlights: → We implement the ancilla-free optimal 1→M phase-covariant quantum cloning machine. → This scheme is robust against the cavity decay and the spontaneous emission of atom. → The time for carrying out each cloning transformation is regular.

  14. Influence of parameters entanglement on the quantum algorithms

    Directory of Open Access Journals (Sweden)

    Alexey V. Kasarkin

    2012-05-01

    Full Text Available The article we consider the influence of parameters entanglement on the quantum algorithms, in particular influence of partial entanglement for quantum teleportation. The simulation results presented in chart form.

  15. Applying Kitaev's algorithm in an ion trap quantum computer

    International Nuclear Information System (INIS)

    Travaglione, B.; Milburn, G.J.

    2000-01-01

    Full text: Kitaev's algorithm is a method of estimating eigenvalues associated with an operator. Shor's factoring algorithm, which enables a quantum computer to crack RSA encryption codes, is a specific example of Kitaev's algorithm. It has been proposed that the algorithm can also be used to generate eigenstates. We extend this proposal for small quantum systems, identifying the conditions under which the algorithm can successfully generate eigenstates. We then propose an implementation scheme based on an ion trap quantum computer. This scheme allows us to illustrate a simple example, in which the algorithm effectively generates eigenstates

  16. Control Theoretical Expression of Quantum Systems And Lower Bound of Finite Horizon Quantum Algorithms

    OpenAIRE

    Yanagisawa, Masahiro

    2007-01-01

    We provide a control theoretical method for a computational lower bound of quantum algorithms based on quantum walks of a finite time horizon. It is shown that given a quantum network, there exists a control theoretical expression of the quantum system and the transition probability of the quantum walk is related to a norm of the associated transfer function.

  17. Quantum computation and Shor close-quote s factoring algorithm

    International Nuclear Information System (INIS)

    Ekert, A.; Jozsa, R.

    1996-01-01

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

  18. Levitation of Bose-Einstein condensates induced by macroscopic non-adiabatic quantum tunneling

    OpenAIRE

    Nakamura, Katsuhiro; Kohi, Akihisa; Yamasaki, Hisatsugu; Perez-Garcia, Victor M.

    2006-01-01

    We study the dynamics of two-component Bose-Einstein condensates trapped in different vertical positions in the presence of an oscillating magnetic field. It is shown here how tuning appropriately the oscillation frequency of the magnetic field leads to the levitation of the system against gravity. This phenomenon is a manifestation of a macroscopic non-adiabatic tunneling in a system with internal degrees of freedom.

  19. Adiabatic passage for a lossy two-level quantum system by a complex time method

    International Nuclear Information System (INIS)

    Dridi, G; Guérin, S

    2012-01-01

    Using a complex time method with the formalism of Stokes lines, we establish a generalization of the Davis–Dykhne–Pechukas formula which gives in the adiabatic limit the transition probability of a lossy two-state system driven by an external frequency-chirped pulse-shaped field. The conditions that allow this generalization are derived. We illustrate the result with the dissipative Allen–Eberly and Rosen–Zener models. (paper)

  20. Algorithmic Complexity in Cosmology and Quantum Gravity

    Directory of Open Access Journals (Sweden)

    D. Singleton

    2002-01-01

    Full Text Available Abstract: In this article we use the idea of algorithmic complexity (AC to study various cosmological scenarios, and as a means of quantizing the ravitational interaction. We look at 5D and 7D cosmological models where the Universe begins as a higher dimensional Planck size spacetime which fluctuates between Euclidean and Lorentzian signatures. These fluctuations are overned by the AC of the two different signatures. At some point a transition to a 4D Lorentzian signature Universe occurs, with the extra dimensions becoming "frozen" or non-dynamical. We also apply the idea of algorithmic complexity to study composite wormholes, the entropy of black holes, and the path integral for quantum gravity. Some of the physical consequences of the idea presented here are:the birth of the Universe with a fluctuating metric signature; the transition from a fluctuating metric signature to Lorentzian one; "frozen" extra dimensions as a consequence of this transition; quantum handles in the spacetime foam as regions with multidimensional gravity.

  1. Fourier-transforming with quantum annealers

    Directory of Open Access Journals (Sweden)

    Itay eHen

    2014-07-01

    Full Text Available We introduce a set of quantum adiabatic evolutions that we argue may be used as `building blocks', or subroutines, in the onstruction of an adiabatic algorithm that executes Quantum Fourier Transform (QFT with the same complexity and resources as its gate-model counterpart. One implication of the above construction is the theoretical feasibility of implementing Shor's algorithm for integer factorization in an optimal manner, and any other algorithm that makes use of QFT, on quantum annealing devices. We discuss the possible advantages, as well as the limitations, of the proposed approach as well as its relation to traditional adiabatic quantum computation.

  2. A novel clustering algorithm based on quantum games

    International Nuclear Information System (INIS)

    Li Qiang; He Yan; Jiang Jingping

    2009-01-01

    Enormous successes have been made by quantum algorithms during the last decade. In this paper, we combine the quantum game with the problem of data clustering, and then develop a quantum-game-based clustering algorithm, in which data points in a dataset are considered as players who can make decisions and implement quantum strategies in quantum games. After each round of a quantum game, each player's expected payoff is calculated. Later, he uses a link-removing-and-rewiring (LRR) function to change his neighbors and adjust the strength of links connecting to them in order to maximize his payoff. Further, algorithms are discussed and analyzed in two cases of strategies, two payoff matrixes and two LRR functions. Consequently, the simulation results have demonstrated that data points in datasets are clustered reasonably and efficiently, and the clustering algorithms have fast rates of convergence. Moreover, the comparison with other algorithms also provides an indication of the effectiveness of the proposed approach.

  3. Deterministic and robust generation of single photons from a single quantum dot with 99.5% indistinguishability using adiabatic rapid passage.

    Science.gov (United States)

    Wei, Yu-Jia; He, Yu-Ming; Chen, Ming-Cheng; Hu, Yi-Nan; He, Yu; Wu, Dian; Schneider, Christian; Kamp, Martin; Höfling, Sven; Lu, Chao-Yang; Pan, Jian-Wei

    2014-11-12

    Single photons are attractive candidates of quantum bits (qubits) for quantum computation and are the best messengers in quantum networks. Future scalable, fault-tolerant photonic quantum technologies demand both stringently high levels of photon indistinguishability and generation efficiency. Here, we demonstrate deterministic and robust generation of pulsed resonance fluorescence single photons from a single semiconductor quantum dot using adiabatic rapid passage, a method robust against fluctuation of driving pulse area and dipole moments of solid-state emitters. The emitted photons are background-free, have a vanishing two-photon emission probability of 0.3% and a raw (corrected) two-photon Hong-Ou-Mandel interference visibility of 97.9% (99.5%), reaching a precision that places single photons at the threshold for fault-tolerant surface-code quantum computing. This single-photon source can be readily scaled up to multiphoton entanglement and used for quantum metrology, boson sampling, and linear optical quantum computing.

  4. Geometry of the Adiabatic Theorem

    Science.gov (United States)

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

  5. Optimization and experimental realization of the quantum permutation algorithm

    Science.gov (United States)

    Yalçınkaya, I.; Gedik, Z.

    2017-12-01

    The quantum permutation algorithm provides computational speed-up over classical algorithms for determining the parity of a given cyclic permutation. For its n -qubit implementations, the number of required quantum gates scales quadratically with n due to the quantum Fourier transforms included. We show here for the n -qubit case that the algorithm can be simplified so that it requires only O (n ) quantum gates, which theoretically reduces the complexity of the implementation. To test our results experimentally, we utilize IBM's 5-qubit quantum processor to realize the algorithm by using the original and simplified recipes for the 2-qubit case. It turns out that the latter results in a significantly higher success probability which allows us to verify the algorithm more precisely than the previous experimental realizations. We also verify the algorithm for the first time for the 3-qubit case with a considerable success probability by taking the advantage of our simplified scheme.

  6. Pure spin current induced by adiabatic quantum pumping in zigzag-edged graphene nanoribbons

    International Nuclear Information System (INIS)

    Souma, Satofumi; Ogawa, Matsuto

    2014-01-01

    We show theoretically that pure spin current can be generated in zigzag edged graphene nanoribbons through the adiabatic pumping by edge selective pumping potentials. The origin of such pure spin current is the spin splitting of the edge localized states, which are oppositely spin polarized at opposite edges. In the proposed device, each edge of the ribbon is covered by two independent time-periodic local gate potentials with a definite phase difference, inducing the edge spin polarized current. When the pumping phase difference is opposite in sign between two edges, the total charge currents is zero and the pure edge spin current is generated

  7. Reasoning about Grover's Quantum Search Algorithm using Probabilistic wp

    NARCIS (Netherlands)

    Butler, M.J.; Hartel, Pieter H.

    Grover's search algorithm is designed to be executed on a quantum mechanical computer. In this paper, the probabilistic wp-calculus is used to model and reason about Grover's algorithm. It is demonstrated that the calculus provides a rigorous programming notation for modelling this and other quantum

  8. Adiabatically modeling quantum gates with two-site Heisenberg spins chain: Noise vs interferometry

    Science.gov (United States)

    Jipdi, M. N.; Tchoffo, M.; Fai, L. C.

    2018-02-01

    We study the Landau Zener (LZ) dynamics of a two-site Heisenberg spin chain assisted with noise and focus on the implementation of logic gates via the resulting quantum interference. We present the evidence of the quantum interference phenomenon in triplet spin states and confirm that, three-level systems mimic Landau-Zener-Stückelberg (LZS) interferometers with occupancies dependent on the effective phase. It emerges that, the critical parameters tailoring the system are obtained for constructive interferences where the two sets of the chain are found to be maximally entangled. Our findings demonstrate that the enhancement of the magnetic field strength suppresses noise effects; consequently, the noise severely impacts the occurrence of quantum interference for weak magnetic fields while for strong fields, quantum interference subsists and allows the modeling of universal sets of quantum gates.

  9. Shor's quantum factoring algorithm on a photonic chip.

    Science.gov (United States)

    Politi, Alberto; Matthews, Jonathan C F; O'Brien, Jeremy L

    2009-09-04

    Shor's quantum factoring algorithm finds the prime factors of a large number exponentially faster than any other known method, a task that lies at the heart of modern information security, particularly on the Internet. This algorithm requires a quantum computer, a device that harnesses the massive parallelism afforded by quantum superposition and entanglement of quantum bits (or qubits). We report the demonstration of a compiled version of Shor's algorithm on an integrated waveguide silica-on-silicon chip that guides four single-photon qubits through the computation to factor 15.

  10. Quantum Image Encryption Algorithm Based on Image Correlation Decomposition

    Science.gov (United States)

    Hua, Tianxiang; Chen, Jiamin; Pei, Dongju; Zhang, Wenquan; Zhou, Nanrun

    2015-02-01

    A novel quantum gray-level image encryption and decryption algorithm based on image correlation decomposition is proposed. The correlation among image pixels is established by utilizing the superposition and measurement principle of quantum states. And a whole quantum image is divided into a series of sub-images. These sub-images are stored into a complete binary tree array constructed previously and then randomly performed by one of the operations of quantum random-phase gate, quantum revolving gate and Hadamard transform. The encrypted image can be obtained by superimposing the resulting sub-images with the superposition principle of quantum states. For the encryption algorithm, the keys are the parameters of random phase gate, rotation angle, binary sequence and orthonormal basis states. The security and the computational complexity of the proposed algorithm are analyzed. The proposed encryption algorithm can resist brute force attack due to its very large key space and has lower computational complexity than its classical counterparts.

  11. A strategy for quantum algorithm design assisted by machine learning

    Science.gov (United States)

    Bang, Jeongho; Ryu, Junghee; Yoo, Seokwon; Pawłowski, Marcin; Lee, Jinhyoung

    2014-07-01

    We propose a method for quantum algorithm design assisted by machine learning. The method uses a quantum-classical hybrid simulator, where a ‘quantum student’ is being taught by a ‘classical teacher’. In other words, in our method, the learning system is supposed to evolve into a quantum algorithm for a given problem, assisted by a classical main-feedback system. Our method is applicable for designing quantum oracle-based algorithms. We chose, as a case study, an oracle decision problem, called a Deutsch-Jozsa problem. We showed by using Monte Carlo simulations that our simulator can faithfully learn a quantum algorithm for solving the problem for a given oracle. Remarkably, the learning time is proportional to the square root of the total number of parameters, rather than showing the exponential dependence found in the classical machine learning-based method.

  12. Quantum algorithms for the ordered search problem via semidefinite programming

    International Nuclear Information System (INIS)

    Childs, Andrew M.; Landahl, Andrew J.; Parrilo, Pablo A.

    2007-01-01

    One of the most basic computational problems is the task of finding a desired item in an ordered list of N items. While the best classical algorithm for this problem uses log 2 N queries to the list, a quantum computer can solve the problem using a constant factor fewer queries. However, the precise value of this constant is unknown. By characterizing a class of quantum query algorithms for the ordered search problem in terms of a semidefinite program, we find quantum algorithms for small instances of the ordered search problem. Extending these algorithms to arbitrarily large instances using recursion, we show that there is an exact quantum ordered search algorithm using 4 log 605 N≅0.433 log 2 N queries, which improves upon the previously best known exact algorithm

  13. Quantum state specific reactant preparation in a molecular beam by rapid adiabatic passage

    Science.gov (United States)

    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.

  14. A strategy for quantum algorithm design assisted by machine learning

    International Nuclear Information System (INIS)

    Bang, Jeongho; Lee, Jinhyoung; Ryu, Junghee; Yoo, Seokwon; Pawłowski, Marcin

    2014-01-01

    We propose a method for quantum algorithm design assisted by machine learning. The method uses a quantum–classical hybrid simulator, where a ‘quantum student’ is being taught by a ‘classical teacher’. In other words, in our method, the learning system is supposed to evolve into a quantum algorithm for a given problem, assisted by a classical main-feedback system. Our method is applicable for designing quantum oracle-based algorithms. We chose, as a case study, an oracle decision problem, called a Deutsch–Jozsa problem. We showed by using Monte Carlo simulations that our simulator can faithfully learn a quantum algorithm for solving the problem for a given oracle. Remarkably, the learning time is proportional to the square root of the total number of parameters, rather than showing the exponential dependence found in the classical machine learning-based method. (paper)

  15. Optimal control of hybrid qubits: Implementing the quantum permutation algorithm

    Science.gov (United States)

    Rivera-Ruiz, C. M.; de Lima, E. F.; Fanchini, F. F.; Lopez-Richard, V.; Castelano, L. K.

    2018-03-01

    The optimal quantum control theory is employed to determine electric pulses capable of producing quantum gates with a fidelity higher than 0.9997, when noise is not taken into account. Particularly, these quantum gates were chosen to perform the permutation algorithm in hybrid qubits in double quantum dots (DQDs). The permutation algorithm is an oracle based quantum algorithm that solves the problem of the permutation parity faster than a classical algorithm without the necessity of entanglement between particles. The only requirement for achieving the speedup is the use of a one-particle quantum system with at least three levels. The high fidelity found in our results is closely related to the quantum speed limit, which is a measure of how fast a quantum state can be manipulated. Furthermore, we model charge noise by considering an average over the optimal field centered at different values of the reference detuning, which follows a Gaussian distribution. When the Gaussian spread is of the order of 5 μ eV (10% of the correct value), the fidelity is still higher than 0.95. Our scheme also can be used for the practical realization of different quantum algorithms in DQDs.

  16. Generalized Jaynes-Cummings model as a quantum search algorithm

    International Nuclear Information System (INIS)

    Romanelli, A.

    2009-01-01

    We propose a continuous time quantum search algorithm using a generalization of the Jaynes-Cummings model. In this model the states of the atom are the elements among which the algorithm realizes the search, exciting resonances between the initial and the searched states. This algorithm behaves like Grover's algorithm; the optimal search time is proportional to the square root of the size of the search set and the probability to find the searched state oscillates periodically in time. In this frame, it is possible to reinterpret the usual Jaynes-Cummings model as a trivial case of the quantum search algorithm.

  17. Computing Hypergraph Ramsey Numbers by Using Quantum Circuit

    OpenAIRE

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

    2012-01-01

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

  18. Demonstration of essentiality of entanglement in a Deutsch-like quantum algorithm

    Science.gov (United States)

    Huang, He-Liang; Goswami, Ashutosh K.; Bao, Wan-Su; Panigrahi, Prasanta K.

    2018-06-01

    Quantum algorithms can be used to efficiently solve certain classically intractable problems by exploiting quantum parallelism. However, the effectiveness of quantum entanglement in quantum computing remains a question of debate. This study presents a new quantum algorithm that shows entanglement could provide advantages over both classical algorithms and quantum algo- rithms without entanglement. Experiments are implemented to demonstrate the proposed algorithm using superconducting qubits. Results show the viability of the algorithm and suggest that entanglement is essential in obtaining quantum speedup for certain problems in quantum computing. The study provides reliable and clear guidance for developing useful quantum algorithms.

  19. Decoherence in optimized quantum random-walk search algorithm

    International Nuclear Information System (INIS)

    Zhang Yu-Chao; Bao Wan-Su; Wang Xiang; Fu Xiang-Qun

    2015-01-01

    This paper investigates the effects of decoherence generated by broken-link-type noise in the hypercube on an optimized quantum random-walk search algorithm. When the hypercube occurs with random broken links, the optimized quantum random-walk search algorithm with decoherence is depicted through defining the shift operator which includes the possibility of broken links. For a given database size, we obtain the maximum success rate of the algorithm and the required number of iterations through numerical simulations and analysis when the algorithm is in the presence of decoherence. Then the computational complexity of the algorithm with decoherence is obtained. The results show that the ultimate effect of broken-link-type decoherence on the optimized quantum random-walk search algorithm is negative. (paper)

  20. Phase matching in quantum searching and the improved Grover algorithm

    International Nuclear Information System (INIS)

    Long Guilu; Li Yansong; Xiao Li; Tu Changcun; Sun Yang

    2004-01-01

    The authors briefly introduced some of our recent work related to the phase matching condition in quantum searching algorithms and the improved Grover algorithm. When one replaces the two phase inversions in the Grover algorithm with arbitrary phase rotations, the modified algorithm usually fails in searching the marked state unless a phase matching condition is satisfied between the two phases. the Grover algorithm is not 100% in success rate, an improved Grover algorithm with zero-failure rate is given by replacing the phase inversions with angles that depends on the size of the database. Other aspects of the Grover algorithm such as the SO(3) picture of quantum searching, the dominant gate imperfections in the Grover algorithm are also mentioned. (author)

  1. Quantum Algorithms for Weighing Matrices and Quadratic Residues

    OpenAIRE

    van Dam, Wim

    2000-01-01

    In this article we investigate how we can employ the structure of combinatorial objects like Hadamard matrices and weighing matrices to device new quantum algorithms. We show how the properties of a weighing matrix can be used to construct a problem for which the quantum query complexity is ignificantly lower than the classical one. It is pointed out that this scheme captures both Bernstein & Vazirani's inner-product protocol, as well as Grover's search algorithm. In the second part of the ar...

  2. Wireless adiabatic power transfer

    International Nuclear Information System (INIS)

    Rangelov, A.A.; Suchowski, H.; Silberberg, Y.; Vitanov, N.V.

    2011-01-01

    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.

  3. Application of fermionic marginal constraints to hybrid quantum algorithms

    Science.gov (United States)

    Rubin, Nicholas C.; Babbush, Ryan; McClean, Jarrod

    2018-05-01

    Many quantum algorithms, including recently proposed hybrid classical/quantum algorithms, make use of restricted tomography of the quantum state that measures the reduced density matrices, or marginals, of the full state. The most straightforward approach to this algorithmic step estimates each component of the marginal independently without making use of the algebraic and geometric structure of the marginals. Within the field of quantum chemistry, this structure is termed the fermionic n-representability conditions, and is supported by a vast amount of literature on both theoretical and practical results related to their approximations. In this work, we introduce these conditions in the language of quantum computation, and utilize them to develop several techniques to accelerate and improve practical applications for quantum chemistry on quantum computers. As a general result, we demonstrate how these marginals concentrate to diagonal quantities when measured on random quantum states. We also show that one can use fermionic n-representability conditions to reduce the total number of measurements required by more than an order of magnitude for medium sized systems in chemistry. As a practical demonstration, we simulate an efficient restoration of the physicality of energy curves for the dilation of a four qubit diatomic hydrogen system in the presence of three distinct one qubit error channels, providing evidence these techniques are useful for pre-fault tolerant quantum chemistry experiments.

  4. Quantum Behaved Particle Swarm Optimization Algorithm Based on Artificial Fish Swarm

    OpenAIRE

    Yumin, Dong; Li, Zhao

    2014-01-01

    Quantum behaved particle swarm algorithm is a new intelligent optimization algorithm; the algorithm has less parameters and is easily implemented. In view of the existing quantum behaved particle swarm optimization algorithm for the premature convergence problem, put forward a quantum particle swarm optimization algorithm based on artificial fish swarm. The new algorithm based on quantum behaved particle swarm algorithm, introducing the swarm and following activities, meanwhile using the a...

  5. Quantum computation with classical light: The Deutsch Algorithm

    International Nuclear Information System (INIS)

    Perez-Garcia, Benjamin; Francis, Jason; McLaren, Melanie; Hernandez-Aranda, Raul I.; Forbes, Andrew; Konrad, Thomas

    2015-01-01

    We present an implementation of the Deutsch Algorithm using linear optical elements and laser light. We encoded two quantum bits in form of superpositions of electromagnetic fields in two degrees of freedom of the beam: its polarisation and orbital angular momentum. Our approach, based on a Sagnac interferometer, offers outstanding stability and demonstrates that optical quantum computation is possible using classical states of light. - Highlights: • We implement the Deutsh Algorithm using linear optical elements and classical light. • Our qubits are encoded in the polarisation and orbital angular momentum of the beam. • We show that it is possible to achieve quantum computation with two qubits in the classical domain of light

  6. Quantum computation with classical light: The Deutsch Algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Perez-Garcia, Benjamin [Photonics and Mathematical Optics Group, Tecnológico de Monterrey, Monterrey 64849 (Mexico); University of the Witwatersrand, Private Bag 3, Johannesburg 2050 (South Africa); Francis, Jason [School of Chemistry and Physics, University of KwaZulu-Natal, Private Bag X54001, Durban 4000 (South Africa); McLaren, Melanie [University of the Witwatersrand, Private Bag 3, Johannesburg 2050 (South Africa); Hernandez-Aranda, Raul I. [Photonics and Mathematical Optics Group, Tecnológico de Monterrey, Monterrey 64849 (Mexico); Forbes, Andrew [University of the Witwatersrand, Private Bag 3, Johannesburg 2050 (South Africa); Konrad, Thomas, E-mail: konradt@ukzn.ac.za [School of Chemistry and Physics, University of KwaZulu-Natal, Private Bag X54001, Durban 4000 (South Africa); National Institute of Theoretical Physics, Durban Node, Private Bag X54001, Durban 4000 (South Africa)

    2015-08-28

    We present an implementation of the Deutsch Algorithm using linear optical elements and laser light. We encoded two quantum bits in form of superpositions of electromagnetic fields in two degrees of freedom of the beam: its polarisation and orbital angular momentum. Our approach, based on a Sagnac interferometer, offers outstanding stability and demonstrates that optical quantum computation is possible using classical states of light. - Highlights: • We implement the Deutsh Algorithm using linear optical elements and classical light. • Our qubits are encoded in the polarisation and orbital angular momentum of the beam. • We show that it is possible to achieve quantum computation with two qubits in the classical domain of light.

  7. Quantum algorithms and the genetic code

    Indian Academy of Sciences (India)

    Replication of DNA and synthesis of proteins are studied from the view-point of quantum database search. Identification of a base-pairing with a quantum query gives a natural (and first ever!) explanation of why living organisms have 4 nucleotide bases and 20 amino acids. It is amazing that these numbers arise as ...

  8. A quantum algorithm for Viterbi decoding of classical convolutional codes

    OpenAIRE

    Grice, Jon R.; Meyer, David A.

    2014-01-01

    We present a quantum Viterbi algorithm (QVA) with better than classical performance under certain conditions. In this paper the proposed algorithm is applied to decoding classical convolutional codes, for instance; large constraint length $Q$ and short decode frames $N$. Other applications of the classical Viterbi algorithm where $Q$ is large (e.g. speech processing) could experience significant speedup with the QVA. The QVA exploits the fact that the decoding trellis is similar to the butter...

  9. Improved algorithm for quantum separability and entanglement detection

    International Nuclear Information System (INIS)

    Ioannou, L.M.; Ekert, A.K.; Travaglione, B.C.; Cheung, D.

    2004-01-01

    Determining whether a quantum state is separable or entangled is a problem of fundamental importance in quantum information science. It has recently been shown that this problem is NP-hard, suggesting that an efficient, general solution does not exist. There is a highly inefficient 'basic algorithm' for solving the quantum separability problem which follows from the definition of a separable state. By exploiting specific properties of the set of separable states, we introduce a classical algorithm that solves the problem significantly faster than the 'basic algorithm', allowing a feasible separability test where none previously existed, e.g., in 3x3-dimensional systems. Our algorithm also provides a unique tool in the experimental detection of entanglement

  10. Quantum algorithms for phase-space tomography

    International Nuclear Information System (INIS)

    Paz, Juan Pablo; Roncaglia, Augusto Jose; Saraceno, Marcos

    2004-01-01

    We present efficient circuits that can be used for the phase-space tomography of quantum states. The circuits evaluate individual values or selected averages of the Wigner, Kirkwood, and Husimi distributions. These quantum gate arrays can be programmed by initializing appropriate computational states. The Husimi circuit relies on a subroutine that is also interesting in its own right: the efficient preparation of a coherent state, which is the ground state of the Harper Hamiltonian

  11. High-order quantum algorithm for solving linear differential equations

    International Nuclear Information System (INIS)

    Berry, Dominic W

    2014-01-01

    Linear differential equations are ubiquitous in science and engineering. Quantum computers can simulate quantum systems, which are described by a restricted type of linear differential equations. Here we extend quantum simulation algorithms to general inhomogeneous sparse linear differential equations, which describe many classical physical systems. We examine the use of high-order methods (where the error over a time step is a high power of the size of the time step) to improve the efficiency. These provide scaling close to Δt 2 in the evolution time Δt. As with other algorithms of this type, the solution is encoded in amplitudes of the quantum state, and it is possible to extract global features of the solution. (paper)

  12. The validity of quantum-classical multi-channel diffusion equations describing interlevel transitions in the condensed phase. The adiabatic representation

    CERN Document Server

    Basilevsky, M V

    2002-01-01

    We develop an approach for derivation of quantum-classical relaxation equations for a two-channel problem. The treatment is based on the adiabatic channel wavefunctions and the system-bath coupling is modelled as a bilinear interaction in momentum representation. In the quantum-classical limit we obtain Liouville equations with the relaxation operator containing diffusion terms diagonal in Liouvillian space and the off-diagonal part which is responsible for thermal interlevel transitions. The high-frequency interlevel quantum beats are fully taken into account in this relaxation term. In the framework of the present formulation and as a consequence of the momentum-dependent interaction the Smoluchovsky diffusion limit can be reached without invoking Fokker-Planck equations as an intermediate step. The inherent property of equations so obtained is that the partial rates of interlevel transitions obey the principle of detailed balance. This result could not be gained in earlier treatments of the two-level diffu...

  13. Grover's quantum search algorithm for an arbitrary initial mixed state

    International Nuclear Information System (INIS)

    Biham, Eli; Kenigsberg, Dan

    2002-01-01

    The Grover quantum search algorithm is generalized to deal with an arbitrary mixed initial state. The probability to measure a marked state as a function of time is calculated, and found to depend strongly on the specific initial state. The form of the function, though, remains as it is in the case of initial pure state. We study the role of the von Neumann entropy of the initial state, and show that the entropy cannot be a measure for the usefulness of the algorithm. We give few examples and show that for some extremely mixed initial states (carrying high entropy), the generalized Grover algorithm is considerably faster than any classical algorithm

  14. Realization of seven-qubit Deutsch-Jozsa algorithm on NMR quantum computer

    International Nuclear Information System (INIS)

    Wei Daxiu; Yang Xiaodong; Luo Jun; Sun Xianping; Zeng Xizhi; Liu Maili; Ding Shangwu

    2002-01-01

    Recent years, remarkable progresses in experimental realization of quantum information have been made, especially based on nuclear magnetic resonance (NMR) theory. In all quantum algorithms, Deutsch-Jozsa algorithm has been widely studied. It can be realized on NMR quantum computer and also can be simplified by using the Cirac's scheme. At first the principle of Deutsch-Jozsa quantum algorithm is analyzed, then the authors implement the seven-qubit Deutsch-Jozsa algorithm on NMR quantum computer

  15. Engineering local optimality in quantum Monte Carlo algorithms

    Science.gov (United States)

    Pollet, Lode; Van Houcke, Kris; Rombouts, Stefan M. A.

    2007-08-01

    Quantum Monte Carlo algorithms based on a world-line representation such as the worm algorithm and the directed loop algorithm are among the most powerful numerical techniques for the simulation of non-frustrated spin models and of bosonic models. Both algorithms work in the grand-canonical ensemble and can have a winding number larger than zero. However, they retain a lot of intrinsic degrees of freedom which can be used to optimize the algorithm. We let us guide by the rigorous statements on the globally optimal form of Markov chain Monte Carlo simulations in order to devise a locally optimal formulation of the worm algorithm while incorporating ideas from the directed loop algorithm. We provide numerical examples for the soft-core Bose-Hubbard model and various spin- S models.

  16. Novel Quantum Encryption Algorithm Based on Multiqubit Quantum Shift Register and Hill Cipher

    International Nuclear Information System (INIS)

    Khalaf, Rifaat Zaidan; Abdullah, Alharith Abdulkareem

    2014-01-01

    Based on a quantum shift register, a novel quantum block cryptographic algorithm that can be used to encrypt classical messages is proposed. The message is encoded and decoded by using a code generated by the quantum shift register. The security of this algorithm is analysed in detail. It is shown that, in the quantum block cryptographic algorithm, two keys can be used. One of them is the classical key that is used in the Hill cipher algorithm where Alice and Bob use the authenticated Diffie Hellman key exchange algorithm using the concept of digital signature for the authentication of the two communicating parties and so eliminate the man-in-the-middle attack. The other key is generated by the quantum shift register and used for the coding of the encryption message, where Alice and Bob share the key by using the BB84 protocol. The novel algorithm can prevent a quantum attack strategy as well as a classical attack strategy. The problem of key management is discussed and circuits for the encryption and the decryption are suggested

  17. Newton algorithm for Hamiltonian characterization in quantum control

    International Nuclear Information System (INIS)

    Ndong, M; Sugny, D; Salomon, J

    2014-01-01

    We propose a Newton algorithm to characterize the Hamiltonian of a quantum system interacting with a given laser field. The algorithm is based on the assumption that the evolution operator of the system is perfectly known at a fixed time. The computational scheme uses the Crank–Nicholson approximation to explicitly determine the derivatives of the propagator with respect to the Hamiltonians of the system. In order to globalize this algorithm, we use a continuation method that improves its convergence properties. This technique is applied to a two-level quantum system and to a molecular one with a double-well potential. The numerical tests show that accurate estimates of the unknown parameters are obtained in some cases. We discuss the numerical limits of the algorithm in terms of the basin of convergence and the non-uniqueness of the solution. (paper)

  18. How fast can quantum annealers count?

    International Nuclear Information System (INIS)

    Hen, Itay

    2014-01-01

    We outline an algorithm for the quantum counting problem using adiabatic quantum computation (AQC). We show that the mechanism of quantum-adiabatic evolution may be utilized toward estimating the number of solutions to a problem, and not only to find them. Using local adiabatic evolution, a process in which the adiabatic procedure is performed at a variable rate, the problem of counting the number of marked items in an unstructured database is solved quadratically faster than the corresponding classical algorithm. The above algorithm provides further evidence for the potentially powerful capabilities of AQC as a paradigm for more efficient problem solving on a quantum computer, and may be used as the basis for solving more sophisticated problems. (paper)

  19. Transitionless quantum driving based wireless power transfer

    OpenAIRE

    Paul, Koushik; Sarma, Amarendra K.

    2017-01-01

    Shortcut to adiabaticity (STA) techniques have the potential to drive a system beyond the adiabatic limits. Here, we present a robust and efficient method for wireless power transfer (WPT) between two coils based on the so-called transitionless quantum driving (TQD) algorithm. We show that it is possible to transfer power between the coils significantly fast compared to its adiabatic counterpart. The scheme is fairly robust against the variations in the coupling strength and the coupling dist...

  20. Effects of adiabatic, relativistic, and quantum electrodynamics interactions on the pair potential and thermophysical properties of helium.

    Science.gov (United States)

    Cencek, Wojciech; Przybytek, Michał; Komasa, Jacek; Mehl, James B; Jeziorski, Bogumił; Szalewicz, Krzysztof

    2012-06-14

    The adiabatic, relativistic, and quantum electrodynamics (QED) contributions to the pair potential of helium were computed, fitted separately, and applied, together with the nonrelativistic Born-Oppenheimer (BO) potential, in calculations of thermophysical properties of helium and of the properties of the helium dimer. An analysis of the convergence patterns of the calculations with increasing basis set sizes allowed us to estimate the uncertainties of the total interaction energy to be below 50 ppm for interatomic separations R smaller than 4 bohrs and for the distance R = 5.6 bohrs. For other separations, the relative uncertainties are up to an order of magnitude larger (and obviously still larger near R = 4.8 bohrs where the potential crosses zero) and are dominated by the uncertainties of the nonrelativistic BO component. These estimates also include the contributions from the neglected relativistic and QED terms proportional to the fourth and higher powers of the fine-structure constant α. To obtain such high accuracy, it was necessary to employ explicitly correlated Gaussian expansions containing up to 2400 terms for smaller R (all R in the case of a QED component) and optimized orbital bases up to the cardinal number X = 7 for larger R. Near-exact asymptotic constants were used to describe the large-R behavior of all components. The fitted potential, exhibiting the minimum of -10.996 ± 0.004 K at R = 5.608 0 ± 0.000 1 bohr, was used to determine properties of the very weakly bound (4)He(2) dimer and thermophysical properties of gaseous helium. It is shown that the Casimir-Polder retardation effect, increasing the dimer size by about 2 Å relative to the nonrelativistic BO value, is almost completely accounted for by the inclusion of the Breit-interaction and the Araki-Sucher contributions to the potential, of the order α(2) and α(3), respectively. The remaining retardation effect, of the order of α(4) and higher, is practically negligible for the bound

  1. Arbitrated Quantum Signature with Hamiltonian Algorithm Based on Blind Quantum Computation

    Science.gov (United States)

    Shi, Ronghua; Ding, Wanting; Shi, Jinjing

    2018-03-01

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

  2. Loop algorithms for quantum simulations of fermion models on lattices

    International Nuclear Information System (INIS)

    Kawashima, N.; Gubernatis, J.E.; Evertz, H.G.

    1994-01-01

    Two cluster algorithms, based on constructing and flipping loops, are presented for world-line quantum Monte Carlo simulations of fermions and are tested on the one-dimensional repulsive Hubbard model. We call these algorithms the loop-flip and loop-exchange algorithms. For these two algorithms and the standard world-line algorithm, we calculated the autocorrelation times for various physical quantities and found that the ordinary world-line algorithm, which uses only local moves, suffers from very long correlation times that makes not only the estimate of the error difficult but also the estimate of the average values themselves difficult. These difficulties are especially severe in the low-temperature, large-U regime. In contrast, we find that new algorithms, when used alone or in combinations with themselves and the standard algorithm, can have significantly smaller autocorrelation times, in some cases being smaller by three orders of magnitude. The new algorithms, which use nonlocal moves, are discussed from the point of view of a general prescription for developing cluster algorithms. The loop-flip algorithm is also shown to be ergodic and to belong to the grand canonical ensemble. Extensions to other models and higher dimensions are briefly discussed

  3. Novel quantum inspired binary neural network algorithm

    Indian Academy of Sciences (India)

    This parameter is taken as the threshold of neuron for learning of neural network. This algorithm is tested with three benchmark datasets and ... Author Affiliations. OM PRAKASH PATEL1 ARUNA TIWARI. Department of Computer Science and Engineering, Indian Institute of Technology Indore, Indore 453552, India ...

  4. A quantum algorithm for Viterbi decoding of classical convolutional codes

    Science.gov (United States)

    Grice, Jon R.; Meyer, David A.

    2015-07-01

    We present a quantum Viterbi algorithm (QVA) with better than classical performance under certain conditions. In this paper, the proposed algorithm is applied to decoding classical convolutional codes, for instance, large constraint length and short decode frames . Other applications of the classical Viterbi algorithm where is large (e.g., speech processing) could experience significant speedup with the QVA. The QVA exploits the fact that the decoding trellis is similar to the butterfly diagram of the fast Fourier transform, with its corresponding fast quantum algorithm. The tensor-product structure of the butterfly diagram corresponds to a quantum superposition that we show can be efficiently prepared. The quantum speedup is possible because the performance of the QVA depends on the fanout (number of possible transitions from any given state in the hidden Markov model) which is in general much less than . The QVA constructs a superposition of states which correspond to all legal paths through the decoding lattice, with phase as a function of the probability of the path being taken given received data. A specialized amplitude amplification procedure is applied one or more times to recover a superposition where the most probable path has a high probability of being measured.

  5. Threshold quantum cryptograph based on Grover's algorithm

    International Nuclear Information System (INIS)

    Du Jianzhong; Qin Sujuan; Wen Qiaoyan; Zhu Fuchen

    2007-01-01

    We propose a threshold quantum protocol based on Grover's operator and permutation operator on one two-qubit signal. The protocol is secure because the dishonest parties can only extract 2 bits from 3 bits information of operation on one two-qubit signal while they have to introduce error probability 3/8. The protocol includes a detection scheme to resist Trojan horse attack. With probability 1/2, the detection scheme can detect a multi-qubit signal that is used to replace a single-qubit signal, while it makes every legitimate qubit invariant

  6. Quantum Cryptography Based on the Deutsch-Jozsa Algorithm

    Science.gov (United States)

    Nagata, Koji; Nakamura, Tadao; Farouk, Ahmed

    2017-09-01

    Recently, secure quantum key distribution based on Deutsch's algorithm using the Bell state is reported (Nagata and Nakamura, Int. J. Theor. Phys. doi: 10.1007/s10773-017-3352-4, 2017). Our aim is of extending the result to a multipartite system. In this paper, we propose a highly speedy key distribution protocol. We present sequre quantum key distribution based on a special Deutsch-Jozsa algorithm using Greenberger-Horne-Zeilinger states. Bob has promised to use a function f which is of one of two kinds; either the value of f( x) is constant for all values of x, or else the value of f( x) is balanced, that is, equal to 1 for exactly half of the possible x, and 0 for the other half. Here, we introduce an additional condition to the function when it is balanced. Our quantum key distribution overcomes a classical counterpart by a factor O(2 N ).

  7. Quantum algorithms for topological and geometric analysis of data

    Science.gov (United States)

    Lloyd, Seth; Garnerone, Silvano; Zanardi, Paolo

    2016-01-01

    Extracting useful information from large data sets can be a daunting task. Topological methods for analysing data sets provide a powerful technique for extracting such information. Persistent homology is a sophisticated tool for identifying topological features and for determining how such features persist as the data is viewed at different scales. Here we present quantum machine learning algorithms for calculating Betti numbers—the numbers of connected components, holes and voids—in persistent homology, and for finding eigenvectors and eigenvalues of the combinatorial Laplacian. The algorithms provide an exponential speed-up over the best currently known classical algorithms for topological data analysis. PMID:26806491

  8. Limitations on continuous variable quantum algorithms with Fourier transforms

    International Nuclear Information System (INIS)

    Adcock, Mark R A; Hoeyer, Peter; Sanders, Barry C

    2009-01-01

    We study quantum algorithms implemented within a single harmonic oscillator, or equivalently within a single mode of the electromagnetic field. Logical states correspond to functions of the canonical position, and the Fourier transform to canonical momentum serves as the analogue of the Hadamard transform for this implementation. This continuous variable version of quantum information processing has widespread appeal because of advanced quantum optics technology that can create, manipulate and read Gaussian states of light. We show that, contrary to a previous claim, this implementation of quantum information processing has limitations due to a position-momentum trade-off of the Fourier transform, analogous to the famous time-bandwidth theorem of signal processing.

  9. Non-adiabatic molecular dynamics investigation of photoionization state formation and lifetime in Mn²⁺-doped ZnO quantum dots.

    Science.gov (United States)

    Fischer, Sean A; Lingerfelt, David B; May, Joseph W; Li, Xiaosong

    2014-09-07

    The unique electronic structure of Mn(2+)-doped ZnO quantum dots gives rise to photoionization states that can be used to manipulate the magnetic state of the material and to generate zero-reabsorption luminescence. Fast formation and long non-radiative decay of this photoionization state is a necessary requirement for these important applications. In this work, surface hopping based non-adiabatic molecular dynamics are used to demonstrate the fast formation of a metal-to-ligand charge transfer state in a Mn(2+)-doped ZnO quantum dot. The formation occurs on an ultrafast timescale and is aided by the large density of states and significant mixing of the dopant Mn(2+) 3dt2 levels with the valence-band levels of the ZnO lattice. The non-radiative lifetime of the photoionization states is also investigated.

  10. Adiabatic superconducting cells for ultra-low-power artificial neural networks

    Directory of Open Access Journals (Sweden)

    Andrey E. Schegolev

    2016-10-01

    Full Text Available We propose the concept of using superconducting quantum interferometers for the implementation of neural network algorithms with extremely low power dissipation. These adiabatic elements are Josephson cells with sigmoid- and Gaussian-like activation functions. We optimize their parameters for application in three-layer perceptron and radial basis function networks.

  11. Genetic algorithm based on qubits and quantum gates

    International Nuclear Information System (INIS)

    Silva, Joao Batista Rosa; Ramos, Rubens Viana

    2003-01-01

    Full text: Genetic algorithm, a computational technique based on the evolution of the species, in which a possible solution of the problem is coded in a binary string, called chromosome, has been used successfully in several kinds of problems, where the search of a minimal or a maximal value is necessary, even when local minima are present. A natural generalization of a binary string is a qubit string. Hence, it is possible to use the structure of a genetic algorithm having a sequence of qubits as a chromosome and using quantum operations in the reproduction in order to find the best solution in some problems of quantum information. For example, given a unitary matrix U what is the pair of qubits that, when applied at the input, provides the output state with maximal entanglement? In order to solve this problem, a population of chromosomes of two qubits was created. The crossover was performed applying the quantum gates CNOT and SWAP at the pair of qubits, while the mutation was performed applying the quantum gates Hadamard, Z and Not in a single qubit. The result was compared with a classical genetic algorithm used to solve the same problem. A hundred simulations using the same U matrix was performed. Both algorithms, hereafter named by CGA (classical) and QGA (using qu bits), reached good results close to 1 however, the number of generations needed to find the best result was lower for the QGA. Another problem where the QGA can be useful is in the calculation of the relative entropy of entanglement. We have tested our algorithm using 100 pure states chosen randomly. The stop criterion used was the error lower than 0.01. The main advantages of QGA are its good precision, robustness and very easy implementation. The main disadvantage is its low velocity, as happen for all kind of genetic algorithms. (author)

  12. Real-Coded Quantum-Inspired Genetic Algorithm-Based BP Neural Network Algorithm

    Directory of Open Access Journals (Sweden)

    Jianyong Liu

    2015-01-01

    Full Text Available The method that the real-coded quantum-inspired genetic algorithm (RQGA used to optimize the weights and threshold of BP neural network is proposed to overcome the defect that the gradient descent method makes the algorithm easily fall into local optimal value in the learning process. Quantum genetic algorithm (QGA is with good directional global optimization ability, but the conventional QGA is based on binary coding; the speed of calculation is reduced by the coding and decoding processes. So, RQGA is introduced to explore the search space, and the improved varied learning rate is adopted to train the BP neural network. Simulation test shows that the proposed algorithm is effective to rapidly converge to the solution conformed to constraint conditions.

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

    Science.gov (United States)

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

    2014-07-11

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

  14. Quantum Color Image Encryption Algorithm Based on A Hyper-Chaotic System and Quantum Fourier Transform

    Science.gov (United States)

    Tan, Ru-Chao; Lei, Tong; Zhao, Qing-Min; Gong, Li-Hua; Zhou, Zhi-Hong

    2016-12-01

    To improve the slow processing speed of the classical image encryption algorithms and enhance the security of the private color images, a new quantum color image encryption algorithm based on a hyper-chaotic system is proposed, in which the sequences generated by the Chen's hyper-chaotic system are scrambled and diffused with three components of the original color image. Sequentially, the quantum Fourier transform is exploited to fulfill the encryption. Numerical simulations show that the presented quantum color image encryption algorithm possesses large key space to resist illegal attacks, sensitive dependence on initial keys, uniform distribution of gray values for the encrypted image and weak correlation between two adjacent pixels in the cipher-image.

  15. Quantum Google algorithm. Construction and application to complex networks

    Science.gov (United States)

    Paparo, G. D.; Müller, M.; Comellas, F.; Martin-Delgado, M. A.

    2014-07-01

    We review the main findings on the ranking capabilities of the recently proposed Quantum PageRank algorithm (G.D. Paparo et al., Sci. Rep. 2, 444 (2012) and G.D. Paparo et al., Sci. Rep. 3, 2773 (2013)) applied to large complex networks. The algorithm has been shown to identify unambiguously the underlying topology of the network and to be capable of clearly highlighting the structure of secondary hubs of networks. Furthermore, it can resolve the degeneracy in importance of the low-lying part of the list of rankings. Examples of applications include real-world instances from the WWW, which typically display a scale-free network structure and models of hierarchical networks. The quantum algorithm has been shown to display an increased stability with respect to a variation of the damping parameter, present in the Google algorithm, and a more clearly pronounced power-law behaviour in the distribution of importance among the nodes, as compared to the classical algorithm.

  16. Improved quantum backtracking algorithms using effective resistance estimates

    Science.gov (United States)

    Jarret, Michael; Wan, Kianna

    2018-02-01

    We investigate quantum backtracking algorithms of the type introduced by Montanaro (Montanaro, arXiv:1509.02374). These algorithms explore trees of unknown structure and in certain settings exponentially outperform their classical counterparts. Some of the previous work focused on obtaining a quantum advantage for trees in which a unique marked vertex is promised to exist. We remove this restriction by recharacterizing the problem in terms of the effective resistance of the search space. In this paper, we present a generalization of one of Montanaro's algorithms to trees containing k marked vertices, where k is not necessarily known a priori. Our approach involves using amplitude estimation to determine a near-optimal weighting of a diffusion operator, which can then be applied to prepare a superposition state with support only on marked vertices and ancestors thereof. By repeatedly sampling this state and updating the input vertex, a marked vertex is reached in a logarithmic number of steps. The algorithm thereby achieves the conjectured bound of O ˜(√{T Rmax }) for finding a single marked vertex and O ˜(k √{T Rmax }) for finding all k marked vertices, where T is an upper bound on the tree size and Rmax is the maximum effective resistance encountered by the algorithm. This constitutes a speedup over Montanaro's original procedure in both the case of finding one and the case of finding multiple marked vertices in an arbitrary tree.

  17. The quantum walk search algorithm: Factors affecting efficiency

    OpenAIRE

    Lovett, Neil B.; Everitt, Matthew; Heath, Robert M.; Kendon, Viv

    2011-01-01

    We numerically study the quantum walk search algorithm of Shenvi, Kempe and Whaley [PRA \\textbf{67} 052307] and the factors which affect its efficiency in finding an individual state from an unsorted set. Previous work has focused purely on the effects of the dimensionality of the dataset to be searched. Here, we consider the effects of interpolating between dimensions, connectivity of the dataset, and the possibility of disorder in the underlying substrate: all these factors affect the effic...

  18. Concise quantum associative memories with nonlinear search algorithm

    International Nuclear Information System (INIS)

    Tchapet Njafa, J.P.; Nana Engo, S.G.

    2016-01-01

    The model of Quantum Associative Memories (QAM) we propose here consists in simplifying and generalizing that of Rigui Zhou et al. [1] which uses the quantum matrix with the binary decision diagram put forth by David Rosenbaum [2] and the Abrams and Lloyd's nonlinear search algorithm [3]. Our model gives the possibility to retrieve one of the sought states in multi-values retrieving scheme when a measurement is done on the first register in O(c-r) time complexity. It is better than Grover's algorithm and its modified form which need O(√((2 n )/(m))) steps when they are used as the retrieval algorithm. n is the number of qubits of the first register and m the number of x values for which f(x) = 1. As the nonlinearity makes the system highly susceptible to the noise, an analysis of the influence of the single qubit noise channels on the Nonlinear Search Algorithm of our model of QAM shows a fidelity of about 0.7 whatever the number of qubits existing in the first register, thus demonstrating the robustness of our model. (copyright 2016 WILEY-VCH Verlag GmbH and Co. KGaA, Weinheim)

  19. Cluster algorithms with empahsis on quantum spin systems

    International Nuclear Information System (INIS)

    Gubernatis, J.E.; Kawashima, Naoki

    1995-01-01

    The purpose of this lecture is to discuss in detail the generalized approach of Kawashima and Gubernatis for the construction of cluster algorithms. We first present a brief refresher on the Monte Carlo method, describe the Swendsen-Wang algorithm, show how this algorithm follows from the Fortuin-Kastelyn transformation, and re=interpret this transformation in a form which is the basis of the generalized approach. We then derive the essential equations of the generalized approach. This derivation is remarkably simple if done from the viewpoint of probability theory, and the essential assumptions will be clearly stated. These assumptions are implicit in all useful cluster algorithms of which we are aware. They lead to a quite different perspective on cluster algorithms than found in the seminal works and in Ising model applications. Next, we illustrate how the generalized approach leads to a cluster algorithm for world-line quantum Monte Carlo simulations of Heisenberg models with S = 1/2. More succinctly, we also discuss the generalization of the Fortuin- Kasetelyn transformation to higher spin models and illustrate the essential steps for a S = 1 Heisenberg model. Finally, we summarize how to go beyond S = 1 to a general spin, XYZ model

  20. A new quantum inspired chaotic artificial bee colony algorithm for optimal power flow problem

    International Nuclear Information System (INIS)

    Yuan, Xiaohui; Wang, Pengtao; Yuan, Yanbin; Huang, Yuehua; Zhang, Xiaopan

    2015-01-01

    Highlights: • Quantum theory is introduced to artificial bee colony algorithm (ABC) to increase population diversity. • A chaotic local search operator is used to enhance local search ability of ABC. • Quantum inspired chaotic ABC method (QCABC) is proposed to solve optimal power flow. • The feasibility and effectiveness of the proposed QCABC is verified by examples. - Abstract: This paper proposes a new artificial bee colony algorithm with quantum theory and the chaotic local search strategy (QCABC), and uses it to solve the optimal power flow (OPF) problem. Under the quantum computing theory, the QCABC algorithm encodes each individual with quantum bits to form a corresponding quantum bit string. By determining each quantum bits value, we can get the value of the individual. After the scout bee stage of the artificial bee colony algorithm, we begin the chaotic local search in the vicinity of the best individual found so far. Finally, the quantum rotation gate is used to process each quantum bit so that all individuals can update toward the direction of the best individual. The QCABC algorithm is carried out to deal with the OPF problem in the IEEE 30-bus and IEEE 118-bus standard test systems. The results of the QCABC algorithm are compared with other algorithms (artificial bee colony algorithm, genetic algorithm, particle swarm optimization algorithm). The comparison shows that the QCABC algorithm can effectively solve the OPF problem and it can get the better optimal results than those of other algorithms

  1. A cross-disciplinary introduction to quantum annealing-based algorithms

    Science.gov (United States)

    Venegas-Andraca, Salvador E.; Cruz-Santos, William; McGeoch, Catherine; Lanzagorta, Marco

    2018-04-01

    A central goal in quantum computing is the development of quantum hardware and quantum algorithms in order to analyse challenging scientific and engineering problems. Research in quantum computation involves contributions from both physics and computer science; hence this article presents a concise introduction to basic concepts from both fields that are used in annealing-based quantum computation, an alternative to the more familiar quantum gate model. We introduce some concepts from computer science required to define difficult computational problems and to realise the potential relevance of quantum algorithms to find novel solutions to those problems. We introduce the structure of quantum annealing-based algorithms as well as two examples of this kind of algorithms for solving instances of the max-SAT and Minimum Multicut problems. An overview of the quantum annealing systems manufactured by D-Wave Systems is also presented.

  2. Implementation of Period-Finding Algorithm by Means of Simulating Quantum Fourier Transform

    Directory of Open Access Journals (Sweden)

    Zohreh Moghareh Abed

    2010-01-01

    Full Text Available In this paper, we introduce quantum fourier transform as a key ingredient for many useful algorithms. These algorithms make a solution for problems which is considered to be intractable problems on a classical computer. Quantum Fourier transform is propounded as a key for quantum phase estimation algorithm. In this paper our aim is the implementation of period-finding algorithm.Quantum computer solves this problem, exponentially faster than classical one. Quantum phase estimation algorithm is the key for the period-finding problem .Therefore, by means of simulating quantum Fourier transform, we are able to implement the period-finding algorithm. In this paper, the simulation of quantum Fourier transform is carried out by Matlab software.

  3. Improved Quantum Artificial Fish Algorithm Application to Distributed Network Considering Distributed Generation.

    Science.gov (United States)

    Du, Tingsong; Hu, Yang; Ke, Xianting

    2015-01-01

    An improved quantum artificial fish swarm algorithm (IQAFSA) for solving distributed network programming considering distributed generation is proposed in this work. The IQAFSA based on quantum computing which has exponential acceleration for heuristic algorithm uses quantum bits to code artificial fish and quantum revolving gate, preying behavior, and following behavior and variation of quantum artificial fish to update the artificial fish for searching for optimal value. Then, we apply the proposed new algorithm, the quantum artificial fish swarm algorithm (QAFSA), the basic artificial fish swarm algorithm (BAFSA), and the global edition artificial fish swarm algorithm (GAFSA) to the simulation experiments for some typical test functions, respectively. The simulation results demonstrate that the proposed algorithm can escape from the local extremum effectively and has higher convergence speed and better accuracy. Finally, applying IQAFSA to distributed network problems and the simulation results for 33-bus radial distribution network system show that IQAFSA can get the minimum power loss after comparing with BAFSA, GAFSA, and QAFSA.

  4. Fast Quantum Algorithm for Predicting Descriptive Statistics of Stochastic Processes

    Science.gov (United States)

    Williams Colin P.

    1999-01-01

    Stochastic processes are used as a modeling tool in several sub-fields of physics, biology, and finance. Analytic understanding of the long term behavior of such processes is only tractable for very simple types of stochastic processes such as Markovian processes. However, in real world applications more complex stochastic processes often arise. In physics, the complicating factor might be nonlinearities; in biology it might be memory effects; and in finance is might be the non-random intentional behavior of participants in a market. In the absence of analytic insight, one is forced to understand these more complex stochastic processes via numerical simulation techniques. In this paper we present a quantum algorithm for performing such simulations. In particular, we show how a quantum algorithm can predict arbitrary descriptive statistics (moments) of N-step stochastic processes in just O(square root of N) time. That is, the quantum complexity is the square root of the classical complexity for performing such simulations. This is a significant speedup in comparison to the current state of the art.

  5. Perturbative treatment of possible failures in the adiabatic theorem

    International Nuclear Information System (INIS)

    Vertesi, T.; Englman, R.

    2005-01-01

    Complete text of publication follows. The adiabatic theorem (AT) is one of the oldest and basic results in quantum physics, and has been in widespread use ever since. The theorem concerns the evolution of systems subject to slowly varying Hamiltonians. Roughly, its content is that a system prepared in an instantaneous eigenstate of a time-dependent Hamiltonian H(t) will remain close to an instantaneous eigenstate at later times, provided the Hamiltonian changes sufficiently slowly. The role of the AT in the study of slowly varying quantum mechanical systems spans a vast array of fields and applications. In a recent application the adiabatic geometric phases have been proposed to perform various quantum computational tasks on a naturally fault-tolerant way. Additional interest has arisen in adiabatic processes in connection with the concept of adiabatic quantum computing, where the solution to a problem is encoded in the (unknown) ground state of a (known) Hamiltonian. The evolution of the quantum state is governed by a time-dependent Hamiltonian H(t), starting with an initial Hamiltonian H i with a known ground state and slowly (adiabatically) evolving to the final Hamiltonian H f with the unknown ground state, e.g., H(t) = (1 - t/T )H i + (t/T )H f , (1) where 0 ≤ t/T ≤ 1 and T controls the rate at which H(t) varies. Since the ground state of the system is very robust against external perturbations and decoherence, this scheme offers many advantages compared to the conventional quantum circuit model of quantum computation. The achievable speed-up of adiabatic quantum algorithms (compared to classical methods) depends on the value of the run-time T. The standard AT yields a general criterion to estimate the necessary run-time T, however recently Marzlin and Sanders have claimed that an inconsistency does exist for a particular class of Hamiltonians, so that the condition for the estimate of T may do not hold. Marzlin and Sanders start with a time

  6. Quantum algorithm for simulating the dynamics of an open quantum system

    International Nuclear Information System (INIS)

    Wang Hefeng; Ashhab, S.; Nori, Franco

    2011-01-01

    In the study of open quantum systems, one typically obtains the decoherence dynamics by solving a master equation. The master equation is derived using knowledge of some basic properties of the system, the environment, and their interaction: One basically needs to know the operators through which the system couples to the environment and the spectral density of the environment. For a large system, it could become prohibitively difficult to even write down the appropriate master equation, let alone solve it on a classical computer. In this paper, we present a quantum algorithm for simulating the dynamics of an open quantum system. On a quantum computer, the environment can be simulated using ancilla qubits with properly chosen single-qubit frequencies and with properly designed coupling to the system qubits. The parameters used in the simulation are easily derived from the parameters of the system + environment Hamiltonian. The algorithm is designed to simulate Markovian dynamics, but it can also be used to simulate non-Markovian dynamics provided that this dynamics can be obtained by embedding the system of interest into a larger system that obeys Markovian dynamics. We estimate the resource requirements for the algorithm. In particular, we show that for sufficiently slow decoherence a single ancilla qubit could be sufficient to represent the entire environment, in principle.

  7. Quantum and classical parallelism in parity algorithms for ensemble quantum computers

    International Nuclear Information System (INIS)

    Stadelhofer, Ralf; Suter, Dieter; Banzhaf, Wolfgang

    2005-01-01

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

  8. Adiabatic theorem and spectral concentration

    International Nuclear Information System (INIS)

    Nenciu, G.

    1981-01-01

    The spectral concentration of arbitrary order, for the Stark effect is proved to exist for a large class of Hamiltonians appearing in nonrelativistic and relativistic quantum mechanics. The results are consequences of an abstract theorem about the spectral concentration for self-ad oint operators. A general form of the adiabatic theorem of quantum mechanics, generalizing an earlier result of the author as well as some results of Lenard, is also proved [ru

  9. Quantum cascade laser spectroscopy of OCS isotopologues in 4He nanodroplets: A test of adiabatic following for a heavy rotor

    Science.gov (United States)

    Faulkner, Ty; Miller, Isaac; Raston, Paul L.

    2018-01-01

    We report high-resolution infrared spectra of OCS isotopologues embedded in helium nanodroplets that were recorded with a newly built spectrometer. For the normal isotopologue, we observed the relatively weak third bending overtone band, in addition to new high J transitions in the C-O stretching fundamental, which has previously been investigated by diode laser spectroscopy [S. Grebenev et al., J. Chem. Phys. 112, 4485 (2000)]. Similar to the gas phase, the overtone band is (only) 45 cm-1 higher in energy than the fundamental, and this leads to additional broadening due to rapid vibrational relaxation that is accompanied by the creation of real/virtual phonon excitations. We also observed spectra in the C-O stretching fundamental for several minor isotopologues of OCS, including 18OCS, O13CS, and OC33S, in addition to some new peaks for OC34S. A rovibrational analysis allowed for determination of the moment of inertia of helium (ΔIHe) that couples to the rotation of OCS for each isotopologue. In the context of the adiabatic following approximation, the helium density structure that follows the rotation of OCS should essentially remain unchanged between the isotopologues, i.e., there should be no dependence of ΔIHe on the gas phase moment of inertia of OCS (IG). While this behavior was expected for the "heavy" OCS rotor investigated here, we instead found an approximately linear 1:1 relation between ΔIHe and IG, which suggests partial breakdown of the adiabatic following approximation, making OCS the heaviest molecule for which evidence for this effect has been obtained.

  10. Quantum Image Steganography and Steganalysis Based On LSQu-Blocks Image Information Concealing Algorithm

    Science.gov (United States)

    A. AL-Salhi, Yahya E.; Lu, Songfeng

    2016-08-01

    Quantum steganography can solve some problems that are considered inefficient in image information concealing. It researches on Quantum image information concealing to have been widely exploited in recent years. Quantum image information concealing can be categorized into quantum image digital blocking, quantum image stereography, anonymity and other branches. Least significant bit (LSB) information concealing plays vital roles in the classical world because many image information concealing algorithms are designed based on it. Firstly, based on the novel enhanced quantum representation (NEQR), image uniform blocks clustering around the concrete the least significant Qu-block (LSQB) information concealing algorithm for quantum image steganography is presented. Secondly, a clustering algorithm is proposed to optimize the concealment of important data. Finally, we used Con-Steg algorithm to conceal the clustered image blocks. Information concealing located on the Fourier domain of an image can achieve the security of image information, thus we further discuss the Fourier domain LSQu-block information concealing algorithm for quantum image based on Quantum Fourier Transforms. In our algorithms, the corresponding unitary Transformations are designed to realize the aim of concealing the secret information to the least significant Qu-block representing color of the quantum cover image. Finally, the procedures of extracting the secret information are illustrated. Quantum image LSQu-block image information concealing algorithm can be applied in many fields according to different needs.

  11. Modification of Brueschweiler quantum searching algorithm and realization by NMR experiment

    International Nuclear Information System (INIS)

    Yang Xiaodong; Wei Daxiu; Luo Jun; Miao Xijia

    2002-01-01

    In recent years, quantum computing research has made big progress, which exploit quantum mechanical laws, such as interference, superposition and parallelism, to perform computing tasks. The most inducing thing is that the quantum computing can provide large rise to the speedup in quantum algorithm. Quantum computing can solve some problems, which are impossible or difficult for the classical computing. The problem of searching for a specific item in an unsorted database can be solved with certain quantum algorithm, for example, Grover quantum algorithm and Brueschweiler quantum algorithm. The former gives a quadratic speedup, and the latter gives an exponential speedup comparing with the corresponding classical algorithm. In Brueschweiler quantum searching algorithm, the data qubit and the read-out qubit (the ancilla qubit) are different qubits. The authors have studied Brueschweiler algorithm and proposed a modified version, in which no ancilla qubit is needed to reach exponential speedup in the searching, the data and the read-out qubit are the same qubits. The modified Brueschweiler algorithm can be easier to design and realize. The authors also demonstrate the modified Brueschweiler algorithm in a 3-qubit molecular system by Nuclear Magnetic Resonance (NMR) experiment

  12. Adiabatic evolution of decoherence-free subspaces and its shortcuts

    Science.gov (United States)

    Wu, S. L.; Huang, X. L.; Li, H.; Yi, X. X.

    2017-10-01

    The adiabatic theorem and shortcuts to adiabaticity for time-dependent open quantum systems are explored in this paper. Starting from the definition of dynamical stable decoherence-free subspace, we show that, under a compact adiabatic condition, the quantum state remains in the time-dependent decoherence-free subspace with an extremely high purity, even though the dynamics of the open quantum system may not be adiabatic. The adiabatic condition mentioned here in the adiabatic theorem for open systems is very similar to that for closed quantum systems, except that the operators required to change slowly are the Lindblad operators. We also show that the adiabatic evolution of decoherence-free subspaces depends on the existence of instantaneous decoherence-free subspaces, which requires that the Hamiltonian of open quantum systems be engineered according to the incoherent control protocol. In addition, shortcuts to adiabaticity for adiabatic decoherence-free subspaces are also presented based on the transitionless quantum driving method. Finally, we provide an example that consists of a two-level system coupled to a broadband squeezed vacuum field to show our theory. Our approach employs Markovian master equations and the theory can apply to finite-dimensional quantum open systems.

  13. Experimental implementation of a quantum random-walk search algorithm using strongly dipolar coupled spins

    International Nuclear Information System (INIS)

    Lu Dawei; Peng Xinhua; Du Jiangfeng; Zhu Jing; Zou Ping; Yu Yihua; Zhang Shanmin; Chen Qun

    2010-01-01

    An important quantum search algorithm based on the quantum random walk performs an oracle search on a database of N items with O(√(phN)) calls, yielding a speedup similar to the Grover quantum search algorithm. The algorithm was implemented on a quantum information processor of three-qubit liquid-crystal nuclear magnetic resonance (NMR) in the case of finding 1 out of 4, and the diagonal elements' tomography of all the final density matrices was completed with comprehensible one-dimensional NMR spectra. The experimental results agree well with the theoretical predictions.

  14. A Novel Algorithm of Quantum Random Walk in Server Traffic Control and Task Scheduling

    Directory of Open Access Journals (Sweden)

    Dong Yumin

    2014-01-01

    Full Text Available A quantum random walk optimization model and algorithm in network cluster server traffic control and task scheduling is proposed. In order to solve the problem of server load balancing, we research and discuss the distribution theory of energy field in quantum mechanics and apply it to data clustering. We introduce the method of random walk and illuminate what the quantum random walk is. Here, we mainly research the standard model of one-dimensional quantum random walk. For the data clustering problem of high dimensional space, we can decompose one m-dimensional quantum random walk into m one-dimensional quantum random walk. In the end of the paper, we compare the quantum random walk optimization method with GA (genetic algorithm, ACO (ant colony optimization, and SAA (simulated annealing algorithm. In the same time, we prove its validity and rationality by the experiment of analog and simulation.

  15. Fidelity-Based Ant Colony Algorithm with Q-learning of Quantum System

    Science.gov (United States)

    Liao, Qin; Guo, Ying; Tu, Yifeng; Zhang, Hang

    2018-03-01

    Quantum ant colony algorithm (ACA) has potential applications in quantum information processing, such as solutions of traveling salesman problem, zero-one knapsack problem, robot route planning problem, and so on. To shorten the search time of the ACA, we suggest the fidelity-based ant colony algorithm (FACA) for the control of quantum system. Motivated by structure of the Q-learning algorithm, we demonstrate the combination of a FACA with the Q-learning algorithm and suggest the design of a fidelity-based ant colony algorithm with the Q-learning to improve the performance of the FACA in a spin-1/2 quantum system. The numeric simulation results show that the FACA with the Q-learning can efficiently avoid trapping into local optimal policies and increase the speed of convergence process of quantum system.

  16. Jointly-check iterative decoding algorithm for quantum sparse graph codes

    International Nuclear Information System (INIS)

    Jun-Hu, Shao; Bao-Ming, Bai; Wei, Lin; Lin, Zhou

    2010-01-01

    For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with a standard belief-propagation (BP) algorithm. In this paper, we present a jointly-check iterative algorithm suitable for decoding quantum sparse graph codes efficiently. Numerical simulations show that this modified method outperforms the standard BP algorithm with an obvious performance improvement. (general)

  17. Error tolerance in an NMR implementation of Grover's fixed-point quantum search algorithm

    International Nuclear Information System (INIS)

    Xiao Li; Jones, Jonathan A.

    2005-01-01

    We describe an implementation of Grover's fixed-point quantum search algorithm on a nuclear magnetic resonance quantum computer, searching for either one or two matching items in an unsorted database of four items. In this algorithm the target state (an equally weighted superposition of the matching states) is a fixed point of the recursive search operator, so that the algorithm always moves towards the desired state. The effects of systematic errors in the implementation are briefly explored

  18. Parameter estimation of fractional-order chaotic systems by using quantum parallel particle swarm optimization algorithm.

    Directory of Open Access Journals (Sweden)

    Yu Huang

    Full Text Available Parameter estimation for fractional-order chaotic systems is an important issue in fractional-order chaotic control and synchronization and could be essentially formulated as a multidimensional optimization problem. A novel algorithm called quantum parallel particle swarm optimization (QPPSO is proposed to solve the parameter estimation for fractional-order chaotic systems. The parallel characteristic of quantum computing is used in QPPSO. This characteristic increases the calculation of each generation exponentially. The behavior of particles in quantum space is restrained by the quantum evolution equation, which consists of the current rotation angle, individual optimal quantum rotation angle, and global optimal quantum rotation angle. Numerical simulation based on several typical fractional-order systems and comparisons with some typical existing algorithms show the effectiveness and efficiency of the proposed algorithm.

  19. Reactive power and voltage control based on general quantum genetic algorithms

    DEFF Research Database (Denmark)

    Vlachogiannis, Ioannis (John); Østergaard, Jacob

    2009-01-01

    This paper presents an improved evolutionary algorithm based on quantum computing for optima l steady-state performance of power systems. However, the proposed general quantum genetic algorithm (GQ-GA) can be applied in various combinatorial optimization problems. In this study the GQ-GA determines...... techniques such as enhanced GA, multi-objective evolutionary algorithm and particle swarm optimization algorithms, as well as the classical primal-dual interior-point optimal power flow algorithm. The comparison demonstrates the ability of the GQ-GA in reaching more optimal solutions....

  20. Excited state non-adiabatic dynamics of N-methylpyrrole: A time-resolved photoelectron spectroscopy and quantum dynamics study

    International Nuclear Information System (INIS)

    Wu, Guorong; Neville, Simon P.; Schalk, Oliver; Sekikawa, Taro; Ashfold, Michael N. R.; Worth, Graham A.; Stolow, Albert

    2016-01-01

    The dynamics of N-methylpyrrole following excitation at wavelengths in the range 241.5-217.0 nm were studied using a combination of time-resolved photoelectron spectroscopy (TRPES), ab initio quantum dynamics calculations using the multi-layer multi-configurational time-dependent Hartree method, as well as high-level photoionization cross section calculations. Excitation at 241.5 and 236.2 nm results in population of the A 2 (πσ ∗ ) state, in agreement with previous studies. Excitation at 217.0 nm prepares the previously neglected B 1 (π3p y ) Rydberg state, followed by prompt internal conversion to the A 2 (πσ ∗ ) state. In contrast with the photoinduced dynamics of pyrrole, the lifetime of the wavepacket in the A 2 (πσ ∗ ) state was found to vary with excitation wavelength, decreasing by one order of magnitude upon tuning from 241.5 nm to 236.2 nm and by more than three orders of magnitude when excited at 217.0 nm. The order of magnitude difference in lifetimes measured at the longer excitation wavelengths is attributed to vibrational excitation in the A 2 (πσ ∗ ) state, facilitating wavepacket motion around the potential barrier in the N–CH 3 dissociation coordinate

  1. Excited state non-adiabatic dynamics of N-methylpyrrole: A time-resolved photoelectron spectroscopy and quantum dynamics study

    Energy Technology Data Exchange (ETDEWEB)

    Wu, Guorong [National Research Council Canada, 100 Sussex Drive, Ottawa, Ontario K1A 0R6 (Canada); State Key Laboratory of Molecular Reaction Dynamics, Dalian Institute of Chemical Physics, Chinese Academy of Sciences, Dalian, Liaoning 116023 (China); Synergetic Innovation Center of Quantum Information & Quantum Physics, University of Science and Technology of China, Hefei, Anhui 230026 (China); Neville, Simon P. [Department of Chemistry, University of Ottawa, 10 Marie Curie, Ottawa, Ontario K1N 6N5 (Canada); Schalk, Oliver [National Research Council Canada, 100 Sussex Drive, Ottawa, Ontario K1A 0R6 (Canada); Department of Physics, AlbaNova University Center, Stockholm University, Roslagstullsbacken 21, 106 91 Stockholm (Sweden); Sekikawa, Taro [Department of Applied Physics, Hokkaido University, Kita-13 Nishi-8, Kita-ku, Sapporo 060-8628 (Japan); Ashfold, Michael N. R. [School of Chemistry, University of Bristol, Bristol BS8 1TS (United Kingdom); Worth, Graham A. [School of Chemistry, University of Birmingham, Edgbaston, Birmingham B15 2TT (United Kingdom); Stolow, Albert, E-mail: astolow@uottawa.ca [National Research Council Canada, 100 Sussex Drive, Ottawa, Ontario K1A 0R6 (Canada); Department of Chemistry, University of Ottawa, 10 Marie Curie, Ottawa, Ontario K1N 6N5 (Canada); Department of Physics, University of Ottawa, 150 Louis Pasteur, Ottawa, Ontario K1N 6N5 (Canada)

    2016-01-07

    The dynamics of N-methylpyrrole following excitation at wavelengths in the range 241.5-217.0 nm were studied using a combination of time-resolved photoelectron spectroscopy (TRPES), ab initio quantum dynamics calculations using the multi-layer multi-configurational time-dependent Hartree method, as well as high-level photoionization cross section calculations. Excitation at 241.5 and 236.2 nm results in population of the A{sub 2}(πσ{sup ∗}) state, in agreement with previous studies. Excitation at 217.0 nm prepares the previously neglected B{sub 1}(π3p{sub y}) Rydberg state, followed by prompt internal conversion to the A{sub 2}(πσ{sup ∗}) state. In contrast with the photoinduced dynamics of pyrrole, the lifetime of the wavepacket in the A{sub 2}(πσ{sup ∗}) state was found to vary with excitation wavelength, decreasing by one order of magnitude upon tuning from 241.5 nm to 236.2 nm and by more than three orders of magnitude when excited at 217.0 nm. The order of magnitude difference in lifetimes measured at the longer excitation wavelengths is attributed to vibrational excitation in the A{sub 2}(πσ{sup ∗}) state, facilitating wavepacket motion around the potential barrier in the N–CH{sub 3} dissociation coordinate.

  2. Semiclassical Monte Carlo: A first principles approach to non-adiabatic molecular dynamics

    International Nuclear Information System (INIS)

    White, Alexander J.; Gorshkov, Vyacheslav N.; Wang, Ruixi; Tretiak, Sergei; Mozyrsky, Dmitry

    2014-01-01

    Modeling the dynamics of photophysical and (photo)chemical reactions in extended molecular systems is a new frontier for quantum chemistry. Many dynamical phenomena, such as intersystem crossing, non-radiative relaxation, and charge and energy transfer, require a non-adiabatic description which incorporate transitions between electronic states. Additionally, these dynamics are often highly sensitive to quantum coherences and interference effects. Several methods exist to simulate non-adiabatic dynamics; however, they are typically either too expensive to be applied to large molecular systems (10's-100's of atoms), or they are based on ad hoc schemes which may include severe approximations due to inconsistencies in classical and quantum mechanics. We present, in detail, an algorithm based on Monte Carlo sampling of the semiclassical time-dependent wavefunction that involves running simple surface hopping dynamics, followed by a post-processing step which adds little cost. The method requires only a few quantities from quantum chemistry calculations, can systematically be improved, and provides excellent agreement with exact quantum mechanical results. Here we show excellent agreement with exact solutions for scattering results of standard test problems. Additionally, we find that convergence of the wavefunction is controlled by complex valued phase factors, the size of the non-adiabatic coupling region, and the choice of sampling function. These results help in determining the range of applicability of the method, and provide a starting point for further improvement

  3. Quantum Chemistry on Quantum Computers: A Polynomial-Time Quantum Algorithm for Constructing the Wave Functions of Open-Shell Molecules.

    Science.gov (United States)

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

    2016-08-18

    Quantum computers are capable to efficiently perform full configuration interaction (FCI) calculations of atoms and molecules by using the quantum phase estimation (QPE) algorithm. Because the success probability of the QPE depends on the overlap between approximate and exact wave functions, efficient methods to prepare accurate initial guess wave functions enough to have sufficiently large overlap with the exact ones are highly desired. Here, we propose a quantum algorithm to construct the wave function consisting of one configuration state function, which is suitable for the initial guess wave function in QPE-based FCI calculations of open-shell molecules, based on the addition theorem of angular momentum. The proposed quantum algorithm enables us to prepare the wave function consisting of an exponential number of Slater determinants only by a polynomial number of quantum operations.

  4. Ab initio multiple cloning algorithm for quantum nonadiabatic molecular dynamics

    Energy Technology Data Exchange (ETDEWEB)

    Makhov, Dmitry V.; Shalashilin, Dmitrii V. [Department of Chemistry, University of Leeds, Leeds LS2 9JT (United Kingdom); Glover, William J.; Martinez, Todd J. [Department of Chemistry and The PULSE Institute, Stanford University, Stanford, California 94305, USA and SLAC National Accelerator Laboratory, Menlo Park, California 94025 (United States)

    2014-08-07

    We present a new algorithm for ab initio quantum nonadiabatic molecular dynamics that combines the best features of ab initio Multiple Spawning (AIMS) and Multiconfigurational Ehrenfest (MCE) methods. In this new method, ab initio multiple cloning (AIMC), the individual trajectory basis functions (TBFs) follow Ehrenfest equations of motion (as in MCE). However, the basis set is expanded (as in AIMS) when these TBFs become sufficiently mixed, preventing prolonged evolution on an averaged potential energy surface. We refer to the expansion of the basis set as “cloning,” in analogy to the “spawning” procedure in AIMS. This synthesis of AIMS and MCE allows us to leverage the benefits of mean-field evolution during periods of strong nonadiabatic coupling while simultaneously avoiding mean-field artifacts in Ehrenfest dynamics. We explore the use of time-displaced basis sets, “trains,” as a means of expanding the basis set for little cost. We also introduce a new bra-ket averaged Taylor expansion (BAT) to approximate the necessary potential energy and nonadiabatic coupling matrix elements. The BAT approximation avoids the necessity of computing electronic structure information at intermediate points between TBFs, as is usually done in saddle-point approximations used in AIMS. The efficiency of AIMC is demonstrated on the nonradiative decay of the first excited state of ethylene. The AIMC method has been implemented within the AIMS-MOLPRO package, which was extended to include Ehrenfest basis functions.

  5. Efficient learning algorithm for quantum perceptron unitary weights

    OpenAIRE

    Seow, Kok-Leong; Behrman, Elizabeth; Steck, James

    2015-01-01

    For the past two decades, researchers have attempted to create a Quantum Neural Network (QNN) by combining the merits of quantum computing and neural computing. In order to exploit the advantages of the two prolific fields, the QNN must meet the non-trivial task of integrating the unitary dynamics of quantum computing and the dissipative dynamics of neural computing. At the core of quantum computing and neural computing lies the qubit and perceptron, respectively. We see that past implementat...

  6. Q-learning-based adjustable fixed-phase quantum Grover search algorithm

    International Nuclear Information System (INIS)

    Guo Ying; Shi Wensha; Wang Yijun; Hu, Jiankun

    2017-01-01

    We demonstrate that the rotation phase can be suitably chosen to increase the efficiency of the phase-based quantum search algorithm, leading to a dynamic balance between iterations and success probabilities of the fixed-phase quantum Grover search algorithm with Q-learning for a given number of solutions. In this search algorithm, the proposed Q-learning algorithm, which is a model-free reinforcement learning strategy in essence, is used for performing a matching algorithm based on the fraction of marked items λ and the rotation phase α. After establishing the policy function α = π(λ), we complete the fixed-phase Grover algorithm, where the phase parameter is selected via the learned policy. Simulation results show that the Q-learning-based Grover search algorithm (QLGA) enables fewer iterations and gives birth to higher success probabilities. Compared with the conventional Grover algorithms, it avoids the optimal local situations, thereby enabling success probabilities to approach one. (author)

  7. Effects of systematic phase errors on optimized quantum random-walk search algorithm

    International Nuclear Information System (INIS)

    Zhang Yu-Chao; Bao Wan-Su; Wang Xiang; Fu Xiang-Qun

    2015-01-01

    This study investigates the effects of systematic errors in phase inversions on the success rate and number of iterations in the optimized quantum random-walk search algorithm. Using the geometric description of this algorithm, a model of the algorithm with phase errors is established, and the relationship between the success rate of the algorithm, the database size, the number of iterations, and the phase error is determined. For a given database size, we obtain both the maximum success rate of the algorithm and the required number of iterations when phase errors are present in the algorithm. Analyses and numerical simulations show that the optimized quantum random-walk search algorithm is more robust against phase errors than Grover’s algorithm. (paper)

  8. Improved Quantum Artificial Fish Algorithm Application to Distributed Network Considering Distributed Generation

    Directory of Open Access Journals (Sweden)

    Tingsong Du

    2015-01-01

    Full Text Available An improved quantum artificial fish swarm algorithm (IQAFSA for solving distributed network programming considering distributed generation is proposed in this work. The IQAFSA based on quantum computing which has exponential acceleration for heuristic algorithm uses quantum bits to code artificial fish and quantum revolving gate, preying behavior, and following behavior and variation of quantum artificial fish to update the artificial fish for searching for optimal value. Then, we apply the proposed new algorithm, the quantum artificial fish swarm algorithm (QAFSA, the basic artificial fish swarm algorithm (BAFSA, and the global edition artificial fish swarm algorithm (GAFSA to the simulation experiments for some typical test functions, respectively. The simulation results demonstrate that the proposed algorithm can escape from the local extremum effectively and has higher convergence speed and better accuracy. Finally, applying IQAFSA to distributed network problems and the simulation results for 33-bus radial distribution network system show that IQAFSA can get the minimum power loss after comparing with BAFSA, GAFSA, and QAFSA.

  9. A Novel Real-coded Quantum-inspired Genetic Algorithm and Its Application in Data Reconciliation

    Directory of Open Access Journals (Sweden)

    Gao Lin

    2012-06-01

    Full Text Available Traditional quantum-inspired genetic algorithm (QGA has drawbacks such as premature convergence, heavy computational cost, complicated coding and decoding process etc. In this paper, a novel real-coded quantum-inspired genetic algorithm is proposed based on interval division thinking. Detailed comparisons with some similar approaches for some standard benchmark functions test validity of the proposed algorithm. Besides, the proposed algorithm is used in two typical nonlinear data reconciliation problems (distilling process and extraction process and simulation results show its efficiency in nonlinear data reconciliation problems.

  10. Optical simulation of quantum algorithms using programmable liquid-crystal displays

    International Nuclear Information System (INIS)

    Puentes, Graciana; La Mela, Cecilia; Ledesma, Silvia; Iemmi, Claudio; Paz, Juan Pablo; Saraceno, Marcos

    2004-01-01

    We present a scheme to perform an all optical simulation of quantum algorithms and maps. The main components are lenses to efficiently implement the Fourier transform and programmable liquid-crystal displays to introduce space dependent phase changes on a classical optical beam. We show how to simulate Deutsch-Jozsa and Grover's quantum algorithms using essentially the same optical array programmed in two different ways

  11. From Schrцdinger's equation to the quantum search algorithm£

    Indian Academy of Sciences (India)

    Also the framework was simple and general and could be extended to ... It is unusual to write a paper listing the steps that led to a result after the result itself ... the quantum search algorithm – it is by no means a comprehensive review of quantum ..... D, as defined in the previous section, is no longer unitary for large ε.

  12. Quantum Algorithm for K-Nearest Neighbors Classification Based on the Metric of Hamming Distance

    Science.gov (United States)

    Ruan, Yue; Xue, Xiling; Liu, Heng; Tan, Jianing; Li, Xi

    2017-11-01

    K-nearest neighbors (KNN) algorithm is a common algorithm used for classification, and also a sub-routine in various complicated machine learning tasks. In this paper, we presented a quantum algorithm (QKNN) for implementing this algorithm based on the metric of Hamming distance. We put forward a quantum circuit for computing Hamming distance between testing sample and each feature vector in the training set. Taking advantage of this method, we realized a good analog for classical KNN algorithm by setting a distance threshold value t to select k - n e a r e s t neighbors. As a result, QKNN achieves O( n 3) performance which is only relevant to the dimension of feature vectors and high classification accuracy, outperforms Llyod's algorithm (Lloyd et al. 2013) and Wiebe's algorithm (Wiebe et al. 2014).

  13. Hybrid Approach To Steganography System Based On Quantum Encryption And Chaos Algorithms

    Directory of Open Access Journals (Sweden)

    ZAID A. ABOD

    2018-01-01

    Full Text Available A hybrid scheme for secretly embedding image into a dithered multilevel image is presented. This work inputs both a cover image and secret image, which are scrambling and divided into groups to embedded together based on multiple chaos algorithms (Lorenz map, Henon map and Logistic map respectively. Finally, encrypt the embedded images by using one of the quantum cryptography mechanisms, which is quantum one time pad. The experimental results show that the proposed hybrid system successfully embedded images and combine with the quantum cryptography algorithms and gives high efficiency for secure communication.

  14. Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance.

    Science.gov (United States)

    Vandersypen, L M; Steffen, M; Breyta, G; Yannoni, C S; Sherwood, M H; Chuang, I L

    The number of steps any classical computer requires in order to find the prime factors of an l-digit integer N increases exponentially with l, at least using algorithms known at present. Factoring large integers is therefore conjectured to be intractable classically, an observation underlying the security of widely used cryptographic codes. Quantum computers, however, could factor integers in only polynomial time, using Shor's quantum factoring algorithm. Although important for the study of quantum computers, experimental demonstration of this algorithm has proved elusive. Here we report an implementation of the simplest instance of Shor's algorithm: factorization of N = 15 (whose prime factors are 3 and 5). We use seven spin-1/2 nuclei in a molecule as quantum bits, which can be manipulated with room temperature liquid-state nuclear magnetic resonance techniques. This method of using nuclei to store quantum information is in principle scalable to systems containing many quantum bits, but such scalability is not implied by the present work. The significance of our work lies in the demonstration of experimental and theoretical techniques for precise control and modelling of complex quantum computers. In particular, we present a simple, parameter-free but predictive model of decoherence effects in our system.

  15. Combinatorial Clustering Algorithm of Quantum-Behaved Particle Swarm Optimization and Cloud Model

    Directory of Open Access Journals (Sweden)

    Mi-Yuan Shan

    2013-01-01

    Full Text Available We propose a combinatorial clustering algorithm of cloud model and quantum-behaved particle swarm optimization (COCQPSO to solve the stochastic problem. The algorithm employs a novel probability model as well as a permutation-based local search method. We are setting the parameters of COCQPSO based on the design of experiment. In the comprehensive computational study, we scrutinize the performance of COCQPSO on a set of widely used benchmark instances. By benchmarking combinatorial clustering algorithm with state-of-the-art algorithms, we can show that its performance compares very favorably. The fuzzy combinatorial optimization algorithm of cloud model and quantum-behaved particle swarm optimization (FCOCQPSO in vague sets (IVSs is more expressive than the other fuzzy sets. Finally, numerical examples show the clustering effectiveness of COCQPSO and FCOCQPSO clustering algorithms which are extremely remarkable.

  16. Quantum Partial Searching Algorithm of a Database with Several Target Items

    International Nuclear Information System (INIS)

    Pu-Cha, Zhong; Wan-Su, Bao; Yun, Wei

    2009-01-01

    Choi and Korepin [Quantum Information Processing 6(2007)243] presented a quantum partial search algorithm of a database with several target items which can find a target block quickly when each target block contains the same number of target items. Actually, the number of target items in each target block is arbitrary. Aiming at this case, we give a condition to guarantee performance of the partial search algorithm to be performed and the number of queries to oracle of the algorithm to be minimized. In addition, by further numerical computing we come to the conclusion that the more uniform the distribution of target items, the smaller the number of queries

  17. Shor's factoring algorithm and modern cryptography. An illustration of the capabilities inherent in quantum computers

    Science.gov (United States)

    Gerjuoy, Edward

    2005-06-01

    The security of messages encoded via the widely used RSA public key encryption system rests on the enormous computational effort required to find the prime factors of a large number N using classical (conventional) computers. In 1994 Peter Shor showed that for sufficiently large N, a quantum computer could perform the factoring with much less computational effort. This paper endeavors to explain, in a fashion comprehensible to the nonexpert, the RSA encryption protocol; the various quantum computer manipulations constituting the Shor algorithm; how the Shor algorithm performs the factoring; and the precise sense in which a quantum computer employing Shor's algorithm can be said to accomplish the factoring of very large numbers with less computational effort than a classical computer. It is made apparent that factoring N generally requires many successive runs of the algorithm. Our analysis reveals that the probability of achieving a successful factorization on a single run is about twice as large as commonly quoted in the literature.

  18. Computation of Molecular Spectra on a Quantum Processor with an Error-Resilient Algorithm

    Directory of Open Access Journals (Sweden)

    J. I. Colless

    2018-02-01

    Full Text Available Harnessing the full power of nascent quantum processors requires the efficient management of a limited number of quantum bits with finite coherent lifetimes. Hybrid algorithms, such as the variational quantum eigensolver (VQE, leverage classical resources to reduce the required number of quantum gates. Experimental demonstrations of VQE have resulted in calculation of Hamiltonian ground states, and a new theoretical approach based on a quantum subspace expansion (QSE has outlined a procedure for determining excited states that are central to dynamical processes. We use a superconducting-qubit-based processor to apply the QSE approach to the H_{2} molecule, extracting both ground and excited states without the need for auxiliary qubits or additional minimization. Further, we show that this extended protocol can mitigate the effects of incoherent errors, potentially enabling larger-scale quantum simulations without the need for complex error-correction techniques.

  19. Computation of Molecular Spectra on a Quantum Processor with an Error-Resilient Algorithm

    Science.gov (United States)

    Colless, J. I.; Ramasesh, V. V.; Dahlen, D.; Blok, M. S.; Kimchi-Schwartz, M. E.; McClean, J. R.; Carter, J.; de Jong, W. A.; Siddiqi, I.

    2018-02-01

    Harnessing the full power of nascent quantum processors requires the efficient management of a limited number of quantum bits with finite coherent lifetimes. Hybrid algorithms, such as the variational quantum eigensolver (VQE), leverage classical resources to reduce the required number of quantum gates. Experimental demonstrations of VQE have resulted in calculation of Hamiltonian ground states, and a new theoretical approach based on a quantum subspace expansion (QSE) has outlined a procedure for determining excited states that are central to dynamical processes. We use a superconducting-qubit-based processor to apply the QSE approach to the H2 molecule, extracting both ground and excited states without the need for auxiliary qubits or additional minimization. Further, we show that this extended protocol can mitigate the effects of incoherent errors, potentially enabling larger-scale quantum simulations without the need for complex error-correction techniques.

  20. A Simple Encryption Algorithm for Quantum Color Image

    Science.gov (United States)

    Li, Panchi; Zhao, Ya

    2017-06-01

    In this paper, a simple encryption scheme for quantum color image is proposed. Firstly, a color image is transformed into a quantum superposition state by employing NEQR (novel enhanced quantum representation), where the R,G,B values of every pixel in a 24-bit RGB true color image are represented by 24 single-qubit basic states, and each value has 8 qubits. Then, these 24 qubits are respectively transformed from a basic state into a balanced superposition state by employed the controlled rotation gates. At this time, the gray-scale values of R, G, B of every pixel are in a balanced superposition of 224 multi-qubits basic states. After measuring, the whole image is an uniform white noise, which does not provide any information. Decryption is the reverse process of encryption. The experimental results on the classical computer show that the proposed encryption scheme has better security.

  1. Implementation of a three-qubit refined Deutsch-Jozsa algorithm using SFG quantum logic gates

    International Nuclear Information System (INIS)

    Duce, A Del; Savory, S; Bayvel, P

    2006-01-01

    In this paper we present a quantum logic circuit which can be used for the experimental demonstration of a three-qubit solid state quantum computer based on a recent proposal of optically driven quantum logic gates. In these gates, the entanglement of randomly placed electron spin qubits is manipulated by optical excitation of control electrons. The circuit we describe solves the Deutsch problem with an improved algorithm called the refined Deutsch-Jozsa algorithm. We show that it is possible to select optical pulses that solve the Deutsch problem correctly, and do so without losing quantum information to the control electrons, even though the gate parameters vary substantially from one gate to another

  2. Implementation of a three-qubit refined Deutsch-Jozsa algorithm using SFG quantum logic gates

    Energy Technology Data Exchange (ETDEWEB)

    Duce, A Del; Savory, S; Bayvel, P [Department of Electronic and Electrical Engineering, University College London, Torrington Place, London WC1E 7JE (United Kingdom)

    2006-05-31

    In this paper we present a quantum logic circuit which can be used for the experimental demonstration of a three-qubit solid state quantum computer based on a recent proposal of optically driven quantum logic gates. In these gates, the entanglement of randomly placed electron spin qubits is manipulated by optical excitation of control electrons. The circuit we describe solves the Deutsch problem with an improved algorithm called the refined Deutsch-Jozsa algorithm. We show that it is possible to select optical pulses that solve the Deutsch problem correctly, and do so without losing quantum information to the control electrons, even though the gate parameters vary substantially from one gate to another.

  3. Implementation of a three-qubit refined Deutsch Jozsa algorithm using SFG quantum logic gates

    Science.gov (United States)

    DelDuce, A.; Savory, S.; Bayvel, P.

    2006-05-01

    In this paper we present a quantum logic circuit which can be used for the experimental demonstration of a three-qubit solid state quantum computer based on a recent proposal of optically driven quantum logic gates. In these gates, the entanglement of randomly placed electron spin qubits is manipulated by optical excitation of control electrons. The circuit we describe solves the Deutsch problem with an improved algorithm called the refined Deutsch-Jozsa algorithm. We show that it is possible to select optical pulses that solve the Deutsch problem correctly, and do so without losing quantum information to the control electrons, even though the gate parameters vary substantially from one gate to another.

  4. A quantum search algorithm of two entangled registers to realize quantum discrete Fourier transform of signal processing

    International Nuclear Information System (INIS)

    Pang Chaoyang; Hu Benqiong

    2008-01-01

    The discrete Fourier transform (DFT) is the base of modern signal processing. 1-dimensional fast Fourier transform (ID FFT) and 2D FFT have time complexity O (N log N) and O (N 2 log N) respectively. Since 1965, there has been no more essential breakthrough for the design of fast DFT algorithm. DFT has two properties. One property is that DFT is energy conservation transform. The other property is that many DFT coefficients are close to zero. The basic idea of this paper is that the generalized Grover's iteration can perform the computation of DFT which acts on the entangled states to search the big DFT coefficients until these big coefficients contain nearly all energy. One-dimensional quantum DFT (ID QDFT) and two-dimensional quantum DFT (2D QDFT) are presented in this paper. The quantum algorithm for convolution estimation is also presented in this paper. Compared with FFT, ID and 2D QDFT have time complexity O(√N) and O (N) respectively. QDFT and quantum convolution demonstrate that quantum computation to process classical signal is possible. (general)

  5. Fast and efficient wireless power transfer via transitionless quantum driving.

    Science.gov (United States)

    Paul, Koushik; Sarma, Amarendra K

    2018-03-07

    Shortcut to adiabaticity (STA) techniques have the potential to drive a system beyond the adiabatic limits. Here, we present a robust and efficient method for wireless power transfer (WPT) between two coils based on the so-called transitionless quantum driving (TQD) algorithm. We show that it is possible to transfer power between the coils significantly fast compared to its adiabatic counterpart. The scheme is fairly robust against the variations in the coupling strength and the coupling distance between the coils. Also, the scheme is found to be reasonably immune to intrinsic losses in the coils.

  6. Quantum algorithms on Walsh transform and Hamming distance for Boolean functions

    Science.gov (United States)

    Xie, Zhengwei; Qiu, Daowen; Cai, Guangya

    2018-06-01

    Walsh spectrum or Walsh transform is an alternative description of Boolean functions. In this paper, we explore quantum algorithms to approximate the absolute value of Walsh transform W_f at a single point z0 (i.e., |W_f(z0)|) for n-variable Boolean functions with probability at least 8/π 2 using the number of O(1/|W_f(z_{0)|ɛ }) queries, promised that the accuracy is ɛ , while the best known classical algorithm requires O(2n) queries. The Hamming distance between Boolean functions is used to study the linearity testing and other important problems. We take advantage of Walsh transform to calculate the Hamming distance between two n-variable Boolean functions f and g using O(1) queries in some cases. Then, we exploit another quantum algorithm which converts computing Hamming distance between two Boolean functions to quantum amplitude estimation (i.e., approximate counting). If Ham(f,g)=t≠0, we can approximately compute Ham( f, g) with probability at least 2/3 by combining our algorithm and {Approx-Count(f,ɛ ) algorithm} using the expected number of Θ( √{N/(\\lfloor ɛ t\\rfloor +1)}+√{t(N-t)}/\\lfloor ɛ t\\rfloor +1) queries, promised that the accuracy is ɛ . Moreover, our algorithm is optimal, while the exact query complexity for the above problem is Θ(N) and the query complexity with the accuracy ɛ is O(1/ɛ 2N/(t+1)) in classical algorithm, where N=2n. Finally, we present three exact quantum query algorithms for two promise problems on Hamming distance using O(1) queries, while any classical deterministic algorithm solving the problem uses Ω(2n) queries.

  7. Chaos Quantum-Behaved Cat Swarm Optimization Algorithm and Its Application in the PV MPPT

    Directory of Open Access Journals (Sweden)

    Xiaohua Nie

    2017-01-01

    Full Text Available Cat Swarm Optimization (CSO algorithm was put forward in 2006. Despite a faster convergence speed compared with Particle Swarm Optimization (PSO algorithm, the application of CSO is greatly limited by the drawback of “premature convergence,” that is, the possibility of trapping in local optimum when dealing with nonlinear optimization problem with a large number of local extreme values. In order to surmount the shortcomings of CSO, Chaos Quantum-behaved Cat Swarm Optimization (CQCSO algorithm is proposed in this paper. Firstly, Quantum-behaved Cat Swarm Optimization (QCSO algorithm improves the accuracy of the CSO algorithm, because it is easy to fall into the local optimum in the later stage. Chaos Quantum-behaved Cat Swarm Optimization (CQCSO algorithm is proposed by introducing tent map for jumping out of local optimum in this paper. Secondly, CQCSO has been applied in the simulation of five different test functions, showing higher accuracy and less time consumption than CSO and QCSO. Finally, photovoltaic MPPT model and experimental platform are established and global maximum power point tracking control strategy is achieved by CQCSO algorithm, the effectiveness and efficiency of which have been verified by both simulation and experiment.

  8. Chaos Quantum-Behaved Cat Swarm Optimization Algorithm and Its Application in the PV MPPT.

    Science.gov (United States)

    Nie, Xiaohua; Wang, Wei; Nie, Haoyao

    2017-01-01

    Cat Swarm Optimization (CSO) algorithm was put forward in 2006. Despite a faster convergence speed compared with Particle Swarm Optimization (PSO) algorithm, the application of CSO is greatly limited by the drawback of "premature convergence," that is, the possibility of trapping in local optimum when dealing with nonlinear optimization problem with a large number of local extreme values. In order to surmount the shortcomings of CSO, Chaos Quantum-behaved Cat Swarm Optimization (CQCSO) algorithm is proposed in this paper. Firstly, Quantum-behaved Cat Swarm Optimization (QCSO) algorithm improves the accuracy of the CSO algorithm, because it is easy to fall into the local optimum in the later stage. Chaos Quantum-behaved Cat Swarm Optimization (CQCSO) algorithm is proposed by introducing tent map for jumping out of local optimum in this paper. Secondly, CQCSO has been applied in the simulation of five different test functions, showing higher accuracy and less time consumption than CSO and QCSO. Finally, photovoltaic MPPT model and experimental platform are established and global maximum power point tracking control strategy is achieved by CQCSO algorithm, the effectiveness and efficiency of which have been verified by both simulation and experiment.

  9. Generalized shortcuts to adiabaticity and enhanced robustness against decoherence

    Science.gov (United States)

    Santos, Alan C.; Sarandy, Marcelo S.

    2018-01-01

    Shortcuts to adiabaticity provide a general approach to mimic adiabatic quantum processes via arbitrarily fast evolutions in Hilbert space. For these counter-diabatic evolutions, higher speed comes at higher energy cost. Here, the counter-diabatic theory is employed as a minimal energy demanding scheme for speeding up adiabatic tasks. As a by-product, we show that this approach can be used to obtain infinite classes of transitionless models, including time-independent Hamiltonians under certain conditions over the eigenstates of the original Hamiltonian. We apply these results to investigate shortcuts to adiabaticity in decohering environments by introducing the requirement of a fixed energy resource. In this scenario, we show that generalized transitionless evolutions can be more robust against decoherence than their adiabatic counterparts. We illustrate this enhanced robustness both for the Landau-Zener model and for quantum gate Hamiltonians.

  10. Improving the quantum cost of reversible Boolean functions using reorder algorithm

    Science.gov (United States)

    Ahmed, Taghreed; Younes, Ahmed; Elsayed, Ashraf

    2018-05-01

    This paper introduces a novel algorithm to synthesize a low-cost reversible circuits for any Boolean function with n inputs represented as a Positive Polarity Reed-Muller expansion. The proposed algorithm applies a predefined rules to reorder the terms in the function to minimize the multi-calculation of common parts of the Boolean function to decrease the quantum cost of the reversible circuit. The paper achieves a decrease in the quantum cost and/or the circuit length, on average, when compared with relevant work in the literature.

  11. Applications of the Chaotic Quantum Genetic Algorithm with Support Vector Regression in Load Forecasting

    Directory of Open Access Journals (Sweden)

    Cheng-Wen Lee

    2017-11-01

    Full Text Available Accurate electricity forecasting is still the critical issue in many energy management fields. The applications of hybrid novel algorithms with support vector regression (SVR models to overcome the premature convergence problem and improve forecasting accuracy levels also deserve to be widely explored. This paper applies chaotic function and quantum computing concepts to address the embedded drawbacks including crossover and mutation operations of genetic algorithms. Then, this paper proposes a novel electricity load forecasting model by hybridizing chaotic function and quantum computing with GA in an SVR model (named SVRCQGA to achieve more satisfactory forecasting accuracy levels. Experimental examples demonstrate that the proposed SVRCQGA model is superior to other competitive models.

  12. Extracting quantum dynamics from genetic learning algorithms through principal control analysis

    International Nuclear Information System (INIS)

    White, J L; Pearson, B J; Bucksbaum, P H

    2004-01-01

    Genetic learning algorithms are widely used to control ultrafast optical pulse shapes for photo-induced quantum control of atoms and molecules. An unresolved issue is how to use the solutions found by these algorithms to learn about the system's quantum dynamics. We propose a simple method based on covariance analysis of the control space, which can reveal the degrees of freedom in the effective control Hamiltonian. We have applied this technique to stimulated Raman scattering in liquid methanol. A simple model of two-mode stimulated Raman scattering is consistent with the results. (letter to the editor)

  13. Certain integrable system on a space associated with a quantum search algorithm

    International Nuclear Information System (INIS)

    Uwano, Y.; Hino, H.; Ishiwatari, Y.

    2007-01-01

    On thinking up a Grover-type quantum search algorithm for an ordered tuple of multiqubit states, a gradient system associated with the negative von Neumann entropy is studied on the space of regular relative configurations of multiqubit states (SR 2 CMQ). The SR 2 CMQ emerges, through a geometric procedure, from the space of ordered tuples of multiqubit states for the quantum search. The aim of this paper is to give a brief report on the integrability of the gradient dynamical system together with quantum information geometry of the underlying space, SR 2 CMQ, of that system

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

    Energy Technology Data Exchange (ETDEWEB)

    Alsing, Paul [United States Air Force Research Laboratory, Wright-Patterson Air Force Base; Fanto, Michael [United States Air Force Research Laboratory, Wright-Patterson Air Force Base; Lott, Capt. Gordon [United States Air Force Research Laboratory, Wright-Patterson Air Force Base; Tison, Christoper C. [United States Air Force Research Laboratory, Wright-Patterson Air Force Base

    2014-01-01

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

  15. Data-driven gradient algorithm for high-precision quantum control

    Science.gov (United States)

    Wu, Re-Bing; Chu, Bing; Owens, David H.; Rabitz, Herschel

    2018-04-01

    In the quest to achieve scalable quantum information processing technologies, gradient-based optimal control algorithms (e.g., grape) are broadly used for implementing high-precision quantum gates, but their performance is often hindered by deterministic or random errors in the system model and the control electronics. In this paper, we show that grape can be taught to be more effective by jointly learning from the design model and the experimental data obtained from process tomography. The resulting data-driven gradient optimization algorithm (d-grape) can in principle correct all deterministic gate errors, with a mild efficiency loss. The d-grape algorithm may become more powerful with broadband controls that involve a large number of control parameters, while other algorithms usually slow down due to the increased size of the search space. These advantages are demonstrated by simulating the implementation of a two-qubit controlled-not gate.

  16. A Swarm Optimization Genetic Algorithm Based on Quantum-Behaved Particle Swarm Optimization.

    Science.gov (United States)

    Sun, Tao; Xu, Ming-Hai

    2017-01-01

    Quantum-behaved particle swarm optimization (QPSO) algorithm is a variant of the traditional particle swarm optimization (PSO). The QPSO that was originally developed for continuous search spaces outperforms the traditional PSO in search ability. This paper analyzes the main factors that impact the search ability of QPSO and converts the particle movement formula to the mutation condition by introducing the rejection region, thus proposing a new binary algorithm, named swarm optimization genetic algorithm (SOGA), because it is more like genetic algorithm (GA) than PSO in form. SOGA has crossover and mutation operator as GA but does not need to set the crossover and mutation probability, so it has fewer parameters to control. The proposed algorithm was tested with several nonlinear high-dimension functions in the binary search space, and the results were compared with those from BPSO, BQPSO, and GA. The experimental results show that SOGA is distinctly superior to the other three algorithms in terms of solution accuracy and convergence.

  17. Experimental realization of a one-way quantum computer algorithm solving Simon's problem.

    Science.gov (United States)

    Tame, M S; Bell, B A; Di Franco, C; Wadsworth, W J; Rarity, J G

    2014-11-14

    We report an experimental demonstration of a one-way implementation of a quantum algorithm solving Simon's problem-a black-box period-finding problem that has an exponential gap between the classical and quantum runtime. Using an all-optical setup and modifying the bases of single-qubit measurements on a five-qubit cluster state, key representative functions of the logical two-qubit version's black box can be queried and solved. To the best of our knowledge, this work represents the first experimental realization of the quantum algorithm solving Simon's problem. The experimental results are in excellent agreement with the theoretical model, demonstrating the successful performance of the algorithm. With a view to scaling up to larger numbers of qubits, we analyze the resource requirements for an n-qubit version. This work helps highlight how one-way quantum computing provides a practical route to experimentally investigating the quantum-classical gap in the query complexity model.

  18. Scales of Time Where the Quantum Discord Allows an Efficient Execution of the DQC1 Algorithm

    Directory of Open Access Journals (Sweden)

    M. Ávila

    2014-01-01

    Full Text Available The power of one qubit deterministic quantum processor (DQC1 (Knill and Laflamme (1998 generates a nonclassical correlation known as quantum discord. The DQC1 algorithm executes in an efficient way with a characteristic time given by τ=Tr[Un]/2n, where Un is an n qubit unitary gate. For pure states, quantum discord means entanglement while for mixed states such a quantity is more than entanglement. Quantum discord can be thought of as the mutual information between two systems. Within the quantum discord approach the role of time in an efficient evaluation of τ is discussed. It is found that the smaller the value of t/T is, where t is the time of execution of the DQC1 algorithm and T is the scale of time where the nonclassical correlations prevail, the more efficient the calculation of τ is. A Mösbauer nucleus might be a good processor of the DQC1 algorithm while a nuclear spin chain would not be efficient for the calculation of τ.

  19. Mathematical foundation of quantum annealing

    International Nuclear Information System (INIS)

    Morita, Satoshi; Nishimori, Hidetoshi

    2008-01-01

    Quantum annealing is a generic name of quantum algorithms that use quantum-mechanical fluctuations to search for the solution of an optimization problem. It shares the basic idea with quantum adiabatic evolution studied actively in quantum computation. The present paper reviews the mathematical and theoretical foundations of quantum annealing. In particular, theorems are presented for convergence conditions of quantum annealing to the target optimal state after an infinite-time evolution following the Schroedinger or stochastic (Monte Carlo) dynamics. It is proved that the same asymptotic behavior of the control parameter guarantees convergence for both the Schroedinger dynamics and the stochastic dynamics in spite of the essential difference of these two types of dynamics. Also described are the prescriptions to reduce errors in the final approximate solution obtained after a long but finite dynamical evolution of quantum annealing. It is shown there that we can reduce errors significantly by an ingenious choice of annealing schedule (time dependence of the control parameter) without compromising computational complexity qualitatively. A review is given on the derivation of the convergence condition for classical simulated annealing from the view point of quantum adiabaticity using a classical-quantum mapping

  20. Modelling Systems of Classical/Quantum Identical Particles by Focusing on Algorithms

    Science.gov (United States)

    Guastella, Ivan; Fazio, Claudio; Sperandeo-Mineo, Rosa Maria

    2012-01-01

    A procedure modelling ideal classical and quantum gases is discussed. The proposed approach is mainly based on the idea that modelling and algorithm analysis can provide a deeper understanding of particularly complex physical systems. Appropriate representations and physical models able to mimic possible pseudo-mechanisms of functioning and having…

  1. Algebraic and algorithmic frameworks for optimized quantum measurements

    DEFF Research Database (Denmark)

    Laghaout, Amine; Andersen, Ulrik Lund

    2015-01-01

    von Neumann projections are the main operations by which information can be extracted from the quantum to the classical realm. They are, however, static processes that do not adapt to the states they measure. Advances in the field of adaptive measurement have shown that this limitation can...... be overcome by "wrapping" the von Neumann projectors in a higher-dimensional circuit which exploits the interplay between measurement outcomes and measurement settings. Unfortunately, the design of adaptive measurement has often been ad hoc and setup specific. We shall here develop a unified framework...

  2. Demonstration of two-qubit algorithms with a superconducting quantum processor.

    Science.gov (United States)

    DiCarlo, L; Chow, J M; Gambetta, J M; Bishop, Lev S; Johnson, B R; Schuster, D I; Majer, J; Blais, A; Frunzio, L; Girvin, S M; Schoelkopf, R J

    2009-07-09

    Quantum computers, which harness the superposition and entanglement of physical states, could outperform their classical counterparts in solving problems with technological impact-such as factoring large numbers and searching databases. A quantum processor executes algorithms by applying a programmable sequence of gates to an initialized register of qubits, which coherently evolves into a final state containing the result of the computation. Building a quantum processor is challenging because of the need to meet simultaneously requirements that are in conflict: state preparation, long coherence times, universal gate operations and qubit readout. Processors based on a few qubits have been demonstrated using nuclear magnetic resonance, cold ion trap and optical systems, but a solid-state realization has remained an outstanding challenge. Here we demonstrate a two-qubit superconducting processor and the implementation of the Grover search and Deutsch-Jozsa quantum algorithms. We use a two-qubit interaction, tunable in strength by two orders of magnitude on nanosecond timescales, which is mediated by a cavity bus in a circuit quantum electrodynamics architecture. This interaction allows the generation of highly entangled states with concurrence up to 94 per cent. Although this processor constitutes an important step in quantum computing with integrated circuits, continuing efforts to increase qubit coherence times, gate performance and register size will be required to fulfil the promise of a scalable technology.

  3. Efficiency of free-energy calculations of spin lattices by spectral quantum algorithms

    International Nuclear Information System (INIS)

    Master, Cyrus P.; Yamaguchi, Fumiko; Yamamoto, Yoshihisa

    2003-01-01

    Ensemble quantum algorithms are well suited to calculate estimates of the energy spectra for spin-lattice systems. Based on the phase estimation algorithm, these algorithms efficiently estimate discrete Fourier coefficients of the density of states. Their efficiency in calculating the free energy per spin of general spin lattices to bounded error is examined. We find that the number of Fourier components required to bound the error in the free energy due to the broadening of the density of states scales polynomially with the number of spins in the lattice. However, the precision with which the Fourier components must be calculated is found to be an exponential function of the system size

  4. An Adaptive Cultural Algorithm with Improved Quantum-behaved Particle Swarm Optimization for Sonar Image Detection.

    Science.gov (United States)

    Wang, Xingmei; Hao, Wenqian; Li, Qiming

    2017-12-18

    This paper proposes an adaptive cultural algorithm with improved quantum-behaved particle swarm optimization (ACA-IQPSO) to detect the underwater sonar image. In the population space, to improve searching ability of particles, iterative times and the fitness value of particles are regarded as factors to adaptively adjust the contraction-expansion coefficient of the quantum-behaved particle swarm optimization algorithm (QPSO). The improved quantum-behaved particle swarm optimization algorithm (IQPSO) can make particles adjust their behaviours according to their quality. In the belief space, a new update strategy is adopted to update cultural individuals according to the idea of the update strategy in shuffled frog leaping algorithm (SFLA). Moreover, to enhance the utilization of information in the population space and belief space, accept function and influence function are redesigned in the new communication protocol. The experimental results show that ACA-IQPSO can obtain good clustering centres according to the grey distribution information of underwater sonar images, and accurately complete underwater objects detection. Compared with other algorithms, the proposed ACA-IQPSO has good effectiveness, excellent adaptability, a powerful searching ability and high convergence efficiency. Meanwhile, the experimental results of the benchmark functions can further demonstrate that the proposed ACA-IQPSO has better searching ability, convergence efficiency and stability.

  5. A Mutualism Quantum Genetic Algorithm to Optimize the Flow Shop Scheduling with Pickup and Delivery Considerations

    Directory of Open Access Journals (Sweden)

    Jinwei Gu

    2015-01-01

    Full Text Available A mutualism quantum genetic algorithm (MQGA is proposed for an integrated supply chain scheduling with the materials pickup, flow shop scheduling, and the finished products delivery. The objective is to minimize the makespan, that is, the arrival time of the last finished product to the customer. In MQGA, a new symbiosis strategy named mutualism is proposed to adjust the size of each population dynamically by regarding the mutual influence relation of the two subpopulations. A hybrid Q-bit coding method and a local speeding-up method are designed to increase the diversity of genes, and a checking routine is carried out to ensure the feasibility of each solution; that is, the total physical space of each delivery batch could not exceed the capacity of the vehicle. Compared with the modified genetic algorithm (MGA and the quantum-inspired genetic algorithm (QGA, the effectiveness and efficiency of the MQGA are validated by numerical experiments.

  6. Research on Quantum Algorithms at the Institute for Quantum Information and Matter

    Science.gov (United States)

    2016-05-29

    Spyridon_Michalakis. Quantization of Hall Conductance For Interacting Electrons on a Torus, Commun. Math . Phys., (09 2014): 433. doi: I. H. Kim...Long-range entanglement is necessary for a topological storage of quantum information, Phys. Rev. Lett. (accepted), (08 2013): 80503. doi...John_Preskill, Sumit_Sijher. Protected gates for topological quantum field theories, Journal of Mathematical Physics, (01 2016): 22201. doi

  7. Simulating quantum search algorithm using vibronic states of I2 manipulated by optimally designed gate pulses

    International Nuclear Information System (INIS)

    Ohtsuki, Yukiyoshi

    2010-01-01

    In this paper, molecular quantum computation is numerically studied with the quantum search algorithm (Grover's algorithm) by means of optimal control simulation. Qubits are implemented in the vibronic states of I 2 , while gate operations are realized by optimally designed laser pulses. The methodological aspects of the simulation are discussed in detail. We show that the algorithm for solving a gate pulse-design problem has the same mathematical form as a state-to-state control problem in the density matrix formalism, which provides monotonically convergent algorithms as an alternative to the Krotov method. The sequential irradiation of separately designed gate pulses leads to the population distribution predicted by Grover's algorithm. The computational accuracy is reduced by the imperfect quality of the pulse design and by the electronic decoherence processes that are modeled by the non-Markovian master equation. However, as long as we focus on the population distribution of the vibronic qubits, we can search a target state with high probability without introducing error-correction processes during the computation. A generalized gate pulse-design scheme to explicitly include decoherence effects is outlined, in which we propose a new objective functional together with its solution algorithm that guarantees monotonic convergence.

  8. Comparing, optimizing, and benchmarking quantum-control algorithms in a unifying programming framework

    International Nuclear Information System (INIS)

    Machnes, S.; Sander, U.; Glaser, S. J.; Schulte-Herbrueggen, T.; Fouquieres, P. de; Gruslys, A.; Schirmer, S.

    2011-01-01

    For paving the way to novel applications in quantum simulation, computation, and technology, increasingly large quantum systems have to be steered with high precision. It is a typical task amenable to numerical optimal control to turn the time course of pulses, i.e., piecewise constant control amplitudes, iteratively into an optimized shape. Here, we present a comparative study of optimal-control algorithms for a wide range of finite-dimensional applications. We focus on the most commonly used algorithms: GRAPE methods which update all controls concurrently, and Krotov-type methods which do so sequentially. Guidelines for their use are given and open research questions are pointed out. Moreover, we introduce a unifying algorithmic framework, DYNAMO (dynamic optimization platform), designed to provide the quantum-technology community with a convenient matlab-based tool set for optimal control. In addition, it gives researchers in optimal-control techniques a framework for benchmarking and comparing newly proposed algorithms with the state of the art. It allows a mix-and-match approach with various types of gradients, update and step-size methods as well as subspace choices. Open-source code including examples is made available at http://qlib.info.

  9. GPU-accelerated algorithms for many-particle continuous-time quantum walks

    Science.gov (United States)

    Piccinini, Enrico; Benedetti, Claudia; Siloi, Ilaria; Paris, Matteo G. A.; Bordone, Paolo

    2017-06-01

    Many-particle continuous-time quantum walks (CTQWs) represent a resource for several tasks in quantum technology, including quantum search algorithms and universal quantum computation. In order to design and implement CTQWs in a realistic scenario, one needs effective simulation tools for Hamiltonians that take into account static noise and fluctuations in the lattice, i.e. Hamiltonians containing stochastic terms. To this aim, we suggest a parallel algorithm based on the Taylor series expansion of the evolution operator, and compare its performances with those of algorithms based on the exact diagonalization of the Hamiltonian or a 4th order Runge-Kutta integration. We prove that both Taylor-series expansion and Runge-Kutta algorithms are reliable and have a low computational cost, the Taylor-series expansion showing the additional advantage of a memory allocation not depending on the precision of calculation. Both algorithms are also highly parallelizable within the SIMT paradigm, and are thus suitable for GPGPU computing. In turn, we have benchmarked 4 NVIDIA GPUs and 3 quad-core Intel CPUs for a 2-particle system over lattices of increasing dimension, showing that the speedup provided by GPU computing, with respect to the OPENMP parallelization, lies in the range between 8x and (more than) 20x, depending on the frequency of post-processing. GPU-accelerated codes thus allow one to overcome concerns about the execution time, and make it possible simulations with many interacting particles on large lattices, with the only limit of the memory available on the device.

  10. Adiabatic capture and debunching

    International Nuclear Information System (INIS)

    Ng, K.Y.

    2012-01-01

    In the study of beam preparation for the g-2 experiment, adiabatic debunching and adiabatic capture are revisited. The voltage programs for these adiabbatic processes are derived and their properties discussed. Comparison is made with some other form of adiabatic capture program. The muon g-2 experiment at Fermilab calls for intense proton bunches for the creation of muons. A booster batch of 84 bunches is injected into the Recycler Ring, where it is debunched and captured into 4 intense bunches with the 2.5-MHz rf. The experiment requires short bunches with total width less than 100 ns. The transport line from the Recycler to the muon-production target has a low momentum aperture of ∼ ±22 MeV. Thus each of the 4 intense proton bunches required to have an emittance less than ∼ 3.46 eVs. The incoming booster bunches have total emittance ∼ 8.4 eVs, or each one with an emittance ∼ 0.1 eVs. However, there is always emittance increase when the 84 booster bunches are debunched. There will be even larger emittance increase during adiabatic capture into the buckets of the 2.5-MHz rf. In addition, the incoming booster bunches may have emittances larger than 0.1 eVs. In this article, we will concentrate on the analysis of the adiabatic capture process with the intention of preserving the beam emittance as much as possible. At this moment, beam preparation experiment is being performed at the Main Injector. Since the Main Injector and the Recycler Ring have roughly the same lattice properties, we are referring to adiabatic capture in the Main Injector instead in our discussions.

  11. Spatial non-adiabatic passage using geometric phases

    Energy Technology Data Exchange (ETDEWEB)

    Benseny, Albert; Busch, Thomas [Okinawa Institute of Science and Technology Graduate University, Quantum Systems Unit, Okinawa (Japan); Kiely, Anthony; Ruschhaupt, Andreas [University College Cork, Department of Physics, Cork (Ireland); Zhang, Yongping [Okinawa Institute of Science and Technology Graduate University, Quantum Systems Unit, Okinawa (Japan); Shanghai University, Department of Physics, Shanghai (China)

    2017-12-15

    Quantum technologies based on adiabatic techniques can be highly effective, but often at the cost of being very slow. Here we introduce a set of experimentally realistic, non-adiabatic protocols for spatial state preparation, which yield the same fidelity as their adiabatic counterparts, but on fast timescales. In particular, we consider a charged particle in a system of three tunnel-coupled quantum wells, where the presence of a magnetic field can induce a geometric phase during the tunnelling processes. We show that this leads to the appearance of complex tunnelling amplitudes and allows for the implementation of spatial non-adiabatic passage. We demonstrate the ability of such a system to transport a particle between two different wells and to generate a delocalised superposition between the three traps with high fidelity in short times. (orig.)

  12. A parallel adaptive quantum genetic algorithm for the controllability of arbitrary networks.

    Science.gov (United States)

    Li, Yuhong; Gong, Guanghong; Li, Ni

    2018-01-01

    In this paper, we propose a novel algorithm-parallel adaptive quantum genetic algorithm-which can rapidly determine the minimum control nodes of arbitrary networks with both control nodes and state nodes. The corresponding network can be fully controlled with the obtained control scheme. We transformed the network controllability issue into a combinational optimization problem based on the Popov-Belevitch-Hautus rank condition. A set of canonical networks and a list of real-world networks were experimented. Comparison results demonstrated that the algorithm was more ideal to optimize the controllability of networks, especially those larger-size networks. We demonstrated subsequently that there were links between the optimal control nodes and some network statistical characteristics. The proposed algorithm provides an effective approach to improve the controllability optimization of large networks or even extra-large networks with hundreds of thousands nodes.

  13. Simulating a topological transition in a superconducting phase qubit by fast adiabatic trajectories

    Science.gov (United States)

    Wang, Tenghui; Zhang, Zhenxing; Xiang, Liang; Gong, Zhihao; Wu, Jianlan; Yin, Yi

    2018-04-01

    The significance of topological phases has been widely recognized in the community of condensed matter physics. The well controllable quantum systems provide an artificial platform to probe and engineer various topological phases. The adiabatic trajectory of a quantum state describes the change of the bulk Bloch eigenstates with the momentum, and this adiabatic simulation method is however practically limited due to quantum dissipation. Here we apply the "shortcut to adiabaticity" (STA) protocol to realize fast adiabatic evolutions in the system of a superconducting phase qubit. The resulting fast adiabatic trajectories illustrate the change of the bulk Bloch eigenstates in the Su-Schrieffer-Heeger (SSH) model. A sharp transition is experimentally determined for the topological invariant of a winding number. Our experiment helps identify the topological Chern number of a two-dimensional toy model, suggesting the applicability of the fast adiabatic simulation method for topological systems.

  14. Completing the Physical Representation of Quantum Algorithms Provides a Quantitative Explanation of Their Computational Speedup

    Science.gov (United States)

    Castagnoli, Giuseppe

    2018-03-01

    The usual representation of quantum algorithms, limited to the process of solving the problem, is physically incomplete. We complete it in three steps: (i) extending the representation to the process of setting the problem, (ii) relativizing the extended representation to the problem solver to whom the problem setting must be concealed, and (iii) symmetrizing the relativized representation for time reversal to represent the reversibility of the underlying physical process. The third steps projects the input state of the representation, where the problem solver is completely ignorant of the setting and thus the solution of the problem, on one where she knows half solution (half of the information specifying it when the solution is an unstructured bit string). Completing the physical representation shows that the number of computation steps (oracle queries) required to solve any oracle problem in an optimal quantum way should be that of a classical algorithm endowed with the advanced knowledge of half solution.

  15. An algorithmic approach to solving polynomial equations associated with quantum circuits

    International Nuclear Information System (INIS)

    Gerdt, V.P.; Zinin, M.V.

    2009-01-01

    In this paper we present two algorithms for reducing systems of multivariate polynomial equations over the finite field F 2 to the canonical triangular form called lexicographical Groebner basis. This triangular form is the most appropriate for finding solutions of the system. On the other hand, the system of polynomials over F 2 whose variables also take values in F 2 (Boolean polynomials) completely describes the unitary matrix generated by a quantum circuit. In particular, the matrix itself can be computed by counting the number of solutions (roots) of the associated polynomial system. Thereby, efficient construction of the lexicographical Groebner bases over F 2 associated with quantum circuits gives a method for computing their circuit matrices that is alternative to the direct numerical method based on linear algebra. We compare our implementation of both algorithms with some other software packages available for computing Groebner bases over F 2

  16. A note on the geometric phase in adiabatic approximation

    International Nuclear Information System (INIS)

    Tong, D.M.; Singh, K.; Kwek, L.C.; Fan, X.J.; Oh, C.H.

    2005-01-01

    The adiabatic theorem shows that the instantaneous eigenstate is a good approximation of the exact solution for a quantum system in adiabatic evolution. One may therefore expect that the geometric phase calculated by using the eigenstate should be also a good approximation of exact geometric phase. However, we find that the former phase may differ appreciably from the latter if the evolution time is large enough

  17. Modeling non-adiabatic photoexcited reaction dynamics in condensed phases

    International Nuclear Information System (INIS)

    Coker, D.F.

    2003-01-01

    Reactions of photoexcited molecules, ions, and radicals in condensed phase environments involve non-adiabatic dynamics over coupled electronic surfaces. We focus on how local environmental symmetries can effect non-adiabatic coupling between excited electronic states and thus influence, in a possibly controllable way, the outcome of photo-excited reactions. Semi-classical and mixed quantum-classical non-adiabatic molecular dynamics methods, together with semi-empirical excited state potentials are used to probe the dynamical mixing of electronic states in different environments from molecular clusters, to simple liquids and solids, and photo-excited reactions in complex reaction environments such as zeolites

  18. Quantum mean-field decoding algorithm for error-correcting codes

    International Nuclear Information System (INIS)

    Inoue, Jun-ichi; Saika, Yohei; Okada, Masato

    2009-01-01

    We numerically examine a quantum version of TAP (Thouless-Anderson-Palmer)-like mean-field algorithm for the problem of error-correcting codes. For a class of the so-called Sourlas error-correcting codes, we check the usefulness to retrieve the original bit-sequence (message) with a finite length. The decoding dynamics is derived explicitly and we evaluate the average-case performance through the bit-error rate (BER).

  19. Quantum Algorithms for Computational Physics: Volume 3 of Lattice Gas Dynamics

    Science.gov (United States)

    2007-01-03

    by the “divine” Greek mathematician Pythagoras . Today, most people normally think of the square root operation as it applies to a positive number...attempted to prove the age old isoperimetric theorem of geometry. It may be loosely stated as, a circle is the optimal closed curve, because of the...Ĥn, Ĥm] 6= 0), as shown by the Campbell-Baker-Hausdorff theorem . Nevertheless, in certain special cases (type-I quantum algorithms) we are able

  20. A New Improved Quantum Evolution Algorithm with Local Search Procedure for Capacitated Vehicle Routing Problem

    Directory of Open Access Journals (Sweden)

    Ligang Cui

    2013-01-01

    Full Text Available The capacitated vehicle routing problem (CVRP is the most classical vehicle routing problem (VRP; many solution techniques are proposed to find its better answer. In this paper, a new improved quantum evolution algorithm (IQEA with a mixed local search procedure is proposed for solving CVRPs. First, an IQEA with a double chain quantum chromosome, new quantum rotation schemes, and self-adaptive quantum Not gate is constructed to initialize and generate feasible solutions. Then, to further strengthen IQEA's searching ability, three local search procedures 1-1 exchange, 1-0 exchange, and 2-OPT, are adopted. Experiments on a small case have been conducted to analyze the sensitivity of main parameters and compare the performances of the IQEA with different local search strategies. Together with results from the testing of CVRP benchmarks, the superiorities of the proposed algorithm over the PSO, SR-1, and SR-2 have been demonstrated. At last, a profound analysis of the experimental results is presented and some suggestions on future researches are given.

  1. Nonadiabatic geometrical quantum gates in semiconductor quantum dots

    International Nuclear Information System (INIS)

    Solinas, Paolo; Zanghi, Nino; Zanardi, Paolo; Rossi, Fausto

    2003-01-01

    In this paper, we study the implementation of nonadiabatic geometrical quantum gates with in semiconductor quantum dots. Different quantum information enconding (manipulation) schemes exploiting excitonic degrees of freedom are discussed. By means of the Aharanov-Anandan geometrical phase, one can avoid the limitations of adiabatic schemes relying on adiabatic Berry phase; fast geometrical quantum gates can be, in principle, implemented

  2. Sum-of-squares-based fuzzy controller design using quantum-inspired evolutionary algorithm

    Science.gov (United States)

    Yu, Gwo-Ruey; Huang, Yu-Chia; Cheng, Chih-Yung

    2016-07-01

    In the field of fuzzy control, control gains are obtained by solving stabilisation conditions in linear-matrix-inequality-based Takagi-Sugeno fuzzy control method and sum-of-squares-based polynomial fuzzy control method. However, the optimal performance requirements are not considered under those stabilisation conditions. In order to handle specific performance problems, this paper proposes a novel design procedure with regard to polynomial fuzzy controllers using quantum-inspired evolutionary algorithms. The first contribution of this paper is a combination of polynomial fuzzy control and quantum-inspired evolutionary algorithms to undertake an optimal performance controller design. The second contribution is the proposed stability condition derived from the polynomial Lyapunov function. The proposed design approach is dissimilar to the traditional approach, in which control gains are obtained by solving the stabilisation conditions. The first step of the controller design uses the quantum-inspired evolutionary algorithms to determine the control gains with the best performance. Then, the stability of the closed-loop system is analysed under the proposed stability conditions. To illustrate effectiveness and validity, the problem of balancing and the up-swing of an inverted pendulum on a cart is used.

  3. Implementation schemes in NMR of quantum processors and the Deutsch-Jozsa algorithm by using virtual spin representation

    International Nuclear Information System (INIS)

    Kessel, Alexander R.; Yakovleva, Natalia M.

    2002-01-01

    Schemes of experimental realization of the main two-qubit processors for quantum computers and the Deutsch-Jozsa algorithm are derived in virtual spin representation. The results are applicable for every four quantum states allowing the required properties for quantum processor implementation if for qubit encoding, virtual spin representation is used. A four-dimensional Hilbert space of nuclear spin 3/2 is considered in detail for this aim

  4. A Hybrid Quantum Evolutionary Algorithm with Improved Decoding Scheme for a Robotic Flow Shop Scheduling Problem

    Directory of Open Access Journals (Sweden)

    Weidong Lei

    2017-01-01

    Full Text Available We aim at solving the cyclic scheduling problem with a single robot and flexible processing times in a robotic flow shop, which is a well-known optimization problem in advanced manufacturing systems. The objective of the problem is to find an optimal robot move sequence such that the throughput rate is maximized. We propose a hybrid algorithm based on the Quantum-Inspired Evolutionary Algorithm (QEA and genetic operators for solving the problem. The algorithm integrates three different decoding strategies to convert quantum individuals into robot move sequences. The Q-gate is applied to update the states of Q-bits in each individual. Besides, crossover and mutation operators with adaptive probabilities are used to increase the population diversity. A repairing procedure is proposed to deal with infeasible individuals. Comparison results on both benchmark and randomly generated instances demonstrate that the proposed algorithm is more effective in solving the studied problem in terms of solution quality and computational time.

  5. Simulation of quantum systems with random walks: A new algorithm for charged systems

    International Nuclear Information System (INIS)

    Ceperley, D.

    1983-01-01

    Random walks with branching have been used to calculate exact properties of the ground state of quantum many-body systems. In this paper, a more general Green's function identity is derived which relates the potential energy, a trial wavefunction, and a trial density matrix to the rules of a branched random walk. It is shown that an efficient algorithm requires a good trial wavefunction, a good trial density matrix, and a good sampling of this density matrix. An accurate density matrix is constructed for Coulomb systems using the path integral formula. The random walks from this new algorithm diffuse through phase space an order of magnitude faster than the previous Green's Function Monte Carlo method. In contrast to the simple diffusion Monte Carlo algorithm, it is exact method. Representative results are presented for several molecules

  6. Human body motion tracking based on quantum-inspired immune cloning algorithm

    Science.gov (United States)

    Han, Hong; Yue, Lichuan; Jiao, Licheng; Wu, Xing

    2009-10-01

    In a static monocular camera system, to gain a perfect 3D human body posture is a great challenge for Computer Vision technology now. This paper presented human postures recognition from video sequences using the Quantum-Inspired Immune Cloning Algorithm (QICA). The algorithm included three parts. Firstly, prior knowledge of human beings was used, the key joint points of human could be detected automatically from the human contours and skeletons which could be thinning from the contours; And due to the complexity of human movement, a forecasting mechanism of occlusion joint points was addressed to get optimum 2D key joint points of human body; And then pose estimation recovered by optimizing between the 2D projection of 3D human key joint points and 2D detection key joint points using QICA, which recovered the movement of human body perfectly, because this algorithm could acquire not only the global optimal solution, but the local optimal solution.

  7. Multiscale Monte Carlo algorithms in statistical mechanics and quantum field theory

    Energy Technology Data Exchange (ETDEWEB)

    Lauwers, P G

    1990-12-01

    Conventional Monte Carlo simulation algorithms for models in statistical mechanics and quantum field theory are afflicted by problems caused by their locality. They become highly inefficient if investigations of critical or nearly-critical systems, i.e., systems with important large scale phenomena, are undertaken. We present two types of multiscale approaches that alleveate problems of this kind: Stochastic cluster algorithms and multigrid Monte Carlo simulation algorithms. Another formidable computational problem in simulations of phenomenologically relevant field theories with fermions is the need for frequently inverting the Dirac operator. This inversion can be accelerated considerably by means of deterministic multigrid methods, very similar to the ones used for the numerical solution of differential equations. (orig.).

  8. Development of Quantum Devices and Algorithms for Radiation Detection and Radiation Signal Processing

    International Nuclear Information System (INIS)

    El Tokhy, M.E.S.M.E.S.

    2012-01-01

    The main functions of spectroscopy system are signal detection, filtering and amplification, pileup detection and recovery, dead time correction, amplitude analysis and energy spectrum analysis. Safeguards isotopic measurements require the best spectrometer systems with excellent resolution, stability, efficiency and throughput. However, the resolution and throughput, which depend mainly on the detector, amplifier and the analog-to-digital converter (ADC), can still be improved. These modules have been in continuous development and improvement. For this reason we are interested with both the development of quantum detectors and efficient algorithms of the digital processing measurement. Therefore, the main objective of this thesis is concentrated on both 1. Study quantum dot (QD) devices behaviors under gamma radiation 2. Development of efficient algorithms for handling problems of gamma-ray spectroscopy For gamma radiation detection, a detailed study of nanotechnology QD sources and infrared photodetectors (QDIP) for gamma radiation detection is introduced. There are two different types of quantum scintillator detectors, which dominate the area of ionizing radiation measurements. These detectors are QD scintillator detectors and QDIP scintillator detectors. By comparison with traditional systems, quantum systems have less mass, require less volume, and consume less power. These factors are increasing the need for efficient detector for gamma-ray applications such as gamma-ray spectroscopy. Consequently, the nanocomposite materials based on semiconductor quantum dots has potential for radiation detection via scintillation was demonstrated in the literature. Therefore, this thesis presents a theoretical analysis for the characteristics of QD sources and infrared photodetectors (QDIPs). A model of QD sources under incident gamma radiation detection is developed. A novel methodology is introduced to characterize the effect of gamma radiation on QD devices. The rate

  9. The continuous-variable Deutsch–Jozsa algorithm using realistic quantum systems

    International Nuclear Information System (INIS)

    Wagner, Rob C; Kendon, Viv M

    2012-01-01

    This paper is a study of the continuous-variable Deutsch–Jozsa algorithm. First, we review an existing version of the algorithm for qunat states (Pati and Braunstein 2002 arXiv:0207108v1), and then, we present a realistic version of the Deutsch–Jozsa algorithm for continuous variables, which can be implemented in a physical quantum system given the appropriate oracle. Under these conditions, we have a probabilistic algorithm for deciding the function with a very high success rate with a single call to the oracle. Finally, we look at the effects of errors in both of these continuous-variable algorithms and how they affect the chances of success. We find that the algorithm is generally robust for errors in initialization and the oracle, but less so for errors in the measurement apparatus and the Fourier transform. This article is part of a special issue of Journal of Physics A: Mathematical and Theoretical devoted to ‘Coherent states: mathematical and physical aspects’. (paper)

  10. Adiabatic and isothermal resistivities

    International Nuclear Information System (INIS)

    Fishman, R.S.

    1989-01-01

    The force-balance method is used to calculate the isothermal resistivity to first order in the electric field. To lowest order in the impurity potential, the isothermal resistivity disagrees with the adiabatic results of the Kubo formula and the Boltzmann equation. However, an expansion of the isothermal resistivity in powers of the impurity potential is divergent, with two sets of divergent terms. The first set arises from the density matrix of the relative electron-phonon system. The second set arises from the explicit dependence of the density matrix on the electric field, which was ignored by force-balance calculations. These divergent contributions are calculated inductively, by applying a recursion relation for the Green's functions. Using the λ 2 t→∞ limit of van Hove, I show that the resummation of these divergent terms yields the same result for the resistivity as the adiabatic calculations, in direct analogy with the work of Argyres and Sigel, and Huberman and Chester

  11. Parallel algorithms for quantum chemistry. I. Integral transformations on a hypercube multiprocessor

    International Nuclear Information System (INIS)

    Whiteside, R.A.; Binkley, J.S.; Colvin, M.E.; Schaefer, H.F. III

    1987-01-01

    For many years it has been recognized that fundamental physical constraints such as the speed of light will limit the ultimate speed of single processor computers to less than about three billion floating point operations per second (3 GFLOPS). This limitation is becoming increasingly restrictive as commercially available machines are now within an order of magnitude of this asymptotic limit. A natural way to avoid this limit is to harness together many processors to work on a single computational problem. In principle, these parallel processing computers have speeds limited only by the number of processors one chooses to acquire. The usefulness of potentially unlimited processing speed to a computationally intensive field such as quantum chemistry is obvious. If these methods are to be applied to significantly larger chemical systems, parallel schemes will have to be employed. For this reason we have developed distributed-memory algorithms for a number of standard quantum chemical methods. We are currently implementing these on a 32 processor Intel hypercube. In this paper we present our algorithm and benchmark results for one of the bottleneck steps in quantum chemical calculations: the four index integral transformation

  12. A Shearlet-based algorithm for quantum noise removal in low-dose CT images

    Science.gov (United States)

    Zhang, Aguan; Jiang, Huiqin; Ma, Ling; Liu, Yumin; Yang, Xiaopeng

    2016-03-01

    Low-dose CT (LDCT) scanning is a potential way to reduce the radiation exposure of X-ray in the population. It is necessary to improve the quality of low-dose CT images. In this paper, we propose an effective algorithm for quantum noise removal in LDCT images using shearlet transform. Because the quantum noise can be simulated by Poisson process, we first transform the quantum noise by using anscombe variance stabilizing transform (VST), producing an approximately Gaussian noise with unitary variance. Second, the non-noise shearlet coefficients are obtained by adaptive hard-threshold processing in shearlet domain. Third, we reconstruct the de-noised image using the inverse shearlet transform. Finally, an anscombe inverse transform is applied to the de-noised image, which can produce the improved image. The main contribution is to combine the anscombe VST with the shearlet transform. By this way, edge coefficients and noise coefficients can be separated from high frequency sub-bands effectively. A number of experiments are performed over some LDCT images by using the proposed method. Both quantitative and visual results show that the proposed method can effectively reduce the quantum noise while enhancing the subtle details. It has certain value in clinical application.

  13. Quantum Monte Carlo algorithms for electronic structure at the petascale; the endstation project.

    Energy Technology Data Exchange (ETDEWEB)

    Kim, J; Ceperley, D M; Purwanto, W; Walter, E J; Krakauer, H; Zhang, S W; Kent, P.R. C; Hennig, R G; Umrigar, C; Bajdich, M; Kolorenc, J; Mitas, L

    2008-10-01

    Over the past two decades, continuum quantum Monte Carlo (QMC) has proved to be an invaluable tool for predicting of the properties of matter from fundamental principles. By solving the Schrodinger equation through a stochastic projection, it achieves the greatest accuracy and reliability of methods available for physical systems containing more than a few quantum particles. QMC enjoys scaling favorable to quantum chemical methods, with a computational effort which grows with the second or third power of system size. This accuracy and scalability has enabled scientific discovery across a broad spectrum of disciplines. The current methods perform very efficiently at the terascale. The quantum Monte Carlo Endstation project is a collaborative effort among researchers in the field to develop a new generation of algorithms, and their efficient implementations, which will take advantage of the upcoming petaflop architectures. Some aspects of these developments are discussed here. These tools will expand the accuracy, efficiency and range of QMC applicability and enable us to tackle challenges which are currently out of reach. The methods will be applied to several important problems including electronic and structural properties of water, transition metal oxides, nanosystems and ultracold atoms.

  14. Fermi-Dirac gas of atoms in a box with low adiabatic invariant

    International Nuclear Information System (INIS)

    Vlad, V.I.; Inonescu-Pallas, N.

    2004-06-01

    Quantum degenerate Fermi-Dirac gas of atoms, confined in a cubic box, shows an energy spectrum, which is discrete and strongly dependent on the atomic mass number, A at , box geometry and temperature, for low product of A at and the adiabatic invariant, TV 1/3 , i.e. on γ = A at TV 1/3 . The present study compares the total number of particles and the total energy obtained by summing up the contributions of a finite number of states, defined by the values of γ, to the widespread approximations of the corresponding integrals. The sums show simple calculation algorithms and more precise results for a large interval of values of γ. A new accurate analytic formula for the chemical potential of the Fermi-Dirac quantum gas is also given. (author)

  15. How to implement a quantum algorithm on a large number of qubits by controlling one central qubit

    Science.gov (United States)

    Zagoskin, Alexander; Ashhab, Sahel; Johansson, J. R.; Nori, Franco

    2010-03-01

    It is desirable to minimize the number of control parameters needed to perform a quantum algorithm. We show that, under certain conditions, an entire quantum algorithm can be efficiently implemented by controlling a single central qubit in a quantum computer. We also show that the different system parameters do not need to be designed accurately during fabrication. They can be determined through the response of the central qubit to external driving. Our proposal is well suited for hybrid architectures that combine microscopic and macroscopic qubits. More details can be found in: A.M. Zagoskin, S. Ashhab, J.R. Johansson, F. Nori, Quantum two-level systems in Josephson junctions as naturally formed qubits, Phys. Rev. Lett. 97, 077001 (2006); and S. Ashhab, J.R. Johansson, F. Nori, Rabi oscillations in a qubit coupled to a quantum two-level system, New J. Phys. 8, 103 (2006).

  16. Quantum approximate optimization algorithm for MaxCut: A fermionic view

    Science.gov (United States)

    Wang, Zhihui; Hadfield, Stuart; Jiang, Zhang; Rieffel, Eleanor G.

    2018-02-01

    Farhi et al. recently proposed a class of quantum algorithms, the quantum approximate optimization algorithm (QAOA), for approximately solving combinatorial optimization problems (E. Farhi et al., arXiv:1411.4028; arXiv:1412.6062; arXiv:1602.07674). A level-p QAOA circuit consists of p steps; in each step a classical Hamiltonian, derived from the cost function, is applied followed by a mixing Hamiltonian. The 2 p times for which these two Hamiltonians are applied are the parameters of the algorithm, which are to be optimized classically for the best performance. As p increases, parameter optimization becomes inefficient due to the curse of dimensionality. The success of the QAOA approach will depend, in part, on finding effective parameter-setting strategies. Here we analytically and numerically study parameter setting for the QAOA applied to MaxCut. For the level-1 QAOA, we derive an analytical expression for a general graph. In principle, expressions for higher p could be derived, but the number of terms quickly becomes prohibitive. For a special case of MaxCut, the "ring of disagrees," or the one-dimensional antiferromagnetic ring, we provide an analysis for an arbitrarily high level. Using a fermionic representation, the evolution of the system under the QAOA translates into quantum control of an ensemble of independent spins. This treatment enables us to obtain analytical expressions for the performance of the QAOA for any p . It also greatly simplifies the numerical search for the optimal values of the parameters. By exploring symmetries, we identify a lower-dimensional submanifold of interest; the search effort can be accordingly reduced. This analysis also explains an observed symmetry in the optimal parameter values. Further, we numerically investigate the parameter landscape and show that it is a simple one in the sense of having no local optima.

  17. Note: A pure-sampling quantum Monte Carlo algorithm with independent Metropolis

    Energy Technology Data Exchange (ETDEWEB)

    Vrbik, Jan [Department of Mathematics, Brock University, St. Catharines, Ontario L2S 3A1 (Canada); Ospadov, Egor; Rothstein, Stuart M., E-mail: srothstein@brocku.ca [Department of Physics, Brock University, St. Catharines, Ontario L2S 3A1 (Canada)

    2016-07-14

    Recently, Ospadov and Rothstein published a pure-sampling quantum Monte Carlo algorithm (PSQMC) that features an auxiliary Path Z that connects the midpoints of the current and proposed Paths X and Y, respectively. When sufficiently long, Path Z provides statistical independence of Paths X and Y. Under those conditions, the Metropolis decision used in PSQMC is done without any approximation, i.e., not requiring microscopic reversibility and without having to introduce any G(x → x′; τ) factors into its decision function. This is a unique feature that contrasts with all competing reptation algorithms in the literature. An example illustrates that dependence of Paths X and Y has adverse consequences for pure sampling.

  18. Note: A pure-sampling quantum Monte Carlo algorithm with independent Metropolis

    International Nuclear Information System (INIS)

    Vrbik, Jan; Ospadov, Egor; Rothstein, Stuart M.

    2016-01-01

    Recently, Ospadov and Rothstein published a pure-sampling quantum Monte Carlo algorithm (PSQMC) that features an auxiliary Path Z that connects the midpoints of the current and proposed Paths X and Y, respectively. When sufficiently long, Path Z provides statistical independence of Paths X and Y. Under those conditions, the Metropolis decision used in PSQMC is done without any approximation, i.e., not requiring microscopic reversibility and without having to introduce any G(x → x′; τ) factors into its decision function. This is a unique feature that contrasts with all competing reptation algorithms in the literature. An example illustrates that dependence of Paths X and Y has adverse consequences for pure sampling.

  19. A parallel adaptive quantum genetic algorithm for the controllability of arbitrary networks

    Science.gov (United States)

    Li, Yuhong

    2018-01-01

    In this paper, we propose a novel algorithm—parallel adaptive quantum genetic algorithm—which can rapidly determine the minimum control nodes of arbitrary networks with both control nodes and state nodes. The corresponding network can be fully controlled with the obtained control scheme. We transformed the network controllability issue into a combinational optimization problem based on the Popov-Belevitch-Hautus rank condition. A set of canonical networks and a list of real-world networks were experimented. Comparison results demonstrated that the algorithm was more ideal to optimize the controllability of networks, especially those larger-size networks. We demonstrated subsequently that there were links between the optimal control nodes and some network statistical characteristics. The proposed algorithm provides an effective approach to improve the controllability optimization of large networks or even extra-large networks with hundreds of thousands nodes. PMID:29554140

  20. Quantum noise properties of CT images with anatomical textured backgrounds across reconstruction algorithms: FBP and SAFIRE

    Energy Technology Data Exchange (ETDEWEB)

    Solomon, Justin, E-mail: justin.solomon@duke.edu [Carl E. Ravin Advanced Imaging Laboratories, Department of Radiology, Duke University Medical Center, Durham, North Carolina 27705 (United States); Samei, Ehsan [Carl E. Ravin Advanced Imaging Laboratories, Department of Radiology, Duke University Medical Center, Durham, North Carolina 27705 and Departments of Biomedical Engineering and Electrical and Computer Engineering, Pratt School of Engineering, Duke University, Durham, North Carolina 27705 (United States)

    2014-09-15

    Purpose: Quantum noise properties of CT images are generally assessed using simple geometric phantoms with uniform backgrounds. Such phantoms may be inadequate when assessing nonlinear reconstruction or postprocessing algorithms. The purpose of this study was to design anatomically informed textured phantoms and use the phantoms to assess quantum noise properties across two clinically available reconstruction algorithms, filtered back projection (FBP) and sinogram affirmed iterative reconstruction (SAFIRE). Methods: Two phantoms were designed to represent lung and soft-tissue textures. The lung phantom included intricate vessel-like structures along with embedded nodules (spherical, lobulated, and spiculated). The soft tissue phantom was designed based on a three-dimensional clustered lumpy background with included low-contrast lesions (spherical and anthropomorphic). The phantoms were built using rapid prototyping (3D printing) technology and, along with a uniform phantom of similar size, were imaged on a Siemens SOMATOM Definition Flash CT scanner and reconstructed with FBP and SAFIRE. Fifty repeated acquisitions were acquired for each background type and noise was assessed by estimating pixel-value statistics, such as standard deviation (i.e., noise magnitude), autocorrelation, and noise power spectrum. Noise stationarity was also assessed by examining the spatial distribution of noise magnitude. The noise properties were compared across background types and between the two reconstruction algorithms. Results: In FBP and SAFIRE images, noise was globally nonstationary for all phantoms. In FBP images of all phantoms, and in SAFIRE images of the uniform phantom, noise appeared to be locally stationary (within a reasonably small region of interest). Noise was locally nonstationary in SAFIRE images of the textured phantoms with edge pixels showing higher noise magnitude compared to pixels in more homogenous regions. For pixels in uniform regions, noise magnitude was

  1. Quantum noise properties of CT images with anatomical textured backgrounds across reconstruction algorithms: FBP and SAFIRE

    International Nuclear Information System (INIS)

    Solomon, Justin; Samei, Ehsan

    2014-01-01

    Purpose: Quantum noise properties of CT images are generally assessed using simple geometric phantoms with uniform backgrounds. Such phantoms may be inadequate when assessing nonlinear reconstruction or postprocessing algorithms. The purpose of this study was to design anatomically informed textured phantoms and use the phantoms to assess quantum noise properties across two clinically available reconstruction algorithms, filtered back projection (FBP) and sinogram affirmed iterative reconstruction (SAFIRE). Methods: Two phantoms were designed to represent lung and soft-tissue textures. The lung phantom included intricate vessel-like structures along with embedded nodules (spherical, lobulated, and spiculated). The soft tissue phantom was designed based on a three-dimensional clustered lumpy background with included low-contrast lesions (spherical and anthropomorphic). The phantoms were built using rapid prototyping (3D printing) technology and, along with a uniform phantom of similar size, were imaged on a Siemens SOMATOM Definition Flash CT scanner and reconstructed with FBP and SAFIRE. Fifty repeated acquisitions were acquired for each background type and noise was assessed by estimating pixel-value statistics, such as standard deviation (i.e., noise magnitude), autocorrelation, and noise power spectrum. Noise stationarity was also assessed by examining the spatial distribution of noise magnitude. The noise properties were compared across background types and between the two reconstruction algorithms. Results: In FBP and SAFIRE images, noise was globally nonstationary for all phantoms. In FBP images of all phantoms, and in SAFIRE images of the uniform phantom, noise appeared to be locally stationary (within a reasonably small region of interest). Noise was locally nonstationary in SAFIRE images of the textured phantoms with edge pixels showing higher noise magnitude compared to pixels in more homogenous regions. For pixels in uniform regions, noise magnitude was

  2. Nonadiabatic corrections to a quantum dot quantum computer

    Indian Academy of Sciences (India)

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

  3. Properties of the numerical algorithms for problems of quantum information technologies: Benefits of deep analysis

    Science.gov (United States)

    Chernyavskiy, Andrey; Khamitov, Kamil; Teplov, Alexey; Voevodin, Vadim; Voevodin, Vladimir

    2016-10-01

    In recent years, quantum information technologies (QIT) showed great development, although, the way of the implementation of QIT faces the serious difficulties, some of which are challenging computational tasks. This work is devoted to the deep and broad analysis of the parallel algorithmic properties of such tasks. As an example we take one- and two-qubit transformations of a many-qubit quantum state, which are the most critical kernels of many important QIT applications. The analysis of the algorithms uses the methodology of the AlgoWiki project (algowiki-project.org) and consists of two parts: theoretical and experimental. Theoretical part includes features like sequential and parallel complexity, macro structure, and visual information graph. Experimental part was made by using the petascale Lomonosov supercomputer (Moscow State University, Russia) and includes the analysis of locality and memory access, scalability and the set of more specific dynamic characteristics of realization. This approach allowed us to obtain bottlenecks and generate ideas of efficiency improvement.

  4. A hybrid quantum-inspired genetic algorithm for multiobjective flow shop scheduling.

    Science.gov (United States)

    Li, Bin-Bin; Wang, Ling

    2007-06-01

    This paper proposes a hybrid quantum-inspired genetic algorithm (HQGA) for the multiobjective flow shop scheduling problem (FSSP), which is a typical NP-hard combinatorial optimization problem with strong engineering backgrounds. On the one hand, a quantum-inspired GA (QGA) based on Q-bit representation is applied for exploration in the discrete 0-1 hyperspace by using the updating operator of quantum gate and genetic operators of Q-bit. Moreover, random-key representation is used to convert the Q-bit representation to job permutation for evaluating the objective values of the schedule solution. On the other hand, permutation-based GA (PGA) is applied for both performing exploration in permutation-based scheduling space and stressing exploitation for good schedule solutions. To evaluate solutions in multiobjective sense, a randomly weighted linear-sum function is used in QGA, and a nondominated sorting technique including classification of Pareto fronts and fitness assignment is applied in PGA with regard to both proximity and diversity of solutions. To maintain the diversity of the population, two trimming techniques for population are proposed. The proposed HQGA is tested based on some multiobjective FSSPs. Simulation results and comparisons based on several performance metrics demonstrate the effectiveness of the proposed HQGA.

  5. Tunneling and Speedup in Quantum Optimization for Permutation-Symmetric Problems

    Directory of Open Access Journals (Sweden)

    Siddharth Muthukrishnan

    2016-07-01

    Full Text Available Tunneling is often claimed to be the key mechanism underlying possible speedups in quantum optimization via quantum annealing (QA, especially for problems featuring a cost function with tall and thin barriers. We present and analyze several counterexamples from the class of perturbed Hamming weight optimization problems with qubit permutation symmetry. We first show that, for these problems, the adiabatic dynamics that make tunneling possible should be understood not in terms of the cost function but rather the semiclassical potential arising from the spin-coherent path-integral formalism. We then provide an example where the shape of the barrier in the final cost function is short and wide, which might suggest no quantum advantage for QA, yet where tunneling renders QA superior to simulated annealing in the adiabatic regime. However, the adiabatic dynamics turn out not be optimal. Instead, an evolution involving a sequence of diabatic transitions through many avoided-level crossings, involving no tunneling, is optimal and outperforms adiabatic QA. We show that this phenomenon of speedup by diabatic transitions is not unique to this example, and we provide an example where it provides an exponential speedup over adiabatic QA. In yet another twist, we show that a classical algorithm, spin-vector dynamics, is at least as efficient as diabatic QA. Finally, in a different example with a convex cost function, the diabatic transitions result in a speedup relative to both adiabatic QA with tunneling and classical spin-vector dynamics.

  6. Algorithm for simulation of quantum many-body dynamics using dynamical coarse-graining

    International Nuclear Information System (INIS)

    Khasin, M.; Kosloff, R.

    2010-01-01

    An algorithm for simulation of quantum many-body dynamics having su(2) spectrum-generating algebra is developed. The algorithm is based on the idea of dynamical coarse-graining. The original unitary dynamics of the target observables--the elements of the spectrum-generating algebra--is simulated by a surrogate open-system dynamics, which can be interpreted as weak measurement of the target observables, performed on the evolving system. The open-system state can be represented by a mixture of pure states, localized in the phase space. The localization reduces the scaling of the computational resources with the Hilbert-space dimension n by factor n 3/2 (ln n) -1 compared to conventional sparse-matrix methods. The guidelines for the choice of parameters for the simulation are presented and the scaling of the computational resources with the Hilbert-space dimension of the system is estimated. The algorithm is applied to the simulation of the dynamics of systems of 2x10 4 and 2x10 6 cold atoms in a double-well trap, described by the two-site Bose-Hubbard model.

  7. Forecasting Energy CO2 Emissions Using a Quantum Harmony Search Algorithm-Based DMSFE Combination Model

    Directory of Open Access Journals (Sweden)

    Xingsheng Gu

    2013-03-01

    Full Text Available he accurate forecasting of carbon dioxide (CO2 emissions from fossil fuel energy consumption is a key requirement for making energy policy and environmental strategy. In this paper, a novel quantum harmony search (QHS algorithm-based discounted mean square forecast error (DMSFE combination model is proposed. In the DMSFE combination forecasting model, almost all investigations assign the discounting factor (β arbitrarily since β varies between 0 and 1 and adopt one value for all individual models and forecasting periods. The original method doesn’t consider the influences of the individual model and the forecasting period. This work contributes by changing β from one value to a matrix taking the different model and the forecasting period into consideration and presenting a way of searching for the optimal β values by using the QHS algorithm through optimizing the mean absolute percent error (MAPE objective function. The QHS algorithm-based optimization DMSFE combination forecasting model is established and tested by forecasting CO2 emission of the World top‒5 CO2 emitters. The evaluation indexes such as MAPE, root mean squared error (RMSE and mean absolute error (MAE are employed to test the performance of the presented approach. The empirical analyses confirm the validity of the presented method and the forecasting accuracy can be increased in a certain degree.

  8. Shortcuts to adiabaticity in cutting a spin chain

    Energy Technology Data Exchange (ETDEWEB)

    Ren, Feng-Hua [Department of Physics, Ocean University of China, Qingdao 266100 (China); School of Computer Engineering, Qingdao Technological University, Qingdao 266033 (China); Wang, Zhao-Ming, E-mail: mingmoon78@126.com [Department of Physics, Ocean University of China, Qingdao 266100 (China); Gu, Yong-Jian, E-mail: yjgu@ouc.edu.cn [Department of Physics, Ocean University of China, Qingdao 266100 (China)

    2017-01-15

    “Shortcuts to adiabaticity” represents a strategy for accelerating a quantum adiabatic process, is useful for preparing or manipulating a quantum state. In this paper, we investigate the adiabaticity in the dynamics of an XY spin chain. During the process of cutting one long chain into two short chains, a “shortcut” can be obtained by applying a sequence of external pulses. The fidelity which measures the adiabaticity can be dramatically enhanced by increasing the pulse strength or pulse duration time. This reliability can be kept for different types of pulses, such as random pulse time interval or random strength. The free choice of the pulse can be explained by the adiabatic representation of the Hamiltonian, and it shows that the control effects are determined by the integral of the control function in the time domain. - Highlights: • “Shortcuts to adiabaticity” is proposed by applying external pulses. • The adiabaticity can be accelerated by increasing pulse strength or duration time. • Control effects are determined by the integral of the control function with respect to time.

  9. Topology hidden behind the breakdown of adiabaticity

    International Nuclear Information System (INIS)

    Fu, L.-B.; Chen, S.-G.

    2005-01-01

    For classical Hamiltonian systems, the adiabatic condition may fail at some critical points. However, the breakdown of the adiabatic condition does not always cause the adiabatic evolution to be destroyed. In this paper, we suggest a supplemental condition of the adiabatic evolution for the fixed points of classical Hamiltonian systems when the adiabatic condition breaks down at the critical points. As an example, we investigate the adiabatic evolution of the fixed points of a classical Hamiltonian system which has a number of applications

  10. Algorithms

    Indian Academy of Sciences (India)

    polynomial) division have been found in Vedic Mathematics which are dated much before Euclid's algorithm. A programming language Is used to describe an algorithm for execution on a computer. An algorithm expressed using a programming.

  11. Screw Remaining Life Prediction Based on Quantum Genetic Algorithm and Support Vector Machine

    Directory of Open Access Journals (Sweden)

    Xiaochen Zhang

    2017-01-01

    Full Text Available To predict the remaining life of ball screw, a screw remaining life prediction method based on quantum genetic algorithm (QGA and support vector machine (SVM is proposed. A screw accelerated test bench is introduced. Accelerometers are installed to monitor the performance degradation of ball screw. Combined with wavelet packet decomposition and isometric mapping (Isomap, the sensitive feature vectors are obtained and stored in database. Meanwhile, the sensitive feature vectors are randomly chosen from the database and constitute training samples and testing samples. Then the optimal kernel function parameter and penalty factor of SVM are searched with the method of QGA. Finally, the training samples are used to train optimized SVM while testing samples are adopted to test the prediction accuracy of the trained SVM so the screw remaining life prediction model can be got. The experiment results show that the screw remaining life prediction model could effectively predict screw remaining life.

  12. An Improved Quantum-Behaved Particle Swarm Optimization Algorithm with Elitist Breeding for Unconstrained Optimization.

    Science.gov (United States)

    Yang, Zhen-Lun; Wu, Angus; Min, Hua-Qing

    2015-01-01

    An improved quantum-behaved particle swarm optimization with elitist breeding (EB-QPSO) for unconstrained optimization is presented and empirically studied in this paper. In EB-QPSO, the novel elitist breeding strategy acts on the elitists of the swarm to escape from the likely local optima and guide the swarm to perform more efficient search. During the iterative optimization process of EB-QPSO, when criteria met, the personal best of each particle and the global best of the swarm are used to generate new diverse individuals through the transposon operators. The new generated individuals with better fitness are selected to be the new personal best particles and global best particle to guide the swarm for further solution exploration. A comprehensive simulation study is conducted on a set of twelve benchmark functions. Compared with five state-of-the-art quantum-behaved particle swarm optimization algorithms, the proposed EB-QPSO performs more competitively in all of the benchmark functions in terms of better global search capability and faster convergence rate.

  13. High beta lasing in micropillar cavities with adiabatic layer design

    DEFF Research Database (Denmark)

    Lermer, M.; Gregersen, Niels; Lorke, M.

    2013-01-01

    We report on lasing in optically pumped adiabatic micropillar cavities, based on the AlAs/GaAs material system. A detailed study of the threshold pump power and the spontaneous emission β factor in the lasing regime for different diameters dc is presented. We demonstrate a reduction of the thresh...... of the threshold pump power by over 2 orders of magnitude from dc = 2.25 μm down to 0.95 μm. Lasing with β factors exceeding 0.5 shows that adiabatic micropillars are operating deeply in the cavity quantum electrodynamics regime....

  14. On the adiabatic theorem when eigenvalues dive into the continuum

    DEFF Research Database (Denmark)

    Cornean, Decebal Horia; Jensen, Arne; Knörr, Hans Konrad

    2018-01-01

    We consider a reduced two-channel model of an atom consisting of a quantum dot coupled to an open scattering channel described by a three-dimensional Laplacian. We are interested in the survival probability of a bound state when the dot energy varies smoothly and adiabatically in time. The initial...... in the adiabatic limit. At the end of the paper, we present a short outlook on how our method may be extended to cover other classes of Hamiltonians; details will be given elsewhere....

  15. Quantum associative memory with linear and non-linear algorithms for the diagnosis of some tropical diseases.

    Science.gov (United States)

    Tchapet Njafa, J-P; Nana Engo, S G

    2018-01-01

    This paper presents the QAMDiagnos, a model of Quantum Associative Memory (QAM) that can be a helpful tool for medical staff without experience or laboratory facilities, for the diagnosis of four tropical diseases (malaria, typhoid fever, yellow fever and dengue) which have several similar signs and symptoms. The memory can distinguish a single infection from a polyinfection. Our model is a combination of the improved versions of the original linear quantum retrieving algorithm proposed by Ventura and the non-linear quantum search algorithm of Abrams and Lloyd. From the given simulation results, it appears that the efficiency of recognition is good when particular signs and symptoms of a disease are inserted given that the linear algorithm is the main algorithm. The non-linear algorithm helps confirm or correct the diagnosis or give some advice to the medical staff for the treatment. So, our QAMDiagnos that has a friendly graphical user interface for desktop and smart-phone is a sensitive and a low-cost diagnostic tool that enables rapid and accurate diagnosis of four tropical diseases. Copyright © 2017 Elsevier Ltd. All rights reserved.

  16. A divide-conquer-recombine algorithmic paradigm for large spatiotemporal quantum molecular dynamics simulations

    Science.gov (United States)

    Shimojo, Fuyuki; Hattori, Shinnosuke; Kalia, Rajiv K.; Kunaseth, Manaschai; Mou, Weiwei; Nakano, Aiichiro; Nomura, Ken-ichi; Ohmura, Satoshi; Rajak, Pankaj; Shimamura, Kohei; Vashishta, Priya

    2014-05-01

    We introduce an extension of the divide-and-conquer (DC) algorithmic paradigm called divide-conquer-recombine (DCR) to perform large quantum molecular dynamics (QMD) simulations on massively parallel supercomputers, in which interatomic forces are computed quantum mechanically in the framework of density functional theory (DFT). In DCR, the DC phase constructs globally informed, overlapping local-domain solutions, which in the recombine phase are synthesized into a global solution encompassing large spatiotemporal scales. For the DC phase, we design a lean divide-and-conquer (LDC) DFT algorithm, which significantly reduces the prefactor of the O(N) computational cost for N electrons by applying a density-adaptive boundary condition at the peripheries of the DC domains. Our globally scalable and locally efficient solver is based on a hybrid real-reciprocal space approach that combines: (1) a highly scalable real-space multigrid to represent the global charge density; and (2) a numerically efficient plane-wave basis for local electronic wave functions and charge density within each domain. Hybrid space-band decomposition is used to implement the LDC-DFT algorithm on parallel computers. A benchmark test on an IBM Blue Gene/Q computer exhibits an isogranular parallel efficiency of 0.984 on 786 432 cores for a 50.3 × 106-atom SiC system. As a test of production runs, LDC-DFT-based QMD simulation involving 16 661 atoms is performed on the Blue Gene/Q to study on-demand production of hydrogen gas from water using LiAl alloy particles. As an example of the recombine phase, LDC-DFT electronic structures are used as a basis set to describe global photoexcitation dynamics with nonadiabatic QMD (NAQMD) and kinetic Monte Carlo (KMC) methods. The NAQMD simulations are based on the linear response time-dependent density functional theory to describe electronic excited states and a surface-hopping approach to describe transitions between the excited states. A series of techniques

  17. A divide-conquer-recombine algorithmic paradigm for large spatiotemporal quantum molecular dynamics simulations

    International Nuclear Information System (INIS)

    Shimojo, Fuyuki; Hattori, Shinnosuke; Kalia, Rajiv K.; Mou, Weiwei; Nakano, Aiichiro; Nomura, Ken-ichi; Rajak, Pankaj; Vashishta, Priya; Kunaseth, Manaschai; Ohmura, Satoshi; Shimamura, Kohei

    2014-01-01

    We introduce an extension of the divide-and-conquer (DC) algorithmic paradigm called divide-conquer-recombine (DCR) to perform large quantum molecular dynamics (QMD) simulations on massively parallel supercomputers, in which interatomic forces are computed quantum mechanically in the framework of density functional theory (DFT). In DCR, the DC phase constructs globally informed, overlapping local-domain solutions, which in the recombine phase are synthesized into a global solution encompassing large spatiotemporal scales. For the DC phase, we design a lean divide-and-conquer (LDC) DFT algorithm, which significantly reduces the prefactor of the O(N) computational cost for N electrons by applying a density-adaptive boundary condition at the peripheries of the DC domains. Our globally scalable and locally efficient solver is based on a hybrid real-reciprocal space approach that combines: (1) a highly scalable real-space multigrid to represent the global charge density; and (2) a numerically efficient plane-wave basis for local electronic wave functions and charge density within each domain. Hybrid space-band decomposition is used to implement the LDC-DFT algorithm on parallel computers. A benchmark test on an IBM Blue Gene/Q computer exhibits an isogranular parallel efficiency of 0.984 on 786 432 cores for a 50.3 × 10 6 -atom SiC system. As a test of production runs, LDC-DFT-based QMD simulation involving 16 661 atoms is performed on the Blue Gene/Q to study on-demand production of hydrogen gas from water using LiAl alloy particles. As an example of the recombine phase, LDC-DFT electronic structures are used as a basis set to describe global photoexcitation dynamics with nonadiabatic QMD (NAQMD) and kinetic Monte Carlo (KMC) methods. The NAQMD simulations are based on the linear response time-dependent density functional theory to describe electronic excited states and a surface-hopping approach to describe transitions between the excited states. A series of

  18. Compact beam splitters in coupled waveguides using shortcuts to adiabaticity

    Science.gov (United States)

    Chen, Xi; Wen, Rui-Dan; Shi, Jie-Long; Tseng, Shuo-Yen

    2018-04-01

    There are various works on adiabatic (three) waveguide coupler devices but most are focused on the quantum optical analogies and the physics itself. We successfully apply shortcuts to adiabaticity techniques to the coupled waveguide system with a suitable length for integrated optics devices. Especially, the counter-diabatic driving protocol followed by unitary transformation overcomes the previously unrealistic implemention, and is used to design feasible and robust 1 × 2 and 1 × 3 beam splitters for symmetric and asymmetric three waveguide couplers. Numerical simulations with the beam propagation method demonstrate that these shortcut designs for beam splitters are shorter than the adiabatic ones, and also have a better tolerance than parallel waveguides resonant beam splitters with respect to spacing errors and wavelength variation.

  19. Bond selective chemistry beyond the adiabatic approximation

    Energy Technology Data Exchange (ETDEWEB)

    Butler, L.J. [Univ. of Chicago, IL (United States)

    1993-12-01

    One of the most important challenges in chemistry is to develop predictive ability for the branching between energetically allowed chemical reaction pathways. Such predictive capability, coupled with a fundamental understanding of the important molecular interactions, is essential to the development and utilization of new fuels and the design of efficient combustion processes. Existing transition state and exact quantum theories successfully predict the branching between available product channels for systems in which each reaction coordinate can be adequately described by different paths along a single adiabatic potential energy surface. In particular, unimolecular dissociation following thermal, infrared multiphoton, or overtone excitation in the ground state yields a branching between energetically allowed product channels which can be successfully predicted by the application of statistical theories, i.e. the weakest bond breaks. (The predictions are particularly good for competing reactions in which when there is no saddle point along the reaction coordinates, as in simple bond fission reactions.) The predicted lack of bond selectivity results from the assumption of rapid internal vibrational energy redistribution and the implicit use of a single adiabatic Born-Oppenheimer potential energy surface for the reaction. However, the adiabatic approximation is not valid for the reaction of a wide variety of energetic materials and organic fuels; coupling between the electronic states of the reacting species play a a key role in determining the selectivity of the chemical reactions induced. The work described below investigated the central role played by coupling between electronic states in polyatomic molecules in determining the selective branching between energetically allowed fragmentation pathways in two key systems.

  20. Algorithms

    Indian Academy of Sciences (India)

    to as 'divide-and-conquer'. Although there has been a large effort in realizing efficient algorithms, there are not many universally accepted algorithm design paradigms. In this article, we illustrate algorithm design techniques such as balancing, greedy strategy, dynamic programming strategy, and backtracking or traversal of ...

  1. Randomized and quantum algorithms for solving initial-value problems in ordinary differential equations of order k

    Directory of Open Access Journals (Sweden)

    Maciej Goćwin

    2008-01-01

    Full Text Available The complexity of initial-value problems is well studied for systems of equations of first order. In this paper, we study the \\(\\varepsilon\\-complexity for initial-value problems for scalar equations of higher order. We consider two models of computation, the randomized model and the quantum model. We construct almost optimal algorithms adjusted to scalar equations of higher order, without passing to systems of first order equations. The analysis of these algorithms allows us to establish upper complexity bounds. We also show (almost matching lower complexity bounds. The \\(\\varepsilon\\-complexity in the randomized and quantum setting depends on the regularity of the right-hand side function, but is independent of the order of equation. Comparing the obtained bounds with results known in the deterministic case, we see that randomized algorithms give us a speed-up by \\(1/2\\, and quantum algorithms by \\(1\\ in the exponent. Hence, the speed-up does not depend on the order of equation, and is the same as for the systems of equations of first order. We also include results of some numerical experiments which confirm theoretical results.

  2. Multi-objective genetic algorithm optimization of 2D- and 3D-Pareto fronts for vibrational quantum processes

    International Nuclear Information System (INIS)

    Gollub, C; De Vivie-Riedle, R

    2009-01-01

    A multi-objective genetic algorithm is applied to optimize picosecond laser fields, driving vibrational quantum processes. Our examples are state-to-state transitions and unitary transformations. The approach allows features of the shaped laser fields and of the excitation mechanisms to be controlled simultaneously with the quantum yield. Within the parameter range accessible to the experiment, we focus on short pulse durations and low pulse energies to optimize preferably robust laser fields. Multidimensional Pareto fronts for these conflicting objectives could be constructed. Comparison with previous work showed that the solutions from Pareto optimizations and from optimal control theory match very well.

  3. Automated Algorithms for Quantum-Level Accuracy in Atomistic Simulations: LDRD Final Report.

    Energy Technology Data Exchange (ETDEWEB)

    Thompson, Aidan Patrick; Schultz, Peter Andrew; Crozier, Paul; Moore, Stan Gerald; Swiler, Laura Painton; Stephens, John Adam; Trott, Christian Robert; Foiles, Stephen Martin; Tucker, Garritt J. (Drexel University)

    2014-09-01

    This report summarizes the result of LDRD project 12-0395, titled "Automated Algorithms for Quantum-level Accuracy in Atomistic Simulations." During the course of this LDRD, we have developed an interatomic potential for solids and liquids called Spectral Neighbor Analysis Poten- tial (SNAP). The SNAP potential has a very general form and uses machine-learning techniques to reproduce the energies, forces, and stress tensors of a large set of small configurations of atoms, which are obtained using high-accuracy quantum electronic structure (QM) calculations. The local environment of each atom is characterized by a set of bispectrum components of the local neighbor density projected on to a basis of hyperspherical harmonics in four dimensions. The SNAP coef- ficients are determined using weighted least-squares linear regression against the full QM training set. This allows the SNAP potential to be fit in a robust, automated manner to large QM data sets using many bispectrum components. The calculation of the bispectrum components and the SNAP potential are implemented in the LAMMPS parallel molecular dynamics code. Global optimization methods in the DAKOTA software package are used to seek out good choices of hyperparameters that define the overall structure of the SNAP potential. FitSnap.py, a Python-based software pack- age interfacing to both LAMMPS and DAKOTA is used to formulate the linear regression problem, solve it, and analyze the accuracy of the resultant SNAP potential. We describe a SNAP potential for tantalum that accurately reproduces a variety of solid and liquid properties. Most significantly, in contrast to existing tantalum potentials, SNAP correctly predicts the Peierls barrier for screw dislocation motion. We also present results from SNAP potentials generated for indium phosphide (InP) and silica (SiO 2 ). We describe efficient algorithms for calculating SNAP forces and energies in molecular dynamics simulations using massively parallel computers

  4. Rovibrational controlled-NOT gates using optimized stimulated Raman adiabatic passage techniques and optimal control theory

    International Nuclear Information System (INIS)

    Sugny, D.; Bomble, L.; Ribeyre, T.; Dulieu, O.; Desouter-Lecomte, M.

    2009-01-01

    Implementation of quantum controlled-NOT (CNOT) gates in realistic molecular systems is studied using stimulated Raman adiabatic passage (STIRAP) techniques optimized in the time domain by genetic algorithms or coupled with optimal control theory. In the first case, with an adiabatic solution (a series of STIRAP processes) as starting point, we optimize in the time domain different parameters of the pulses to obtain a high fidelity in two realistic cases under consideration. A two-qubit CNOT gate constructed from different assignments in rovibrational states is considered in diatomic (NaCs) or polyatomic (SCCl 2 ) molecules. The difficulty of encoding logical states in pure rotational states with STIRAP processes is illustrated. In such circumstances, the gate can be implemented by optimal control theory and the STIRAP sequence can then be used as an interesting trial field. We discuss the relative merits of the two methods for rovibrational computing (structure of the control field, duration of the control, and efficiency of the optimization).

  5. Multiobjective Quantum Evolutionary Algorithm for the Vehicle Routing Problem with Customer Satisfaction

    Directory of Open Access Journals (Sweden)

    Jingling Zhang

    2012-01-01

    Full Text Available The multiobjective vehicle routing problem considering customer satisfaction (MVRPCS involves the distribution of orders from several depots to a set of customers over a time window. This paper presents a self-adaptive grid multi-objective quantum evolutionary algorithm (MOQEA for the MVRPCS, which takes into account customer satisfaction as well as travel costs. The degree of customer satisfaction is represented by proposing an improved fuzzy due-time window, and the optimization problem is modeled as a mixed integer linear program. In the MOQEA, nondominated solution set is constructed by the Challenge Cup rules. Moreover, an adaptive grid is designed to achieve the diversity of solution sets; that is, the number of grids in each generation is not fixed but is automatically adjusted based on the distribution of the current generation of nondominated solution set. In the study, the MOQEA is evaluated by applying it to classical benchmark problems. Results of numerical simulation and comparison show that the established model is valid and the MOQEA is effective for MVRPCS.

  6. Delayed Slater determinant update algorithms for high efficiency quantum Monte Carlo

    Science.gov (United States)

    McDaniel, T.; D'Azevedo, E. F.; Li, Y. W.; Wong, K.; Kent, P. R. C.

    2017-11-01

    Within ab initio Quantum Monte Carlo simulations, the leading numerical cost for large systems is the computation of the values of the Slater determinants in the trial wavefunction. Each Monte Carlo step requires finding the determinant of a dense matrix. This is most commonly iteratively evaluated using a rank-1 Sherman-Morrison updating scheme to avoid repeated explicit calculation of the inverse. The overall computational cost is, therefore, formally cubic in the number of electrons or matrix size. To improve the numerical efficiency of this procedure, we propose a novel multiple rank delayed update scheme. This strategy enables probability evaluation with an application of accepted moves to the matrices delayed until after a predetermined number of moves, K. The accepted events are then applied to the matrices en bloc with enhanced arithmetic intensity and computational efficiency via matrix-matrix operations instead of matrix-vector operations. This procedure does not change the underlying Monte Carlo sampling or its statistical efficiency. For calculations on large systems and algorithms such as diffusion Monte Carlo, where the acceptance ratio is high, order of magnitude improvements in the update time can be obtained on both multi-core central processing units and graphical processing units.

  7. A genetic-algorithm-based method to find unitary transformations for any desired quantum computation and application to a one-bit oracle decision problem

    Energy Technology Data Exchange (ETDEWEB)

    Bang, Jeongho [Seoul National University, Seoul (Korea, Republic of); Hanyang University, Seoul (Korea, Republic of); Yoo, Seokwon [Hanyang University, Seoul (Korea, Republic of)

    2014-12-15

    We propose a genetic-algorithm-based method to find the unitary transformations for any desired quantum computation. We formulate a simple genetic algorithm by introducing the 'genetic parameter vector' of the unitary transformations to be found. In the genetic algorithm process, all components of the genetic parameter vectors are supposed to evolve to the solution parameters of the unitary transformations. We apply our method to find the optimal unitary transformations and to generalize the corresponding quantum algorithms for a realistic problem, the one-bit oracle decision problem, or the often-called Deutsch problem. By numerical simulations, we can faithfully find the appropriate unitary transformations to solve the problem by using our method. We analyze the quantum algorithms identified by the found unitary transformations and generalize the variant models of the original Deutsch's algorithm.

  8. The adiabatic approximation in multichannel scattering

    International Nuclear Information System (INIS)

    Schulte, A.M.

    1978-01-01

    Using two-dimensional models, an attempt has been made to get an impression of the conditions of validity of the adiabatic approximation. For a nucleon bound to a rotating nucleus the Coriolis coupling is neglected and the relation between this nuclear Coriolis coupling and the classical Coriolis force has been examined. The approximation for particle scattering from an axially symmetric rotating nucleus based on a short duration of the collision, has been combined with an approximation based on the limitation of angular momentum transfer between particle and nucleus. Numerical calculations demonstrate the validity of the new combined method. The concept of time duration for quantum mechanical collisions has also been studied, as has the collective description of permanently deformed nuclei. (C.F.)

  9. Pumped shot noise in adiabatically modulated graphene-based double-barrier structures.

    Science.gov (United States)

    Zhu, Rui; Lai, Maoli

    2011-11-16

    Quantum pumping processes are accompanied by considerable quantum noise. Based on the scattering approach, we investigated the pumped shot noise properties in adiabatically modulated graphene-based double-barrier structures. It is found that compared with the Poisson processes, the pumped shot noise is dramatically enhanced where the dc pumped current changes flow direction, which demonstrates the effect of the Klein paradox.

  10. Pumped shot noise in adiabatically modulated graphene-based double-barrier structures

    Science.gov (United States)

    Zhu, Rui; Lai, Maoli

    2011-11-01

    Quantum pumping processes are accompanied by considerable quantum noise. Based on the scattering approach, we investigated the pumped shot noise properties in adiabatically modulated graphene-based double-barrier structures. It is found that compared with the Poisson processes, the pumped shot noise is dramatically enhanced where the dc pumped current changes flow direction, which demonstrates the effect of the Klein paradox.

  11. An adiabatic focuser

    International Nuclear Information System (INIS)

    Chen, P.; Oide, K.; Sessler, A.M.; Yu, S.S.

    1989-08-01

    Theoretical analysis is made of an intense relativistic electron beam, such as would be available from a linear collider, moving through a plasma of increasing density, but density always less than that of the beam (underdense). In this situation, the plasma electrons are expelled from the beam channel and the electrons are subject to an ever-increasing focusing force provided by the channel ions. Analysis is made on the beam radiation energy loss in the classical, the transition, and the quantum regimes. It is shown that the focuser is insensitive to the beam energy spread behaviors in the nonclassical regimes, the radiation limit on lenses (the Oide limit) can be exceeded. The sensitivity of the system to the topic mismatch and the nonlinearity is also analyzed. Examples are given with SLC-type and TLC-type parameters. 9 refs., 1 tab

  12. Improved quantum-inspired evolutionary algorithm with diversity information applied to economic dispatch problem with prohibited operating zones

    International Nuclear Information System (INIS)

    Vianna Neto, Julio Xavier; Andrade Bernert, Diego Luis de; Santos Coelho, Leandro dos

    2011-01-01

    The objective of the economic dispatch problem (EDP) of electric power generation, whose characteristics are complex and highly nonlinear, is to schedule the committed generating unit outputs so as to meet the required load demand at minimum operating cost while satisfying all unit and system equality and inequality constraints. Recently, as an alternative to the conventional mathematical approaches, modern meta-heuristic optimization techniques have been given much attention by many researchers due to their ability to find an almost global optimal solution in EDPs. Research on merging evolutionary computation and quantum computation has been started since late 1990. Inspired on the quantum computation, this paper presented an improved quantum-inspired evolutionary algorithm (IQEA) based on diversity information of population. A classical quantum-inspired evolutionary algorithm (QEA) and the IQEA were implemented and validated for a benchmark of EDP with 15 thermal generators with prohibited operating zones. From the results for the benchmark problem, it is observed that the proposed IQEA approach provides promising results when compared to various methods available in the literature.

  13. Improved quantum-inspired evolutionary algorithm with diversity information applied to economic dispatch problem with prohibited operating zones

    Energy Technology Data Exchange (ETDEWEB)

    Vianna Neto, Julio Xavier, E-mail: julio.neto@onda.com.b [Pontifical Catholic University of Parana, PUCPR, Undergraduate Program at Mechatronics Engineering, Imaculada Conceicao, 1155, Zip code 80215-901, Curitiba, Parana (Brazil); Andrade Bernert, Diego Luis de, E-mail: dbernert@gmail.co [Pontifical Catholic University of Parana, PUCPR, Industrial and Systems Engineering Graduate Program, LAS/PPGEPS, Imaculada Conceicao, 1155, Zip code 80215-901, Curitiba, Parana (Brazil); Santos Coelho, Leandro dos, E-mail: leandro.coelho@pucpr.b [Pontifical Catholic University of Parana, PUCPR, Industrial and Systems Engineering Graduate Program, LAS/PPGEPS, Imaculada Conceicao, 1155, Zip code 80215-901, Curitiba, Parana (Brazil)

    2011-01-15

    The objective of the economic dispatch problem (EDP) of electric power generation, whose characteristics are complex and highly nonlinear, is to schedule the committed generating unit outputs so as to meet the required load demand at minimum operating cost while satisfying all unit and system equality and inequality constraints. Recently, as an alternative to the conventional mathematical approaches, modern meta-heuristic optimization techniques have been given much attention by many researchers due to their ability to find an almost global optimal solution in EDPs. Research on merging evolutionary computation and quantum computation has been started since late 1990. Inspired on the quantum computation, this paper presented an improved quantum-inspired evolutionary algorithm (IQEA) based on diversity information of population. A classical quantum-inspired evolutionary algorithm (QEA) and the IQEA were implemented and validated for a benchmark of EDP with 15 thermal generators with prohibited operating zones. From the results for the benchmark problem, it is observed that the proposed IQEA approach provides promising results when compared to various methods available in the literature.

  14. Improved quantum-inspired evolutionary algorithm with diversity information applied to economic dispatch problem with prohibited operating zones

    Energy Technology Data Exchange (ETDEWEB)

    Neto, Julio Xavier Vianna [Pontifical Catholic University of Parana, PUCPR, Undergraduate Program at Mechatronics Engineering, Imaculada Conceicao, 1155, Zip code 80215-901, Curitiba, Parana (Brazil); Bernert, Diego Luis de Andrade; Coelho, Leandro dos Santos [Pontifical Catholic University of Parana, PUCPR, Industrial and Systems Engineering Graduate Program, LAS/PPGEPS, Imaculada Conceicao, 1155, Zip code 80215-901, Curitiba, Parana (Brazil)

    2011-01-15

    The objective of the economic dispatch problem (EDP) of electric power generation, whose characteristics are complex and highly nonlinear, is to schedule the committed generating unit outputs so as to meet the required load demand at minimum operating cost while satisfying all unit and system equality and inequality constraints. Recently, as an alternative to the conventional mathematical approaches, modern meta-heuristic optimization techniques have been given much attention by many researchers due to their ability to find an almost global optimal solution in EDPs. Research on merging evolutionary computation and quantum computation has been started since late 1990. Inspired on the quantum computation, this paper presented an improved quantum-inspired evolutionary algorithm (IQEA) based on diversity information of population. A classical quantum-inspired evolutionary algorithm (QEA) and the IQEA were implemented and validated for a benchmark of EDP with 15 thermal generators with prohibited operating zones. From the results for the benchmark problem, it is observed that the proposed IQEA approach provides promising results when compared to various methods available in the literature. (author)

  15. Scalable quantum search using trapped ions

    International Nuclear Information System (INIS)

    Ivanov, S. S.; Ivanov, P. A.; Linington, I. E.; Vitanov, N. V.

    2010-01-01

    We propose a scalable implementation of Grover's quantum search algorithm in a trapped-ion quantum information processor. The system is initialized in an entangled Dicke state by using adiabatic techniques. The inversion-about-average and oracle operators take the form of single off-resonant laser pulses. This is made possible by utilizing the physical symmetries of the trapped-ion linear crystal. The physical realization of the algorithm represents a dramatic simplification: each logical iteration (oracle and inversion about average) requires only two physical interaction steps, in contrast to the large number of concatenated gates required by previous approaches. This not only facilitates the implementation but also increases the overall fidelity of the algorithm.

  16. Adiabatic temperature change from non-adiabatic measurements

    Czech Academy of Sciences Publication Activity Database

    Carvalho, A.M.G.; Mejía, C.S.; Ponte, C.A.; Silva, L.E.L.; Kaštil, Jiří; Kamarád, Jiří; Gomes, A.M.

    2016-01-01

    Roč. 122, č. 3 (2016), s. 1-5, č. článku 246. ISSN 0947-8396 Institutional support: RVO:68378271 Keywords : magnetocaloric effect * adiabatic temperature change * calorimetric device * gadolinium Subject RIV: BM - Solid Matter Physics ; Magnetism Impact factor: 1.455, year: 2016

  17. Recent developments in trapping and manipulation of atoms with adiabatic potentials

    Science.gov (United States)

    Garraway, Barry M.; Perrin, Hélène

    2016-09-01

    A combination of static and oscillating magnetic fields can be used to ‘dress’ atoms with radio-frequency (RF), or microwave, radiation. The spatial variation of these fields can be used to create an enormous variety of traps for ultra-cold atoms and quantum gases. This article reviews the type and character of these adiabatic traps and the applications which include atom interferometry and the study of low-dimensional quantum systems. We introduce the main concepts of magnetic traps leading to adiabatic dressed traps. The concept of adiabaticity is discussed in the context of the Landau-Zener model. The first bubble trap experiment is reviewed together with the method used for loading it. Experiments based on atom chips show the production of double wells and ring traps. Dressed atom traps can be evaporatively cooled with an additional RF field, and a weak RF field can be used to probe the spectroscopy of the adiabatic potentials. Several approaches to ring traps formed from adiabatic potentials are discussed, including those based on atom chips, time-averaged adiabatic potentials and induction methods. Several proposals for adiabatic lattices with dressed atoms are also reviewed.

  18. Experimental demonstration of efficient and robust second harmonic generation using the adiabatic temperature gradient method

    Science.gov (United States)

    Dimova, E.; Steflekova, V.; Karatodorov, S.; Kyoseva, E.

    2018-03-01

    We propose a way of achieving efficient and robust second-harmonic generation. The technique proposed is similar to the adiabatic population transfer in a two-state quantum system with crossing energies. If the phase mismatching changes slowly, e.g., due to a temperature gradient along the crystal, and makes the phase match for second-harmonic generation to occur, then the energy would be converted adiabatically to the second harmonic. As an adiabatic technique, the second-harmonic generation scheme presented is stable to variations in the crystal parameters, as well as in the input light, crystal length, input intensity, wavelength and angle of incidence.

  19. Decoherence in a dynamical quantum phase transition of the transverse Ising chain

    International Nuclear Information System (INIS)

    Mostame, Sarah; Schaller, Gernot; Schuetzhold, Ralf

    2007-01-01

    For the prototypical example of the Ising chain in a transverse field, we study the impact of decoherence on the sweep through a second-order quantum phase transition. Apart from the advance in the general understanding of the dynamics of quantum phase transitions, these findings are relevant for adiabatic quantum algorithms due to the similarities between them. It turns out that (in contrast to first-order transitions studied previously) the impact of decoherence caused by a weak coupling to a rather general environment increases with system size (i.e., number of spins or qubits), which might limit the scalability of the system

  20. Setting value optimization method in integration for relay protection based on improved quantum particle swarm optimization algorithm

    Science.gov (United States)

    Yang, Guo Sheng; Wang, Xiao Yang; Li, Xue Dong

    2018-03-01

    With the establishment of the integrated model of relay protection and the scale of the power system expanding, the global setting and optimization of relay protection is an extremely difficult task. This paper presents a kind of application in relay protection of global optimization improved particle swarm optimization algorithm and the inverse time current protection as an example, selecting reliability of the relay protection, selectivity, quick action and flexibility as the four requires to establish the optimization targets, and optimizing protection setting values of the whole system. Finally, in the case of actual power system, the optimized setting value results of the proposed method in this paper are compared with the particle swarm algorithm. The results show that the improved quantum particle swarm optimization algorithm has strong search ability, good robustness, and it is suitable for optimizing setting value in the relay protection of the whole power system.

  1. Algorithms

    Indian Academy of Sciences (India)

    ticians but also forms the foundation of computer science. Two ... with methods of developing algorithms for solving a variety of problems but ... applications of computers in science and engineer- ... numerical calculus are as important. We will ...

  2. Studies in Chaotic adiabatic dynamics

    International Nuclear Information System (INIS)

    Jarzynski, C.

    1994-01-01

    Chaotic adiabatic dynamics refers to the study of systems exhibiting chaotic evolution under slowly time-dependent equations of motion. In this dissertation the author restricts his attention to Hamiltonian chaotic adiabatic systems. The results presented are organized around a central theme, namely, that the energies of such systems evolve diffusively. He begins with a general analysis, in which he motivates and derives a Fokker-Planck equation governing this process of energy diffusion. He applies this equation to study the open-quotes goodnessclose quotes of an adiabatic invariant associated with chaotic motion. This formalism is then applied to two specific examples. The first is that of a gas of noninteracting point particles inside a hard container that deforms slowly with time. Both the two- and three-dimensional cases are considered. The results are discussed in the context of the Wall Formula for one-body dissipation in nuclear physics, and it is shown that such a gas approaches, asymptotically with time, an exponential velocity distribution. The second example involves the Fermi mechanism for the acceleration of cosmic rays. Explicit evolution equations are obtained for the distribution of cosmic ray energies within this model, and the steady-state energy distribution that arises when this equation is modified to account for the injection and removal of cosmic rays is discussed. Finally, the author re-examines the multiple-time-scale approach as applied to the study of phase space evolution under a chaotic adiabatic Hamiltonian. This leads to a more rigorous derivation of the above-mentioned Fokker-Planck equation, and also to a new term which has relevance to the problem of chaotic adiabatic reaction forces (the forces acting on slow, heavy degrees of freedom due to their coupling to light, fast chaotic degrees)

  3. Ion Motion in the Adiabatic Focuser

    International Nuclear Information System (INIS)

    Henestroza, E.; Sessler, A.M.; Yu, S.S.

    2006-01-01

    In this paper we numerically study the effect of ion motion in an adiabatic focuser, motivated by a recent suggestion that ion motion in an adiabatic focuser might be significant and even preclude operation of the focuser as previously envisioned. It is shown that despite ion motion the adiabatic focuser should work as well as originally envisioned

  4. Algorithms

    Indian Academy of Sciences (India)

    algorithm design technique called 'divide-and-conquer'. One of ... Turtle graphics, September. 1996. 5. ... whole list named 'PO' is a pointer to the first element of the list; ..... Program for computing matrices X and Y and placing the result in C *).

  5. Algorithms

    Indian Academy of Sciences (India)

    algorithm that it is implicitly understood that we know how to generate the next natural ..... Explicit comparisons are made in line (1) where maximum and minimum is ... It can be shown that the function T(n) = 3/2n -2 is the solution to the above ...

  6. Efficient quantum circuit implementation of quantum walks

    International Nuclear Information System (INIS)

    Douglas, B. L.; Wang, J. B.

    2009-01-01

    Quantum walks, being the quantum analog of classical random walks, are expected to provide a fruitful source of quantum algorithms. A few such algorithms have already been developed, including the 'glued trees' algorithm, which provides an exponential speedup over classical methods, relative to a particular quantum oracle. Here, we discuss the possibility of a quantum walk algorithm yielding such an exponential speedup over possible classical algorithms, without the use of an oracle. We provide examples of some highly symmetric graphs on which efficient quantum circuits implementing quantum walks can be constructed and discuss potential applications to quantum search for marked vertices along these graphs.

  7. Plasma heating by adiabatic compression

    International Nuclear Information System (INIS)

    Ellis, R.A. Jr.

    1972-01-01

    These two lectures will cover the following three topics: (i) The application of adiabatic compression to toroidal devices is reviewed. The special case of adiabatic compression in tokamaks is considered in more detail, including a discussion of the equilibrium, scaling laws, and heating effects. (ii) The ATC (Adiabatic Toroidal Compressor) device which was completed in May 1972, is described in detail. Compression of a tokamak plasma across a static toroidal field is studied in this device. The device is designed to produce a pre-compression plasma with a major radius of 17 cm, toroidal field of 20 kG, and current of 90 kA. The compression leads to a plasma with major radius of 38 cm and minor radius of 10 cm. Scaling laws imply a density increase of a factor 6, temperature increase of a factor 3, and current increase of a factor 2.4. An additional feature of ATC is that it is a large tokamak which operates without a copper shell. (iii) Data which show that the expected MHD behavior is largely observed is presented and discussed. (U.S.)

  8. Type II Quantum Computing With Superconductors

    National Research Council Canada - National Science Library

    Orlando, Terry

    2004-01-01

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

  9. Adiabatic theorem for the time-dependent wave operator

    International Nuclear Information System (INIS)

    Viennot, David; Jolicard, Georges; Killingbeck, John P.; Perrin, Marie-Yvonne

    2005-01-01

    The application of time-dependent wave operator theory to the development of a quantum adiabatic perturbation theory is treated both theoretically and numerically, with emphasis on the description of field-matter interactions which involve short laser pulses. It is first shown that the adiabatic limit of the time-dependent wave operator corresponds to a succession of instantaneous static Bloch wave operators. Wave operator theory is then shown to be compatible with the two-time Floquet theory of light-matter interaction, thus allowing the application of Floquet theory to cases which require the use of a degenerate active space. A numerical study of some problems shows that the perturbation strength associated with nonadiabatic processes can be reduced by using multidimensional active spaces and illustrates the capacity of the wave operator approach to produce a quasiadiabatic treatment of a nominally nonadiabatic Floquet dynamical system

  10. Algorithms

    Indian Academy of Sciences (India)

    will become clear in the next article when we discuss a simple logo like programming language. ... Rod B may be used as an auxiliary store. The problem is to find an algorithm which performs this task. ... No disks are moved from A to Busing C as auxiliary rod. • move _disk (A, C);. (No + l)th disk is moved from A to C directly ...

  11. Adiabatic photo-steering theory in topological insulators

    Science.gov (United States)

    Inoue, Jun-ichi

    2014-12-01

    Feasible external control of material properties is a crucial issue in condensed matter physics. A new approach to achieving this aim, named adiabatic photo-steering, is reviewed. The core principle of this scheme is that several material constants are effectively turned into externally tunable variables by irradiation of monochromatic laser light. Two-dimensional topological insulators are selected as the optimal systems that exhibit a prominent change in their properties following the application of this method. Two specific examples of photo-steered quantum phenomena, which reflect topological aspects of the electronic systems at hand, are presented. One is the integer quantum Hall effect described by the Haldane model, and the other is the quantum spin Hall effect described by the Kane-Mele model. The topological quantities associated with these phenomena are the conventional Chern number and spin Chern number, respectively. A recent interesting idea, time-reversal symmetry breaking via a temporary periodic external stimulation, is also discussed.

  12. Quantum Computing

    Indian Academy of Sciences (India)

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

  13. Powertrain Matching and Optimization of Dual-Motor Hybrid Driving System for Electric Vehicle Based on Quantum Genetic Intelligent Algorithm

    Directory of Open Access Journals (Sweden)

    Yong Wang

    2014-01-01

    Full Text Available In order to increase the driving range and improve the overall performance of all-electric vehicles, a new dual-motor hybrid driving system with two power sources was proposed. This system achieved torque-speed coupling between the two power sources and greatly improved the high performance working range of the motors; at the same time, continuously variable transmission (CVT was achieved to efficiently increase the driving range. The power system parameters were determined using the “global optimization method”; thus, the vehicle’s dynamics and economy were used as the optimization indexes. Based on preliminary matches, quantum genetic algorithm was introduced to optimize the matching in the dual-motor hybrid power system. Backward simulation was performed on the combined simulation platform of Matlab/Simulink and AVL-Cruise to optimize, simulate, and verify the system parameters of the transmission system. Results showed that quantum genetic algorithms exhibited good global optimization capability and convergence in dealing with multiobjective and multiparameter optimization. The dual-motor hybrid-driving system for electric cars satisfied the dynamic performance and economy requirements of design, efficiently increasing the driving range of the car, having high performance, and reducing energy consumption of 15.6% compared with the conventional electric vehicle with single-speed reducers.

  14. Higher-spin cluster algorithms: the Heisenberg spin and U(1) quantum link models

    Energy Technology Data Exchange (ETDEWEB)

    Chudnovsky, V

    2000-03-01

    I discuss here how the highly-efficient spin-1/2 cluster algorithm for the Heisenberg antiferromagnet may be extended to higher-dimensional representations; some numerical results are provided. The same extensions can be used for the U(1) flux cluster algorithm, but have not yielded signals of the desired Coulomb phase of the system.

  15. Higher-spin cluster algorithms: the Heisenberg spin and U(1) quantum link models

    International Nuclear Information System (INIS)

    Chudnovsky, V.

    2000-01-01

    I discuss here how the highly-efficient spin-1/2 cluster algorithm for the Heisenberg antiferromagnet may be extended to higher-dimensional representations; some numerical results are provided. The same extensions can be used for the U(1) flux cluster algorithm, but have not yielded signals of the desired Coulomb phase of the system

  16. Quantum Computing

    OpenAIRE

    Scarani, Valerio

    1998-01-01

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

  17. Quantum Transmemetic Intelligence

    Science.gov (United States)

    Piotrowski, Edward W.; Sładkowski, Jan

    The following sections are included: * Introduction * A Quantum Model of Free Will * Quantum Acquisition of Knowledge * Thinking as a Quantum Algorithm * Counterfactual Measurement as a Model of Intuition * Quantum Modification of Freud's Model of Consciousness * Conclusion * Acknowledgements * References

  18. Adiabatic Wankel type rotary engine

    Science.gov (United States)

    Kamo, R.; Badgley, P.; Doup, D.

    1988-01-01

    This SBIR Phase program accomplished the objective of advancing the technology of the Wankel type rotary engine for aircraft applications through the use of adiabatic engine technology. Based on the results of this program, technology is in place to provide a rotor and side and intermediate housings with thermal barrier coatings. A detailed cycle analysis of the NASA 1007R Direct Injection Stratified Charge (DISC) rotary engine was performed which concluded that applying thermal barrier coatings to the rotor should be successful and that it was unlikely that the rotor housing could be successfully run with thermal barrier coatings as the thermal stresses were extensive.

  19. A Phase Matching, Adiabatic Accelerator

    Energy Technology Data Exchange (ETDEWEB)

    Lemery, Francois [Hamburg U.; Flöttmann, Klaus [DESY; Kärtner, Franz [CFEL, Hamburg; Piot, Philippe [Northern Illinois U.

    2017-05-01

    Tabletop accelerators are a thing of the future. Reducing their size will require scaling down electromagnetic wavelengths; however, without correspondingly high field gradients, particles will be more susceptible to phase-slippage – especially at low energy. We investigate how an adiabatically-tapered dielectric-lined waveguide could maintain phase-matching between the accelerating mode and electron bunch. We benchmark our simple model with CST and implement it into ASTRA; finally we provide a first glimpse into the beam dynamics in a phase-matching accelerator.

  20. A new class of ensemble conserving algorithms for approximate quantum dynamics: Theoretical formulation and model problems

    International Nuclear Information System (INIS)

    Smith, Kyle K. G.; Poulsen, Jens Aage; Nyman, Gunnar; Rossky, Peter J.

    2015-01-01

    We develop two classes of quasi-classical dynamics that are shown to conserve the initial quantum ensemble when used in combination with the Feynman-Kleinert approximation of the density operator. These dynamics are used to improve the Feynman-Kleinert implementation of the classical Wigner approximation for the evaluation of quantum time correlation functions known as Feynman-Kleinert linearized path-integral. As shown, both classes of dynamics are able to recover the exact classical and high temperature limits of the quantum time correlation function, while a subset is able to recover the exact harmonic limit. A comparison of the approximate quantum time correlation functions obtained from both classes of dynamics is made with the exact results for the challenging model problems of the quartic and double-well potentials. It is found that these dynamics provide a great improvement over the classical Wigner approximation, in which purely classical dynamics are used. In a special case, our first method becomes identical to centroid molecular dynamics

  1. A cascadic monotonic time-discretized algorithm for finite-level quantum control computation

    Science.gov (United States)

    Ditz, P.; Borzi`, A.

    2008-03-01

    A computer package (CNMS) is presented aimed at the solution of finite-level quantum optimal control problems. This package is based on a recently developed computational strategy known as monotonic schemes. Quantum optimal control problems arise in particular in quantum optics where the optimization of a control representing laser pulses is required. The purpose of the external control field is to channel the system's wavefunction between given states in its most efficient way. Physically motivated constraints, such as limited laser resources, are accommodated through appropriately chosen cost functionals. Program summaryProgram title: CNMS Catalogue identifier: ADEB_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADEB_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.: 770 No. of bytes in distributed program, including test data, etc.: 7098 Distribution format: tar.gz Programming language: MATLAB 6 Computer: AMD Athlon 64 × 2 Dual, 2:21 GHz, 1:5 GB RAM Operating system: Microsoft Windows XP Word size: 32 Classification: 4.9 Nature of problem: Quantum control Solution method: Iterative Running time: 60-600 sec

  2. Quantum

    CERN Document Server

    Al-Khalili, Jim

    2003-01-01

    In this lively look at quantum science, a physicist takes you on an entertaining and enlightening journey through the basics of subatomic physics. Along the way, he examines the paradox of quantum mechanics--beautifully mathematical in theory but confoundingly unpredictable in the real world. Marvel at the Dual Slit experiment as a tiny atom passes through two separate openings at the same time. Ponder the peculiar communication of quantum particles, which can remain in touch no matter how far apart. Join the genius jewel thief as he carries out a quantum measurement on a diamond without ever touching the object in question. Baffle yourself with the bizzareness of quantum tunneling, the equivalent of traveling partway up a hill, only to disappear then reappear traveling down the opposite side. With its clean, colorful layout and conversational tone, this text will hook you into the conundrum that is quantum mechanics.

  3. Usefulness of an enhanced Kitaev phase-estimation algorithm in quantum metrology and computation

    Science.gov (United States)

    Kaftal, Tomasz; Demkowicz-Dobrzański, Rafał

    2014-12-01

    We analyze the performance of a generalized Kitaev's phase-estimation algorithm where N phase gates, acting on M qubits prepared in a product state, may be distributed in an arbitrary way. Unlike the standard algorithm, where the mean square error scales as 1 /N , the optimal generalizations offer the Heisenberg 1 /N2 error scaling and we show that they are in fact very close to the fundamental Bayesian estimation bound. We also demonstrate that the optimality of the algorithm breaks down when losses are taken into account, in which case the performance is inferior to the optimal entanglement-based estimation strategies. Finally, we show that when an alternative resource quantification is adopted, which describes the phase estimation in Shor's algorithm more accurately, the standard Kitaev's procedure is indeed optimal and there is no need to consider its generalized version.

  4. Quantum machine learning for quantum anomaly detection

    Science.gov (United States)

    Liu, Nana; Rebentrost, Patrick

    2018-04-01

    Anomaly detection is used for identifying data that deviate from "normal" data patterns. Its usage on classical data finds diverse applications in many important areas such as finance, fraud detection, medical diagnoses, data cleaning, and surveillance. With the advent of quantum technologies, anomaly detection of quantum data, in the form of quantum states, may become an important component of quantum applications. Machine-learning algorithms are playing pivotal roles in anomaly detection using classical data. Two widely used algorithms are the kernel principal component analysis and the one-class support vector machine. We find corresponding quantum algorithms to detect anomalies in quantum states. We show that these two quantum algorithms can be performed using resources that are logarithmic in the dimensionality of quantum states. For pure quantum states, these resources can also be logarithmic in the number of quantum states used for training the machine-learning algorithm. This makes these algorithms potentially applicable to big quantum data applications.

  5. Stimulated Raman adiabatic passage in Tm3+:YAG

    International Nuclear Information System (INIS)

    Alexander, A. L.; Lauro, R.; Louchet, A.; Chaneliere, T.; Le Goueet, J. L.

    2008-01-01

    We report on the experimental demonstration of stimulated Raman adiabatic passage in a Tm 3+ :YAG crystal. Tm 3+ :YAG is a promising material for use in quantum information processing applications, but as yet there are few experimental investigations of coherent Raman processes in this material. We investigate the effect of inhomogeneous broadening and Rabi frequency on the transfer efficiency and the width of the two-photon spectrum. Simulations of the complete Tm 3+ :YAG system are presented along with the corresponding experimental results

  6. Exotic quantum holonomy and higher-order exceptional points in quantum kicked tops

    OpenAIRE

    Tanaka, Atushi; Kim, Sang Wook; Cheon, Taksu

    2014-01-01

    The correspondence between exotic quantum holonomy that occurs in families of Hermitian cycles, and exceptional points (EPs) for non-Hermitian quantum theory is examined in quantum kicked tops. Under a suitable condition, an explicit expressions of the adiabatic parameter dependencies of quasienergies and stationary states, which exhibit anholonomies, are obtained. It is also shown that the quantum kicked tops with the complexified adiabatic parameter have a higher order EP, which is broken i...

  7. Quantum computation with classical light: Implementation of the Deutsch–Jozsa algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Perez-Garcia, Benjamin [Photonics and Mathematical Optics Group, Tecnológico de Monterrey, Monterrey 64849 (Mexico); University of the Witwatersrand, Private Bag 3, Johannesburg 2050 (South Africa); School of Chemistry and Physics, University of KwaZulu-Natal, Private Bag X54001, Durban 4000 (South Africa); McLaren, Melanie [University of the Witwatersrand, Private Bag 3, Johannesburg 2050 (South Africa); Goyal, Sandeep K. [School of Chemistry and Physics, University of KwaZulu-Natal, Private Bag X54001, Durban 4000 (South Africa); Institute of Quantum Science and Technology, University of Calgary, Alberta T2N 1N4 (Canada); Hernandez-Aranda, Raul I. [Photonics and Mathematical Optics Group, Tecnológico de Monterrey, Monterrey 64849 (Mexico); Forbes, Andrew [University of the Witwatersrand, Private Bag 3, Johannesburg 2050 (South Africa); Konrad, Thomas, E-mail: konradt@ukzn.ac.za [School of Chemistry and Physics, University of KwaZulu-Natal, Private Bag X54001, Durban 4000 (South Africa); National Institute of Theoretical Physics, Durban Node, Private Bag X54001, Durban 4000 (South Africa)

    2016-05-20

    Highlights: • An implementation of the Deutsch–Jozsa algorithm using classical optics is proposed. • Constant and certain balanced functions can be encoded and distinguished efficiently. • The encoding and the detection process does not require to access single path qubits. • While the scheme might be scalable in principle, it might not be in practice. • We suggest a generalisation of the Deutsch–Jozsa algorithm and its implementation. - Abstract: We propose an optical implementation of the Deutsch–Jozsa Algorithm using classical light in a binary decision-tree scheme. Our approach uses a ring cavity and linear optical devices in order to efficiently query the oracle functional values. In addition, we take advantage of the intrinsic Fourier transforming properties of a lens to read out whether the function given by the oracle is balanced or constant.

  8. Quantum computation with classical light: Implementation of the Deutsch–Jozsa algorithm

    International Nuclear Information System (INIS)

    Perez-Garcia, Benjamin; McLaren, Melanie; Goyal, Sandeep K.; Hernandez-Aranda, Raul I.; Forbes, Andrew; Konrad, Thomas

    2016-01-01

    Highlights: • An implementation of the Deutsch–Jozsa algorithm using classical optics is proposed. • Constant and certain balanced functions can be encoded and distinguished efficiently. • The encoding and the detection process does not require to access single path qubits. • While the scheme might be scalable in principle, it might not be in practice. • We suggest a generalisation of the Deutsch–Jozsa algorithm and its implementation. - Abstract: We propose an optical implementation of the Deutsch–Jozsa Algorithm using classical light in a binary decision-tree scheme. Our approach uses a ring cavity and linear optical devices in order to efficiently query the oracle functional values. In addition, we take advantage of the intrinsic Fourier transforming properties of a lens to read out whether the function given by the oracle is balanced or constant.

  9. PIPER Continuous Adiabatic Demagnetization Refrigerator

    Science.gov (United States)

    Kimball, Mark O.; Shirron, Peter J.; Canavan, Edgar R.; James, Bryan L.; Sampson, Michael A.; Letmate, Richard V.

    2017-01-01

    We report upon the development and testing of a 4-stage adiabatic demagnetization refrigerator (ADR) capable of continuous cooling at 0.100 Kelvin. This cooler is being built to cool the detector array aboard NASA's Primordial Inflation Polarization Explorer (PIPER) observatory. The goal of this balloon mission is to measure the primordial gravitational waves that should exist if the theory of cosmological inflation is correct. At altitude, the ADR will hold the array of transition-edge sensors at 100 mK continuously while periodically rejecting heat to a 1.2 K pumped helium bath. During testing on ground, the array is held at the same temperature but heat is rejected to a 4.2 K helium bath indicating the flexibility in this coolers design.

  10. A parallel additive Schwarz preconditioned Jacobi-Davidson algorithm for polynomial eigenvalue problems in quantum dot simulation

    International Nuclear Information System (INIS)

    Hwang, F-N; Wei, Z-H; Huang, T-M; Wang Weichung

    2010-01-01

    We develop a parallel Jacobi-Davidson approach for finding a partial set of eigenpairs of large sparse polynomial eigenvalue problems with application in quantum dot simulation. A Jacobi-Davidson eigenvalue solver is implemented based on the Portable, Extensible Toolkit for Scientific Computation (PETSc). The eigensolver thus inherits PETSc's efficient and various parallel operations, linear solvers, preconditioning schemes, and easy usages. The parallel eigenvalue solver is then used to solve higher degree polynomial eigenvalue problems arising in numerical simulations of three dimensional quantum dots governed by Schroedinger's equations. We find that the parallel restricted additive Schwarz preconditioner in conjunction with a parallel Krylov subspace method (e.g. GMRES) can solve the correction equations, the most costly step in the Jacobi-Davidson algorithm, very efficiently in parallel. Besides, the overall performance is quite satisfactory. We have observed near perfect superlinear speedup by using up to 320 processors. The parallel eigensolver can find all target interior eigenpairs of a quintic polynomial eigenvalue problem with more than 32 million variables within 12 minutes by using 272 Intel 3.0 GHz processors.

  11. Introduction to quantum information science

    CERN Document Server

    Hayashi, Masahito; Kawachi, Akinori; Kimura, Gen; Ogawa, Tomohiro

    2015-01-01

    This book presents the basics of quantum information, e.g., foundation of quantum theory, quantum algorithms, quantum entanglement, quantum entropies, quantum coding, quantum error correction and quantum cryptography. The required knowledge is only elementary calculus and linear algebra. This way the book can be understood by undergraduate students. In order to study quantum information, one usually has to study the foundation of quantum theory. This book describes it from more an operational viewpoint which is suitable for quantum information while traditional textbooks of quantum theory lack this viewpoint. The current  book bases on Shor's algorithm, Grover's algorithm, Deutsch-Jozsa's algorithm as basic algorithms. To treat several topics in quantum information, this book covers several kinds of information quantities in quantum systems including von Neumann entropy. The limits of several kinds of quantum information processing are given. As important quantum protocols,this book contains quantum teleport...

  12. Concrete resource analysis of the quantum linear-system algorithm used to compute the electromagnetic scattering cross section of a 2D target

    Science.gov (United States)

    Scherer, Artur; Valiron, Benoît; Mau, Siun-Chuon; Alexander, Scott; van den Berg, Eric; Chapuran, Thomas E.

    2017-03-01

    We provide a detailed estimate for the logical resource requirements of the quantum linear-system algorithm (Harrow et al. in Phys Rev Lett 103:150502, 2009) including the recently described elaborations and application to computing the electromagnetic scattering cross section of a metallic target (Clader et al. in Phys Rev Lett 110:250504, 2013). Our resource estimates are based on the standard quantum-circuit model of quantum computation; they comprise circuit width (related to parallelism), circuit depth (total number of steps), the number of qubits and ancilla qubits employed, and the overall number of elementary quantum gate operations as well as more specific gate counts for each elementary fault-tolerant gate from the standard set { X, Y, Z, H, S, T, { CNOT } }. In order to perform these estimates, we used an approach that combines manual analysis with automated estimates generated via the Quipper quantum programming language and compiler. Our estimates pertain to the explicit example problem size N=332{,}020{,}680 beyond which, according to a crude big-O complexity comparison, the quantum linear-system algorithm is expected to run faster than the best known classical linear-system solving algorithm. For this problem size, a desired calculation accuracy ɛ =0.01 requires an approximate circuit width 340 and circuit depth of order 10^{25} if oracle costs are excluded, and a circuit width and circuit depth of order 10^8 and 10^{29}, respectively, if the resource requirements of oracles are included, indicating that the commonly ignored oracle resources are considerable. In addition to providing detailed logical resource estimates, it is also the purpose of this paper to demonstrate explicitly (using a fine-grained approach rather than relying on coarse big-O asymptotic approximations) how these impressively large numbers arise with an actual circuit implementation of a quantum algorithm. While our estimates may prove to be conservative as more efficient

  13. Near-optimal quantum circuit for Grover's unstructured search using a transverse field

    Science.gov (United States)

    Jiang, Zhang; Rieffel, Eleanor G.; Wang, Zhihui

    2017-06-01

    Inspired by a class of algorithms proposed by Farhi et al. (arXiv:1411.4028), namely, the quantum approximate optimization algorithm (QAOA), we present a circuit-based quantum algorithm to search for a needle in a haystack, obtaining the same quadratic speedup achieved by Grover's original algorithm. In our algorithm, the problem Hamiltonian (oracle) and a transverse field are applied alternately to the system in a periodic manner. We introduce a technique, based on spin-coherent states, to analyze the composite unitary in a single period. This composite unitary drives a closed transition between two states that have high degrees of overlap with the initial state and the target state, respectively. The transition rate in our algorithm is of order Θ (1 /√{N }) , and the overlaps are of order Θ (1 ) , yielding a nearly optimal query complexity of T ≃√{N }(π /2 √{2 }) . Our algorithm is a QAOA circuit that demonstrates a quantum advantage with a large number of iterations that is not derived from Trotterization of an adiabatic quantum optimization (AQO) algorithm. It also suggests that the analysis required to understand QAOA circuits involves a very different process from estimating the energy gap of a Hamiltonian in AQO.

  14. Non-Adiabatic Molecular Dynamics Methods for Materials Discovery

    Energy Technology Data Exchange (ETDEWEB)

    Furche, Filipp [Univ. of California, Irvine, CA (United States); Parker, Shane M. [Univ. of California, Irvine, CA (United States); Muuronen, Mikko J. [Univ. of California, Irvine, CA (United States); Roy, Saswata [Univ. of California, Irvine, CA (United States)

    2017-04-04

    The flow of radiative energy in light-driven materials such as photosensitizer dyes or photocatalysts is governed by non-adiabatic transitions between electronic states and cannot be described within the Born-Oppenheimer approximation commonly used in electronic structure theory. The non-adiabatic molecular dynamics (NAMD) methods based on Tully surface hopping and time-dependent density functional theory developed in this project have greatly extended the range of molecular materials that can be tackled by NAMD simulations. New algorithms to compute molecular excited state and response properties efficiently were developed. Fundamental limitations of common non-linear response methods were discovered and characterized. Methods for accurate computations of vibronic spectra of materials such as black absorbers were developed and applied. It was shown that open-shell TDDFT methods capture bond breaking in NAMD simulations, a longstanding challenge for single-reference molecular dynamics simulations. The methods developed in this project were applied to study the photodissociation of acetaldehyde and revealed that non-adiabatic effects are experimentally observable in fragment kinetic energy distributions. Finally, the project enabled the first detailed NAMD simulations of photocatalytic water oxidation by titania nanoclusters, uncovering the mechanism of this fundamentally important reaction for fuel generation and storage.

  15. Quantum Statistical Mechanics on a Quantum Computer

    NARCIS (Netherlands)

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

    2000-01-01

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

  16. Quantum walks, quantum gates, and quantum computers

    International Nuclear Information System (INIS)

    Hines, Andrew P.; Stamp, P. C. E.

    2007-01-01

    The physics of quantum walks on graphs is formulated in Hamiltonian language, both for simple quantum walks and for composite walks, where extra discrete degrees of freedom live at each node of the graph. It is shown how to map between quantum walk Hamiltonians and Hamiltonians for qubit systems and quantum circuits; this is done for both single-excitation and multiexcitation encodings. Specific examples of spin chains, as well as static and dynamic systems of qubits, are mapped to quantum walks, and walks on hyperlattices and hypercubes are mapped to various gate systems. We also show how to map a quantum circuit performing the quantum Fourier transform, the key element of Shor's algorithm, to a quantum walk system doing the same. The results herein are an essential preliminary to a Hamiltonian formulation of quantum walks in which coupling to a dynamic quantum environment is included

  17. Algorithms and computer codes for atomic and molecular quantum scattering theory. Volume I

    Energy Technology Data Exchange (ETDEWEB)

    Thomas, L. (ed.)

    1979-01-01

    The goals of this workshop are to identify which of the existing computer codes for solving the coupled equations of quantum molecular scattering theory perform most efficiently on a variety of test problems, and to make tested versions of those codes available to the chemistry community through the NRCC software library. To this end, many of the most active developers and users of these codes have been invited to discuss the methods and to solve a set of test problems using the LBL computers. The first volume of this workshop report is a collection of the manuscripts of the talks that were presented at the first meeting held at the Argonne National Laboratory, Argonne, Illinois June 25-27, 1979. It is hoped that this will serve as an up-to-date reference to the most popular methods with their latest refinements and implementations.

  18. Algorithms and computer codes for atomic and molecular quantum scattering theory. Volume I

    International Nuclear Information System (INIS)

    Thomas, L.

    1979-01-01

    The goals of this workshop are to identify which of the existing computer codes for solving the coupled equations of quantum molecular scattering theory perform most efficiently on a variety of test problems, and to make tested versions of those codes available to the chemistry community through the NRCC software library. To this end, many of the most active developers and users of these codes have been invited to discuss the methods and to solve a set of test problems using the LBL computers. The first volume of this workshop report is a collection of the manuscripts of the talks that were presented at the first meeting held at the Argonne National Laboratory, Argonne, Illinois June 25-27, 1979. It is hoped that this will serve as an up-to-date reference to the most popular methods with their latest refinements and implementations

  19. Energy consumption for shortcuts to adiabaticity

    Science.gov (United States)

    Torrontegui, E.; Lizuain, I.; González-Resines, S.; Tobalina, A.; Ruschhaupt, A.; Kosloff, R.; Muga, J. G.

    2017-08-01

    Shortcuts to adiabaticity let a system reach the results of a slow adiabatic process in a shorter time. We propose to quantify the "energy cost" of the shortcut by the energy consumption of the system enlarged by including the control device. A mechanical model where the dynamics of the system and control device can be explicitly described illustrates that a broad range of possible values for the consumption is possible, including zero (above the adiabatic energy increment) when friction is negligible and the energy given away as negative power is stored and reused by perfect regenerative braking.

  20. Quantum walk computation

    International Nuclear Information System (INIS)

    Kendon, Viv

    2014-01-01

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

  1. Thermoelectric Effects under Adiabatic Conditions

    Directory of Open Access Journals (Sweden)

    George Levy

    2013-10-01

    Full Text Available This paper investigates not fully explained voltage offsets observed by several researchers during the measurement of the Seebeck coefficient of high Z materials. These offsets, traditionally attributed to faulty laboratory procedures, have proven to have an irreducible component that cannot be fully eliminated in spite of careful laboratory procedures. In fact, these offsets are commonly observed and routinely subtracted out of commercially available Seebeck measurement systems. This paper offers a possible explanation based on the spontaneous formation of an adiabatic temperature gradient in the presence of a force field. The diffusion-diffusion heat transport mechanism is formulated and applied to predict two new thermoelectric effects. The first is the existence of a temperature gradient across a potential barrier in a semiconductor and the second is the Onsager reciprocal of the first, that is, the presence of a measureable voltage that arises across a junction when the temperature gradient is forced to zero by a thermal clamp. Suggested future research includes strategies for utilizing the new thermoelectric effects.

  2. Multiple-state quantum Otto engine, 1D box system

    Energy Technology Data Exchange (ETDEWEB)

    Latifah, E., E-mail: enylatifah@um.ac.id [Laboratory of Theoretical Physics and Natural Philosophy, Physics Department, Institut Teknologi Sepuluh Nopember, ITS, Surabaya, Indonesia and Physics Department, Malang State University (Indonesia); Purwanto, A. [Laboratory of Theoretical Physics and Natural Philosophy, Physics Department, Institut Teknologi Sepuluh Nopember, ITS, Surabaya (Indonesia)

    2014-03-24

    Quantum heat engines produce work using quantum matter as their working substance. We studied adiabatic and isochoric processes and defined the general force according to quantum system. The processes and general force are used to evaluate a quantum Otto engine based on multiple-state of one dimensional box system and calculate the efficiency. As a result, the efficiency depends on the ratio of initial and final width of system under adiabatic processes.

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

    Directory of Open Access Journals (Sweden)

    Antonio A Lagana

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

  4. Optimal control of the power adiabatic stroke of an optomechanical heat engine.

    Science.gov (United States)

    Bathaee, M; Bahrampour, A R

    2016-08-01

    We consider the power adiabatic stroke of the Otto optomechanical heat engine introduced in Phys. Rev. Lett. 112, 150602 (2014)PRLTAO0031-900710.1103/PhysRevLett.112.150602. We derive the maximum extractable work of both optomechanical normal modes in the minimum time while the system experiences quantum friction effects. We show that the total work done by the system in the power adiabatic stroke is optimized by a bang-bang control. The time duration of the power adiabatic stroke is of the order of the inverse of the effective optomechanical-coupling coefficient. The optimal phase-space trajectory of the Otto cycle for both optomechanical normal modes is also obtained.

  5. Geometry of quantal adiabatic evolution driven by a non-Hermitian Hamiltonian

    International Nuclear Information System (INIS)

    Wu Zhaoyan; Yu Ting; Zhou Hongwei

    1994-01-01

    It is shown by using a counter example, which is exactly solvable, that the quantal adiabatic theorem does not generally hold for a non-Hermitian driving Hamiltonian, even if it varies extremely slowly. The condition for the quantal adiabatic theorem to hold for non-Hermitian driving Hamiltonians is given. The adiabatic evolutions driven by a non-Hermitian Hamiltonian provide examples of a new geometric structure, that is the vector bundle in which the inner product of two parallelly transported vectors generally changes. A new geometric concept, the attenuation tensor, is naturally introduced to describe the decay or flourish of the open quantum system. It is constructed in terms of the spectral projector of the Hamiltonian. (orig.)

  6. Magnus approximation in the adiabatic picture

    International Nuclear Information System (INIS)

    Klarsfeld, S.; Oteo, J.A.

    1991-01-01

    A simple approximate nonperturbative method is described for treating time-dependent problems that works well in the intermediate regime far from both the sudden and the adiabatic limits. The method consists of applying the Magnus expansion after transforming to the adiabatic basis defined by the eigenstates of the instantaneous Hamiltonian. A few exactly soluble examples are considered in order to assess the domain of validity of the approximation. (author) 32 refs., 4 figs

  7. Stimulated Raman adiabatic passage in physics, chemistry, and beyond

    Science.gov (United States)

    Vitanov, Nikolay V.; Rangelov, Andon A.; Shore, Bruce W.; Bergmann, Klaas

    2017-01-01

    The technique of stimulated Raman adiabatic passage (STIRAP), which allows efficient and selective population transfer between quantum states without suffering loss due to spontaneous emission, was introduced in 1990 by Gaubatz et al.. Since then STIRAP has emerged as an enabling methodology with widespread successful applications in many fields of physics, chemistry, and beyond. This article reviews the many applications of STIRAP emphasizing the developments since 2001, the time when the last major review on the topic was written (Vitanov, Fleischhauer et al.). A brief introduction into the theory of STIRAP and the early applications for population transfer within three-level systems is followed by the discussion of several extensions to multilevel systems, including multistate chains and tripod systems. The main emphasis is on the wide range of applications in atomic and molecular physics (including atom optics, cavity quantum electrodynamics, formation of ultracold molecules, etc.), quantum information (including single- and two-qubit gates, entangled-state preparation, etc.), solid-state physics (including processes in doped crystals, nitrogen-vacancy centers, superconducting circuits, semiconductor quantum dots and wells), and even some applications in classical physics (including waveguide optics, polarization optics, frequency conversion, etc.). Promising new prospects for STIRAP are also presented (including processes in optomechanics, precision experiments, detection of parity violation in molecules, spectroscopy of core-nonpenetrating Rydberg states, population transfer with x-ray pulses, etc.).

  8. Symmetry of the Adiabatic Condition in the Piston Problem

    Science.gov (United States)

    Anacleto, Joaquim; Ferreira, J. M.

    2011-01-01

    This study addresses a controversial issue in the adiabatic piston problem, namely that of the piston being adiabatic when it is fixed but no longer so when it can move freely. It is shown that this apparent contradiction arises from the usual definition of adiabatic condition. The issue is addressed here by requiring the adiabatic condition to be…

  9. Searching with Quantum Computers

    OpenAIRE

    Grover, Lov K.

    2000-01-01

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

  10. A Novel Quantum-Behaved Lightning Search Algorithm Approach to Improve the Fuzzy Logic Speed Controller for an Induction Motor Drive

    Directory of Open Access Journals (Sweden)

    Jamal Abd Ali

    2015-11-01

    Full Text Available This paper presents a novel lightning search algorithm (LSA using quantum mechanics theories to generate a quantum-inspired LSA (QLSA. The QLSA improves the searching of each step leader to obtain the best position for a projectile. To evaluate the reliability and efficiency of the proposed algorithm, the QLSA is tested using eighteen benchmark functions with various characteristics. The QLSA is applied to improve the design of the fuzzy logic controller (FLC for controlling the speed response of the induction motor drive. The proposed algorithm avoids the exhaustive conventional trial-and-error procedure for obtaining membership functions (MFs. The generated adaptive input and output MFs are implemented in the fuzzy speed controller design to formulate the objective functions. Mean absolute error (MAE of the rotor speed is the objective function of optimization controller. An optimal QLSA-based FLC (QLSAF optimization controller is employed to tune and minimize the MAE, thereby improving the performance of the induction motor with the change in speed and mechanical load. To validate the performance of the developed controller, the results obtained with the QLSAF are compared to the results obtained with LSA, the backtracking search algorithm (BSA, the gravitational search algorithm (GSA, the particle swarm optimization (PSO and the proportional integral derivative controllers (PID, respectively. Results show that the QLASF outperforms the other control methods in all of the tested cases in terms of damping capability and transient response under different mechanical loads and speeds.

  11. Assessment of total efficiency in adiabatic engines

    Science.gov (United States)

    Mitianiec, W.

    2016-09-01

    The paper presents influence of ceramic coating in all surfaces of the combustion chamber of SI four-stroke engine on working parameters mainly on heat balance and total efficiency. Three cases of engine were considered: standard without ceramic coating, fully adiabatic combustion chamber and engine with different thickness of ceramic coating. Consideration of adiabatic or semi-adiabatic engine was connected with mathematical modelling of heat transfer from the cylinder gas to the cooling medium. This model takes into account changeable convection coefficient based on the experimental formulas of Woschni, heat conductivity of multi-layer walls and also small effect of radiation in SI engines. The simulation model was elaborated with full heat transfer to the cooling medium and unsteady gas flow in the engine intake and exhaust systems. The computer program taking into account 0D model of engine processes in the cylinder and 1D model of gas flow was elaborated for determination of many basic engine thermodynamic parameters for Suzuki DR-Z400S 400 cc SI engine. The paper presents calculation results of influence of the ceramic coating thickness on indicated pressure, specific fuel consumption, cooling and exhaust heat losses. Next it were presented comparisons of effective power, heat losses in the cooling and exhaust systems, total efficiency in function of engine rotational speed and also comparison of temperature inside the cylinder for standard, semi-adiabatic and full adiabatic engine. On the basis of the achieved results it was found higher total efficiency of adiabatic engines at 2500 rpm from 27% for standard engine to 37% for full adiabatic engine.

  12. Adiabatic process reversibility: microscopic and macroscopic views

    International Nuclear Information System (INIS)

    Anacleto, Joaquim; Pereira, Mario G

    2009-01-01

    The reversibility of adiabatic processes was recently addressed by two publications. In the first (Miranda 2008 Eur. J. Phys. 29 937-43), an equation was derived relating the initial and final volumes and temperatures for adiabatic expansions of an ideal gas, using a microscopic approach. In that relation the parameter r accounts for the process reversibility, ranging between 0 and 1, which corresponds to the free and reversible expansion, respectively. In the second (Anacleto and Pereira 2009 Eur. J. Phys. 30 177-83), the authors have shown that thermodynamics can effectively and efficiently be used to obtain the general law for adiabatic processes carried out by an ideal gas, including compressions, for which r≥1. The present work integrates and extends the aforementioned studies, providing thus further insights into the analysis of the adiabatic process. It is shown that Miranda's work is wholly valid for compressions. In addition, it is demonstrated that the adiabatic reversibility coefficient given in terms of the piston velocity and the root mean square velocity of the gas particles is equivalent to the macroscopic description, given just by the quotient between surroundings and system pressure values. (letters and comments)

  13. Deterministic constant-temperature dynamics for dissipative quantum systems

    International Nuclear Information System (INIS)

    Sergi, Alessandro

    2007-01-01

    A novel method is introduced in order to treat the dissipative dynamics of quantum systems interacting with a bath of classical degrees of freedom. The method is based upon an extension of the Nose-Hoover chain (constant temperature) dynamics to quantum-classical systems. Both adiabatic and nonadiabatic numerical calculations on the relaxation dynamics of the spin-boson model show that the quantum-classical Nose-Hoover chain dynamics represents the thermal noise of the bath in an accurate and simple way. Numerical comparisons, both with the constant-energy calculation and with the quantum-classical Brownian motion treatment of the bath, show that the quantum-classical Nose-Hoover chain dynamics can be used to introduce dissipation in the evolution of a quantum subsystem even with just one degree of freedom for the bath. The algorithm can be computationally advantageous in modelling, within computer simulation, the dynamics of a quantum subsystem interacting with complex molecular environments. (fast track communication)

  14. Adiabatic Cooling for Rovibrational Spectroscopy of Molecular Ions

    DEFF Research Database (Denmark)

    Fisher, Karin

    2017-01-01

    The field of cold molecular ions is a fast growing one, with applications in high resolution spectroscopy and metrology, the search for time variations of fundamental constants, cold chemistry and collisions, and quantum information processing, to name a few. The study of single molecular ions...... is attractive as it enables one to push the limits of spectroscopic accuracy. Non-destructive spectroscopic detection of molecular ions can be achieved by co-trapping with an easier to detect atomic ion. The ion chain has coupled motion, and transitions which change both the internal and motional states...... to the measured heating rates, almost perfectly fitting existing heating rate theory. Further, the same model successfully predicted the heating rates of the in-phase mode of a two-ion crystal, indicating that we can use it to predict the heating rates in experiments on molecule-atom chains. Adiabatic cooling...

  15. Adiabatic photo-steering theory in topological insulators

    International Nuclear Information System (INIS)

    Inoue, Jun-ichi

    2014-01-01

    Feasible external control of material properties is a crucial issue in condensed matter physics. A new approach to achieving this aim, named adiabatic photo-steering, is reviewed. The core principle of this scheme is that several material constants are effectively turned into externally tunable variables by irradiation of monochromatic laser light. Two-dimensional topological insulators are selected as the optimal systems that exhibit a prominent change in their properties following the application of this method. Two specific examples of photo-steered quantum phenomena, which reflect topological aspects of the electronic systems at hand, are presented. One is the integer quantum Hall effect described by the Haldane model, and the other is the quantum spin Hall effect described by the Kane–Mele model. The topological quantities associated with these phenomena are the conventional Chern number and spin Chern number, respectively. A recent interesting idea, time-reversal symmetry breaking via a temporary periodic external stimulation, is also discussed. (focus issue review)

  16. Nonadiabatic exchange dynamics during adiabatic frequency sweeps.

    Science.gov (United States)

    Barbara, Thomas M

    2016-04-01

    A Bloch equation analysis that includes relaxation and exchange effects during an adiabatic frequency swept pulse is presented. For a large class of sweeps, relaxation can be incorporated using simple first order perturbation theory. For anisochronous exchange, new expressions are derived for exchange augmented rotating frame relaxation. For isochronous exchange between sites with distinct relaxation rate constants outside the extreme narrowing limit, simple criteria for adiabatic exchange are derived and demonstrate that frequency sweeps commonly in use may not be adiabatic with regard to exchange unless the exchange rates are much larger than the relaxation rates. Otherwise, accurate assessment of the sensitivity to exchange dynamics will require numerical integration of the rate equations. Examples of this situation are given for experimentally relevant parameters believed to hold for in-vivo tissue. These results are of significance in the study of exchange induced contrast in magnetic resonance imaging. Copyright © 2016 Elsevier Inc. All rights reserved.

  17. Experimental study on the adiabatic shear bands

    International Nuclear Information System (INIS)

    Affouard, J.

    1984-07-01

    Four martensitic steels (Z50CDV5 steel, 28CND8 steel, 35NCDV16 steel and 4340 steel) with different hardness between 190 and 600 Hsub(B) (Brinell hardness), have been studied by means of dynamic compressive tests on split Hopkinson pressure bar. Microscopic observations show that the fracture are associated to the development of adiabatic shear bands (except 4340 steel with 190 Hsub(B) hardness). By means of tests for which the deformation is stopped at predetermined levels, the measurement of shear and hardness inside the band and the matrix indicates the chronology of this phenomenon: first the localization of shear, followed by the formation of adiabatic shear band and ultimatly crack initiation and propagation. These results correlated with few simulations by finite elements have permitted to suggest two mecanisms of deformation leading to the formation of adiabatic shear bands in this specific test [fr

  18. Adiabatic supernova expansion into the circumstellar medium

    International Nuclear Information System (INIS)

    Band, D.L.; Liang, E.P.

    1987-01-01

    We perform one dimensional numerical simulations with a Lagrangian hydrodynamics code of the adiabatic expansion of a supernova into the surrounding medium. The early expansion follows Chevalier's analytic self-similar solution until the reverse shock reaches the ejecta core. We follow the expansion as it evolves towards the adiabatic blast wave phase. Some memory of the earlier phases of expansion is retained in the interior even when the outer regions expand as a blast wave. We find the results are sensitive to the initial configuration of the ejecta and to the placement of gridpoints. 6 refs., 2 figs

  19. Collapse and equilibrium of rotating, adiabatic clouds

    International Nuclear Information System (INIS)

    Boss, A.P.

    1980-01-01

    A numerical hydrodynamics computer code has been used to follow the collapse and establishment of equilibrium of adiabatic gas clouds restricted to axial symmetry. The clouds are initially uniform in density and rotation, with adiabatic exponents γ=5/3 and 7/5. The numerical technique allows, for the first time, a direct comparison to be made between the dynamic collapse and approach to equilibrium of unconstrained clouds on the one hand, and the results for incompressible, uniformly rotating equilibrium clouds, and the equilibrium structures of differentially rotating polytropes, on the other hand

  20. Quantum Statistical Mechanics on a Quantum Computer

    OpenAIRE

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

    1999-01-01

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

  1. Pre-History Of The Concepts Underlying Stimulated Raman Adiabatic Passage (STIRAP)

    International Nuclear Information System (INIS)

    Shore, B.W.

    2013-01-01

    This tutorial review discusses some of the work that preceded development, twenty-five years ago, of the stimulated Raman adiabatic passage (STIRAP) technique, now widely used in the controlled coherent dynamics of three-state systems, noting how the use of time-dependent adiabatically-evolving population-trapping dark states made possible the robust and highly-efficient population transfer between quantum states that first popularized STIRAP. Preceding the history discussion is a tutorial definition of STIRAP and its necessary and sufficient ingredients — understanding that has led to applications well beyond those of the original quantum systems. This review also discusses the relationship between STIRAP and two related procedures: chirped Raman adiabatic passage (RCAP or CHIRAP) and electromagnetically induced transparency (EIT) with slow and captured light. It concludes with a brief discussion of ways in which contemporary STIRAP has extended the original concept and enlarged the definition, beyond that of simple quantum systems to classical macroscopic devices. Appendices offer further details. The presentation emphasizes theory but with illustrations of experimental results. (author)

  2. Constructing quantum dynamics from mixed quantum-classical descriptions

    International Nuclear Information System (INIS)

    Barsegov, V.; Rossky, P.J.

    2004-01-01

    The influence of quantum bath effects on the dynamics of a quantum two-level system linearly coupled to a harmonic bath is studied when the coupling is both diagonal and off-diagonal. It is shown that the pure dephasing kernel and the non-adiabatic quantum transition rate between Born-Oppenheimer states of the subsystem can be decomposed into a contribution from thermally excited bath modes plus a zero point energy contribution. This quantum rate can be modewise factorized exactly into a product of a mixed quantum subsystem-classical bath transition rate and a quantum correction factor. This factor determines dynamics of quantum bath correlations. Quantum bath corrections to both the transition rate and the pure dephasing kernel are shown to be readily evaluated via a mixed quantum-classical simulation. Hence, quantum dynamics can be recovered from a mixed quantum-classical counterpart by incorporating the missing quantum bath corrections. Within a mixed quantum-classical framework, a simple approach for evaluating quantum bath corrections in calculation of the non-adiabatic transition rate is presented

  3. Pulsed adiabatic structure and complete population transfer

    International Nuclear Information System (INIS)

    Shore, B.W.

    1992-10-01

    Population can be transferred between atomic or molecular energy states in a variety of ways. The basic idea of adiabatic transfer, discussed in many textbooks, is as follows. One begins with an atom that is in some single energy state (an eigenstate of an initial Hamiltonian). This energy state is one of many possible states, known variously as the unperturbed states or basis states or diabatic states. Next one begins to change the Hamiltonian very slowly. The changes may occur in either the diagonal elements (the basis state energies) or in the off-diagonal elements (interactions between basis states). If there are off-diagonal elements then the Hamiltonian will no longer commute with the original one. Because the Hamiltonian is no longer the one that was used to define the original basis states, it will cause these states to become mixed. However, if the change is sufficiently slow, the system can remain in a single eigenstate of the changing Hamiltonian -- an adiabatic state, composed of a combination of basis states. Finally, at some later time, one examines the system once again in the original basis. One finds that the population has undergone a change, and now resides in a different unperturbed state. One has produced population transfer. There are many illustrative examples of adiabatic passage, both theory and experiment. The author mentions briefly two common examples, inelastic collisions between atoms, and the static Stark effect in Rydberg atoms, before continuing with the main objective, a discussion of adiabatic passage induced by laser pulses

  4. Semi adiabatic theory of seasonal Markov processes

    Energy Technology Data Exchange (ETDEWEB)

    Talkner, P [Paul Scherrer Inst. (PSI), Villigen (Switzerland)

    1999-08-01

    The dynamics of many natural and technical systems are essentially influenced by a periodic forcing. Analytic solutions of the equations of motion for periodically driven systems are generally not known. Simulations, numerical solutions or in some limiting cases approximate analytic solutions represent the known approaches to study the dynamics of such systems. Besides the regime of weak periodic forces where linear response theory works, the limit of a slow driving force can often be treated analytically using an adiabatic approximation. For this approximation to hold all intrinsic processes must be fast on the time-scale of a period of the external driving force. We developed a perturbation theory for periodically driven Markovian systems that covers the adiabatic regime but also works if the system has a single slow mode that may even be slower than the driving force. We call it the semi adiabatic approximation. Some results of this approximation for a system exhibiting stochastic resonance which usually takes place within the semi adiabatic regime are indicated. (author) 1 fig., 8 refs.

  5. Post-adiabatic analysis of atomic collisions

    International Nuclear Information System (INIS)

    Klar, H.; Fano, U.

    1976-01-01

    The coupling between adiabatic channels can be partially transformed away. The transformation need not induce any transition between channnels; but it correlates the radial wave functions and their gradients with the channel functions and it depresses the lower effective potentials, as the energy increases, in accordance with empirical evidence

  6. Connection between adiabaticity and the mirror mode

    International Nuclear Information System (INIS)

    Cohen, R.H.

    1976-01-01

    The size of magnetic moment jumps of a particle in a long, thin equilibrium magnetic mirror field is shown to be related to the complex zeroes of the mirror mode parameter B + 4πdP/sub perpendicular//dB. A consequence is that adiabaticity places a lower limit on β than does the mirror mode

  7. Improving the positive feedback adiabatic logic familiy

    Directory of Open Access Journals (Sweden)

    J. Fischer

    2004-01-01

    Full Text Available Positive Feedback Adiabatic Logic (PFAL shows the lowest energy dissipation among adiabatic logic families based on cross-coupled transistors, due to the reduction of both adiabatic and non-adiabatic losses. The dissipation primarily depends on the resistance of the charging path, which consists of a single p-channel MOSFET during the recovery phase. In this paper, a new logic family called Improved PFAL (IPFAL is proposed, where all n- and pchannel devices are swapped so that the charge can be recovered through an n-channel MOSFET. This allows to decrease the resistance of the charging path up to a factor of 2, and it enables a significant reduction of the energy dissipation. Simulations based on a 0.13µm CMOS process confirm the improvements in terms of power consumption over a large frequency range. However, the same simple design rule, which enables in PFAL an additional reduction of the dissipation by optimal transistor sizing, does not apply to IPFAL. Therefore, the influence of several sources of dissipation for a generic IPFAL gate is illustrated and discussed, in order to lower the power consumption and achieve better performance.

  8. Adiabatic burst evaporation from bicontinuous nanoporous membranes

    Science.gov (United States)

    Ichilmann, Sachar; Rücker, Kerstin; Haase, Markus; Enke, Dirk

    2015-01-01

    Evaporation of volatile liquids from nanoporous media with bicontinuous morphology and pore diameters of a few 10 nm is an ubiquitous process. For example, such drying processes occur during syntheses of nanoporous materials by sol–gel chemistry or by spinodal decomposition in the presence of solvents as well as during solution impregnation of nanoporous hosts with functional guests. It is commonly assumed that drying is endothermic and driven by non-equilibrium partial pressures of the evaporating species in the gas phase. We show that nearly half of the liquid evaporates in an adiabatic mode involving burst-like liquid-to-gas conversions. During single adiabatic burst evaporation events liquid volumes of up to 107 μm3 are converted to gas. The adiabatic liquid-to-gas conversions occur if air invasion fronts get unstable because of the built-up of high capillary pressures. Adiabatic evaporation bursts propagate avalanche-like through the nanopore systems until the air invasion fronts have reached new stable configurations. Adiabatic cavitation bursts thus compete with Haines jumps involving air invasion front relaxation by local liquid flow without enhanced mass transport out of the nanoporous medium and prevail if the mean pore diameter is in the range of a few 10 nm. The results reported here may help optimize membrane preparation via solvent-based approaches, solution-loading of nanopore systems with guest materials as well as routine use of nanoporous membranes with bicontinuous morphology and may contribute to better understanding of adsorption/desorption processes in nanoporous media. PMID:25926406

  9. Non-stoquastic Hamiltonians in quantum annealing via geometric phases

    Science.gov (United States)

    Vinci, Walter; Lidar, Daniel A.

    2017-09-01

    We argue that a complete description of quantum annealing implemented with continuous variables must take into account the non-adiabatic Aharonov-Anandan geometric phase that arises when the system Hamiltonian changes during the anneal. We show that this geometric effect leads to the appearance of non-stoquasticity in the effective quantum Ising Hamiltonians that are typically used to describe quantum annealing with flux qubits. We explicitly demonstrate the effect of this geometric non-stoquasticity when quantum annealing is performed with a system of one and two coupled flux qubits. The realization of non-stoquastic Hamiltonians has important implications from a computational complexity perspective, since it is believed that in many cases quantum annealing with stoquastic Hamiltonians can be efficiently simulated via classical algorithms such as Quantum Monte Carlo. It is well known that the direct implementation of non-stoquastic Hamiltonians with flux qubits is particularly challenging. Our results suggest an alternative path for the implementation of non-stoquasticity via geometric phases that can be exploited for computational purposes.

  10. A many-particle adiabatic invariant of strongly magnetized pure electron plasmas

    International Nuclear Information System (INIS)

    Hjorth, P.G.

    1988-01-01

    A pure electron plasma is said to be strongly magnetized if the cyclotron radius of the electrons is much smaller than the classical distance of closest approach. In this parameter regime a many-particle adiabatic invariant constrains the collisional dynamics. For the case of a uniform magnetic field, the adiabatic invariant is the total kinetic energy associated with the electron velocity components that are perpendicular to the magnetic field (i.e., Σ j mv 2 j perpendicular/2). Were the adiabatic invariant an exact constant of the motion, no exchange of energy would be possible between the parallel and the perpendicular degrees of freedom, and the plasma could develop and maintain two different temperatures T parallel and T perpendicular. An adiabatic invariant, however, is not strictly conserved. In the present case, each collision produces an exponentially small exchange of energy between the parallel and the perpendicular degrees of freedom, and these act cumulatively in such a way that T parallel and T perpendicular eventually relax to a common value. The rate of equilibrium is calculated, both in the case where the collisions are described by classical mechanics and in the case where the collisions are described by quantum mechanics, the two calculations giving essentially the same result. A molecular dynamics simulation has been carried out, verifying the existence of this unusual invariant, and verifying the theoretically predicted rate equation

  11. Matching-pursuit/split-operator Fourier-transform simulations of nonadiabatic quantum dynamics

    Science.gov (United States)

    Wu, Yinghua; Herman, Michael F.; Batista, Victor S.

    2005-03-01

    A rigorous and practical approach for simulations of nonadiabatic quantum dynamics is introduced. The algorithm involves a natural extension of the matching-pursuit/split-operator Fourier-transform (MP/SOFT) method [Y. Wu and V. S. Batista, J. Chem. Phys. 121, 1676 (2004)] recently developed for simulations of adiabatic quantum dynamics in multidimensional systems. The MP/SOFT propagation scheme, extended to nonadiabatic dynamics, recursively applies the time-evolution operator as defined by the standard perturbation expansion to first-, or second-order, accuracy. The expansion is implemented in dynamically adaptive coherent-state representations, generated by an approach that combines the matching-pursuit algorithm with a gradient-based optimization method. The accuracy and efficiency of the resulting propagation method are demonstrated as applied to the canonical model systems introduced by Tully for testing simulations of dual curve-crossing nonadiabatic dynamics.

  12. Matchgate circuits and compressed quantum computation

    International Nuclear Information System (INIS)

    Boyajian, W.L.

    2015-01-01

    exact diagonal- ization. In Part II, we deal with the compressed way of quantum computation mentioned above, used to simulate physically interesting behaviours of large systems. To give an example, consider an experimental set–up, where up to 8 qubits can be well controlled. Such a set–up can be used to simulate certain interactions of 2 8 = 256 qubits. In [Boyajian et al. (2013)], we generalised the results from [Kraus (2011)], and demonstrated how the adiabatic evolution of the 1D XY-model can be simulated via an exponentially smaller quantum system. More precisely, it is shown there, how the phase transition of such a model of a spin chain consisting out of n qubits can be observed via a compressed algorithm processing only log( n ) qubits. The feasibility of such a compressed quantum simulation is due to the fact that the adiabatic evolution and the measurement of the magnetization employed to observe the phase transition can be described by a matchgate circuit. Remarkably, the number of elementary gates, i.e. the number of single and two-qubit gates which are required to implement the compressed simulation can be even smaller than required to implement the original matchgate circuit. This compressed algorithm has already been experimentally realized using NMR quantum computing [Li et al. (2014)]. In [Boyajian et al. (2013)] we showed that not only the quantum phase transition can be observed in this way, but that various other interesting processes, such as quantum quenching, where the evolution is non–adiabatic, and general time evolutions can be simulated with an exponentially smaller system. In Part II, we also recall the results from [Boyajian and Kraus (2015)] where we extend the notion of compressed quantum simulation even further. We consider the XY-model and derive compressed circuits to simulate the behavior of the thermal and any excited state of the system. To this end, we use the diagonalization of the XY-Hamiltonian presented in[ Verstraete et al

  13. Quantum bus of metal nanoring with surface plasmon polaritons

    International Nuclear Information System (INIS)

    Lin Zhirong; Guo Guoping; Tu Tao; Li Haiou; Zou Changling; Ren Xifeng; Guo Guangcan; Chen Junxue; Lu Yonghua

    2010-01-01

    We develop an architecture for distributed quantum computation using quantum bus of plasmonic circuits and spin qubits in self-assembled quantum dots. Deterministic quantum gates between two distant spin qubits can be reached by using an adiabatic approach in which quantum dots couple with highly detuned plasmon modes in a metallic nanoring. Plasmonic quantum bus offers a robust and scalable platform for quantum optics experiments and the development of on-chip quantum networks composed of various quantum nodes, such as quantum dots, molecules, and nanoparticles.

  14. Non-adiabatic perturbations in multi-component perfect fluids

    Energy Technology Data Exchange (ETDEWEB)

    Koshelev, N.A., E-mail: koshna71@inbox.ru [Ulyanovsk State University, Leo Tolstoy str 42, 432970 (Russian Federation)

    2011-04-01

    The evolution of non-adiabatic perturbations in models with multiple coupled perfect fluids with non-adiabatic sound speed is considered. Instead of splitting the entropy perturbation into relative and intrinsic parts, we introduce a set of symmetric quantities, which also govern the non-adiabatic pressure perturbation in models with energy transfer. We write the gauge invariant equations for the variables that determine on a large scale the non-adiabatic pressure perturbation and the rate of changes of the comoving curvature perturbation. The analysis of evolution of the non-adiabatic pressure perturbation has been made for several particular models.

  15. Non-adiabatic perturbations in multi-component perfect fluids

    International Nuclear Information System (INIS)

    Koshelev, N.A.

    2011-01-01

    The evolution of non-adiabatic perturbations in models with multiple coupled perfect fluids with non-adiabatic sound speed is considered. Instead of splitting the entropy perturbation into relative and intrinsic parts, we introduce a set of symmetric quantities, which also govern the non-adiabatic pressure perturbation in models with energy transfer. We write the gauge invariant equations for the variables that determine on a large scale the non-adiabatic pressure perturbation and the rate of changes of the comoving curvature perturbation. The analysis of evolution of the non-adiabatic pressure perturbation has been made for several particular models

  16. Zero-point energy, tunnelling, and vibrational adiabaticity in the Mu + H2 reaction

    Science.gov (United States)

    Mielke, Steven L.; Garrett, Bruce C.; Fleming, Donald G.; Truhlar, Donald G.

    2015-01-01

    Isotopic substitution of muonium for hydrogen provides an unparalleled opportunity to deepen our understanding of quantum mass effects on chemical reactions. A recent topical review in this journal of the thermal and vibrationally state-selected reaction of Mu with H2 raises a number of issues that are addressed here. We show that some earlier quantum mechanical calculations of the Mu + H2 reaction, which are highlighted in this review, and which have been used to benchmark approximate methods, are in error by as much as 19% in the low-temperature limit. We demonstrate that an approximate treatment of the Born-Oppenheimer diagonal correction that was used in some recent studies is not valid for treating the vibrationally state-selected reaction. We also discuss why vibrationally adiabatic potentials that neglect bend zero-point energy are not a useful analytical tool for understanding reaction rates, and why vibrationally non-adiabatic transitions cannot be understood by considering tunnelling through vibrationally adiabatic potentials. Finally, we present calculations on a hierarchical family of potential energy surfaces to assess the sensitivity of rate constants to the quality of the potential surface.

  17. ADIABATIC HEATING OF CONTRACTING TURBULENT FLUIDS

    International Nuclear Information System (INIS)

    Robertson, Brant; Goldreich, Peter

    2012-01-01

    Turbulence influences the behavior of many astrophysical systems, frequently by providing non-thermal pressure support through random bulk motions. Although turbulence is commonly studied in systems with constant volume and mean density, turbulent astrophysical gases often expand or contract under the influence of pressure or gravity. Here, we examine the behavior of turbulence in contracting volumes using idealized models of compressed gases. Employing numerical simulations and an analytical model, we identify a simple mechanism by which the turbulent motions of contracting gases 'adiabatically heat', experiencing an increase in their random bulk velocities until the largest eddies in the gas circulate over a Hubble time of the contraction. Adiabatic heating provides a mechanism for sustaining turbulence in gases where no large-scale driving exists. We describe this mechanism in detail and discuss some potential applications to turbulence in astrophysical settings.

  18. Adiabatic invariance with first integrals of motion

    Science.gov (United States)

    Adib, Artur B.

    2002-10-01

    The construction of a microthermodynamic formalism for isolated systems based on the concept of adiabatic invariance is an old but seldom appreciated effort in the literature, dating back at least to P. Hertz [Ann. Phys. (Leipzig) 33, 225 (1910)]. An apparently independent extension of such formalism for systems bearing additional first integrals of motion was recently proposed by Hans H. Rugh [Phys. Rev. E 64, 055101 (2001)], establishing the concept of adiabatic invariance even in such singular cases. After some remarks in connection with the formalism pioneered by Hertz, it will be suggested that such an extension can incidentally explain the success of a dynamical method for computing the entropy of classical interacting fluids, at least in some potential applications where the presence of additional first integrals cannot be ignored.

  19. Change of adiabatic invariant near the separatrix

    International Nuclear Information System (INIS)

    Bulanov, S.V.

    1995-10-01

    The properties of particle motion in the vicinity of the separatrix in a phase plane are investigated. The change of adiabatic invariant value due to the separatrix crossing is evaluated as a function of a perturbation parameter magnitude and a phase of a particle for time dependent Hamiltonians. It is demonstrated that the change of adiabatic invariant value near the separatrix birth is much larger than that in the case of the separatrix crossing near the saddle point in a phase plane. The conditions of a stochastic regime to appear around the separatrix are found. The results are applied to study the longitudinal invariant behaviour of charged particles near singular lines of the magnetic field. (author). 22 refs, 9 figs

  20. Exotic quantum holonomy and higher-order exceptional points in quantum kicked tops.

    Science.gov (United States)

    Tanaka, Atushi; Kim, Sang Wook; Cheon, Taksu

    2014-04-01

    The correspondence between exotic quantum holonomy, which occurs in families of Hermitian cycles, and exceptional points (EPs) for non-Hermitian quantum theory is examined in quantum kicked tops. Under a suitable condition, an explicit expression of the adiabatic parameter dependencies of quasienergies and stationary states, which exhibit anholonomies, is obtained. It is also shown that the quantum kicked tops with the complexified adiabatic parameter have a higher-order EP, which is broken into lower-order EPs with the application of small perturbations. The stability of exotic holonomy against such bifurcation is demonstrated.

  1. Adiabatic state preparation study of methylene

    Czech Academy of Sciences Publication Activity Database

    Veis, Libor; Pittner, Jiří

    2014-01-01

    Roč. 140, č. 21 (2014), 214111 ISSN 0021-9606 R&D Projects: GA ČR GA203/08/0626 Institutional support: RVO:61388955 Keywords : Quantum computers * Quantum chemistry * Quantum electronics Subject RIV: CF - Physical ; Theoretical Chemistry Impact factor: 2.952, year: 2014

  2. Certainty and Uncertainty in Quantum Information Processing

    OpenAIRE

    Rieffel, Eleanor G.

    2007-01-01

    This survey, aimed at information processing researchers, highlights intriguing but lesser known results, corrects misconceptions, and suggests research areas. Themes include: certainty in quantum algorithms; the "fewer worlds" theory of quantum mechanics; quantum learning; probability theory versus quantum mechanics.

  3. Quantum chemistry on a superconducting quantum processor

    Energy Technology Data Exchange (ETDEWEB)

    Kaicher, Michael P.; Wilhelm, Frank K. [Theoretical Physics, Saarland University, 66123 Saarbruecken (Germany); Love, Peter J. [Department of Physics and Astronomy, Tufts University, Medford, MA 02155 (United States)

    2016-07-01

    Quantum chemistry is the most promising civilian application for quantum processors to date. We study its adaptation to superconducting (sc) quantum systems, computing the ground state energy of LiH through a variational hybrid quantum classical algorithm. We demonstrate how interactions native to sc qubits further reduce the amount of quantum resources needed, pushing sc architectures as a near-term candidate for simulations of more complex atoms/molecules.

  4. High-fidelity adiabatic inversion of a {sup 31}P electron spin qubit in natural silicon

    Energy Technology Data Exchange (ETDEWEB)

    Laucht, Arne, E-mail: a.laucht@unsw.edu.au; Kalra, Rachpon; Muhonen, Juha T.; Dehollain, Juan P.; Mohiyaddin, Fahd A.; Hudson, Fay; Dzurak, Andrew S.; Morello, Andrea [Centre for Quantum Computation and Communication Technology, School of Electrical Engineering and Telecommunications, University of New South Wales, Sydney, New South Wales 2052 (Australia); McCallum, Jeffrey C.; Jamieson, David N. [Centre for Quantum Computation and Communication Technology, School of Physics, University of Melbourne, Melbourne, Victoria 3010 (Australia)

    2014-03-03

    The main limitation to the high-fidelity quantum control of spins in semiconductors is the presence of strongly fluctuating fields arising from the nuclear spin bath of the host material. We demonstrate here a substantial improvement in single-qubit inversion fidelities for an electron spin qubit bound to a {sup 31}P atom in natural silicon, by applying adiabatic sweeps instead of narrow-band pulses. We achieve an inversion fidelity of 97%, and we observe signatures in the spin resonance spectra and the spin coherence time that are consistent with the presence of an additional exchange-coupled donor. This work highlights the effectiveness of simple adiabatic inversion techniques for spin control in fluctuating environments.

  5. Research progress on quantum informatics and quantum computation

    Science.gov (United States)

    Zhao, Yusheng

    2018-03-01

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

  6. Equivariant quantum Schubert calculus

    OpenAIRE

    Mihalcea, Leonardo Constantin

    2006-01-01

    We study the T-equivariant quantum cohomology of the Grassmannian. We prove the vanishing of a certain class of equivariant quantum Littlewood-Richardson coefficients, which implies an equivariant quantum Pieri rule. As in the equivariant case, this implies an algorithm to compute the equivariant quantum Littlewood-Richardson coefficients.

  7. Single-server blind quantum computation with quantum circuit model

    Science.gov (United States)

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

    2018-06-01

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

  8. Introduction to quantum information science

    Energy Technology Data Exchange (ETDEWEB)

    Hayashi, Masahito [Nagoya Univ. (Japan). Graduate School of Mathematics; Ishizaka, Satoshi [Hiroshima Univ., Higashi-Hiroshima (Japan). Graduate School of Integrated Arts and Sciences; Kawachi, Akinori [Tokyo Institute of Technology (Japan). Dept. of Mathematical and Computing Sciences; Kimura, Gen [Shibaura Institute of Technology, Saitama (Japan). College of Systems Engineering and Science; Ogawa, Tomohiro [Univ. of Electro-Communications, Tokyo (Japan). Graduate School of Information Systems

    2015-04-01

    Presents the mathematical foundation for quantum information in a very didactic way. Summarizes all required mathematical knowledge in linear algebra. Supports teaching and learning with more than 100 exercises with solutions. Includes brief descriptions to recent results with references. This book presents the basics of quantum information, e.g., foundation of quantum theory, quantum algorithms, quantum entanglement, quantum entropies, quantum coding, quantum error correction and quantum cryptography. The required knowledge is only elementary calculus and linear algebra. This way the book can be understood by undergraduate students. In order to study quantum information, one usually has to study the foundation of quantum theory. This book describes it from more an operational viewpoint which is suitable for quantum information while traditional textbooks of quantum theory lack this viewpoint. The current book bases on Shor's algorithm, Grover's algorithm, Deutsch-Jozsa's algorithm as basic algorithms. To treat several topics in quantum information, this book covers several kinds of information quantities in quantum systems including von Neumann entropy. The limits of several kinds of quantum information processing are given. As important quantum protocols,this book contains quantum teleportation, quantum dense coding, quantum data compression. In particular conversion theory of entanglement via local operation and classical communication are treated too. This theory provides the quantification of entanglement, which coincides with von Neumann entropy. The next part treats the quantum hypothesis testing. The decision problem of two candidates of the unknown state are given. The asymptotic performance of this problem is characterized by information quantities. Using this result, the optimal performance of classical information transmission via noisy quantum channel is derived. Quantum information transmission via noisy quantum channel by quantum error

  9. Introduction to quantum information science

    International Nuclear Information System (INIS)

    Hayashi, Masahito; Ishizaka, Satoshi; Kawachi, Akinori; Kimura, Gen; Ogawa, Tomohiro

    2015-01-01

    Presents the mathematical foundation for quantum information in a very didactic way. Summarizes all required mathematical knowledge in linear algebra. Supports teaching and learning with more than 100 exercises with solutions. Includes brief descriptions to recent results with references. This book presents the basics of quantum information, e.g., foundation of quantum theory, quantum algorithms, quantum entanglement, quantum entropies, quantum coding, quantum error correction and quantum cryptography. The required knowledge is only elementary calculus and linear algebra. This way the book can be understood by undergraduate students. In order to study quantum information, one usually has to study the foundation of quantum theory. This book describes it from more an operational viewpoint which is suitable for quantum information while traditional textbooks of quantum theory lack this viewpoint. The current book bases on Shor's algorithm, Grover's algorithm, Deutsch-Jozsa's algorithm as basic algorithms. To treat several topics in quantum information, this book covers several kinds of information quantities in quantum systems including von Neumann entropy. The limits of several kinds of quantum information processing are given. As important quantum protocols,this book contains quantum teleportation, quantum dense coding, quantum data compression. In particular conversion theory of entanglement via local operation and classical communication are treated too. This theory provides the quantification of entanglement, which coincides with von Neumann entropy. The next part treats the quantum hypothesis testing. The decision problem of two candidates of the unknown state are given. The asymptotic performance of this problem is characterized by information quantities. Using this result, the optimal performance of classical information transmission via noisy quantum channel is derived. Quantum information transmission via noisy quantum channel by quantum error correction are

  10. Exploring Do-It-Yourself Approaches in Computational Quantum Chemistry: The Pedagogical Benefits of the Classical Boys Algorithm

    Science.gov (United States)

    Orsini, Gabriele

    2015-01-01

    The ever-increasing impact of molecular quantum calculations over chemical sciences implies a strong and urgent need for the elaboration of proper teaching strategies in university curricula. In such perspective, this paper proposes an extensive project for a student-driven, cooperative, from-scratch implementation of a general Hartree-Fock…

  11. Superadiabatic holonomic quantum computation in cavity QED

    Science.gov (United States)

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

    2017-06-01

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

  12. Blind Quantum Signature with Blind Quantum Computation

    Science.gov (United States)

    Li, Wei; Shi, Ronghua; Guo, Ying

    2017-04-01

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

  13. Path integral density matrix dynamics: A method for calculating time-dependent properties in thermal adiabatic and non-adiabatic systems

    International Nuclear Information System (INIS)

    Habershon, Scott

    2013-01-01

    We introduce a new approach for calculating quantum time-correlation functions and time-dependent expectation values in many-body thermal systems; both electronically adiabatic and non-adiabatic cases can be treated. Our approach uses a path integral simulation to sample an initial thermal density matrix; subsequent evolution of this density matrix is equivalent to solution of the time-dependent Schrödinger equation, which we perform using a linear expansion of Gaussian wavepacket basis functions which evolve according to simple classical-like trajectories. Overall, this methodology represents a formally exact approach for calculating time-dependent quantum properties; by introducing approximations into both the imaginary-time and real-time propagations, this approach can be adapted for complex many-particle systems interacting through arbitrary potentials. We demonstrate this method for the spin Boson model, where we find good agreement with numerically exact calculations. We also discuss future directions of improvement for our approach with a view to improving accuracy and efficiency

  14. Path integral density matrix dynamics: a method for calculating time-dependent properties in thermal adiabatic and non-adiabatic systems.

    Science.gov (United States)

    Habershon, Scott

    2013-09-14

    We introduce a new approach for calculating quantum time-correlation functions and time-dependent expectation values in many-body thermal systems; both electronically adiabatic and non-adiabatic cases can be treated. Our approach uses a path integral simulation to sample an initial thermal density matrix; subsequent evolution of this density matrix is equivalent to solution of the time-dependent Schrödinger equation, which we perform using a linear expansion of Gaussian wavepacket basis functions which evolve according to simple classical-like trajectories. Overall, this methodology represents a formally exact approach for calculating time-dependent quantum properties; by introducing approximations into both the imaginary-time and real-time propagations, this approach can be adapted for complex many-particle systems interacting through arbitrary potentials. We demonstrate this method for the spin Boson model, where we find good agreement with numerically exact calculations. We also discuss future directions of improvement for our approach with a view to improving accuracy and efficiency.

  15. Photoionization by a bichromatic field: Adiabatic theory

    International Nuclear Information System (INIS)

    Pazdzersky, V.A.; Yurovsky, V.A.

    1995-01-01

    Atom photoionization by the superposition of a fundamental field and its second harmonic is considered. The finite analytical expressions for the photoionization probability are obtained using the adiabatic approximation. They demonstrate that the photoelectron angular distribution has a polar symmetry when the electrical field strength has a maximal polar asymmetry and the distribution is asymmetrical when the field is symmetrical. A strict proof of the polar symmetry of the photoionization probability in the case of the electrical field with maximal asymmetry is deduced using the Keldysh-Faisal-Reiss theories. The obtained results are in agreement with the experimental data available

  16. Neutron generator based on adiabatic trap

    International Nuclear Information System (INIS)

    Golovin, I.N.; Zhil'tsov, V.A.; Panov, D.A.; Skovoroda, A.A.; Shatalov, G.E.; Shcherbakov, A.G.

    1988-01-01

    A possibility of 14 MeV neutron generator (NG) production on the basis of axial-symmetric adiabatic trap with MHD cusped armature for the testing of materials and elements of the DT reactor first wall and blanket structure is discussed. General requirements to NG are formulated. It is shown that the NG variant discussed meets the requirements formulated. Approximate calculation of the NG parameters has shown that total energy consumption by the generator does not exceed 220 MW at neutron flux specific capacity of 2.5 MW/m 2 and radiation test area of 5-6 m 2

  17. Phase avalanches in near-adiabatic evolutions

    International Nuclear Information System (INIS)

    Vertesi, T.; Englman, R.

    2006-01-01

    In the course of slow, nearly adiabatic motion of a system, relative changes in the slowness can cause abrupt and high magnitude phase changes, ''phase avalanches,'' superimposed on the ordinary geometric phases. The generality of this effect is examined for arbitrary Hamiltonians and multicomponent (>2) wave packets and is found to be connected (through the Blaschke term in the theory of analytic signals) to amplitude zeros in the lower half of the complex time plane. Motion on a nonmaximal circle on the Poincare-sphere suppresses the effect. A spectroscopic transition experiment can independently verify the phase-avalanche magnitudes

  18. On adiabatic perturbations in the ekpyrotic scenario

    International Nuclear Information System (INIS)

    Linde, A.; Mukhanov, V.; Vikman, A.

    2010-01-01

    In a recent paper, Khoury and Steinhardt proposed a way to generate adiabatic cosmological perturbations with a nearly flat spectrum in a contracting Universe. To produce these perturbations they used a regime in which the equation of state exponentially rapidly changed during a short time interval. Leaving aside the singularity problem and the difficult question about the possibility to transmit these perturbations from a contracting Universe to the expanding phase, we will show that the methods used in Khoury are inapplicable for the description of the cosmological evolution and of the process of generation of perturbations in this scenario

  19. Quantum ensembles of quantum classifiers.

    Science.gov (United States)

    Schuld, Maria; Petruccione, Francesco

    2018-02-09

    Quantum machine learning witnesses an increasing amount of quantum algorithms for data-driven decision making, a problem with potential applications ranging from automated image recognition to medical diagnosis. Many of those algorithms are implementations of quantum classifiers, or models for the classification of data inputs with a quantum computer. Following the success of collective decision making with ensembles in classical machine learning, this paper introduces the concept of quantum ensembles of quantum classifiers. Creating the ensemble corresponds to a state preparation routine, after which the quantum classifiers are evaluated in parallel and their combined decision is accessed by a single-qubit measurement. This framework naturally allows for exponentially large ensembles in which - similar to Bayesian learning - the individual classifiers do not have to be trained. As an example, we analyse an exponentially large quantum ensemble in which each classifier is weighed according to its performance in classifying the training data, leading to new results for quantum as well as classical machine learning.

  20. Adiabatic and non-adiabatic electron oscillations in a static electric field

    International Nuclear Information System (INIS)

    Wahlberg, C.

    1977-03-01

    The influence of a static electric field on the oscillations of a one-dimensional stream of electrons is investigated. In the weak field limit the oscillations are adiabatic and mode coupling negligible, but becomes significant if the field is tronger. The latter effect is believed to be of importance for the stability of e.g. potential double layers

  1. Quantum computing with trapped ions

    International Nuclear Information System (INIS)

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

    2008-01-01

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

  2. Development of a semi-adiabatic isoperibol solution calorimeter.

    Science.gov (United States)

    Venkata Krishnan, R; Jogeswararao, G; Parthasarathy, R; Premalatha, S; Prabhakar Rao, J; Gunasekaran, G; Ananthasivan, K

    2014-12-01

    A semi-adiabatic isoperibol solution calorimeter has been indigenously developed. The measurement system comprises modules for sensitive temperature measurement probe, signal processing, data collection, and joule calibration. The sensitivity of the temperature measurement module was enhanced by using a sensitive thermistor coupled with a lock-in amplifier based signal processor. A microcontroller coordinates the operation and control of these modules. The latter in turn is controlled through personal computer (PC) based custom made software developed with LabView. An innovative summing amplifier concept was used to cancel out the base resistance of the thermistor. The latter was placed in the dewar. The temperature calibration was carried out with a standard platinum resistance (PT100) sensor coupled with an 8½ digit multimeter. The water equivalent of this calorimeter was determined by using electrical calibration with the joule calibrator. The experimentally measured values of the quantum of heat were validated by measuring heats of dissolution of pure KCl (for endotherm) and tris (hydroxyl methyl) amino-methane (for exotherm). The uncertainity in the measurements was found to be within ±3%.

  3. Development of a semi-adiabatic isoperibol solution calorimeter

    International Nuclear Information System (INIS)

    Venkata Krishnan, R.; Jogeswararao, G.; Parthasarathy, R.; Premalatha, S.; Prabhakar Rao, J.; Gunasekaran, G.; Ananthasivan, K.

    2014-01-01

    A semi-adiabatic isoperibol solution calorimeter has been indigenously developed. The measurement system comprises modules for sensitive temperature measurement probe, signal processing, data collection, and joule calibration. The sensitivity of the temperature measurement module was enhanced by using a sensitive thermistor coupled with a lock-in amplifier based signal processor. A microcontroller coordinates the operation and control of these modules. The latter in turn is controlled through personal computer (PC) based custom made software developed with LabView. An innovative summing amplifier concept was used to cancel out the base resistance of the thermistor. The latter was placed in the dewar. The temperature calibration was carried out with a standard platinum resistance (PT100) sensor coupled with an 8½ digit multimeter. The water equivalent of this calorimeter was determined by using electrical calibration with the joule calibrator. The experimentally measured values of the quantum of heat were validated by measuring heats of dissolution of pure KCl (for endotherm) and tris (hydroxyl methyl) amino-methane (for exotherm). The uncertainity in the measurements was found to be within ±3%

  4. Development of a semi-adiabatic isoperibol solution calorimeter

    Energy Technology Data Exchange (ETDEWEB)

    Venkata Krishnan, R.; Jogeswararao, G.; Parthasarathy, R.; Premalatha, S.; Prabhakar Rao, J.; Gunasekaran, G.; Ananthasivan, K., E-mail: asivan@igcar.gov.in [Chemistry Group, Indira Gandhi Centre for Atomic Research, Kalpakkam 603102, Tamilnadu (India)

    2014-12-15

    A semi-adiabatic isoperibol solution calorimeter has been indigenously developed. The measurement system comprises modules for sensitive temperature measurement probe, signal processing, data collection, and joule calibration. The sensitivity of the temperature measurement module was enhanced by using a sensitive thermistor coupled with a lock-in amplifier based signal processor. A microcontroller coordinates the operation and control of these modules. The latter in turn is controlled through personal computer (PC) based custom made software developed with LabView. An innovative summing amplifier concept was used to cancel out the base resistance of the thermistor. The latter was placed in the dewar. The temperature calibration was carried out with a standard platinum resistance (PT100) sensor coupled with an 8½ digit multimeter. The water equivalent of this calorimeter was determined by using electrical calibration with the joule calibrator. The experimentally measured values of the quantum of heat were validated by measuring heats of dissolution of pure KCl (for endotherm) and tris (hydroxyl methyl) amino-methane (for exotherm). The uncertainity in the measurements was found to be within ±3%.

  5. Application of static fuel management codes for determination of the neutron noise using the adiabatic approximation

    International Nuclear Information System (INIS)

    Garis, N.S.; Karlsson, J.K.H.; Pazsit, I.

    2000-01-01

    The neutron noise, induced by a rod manoeuvring experiment in a pressurized water reactor, has been calculated by the incore fuel management code SIMULATE. The space- and frequency-dependent noise in the thermal group was calculated through the adiabatic approximation in three dimensions and two-group theory, with the spatial resolution of the nodal model underlying the SIMULATE algorithm. The calculated spatial noise profiles were interpreted on physical terms. They were also compared with model calculations in a 2-D one-group model, where various approximations as well as the full space-dependent response could be calculated. The adiabatic results obtained with SIMULATE can be regarded as reliable for sub-plateau frequencies (below 0.1 Hz). (orig.) [de

  6. An Adiabatic Phase-Matching Accelerator

    Energy Technology Data Exchange (ETDEWEB)

    Lemery, Francois [DESY; Floettmann, Klaus [DESY; Piot, Philippe [Northern Illinois U.; Kaertner, Franz X. [Hamburg U.; Assmann, Ralph [DESY

    2017-12-22

    We present a general concept to accelerate non-relativistic charged particles. Our concept employs an adiabatically-tapered dielectric-lined waveguide which supports accelerating phase velocities for synchronous acceleration. We propose an ansatz for the transient field equations, show it satisfies Maxwell's equations under an adiabatic approximation and find excellent agreement with a finite-difference time-domain computer simulation. The fields were implemented into the particle-tracking program {\\sc astra} and we present beam dynamics results for an accelerating field with a 1-mm-wavelength and peak electric field of 100~MV/m. The numerical simulations indicate that a $\\sim 200$-keV electron beam can be accelerated to an energy of $\\sim10$~MeV over $\\sim 10$~cm. The novel scheme is also found to form electron beams with parameters of interest to a wide range of applications including, e.g., future advanced accelerators, and ultra-fast electron diffraction.

  7. Genetic algorithms coupled with quantum mechanics for refinement of force fields for RNA simulation: a case study of glycosidic torsions in the canonical ribonucleosides.

    Science.gov (United States)

    Kato, Rodrigo B; Silva, Frederico T; Pappa, Gisele L; Belchior, Jadson C

    2015-01-28

    We report the use of genetic algorithms (GA) as a method to refine force field parameters in order to determine RNA energy. Quantum-mechanical (QM) calculations are carried out for the isolated canonical ribonucleosides (adenosine, guanosine, cytidine and uridine) that are taken as reference data. In this particular study, the dihedral and electrostatic energies are reparametrized in order to test the proposed approach, i.e., GA coupled with QM calculations. Overall, RMSE comparison with recent published results for ribonucleosides energies shows an improvement, on average, of 50%. Finally, the new reparametrized potential energy function is used to determine the spatial structure of RNA (PDB code ) that was not taken into account in the parametrization process. This structure was improved about 82% comparable with previously published results.

  8. Calculation of Photonic decay width for meta-stable muonic symmetric ion in adiabatic representation method

    International Nuclear Information System (INIS)

    Gheisari, R.; Eskandari, M. R.

    2006-01-01

    Meta-stable symmetric ions ppμ * and ddμ * are formed in the collisions of the excited muonic atoms with the hydrogen isotopes. By dissociation of them, the muon transfers from 2s to 1s via the new channels. Considering the quantum electrodynamics field and employing the new wave functions, the matrix elements are simply integrated. In this method using the adiabatic representations, the photo-decay widths for the some of ppμ * and ddμ * states are variationally calculated. The decay rates for X-ray productions of the similar states are approximately same.

  9. Fast quantum search algorithm for databases of arbitrary size and its implementation in a cavity QED system

    International Nuclear Information System (INIS)

    Li, H.Y.; Wu, C.W.; Liu, W.T.; Chen, P.X.; Li, C.Z.

    2011-01-01

    We propose a method for implementing the Grover search algorithm directly in a database containing any number of items based on multi-level systems. Compared with the searching procedure in the database with qubits encoding, our modified algorithm needs fewer iteration steps to find the marked item and uses the carriers of the information more economically. Furthermore, we illustrate how to realize our idea in cavity QED using Zeeman's level structure of atoms. And the numerical simulation under the influence of the cavity and atom decays shows that the scheme could be achieved efficiently within current state-of-the-art technology. -- Highlights: ► A modified Grover algorithm is proposed for searching in an arbitrary dimensional Hilbert space. ► Our modified algorithm requires fewer iteration steps to find the marked item. ► The proposed method uses the carriers of the information more economically. ► A scheme for a six-item Grover search in cavity QED is proposed. ► Numerical simulation under decays shows that the scheme can be achieved with enough fidelity.

  10. Mid-range adiabatic wireless energy transfer via a mediator coil

    International Nuclear Information System (INIS)

    Rangelov, A.A.; Vitanov, N.V.

    2012-01-01

    A technique for efficient mid-range wireless energy transfer between two coils via a mediator coil is proposed. By varying the coil frequencies, three resonances are created: emitter–mediator (EM), mediator–receiver (MR) and emitter–receiver (ER). If the frequency sweeps are adiabatic and such that the EM resonance precedes the MR resonance, the energy flows sequentially along the chain emitter–mediator–receiver. If the MR resonance precedes the EM resonance, then the energy flows directly from the emitter to the receiver via the ER resonance; then the losses from the mediator are suppressed. This technique is robust against noise, resonant constraints and external interferences. - Highlights: ► Efficient and robust mid-range wireless energy transfer via a mediator coil. ► 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.

  11. Modification of optical properties by adiabatic shifting of resonances in a four-level atom

    Science.gov (United States)

    Dutta, Bibhas Kumar; Panchadhyayee, Pradipta

    2018-04-01

    We describe the linear and nonlinear optical properties of a four-level atomic system, after reducing it to an effective two-level atomic model under the condition of adiabatic shifting of resonances driven by two coherent off-resonant fields. The reduced form of the Hamiltonian corresponding to the two-level system is obtained by employing an adiabatic elimination procedure in the rate equations of the probability amplitudes for the proposed four-level model. For a weak probe field operating in the system, the nonlinear dependence of complex susceptibility on the Rabi frequencies and the detuning parameters of the off-resonant driving fields makes it possible to exhibit coherent control of single-photon and two-photon absorption and transparency, the evolution of enhanced Self-Kerr nonlinearity and noticeable dispersive switching. We have shown how the quantum interference results in the generic four-level model at the adiabatic limit. The present scheme describes the appearance of single-photon transparency without invoking any exact two-photon resonance.

  12. Efficient quantum walk on a quantum processor

    Science.gov (United States)

    Qiang, Xiaogang; Loke, Thomas; Montanaro, Ashley; Aungskunsiri, Kanin; Zhou, Xiaoqi; O'Brien, Jeremy L.; Wang, Jingbo B.; Matthews, Jonathan C. F.

    2016-01-01

    The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise, quantum walks have shown much potential as a framework for developing new quantum algorithms. Here we present explicit efficient quantum circuits for implementing continuous-time quantum walks on the circulant class of graphs. These circuits allow us to sample from the output probability distributions of quantum walks on circulant graphs efficiently. We also show that solving the same sampling problem for arbitrary circulant quantum circuits is intractable for a classical computer, assuming conjectures from computational complexity theory. This is a new link between continuous-time quantum walks and computational complexity theory and it indicates a family of tasks that could ultimately demonstrate quantum supremacy over classical computers. As a proof of principle, we experimentally implement the proposed quantum circuit on an example circulant graph using a two-qubit photonics quantum processor. PMID:27146471

  13. Dependence of adiabatic population transfer on pulse profile

    Indian Academy of Sciences (India)

    Control of population transfer by rapid adiabatic passage has been an established technique wherein the exact amplitude profile of the shaped pulse is considered to be insignificant. We study the effect of ultrafast shaped pulses for two-level systems, by density-matrix approach. However, we find that adiabaticity depends ...

  14. Kinetic Theory Derivation of the Adiabatic Law for Ideal Gases.

    Science.gov (United States)

    Sobel, Michael I.

    1980-01-01

    Discusses how the adiabatic law for ideal gases can be derived from the assumption of a Maxwell-Boltzmann (or any other) distribution of velocities--in contrast to the usual derivations from thermodynamics alone, and the higher-order effect that leads to one-body viscosity. An elementary derivation of the adiabatic law is given. (Author/DS)

  15. Teleportation of an Unknown Atomic State via Adiabatic Passage

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    We propose a scheme for teleporting an unknown atomic state via adiabatic passage. Taking advantage of adiabatic passage, the atom has no probability of being excited and thus the atomic spontaneous emission is suppressed.We also show that the fidelity can reach 1 under certain condition.

  16. Adiabatic Compression Sensitivity of AF-M315E

    Science.gov (United States)

    2015-07-01

    Brand for their technical expertise and guidance. He also wishes to thank Mr. Stephen McKim from NASA Goddard Space Flight Center for his assistance...Wilson, D. B., and Stoltzfus, J. M. "Adiabatic Compression of Oxygen: Real Fluid Temperatures," 2000. 10Ismail, I. M. K., and Hawkins , T. W. "Adiabatic

  17. Constraints on the Adiabatic Temperature Change in Magnetocaloric Materials

    DEFF Research Database (Denmark)

    Nielsen, Kaspar Kirstein; Bahl, Christian Robert Haffenden; Smith, Anders

    2010-01-01

    The thermodynamics of the magnetocaloric effect implies constraints on the allowed variation in the adiabatic temperature change for a magnetocaloric material. An inequality for the derivative of the adiabatic temperature change with respect to temperature is derived for both first- and second...

  18. C++QEDv2: The multi-array concept and compile-time algorithms in the definition of composite quantum systems

    Science.gov (United States)

    Vukics, András

    2012-06-01

    C++QED is a versatile framework for simulating open quantum dynamics. It allows to build arbitrarily complex quantum systems from elementary free subsystems and interactions, and simulate their time evolution with the available time-evolution drivers. Through this framework, we introduce a design which should be generic for high-level representations of composite quantum systems. It relies heavily on the object-oriented and generic programming paradigms on one hand, and on the other hand, compile-time algorithms, in particular C++ template-metaprogramming techniques. The core of the design is the data structure which represents the state vectors of composite quantum systems. This data structure models the multi-array concept. The use of template metaprogramming is not only crucial to the design, but with its use all computations pertaining to the layout of the simulated system can be shifted to compile time, hence cutting on runtime. Program summaryProgram title: C++QED Catalogue identifier: AELU_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AELU_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions:http://cpc.cs.qub.ac.uk/licence/aelu_v1_0.html. The C++QED package contains other software packages, Blitz, Boost and FLENS, all of which may be distributed freely but have individual license requirements. Please see individual packages for license conditions. No. of lines in distributed program, including test data, etc.: 597 974 No. of bytes in distributed program, including test data, etc.: 4 874 839 Distribution format: tar.gz Programming language: C++ Computer: i386-i686, x86_64 Operating system: In principle cross-platform, as yet tested only on UNIX-like systems (including Mac OS X). RAM: The framework itself takes about 60 MB, which is fully shared. The additional memory taken by the program which defines the actual physical system (script) is typically less than 1 MB. The memory storing

  19. Adiabatic/diabatic polarization beam splitter

    Energy Technology Data Exchange (ETDEWEB)

    DeRose, Christopher; Cai, Hong

    2017-09-12

    The various presented herein relate to an on-chip polarization beam splitter (PBS), which is adiabatic for the transverse magnetic (TM) mode and diabatic for the transverse electric (TE) mode. The PBS comprises a through waveguide and a cross waveguide, wherein an electromagnetic beam comprising TE mode and TM mode components is applied to an input port of the through waveguide. The PBS can be utilized to separate the TE mode component from the TM mode component, wherein the TE mode component exits the PBS via an output port of the through waveguide, and the TM mode component exits the PBS via an output port of the cross waveguide. The PBS has a structure that is tolerant to manufacturing variations and exhibits high polarization extinction ratios over a wide bandwidth.

  20. Adiabatic equilibrium models for direct containment heating

    International Nuclear Information System (INIS)

    Pilch, M.; Allen, M.D.

    1991-01-01

    Probabilistic risk assessment (PRA) studies are being extended to include a wider spectrum of reactor plants than was considered in NUREG-1150. There is a need for simple direct containment heating (DCH) models that can be used for screening studies aimed at identifying potentially significant contributors to overall risk in individual nuclear power plants. This paper presents two adiabatic equilibrium models suitable for the task. The first, a single-cell model, places a true upper bound on DCH loads. This upper bound, however, often far exceeds reasonable expectations of containment loads based on CONTAIN calculations and experiment observations. In this paper, a two cell model is developed that captures the major mitigating feature of containment compartmentalization, thus providing more reasonable estimates of the containment load

  1. Design of ternary clocked adiabatic static random access memory

    International Nuclear Information System (INIS)

    Wang Pengjun; Mei Fengna

    2011-01-01

    Based on multi-valued logic, adiabatic circuits and the structure of ternary static random access memory (SRAM), a design scheme of a novel ternary clocked adiabatic SRAM is presented. The scheme adopts bootstrapped NMOS transistors, and an address decoder, a storage cell and a sense amplifier are charged and discharged in the adiabatic way, so the charges stored in the large switch capacitance of word lines, bit lines and the address decoder can be effectively restored to achieve energy recovery during reading and writing of ternary signals. The PSPICE simulation results indicate that the ternary clocked adiabatic SRAM has a correct logic function and low power consumption. Compared with ternary conventional SRAM, the average power consumption of the ternary adiabatic SRAM saves up to 68% in the same conditions. (semiconductor integrated circuits)

  2. Adiabatic logic future trend and system level perspective

    CERN Document Server

    Teichmann, Philip

    2012-01-01

    Adiabatic logic is a potential successor for static CMOS circuit design when it comes to ultra-low-power energy consumption. Future development like the evolutionary shrinking of the minimum feature size as well as revolutionary novel transistor concepts will change the gate level savings gained by adiabatic logic. In addition, the impact of worsening degradation effects has to be considered in the design of adiabatic circuits. The impact of the technology trends on the figures of merit of adiabatic logic, energy saving potential and optimum operating frequency, are investigated, as well as degradation related issues. Adiabatic logic benefits from future devices, is not susceptible to Hot Carrier Injection, and shows less impact of Bias Temperature Instability than static CMOS circuits. Major interest also lies on the efficient generation of the applied power-clock signal. This oscillating power supply can be used to save energy in short idle times by disconnecting circuits. An efficient way to generate the p...

  3. Design of ternary clocked adiabatic static random access memory

    Science.gov (United States)

    Pengjun, Wang; Fengna, Mei

    2011-10-01

    Based on multi-valued logic, adiabatic circuits and the structure of ternary static random access memory (SRAM), a design scheme of a novel ternary clocked adiabatic SRAM is presented. The scheme adopts bootstrapped NMOS transistors, and an address decoder, a storage cell and a sense amplifier are charged and discharged in the adiabatic way, so the charges stored in the large switch capacitance of word lines, bit lines and the address decoder can be effectively restored to achieve energy recovery during reading and writing of ternary signals. The PSPICE simulation results indicate that the ternary clocked adiabatic SRAM has a correct logic function and low power consumption. Compared with ternary conventional SRAM, the average power consumption of the ternary adiabatic SRAM saves up to 68% in the same conditions.

  4. Quantum Information Processing

    CERN Document Server

    Leuchs, Gerd

    2005-01-01

    Quantum processing and communication is emerging as a challenging technique at the beginning of the new millennium. This is an up-to-date insight into the current research of quantum superposition, entanglement, and the quantum measurement process - the key ingredients of quantum information processing. The authors further address quantum protocols and algorithms. Complementary to similar programmes in other countries and at the European level, the German Research Foundation (DFG) started a focused research program on quantum information in 1999. The contributions - written by leading experts - bring together the latest results in quantum information as well as addressing all the relevant questions

  5. Adiabatic Rearrangement of Hollow PV Towers

    Directory of Open Access Journals (Sweden)

    Eric A Hendricks

    2010-10-01

    Full Text Available Diabatic heating from deep moist convection in the hurricane eyewall produces a towering annular structure of elevated potential vorticity (PV. This structure has been referred to as a hollow PV tower. The sign reversal of the radial gradient of PV satisfies the Charney-Stern necessary condition for combined barotropic-baroclinic instability. For thin enough annular structures, small perturbations grow exponentially, extract energy from the mean flow, and lead to hollow tower breakdown, with significant vortex structural and intensity change. The three-dimensional adiabatic rearrangements of two prototypical hurricane-like hollow PV towers (one thick and one thin are examined in an idealized framework. For both hollow towers, dynamic instability causes air parcels with high PV to be mixed into the eye preferentially at lower levels, where unstable PV wave growth rates are the largest. Little or no mixing is found to occur at upper levels. The mixing at lower and middle levels is most rapid for the breakdown of the thin hollow tower, consistent with previous barotropic results. For both hollow towers, this advective rearrangement of PV affects the tropical cyclone structure and intensity in a number of ways. First, the minimum central pressure and maximum azimuthal mean velocity simultaneously decrease, consistent with previous barotropic results. Secondly, isosurfaces of absolute angular momentum preferentially shift inward at low levels, implying an adiabatic mechanism by which hurricane eyewall tilt can form. Thirdly, a PV bridge, similar to that previously found in full-physics hurricane simulations, develops as a result of mixing at the isentropic levels where unstable PV waves grow most rapidly. Finally, the balanced mass field resulting from the PV rearrangement is warmer in the eye between 900 and 700 hPa. The location of this warming is consistent with observed warm anomalies in the eye, indicating that in certain instances the hurricane

  6. Adiabatic, chaotic and quasi-adiabatic charged particle motion in two-dimensional magnetic field reversals

    International Nuclear Information System (INIS)

    Buechner, J.M.

    1989-01-01

    For a number of problems in the Plasma Astrophysics it is necessary to know the laws, which govern the non adiabatic charged particle dynamics in strongly curves magnetic field reversals. These are, e.q., the kinetic theory of the microscopic and macroscopicstability of current sheets in collionless plasma, of microturbulence, causing anomalous resistivity and dissipating currents, the problem of spontaneous reconnection, the formation of non Maxwellian distribution functions, particle acceleration and the use of particles as a diagnostic tool ('tracers'). To find such laws we derived from the differential equations of motion discrete mappings. These mappings allow an investigation of the motion after the break down of the adiabaticity of the magnetic moment. (author). 32 refs.; 5 figs.; 1 tab

  7. Quantum games as quantum types

    Science.gov (United States)

    Delbecque, Yannick

    In this thesis, we present a new model for higher-order quantum programming languages. The proposed model is an adaptation of the probabilistic game semantics developed by Danos and Harmer [DH02]: we expand it with quantum strategies which enable one to represent quantum states and quantum operations. Some of the basic properties of these strategies are established and then used to construct denotational semantics for three quantum programming languages. The first of these languages is a formalisation of the measurement calculus proposed by Danos et al. [DKP07]. The other two are new: they are higher-order quantum programming languages. Previous attempts to define a denotational semantics for higher-order quantum programming languages have failed. We identify some of the key reasons for this and base the design of our higher-order languages on these observations. The game semantics proposed in this thesis is the first denotational semantics for a lambda-calculus equipped with quantum types and with extra operations which allow one to program quantum algorithms. The results presented validate the two different approaches used in the design of these two new higher-order languages: a first one where quantum states are used through references and a second one where they are introduced as constants in the language. The quantum strategies presented in this thesis allow one to understand the constraints that must be imposed on quantum type systems with higher-order types. The most significant constraint is the fact that abstraction over part of the tensor product of many unknown quantum states must not be allowed. Quantum strategies are a new mathematical model which describes the interaction between classical and quantum data using system-environment dialogues. The interactions between the different parts of a quantum system are described using the rich structure generated by composition of strategies. This approach has enough generality to be put in relation with other

  8. A Controlled-Phase Gate via Adiabatic Rydberg Dressing of Neutral Atoms

    Science.gov (United States)

    Keating, Tyler; Deutsch, Ivan; Cook, Robert; Biederman, Grant; Jau, Yuan-Yu

    2014-05-01

    The dipole blockade effect between Rydberg atoms is a promising tool for quantum information processing in neutral atoms. So far, most efforts to perform a quantum logic gate with this effect have used resonant laser pulses to excite the atoms, which makes the system particularly susceptible to decoherence through thermal motional effects. We explore an alternative scheme in which the atomic ground states are adiabatically ``dressed'' by turning on an off-resonant laser. We analyze the implementation of a CPHASE gate using this mechanism and find that fidelities of >99% should be possible with current technology, owing primarily to the suppression of motional errors. We also discuss how such a scheme could be generalized to perform more complicated, multi-qubit gates; in particular, a simple generalization would allow us to perform a Toffoli gate in a single step.

  9. Generation of multiparticle three-dimensional entanglement state via adiabatic passage

    International Nuclear Information System (INIS)

    Wu Xi; Chen Zhi-Hua; Ye Ming-Yong; Chen Yue-Hua; Lin Xiu-Min

    2013-01-01

    A scheme is proposed for generating a multiparticle three-dimensional entangled state by appropriately adiabatic evolutions, where atoms are respectively trapped in separated cavities so that individual addressing is needless. In the ideal case, losses due to the spontaneous transition of an atom and the excitation of photons are efficiently suppressed since atoms are all in ground states and the fields remain in a vacuum state. Compared with the previous proposals, the present scheme reduces its required operation time via simultaneously controlling four classical fields. This advantage would become even more obvious as the number of atoms increases. The experimental feasibility is also discussed. The successful preparation of a high-dimensional multiparticle entangled state among distant atoms provides better prospects for quantum communication and distributed quantum computation. (general)

  10. Quantum Entropy and Its Applications to Quantum Communication and Statistical Physics

    Directory of Open Access Journals (Sweden)

    Masanori Ohya

    2010-05-01

    Full Text Available Quantum entropy is a fundamental concept for quantum information recently developed in various directions. We will review the mathematical aspects of quantum entropy (entropies and discuss some applications to quantum communication, statistical physics. All topics taken here are somehow related to the quantum entropy that the present authors have been studied. Many other fields recently developed in quantum information theory, such as quantum algorithm, quantum teleportation, quantum cryptography, etc., are totally discussed in the book (reference number 60.

  11. Quantum machine learning.

    Science.gov (United States)

    Biamonte, Jacob; Wittek, Peter; Pancotti, Nicola; Rebentrost, Patrick; Wiebe, Nathan; Lloyd, Seth

    2017-09-13

    Fuelled by increasing computer power and algorithmic advances, machine learning techniques have become powerful tools for finding patterns in data. Quantum systems produce atypical patterns that classical systems are thought not to produce efficiently, so it is reasonable to postulate that quantum computers may outperform classical computers on machine learning tasks. The field of quantum machine learning explores how to devise and implement quantum software that could enable machine learning that is faster than that of classical computers. Recent work has produced quantum algorithms that could act as the building blocks of machine learning programs, but the hardware and software challenges are still considerable.

  12. Piecewise adiabatic following in non-Hermitian cycling

    Science.gov (United States)

    Gong, Jiangbin; Wang, Qing-hai

    2018-05-01

    The time evolution of periodically driven non-Hermitian systems is in general nonunitary but can be stable. It is hence of considerable interest to examine the adiabatic following dynamics in periodically driven non-Hermitian systems. We show in this work the possibility of piecewise adiabatic following interrupted by hopping between instantaneous system eigenstates. This phenomenon is first observed in a computational model and then theoretically explained, using an exactly solvable model, in terms of the Stokes phenomenon. In the latter case, the piecewise adiabatic following is shown to be a genuine critical behavior and the precise phase boundary in the parameter space is located. Interestingly, the critical boundary for piecewise adiabatic following is found to be unrelated to the domain for exceptional points. To characterize the adiabatic following dynamics, we also advocate a simple definition of the Aharonov-Anandan (AA) phase for nonunitary cyclic dynamics, which always yields real AA phases. In the slow driving limit, the AA phase reduces to the Berry phase if adiabatic following persists throughout the driving without hopping, but oscillates violently and does not approach any limit in cases of piecewise adiabatic following. This work exposes the rich features of nonunitary dynamics in cases of slow cycling and should stimulate future applications of nonunitary dynamics.

  13. Non-adiabatic perturbations in Ricci dark energy model

    International Nuclear Information System (INIS)

    Karwan, Khamphee; Thitapura, Thiti

    2012-01-01

    We show that the non-adiabatic perturbations between Ricci dark energy and matter can grow both on superhorizon and subhorizon scales, and these non-adiabatic perturbations on subhorizon scales can lead to instability in this dark energy model. The rapidly growing non-adiabatic modes on subhorizon scales always occur when the equation of state parameter of dark energy starts to drop towards -1 near the end of matter era, except that the parameter α of Ricci dark energy equals to 1/2. In the case where α = 1/2, the rapidly growing non-adiabatic modes disappear when the perturbations in dark energy and matter are adiabatic initially. However, an adiabaticity between dark energy and matter perturbations at early time implies a non-adiabaticity between matter and radiation, this can influence the ordinary Sachs-Wolfe (OSW) effect. Since the amount of Ricci dark energy is not small during matter domination, the integrated Sachs-Wolfe (ISW) effect is greatly modified by density perturbations of dark energy, leading to a wrong shape of CMB power spectrum. The instability in Ricci dark energy is difficult to be alleviated if the effects of coupling between baryon and photon on dark energy perturbations are included

  14. Quantum Computing: Pro and Con

    OpenAIRE

    Preskill, John

    1997-01-01

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

  15. Classical molecular dynamics simulation of electronically non-adiabatic processes.

    Science.gov (United States)

    Miller, William H; Cotton, Stephen J

    2016-12-22

    Both classical and quantum mechanics (as well as hybrids thereof, i.e., semiclassical approaches) find widespread use in simulating dynamical processes in molecular systems. For large chemical systems, however, which involve potential energy surfaces (PES) of general/arbitrary form, it is usually the case that only classical molecular dynamics (MD) approaches are feasible, and their use is thus ubiquitous nowadays, at least for chemical processes involving dynamics on a single PES (i.e., within a single Born-Oppenheimer electronic state). This paper reviews recent developments in an approach which extends standard classical MD methods to the treatment of electronically non-adiabatic processes, i.e., those that involve transitions between different electronic states. The approach treats nuclear and electronic degrees of freedom (DOF) equivalently (i.e., by classical mechanics, thereby retaining the simplicity of standard MD), and provides "quantization" of the electronic states through a symmetrical quasi-classical (SQC) windowing model. The approach is seen to be capable of treating extreme regimes of strong and weak coupling between the electronic states, as well as accurately describing coherence effects in the electronic DOF (including the de-coherence of such effects caused by coupling to the nuclear DOF). A survey of recent applications is presented to illustrate the performance of the approach. Also described is a newly developed variation on the original SQC model (found universally superior to the original) and a general extension of the SQC model to obtain the full electronic density matrix (at no additional cost/complexity).

  16. Quantum many-body effects in x-ray spectra efficiently computed using a basic graph algorithm

    Science.gov (United States)

    Liang, Yufeng; Prendergast, David

    2018-05-01

    The growing interest in using x-ray spectroscopy for refined materials characterization calls for an accurate electronic-structure theory to interpret the x-ray near-edge fine structure. In this work, we propose an efficient and unified framework to describe all the many-electron processes in a Fermi liquid after a sudden perturbation (such as a core hole). This problem has been visited by the Mahan-Noziéres-De Dominicis (MND) theory, but it is intractable to implement various Feynman diagrams within first-principles calculations. Here, we adopt a nondiagrammatic approach and treat all the many-electron processes in the MND theory on an equal footing. Starting from a recently introduced determinant formalism [Phys. Rev. Lett. 118, 096402 (2017), 10.1103/PhysRevLett.118.096402], we exploit the linear dependence of determinants describing different final states involved in the spectral calculations. An elementary graph algorithm, breadth-first search, can be used to quickly identify the important determinants for shaping the spectrum, which avoids the need to evaluate a great number of vanishingly small terms. This search algorithm is performed over the tree-structure of the many-body expansion, which mimics a path-finding process. We demonstrate that the determinantal approach is computationally inexpensive even for obtaining x-ray spectra of extended systems. Using Kohn-Sham orbitals from two self-consistent fields (ground and core-excited state) as input for constructing the determinants, the calculated x-ray spectra for a number of transition metal oxides are in good agreement with experiments. Many-electron aspects beyond the Bethe-Salpeter equation, as captured by this approach, are also discussed, such as shakeup excitations and many-body wave function overlap considered in Anderson's orthogonality catastrophe.

  17. The importance of accurate adiabatic interaction potentials for the correct description of electronically nonadiabatic vibrational energy transfer: A combined experimental and theoretical study of NO(v = 3) collisions with a Au(111) surface

    Energy Technology Data Exchange (ETDEWEB)

    Golibrzuch, Kai; Shirhatti, Pranav R.; Kandratsenka, Alexander; Wodtke, Alec M.; Bartels, Christof [Institute for Physical Chemistry, Georg August University of Göttingen, Göttingen 37077 (Germany); Max Planck Institute for Biophysical Chemistry, Göttingen 37077 (Germany); Rahinov, Igor [Department of Natural Sciences, The Open University of Israel, Ra' anana 4353701 (Israel); Auerbach, Daniel J. [Institute for Physical Chemistry, Georg August University of Göttingen, Göttingen 37077 (Germany); Max Planck Institute for Biophysical Chemistry, Göttingen 37077 (Germany); Department of Chemistry and Biochemistry, University of California Santa Barbara, Santa Barbara, California 93106 (United States)

    2014-01-28

    We present a combined experimental and theoretical study of NO(v = 3 → 3, 2, 1) scattering from a Au(111) surface at incidence translational energies ranging from 0.1 to 1.2 eV. Experimentally, molecular beam–surface scattering is combined with vibrational overtone pumping and quantum-state selective detection of the recoiling molecules. Theoretically, we employ a recently developed first-principles approach, which employs an Independent Electron Surface Hopping (IESH) algorithm to model the nonadiabatic dynamics on a Newns-Anderson Hamiltonian derived from density functional theory. This approach has been successful when compared to previously reported NO/Au scattering data. The experiments presented here show that vibrational relaxation probabilities increase with incidence energy of translation. The theoretical simulations incorrectly predict high relaxation probabilities at low incidence translational energy. We show that this behavior originates from trajectories exhibiting multiple bounces at the surface, associated with deeper penetration and favored (N-down) molecular orientation, resulting in a higher average number of electronic hops and thus stronger vibrational relaxation. The experimentally observed narrow angular distributions suggest that mainly single-bounce collisions are important. Restricting the simulations by selecting only single-bounce trajectories improves agreement with experiment. The multiple bounce artifacts discovered in this work are also present in simulations employing electronic friction and even for electronically adiabatic simulations, meaning they are not a direct result of the IESH algorithm. This work demonstrates how even subtle errors in the adiabatic interaction potential, especially those that influence the interaction time of the molecule with the surface, can lead to an incorrect description of electronically nonadiabatic vibrational energy transfer in molecule-surface collisions.

  18. Are the reactions of quinones on graphite adiabatic?

    International Nuclear Information System (INIS)

    Luque, N.B.; Schmickler, W.

    2013-01-01

    Outer sphere electron transfer reactions on pure metal electrodes are often adiabatic and hence independent of the electrode material. Since it is not clear, whether adiabatic electron transfer can also occur on a semi-metal like graphite, we have re-investigated experimental data presented in a recent communication by Nissim et al. [Chemical Communications 48 (2012) 3294] on the reactions of quinones on graphite. We have supplemented their work by DFT calculations and conclude, that these reactions are indeed adiabatic. This contradicts the assertion of Nissim et al. that the rates are proportional to the density of states at the Fermi level

  19. Models of optical quantum computing

    Directory of Open Access Journals (Sweden)

    Krovi Hari

    2017-03-01

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

  20. Adiabatic liquid piston compressed air energy storage

    Energy Technology Data Exchange (ETDEWEB)

    Petersen, Tage [Danish Technological Institute, Aarhus (Denmark); Elmegaard, B. [Technical Univ. of Denmark. DTU Mechanical Engineering, Kgs. Lyngby (Denmark); Schroeder Pedersen, A. [Technical Univ. of Denmark. DTU Energy Conversion, Risoe Campus, Roskilde (Denmark)

    2013-01-15

    This project investigates the potential of a Compressed Air Energy Storage system (CAES system). CAES systems are used to store mechanical energy in the form of compressed air. The systems use electricity to drive the compressor at times of low electricity demand with the purpose of converting the mechanical energy into electricity at times of high electricity demand. Two such systems are currently in operation; one in Germany (Huntorf) and one in the USA (Macintosh, Alabama). In both cases, an underground cavern is used as a pressure vessel for the storage of the compressed air. Both systems are in the range of 100 MW electrical power output with several hours of production stored as compressed air. In this range, enormous volumes are required, which make underground caverns the only economical way to design the pressure vessel. Both systems use axial turbine compressors to compress air when charging the system. The compression leads to a significant increase in temperature, and the heat generated is dumped into the ambient. This energy loss results in a low efficiency of the system, and when expanding the air, the expansion leads to a temperature drop reducing the mechanical output of the expansion turbines. To overcome this, fuel is burned to heat up the air prior to expansion. The fuel consumption causes a significant cost for the storage. Several suggestions have been made to store compression heat for later use during expansion and thereby avoid the use of fuel (so called Adiabatic CAES units), but no such units are in operation at present. The CAES system investigated in this project uses a different approach to avoid compression heat loss. The system uses a pre-compressed pressure vessel full of air. A liquid is pumped into the bottom of the vessel when charging and the same liquid is withdrawn through a turbine when discharging. In this case, the liquid works effectively as a piston compressing the gas in the vessel, hence the name ''Adiabatic