Adiabatic quantum simulation of quantum chemistry.

PubMed

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

2014-10-13

We show how to apply the quantum adiabatic algorithm directly to the quantum computation of molecular properties. We describe a procedure to map electronic structure Hamiltonians to 2-body qubit Hamiltonians with a small set of physically realizable couplings. By combining the Bravyi-Kitaev construction to map fermions to qubits with perturbative gadgets to reduce the Hamiltonian to 2-body, we obtain precision requirements on the coupling strengths and a number of ancilla qubits that scale polynomially in the problem size. Hence our mapping is efficient. The required set of controllable interactions includes only two types of interaction beyond the Ising interactions required to apply the quantum adiabatic algorithm to combinatorial optimization problems. Our mapping may also be of interest to chemists directly as it defines a dictionary from electronic structure to spin Hamiltonians with physical interactions.

Quantum adiabatic machine learning

NASA Astrophysics Data System (ADS)

Pudenz, Kristen L.; Lidar, Daniel A.

2013-05-01

We develop an approach to machine learning and anomaly detection via quantum adiabatic evolution. This approach consists of two quantum phases, with some amount of classical preprocessing to set up the quantum problems. In the training phase we identify an optimal set of weak classifiers, to form a single strong classifier. In the testing phase we adiabatically evolve one or more strong classifiers on a superposition of inputs in order to find certain anomalous elements in the classification space. Both the training and testing phases are executed via quantum adiabatic evolution. All quantum processing is strictly limited to two-qubit interactions so as to ensure physical feasibility. We apply and illustrate this approach in detail to the problem of software verification and validation, with a specific example of the learning phase applied to a problem of interest in flight control systems. Beyond this example, the algorithm can be used to attack a broad class of anomaly detection problems.

Quantum and classical dynamics in adiabatic computation

NASA Astrophysics Data System (ADS)

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

2014-10-01

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

Efficient Online Optimized Quantum Control for Adiabatic Quantum Computation

NASA Astrophysics Data System (ADS)

Quiroz, Gregory

Adiabatic quantum computation (AQC) relies on controlled adiabatic evolution to implement a quantum algorithm. While control evolution can take many forms, properly designed time-optimal control has been shown to be particularly advantageous for AQC. Grover's search algorithm is one such example where analytically-derived time-optimal control leads to improved scaling of the minimum energy gap between the ground state and first excited state and thus, the well-known quadratic quantum speedup. Analytical extensions beyond Grover's search algorithm present a daunting task that requires potentially intractable calculations of energy gaps and a significant degree of model certainty. Here, an in situ quantum control protocol is developed for AQC. The approach is shown to yield controls that approach the analytically-derived time-optimal controls for Grover's search algorithm. In addition, the protocol's convergence rate as a function of iteration number is shown to be essentially independent of system size. Thus, the approach is potentially scalable to many-qubit systems.

Digitized adiabatic quantum computing with a superconducting circuit.

PubMed

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

2016-06-09

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

Determining the Complexity of the Quantum Adiabatic Algorithm using Quantum Monte Carlo Simulations

DTIC Science & Technology

2012-12-18

of this printing. List the papers, including journal references, in the following categories: Received Paper 12/06/2012 4.00 Itay Hen, A. Young...PhysRevLett.104.020502 12/06/2012 3.00 A. P. Young, Itay Hen. Exponential complexity of the quantum adiabatic algorithm for certain satisfiability problems...Physical Review E, (12 2011): 0. doi: 10.1103/PhysRevE.84.061152 12/06/2012 5.00 Edward Farhi, David Gosset, Itay Hen, A. Sandvik, Peter Shor, A

Geometrizing adiabatic quantum computation

NASA Astrophysics Data System (ADS)

Rezakhani, Ali; Kuo, Wan-Jung; Hamma, Alioscia; Lidar, Daniel; Zanardi, Paolo

2010-03-01

A time-optimal approach to adiabatic quantum computation (AQC) is formulated. The corresponding natural Riemannian metric is also derived, through which AQC can be understood as the problem of finding a geodesic on the manifold of control parameters. We demonstrate this geometrization through some examples, where we show that it leads to improved performance of AQC, and sheds light on the roles of entanglement and curvature of the control manifold in algorithmic performance. The underlying connection with quantum phase transitions is also explored.

Quantum Adiabatic Brachistochrone

NASA Astrophysics Data System (ADS)

Rezakhani, A. T.; Kuo, W.-J.; Hamma, A.; Lidar, D. A.; Zanardi, P.

2009-08-01

We formulate a time-optimal approach to adiabatic quantum computation (AQC). A corresponding natural Riemannian metric is also derived, through which AQC can be understood as the problem of finding a geodesic on the manifold of control parameters. This geometrization of AQC is demonstrated through two examples, where we show that it leads to improved performance of AQC, and sheds light on the roles of entanglement and curvature of the control manifold in algorithmic performance.

Quantum adiabatic brachistochrone.

PubMed

Rezakhani, A T; Kuo, W-J; Hamma, A; Lidar, D A; Zanardi, P

2009-08-21

We formulate a time-optimal approach to adiabatic quantum computation (AQC). A corresponding natural Riemannian metric is also derived, through which AQC can be understood as the problem of finding a geodesic on the manifold of control parameters. This geometrization of AQC is demonstrated through two examples, where we show that it leads to improved performance of AQC, and sheds light on the roles of entanglement and curvature of the control manifold in algorithmic performance.

Random Matrix Approach to Quantum Adiabatic Evolution Algorithms

NASA Technical Reports Server (NTRS)

Boulatov, Alexei; Smelyanskiy, Vadier N.

2004-01-01

We analyze the power of quantum adiabatic evolution algorithms (Q-QA) for solving random NP-hard optimization problems within a theoretical framework based on the random matrix theory (RMT). We present two types of the driven RMT models. In the first model, the driving Hamiltonian is represented by Brownian motion in the matrix space. We use the Brownian motion model to obtain a description of multiple avoided crossing phenomena. We show that the failure mechanism of the QAA is due to the interaction of the ground state with the "cloud" formed by all the excited states, confirming that in the driven RMT models. the Landau-Zener mechanism of dissipation is not important. We show that the QAEA has a finite probability of success in a certain range of parameters. implying the polynomial complexity of the algorithm. The second model corresponds to the standard QAEA with the problem Hamiltonian taken from the Gaussian Unitary RMT ensemble (GUE). We show that the level dynamics in this model can be mapped onto the dynamics in the Brownian motion model. However, the driven RMT model always leads to the exponential complexity of the algorithm due to the presence of the long-range intertemporal correlations of the eigenvalues. Our results indicate that the weakness of effective transitions is the leading effect that can make the Markovian type QAEA successful.

Quantum adiabatic computation with a constant gap is not useful in one dimension.

PubMed

Hastings, M B

2009-07-31

We show that it is possible to use a classical computer to efficiently simulate the adiabatic evolution of a quantum system in one dimension with a constant spectral gap, starting the adiabatic evolution from a known initial product state. The proof relies on a recently proven area law for such systems, implying the existence of a good matrix product representation of the ground state, combined with an appropriate algorithm to update the matrix product state as the Hamiltonian is changed. This implies that adiabatic evolution with such Hamiltonians is not useful for universal quantum computation. Therefore, adiabatic algorithms which are useful for universal quantum computation either require a spectral gap tending to zero or need to be implemented in more than one dimension (we leave open the question of the computational power of adiabatic simulation with a constant gap in more than one dimension).

QCCM Center for Quantum Algorithms

DTIC Science & Technology

2008-10-17

algorithms (e.g., quantum walks and adiabatic computing ), as well as theoretical advances relating algorithms to physical implementations (e.g...Park, NC 27709-2211 15. SUBJECT TERMS Quantum algorithms, quantum computing , fault-tolerant error correction Richard Cleve MITACS East Academic...0511200 Algebraic results on quantum automata A. Ambainis, M. Beaudry, M. Golovkins, A. Kikusts, M. Mercer, D. Thrien Theory of Computing Systems 39(2006

Experimental Adiabatic Quantum Factorization under Ambient Conditions Based on a Solid-State Single Spin System.

PubMed

Xu, Kebiao; Xie, Tianyu; Li, Zhaokai; Xu, Xiangkun; Wang, Mengqi; Ye, Xiangyu; Kong, Fei; Geng, Jianpei; Duan, Changkui; Shi, Fazhan; Du, Jiangfeng

2017-03-31

The adiabatic quantum computation is a universal and robust method of quantum computing. In this architecture, the problem can be solved by adiabatically evolving the quantum processor from the ground state of a simple initial Hamiltonian to that of a final one, which encodes the solution of the problem. Adiabatic quantum computation has been proved to be a compatible candidate for scalable quantum computation. In this Letter, we report on the experimental realization of an adiabatic quantum algorithm on a single solid spin system under ambient conditions. All elements of adiabatic quantum computation, including initial state preparation, adiabatic evolution (simulated by optimal control), and final state read-out, are realized experimentally. As an example, we found the ground state of the problem Hamiltonian S_{z}I_{z} on our adiabatic quantum processor, which can be mapped to the factorization of 35 into its prime factors 5 and 7.

Experimental Adiabatic Quantum Factorization under Ambient Conditions Based on a Solid-State Single Spin System

NASA Astrophysics Data System (ADS)

Xu, Kebiao; Xie, Tianyu; Li, Zhaokai; Xu, Xiangkun; Wang, Mengqi; Ye, Xiangyu; Kong, Fei; Geng, Jianpei; Duan, Changkui; Shi, Fazhan; Du, Jiangfeng

2017-03-01

The adiabatic quantum computation is a universal and robust method of quantum computing. In this architecture, the problem can be solved by adiabatically evolving the quantum processor from the ground state of a simple initial Hamiltonian to that of a final one, which encodes the solution of the problem. Adiabatic quantum computation has been proved to be a compatible candidate for scalable quantum computation. In this Letter, we report on the experimental realization of an adiabatic quantum algorithm on a single solid spin system under ambient conditions. All elements of adiabatic quantum computation, including initial state preparation, adiabatic evolution (simulated by optimal control), and final state read-out, are realized experimentally. As an example, we found the ground state of the problem Hamiltonian SzIz on our adiabatic quantum processor, which can be mapped to the factorization of 35 into its prime factors 5 and 7.

Number Partitioning via Quantum Adiabatic Computation

NASA Technical Reports Server (NTRS)

Smelyanskiy, Vadim N.; Toussaint, Udo

2002-01-01

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

Adiabatic topological quantum computing

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cesare, Chris; Landahl, Andrew J.; Bacon, Dave

Topological quantum computing promises error-resistant quantum computation without active error correction. However, there is a worry that during the process of executing quantum gates by braiding anyons around each other, extra anyonic excitations will be created that will disorder the encoded quantum information. Here, we explore this question in detail by studying adiabatic code deformations on Hamiltonians based on topological codes, notably Kitaev’s surface codes and the more recently discovered color codes. We develop protocols that enable universal quantum computing by adiabatic evolution in a way that keeps the energy gap of the system constant with respect to the computationmore » size and introduces only simple local Hamiltonian interactions. This allows one to perform holonomic quantum computing with these topological quantum computing systems. The tools we develop allow one to go beyond numerical simulations and understand these processes analytically.« less

Adiabatic topological quantum computing

DOE PAGES

Cesare, Chris; Landahl, Andrew J.; Bacon, Dave; ...

2015-07-31

Topological quantum computing promises error-resistant quantum computation without active error correction. However, there is a worry that during the process of executing quantum gates by braiding anyons around each other, extra anyonic excitations will be created that will disorder the encoded quantum information. Here, we explore this question in detail by studying adiabatic code deformations on Hamiltonians based on topological codes, notably Kitaev’s surface codes and the more recently discovered color codes. We develop protocols that enable universal quantum computing by adiabatic evolution in a way that keeps the energy gap of the system constant with respect to the computationmore » size and introduces only simple local Hamiltonian interactions. This allows one to perform holonomic quantum computing with these topological quantum computing systems. The tools we develop allow one to go beyond numerical simulations and understand these processes analytically.« less

NMR implementation of adiabatic SAT algorithm using strongly modulated pulses.

PubMed

Mitra, Avik; Mahesh, T S; Kumar, Anil

2008-03-28

NMR implementation of adiabatic algorithms face severe problems in homonuclear spin systems since the qubit selective pulses are long and during this period, evolution under the Hamiltonian and decoherence cause errors. The decoherence destroys the answer as it causes the final state to evolve to mixed state and in homonuclear systems, evolution under the internal Hamiltonian causes phase errors preventing the initial state to converge to the solution state. The resolution of these issues is necessary before one can proceed to implement an adiabatic algorithm in a large system where homonuclear coupled spins will become a necessity. In the present work, we demonstrate that by using "strongly modulated pulses" (SMPs) for the creation of interpolating Hamiltonian, one can circumvent both the problems and successfully implement the adiabatic SAT algorithm in a homonuclear three qubit system. This work also demonstrates that the SMPs tremendously reduce the time taken for the implementation of the algorithm, can overcome problems associated with decoherence, and will be the modality in future implementation of quantum information processing by NMR.

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

NASA Astrophysics Data System (ADS)

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.

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

Adame, J.; Warzel, S., E-mail: warzel@ma.tum.de

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.

An Integrated Development Environment for Adiabatic Quantum Programming

DOE Office of Scientific and Technical Information (OSTI.GOV)

Humble, Travis S; McCaskey, Alex; Bennink, Ryan S

2014-01-01

Adiabatic quantum computing is a promising route to the computational power afforded by quantum information processing. The recent availability of adiabatic hardware raises the question of how well quantum programs perform. Benchmarking behavior is challenging since the multiple steps to synthesize an adiabatic quantum program are highly tunable. We present an adiabatic quantum programming environment called JADE that provides control over all the steps taken during program development. JADE captures the workflow needed to rigorously benchmark performance while also allowing a variety of problem types, programming techniques, and processor configurations. We have also integrated JADE with a quantum simulation enginemore » that enables program profiling using numerical calculation. The computational engine supports plug-ins for simulation methodologies tailored to various metrics and computing resources. We present the design, integration, and deployment of JADE and discuss its use for benchmarking adiabatic quantum programs.« less

Use of non-adiabatic geometric phase for quantum computing by NMR.

PubMed

Das, Ranabir; Kumar, S K Karthick; Kumar, Anil

2005-12-01

Geometric phases have stimulated researchers for its potential applications in many areas of science. One of them is fault-tolerant quantum computation. A preliminary requisite of quantum computation is the implementation of controlled dynamics of qubits. In controlled dynamics, one qubit undergoes coherent evolution and acquires appropriate phase, depending on the state of other qubits. If the evolution is geometric, then the phase acquired depend only on the geometry of the path executed, and is robust against certain types of error. This phenomenon leads to an inherently fault-tolerant quantum computation. Here we suggest a technique of using non-adiabatic geometric phase for quantum computation, using selective excitation. In a two-qubit system, we selectively evolve a suitable subsystem where the control qubit is in state |1, through a closed circuit. By this evolution, the target qubit gains a phase controlled by the state of the control qubit. Using the non-adiabatic geometric phase we demonstrate implementation of Deutsch-Jozsa algorithm and Grover's search algorithm in a two-qubit system.

Effect of local minima on adiabatic quantum optimization.

PubMed

Amin, M H S

2008-04-04

We present a perturbative method to estimate the spectral gap for adiabatic quantum optimization, based on the structure of the energy levels in the problem Hamiltonian. We show that, for problems that have an exponentially large number of local minima close to the global minimum, the gap becomes exponentially small making the computation time exponentially long. The quantum advantage of adiabatic quantum computation may then be accessed only via the local adiabatic evolution, which requires phase coherence throughout the evolution and knowledge of the spectrum. Such problems, therefore, are not suitable for adiabatic quantum computation.

Adiabatic quantum computing with spin qubits hosted by molecules.

PubMed

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

2015-01-28

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

Communication: Adiabatic and non-adiabatic electron-nuclear motion: Quantum and classical dynamics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Albert, Julian; Kaiser, Dustin; Engel, Volker

2016-05-07

Using a model for coupled electronic-nuclear motion we investigate the range from negligible to strong non-adiabatic coupling. In the adiabatic case, the quantum dynamics proceeds in a single electronic state, whereas for strong coupling a complete transition between two adiabatic electronic states takes place. It is shown that in all coupling regimes the short-time wave-packet dynamics can be described using ensembles of classical trajectories in the phase space spanned by electronic and nuclear degrees of freedom. We thus provide an example which documents that the quantum concept of non-adiabatic transitions is not necessarily needed if electronic and nuclear motion ismore » treated on the same footing.« less

Adiabatic quantum computation in open systems.

PubMed

Sarandy, M S; Lidar, D A

2005-12-16

We analyze the performance of adiabatic quantum computation (AQC) subject to decoherence. To this end, we introduce an inherently open-systems approach, based on a recent generalization of the adiabatic approximation. In contrast to closed systems, we show that a system may initially be in an adiabatic regime, but then undergo a transition to a regime where adiabaticity breaks down. As a consequence, the success of AQC depends sensitively on the competition between various pertinent rates, giving rise to optimality criteria.

Adiabatic Quantum Computation: Coherent Control Back Action.

PubMed

Goswami, Debabrata

2006-11-22

Though attractive from scalability aspects, optical approaches to quantum computing are highly prone to decoherence and rapid population loss due to nonradiative processes such as vibrational redistribution. We show that such effects can be reduced by adiabatic coherent control, in which quantum interference between multiple excitation pathways is used to cancel coupling to the unwanted, non-radiative channels. We focus on experimentally demonstrated adiabatic controlled population transfer experiments wherein the details on the coherence aspects are yet to be explored theoretically but are important for quantum computation. Such quantum computing schemes also form a back-action connection to coherent control developments.

Adiabatic quantum computation with neutral atoms via the Rydberg blockade

NASA Astrophysics Data System (ADS)

Goyal, Krittika; Deutsch, Ivan

2011-05-01

We study a trapped-neutral-atom implementation of the adiabatic model of quantum computation whereby the Hamiltonian of a set of interacting qubits is changed adiabatically so that its ground state evolves to the desired output of the algorithm. We employ the ``Rydberg blockade interaction,'' which previously has been used to implement two-qubit entangling gates in the quantum circuit model. Here it is employed via off-resonant virtual dressing of the excited levels, so that atoms always remain in the ground state. The resulting dressed-Rydberg interaction is insensitive to the distance between the atoms within a certain blockade radius, making this process robust to temperature and vibrational fluctuations. Single qubit interactions are implemented with global microwaves and atoms are locally addressed with light shifts. With these ingredients, we study a protocol to implement the two-qubit Quadratic Unconstrained Binary Optimization (QUBO) problem. We model atom trapping, addressing, coherent evolution, and decoherence. We also explore collective control of the many-atom system and generalize the QUBO problem to multiple qubits. We study a trapped-neutral-atom implementation of the adiabatic model of quantum computation whereby the Hamiltonian of a set of interacting qubits is changed adiabatically so that its ground state evolves to the desired output of the algorithm. We employ the ``Rydberg blockade interaction,'' which previously has been used to implement two-qubit entangling gates in the quantum circuit model. Here it is employed via off-resonant virtual dressing of the excited levels, so that atoms always remain in the ground state. The resulting dressed-Rydberg interaction is insensitive to the distance between the atoms within a certain blockade radius, making this process robust to temperature and vibrational fluctuations. Single qubit interactions are implemented with global microwaves and atoms are locally addressed with light shifts. With these

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

PubMed

Goto, Hayato

2016-02-22

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

Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network

PubMed Central

Goto, Hayato

2016-01-01

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

Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network

NASA Astrophysics Data System (ADS)

Goto, Hayato

2016-02-01

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

Quantum trajectories for time-dependent adiabatic master equations

NASA Astrophysics Data System (ADS)

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.

Relaxation versus adiabatic quantum steady-state preparation

NASA Astrophysics Data System (ADS)

Venuti, Lorenzo Campos; Albash, Tameem; Marvian, Milad; Lidar, Daniel; Zanardi, Paolo

2017-04-01

Adiabatic preparation of the ground states of many-body Hamiltonians in the closed-system limit is at the heart of adiabatic quantum computation, but in reality systems are always open. This motivates a natural comparison between, on the one hand, adiabatic preparation of steady states of Lindbladian generators and, on the other hand, relaxation towards the same steady states subject to the final Lindbladian of the adiabatic process. In this work we thus adopt the perspective that the goal is the most efficient possible preparation of such steady states, rather than ground states. Using known rigorous bounds for the open-system adiabatic theorem and for mixing times, we are then led to a disturbing conclusion that at first appears to doom efforts to build physical quantum annealers: relaxation seems to always converge faster than adiabatic preparation. However, by carefully estimating the adiabatic preparation time for Lindbladians describing thermalization in the low-temperature limit, we show that there is, after all, room for an adiabatic speedup over relaxation. To test the analytically derived bounds for the adiabatic preparation time and the relaxation time, we numerically study three models: a dissipative quasifree fermionic chain, a single qubit coupled to a thermal bath, and the "spike" problem of n qubits coupled to a thermal bath. Via these models we find that the answer to the "which wins" question depends for each model on the temperature and the system-bath coupling strength. In the case of the "spike" problem we find that relaxation during the adiabatic evolution plays an important role in ensuring a speedup over the final-time relaxation procedure. Thus, relaxation-assisted adiabatic preparation can be more efficient than both pure adiabatic evolution and pure relaxation.

Thermally assisted adiabatic quantum computation.

PubMed

Amin, M H S; Love, Peter J; Truncik, C J S

2008-02-15

We study the effect of a thermal environment on adiabatic quantum computation using the Bloch-Redfield formalism. We show that in certain cases the environment can enhance the performance in two different ways: (i) by introducing a time scale for thermal mixing near the anticrossing that is smaller than the adiabatic time scale, and (ii) by relaxation after the anticrossing. The former can enhance the scaling of computation when the environment is super-Ohmic, while the latter can only provide a prefactor enhancement. We apply our method to the case of adiabatic Grover search and show that performance better than classical is possible with a super-Ohmic environment, with no a priori knowledge of the energy spectrum.

Bridging Quantum, Classical and Stochastic Shortcuts to Adiabaticity

NASA Astrophysics Data System (ADS)

Patra, Ayoti

Adiabatic invariants - quantities that are preserved under the slow driving of a system's external parameters - are important in classical mechanics, quantum mechanics and thermodynamics. Adiabatic processes allow a system to be guided to evolve to a desired final state. However, the slow driving of a quantum system makes it vulnerable to environmental decoherence, and for both quantum and classical systems, it is often desirable and time-efficient to speed up a process. Shortcuts to adiabaticity are strategies for preserving adiabatic invariants under rapid driving, typically by means of an auxiliary field that suppresses excitations, otherwise generated during rapid driving. Several theoretical approaches have been developed to construct such shortcuts. In this dissertation we focus on two different approaches, namely counterdiabatic driving and fast-forward driving, which were originally developed for quantum systems. The counterdiabatic approach introduced independently by Dermirplak and Rice [J. Phys. Chem. A, 107:9937, 2003], and Berry [J. Phys. A: Math. Theor., 42:365303, 2009] formally provides an exact expression for the auxiliary Hamiltonian, which however is abstract and difficult to translate into an experimentally implementable form. By contrast, the fast-forward approach developed by Masuda and Nakamura [Proc. R. Soc. A, 466(2116):1135, 2010] provides an auxiliary potential that may be experimentally implementable but generally applies only to ground states. The central theme of this dissertation is that classical shortcuts to adiabaticity can provide useful physical insights and lead to experimentally implementable shortcuts for analogous quantum systems. We start by studying a model system of a tilted piston to provide a proof of principle that quantum shortcuts can successfully be constructed from their classical counterparts. In the remainder of the dissertation, we develop a general approach based on flow-fields which produces simple expressions

Adiabatic Quantum Computing with Neutral Atoms

NASA Astrophysics Data System (ADS)

Hankin, Aaron; Biedermann, Grant; Burns, George; Jau, Yuan-Yu; Johnson, Cort; Kemme, Shanalyn; Landahl, Andrew; Mangan, Michael; Parazzoli, L. Paul; Schwindt, Peter; Armstrong, Darrell

2012-06-01

We are developing, both theoretically and experimentally, a neutral atom qubit approach to adiabatic quantum computation. Using our microfabricated diffractive optical elements, we plan to implement an array of optical traps for cesium atoms and use Rydberg-dressed ground states to provide a controlled atom-atom interaction. We will develop this experimental capability to generate a two-qubit adiabatic evolution aimed specifically toward demonstrating the two-qubit quadratic unconstrained binary optimization (QUBO) routine.

Probing coherence aspects of adiabatic quantum computation and control.

PubMed

Goswami, Debabrata

2007-09-28

Quantum interference between multiple excitation pathways can be used to cancel the couplings to the unwanted, nonradiative channels resulting in robustly controlling decoherence through adiabatic coherent control approaches. We propose a useful quantification of the two-level character in a multilevel system by considering the evolution of the coherent character in the quantum system as represented by the off-diagonal density matrix elements, which switches from real to imaginary as the excitation process changes from being resonant to completely adiabatic. Such counterintuitive results can be explained in terms of continuous population exchange in comparison to no population exchange under the adiabatic condition.

Lower bound on the time complexity of local adiabatic evolution

NASA Astrophysics Data System (ADS)

Chen, Zhenghao; Koh, Pang Wei; Zhao, Yan

2006-11-01

The adiabatic theorem of quantum physics has been, in recent times, utilized in the design of local search quantum algorithms, and has been proven to be equivalent to standard quantum computation, that is, the use of unitary operators [D. Aharonov in Proceedings of the 45th Annual Symposium on the Foundations of Computer Science, 2004, Rome, Italy (IEEE Computer Society Press, New York, 2004), pp. 42-51]. Hence, the study of the time complexity of adiabatic evolution algorithms gives insight into the computational power of quantum algorithms. In this paper, we present two different approaches of evaluating the time complexity for local adiabatic evolution using time-independent parameters, thus providing effective tests (not requiring the evaluation of the entire time-dependent gap function) for the time complexity of newly developed algorithms. We further illustrate our tests by displaying results from the numerical simulation of some problems, viz. specially modified instances of the Hamming weight problem.

Adiabatic Theorem for Quantum Spin Systems

NASA Astrophysics Data System (ADS)

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.

Non-adiabatic holonomic quantum computation in linear system-bath coupling

PubMed Central

Sun, Chunfang; Wang, Gangcheng; Wu, Chunfeng; Liu, Haodi; Feng, Xun-Li; Chen, Jing-Ling; Xue, Kang

2016-01-01

Non-adiabatic holonomic quantum computation in decoherence-free subspaces protects quantum information from control imprecisions and decoherence. For the non-collective decoherence that each qubit has its own bath, we show the implementations of two non-commutable holonomic single-qubit gates and one holonomic nontrivial two-qubit gate that compose a universal set of non-adiabatic holonomic quantum gates in decoherence-free-subspaces of the decoupling group, with an encoding rate of . The proposed scheme is robust against control imprecisions and the non-collective decoherence, and its non-adiabatic property ensures less operation time. We demonstrate that our proposed scheme can be realized by utilizing only two-qubit interactions rather than many-qubit interactions. Our results reduce the complexity of practical implementation of holonomic quantum computation in experiments. We also discuss the physical implementation of our scheme in coupled microcavities. PMID:26846444

Non-adiabatic holonomic quantum computation in linear system-bath coupling.

PubMed

Sun, Chunfang; Wang, Gangcheng; Wu, Chunfeng; Liu, Haodi; Feng, Xun-Li; Chen, Jing-Ling; Xue, Kang

2016-02-05

Non-adiabatic holonomic quantum computation in decoherence-free subspaces protects quantum information from control imprecisions and decoherence. For the non-collective decoherence that each qubit has its own bath, we show the implementations of two non-commutable holonomic single-qubit gates and one holonomic nontrivial two-qubit gate that compose a universal set of non-adiabatic holonomic quantum gates in decoherence-free-subspaces of the decoupling group, with an encoding rate of (N - 2)/N. The proposed scheme is robust against control imprecisions and the non-collective decoherence, and its non-adiabatic property ensures less operation time. We demonstrate that our proposed scheme can be realized by utilizing only two-qubit interactions rather than many-qubit interactions. Our results reduce the complexity of practical implementation of holonomic quantum computation in experiments. We also discuss the physical implementation of our scheme in coupled microcavities.

Diffusion Monte Carlo approach versus adiabatic computation for local Hamiltonians

NASA Astrophysics Data System (ADS)

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.

The theory of variational hybrid quantum-classical algorithms

NASA Astrophysics Data System (ADS)

McClean, Jarrod R.; Romero, Jonathan; Babbush, Ryan; Aspuru-Guzik, Alán

2016-02-01

Many quantum algorithms have daunting resource requirements when compared to what is available today. To address this discrepancy, a quantum-classical hybrid optimization scheme known as ‘the quantum variational eigensolver’ was developed (Peruzzo et al 2014 Nat. Commun. 5 4213) with the philosophy that even minimal quantum resources could be made useful when used in conjunction with classical routines. In this work we extend the general theory of this algorithm and suggest algorithmic improvements for practical implementations. Specifically, we develop a variational adiabatic ansatz and explore unitary coupled cluster where we establish a connection from second order unitary coupled cluster to universal gate sets through a relaxation of exponential operator splitting. We introduce the concept of quantum variational error suppression that allows some errors to be suppressed naturally in this algorithm on a pre-threshold quantum device. Additionally, we analyze truncation and correlated sampling in Hamiltonian averaging as ways to reduce the cost of this procedure. Finally, we show how the use of modern derivative free optimization techniques can offer dramatic computational savings of up to three orders of magnitude over previously used optimization techniques.

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

NASA Astrophysics Data System (ADS)

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.

Building an adiabatic quantum computer simulation in the classroom

NASA Astrophysics Data System (ADS)

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

2018-05-01

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

Quantum Adiabatic Optimization and Combinatorial Landscapes

NASA Technical Reports Server (NTRS)

Smelyanskiy, V. N.; Knysh, S.; Morris, R. D.

2003-01-01

In this paper we analyze the performance of the Quantum Adiabatic Evolution (QAE) algorithm on a variant of Satisfiability problem for an ensemble of random graphs parametrized by the ratio of clauses to variables, gamma = M / N. We introduce a set of macroscopic parameters (landscapes) and put forward an ansatz of universality for random bit flips. We then formulate the problem of finding the smallest eigenvalue and the excitation gap as a statistical mechanics problem. We use the so-called annealing approximation with a refinement that a finite set of macroscopic variables (verses only energy) is used, and are able to show the existence of a dynamic threshold gamma = gammad, beyond which QAE should take an exponentially long time to find a solution. We compare the results for extended and simplified sets of landscapes and provide numerical evidence in support of our universality ansatz.

Adiabatic quantum optimization for associative memory recall

DOE Office of Scientific and Technical Information (OSTI.GOV)

Seddiqi, Hadayat; Humble, Travis S.

Hopfield networks are a variant of associative memory that recall patterns stored in the couplings of an Ising model. Stored memories are conventionally accessed as fixed points in the network dynamics that correspond to energetic minima of the spin state. We show that memories stored in a Hopfield network may also be recalled by energy minimization using adiabatic quantum optimization (AQO). Numerical simulations of the underlying quantum dynamics allow us to quantify AQO recall accuracy with respect to the number of stored memories and noise in the input key. We investigate AQO performance with respect to how memories are storedmore » in the Ising model according to different learning rules. Our results demonstrate that AQO recall accuracy varies strongly with learning rule, a behavior that is attributed to differences in energy landscapes. Consequently, learning rules offer a family of methods for programming adiabatic quantum optimization that we expect to be useful for characterizing AQO performance.« less

Adiabatic Quantum Optimization for Associative Memory Recall

NASA Astrophysics Data System (ADS)

Seddiqi, Hadayat; Humble, Travis

2014-12-01

Hopfield networks are a variant of associative memory that recall patterns stored in the couplings of an Ising model. Stored memories are conventionally accessed as fixed points in the network dynamics that correspond to energetic minima of the spin state. We show that memories stored in a Hopfield network may also be recalled by energy minimization using adiabatic quantum optimization (AQO). Numerical simulations of the underlying quantum dynamics allow us to quantify AQO recall accuracy with respect to the number of stored memories and noise in the input key. We investigate AQO performance with respect to how memories are stored in the Ising model according to different learning rules. Our results demonstrate that AQO recall accuracy varies strongly with learning rule, a behavior that is attributed to differences in energy landscapes. Consequently, learning rules offer a family of methods for programming adiabatic quantum optimization that we expect to be useful for characterizing AQO performance.

Adiabatic quantum optimization for associative memory recall

DOE PAGES

Seddiqi, Hadayat; Humble, Travis S.

2014-12-22

Hopfield networks are a variant of associative memory that recall patterns stored in the couplings of an Ising model. Stored memories are conventionally accessed as fixed points in the network dynamics that correspond to energetic minima of the spin state. We show that memories stored in a Hopfield network may also be recalled by energy minimization using adiabatic quantum optimization (AQO). Numerical simulations of the underlying quantum dynamics allow us to quantify AQO recall accuracy with respect to the number of stored memories and noise in the input key. We investigate AQO performance with respect to how memories are storedmore » in the Ising model according to different learning rules. Our results demonstrate that AQO recall accuracy varies strongly with learning rule, a behavior that is attributed to differences in energy landscapes. Consequently, learning rules offer a family of methods for programming adiabatic quantum optimization that we expect to be useful for characterizing AQO performance.« less

Algorithms Bridging Quantum Computation and Chemistry

NASA Astrophysics Data System (ADS)

McClean, Jarrod Ryan

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

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

NASA Astrophysics Data System (ADS)

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.

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

PubMed

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

2007-08-17

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

Applications and error correction for adiabatic quantum optimization

NASA Astrophysics Data System (ADS)

Pudenz, Kristen

Adiabatic quantum optimization (AQO) is a fast-developing subfield of quantum information processing which holds great promise in the relatively near future. Here we develop an application, quantum anomaly detection, and an error correction code, Quantum Annealing Correction (QAC), for use with AQO. The motivation for the anomaly detection algorithm is the problematic nature of classical software verification and validation (V&V). The number of lines of code written for safety-critical applications such as cars and aircraft increases each year, and with it the cost of finding errors grows exponentially (the cost of overlooking errors, which can be measured in human safety, is arguably even higher). We approach the V&V problem by using a quantum machine learning algorithm to identify charateristics of software operations that are implemented outside of specifications, then define an AQO to return these anomalous operations as its result. Our error correction work is the first large-scale experimental demonstration of quantum error correcting codes. We develop QAC and apply it to USC's equipment, the first and second generation of commercially available D-Wave AQO processors. We first show comprehensive experimental results for the code's performance on antiferromagnetic chains, scaling the problem size up to 86 logical qubits (344 physical qubits) and recovering significant encoded success rates even when the unencoded success rates drop to almost nothing. A broader set of randomized benchmarking problems is then introduced, for which we observe similar behavior to the antiferromagnetic chain, specifically that the use of QAC is almost always advantageous for problems of sufficient size and difficulty. Along the way, we develop problem-specific optimizations for the code and gain insight into the various on-chip error mechanisms (most prominently thermal noise, since the hardware operates at finite temperature) and the ways QAC counteracts them. We finish by showing

Universal Adiabatic Quantum Computing using Double Quantum Dot Charge Qubits

NASA Astrophysics Data System (ADS)

Ryan-Anderson, Ciaran; Jacobson, N. Tobias; Landahl, Andrew

Adiabatic quantum computation (AQC) provides one path to achieving universal quantum computing in experiment. Computation in the AQC model occurs by starting with an easy to prepare groundstate of some simple Hamiltonian and then adiabatically evolving the Hamiltonian to obtain the groundstate of a final, more complex Hamiltonian. It has been shown that the circuit model can be mapped to AQC Hamiltonians and, thus, AQC can be made universal. Further, these Hamiltonians can be made planar and two-local. We propose using double quantum dot charge qubits (DQDs) to implement such universal AQC Hamiltonians. However, the geometry and restricted set of interactions of DQDs make the application of even these 2-local planar Hamiltonians non-trivial. We present a construction tailored to DQDs to overcome the geometric and interaction contraints and allow for universal AQC. These constraints are dealt with in this construction by making use of perturbation gadgets, which introduce ancillary qubits to mediate interactions. 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.

Towards fault tolerant adiabatic quantum computation.

PubMed

Lidar, Daniel A

2008-04-25

I show how to protect adiabatic quantum computation (AQC) against decoherence and certain control errors, using a hybrid methodology involving dynamical decoupling, subsystem and stabilizer codes, and energy gaps. Corresponding error bounds are derived. As an example, I show how to perform decoherence-protected AQC against local noise using at most two-body interactions.

Quantum state conversion in opto-electro-mechanical systems via shortcut to adiabaticity

NASA Astrophysics Data System (ADS)

Zhou, Xiao; Liu, Bao-Jie; Shao, L.-B.; Zhang, Xin-Ding; Xue, Zheng-Yuan

2017-09-01

Adiabatic processes have found many important applications in modern physics, the distinct merit of which is that accurate control over process timing is not required. However, such processes are slow, which limits their application in quantum computation, due to the limited coherent times of typical quantum systems. Here, we propose a scheme to implement quantum state conversion in opto-electro-mechanical systems via a shortcut to adiabaticity, where the process can be greatly speeded up while precise timing control is still not necessary. In our scheme, by modifying only the coupling strength, we can achieve fast quantum state conversion with high fidelity, where the adiabatic condition does not need to be met. In addition, the population of the unwanted intermediate state can be further suppressed. Therefore, our protocol presents an important step towards practical state conversion between optical and microwave photons, and thus may find many important applications in hybrid quantum information processing.

Interacting adiabatic quantum motor

NASA Astrophysics Data System (ADS)

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.

Quantum factorization of 143 on a dipolar-coupling nuclear magnetic resonance system.

PubMed

Xu, Nanyang; Zhu, Jing; Lu, Dawei; Zhou, Xianyi; Peng, Xinhua; Du, Jiangfeng

2012-03-30

Quantum algorithms could be much faster than classical ones in solving the factoring problem. Adiabatic quantum computation for this is an alternative approach other than Shor's algorithm. Here we report an improved adiabatic factoring algorithm and its experimental realization to factor the number 143 on a liquid-crystal NMR quantum processor with dipole-dipole couplings. We believe this to be the largest number factored in quantum-computation realizations, which shows the practical importance of adiabatic quantum algorithms.

Quantum many-body adiabaticity, topological Thouless pump and driven impurity in a one-dimensional quantum fluid

NASA Astrophysics Data System (ADS)

Lychkovskiy, Oleg; Gamayun, Oleksandr; Cheianov, Vadim

2018-02-01

The quantum adiabatic theorem states that a driven system can be kept arbitrarily close to the instantaneous eigenstate of its Hamiltonian if the latter varies in time slowly enough. When it comes to applying the adiabatic theorem in practice, the key question to be answered is how slow slowly enough is. This question can be an intricate one, especially for many-body systems, where the limits of slow driving and large system size may not commute. Recently we have shown how the quantum adiabaticity in many-body systems is related to the generalized orthogonality catastrophe [arXiv 1611.00663, to appear in Phys. Rev. Lett.]. We have proven a rigorous inequality relating these two phenomena and applied it to establish conditions for the quantized transport in the topological Thouless pump. In the present contribution we (i) review these developments and (ii) apply the inequality to establish the conditions for adiabaticity in a one-dimensional system consisting of a quantum fluid and an impurity particle pulled through the fluid by an external force. The latter analysis is vital for the correct quantitative description of the phenomenon of quasi-Bloch oscillations in a one-dimensional translation invariant impurity-fluid system.

Fast adiabatic quantum state transfer and entanglement generation between two atoms via dressed states

PubMed Central

Wu, Jin-Lei; Ji, Xin; Zhang, Shou

2017-01-01

We propose a dressed-state scheme to achieve shortcuts to adiabaticity in atom-cavity quantum electrodynamics for speeding up adiabatic two-atom quantum state transfer and maximum entanglement generation. Compared with stimulated Raman adiabatic passage, the dressed-state scheme greatly shortens the operation time in a non-adiabatic way. By means of some numerical simulations, we determine the parameters which can guarantee the feasibility and efficiency both in theory and experiment. Besides, numerical simulations also show the scheme is robust against the variations in the parameters, atomic spontaneous emissions and the photon leakages from the cavity. PMID:28397793

Architectures and Applications for Scalable Quantum Information Systems

DTIC Science & Technology

2007-01-01

quantum computation models, such as adiabatic quantum computing , can be converted to quantum circuits. Therefore, in our design flow’s first phase...vol. 26, no. 5, pp. 1484–1509, 1997. [19] A. Childs, E. Farhi, and J. Preskill, “Robustness of adiabatic quantum computation ,” Phys. Rev. A, vol. 65...magnetic resonance computer with three quantum bits that simulates an adiabatic quantum optimization algorithm. Adiabatic

Non-adiabatic quantum reactive scattering in hyperspherical coordinates

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kendrick, Brian K.

A new electronically non-adiabatic quantum reactive scattering methodology is presented based on a time-independent coupled channel formalism and the adiabatically adjusting principal axis hyperspherical coordinates of Pack and Parker [J. Chem. Phys. 87, 3888 (1987)]. The methodology computes the full state-to-state scattering matrix for A + B 2(v, j) ↔ AB(v', j') + B and A + AB(v, j) → A + AB(v', j') reactions that involve two coupled electronic states which exhibit a conical intersection. The methodology accurately treats all six degrees of freedom relative to the center-of-mass which includes non-zero total angular momentum J and identical particle exchangemore » symmetry. The new methodology is applied to the ultracold hydrogen exchange reaction for which large geometric phase effects have been recently reported [B. K. Kendrick et al., Phys. Rev. Lett. 115, 153201 (2015)]. Rate coefficients for the H/D + HD(v = 4, j = 0) → H/D + HD(v', j') reactions are reported for collision energies between 1 μK and 100 K (total energy ≈1.9 eV). A new diabatic potential energy matrix is developed based on the Boothroyd, Keogh, Martin, and Peterson (BKMP2) and double many body expansion plus single-polynomial (DSP) adiabatic potential energy surfaces for the ground and first excited electronic states of H 3, respectively. The rate coefficients computed using the new non-adiabatic methodology and diabatic potential matrix reproduce the recently reported rates that include the geometric phase and are computed using a single adiabatic ground electronic state potential energy surface (BKMP2). The dramatic enhancement and suppression of the ultracold rates due to the geometric phase are confirmed as well as its effects on several shape resonances near 1 K. In conclusion, the results reported here represent the first fully non-adiabatic quantum reactive scattering calculation for an ultracold reaction and validate the importance of the geometric phase on the Wigner

Non-adiabatic quantum reactive scattering in hyperspherical coordinates

NASA Astrophysics Data System (ADS)

Kendrick, Brian K.

2018-01-01

A new electronically non-adiabatic quantum reactive scattering methodology is presented based on a time-independent coupled channel formalism and the adiabatically adjusting principal axis hyperspherical coordinates of Pack and Parker [J. Chem. Phys. 87, 3888 (1987)]. The methodology computes the full state-to-state scattering matrix for A + B2(v , j) ↔ AB(v ', j') + B and A + AB(v , j) → A + AB(v ', j') reactions that involve two coupled electronic states which exhibit a conical intersection. The methodology accurately treats all six degrees of freedom relative to the center-of-mass which includes non-zero total angular momentum J and identical particle exchange symmetry. The new methodology is applied to the ultracold hydrogen exchange reaction for which large geometric phase effects have been recently reported [B. K. Kendrick et al., Phys. Rev. Lett. 115, 153201 (2015)]. Rate coefficients for the H/D + HD(v = 4, j = 0) → H/D + HD(v ', j') reactions are reported for collision energies between 1 μK and 100 K (total energy ≈1.9 eV). A new diabatic potential energy matrix is developed based on the Boothroyd, Keogh, Martin, and Peterson (BKMP2) and double many body expansion plus single-polynomial (DSP) adiabatic potential energy surfaces for the ground and first excited electronic states of H3, respectively. The rate coefficients computed using the new non-adiabatic methodology and diabatic potential matrix reproduce the recently reported rates that include the geometric phase and are computed using a single adiabatic ground electronic state potential energy surface (BKMP2). The dramatic enhancement and suppression of the ultracold rates due to the geometric phase are confirmed as well as its effects on several shape resonances near 1 K. The results reported here represent the first fully non-adiabatic quantum reactive scattering calculation for an ultracold reaction and validate the importance of the geometric phase on the Wigner threshold behavior.

Non-adiabatic quantum reactive scattering in hyperspherical coordinates

DOE PAGES

Kendrick, Brian K.

2018-01-28

A new electronically non-adiabatic quantum reactive scattering methodology is presented based on a time-independent coupled channel formalism and the adiabatically adjusting principal axis hyperspherical coordinates of Pack and Parker [J. Chem. Phys. 87, 3888 (1987)]. The methodology computes the full state-to-state scattering matrix for A + B 2(v, j) ↔ AB(v', j') + B and A + AB(v, j) → A + AB(v', j') reactions that involve two coupled electronic states which exhibit a conical intersection. The methodology accurately treats all six degrees of freedom relative to the center-of-mass which includes non-zero total angular momentum J and identical particle exchangemore » symmetry. The new methodology is applied to the ultracold hydrogen exchange reaction for which large geometric phase effects have been recently reported [B. K. Kendrick et al., Phys. Rev. Lett. 115, 153201 (2015)]. Rate coefficients for the H/D + HD(v = 4, j = 0) → H/D + HD(v', j') reactions are reported for collision energies between 1 μK and 100 K (total energy ≈1.9 eV). A new diabatic potential energy matrix is developed based on the Boothroyd, Keogh, Martin, and Peterson (BKMP2) and double many body expansion plus single-polynomial (DSP) adiabatic potential energy surfaces for the ground and first excited electronic states of H 3, respectively. The rate coefficients computed using the new non-adiabatic methodology and diabatic potential matrix reproduce the recently reported rates that include the geometric phase and are computed using a single adiabatic ground electronic state potential energy surface (BKMP2). The dramatic enhancement and suppression of the ultracold rates due to the geometric phase are confirmed as well as its effects on several shape resonances near 1 K. In conclusion, the results reported here represent the first fully non-adiabatic quantum reactive scattering calculation for an ultracold reaction and validate the importance of the geometric phase on the Wigner

Shortcuts to adiabaticity for accelerated quantum state transfer

NASA Astrophysics Data System (ADS)

Baksic, Alexandre; Ribeiro, Hugo; Clerk, Aashish A.

Adiabatic transfer protocols are among the most powerful and interesting approaches to move quantum states between two different systems. While having many advantages, those schemes are necessarily slow, and hence can suffer from dissipation and noise in the target and/or source system. In this talk, we present an approach that allows to operate a state transfer much faster, without suffering from non-adiabatic errors. The key idea is to work with a basis of dressed states whose very definition incorporates the matrix elements which give rise to non-adiabatic transitions. By introducing additional control fields, we can ensure that the system ``rides'' these new dressed states during the protocol, thus allowing for a fast high fidelity state transfer. We discuss a recent experimental implementation of these ideas in an NV-center Λ-system, as well as extensions to state transfer problems involving propagating states.

A subgradient approach for constrained binary optimization via quantum adiabatic evolution

NASA Astrophysics Data System (ADS)

Karimi, Sahar; Ronagh, Pooya

2017-08-01

Outer approximation method has been proposed for solving the Lagrangian dual of a constrained binary quadratic programming problem via quantum adiabatic evolution in the literature. This should be an efficient prescription for solving the Lagrangian dual problem in the presence of an ideally noise-free quantum adiabatic system. However, current implementations of quantum annealing systems demand methods that are efficient at handling possible sources of noise. In this paper, we consider a subgradient method for finding an optimal primal-dual pair for the Lagrangian dual of a constrained binary polynomial programming problem. We then study the quadratic stable set (QSS) problem as a case study. We see that this method applied to the QSS problem can be viewed as an instance-dependent penalty-term approach that avoids large penalty coefficients. Finally, we report our experimental results of using the D-Wave 2X quantum annealer and conclude that our approach helps this quantum processor to succeed more often in solving these problems compared to the usual penalty-term approaches.

Evaluation of holonomic quantum computation: adiabatic versus nonadiabatic.

PubMed

Cen, LiXiang; Li, XinQi; Yan, YiJing; Zheng, HouZhi; Wang, ShunJin

2003-04-11

Based on the analytical solution to the time-dependent Schrödinger equations, we evaluate the holonomic quantum computation beyond the adiabatic limit. Besides providing rigorous confirmation of the geometrical prediction of holonomies, the present dynamical resolution offers also a practical means to study the nonadiabaticity induced effects for the universal qubit operations.

Universal Quantum Noise in Adiabatic Pumping

NASA Astrophysics Data System (ADS)

Herasymenko, Yaroslav; Snizhko, Kyrylo; Gefen, Yuval

2018-06-01

We consider charge pumping in a system of parafermions, implemented at fractional quantum Hall edges. Our pumping protocol leads to a noisy behavior of the pumped current. As the adiabatic limit is approached, not only does the noisy behavior persist but the counting statistics of the pumped current becomes robust and universal. In particular, the resulting Fano factor is given in terms of the system's topological degeneracy and the pumped quasiparticle charge. Our results are also applicable to the more conventional Majorana fermions.

Adiabatic Quantum Transistors (Open Access, Publisher’s Version)

DTIC Science & Technology

2013-06-14

states are the entangled states originally used to perform measurement-based quantum computation [9,19]. To de- fine the Hamiltonian of our system, we need...carries over to our model. Note that fault-tolerant QC requires expunging entropy (usually via measurement), but this can always be placed at the end... entropy of quantum er- rors, and the latter is important for building architectures that are modular and synchronous. A. Adiabatic measurement amplifier

Adiabatic Quantum Computation with Neutral Atoms

NASA Astrophysics Data System (ADS)

Biedermann, Grant

2013-03-01

We are implementing a new platform for adiabatic quantum computation (AQC)[2] based on trapped neutral atoms whose coupling is mediated by the dipole-dipole interactions of Rydberg states. Ground state cesium atoms are dressed by laser fields in a manner conditional on the Rydberg blockade mechanism,[3,4] thereby providing the requisite entangling interactions. As a benchmark we study a Quadratic Unconstrained Binary Optimization (QUBO) problem whose solution is found in the ground state spin configuration of an Ising-like model. In collaboration with Lambert Parazzoli, Sandia National Laboratories; Aaron Hankin, Center for Quantum Information and Control (CQuIC), University of New Mexico; James Chin-Wen Chou, Yuan-Yu Jau, Peter Schwindt, Cort Johnson, and George Burns, Sandia National Laboratories; Tyler Keating, Krittika Goyal, and Ivan Deutsch, Center for Quantum Information and Control (CQuIC), University of New Mexico; and Andrew Landahl, Sandia National Laboratories. This work was supported by the Laboratory Directed Research and Development program at Sandia National Laboratories

Consistency of the adiabatic theorem.

PubMed

Amin, M H S

2009-06-05

The adiabatic theorem provides the basis for the adiabatic model of quantum computation. Recently the conditions required for the adiabatic theorem to hold have become a subject of some controversy. Here we show that the reported violations of the adiabatic theorem all arise from resonant transitions between energy levels. In the absence of fast driven oscillations the traditional adiabatic theorem holds. Implications for adiabatic quantum computation are discussed.

Nongeometric conditional phase shift via adiabatic evolution of dark eigenstates: a new approach to quantum computation.

PubMed

Zheng, Shi-Biao

2005-08-19

We propose a new approach to quantum phase gates via the adiabatic evolution. The conditional phase shift is neither of dynamical nor geometric origin. It arises from the adiabatic evolution of the dark state itself. Taking advantage of the adiabatic passage, this kind of quantum logic gates is robust against moderate fluctuations of experimental parameters. In comparison with the geometric phase gates, it is unnecessary to drive the system to undergo a desired cyclic evolution to obtain a desired solid angle. Thus, the procedure is simplified, and the fidelity may be further improved since the errors in obtaining the required solid angle are avoided. We illustrate such a kind of quantum logic gates in the ion trap system. The idea can also be realized in other systems, opening a new perspective for quantum information processing.

Universal adiabatic quantum computation via the space-time circuit-to-Hamiltonian construction.

PubMed

Gosset, David; Terhal, Barbara M; Vershynina, Anna

2015-04-10

We show how to perform universal adiabatic quantum computation using a Hamiltonian which describes a set of particles with local interactions on a two-dimensional grid. A single parameter in the Hamiltonian is adiabatically changed as a function of time to simulate the quantum circuit. We bound the eigenvalue gap above the unique ground state by mapping our model onto the ferromagnetic XXZ chain with kink boundary conditions; the gap of this spin chain was computed exactly by Koma and Nachtergaele using its q-deformed version of SU(2) symmetry. We also discuss a related time-independent Hamiltonian which was shown by Janzing to be capable of universal computation. We observe that in the limit of large system size, the time evolution is equivalent to the exactly solvable quantum walk on Young's lattice.

Universal Adiabatic Quantum Computation via the Space-Time Circuit-to-Hamiltonian Construction

NASA Astrophysics Data System (ADS)

Gosset, David; Terhal, Barbara M.; Vershynina, Anna

2015-04-01

We show how to perform universal adiabatic quantum computation using a Hamiltonian which describes a set of particles with local interactions on a two-dimensional grid. A single parameter in the Hamiltonian is adiabatically changed as a function of time to simulate the quantum circuit. We bound the eigenvalue gap above the unique ground state by mapping our model onto the ferromagnetic X X Z chain with kink boundary conditions; the gap of this spin chain was computed exactly by Koma and Nachtergaele using its q -deformed version of SU(2) symmetry. We also discuss a related time-independent Hamiltonian which was shown by Janzing to be capable of universal computation. We observe that in the limit of large system size, the time evolution is equivalent to the exactly solvable quantum walk on Young's lattice.

Adiabatic Quantum Computation with Neutral Cesium

NASA Astrophysics Data System (ADS)

Hankin, Aaron; Parazzoli, L.; Chou, Chin-Wen; Jau, Yuan-Yu; Burns, George; Young, Amber; Kemme, Shanalyn; Ferdinand, Andrew; Biedermann, Grant; Landahl, Andrew; Ivan H. Deutsch Collaboration; Mark Saffman Collaboration

2013-05-01

We are implementing a new platform for adiabatic quantum computation (AQC) based on trapped neutral atoms whose coupling is mediated by the dipole-dipole interactions of Rydberg states. Ground state cesium atoms are dressed by laser fields in a manner conditional on the Rydberg blockade mechanism, thereby providing the requisite entangling interactions. As a benchmark we study a Quadratic Unconstrained Binary Optimization (QUBO) problem whose solution is found in the ground state spin configuration of an Ising-like model. University of New Mexico: Ivan H. Deutsch, Tyler Keating, Krittika Goyal.

Universal non-adiabatic holonomic quantum computation in decoherence-free subspaces with quantum dots inside a cavity

NASA Astrophysics Data System (ADS)

Liu, Jun; Dong, Ping; Zhou, Jian; Cao, Zhuo-Liang

2017-05-01

A scheme for implementing the non-adiabatic holonomic quantum computation in decoherence-free subspaces is proposed with the interactions between a microcavity and quantum dots. A universal set of quantum gates can be constructed on the encoded logical qubits with high fidelities. The current scheme can suppress both local and collective noises, which is very important for achieving universal quantum computation. Discussions about the gate fidelities with the experimental parameters show that our schemes can be implemented in current experimental technology. Therefore, our scenario offers a method for universal and robust solid-state quantum computation.

More bang for your buck: super-adiabatic quantum engines.

PubMed

del Campo, A; Goold, J; Paternostro, M

2014-08-28

The practical untenability of the quasi-static assumption makes any realistic engine intrinsically irreversible and its operating time finite, thus implying friction effects at short cycle times. An important technological goal is thus the design of maximally efficient engines working at the maximum possible power. We show that, by utilising shortcuts to adiabaticity in a quantum engine cycle, one can engineer a thermodynamic cycle working at finite power and zero friction. Our findings are illustrated using a harmonic oscillator undergoing a quantum Otto cycle.

More bang for your buck: Super-adiabatic quantum engines

PubMed Central

Campo, A. del; Goold, J.; Paternostro, M.

2014-01-01

The practical untenability of the quasi-static assumption makes any realistic engine intrinsically irreversible and its operating time finite, thus implying friction effects at short cycle times. An important technological goal is thus the design of maximally efficient engines working at the maximum possible power. We show that, by utilising shortcuts to adiabaticity in a quantum engine cycle, one can engineer a thermodynamic cycle working at finite power and zero friction. Our findings are illustrated using a harmonic oscillator undergoing a quantum Otto cycle. PMID:25163421

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

NASA Astrophysics Data System (ADS)

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

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

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

NASA Astrophysics Data System (ADS)

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.

Measurement-based quantum computation on two-body interacting qubits with adiabatic evolution.

PubMed

Kyaw, Thi Ha; Li, Ying; Kwek, Leong-Chuan

2014-10-31

A cluster state cannot be a unique ground state of a two-body interacting Hamiltonian. Here, we propose the creation of a cluster state of logical qubits encoded in spin-1/2 particles by adiabatically weakening two-body interactions. The proposal is valid for any spatial dimensional cluster states. Errors induced by thermal fluctuations and adiabatic evolution within finite time can be eliminated ensuring fault-tolerant quantum computing schemes.

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

PubMed

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

2008-12-10

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

Efficient shortcuts to adiabatic passage for three-dimensional entanglement generation via transitionless quantum driving

PubMed Central

He, Shuang; Su, Shi-Lei; Wang, Dong-Yang; Sun, Wen-Mei; Bai, Cheng-Hua; Zhu, Ai-Dong; Wang, Hong-Fu; Zhang, Shou

2016-01-01

We propose an effective scheme of shortcuts to adiabaticity for generating a three-dimensional entanglement of two atoms trapped in a cavity using the transitionless quantum driving (TQD) approach. The key point of this approach is to construct an effective Hamiltonian that drives the dynamics of a system along instantaneous eigenstates of a reference Hamiltonian to reproduce the same final state as that of an adiabatic process within a much shorter time. In this paper, the shortcuts to adiabatic passage are constructed by introducing two auxiliary excited levels in each atom and applying extra cavity modes and classical fields to drive the relevant transitions. Thereby, the three-dimensional entanglement is obtained with a faster rate than that in the adiabatic passage. Moreover, the influences of atomic spontaneous emission and photon loss on the fidelity are discussed by numerical simulation. The results show that the speed of entanglement implementation is greatly improved by the use of adiabatic shortcuts and that this entanglement implementation is robust against decoherence. This will be beneficial to the preparation of high-dimensional entanglement in experiment and provides the necessary conditions for the application of high-dimensional entangled states in quantum information processing. PMID:27499169

Efficient shortcuts to adiabatic passage for three-dimensional entanglement generation via transitionless quantum driving.

PubMed

He, Shuang; Su, Shi-Lei; Wang, Dong-Yang; Sun, Wen-Mei; Bai, Cheng-Hua; Zhu, Ai-Dong; Wang, Hong-Fu; Zhang, Shou

2016-08-08

We propose an effective scheme of shortcuts to adiabaticity for generating a three-dimensional entanglement of two atoms trapped in a cavity using the transitionless quantum driving (TQD) approach. The key point of this approach is to construct an effective Hamiltonian that drives the dynamics of a system along instantaneous eigenstates of a reference Hamiltonian to reproduce the same final state as that of an adiabatic process within a much shorter time. In this paper, the shortcuts to adiabatic passage are constructed by introducing two auxiliary excited levels in each atom and applying extra cavity modes and classical fields to drive the relevant transitions. Thereby, the three-dimensional entanglement is obtained with a faster rate than that in the adiabatic passage. Moreover, the influences of atomic spontaneous emission and photon loss on the fidelity are discussed by numerical simulation. The results show that the speed of entanglement implementation is greatly improved by the use of adiabatic shortcuts and that this entanglement implementation is robust against decoherence. This will be beneficial to the preparation of high-dimensional entanglement in experiment and provides the necessary conditions for the application of high-dimensional entangled states in quantum information processing.

Acquisition of an Adiabatic Demagnetization Refrigerator for Quantum Information Science with Superconducting Circuits

DTIC Science & Technology

2015-11-23

SECURITY CLASSIFICATION OF: The DURIP award provided funds for acquiring a cryogen-free adiabatic demagnetization refrigerator at Syracuse University...The new refrigerator has been installed and is now fully operational. The PI has intensive research efforts in the area of Quantum Information...Aug-2014 24-Aug-2015 Approved for Public Release; Distribution Unlimited Final Report: Acquisition of an Adiabatic Demagnetization Refrigerator for

An adiabatic quantum flux parametron as an ultra-low-power logic device

NASA Astrophysics Data System (ADS)

Takeuchi, Naoki; Ozawa, Dan; Yamanashi, Yuki; Yoshikawa, Nobuyuki

2013-03-01

Ultra-low-power adiabatic quantum flux parametron (QFP) logic is investigated since it has the potential to reduce the bit energy per operation to the order of the thermal energy. In this approach, nonhysteretic QFPs are operated slowly to prevent nonadiabatic energy dissipation occurring during switching events. The designed adiabatic QFP gate is estimated to have a dynamic energy dissipation of 12% of IcΦ0 for a rise/fall time of 1000 ps. It can be further reduced by reducing circuit inductances. Three stages of adiabatic QFP NOT gates were fabricated using a Nb Josephson integrated circuit process and their correct operation was confirmed.

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

NASA Astrophysics Data System (ADS)

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.

The Adiabatic Theorem and Linear Response Theory for Extended Quantum Systems

NASA Astrophysics Data System (ADS)

Bachmann, Sven; De Roeck, Wojciech; Fraas, Martin

2018-03-01

The adiabatic theorem refers to a setup where an evolution equation contains a time-dependent parameter whose change is very slow, measured by a vanishing parameter ɛ. Under suitable assumptions the solution of the time-inhomogenous equation stays close to an instantaneous fixpoint. In the present paper, we prove an adiabatic theorem with an error bound that is independent of the number of degrees of freedom. Our setup is that of quantum spin systems where the manifold of ground states is separated from the rest of the spectrum by a spectral gap. One important application is the proof of the validity of linear response theory for such extended, genuinely interacting systems. In general, this is a long-standing mathematical problem, which can be solved in the present particular case of a gapped system, relevant e.g. for the integer quantum Hall effect.

Novel latch for adiabatic quantum-flux-parametron logic

DOE Office of Scientific and Technical Information (OSTI.GOV)

Takeuchi, Naoki, E-mail: takeuchi-naoki-kx@ynu.jp; Yamanashi, Yuki; Yoshikawa, Nobuyuki

2014-03-14

We herein propose the quantum-flux-latch (QFL) as a novel latch for adiabatic quantum-flux-parametron (AQFP) logic. A QFL is very compact and compatible with AQFP logic gates and can be read out in one clock cycle. Simulation results revealed that the QFL operates at 5 GHz with wide parameter margins of more than ±22%. The calculated energy dissipation was only ∼0.1 aJ/bit, which yields a small energy delay product of 20 aJ·ps. We also designed shift registers using QFLs to demonstrate more complex circuits with QFLs. Finally, we experimentally demonstrated correct operations of the QFL and a 1-bit shift register (a D flip-flop)

Partial differential equations constrained combinatorial optimization on an adiabatic quantum computer

NASA Astrophysics Data System (ADS)

Chandra, Rishabh

Partial differential equation-constrained combinatorial optimization (PDECCO) problems are a mixture of continuous and discrete optimization problems. PDECCO problems have discrete controls, but since the partial differential equations (PDE) are continuous, the optimization space is continuous as well. Such problems have several applications, such as gas/water network optimization, traffic optimization, micro-chip cooling optimization, etc. Currently, no efficient classical algorithm which guarantees a global minimum for PDECCO problems exists. A new mapping has been developed that transforms PDECCO problem, which only have linear PDEs as constraints, into quadratic unconstrained binary optimization (QUBO) problems that can be solved using an adiabatic quantum optimizer (AQO). The mapping is efficient, it scales polynomially with the size of the PDECCO problem, requires only one PDE solve to form the QUBO problem, and if the QUBO problem is solved correctly and efficiently on an AQO, guarantees a global optimal solution for the original PDECCO problem.

Duality quantum algorithm efficiently simulates open quantum systems

PubMed Central

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

Adiabatic evolution of decoherence-free subspaces and its shortcuts

NASA Astrophysics Data System (ADS)

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.

Quantum algorithms for quantum field theories.

PubMed

Jordan, Stephen P; Lee, Keith S M; Preskill, John

2012-06-01

Quantum field theory reconciles quantum mechanics and special relativity, and plays a central role in many areas of physics. We developed a quantum algorithm to compute relativistic scattering probabilities in a massive quantum field theory with quartic self-interactions (φ(4) theory) in spacetime of four and fewer dimensions. Its run time is polynomial in the number of particles, their energy, and the desired precision, and applies at both weak and strong coupling. In the strong-coupling and high-precision regimes, our quantum algorithm achieves exponential speedup over the fastest known classical algorithm.

Optimizing Adiabaticity in a Trapped-Ion Quantum Simulator

NASA Astrophysics Data System (ADS)

Richerme, Phil; Senko, Crystal; Korenblit, Simcha; Smith, Jacob; Lee, Aaron; Monroe, Christopher

2013-05-01

Trapped-ion quantum simulators are a leading platform for the study of interacting spin systems, such as fully-connected Ising models with transverse and axial fields. Phonon-mediated spin-dependent optical dipole forces act globally on a linear chain of trapped Yb-171+ ions to generate the spin-spin couplings, with the form and range of such couplings controlled by laser frequencies and trap voltages. The spins are initially prepared along an effective transverse magnetic field, which is large compared to the Ising couplings and slowly ramped down during the quantum simulation. The system remains in the ground state throughout the evolution if the ramp is adiabatic, and the spin ordering is directly measured by state-dependent fluorescence imaging of the ions onto a camera. Two techniques can improve the identification of the ground state at the end of simulations that are unavoidably diabatic. First, we show an optimized ramp protocol that gives a maximal probability of measuring the true ground state given a finite ramp time. Second, we show that no spin ordering is more prevalent than the ground state(s), even for non-adiabatic ramps. This work is supported by grants from the U.S. Army Research Office with funding from the DARPA OLE program, IARPA, and the MURI program; and the NSF Physics Frontier Center at JQI.

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

PubMed

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.

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

NASA Astrophysics Data System (ADS)

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.

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

PubMed

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.

Shortcuts to adiabaticity using flow fields

NASA Astrophysics Data System (ADS)

Patra, Ayoti; Jarzynski, Christopher

2017-12-01

A shortcut to adiabaticity is a recipe for generating adiabatic evolution at an arbitrary pace. Shortcuts have been developed for quantum, classical and (most recently) stochastic dynamics. A shortcut might involve a counterdiabatic (CD) Hamiltonian that causes a system to follow the adiabatic evolution at all times, or it might utilize a fast-forward (FF) potential, which returns the system to the adiabatic path at the end of the process. We develop a general framework for constructing shortcuts to adiabaticity from flow fields that describe the desired adiabatic evolution. Our approach encompasses quantum, classical and stochastic dynamics, and provides surprisingly compact expressions for both CD Hamiltonians and FF potentials. We illustrate our method with numerical simulations of a model system, and we compare our shortcuts with previously obtained results. We also consider the semiclassical connections between our quantum and classical shortcuts. Our method, like the FF approach developed by previous authors, is susceptible to singularities when applied to excited states of quantum systems; we propose a simple, intuitive criterion for determining whether these singularities will arise, for a given excited state.

Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems

NASA Astrophysics Data System (ADS)

Mandrà, Salvatore; Giacomo Guerreschi, Gian; Aspuru-Guzik, Alán

2016-07-01

We present an exact quantum algorithm for solving the Exact Satisfiability problem, which belongs to the important NP-complete complexity class. The algorithm is based on an intuitive approach that can be divided into two parts: the first step consists in the identification and efficient characterization of a restricted subspace that contains all the valid assignments of the Exact Satisfiability; while the second part performs a quantum search in such restricted subspace. The quantum algorithm can be used either to find a valid assignment (or to certify that no solution exists) or to count the total number of valid assignments. The query complexities for the worst-case are respectively bounded by O(\\sqrt{{2}n-{M\\prime }}) and O({2}n-{M\\prime }), where n is the number of variables and {M}\\prime the number of linearly independent clauses. Remarkably, the proposed quantum algorithm results to be faster than any known exact classical algorithm to solve dense formulas of Exact Satisfiability. As a concrete application, we provide the worst-case complexity for the Hamiltonian cycle problem obtained after mapping it to a suitable Occupation problem. Specifically, we show that the time complexity for the proposed quantum algorithm is bounded by O({2}n/4) for 3-regular undirected graphs, where n is the number of nodes. The same worst-case complexity holds for (3,3)-regular bipartite graphs. As a reference, the current best classical algorithm has a (worst-case) running time bounded by O({2}31n/96). Finally, when compared to heuristic techniques for Exact Satisfiability problems, the proposed quantum algorithm is faster than the classical WalkSAT and Adiabatic Quantum Optimization for random instances with a density of constraints close to the satisfiability threshold, the regime in which instances are typically the hardest to solve. The proposed quantum algorithm can be straightforwardly extended to the generalized version of the Exact Satisfiability known as Occupation

Resonant transition-based quantum computation

NASA Astrophysics Data System (ADS)

Chiang, Chen-Fu; Hsieh, Chang-Yu

2017-05-01

In this article we assess a novel quantum computation paradigm based on the resonant transition (RT) phenomenon commonly associated with atomic and molecular systems. We thoroughly analyze the intimate connections between the RT-based quantum computation and the well-established adiabatic quantum computation (AQC). Both quantum computing frameworks encode solutions to computational problems in the spectral properties of a Hamiltonian and rely on the quantum dynamics to obtain the desired output state. We discuss how one can adapt any adiabatic quantum algorithm to a corresponding RT version and the two approaches are limited by different aspects of Hamiltonians' spectra. The RT approach provides a compelling alternative to the AQC under various circumstances. To better illustrate the usefulness of the novel framework, we analyze the time complexity of an algorithm for 3-SAT problems and discuss straightforward methods to fine tune its efficiency.

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

PubMed

Schegolev, Andrey E; Klenov, Nikolay V; Soloviev, Igor I; Tereshonok, Maxim V

2016-01-01

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.

Experimental realization of non-adiabatic universal quantum gates using geometric Landau-Zener-Stückelberg interferometry

PubMed Central

Wang, Li; Tu, Tao; Gong, Bo; Zhou, Cheng; Guo, Guang-Can

2016-01-01

High fidelity universal gates for quantum bits form an essential ingredient of quantum information processing. In particular, geometric gates have attracted attention because they have a higher intrinsic resistance to certain errors. However, their realization remains a challenge because of the need for complicated quantum control on a multi-level structure as well as meeting the adiabatic condition within a short decoherence time. Here, we demonstrate non-adiabatic quantum operations for a two-level system by applying a well-controlled geometric Landau-Zener-Stückelberg interferometry. By characterizing the gate quality, we also investigate the operation in the presence of realistic dephasing. Furthermore, the result provides an essential model suitable for understanding an interplay of geometric phase and Landau-Zener-Stückelberg process which are well explored separately. PMID:26738875

Recall Performance for Content-Addressable Memory Using Adiabatic Quantum Optimization

DOE Office of Scientific and Technical Information (OSTI.GOV)

Imam, Neena; Humble, Travis S.; McCaskey, Alex

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 recallmore » 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.« less

Adiabatic gate teleportation.

PubMed

Bacon, Dave; Flammia, Steven T

2009-09-18

The difficulty in producing precisely timed and controlled quantum gates is a significant source of error in many physical implementations of quantum computers. Here we introduce a simple universal primitive, adiabatic gate teleportation, which is robust to timing errors and many control errors and maintains a constant energy gap throughout the computation above a degenerate ground state space. This construction allows for geometric robustness based upon the control of two independent qubit interactions. Further, our piecewise adiabatic evolution easily relates to the quantum circuit model, enabling the use of standard methods from fault-tolerance theory for establishing thresholds.

Algorithmic complexity of quantum capacity

NASA Astrophysics Data System (ADS)

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.

Geometry of the Adiabatic Theorem

ERIC Educational Resources Information Center

Lobo, Augusto Cesar; Ribeiro, Rafael Antunes; Ribeiro, Clyffe de Assis; Dieguez, Pedro Ruas

2012-01-01

We present a simple and pedagogical derivation of the quantum adiabatic theorem for two-level systems (a single qubit) based on geometrical structures of quantum mechanics developed by Anandan and Aharonov, among others. We have chosen to use only the minimum geometric structure needed for the understanding of the adiabatic theorem for this case.…

Probing the energy reactance with adiabatically driven quantum dots

NASA Astrophysics Data System (ADS)

Ludovico, María Florencia; Arrachea, Liliana; Moskalets, Michael; Sánchez, David

2018-02-01

The tunneling Hamiltonian describes a particle transfer from one region to another. Although there is no particle storage in the tunneling region itself, it has an associated amount of energy. The corresponding energy flux was named reactance since, such as an electrical reactance, it manifests itself in time-dependent transport only. We show here that the existence of the energy reactance leads to the universal response of a mesoscopic thermometer, a floating contact coupled to an adiabatically driven quantum dot.

Adiabatic and Non-adiabatic quenches in a Spin-1 Bose Einstein Condensate

NASA Astrophysics Data System (ADS)

Boguslawski, Matthew; Hebbe Madhusudhana, Bharath; Anquez, Martin; Robbins, Bryce; Barrios, Maryrose; Hoang, Thai; Chapman, Michael

2016-05-01

A quantum phase transition (QPT) is observed in a wide range of phenomena. We have studied the dynamics of a spin-1 ferromagnetic Bose-Einstein condensate for both adiabatic and non-adiabatic quenches through a QPT. At the quantum critical point (QCP), finite size effects lead to a non-zero gap, which makes an adiabatic quench possible through the QPT. We experimentally demonstrate such a quench, which is forbidden at the mean field level. For faster quenches through the QCP, the vanishing energy gap causes the reaction timescale of the system to diverge, preventing the system from adiabatically following the ground state. We measure the temporal evolution of the spin populations for different quench speeds and determine the exponents characterizing the scaling of the onset of excitations, which are in good agreement with the predictions of Kibble-Zurek mechanism.

A review on quantum search algorithms

NASA Astrophysics Data System (ADS)

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.

A quantum–quantum Metropolis algorithm

PubMed Central

Yung, Man-Hong; Aspuru-Guzik, Alán

2012-01-01

The classical Metropolis sampling method is a cornerstone of many statistical modeling applications that range from physics, chemistry, and biology to economics. This method is particularly suitable for sampling the thermal distributions of classical systems. The challenge of extending this method to the simulation of arbitrary quantum systems is that, in general, eigenstates of quantum Hamiltonians cannot be obtained efficiently with a classical computer. However, this challenge can be overcome by quantum computers. Here, we present a quantum algorithm which fully generalizes the classical Metropolis algorithm to the quantum domain. The meaning of quantum generalization is twofold: The proposed algorithm is not only applicable to both classical and quantum systems, but also offers a quantum speedup relative to the classical counterpart. Furthermore, unlike the classical method of quantum Monte Carlo, this quantum algorithm does not suffer from the negative-sign problem associated with fermionic systems. Applications of this algorithm include the study of low-temperature properties of quantum systems, such as the Hubbard model, and preparing the thermal states of sizable molecules to simulate, for example, chemical reactions at an arbitrary temperature. PMID:22215584

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

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

2005-09-15

We introduce an efficient, quasideterministic scheme to generate maximally entangled states of two atomic ensembles. The scheme is based on quantum nondemolition measurements of total atomic populations and on adiabatic quantum feedback conditioned by the measurements outputs. The high efficiency of the scheme is tested and confirmed numerically for ideal photodetection as well as in the presence of losses.

Portfolios of quantum algorithms.

PubMed

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.

Cavity QED implementation of non-adiabatic holonomies for universal quantum gates in decoherence-free subspaces with nitrogen-vacancy centers.

PubMed

Zhou, Jian; Yu, Wei-Can; Gao, Yu-Mei; Xue, Zheng-Yuan

2015-06-01

A cavity QED implementation of the non-adiabatic holonomic quantum computation in decoherence-free subspaces is proposed with nitrogen-vacancy centers coupled commonly to the whispering-gallery mode of a microsphere cavity, where a universal set of quantum gates can be realized on the qubits. In our implementation, with the assistant of the appropriate driving fields, the quantum evolution is insensitive to the cavity field state, which is only virtually excited. The implemented non-adiabatic holonomies, utilizing optical transitions in the Λ type of three-level configuration of the nitrogen-vacancy centers, can be used to construct a universal set of quantum gates on the encoded logical qubits. Therefore, our scheme opens up the possibility of realizing universal holonomic quantum computation with cavity assisted interaction on solid-state spins characterized by long coherence times.

Compiling Planning into Quantum Optimization Problems: A Comparative Study

DTIC Science & Technology

2015-06-07

and Sipser, M. 2000. Quantum computation by adiabatic evolution. arXiv:quant- ph/0001106. Fikes, R. E., and Nilsson, N. J. 1972. STRIPS: A new...become available: quantum annealing. Quantum annealing is one of the most accessible quantum algorithms for a computer sci- ence audience not versed...in quantum computing because of its close ties to classical optimization algorithms such as simulated annealing. While large-scale universal quantum

Far-field nanoscopy on a semiconductor quantum dot via a rapid-adiabatic-passage-based switch

NASA Astrophysics Data System (ADS)

Kaldewey, Timo; Kuhlmann, Andreas V.; Valentin, Sascha R.; Ludwig, Arne; Wieck, Andreas D.; Warburton, Richard J.

2018-02-01

The diffraction limit prevents a conventional optical microscope from imaging at the nanoscale. However, nanoscale imaging of molecules is possible by exploiting an intensity-dependent molecular switch1-3. This switch is translated into a microscopy scheme, stimulated emission depletion microscopy4-7. Variants on this scheme exist3,8-13, yet all exploit an incoherent response to the lasers. We present a scheme that relies on a coherent response to a laser. Quantum control of a two-level system proceeds via rapid adiabatic passage, an ideal molecular switch. We implement this scheme on an ensemble of quantum dots. Each quantum dot results in a bright spot in the image with extent down to 30 nm (λ/31). There is no significant loss of intensity with respect to confocal microscopy, resulting in a factor of 10 improvement in emitter position determination. The experiments establish rapid adiabatic passage as a versatile tool in the super-resolution toolbox.

Adiabatic Quantum Computing via the Rydberg Blockade

NASA Astrophysics Data System (ADS)

Keating, Tyler; Goyal, Krittika; Deutsch, Ivan

2012-06-01

We study an architecture for implementing adiabatic quantum computation with trapped neutral atoms. Ground state atoms are dressed by laser fields in a manner conditional on the Rydberg blockade mechanism, thereby providing the requisite entangling interactions. As a benchmark we study the performance of a Quadratic Unconstrained Binary Optimization (QUBO) problem whose solution is found in the ground state spin configuration of an Ising-like model. We model a realistic architecture, including the effects of magnetic level structure, with qubits encoded into the clock states of ^133Cs, effective B-fields implemented through microwaves and light shifts, and atom-atom coupling achieved by excitation to a high-lying Rydberg level. Including the fundamental effects of photon scattering we find a high fidelity for the two-qubit implementation.

Complete Bell-state analysis for superconducting-quantum-interference-device qubits with a transitionless tracking algorithm

NASA Astrophysics Data System (ADS)

Kang, Yi-Hao; Chen, Ye-Hong; Shi, Zhi-Cheng; Huang, Bi-Hua; Song, Jie; Xia, Yan

2017-08-01

We propose a protocol for complete Bell-state analysis for two superconducting-quantum-interference-device qubits. The Bell-state analysis could be completed by using a sequence of microwave pulses designed by the transitionless tracking algorithm, which is a useful method in the technique of shortcut to adiabaticity. After the whole process, the information for distinguishing four Bell states will be encoded on two auxiliary qubits, while the Bell states remain unchanged. One can read out the information by detecting the auxiliary qubits. Thus the Bell-state analysis is nondestructive. The numerical simulations show that the protocol possesses a high success probability of distinguishing each Bell state with current experimental technology even when decoherence is taken into account. Thus, the protocol may have potential applications for the information readout in quantum communications and quantum computations in superconducting quantum networks.

Stimulated Raman adiabatic passage in a three-level superconducting circuit

PubMed Central

Kumar, K. S.; Vepsäläinen, A.; Danilin, S.; Paraoanu, G. S.

2016-01-01

The adiabatic manipulation of quantum states is a powerful technique that opened up new directions in quantum engineering—enabling tests of fundamental concepts such as geometrical phases and topological transitions, and holding the promise of alternative models of quantum computation. Here we benchmark the stimulated Raman adiabatic passage for circuit quantum electrodynamics by employing the first three levels of a transmon qubit. In this ladder configuration, we demonstrate a population transfer efficiency >80% between the ground state and the second excited state using two adiabatic Gaussian-shaped control microwave pulses. By doing quantum tomography at successive moments during the Raman pulses, we investigate the transfer of the population in time domain. Furthermore, we show that this protocol can be reversed by applying a third adiabatic pulse, we study a hybrid nondiabatic–adiabatic sequence, and we present experimental results for a quasi-degenerate intermediate level. PMID:26902454

Stimulated Raman adiabatic passage in a three-level superconducting circuit.

PubMed

Kumar, K S; Vepsäläinen, A; Danilin, S; Paraoanu, G S

2016-02-23

The adiabatic manipulation of quantum states is a powerful technique that opened up new directions in quantum engineering--enabling tests of fundamental concepts such as geometrical phases and topological transitions, and holding the promise of alternative models of quantum computation. Here we benchmark the stimulated Raman adiabatic passage for circuit quantum electrodynamics by employing the first three levels of a transmon qubit. In this ladder configuration, we demonstrate a population transfer efficiency >80% between the ground state and the second excited state using two adiabatic Gaussian-shaped control microwave pulses. By doing quantum tomography at successive moments during the Raman pulses, we investigate the transfer of the population in time domain. Furthermore, we show that this protocol can be reversed by applying a third adiabatic pulse, we study a hybrid nondiabatic-adiabatic sequence, and we present experimental results for a quasi-degenerate intermediate level.

Quadratic constrained mixed discrete optimization with an adiabatic quantum optimizer

NASA Astrophysics Data System (ADS)

Chandra, Rishabh; Jacobson, N. Tobias; Moussa, Jonathan E.; Frankel, Steven H.; Kais, Sabre

2014-07-01

We extend the family of problems that may be implemented on an adiabatic quantum optimizer (AQO). When a quadratic optimization problem has at least one set of discrete controls and the constraints are linear, we call this a quadratic constrained mixed discrete optimization (QCMDO) problem. QCMDO problems are NP-hard, and no efficient classical algorithm for their solution is known. Included in the class of QCMDO problems are combinatorial optimization problems constrained by a linear partial differential equation (PDE) or system of linear PDEs. An essential complication commonly encountered in solving this type of problem is that the linear constraint may introduce many intermediate continuous variables into the optimization while the computational cost grows exponentially with problem size. We resolve this difficulty by developing a constructive mapping from QCMDO to quadratic unconstrained binary optimization (QUBO) such that the size of the QUBO problem depends only on the number of discrete control variables. With a suitable embedding, taking into account the physical constraints of the realizable coupling graph, the resulting QUBO problem can be implemented on an existing AQO. The mapping itself is efficient, scaling cubically with the number of continuous variables in the general case and linearly in the PDE case if an efficient preconditioner is available.

Parametric Quantum Search Algorithm as Quantum Walk: A Quantum Simulation

NASA Astrophysics Data System (ADS)

Ellinas, Demosthenes; Konstandakis, Christos

2016-02-01

Parametric quantum search algorithm (PQSA) is a form of quantum search that results by relaxing the unitarity of the original algorithm. PQSA can naturally be cast in the form of quantum walk, by means of the formalism of oracle algebra. This is due to the fact that the completely positive trace preserving search map used by PQSA, admits a unitarization (unitary dilation) a la quantum walk, at the expense of introducing auxiliary quantum coin-qubit space. The ensuing QW describes a process of spiral motion, chosen to be driven by two unitary Kraus generators, generating planar rotations of Bloch vector around an axis. The quadratic acceleration of quantum search translates into an equivalent quadratic saving of the number of coin qubits in the QW analogue. The associated to QW model Hamiltonian operator is obtained and is shown to represent a multi-particle long-range interacting quantum system that simulates parametric search. Finally, the relation of PQSA-QW simulator to the QW search algorithm is elucidated.

Multiparty Quantum Key Agreement Based on Quantum Search Algorithm

PubMed Central

Cao, Hao; Ma, Wenping

2017-01-01

Quantum key agreement is an important topic that the shared key must be negotiated equally by all participants, and any nontrivial subset of participants cannot fully determine the shared key. To date, the embed modes of subkey in all the previously proposed quantum key agreement protocols are based on either BB84 or entangled states. The research of the quantum key agreement protocol based on quantum search algorithms is still blank. In this paper, on the basis of investigating the properties of quantum search algorithms, we propose the first quantum key agreement protocol whose embed mode of subkey is based on a quantum search algorithm known as Grover’s algorithm. A novel example of protocols with 5 – party is presented. The efficiency analysis shows that our protocol is prior to existing MQKA protocols. Furthermore it is secure against both external attack and internal attacks. PMID:28332610

A quantum causal discovery algorithm

NASA Astrophysics Data System (ADS)

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.

Adiabatic quenches and characterization of amplitude excitations in a continuous quantum phase transition

PubMed Central

Hoang, Thai M.; Bharath, Hebbe M.; Boguslawski, Matthew J.; Anquez, Martin; Robbins, Bryce A.; Chapman, Michael S.

2016-01-01

Spontaneous symmetry breaking occurs in a physical system whenever the ground state does not share the symmetry of the underlying theory, e.g., the Hamiltonian. This mechanism gives rise to massless Nambu–Goldstone modes and massive Anderson–Higgs modes. These modes provide a fundamental understanding of matter in the Universe and appear as collective phase or amplitude excitations of an order parameter in a many-body system. The amplitude excitation plays a crucial role in determining the critical exponents governing universal nonequilibrium dynamics in the Kibble–Zurek mechanism (KZM). Here, we characterize the amplitude excitations in a spin-1 condensate and measure the energy gap for different phases of the quantum phase transition. At the quantum critical point of the transition, finite-size effects lead to a nonzero gap. Our measurements are consistent with this prediction, and furthermore, we demonstrate an adiabatic quench through the phase transition, which is forbidden at the mean field level. This work paves the way toward generating entanglement through an adiabatic phase transition. PMID:27503886

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

NASA Astrophysics Data System (ADS)

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.

Adiabatic passage in photon-echo quantum memories

NASA Astrophysics Data System (ADS)

Demeter, Gabor

2013-11-01

Photon-echo-based quantum memories use inhomogeneously broadened, optically thick ensembles of absorbers to store a weak optical signal and employ various protocols to rephase the atomic coherences for information retrieval. We study the application of two consecutive, frequency-chirped control pulses for coherence rephasing in an ensemble with a “natural” inhomogeneous broadening. Although propagation effects distort the two control pulses differently, chirped pulses that drive adiabatic passage can rephase atomic coherences in an optically thick storage medium. Combined with spatial phase-mismatching techniques to prevent primary echo emission, coherences can be rephased around the ground state to achieve secondary echo emission with close to unit efficiency. Potential advantages over similar schemes working with π pulses include greater potential signal fidelity, reduced noise due to spontaneous emission, and better capability for the storage of multiple memory channels.

Quantum algorithm for support matrix machines

NASA Astrophysics Data System (ADS)

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.

Differential geometric treewidth estimation in adiabatic quantum computation

NASA Astrophysics Data System (ADS)

Wang, Chi; Jonckheere, Edmond; Brun, Todd

2016-10-01

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

Adiabatic Edge Channel Transport in a Nanowire Quantum Point Contact Register.

PubMed

Heedt, S; Manolescu, A; Nemnes, G A; Prost, W; Schubert, J; Grützmacher, D; Schäpers, Th

2016-07-13

We report on a prototype device geometry where a number of quantum point contacts are connected in series in a single quasi-ballistic InAs nanowire. At finite magnetic field the backscattering length is increased up to the micron-scale and the quantum point contacts are connected adiabatically. Hence, several input gates can control the outcome of a ballistic logic operation. The absence of backscattering is explained in terms of selective population of spatially separated edge channels. Evidence is provided by regular Aharonov-Bohm-type conductance oscillations in transverse magnetic fields, in agreement with magnetoconductance calculations. The observation of the Shubnikov-de Haas effect at large magnetic fields corroborates the existence of spatially separated edge channels and provides a new means for nanowire characterization.

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

White, Alexander J.; Center for Nonlinear Studies; Gorshkov, Vyacheslav N.

2014-11-14

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 quantummore » 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.« less

Simulated quantum computation of molecular energies.

PubMed

Aspuru-Guzik, Alán; Dutoi, Anthony D; Love, Peter J; Head-Gordon, Martin

2005-09-09

The calculation time for the energy of atoms and molecules scales exponentially with system size on a classical computer but polynomially using quantum algorithms. We demonstrate that such algorithms can be applied to problems of chemical interest using modest numbers of quantum bits. Calculations of the water and lithium hydride molecular ground-state energies have been carried out on a quantum computer simulator using a recursive phase-estimation algorithm. The recursive algorithm reduces the number of quantum bits required for the readout register from about 20 to 4. Mappings of the molecular wave function to the quantum bits are described. An adiabatic method for the preparation of a good approximate ground-state wave function is described and demonstrated for a stretched hydrogen molecule. The number of quantum bits required scales linearly with the number of basis functions, and the number of gates required grows polynomially with the number of quantum bits.

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

NASA Astrophysics Data System (ADS)

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.

Experimental Studies of Quasi-Adiabatic Quantum-dot Cellular Automata

NASA Astrophysics Data System (ADS)

Orlov, Alexei; Amlani, Islamshah; Kummamuru, Ravi; Toth, Geza; Bernstein, Gary; Lent, Craig; Snider, Gregory

2000-03-01

The computational approach known as Quantum-dot Cellular Automata (QCA) uses interacting quantum dots to encode and process binary information. The first realization of a functioning QCA cell has already been reported. Recently, quasi-adiabatic switching of QCA in a metal dot system near the instantaneous ground state was proposed [1]. The advantage if this approach is that it allows both logic and addressable memory to be implemented within the QCA framework. We report on the fabrication and measurement of such a device in the Al-AlOx tunnel junction system. This basic building block consists of three metal islands connected in series by tunnel junctions, where an electron can be moved between islands by means of electrostatic perturbation on either control electrodes or adjacent cells. The cell can have three operational modes, i.e. active, locked and null, which provide a solution for ground state computing that is not susceptible to metastable states. [1] G. Toth and C. S. Lent, J. appl. Phys. 85 5, 2977-2984, 1999.

Adiabatic markovian dynamics.

PubMed

Oreshkov, Ognyan; Calsamiglia, John

2010-07-30

We propose a theory of adiabaticity in quantum markovian dynamics based on a decomposition of the Hilbert space induced by the asymptotic behavior of the Lindblad semigroup. A central idea of our approach is that the natural generalization of the concept of eigenspace of the Hamiltonian in the case of markovian dynamics is a noiseless subsystem with a minimal noisy cofactor. Unlike previous attempts to define adiabaticity for open systems, our approach deals exclusively with physical entities and provides a simple, intuitive picture at the Hilbert-space level, linking the notion of adiabaticity to the theory of noiseless subsystems. As two applications of our theory, we propose a general framework for decoherence-assisted computation in noiseless codes and a dissipation-driven approach to holonomic computation based on adiabatic dragging of subsystems that is generally not achievable by nondissipative means.

Research on Palmprint Identification Method Based on Quantum Algorithms

PubMed Central

Zhang, Zhanzhan

2014-01-01

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%. PMID:25105165

Gossip algorithms in quantum networks

NASA Astrophysics Data System (ADS)

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.

Least significant qubit algorithm for quantum images

NASA Astrophysics Data System (ADS)

Sang, Jianzhi; Wang, Shen; Li, Qiong

2016-11-01

To study the feasibility of the classical image least significant bit (LSB) information hiding algorithm on quantum computer, a least significant qubit (LSQb) information hiding algorithm of quantum image is proposed. In this paper, we focus on a novel quantum representation for color digital images (NCQI). Firstly, by designing the three qubits comparator and unitary operators, the reasonability and feasibility of LSQb based on NCQI are presented. Then, the concrete LSQb information hiding algorithm is proposed, which can realize the aim of embedding the secret qubits into the least significant qubits of RGB channels of quantum cover image. Quantum circuit of the LSQb information hiding algorithm is also illustrated. Furthermore, the secrets extracting algorithm and circuit are illustrated through utilizing control-swap gates. The two merits of our algorithm are: (1) it is absolutely blind and (2) when extracting secret binary qubits, it does not need any quantum measurement operation or any other help from classical computer. Finally, simulation and comparative analysis show the performance of our algorithm.

Optimally stopped variational quantum algorithms

NASA Astrophysics Data System (ADS)

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.

Shortcuts to adiabaticity by counterdiabatic driving for trapped-ion displacement in phase space

PubMed Central

An, Shuoming; Lv, Dingshun; del Campo, Adolfo; Kim, Kihwan

2016-01-01

The application of adiabatic protocols in quantum technologies is severely limited by environmental sources of noise and decoherence. Shortcuts to adiabaticity by counterdiabatic driving constitute a powerful alternative that speed up time-evolution while mimicking adiabatic dynamics. Here we report the experimental implementation of counterdiabatic driving in a continuous variable system, a shortcut to the adiabatic transport of a trapped ion in phase space. The resulting dynamics is equivalent to a ‘fast-motion video' of the adiabatic trajectory. The robustness of this protocol is shown to surpass that of competing schemes based on classical local controls and Fourier optimization methods. Our results demonstrate that shortcuts to adiabaticity provide a robust speedup of quantum protocols of wide applicability in quantum technologies. PMID:27669897

Operating Quantum States in Single Magnetic Molecules: Implementation of Grover's Quantum Algorithm.

PubMed

Godfrin, C; Ferhat, A; Ballou, R; Klyatskaya, S; Ruben, M; Wernsdorfer, W; Balestro, F

2017-11-03

Quantum algorithms use the principles of quantum mechanics, such as, for example, quantum superposition, in order to solve particular problems outperforming standard computation. They are developed for cryptography, searching, optimization, simulation, and solving large systems of linear equations. Here, we implement Grover's quantum algorithm, proposed to find an element in an unsorted list, using a single nuclear 3/2 spin carried by a Tb ion sitting in a single molecular magnet transistor. The coherent manipulation of this multilevel quantum system (qudit) is achieved by means of electric fields only. Grover's search algorithm is implemented by constructing a quantum database via a multilevel Hadamard gate. The Grover sequence then allows us to select each state. The presented method is of universal character and can be implemented in any multilevel quantum system with nonequal spaced energy levels, opening the way to novel quantum search algorithms.

Operating Quantum States in Single Magnetic Molecules: Implementation of Grover's Quantum Algorithm

NASA Astrophysics Data System (ADS)

Godfrin, C.; Ferhat, A.; Ballou, R.; Klyatskaya, S.; Ruben, M.; Wernsdorfer, W.; Balestro, F.

2017-11-01

Quantum algorithms use the principles of quantum mechanics, such as, for example, quantum superposition, in order to solve particular problems outperforming standard computation. They are developed for cryptography, searching, optimization, simulation, and solving large systems of linear equations. Here, we implement Grover's quantum algorithm, proposed to find an element in an unsorted list, using a single nuclear 3 /2 spin carried by a Tb ion sitting in a single molecular magnet transistor. The coherent manipulation of this multilevel quantum system (qudit) is achieved by means of electric fields only. Grover's search algorithm is implemented by constructing a quantum database via a multilevel Hadamard gate. The Grover sequence then allows us to select each state. The presented method is of universal character and can be implemented in any multilevel quantum system with nonequal spaced energy levels, opening the way to novel quantum search algorithms.

Trade-off between speed and cost in shortcuts to adiabaticity

NASA Astrophysics Data System (ADS)

Campbell, Steve

Recent years have witnessed a surge of interest in the study of thermal nano-machines that are capable of converting disordered forms of energy into useful work. It has been shown for both classical and quantum systems that external drivings can allow a system to evolve adiabatically even when driven in finite time, a technique commonly known as shortcuts to adiabaticity. It was suggested to use such external drivings to render the unitary processes of a thermodynamic cycle quantum adiabatic, while being performed in finite time. However, implementing an additional external driving requires resources that should be accounted for. Furthermore, and in line with natural intuition, these transformations should not be achievable in arbitrarily short times. First, we will present a computable measure of the cost of a shortcut to adiabaticity. Using this, we then examine the speed with which a quantum system can be driven. As a main result, we will establish a rigorous link between this speed, the quantum speed limit, and the (energetic) cost of implementing such a shortcut to adiabaticity. Interestingly, this link elucidates a trade-off between speed and cost, namely that instantaneous manipulation is impossible as it requires an infinite cost.

Nuclear quantum effects in electronically adiabatic quantum time correlation functions: Application to the absorption spectrum of a hydrated electron

NASA Astrophysics Data System (ADS)

Turi, László; Hantal, György; Rossky, Peter J.; Borgis, Daniel

2009-07-01

A general formalism for introducing nuclear quantum effects in the expression of the quantum time correlation function of an operator in a multilevel electronic system is presented in the adiabatic limit. The final formula includes the nuclear quantum time correlation functions of the operator matrix elements, of the energy gap, and their cross terms. These quantities can be inferred and evaluated from their classical analogs obtained by mixed quantum-classical molecular dynamics simulations. The formalism is applied to the absorption spectrum of a hydrated electron, expressed in terms of the time correlation function of the dipole operator in the ground electronic state. We find that both static and dynamic nuclear quantum effects distinctly influence the shape of the absorption spectrum, especially its high energy tail related to transitions to delocalized electron states. Their inclusion does improve significantly the agreement between theory and experiment for both the low and high frequency edges of the spectrum. It does not appear sufficient, however, to resolve persistent deviations in the slow Lorentzian-like decay part of the spectrum in the intermediate 2-3 eV region.

Generalized shortcuts to adiabaticity and enhanced robustness against decoherence

NASA Astrophysics Data System (ADS)

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.

Central charge from adiabatic transport of cusp singularities in the quantum Hall effect

NASA Astrophysics Data System (ADS)

Can, Tankut

2017-04-01

We study quantum Hall (QH) states on a punctured Riemann sphere. We compute the Berry curvature under adiabatic motion in the moduli space in the large N limit. The Berry curvature is shown to be finite in the large N limit and controlled by the conformal dimension of the cusp singularity, a local property of the mean density. Utilizing exact sum rules obtained from a Ward identity, we show that for the Laughlin wave function, the dimension of a cusp singularity is given by the central charge, a robust geometric response coefficient in the QHE. Thus, adiabatic transport of curvature singularities can be used to determine the central charge of QH states. We also consider the effects of threaded fluxes and spin-deformed wave functions. Finally, we give a closed expression for all moments of the mean density in the integer QH state on a punctured disk.

A random walk approach to quantum algorithms.

PubMed

Kendon, Vivien M

2006-12-15

The development of quantum algorithms based on quantum versions of random walks is placed in the context of the emerging field of quantum computing. Constructing a suitable quantum version of a random walk is not trivial; pure quantum dynamics is deterministic, so randomness only enters during the measurement phase, i.e. when converting the quantum information into classical information. The outcome of a quantum random walk is very different from the corresponding classical random walk owing to the interference between the different possible paths. The upshot is that quantum walkers find themselves further from their starting point than a classical walker on average, and this forms the basis of a quantum speed up, which can be exploited to solve problems faster. Surprisingly, the effect of making the walk slightly less than perfectly quantum can optimize the properties of the quantum walk for algorithmic applications. Looking to the future, even with a small quantum computer available, the development of quantum walk algorithms might proceed more rapidly than it has, especially for solving real problems.

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

Benabbas, Abdelkrim; Salna, Bridget; Sage, J. Timothy

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 isotopemore » 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

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.

PubMed

Benabbas, Abdelkrim; Salna, Bridget; Sage, J Timothy; Champion, Paul M

2015-03-21

Analytical models describing the temperature dependence of the deep tunneling rate, useful for proton, hydrogen, or hydride transfer in proteins, are developed and compared. Electronically adiabatic and non-adiabatic expressions are presented where the donor-acceptor (D-A) motion is treated either as a quantized vibration or as a classical "gating" distribution. We stress the importance of fitting experimental data on an absolute scale in the electronically adiabatic limit, which normally applies to these reactions, and find that vibrationally enhanced deep tunneling takes place on sub-ns timescales at room temperature for typical H-bonding distances. As noted previously, a small room temperature kinetic isotope effect (KIE) does not eliminate deep tunneling as a major transport channel. The quantum approach focuses on the vibrational sub-space composed of the D-A and hydrogen atom motions, where hydrogen bonding and protein restoring forces quantize the D-A vibration. A Duschinsky rotation is mandated between the normal modes of the reactant and product states and the rotation angle depends on the tunneling particle mass. This tunnel-mass dependent rotation contributes substantially to the KIE and its temperature dependence. The effect of the Duschinsky rotation is solved exactly to find the rate in the electronically non-adiabatic limit and compared to the Born-Oppenheimer (B-O) approximation approach. The B-O approximation is employed to find the rate in the electronically adiabatic limit, where we explore both harmonic and quartic double-well potentials for the hydrogen atom bound states. Both the electronically adiabatic and non-adiabatic rates are found to diverge at high temperature unless the proton coupling includes the often neglected quadratic term in the D-A displacement from equilibrium. A new expression is presented for the electronically adiabatic tunnel rate in the classical limit for D-A motion that should be useful to experimentalists working near

An efficient quantum algorithm for spectral estimation

NASA Astrophysics Data System (ADS)

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.

Quantum algorithm for linear regression

NASA Astrophysics Data System (ADS)

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.

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

NASA Astrophysics Data System (ADS)

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.

Hybrid annealing: Coupling a quantum simulator to a classical computer

NASA Astrophysics Data System (ADS)

Graß, Tobias; Lewenstein, Maciej

2017-05-01

Finding the global minimum in a rugged potential landscape is a computationally hard task, often equivalent to relevant optimization problems. Annealing strategies, either classical or quantum, explore the configuration space by evolving the system under the influence of thermal or quantum fluctuations. The thermal annealing dynamics can rapidly freeze the system into a low-energy configuration, and it can be simulated well on a classical computer, but it easily gets stuck in local minima. Quantum annealing, on the other hand, can be guaranteed to find the true ground state and can be implemented in modern quantum simulators; however, quantum adiabatic schemes become prohibitively slow in the presence of quasidegeneracies. Here, we propose a strategy which combines ideas from simulated annealing and quantum annealing. In such a hybrid algorithm, the outcome of a quantum simulator is processed on a classical device. While the quantum simulator explores the configuration space by repeatedly applying quantum fluctuations and performing projective measurements, the classical computer evaluates each configuration and enforces a lowering of the energy. We have simulated this algorithm for small instances of the random energy model, showing that it potentially outperforms both simulated thermal annealing and adiabatic quantum annealing. It becomes most efficient for problems involving many quasidegenerate ground states.

Including Memory Friction in Single- and Two-State Quantum Dynamics Simulations.

PubMed

Brown, Paul A; Messina, Michael

2016-03-03

We present a simple computational algorithm that allows for the inclusion of memory friction in a quantum dynamics simulation of a small, quantum, primary system coupled to many atoms in the surroundings. We show how including a memory friction operator, F̂, in the primary quantum system's Hamiltonian operator builds memory friction into the dynamics of the primary quantum system. We show that, in the harmonic, semi-classical limit, this friction operator causes the classical phase-space centers of a wavepacket to evolve exactly as if it were a classical particle experiencing memory friction. We also show that this friction operator can be used to include memory friction in the quantum dynamics of an anharmonic primary system. We then generalize the algorithm so that it can be used to treat a primary quantum system that is evolving, non-adiabatically on two coupled potential energy surfaces, i.e., a model that can be used to model H atom transfer, for example. We demonstrate this approach's computational ease and flexibility by showing numerical results for both harmonic and anharmonic primary quantum systems in the single surface case. Finally, we present numerical results for a model of non-adiabatic H atom transfer between a reactant and product state that includes memory friction on one or both of the non-adiabatic potential energy surfaces and uncover some interesting dynamical effects of non-memory friction on the H atom transfer process.

LSB Based Quantum Image Steganography Algorithm

NASA Astrophysics Data System (ADS)

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.

Random Walk Quantum Clustering Algorithm Based on Space

NASA Astrophysics Data System (ADS)

Xiao, Shufen; Dong, Yumin; Ma, Hongyang

2018-01-01

In the random quantum walk, which is a quantum simulation of the classical walk, data points interacted when selecting the appropriate walk strategy by taking advantage of quantum-entanglement features; thus, the results obtained when the quantum walk is used are different from those when the classical walk is adopted. A new quantum walk clustering algorithm based on space is proposed by applying the quantum walk to clustering analysis. In this algorithm, data points are viewed as walking participants, and similar data points are clustered using the walk function in the pay-off matrix according to a certain rule. The walk process is simplified by implementing a space-combining rule. The proposed algorithm is validated by a simulation test and is proved superior to existing clustering algorithms, namely, Kmeans, PCA + Kmeans, and LDA-Km. The effects of some of the parameters in the proposed algorithm on its performance are also analyzed and discussed. Specific suggestions are provided.

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

NASA Astrophysics Data System (ADS)

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.

A cross-disciplinary introduction to quantum annealing-based algorithms

NASA Astrophysics Data System (ADS)

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.

Implementation of adiabatic geometric gates with superconducting phase qubits.

PubMed

Peng, Z H; Chu, H F; Wang, Z D; Zheng, D N

2009-01-28

We present an adiabatic geometric quantum computation strategy based on the non-degenerate energy eigenstates in (but not limited to) superconducting phase qubit systems. The fidelity of the designed quantum gate was evaluated in the presence of simulated thermal fluctuations in a superconducting phase qubits circuit and was found to be quite robust against random errors. In addition, it was elucidated that the Berry phase in the designed adiabatic evolution may be detected directly via the quantum state tomography developed for superconducting qubits. We also analyze the effects of control parameter fluctuations on the experimental detection of the Berry phase.

Quantum digital-to-analog conversion algorithm using decoherence

NASA Astrophysics Data System (ADS)

SaiToh, Akira

2015-08-01

We consider the problem of mapping digital data encoded on a quantum register to analog amplitudes in parallel. It is shown to be unlikely that a fully unitary polynomial-time quantum algorithm exists for this problem; NP becomes a subset of BQP if it exists. In the practical point of view, we propose a nonunitary linear-time algorithm using quantum decoherence. It tacitly uses an exponentially large physical resource, which is typically a huge number of identical molecules. Quantumness of correlation appearing in the process of the algorithm is also discussed.

Shor's quantum factoring algorithm on a photonic chip.

PubMed

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.

Fast and efficient wireless power transfer via transitionless quantum driving.

PubMed

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.

Experimental realization of noise-induced adiabaticity in nuclear magnetic resonance

NASA Astrophysics Data System (ADS)

Wang, Bi-Xue; Xin, Tao; Kong, Xiang-Yu; Wei, Shi-Jie; Ruan, Dong; Long, Gui-Lu

2018-04-01

The adiabatic evolution is the dynamics of an instantaneous eigenstate of a slowly varing Hamiltonian. Recently, an interesting phenomenon shows up that white noises can enhance and even induce adiabaticity, which is in contrast to previous perception that environmental noises always modify and even ruin a designed adiabatic passage. We experimentally realized a noise-induced adiabaticity in a nuclear magnetic resonance system. Adiabatic Hadamard gate and entangled state are demonstrated. The effect of noise on adiabaticity is experimentally exhibited and compared with the noise-free process. We utilized a noise-injected method, which can be applied to other quantum systems.

Improved mapping of the travelling salesman problem for quantum annealing

NASA Astrophysics Data System (ADS)

Troyer, Matthias; Heim, Bettina; Brown, Ethan; Wecker, David

2015-03-01

We consider the quantum adiabatic algorithm as applied to the travelling salesman problem (TSP). We introduce a novel mapping of TSP to an Ising spin glass Hamiltonian and compare it to previous known mappings. Through direct perturbative analysis, unitary evolution, and simulated quantum annealing, we show this new mapping to be significantly superior. We discuss how this advantage can translate to actual physical implementations of TSP on quantum annealers.

Adiabatic quantum-flux-parametron cell library adopting minimalist design

DOE Office of Scientific and Technical Information (OSTI.GOV)

Takeuchi, Naoki, E-mail: takeuchi-naoki-kx@ynu.jp; Yamanashi, Yuki; Yoshikawa, Nobuyuki

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 inmore » 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.« less

Adiabatic quantum-flux-parametron cell library adopting minimalist design

NASA Astrophysics Data System (ADS)

Takeuchi, Naoki; Yamanashi, Yuki; Yoshikawa, Nobuyuki

2015-05-01

We herein build an adiabatic quantum-flux-parametron (AQFP) cell library adopting minimalist design and a symmetric layout. In the proposed minimalist design, every logic cell is designed by arraying four types of building block cells: buffer, NOT, constant, and branch cells. Therefore, minimalist design enables us to effectively build and customize an AQFP cell library. The symmetric layout reduces unwanted parasitic magnetic coupling and ensures a large mutual inductance in an output transformer, which enables very long wiring between logic cells. We design and fabricate several logic circuits using the minimal AQFP cell library so as to test logic cells in the library. Moreover, we experimentally investigate the maximum wiring length between logic cells. Finally, we present an experimental demonstration of an 8-bit carry look-ahead adder designed using the minimal AQFP cell library and demonstrate that the proposed cell library is sufficiently robust to realize large-scale digital circuits.

Optimization and experimental realization of the quantum permutation algorithm

NASA Astrophysics Data System (ADS)

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.

Quantum-mechanical approach to predissociation of water dimers in the vibrational adiabatic representation: Importance of channel interactions.

PubMed

Mineo, H; Niu, Y L; Kuo, J L; Lin, S H; Fujimura, Y

2015-08-28

The results of application of the quantum-mechanical adiabatic theory to vibrational predissociation (VPD) of water dimers, (H2O)2 and (D2O)2, are presented. We consider the VPD processes including the totally symmetric OH mode of the dimer and the bending mode of the fragment. The VPD in the adiabatic representation is induced by breakdown of the vibrational adiabatic approximation, and two types of nonadiabatic coupling matrix elements are involved: one provides the VPD induced by the low-frequency dissociation mode and the other provides the VPD through channel interactions induced by the low-frequency modes. The VPD rate constants were calculated using the Fermi golden rule expression. A closed form for the nonadiabatic transition matrix element between the discrete and continuum states was derived in the Morse potential model. All of the parameters used were obtained from the potential surfaces of the water dimers, which were calculated by the density functional theory procedures. The VPD rate constants for the two processes were calculated in the non-Condon scheme beyond the so-called Condon approximation. The channel interactions in and between the initial and final states were taken into account, and those are found to increase the VPD rates by 3(1) orders of magnitude for the VPD processes in (H2O)2 ((D2O)2). The fraction of the bending-excited donor fragments is larger than that of the bending-excited acceptor fragments. The results obtained by quantum-mechanical approach are compared with both experimental and quasi-classical trajectory calculation results.

Quantum algorithms for Gibbs sampling and hitting-time estimation

DOE PAGES

Chowdhury, Anirban Narayan; Somma, Rolando D.

2017-02-01

In this paper, we present quantum algorithms for solving two problems regarding stochastic processes. The first algorithm prepares the thermal Gibbs state of a quantum system and runs in time almost linear in √Nβ/Ζ and polynomial in log(1/ϵ), where N is the Hilbert space dimension, β is the inverse temperature, Ζ is the partition function, and ϵ is the desired precision of the output state. Our quantum algorithm exponentially improves the dependence on 1/ϵ and quadratically improves the dependence on β of known quantum algorithms for this problem. The second algorithm estimates the hitting time of a Markov chain. Formore » a sparse stochastic matrix Ρ, it runs in time almost linear in 1/(ϵΔ 3/2), where ϵ is the absolute precision in the estimation and Δ is a parameter determined by Ρ, and whose inverse is an upper bound of the hitting time. Our quantum algorithm quadratically improves the dependence on 1/ϵ and 1/Δ of the analog classical algorithm for hitting-time estimation. Finally, both algorithms use tools recently developed in the context of Hamiltonian simulation, spectral gap amplification, and solving linear systems of equations.« less

PLQP & Company: Decidable Logics for Quantum Algorithms

NASA Astrophysics Data System (ADS)

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.

Recent developments in trapping and manipulation of atoms with adiabatic potentials

NASA Astrophysics Data System (ADS)

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.

Speeding up adiabatic population transfer in a Josephson qutrit via counter-diabatic driving

NASA Astrophysics Data System (ADS)

Feng, Zhi-Bo; Lu, Xiao-Jing; Li, M.; Yan, Run-Ying; Zhou, Yun-Qing

2017-12-01

We propose a theoretical scheme to speed up adiabatic population transfer in a Josephson artificial qutrit by transitionless quantum driving. At a magic working point, an effective three-level subsystem can be chosen to constitute our qutrit. With Stokes and pump driving, adiabatic population transfer can be achieved in the qutrit by means of stimulated Raman adiabatic passage. Assisted by a counter-diabatic driving, the adiabatic population transfer can be sped up drastically with accessible parameters. Moreover, the accelerated operation is flexibly reversible and highly robust against decoherence effects. Thanks to these distinctive advantages, the present protocol could offer a promising avenue for optimal coherent operations in Josephson quantum circuits.

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

PubMed

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.

Adiabatic two-qubit state preparation in a superconducting qubit system

NASA Astrophysics Data System (ADS)

Filipp, Stefan; Ganzhorn, Marc; Egger, Daniel; Fuhrer, Andreas; Moll, Nikolaj; Mueller, Peter; Roth, Marco; Schmidt, Sebastian

The adiabatic transport of a quantum system from an initial eigenstate to its final state while remaining in the instantaneous eigenstate of the driving Hamiltonian can be used for robust state preparation. With control over both qubit frequencies and qubit-qubit couplings this method can be used to drive the system from initially trivial eigenstates of the uncoupled qubits to complex entangled multi-qubit states. In the context of quantum simulation, the final state may encode a non-trivial ground-state of a complex molecule or, in the context of adiabatic quantum computing, the solution to an optimization problem. Here, we present experimental results on a system comprising fixed-frequency superconducting transmon qubits and a tunable coupler to adjust the qubit-qubit coupling via parametric frequency modulation. We realize different types of interaction by adjusting the frequency of the modulation. A slow variation of drive amplitude and phase leads to an adiabatic steering of the system to its final state showing entanglement between the qubits.

Optimal control of hybrid qubits: Implementing the quantum permutation algorithm

NASA Astrophysics Data System (ADS)

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.

Tunneling and speedup in quantum optimization for permutation-symmetric problems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Muthukrishnan, Siddharth; Albash, Tameem; Lidar, Daniel A.

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 costmore » 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. Lastly, 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.« less

Tunneling and speedup in quantum optimization for permutation-symmetric problems

DOE PAGES

Muthukrishnan, Siddharth; Albash, Tameem; Lidar, Daniel A.

2016-07-21

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 costmore » 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. Lastly, 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.« less

Arbitrated Quantum Signature with Hamiltonian Algorithm Based on Blind Quantum Computation

NASA Astrophysics Data System (ADS)

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.

Arbitrated Quantum Signature with Hamiltonian Algorithm Based on Blind Quantum Computation

NASA Astrophysics Data System (ADS)

Shi, Ronghua; Ding, Wanting; Shi, Jinjing

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

Deterministic quantum annealing expectation-maximization algorithm

NASA Astrophysics Data System (ADS)

Miyahara, Hideyuki; Tsumura, Koji; Sughiyama, Yuki

2017-11-01

Maximum likelihood estimation (MLE) is one of the most important methods in machine learning, and the expectation-maximization (EM) algorithm is often used to obtain maximum likelihood estimates. However, EM heavily depends on initial configurations and fails to find the global optimum. On the other hand, in the field of physics, quantum annealing (QA) was proposed as a novel optimization approach. Motivated by QA, we propose a quantum annealing extension of EM, which we call the deterministic quantum annealing expectation-maximization (DQAEM) algorithm. We also discuss its advantage in terms of the path integral formulation. Furthermore, by employing numerical simulations, we illustrate how DQAEM works in MLE and show that DQAEM moderate the problem of local optima in EM.

Quantum Algorithms and Protocols

NASA Astrophysics Data System (ADS)

Divincenzo, David

2001-06-01

Quantum Computing is better than classical computing, but not just because it speeds up some computations. Some of the best known quantum algorithms, like Grover's, may well have their most interesting applications in settings that involve the combination of computation and communication. Thus, Grover speeds up the appointment scheduling problem by reducing the amount of communication needed between two parties who want to find a common free slot on their calendars. I will review various other applications of this sort that are being explored. Other distributed computing protocols are required to have other attributes like obliviousness and privacy; I will discuss our recent applications involving quantum data hiding.

Quantum diffusion of H/D on Ni(111)—A partially adiabatic centroid MD study

NASA Astrophysics Data System (ADS)

Hopkinson, A. R.; Probert, M. I. J.

2018-03-01

We present the results of a theoretical study of H/D diffusion on a Ni(111) surface at a range of temperatures, from 250 K to 75 K. The diffusion is studied using both classical molecular dynamics and the partially adiabatic centroid molecular dynamics method. The calculations are performed with the hydrogen (or deuterium) moving in 3D across a static nickel surface using a novel Fourier interpolated potential energy surface which has been parameterized to density functional theory calculations. The results of the classical simulations are that the calculated diffusion coefficients are far too small and with too large a variation with temperature compared with experiment. By contrast, the quantum simulations are in much better agreement with experiment and show that quantum effects in the diffusion of hydrogen are significant at all temperatures studied. There is also a crossover to a quantum-dominated diffusive regime for temperatures below ˜150 K for hydrogen and ˜85 K for deuterium. The quantum diffusion coefficients are found to accurately reproduce the spread in values with temperature, but with an absolute value that is a little high compared with experiment.

Adiabatic regularization for gauge fields and the conformal anomaly

NASA Astrophysics Data System (ADS)

Chu, Chong-Sun; Koyama, Yoji

2017-03-01

Adiabatic regularization for quantum field theory in conformally flat spacetime is known for scalar and Dirac fermion fields. In this paper, we complete the construction by establishing the adiabatic regularization scheme for the gauge field. We show that the adiabatic expansion for the mode functions and the adiabatic vacuum can be defined in a similar way using Wentzel-Kramers-Brillouin-type (WKB-type) solutions as the scalar fields. As an application of the adiabatic method, we compute the trace of the energy momentum tensor and reproduce the known result for the conformal anomaly obtained by the other regularization methods. The availability of the adiabatic expansion scheme for the gauge field allows one to study various renormalized physical quantities of theories coupled to (non-Abelian) gauge fields in conformally flat spacetime, such as conformal supersymmetric Yang Mills, inflation, and cosmology.

Defects in Quantum Computers

DOE PAGES

Gardas, Bartłomiej; Dziarmaga, Jacek; Zurek, Wojciech H.; ...

2018-03-14

The shift of interest from general purpose quantum computers to adiabatic quantum computing or quantum annealing calls for a broadly applicable and easy to implement test to assess how quantum or adiabatic is a specific hardware. Here we propose such a test based on an exactly solvable many body system–the quantum Ising chain in transverse field–and implement it on the D-Wave machine. An ideal adiabatic quench of the quantum Ising chain should lead to an ordered broken symmetry ground state with all spins aligned in the same direction. An actual quench can be imperfect due to decoherence, noise, flaws inmore » the implemented Hamiltonian, or simply too fast to be adiabatic. Imperfections result in topological defects: Spins change orientation, kinks punctuating ordered sections of the chain. Therefore, the number of such defects quantifies the extent by which the quantum computer misses the ground state, and is imperfect.« less

Defects in Quantum Computers

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gardas, Bartłomiej; Dziarmaga, Jacek; Zurek, Wojciech H.

The shift of interest from general purpose quantum computers to adiabatic quantum computing or quantum annealing calls for a broadly applicable and easy to implement test to assess how quantum or adiabatic is a specific hardware. Here we propose such a test based on an exactly solvable many body system–the quantum Ising chain in transverse field–and implement it on the D-Wave machine. An ideal adiabatic quench of the quantum Ising chain should lead to an ordered broken symmetry ground state with all spins aligned in the same direction. An actual quench can be imperfect due to decoherence, noise, flaws inmore » the implemented Hamiltonian, or simply too fast to be adiabatic. Imperfections result in topological defects: Spins change orientation, kinks punctuating ordered sections of the chain. Therefore, the number of such defects quantifies the extent by which the quantum computer misses the ground state, and is imperfect.« less

A strategy for quantum algorithm design assisted by machine learning

NASA Astrophysics Data System (ADS)

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.

Asymmetric adiabatic couplers for fully-integrated broadband quantum-polarization state preparation.

PubMed

Chung, Hung-Pin; Huang, Kuang-Hsu; Wang, Kai; Yang, Sung-Lin; Yang, Shih-Yuan; Sung, Chun-I; Solntsev, Alexander S; Sukhorukov, Andrey A; Neshev, Dragomir N; Chen, Yen-Hung

2017-12-04

Spontaneous parametric down-conversion (SPDC) is a widely used method to generate entangled photons, enabling a range of applications from secure communication to tests of quantum physics. Integrating SPDC on a chip provides interferometric stability, allows to reduce a physical footprint, and opens a pathway to true scalability. However, dealing with different photon polarizations and wavelengths on a chip presents a number of challenging problems. In this work, we demonstrate an on-chip polarization beam-splitter based on z-cut titanium-diffused lithium niobate asymmetric adiabatic couplers (AAC) designed for integration with a type-II SPDC source. Our experimental measurements reveal unique polarization beam-splitting regime with the ability to tune the splitting ratios based on wavelength. In particular, we measured a splitting ratio of 17 dB over broadband regions (>60 nm) for both H- and V-polarized lights and a specific 50%/50% splitting ratio for a cross-polarized photon pair from the AAC. The results show that such a system can be used for preparing different quantum polarization-path states that are controllable by changing the phase-matching conditions in the SPDC over a broad band. Furthermore, we propose a fully integrated electro-optically tunable type-II SPDC polarization-path-entangled state preparation circuit on a single lithium niobate photonic chip.

Superadiabatic Controlled Evolutions and Universal Quantum Computation.

PubMed

Santos, Alan C; Sarandy, Marcelo S

2015-10-29

Adiabatic state engineering is a powerful technique in quantum information and quantum control. However, its performance is limited by the adiabatic theorem of quantum mechanics. In this scenario, shortcuts to adiabaticity, such as provided by the superadiabatic theory, constitute a valuable tool to speed up the adiabatic quantum behavior. Here, we propose a superadiabatic route to implement universal quantum computation. Our method is based on the realization of piecewise controlled superadiabatic evolutions. Remarkably, they can be obtained by simple time-independent counter-diabatic Hamiltonians. In particular, we discuss the implementation of fast rotation gates and arbitrary n-qubit controlled gates, which can be used to design different sets of universal quantum gates. Concerning the energy cost of the superadiabatic implementation, we show that it is dictated by the quantum speed limit, providing an upper bound for the corresponding adiabatic counterparts.

Superadiabatic Controlled Evolutions and Universal Quantum Computation

PubMed Central

Santos, Alan C.; Sarandy, Marcelo S.

2015-01-01

Adiabatic state engineering is a powerful technique in quantum information and quantum control. However, its performance is limited by the adiabatic theorem of quantum mechanics. In this scenario, shortcuts to adiabaticity, such as provided by the superadiabatic theory, constitute a valuable tool to speed up the adiabatic quantum behavior. Here, we propose a superadiabatic route to implement universal quantum computation. Our method is based on the realization of piecewise controlled superadiabatic evolutions. Remarkably, they can be obtained by simple time-independent counter-diabatic Hamiltonians. In particular, we discuss the implementation of fast rotation gates and arbitrary n-qubit controlled gates, which can be used to design different sets of universal quantum gates. Concerning the energy cost of the superadiabatic implementation, we show that it is dictated by the quantum speed limit, providing an upper bound for the corresponding adiabatic counterparts. PMID:26511064

Quantum Linear System Algorithm for Dense Matrices.

PubMed

Wossnig, Leonard; Zhao, Zhikuan; Prakash, Anupam

2018-02-02

Solving linear systems of equations is a frequently encountered problem in machine learning and optimization. Given a matrix A and a vector b the task is to find the vector x such that Ax=b. We describe a quantum algorithm that achieves a sparsity-independent runtime scaling of O(κ^{2}sqrt[n]polylog(n)/ε) for an n×n dimensional A with bounded spectral norm, where κ denotes the condition number of A, and ε is the desired precision parameter. This amounts to a polynomial improvement over known quantum linear system algorithms when applied to dense matrices, and poses a new state of the art for solving dense linear systems on a quantum computer. Furthermore, an exponential improvement is achievable if the rank of A is polylogarithmic in the matrix dimension. Our algorithm is built upon a singular value estimation subroutine, which makes use of a memory architecture that allows for efficient preparation of quantum states that correspond to the rows of A and the vector of Euclidean norms of the rows of A.

Quantum Linear System Algorithm for Dense Matrices

NASA Astrophysics Data System (ADS)

Wossnig, Leonard; Zhao, Zhikuan; Prakash, Anupam

2018-02-01

Solving linear systems of equations is a frequently encountered problem in machine learning and optimization. Given a matrix A and a vector b the task is to find the vector x such that A x =b . We describe a quantum algorithm that achieves a sparsity-independent runtime scaling of O (κ2√{n }polylog(n )/ɛ ) for an n ×n dimensional A with bounded spectral norm, where κ denotes the condition number of A , and ɛ is the desired precision parameter. This amounts to a polynomial improvement over known quantum linear system algorithms when applied to dense matrices, and poses a new state of the art for solving dense linear systems on a quantum computer. Furthermore, an exponential improvement is achievable if the rank of A is polylogarithmic in the matrix dimension. Our algorithm is built upon a singular value estimation subroutine, which makes use of a memory architecture that allows for efficient preparation of quantum states that correspond to the rows of A and the vector of Euclidean norms of the rows of A .

Universal non-adiabatic geometric manipulation of pseudo-spin charge qubits

NASA Astrophysics Data System (ADS)

Azimi Mousolou, Vahid

2017-01-01

Reliable quantum information processing requires high-fidelity universal manipulation of quantum systems within the characteristic coherence times. Non-adiabatic holonomic quantum computation offers a promising approach to implement fast, universal, and robust quantum logic gates particularly useful in nano-fabricated solid-state architectures, which typically have short coherence times. Here, we propose an experimentally feasible scheme to realize high-speed universal geometric quantum gates in nano-engineered pseudo-spin charge qubits. We use a system of three coupled quantum dots containing a single electron, where two computational states of a double quantum dot charge qubit interact through an intermediate quantum dot. The additional degree of freedom introduced into the qubit makes it possible to create a geometric model system, which allows robust and efficient single-qubit rotations through careful control of the inter-dot tunneling parameters. We demonstrate that a capacitive coupling between two charge qubits permits a family of non-adiabatic holonomic controlled two-qubit entangling gates, and thus provides a promising procedure to maintain entanglement in charge qubits and a pathway toward fault-tolerant universal quantum computation. We estimate the feasibility of the proposed structure by analyzing the gate fidelities to some extent.

On the adiabatic limit of Hadamard states

NASA Astrophysics Data System (ADS)

Drago, Nicolò; Gérard, Christian

2017-08-01

We consider the adiabatic limit of Hadamard states for free quantum Klein-Gordon fields, when the background metric and the field mass are slowly varied from their initial to final values. If the Klein-Gordon field stays massive, we prove that the adiabatic limit of the initial vacuum state is the (final) vacuum state, by extending to the symplectic framework the adiabatic theorem of Avron-Seiler-Yaffe. In cases when only the field mass is varied, using an abstract version of the mode decomposition method we can also consider the case when the initial or final mass vanishes, and the initial state is either a thermal state or a more general Hadamard state.

Quantum algorithm for association rules mining

NASA Astrophysics Data System (ADS)

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

Semiconductor adiabatic qubits

DOEpatents

Carroll, Malcolm S.; Witzel, Wayne; Jacobson, Noah Tobias; Ganti, Anand; Landahl, Andrew J.; Lilly, Michael; Nguyen, Khoi Thi; Bishop, Nathaniel; Carr, Stephen M.; Bussmann, Ezra; Nielsen, Erik; Levy, James Ewers; Blume-Kohout, Robin J.; Rahman, Rajib

2016-12-27

A quantum computing device that includes a plurality of semiconductor adiabatic qubits is described herein. The qubits are programmed with local biases and coupling terms between qubits that represent a problem of interest. The qubits are initialized by way of a tuneable parameter, a local tunnel coupling within each qubit, such that the qubits remain in a ground energy state, and that initial state is represented by the qubits being in a superposition of |0> and |1> states. The parameter is altered over time adiabatically or such that relaxation mechanisms maintain a large fraction of ground state occupation through decreasing the tunnel coupling barrier within each qubit with the appropriate schedule. The final state when tunnel coupling is effectively zero represents the solution state to the problem represented in the |0> and |1> basis, which can be accurately read at each qubit location.

On the adiabatic representation of Meyer-Miller electronic-nuclear dynamics

NASA Astrophysics Data System (ADS)

Cotton, Stephen J.; Liang, Ruibin; Miller, William H.

2017-08-01

The Meyer-Miller (MM) classical vibronic (electronic + nuclear) Hamiltonian for electronically non-adiabatic dynamics—as used, for example, with the recently developed symmetrical quasiclassical (SQC) windowing model—can be written in either a diabatic or an adiabatic representation of the electronic degrees of freedom, the two being a canonical transformation of each other, thus giving the same dynamics. Although most recent applications of this SQC/MM approach have been carried out in the diabatic representation—because most of the benchmark model problems that have exact quantum results available for comparison are typically defined in a diabatic representation—it will typically be much more convenient to work in the adiabatic representation, e.g., when using Born-Oppenheimer potential energy surfaces (PESs) and derivative couplings that come from electronic structure calculations. The canonical equations of motion (EOMs) (i.e., Hamilton's equations) that come from the adiabatic MM Hamiltonian, however, in addition to the common first-derivative couplings, also involve second-derivative non-adiabatic coupling terms (as does the quantum Schrödinger equation), and the latter are considerably more difficult to calculate. This paper thus revisits the adiabatic version of the MM Hamiltonian and describes a modification of the classical adiabatic EOMs that are entirely equivalent to Hamilton's equations but that do not involve the second-derivative couplings. The second-derivative coupling terms have not been neglected; they simply do not appear in these modified adiabatic EOMs. This means that SQC/MM calculations can be carried out in the adiabatic representation, without approximation, needing only the PESs and the first-derivative coupling elements. The results of example SQC/MM calculations are presented, which illustrate this point, and also the fact that simply neglecting the second-derivative couplings in Hamilton's equations (and presumably also in

Decoherence induced deformation of the ground state in adiabatic quantum computation.

PubMed

Deng, Qiang; Averin, Dmitri V; Amin, Mohammad H; Smith, Peter

2013-01-01

Despite more than a decade of research on adiabatic quantum computation (AQC), its decoherence properties are still poorly understood. Many theoretical works have suggested that AQC is more robust against decoherence, but a quantitative relation between its performance and the qubits' coherence properties, such as decoherence time, is still lacking. While the thermal excitations are known to be important sources of errors, they are predominantly dependent on temperature but rather insensitive to the qubits' coherence. Less understood is the role of virtual excitations, which can also reduce the ground state probability even at zero temperature. Here, we introduce normalized ground state fidelity as a measure of the decoherence-induced deformation of the ground state due to virtual transitions. We calculate the normalized fidelity perturbatively at finite temperatures and discuss its relation to the qubits' relaxation and dephasing times, as well as its projected scaling properties.

Decoherence induced deformation of the ground state in adiabatic quantum computation

PubMed Central

Deng, Qiang; Averin, Dmitri V.; Amin, Mohammad H.; Smith, Peter

2013-01-01

Despite more than a decade of research on adiabatic quantum computation (AQC), its decoherence properties are still poorly understood. Many theoretical works have suggested that AQC is more robust against decoherence, but a quantitative relation between its performance and the qubits' coherence properties, such as decoherence time, is still lacking. While the thermal excitations are known to be important sources of errors, they are predominantly dependent on temperature but rather insensitive to the qubits' coherence. Less understood is the role of virtual excitations, which can also reduce the ground state probability even at zero temperature. Here, we introduce normalized ground state fidelity as a measure of the decoherence-induced deformation of the ground state due to virtual transitions. We calculate the normalized fidelity perturbatively at finite temperatures and discuss its relation to the qubits' relaxation and dephasing times, as well as its projected scaling properties. PMID:23528821

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

NASA Astrophysics Data System (ADS)

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.

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

NASA Astrophysics Data System (ADS)

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

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

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

PubMed

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

2016-08-18

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

Quantum dynamics by the constrained adiabatic trajectory method

DOE Office of Scientific and Technical Information (OSTI.GOV)

Leclerc, A.; Jolicard, G.; Guerin, S.

2011-03-15

We develop the constrained adiabatic trajectory method (CATM), which allows one to solve the time-dependent Schroedinger equation constraining the dynamics to a single Floquet eigenstate, as if it were adiabatic. This constrained Floquet state (CFS) is determined from the Hamiltonian modified by an artificial time-dependent absorbing potential whose forms are derived according to the initial conditions. The main advantage of this technique for practical implementation is that the CFS is easy to determine even for large systems since its corresponding eigenvalue is well isolated from the others through its imaginary part. The properties and limitations of the CATM are exploredmore » through simple examples.« less

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

PubMed

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.

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

PubMed Central

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

Creating Very True Quantum Algorithms for Quantum Energy Based Computing

NASA Astrophysics Data System (ADS)

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.

Creating Very True Quantum Algorithms for Quantum Energy Based Computing

NASA Astrophysics Data System (ADS)

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

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

Quantum connectivity optimization algorithms for entanglement source deployment in a quantum multi-hop network

NASA Astrophysics Data System (ADS)

Zou, Zhen-Zhen; Yu, Xu-Tao; Zhang, Zai-Chen

2018-04-01

At first, the entanglement source deployment problem is studied in a quantum multi-hop network, which has a significant influence on quantum connectivity. Two optimization algorithms are introduced with limited entanglement sources in this paper. A deployment algorithm based on node position (DNP) improves connectivity by guaranteeing that all overlapping areas of the distribution ranges of the entanglement sources contain nodes. In addition, a deployment algorithm based on an improved genetic algorithm (DIGA) is implemented by dividing the region into grids. From the simulation results, DNP and DIGA improve quantum connectivity by 213.73% and 248.83% compared to random deployment, respectively, and the latter performs better in terms of connectivity. However, DNP is more flexible and adaptive to change, as it stops running when all nodes are covered.

Generalized Jaynes-Cummings model as a quantum search algorithm

DOE Office of Scientific and Technical Information (OSTI.GOV)

Romanelli, A.

2009-07-15

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.

Quantum Error Correction Protects Quantum Search Algorithms Against Decoherence

PubMed Central

Botsinis, Panagiotis; Babar, Zunaira; Alanis, Dimitrios; Chandra, Daryus; Nguyen, Hung; Ng, Soon Xin; Hanzo, Lajos

2016-01-01

When quantum computing becomes a wide-spread commercial reality, Quantum Search Algorithms (QSA) and especially Grover’s QSA will inevitably be one of their main applications, constituting their cornerstone. Most of the literature assumes that the quantum circuits are free from decoherence. Practically, decoherence will remain unavoidable as is the Gaussian noise of classic circuits imposed by the Brownian motion of electrons, hence it may have to be mitigated. In this contribution, we investigate the effect of quantum noise on the performance of QSAs, in terms of their success probability as a function of the database size to be searched, when decoherence is modelled by depolarizing channels’ deleterious effects imposed on the quantum gates. Moreover, we employ quantum error correction codes for limiting the effects of quantum noise and for correcting quantum flips. More specifically, we demonstrate that, when we search for a single solution in a database having 4096 entries using Grover’s QSA at an aggressive depolarizing probability of 10−3, the success probability of the search is 0.22 when no quantum coding is used, which is improved to 0.96 when Steane’s quantum error correction code is employed. Finally, apart from Steane’s code, the employment of Quantum Bose-Chaudhuri-Hocquenghem (QBCH) codes is also considered. PMID:27924865

Efficient state initialization by a quantum spectral filtering algorithm

NASA Astrophysics Data System (ADS)

Fillion-Gourdeau, François; MacLean, Steve; Laflamme, Raymond

2017-04-01

An algorithm that initializes a quantum register to a state with a specified energy range is given, corresponding to a quantum implementation of the celebrated Feit-Fleck method. This is performed by introducing a nondeterministic quantum implementation of a standard spectral filtering procedure combined with an apodization technique, allowing for accurate state initialization. It is shown that the implementation requires only two ancilla qubits. A lower bound for the total probability of success of this algorithm is derived, showing that this scheme can be realized using a finite, relatively low number of trials. Assuming the time evolution can be performed efficiently and using a trial state polynomially close to the desired states, it is demonstrated that the number of operations required scales polynomially with the number of qubits. Tradeoffs between accuracy and performance are demonstrated in a simple example: the harmonic oscillator. This algorithm would be useful for the initialization phase of the simulation of quantum systems on digital quantum computers.

Singularity of the time-energy uncertainty in adiabatic perturbation and cycloids on a Bloch sphere

PubMed Central

Oh, Sangchul; Hu, Xuedong; Nori, Franco; Kais, Sabre

2016-01-01

Adiabatic perturbation is shown to be singular from the exact solution of a spin-1/2 particle in a uniformly rotating magnetic field. Due to a non-adiabatic effect, its quantum trajectory on a Bloch sphere is a cycloid traced by a circle rolling along an adiabatic path. As the magnetic field rotates more and more slowly, the time-energy uncertainty, proportional to the length of the quantum trajectory, calculated by the exact solution is entirely different from the one obtained by the adiabatic path traced by the instantaneous eigenstate. However, the non-adiabatic Aharonov- Anandan geometric phase, measured by the area enclosed by the exact path, approaches smoothly the adiabatic Berry phase, proportional to the area enclosed by the adiabatic path. The singular limit of the time-energy uncertainty and the regular limit of the geometric phase are associated with the arc length and arc area of the cycloid on a Bloch sphere, respectively. Prolate and curtate cycloids are also traced by different initial states outside and inside of the rolling circle, respectively. The axis trajectory of the rolling circle, parallel to the adiabatic path, is shown to be an example of transitionless driving. The non-adiabatic resonance is visualized by the number of cycloid arcs. PMID:26916031

Application of fermionic marginal constraints to hybrid quantum algorithms

NASA Astrophysics Data System (ADS)

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.

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

NASA Astrophysics Data System (ADS)

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.

Quantum Algorithms to Simulate Many-Body Physics of Correlated Fermions

NASA Astrophysics Data System (ADS)

Jiang, Zhang; Sung, Kevin J.; Kechedzhi, Kostyantyn; Smelyanskiy, Vadim N.; Boixo, Sergio

2018-04-01

Simulating strongly correlated fermionic systems is notoriously hard on classical computers. An alternative approach, as proposed by Feynman, is to use a quantum computer. We discuss simulating strongly correlated fermionic systems using near-term quantum devices. We focus specifically on two-dimensional (2D) or linear geometry with nearest-neighbor qubit-qubit couplings, typical for superconducting transmon qubit arrays. We improve an existing algorithm to prepare an arbitrary Slater determinant by exploiting a unitary symmetry. We also present a quantum algorithm to prepare an arbitrary fermionic Gaussian state with O (N2) gates and O (N ) circuit depth. Both algorithms are optimal in the sense that the numbers of parameters in the quantum circuits are equal to those describing the quantum states. Furthermore, we propose an algorithm to implement the 2D fermionic Fourier transformation on a 2D qubit array with only O (N1.5) gates and O (√{N }) circuit depth, which is the minimum depth required for quantum information to travel across the qubit array. We also present methods to simulate each time step in the evolution of the 2D Fermi-Hubbard model—again on a 2D qubit array—with O (N ) gates and O (√{N }) circuit depth. Finally, we discuss how these algorithms can be used to determine the ground-state properties and phase diagrams of strongly correlated quantum systems using the Hubbard model as an example.

Adiabatic leakage elimination operator in an experimental framework

NASA Astrophysics Data System (ADS)

Wang, Zhao-Ming; Byrd, Mark S.; Jing, Jun; Wu, Lian-Ao

2018-06-01

Adiabatic evolution is used in a variety of quantum information processing tasks. However, the elimination of errors is not as well developed as it is for circuit model processing. Here, we present a strategy to improve the performance of a quantum adiabatic process by adding leakage elimination operators (LEOs) to the evolution. These are a sequence of pulse controls acting in an adiabatic subspace to eliminate errors by suppressing unwanted transitions. Using the Feshbach P Q partitioning technique, we obtain an analytical solution for a set of pulse controls. The effectiveness of the LEO is independent of the specific form of the pulse but depends on the average frequency of the control function. By observing that the evolution of the target eigenstate is governed by a periodic function appearing in the integral of the control function, we show that control parameters can be chosen in such a way that the instantaneous eigenstates of the system are unchanged, yet a speedup can be achieved by suppressing transitions. Furthermore, we give the exact expression of the control function for a counter unitary transformation to be used in experiments which provides a clear physical meaning for the LEO, aiding in the implementation.

Symmetrical windowing for quantum states in quasi-classical trajectory simulations: Application to electronically non-adiabatic processes

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cotton, Stephen J.; Miller, William H., E-mail: millerwh@berkeley.edu

A recently described symmetrical windowing methodology [S. J. Cotton and W. H. Miller, J. Phys. Chem. A 117, 7190 (2013)] for quasi-classical trajectory simulations is applied here to the Meyer-Miller [H.-D. Meyer and W. H. Miller, J. Chem. Phys. 70, 3214 (1979)] model for the electronic degrees of freedom in electronically non-adiabatic dynamics. Results generated using this classical approach are observed to be in very good agreement with accurate quantum mechanical results for a variety of test applications, including problems where coherence effects are significant such as the challenging asymmetric spin-boson system.

Basis for a neuronal version of Grover's quantum algorithm

PubMed Central

Clark, Kevin B.

2014-01-01

Grover's quantum (search) algorithm exploits principles of quantum information theory and computation to surpass the strong Church–Turing limit governing classical computers. The algorithm initializes a search field into superposed N (eigen)states to later execute nonclassical “subroutines” involving unitary phase shifts of measured states and to produce root-rate or quadratic gain in the algorithmic time (O(N1/2)) needed to find some “target” solution m. Akin to this fast technological search algorithm, single eukaryotic cells, such as differentiated neurons, perform natural quadratic speed-up in the search for appropriate store-operated Ca2+ response regulation of, among other processes, protein and lipid biosynthesis, cell energetics, stress responses, cell fate and death, synaptic plasticity, and immunoprotection. Such speed-up in cellular decision making results from spatiotemporal dynamics of networked intracellular Ca2+-induced Ca2+ release and the search (or signaling) velocity of Ca2+ wave propagation. As chemical processes, such as the duration of Ca2+ mobilization, become rate-limiting over interstore distances, Ca2+ waves quadratically decrease interstore-travel time from slow saltatory to fast continuous gradients proportional to the square-root of the classical Ca2+ diffusion coefficient, D1/2, matching the computing efficiency of Grover's quantum algorithm. In this Hypothesis and Theory article, I elaborate on these traits using a fire-diffuse-fire model of store-operated cytosolic Ca2+ signaling valid for glutamatergic neurons. Salient model features corresponding to Grover's quantum algorithm are parameterized to meet requirements for the Oracle Hadamard transform and Grover's iteration. A neuronal version of Grover's quantum algorithm figures to benefit signal coincidence detection and integration, bidirectional synaptic plasticity, and other vital cell functions by rapidly selecting, ordering, and/or counting optional response

Matrix Product Operator Simulations of Quantum Algorithms

DTIC Science & Technology

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

Gacs quantum algorithmic entropy in infinite dimensional Hilbert spaces

DOE Office of Scientific and Technical Information (OSTI.GOV)

Benatti, Fabio, E-mail: benatti@ts.infn.it; Oskouei, Samad Khabbazi, E-mail: kh.oskuei@ut.ac.ir; Deh Abad, Ahmad Shafiei, E-mail: shafiei@khayam.ut.ac.ir

We extend the notion of Gacs quantum algorithmic entropy, originally formulated for finitely many qubits, to infinite dimensional quantum spin chains and investigate the relation of this extension with two quantum dynamical entropies that have been proposed in recent years.

Quantum search algorithms on a regular lattice

NASA Astrophysics Data System (ADS)

Hein, Birgit; Tanner, Gregor

2010-07-01

Quantum algorithms for searching for one or more marked items on a d-dimensional lattice provide an extension of Grover’s search algorithm including a spatial component. We demonstrate that these lattice search algorithms can be viewed in terms of the level dynamics near an avoided crossing of a one-parameter family of quantum random walks. We give approximations for both the level splitting at the avoided crossing and the effectively two-dimensional subspace of the full Hilbert space spanning the level crossing. This makes it possible to give the leading order behavior for the search time and the localization probability in the limit of large lattice size including the leading order coefficients. For d=2 and d=3, these coefficients are calculated explicitly. Closed form expressions are given for higher dimensions.

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

NASA Astrophysics Data System (ADS)

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.

A quantum heuristic algorithm for the traveling salesman problem

NASA Astrophysics Data System (ADS)

Bang, Jeongho; Ryu, Junghee; Lee, Changhyoup; Yoo, Seokwon; Lim, James; Lee, Jinhyoung

2012-12-01

We propose a quantum heuristic algorithm to solve the traveling salesman problem by generalizing the Grover search. Sufficient conditions are derived to greatly enhance the probability of finding the tours with the cheapest costs reaching almost to unity. These conditions are characterized by the statistical properties of tour costs and are shown to be automatically satisfied in the large-number limit of cities. In particular for a continuous distribution of the tours along the cost, we show that the quantum heuristic algorithm exhibits a quadratic speedup compared to its classical heuristic algorithm.

Maximizing entanglement in bosonic Josephson junctions using shortcuts to adiabaticity and optimal control

NASA Astrophysics Data System (ADS)

Stefanatos, Dionisis; Paspalakis, Emmanuel

2018-05-01

In this article we consider a bosonic Josephson junction, a model system composed by two coupled nonlinear quantum oscillators which can be implemented in various physical contexts, initially prepared in a product of weakly populated coherent states. We quantify the maximum achievable entanglement between the modes of the junction and then use shortcuts to adiabaticity, a method developed to speed up adiabatic quantum dynamics, as well as numerical optimization, to find time-dependent controls (the nonlinearity and the coupling of the junction) which bring the system to a maximally entangled state.

Quantum phases with differing computational power.

PubMed

Cui, Jian; Gu, Mile; Kwek, Leong Chuan; Santos, Marcelo França; Fan, Heng; Vedral, Vlatko

2012-05-01

The observation that concepts from quantum information has generated many alternative indicators of quantum phase transitions hints that quantum phase transitions possess operational significance with respect to the processing of quantum information. Yet, studies on whether such transitions lead to quantum phases that differ in their capacity to process information remain limited. Here we show that there exist quantum phase transitions that cause a distinct qualitative change in our ability to simulate certain quantum systems under perturbation of an external field by local operations and classical communication. In particular, we show that in certain quantum phases of the XY model, adiabatic perturbations of the external magnetic field can be simulated by local spin operations, whereas the resulting effect within other phases results in coherent non-local interactions. We discuss the potential implications to adiabatic quantum computation, where a computational advantage exists only when adiabatic perturbation results in coherent multi-body interactions.

Superadiabatic holonomic quantum computation in cavity QED

NASA Astrophysics Data System (ADS)

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.

Quantum Teleportation and Grover's Algorithm Without the Wavefunction

NASA Astrophysics Data System (ADS)

Niestegge, Gerd

2017-02-01

In the same way as the quantum no-cloning theorem and quantum key distribution in two preceding papers, entanglement-assisted quantum teleportation and Grover's search algorithm are generalized by transferring them to an abstract setting, including usual quantum mechanics as a special case. This again shows that a much more general and abstract access to these quantum mechanical features is possible than commonly thought. A non-classical extension of conditional probability and, particularly, a very special type of state-independent conditional probability are used instead of Hilbert spaces and wavefunctions.

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

NASA Astrophysics Data System (ADS)

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.

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

PubMed

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.

Adiabatic transport of qubits around a black hole

NASA Astrophysics Data System (ADS)

Viennot, David; Moro, Olivia

2017-03-01

We consider localized qubits evolving around a black hole following a quantum adiabatic dynamics. We develop a geometric structure (based on fibre bundles) permitting to describe the quantum states of a qubit and the spacetime geometry in a single framework. The quantum decoherence induced by the black hole on the qubit is analysed in this framework (the role of the dynamical and geometric phases in this decoherence is treated), especially for the quantum teleportation protocol when one qubit falls to the event horizon. A simple formula to compute the fidelity of the teleportation is derived. The case of a Schwarzschild black hole is analysed.

Stimulated Raman adiabatic control of a nuclear spin in diamond

NASA Astrophysics Data System (ADS)

Coto, Raul; Jacques, Vincent; Hétet, Gabriel; Maze, Jerónimo R.

2017-08-01

Coherent manipulation of nuclear spins is a highly desirable tool for both quantum metrology and quantum computation. However, most of the current techniques to control nuclear spins lack fast speed, impairing their robustness against decoherence. Here, based on stimulated Raman adiabatic passage, and its modification including shortcuts to adiabaticity, we present a fast protocol for the coherent manipulation of nuclear spins. Our proposed Λ scheme is implemented in the microwave domain and its excited-state relaxation can be optically controlled through an external laser excitation. These features allow for the initialization of a nuclear spin starting from a thermal state. Moreover we show how to implement Raman control for performing Ramsey spectroscopy to measure the dynamical and geometric phases acquired by nuclear spins.

Quantum Algorithmic Readout in Multi-Ion Clocks.

PubMed

Schulte, M; Lörch, N; Leroux, I D; Schmidt, P O; Hammerer, K

2016-01-08

Optical clocks based on ensembles of trapped ions promise record frequency accuracy with good short-term stability. Most suitable ion species lack closed transitions, so the clock signal must be read out indirectly by transferring the quantum state of the clock ions to cotrapped logic ions of a different species. Existing methods of quantum logic readout require a linear overhead in either time or the number of logic ions. Here we describe a quantum algorithmic readout whose overhead scales logarithmically with the number of clock ions in both of these respects. The scheme allows a quantum nondemolition readout of the number of excited clock ions using a single multispecies gate operation which can also be used in other areas of ion trap technology such as quantum information processing, quantum simulations, metrology, and precision spectroscopy.

Quantum algorithm for linear systems of equations.

PubMed

Harrow, Aram W; Hassidim, Avinatan; Lloyd, Seth

2009-10-09

Solving linear systems of equations is a common problem that arises both on its own and as a subroutine in more complex problems: given a matrix A and a vector b(-->), find a vector x(-->) such that Ax(-->) = b(-->). We consider the case where one does not need to know the solution x(-->) itself, but rather an approximation of the expectation value of some operator associated with x(-->), e.g., x(-->)(dagger) Mx(-->) for some matrix M. In this case, when A is sparse, N x N and has condition number kappa, the fastest known classical algorithms can find x(-->) and estimate x(-->)(dagger) Mx(-->) in time scaling roughly as N square root(kappa). Here, we exhibit a quantum algorithm for estimating x(-->)(dagger) Mx(-->) whose runtime is a polynomial of log(N) and kappa. Indeed, for small values of kappa [i.e., poly log(N)], we prove (using some common complexity-theoretic assumptions) that any classical algorithm for this problem generically requires exponentially more time than our quantum algorithm.

Monte Carlo sampling of Wigner functions and surface hopping quantum dynamics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kube, Susanna; Lasser, Caroline; Weber, Marcus

2009-04-01

The article addresses the achievable accuracy for a Monte Carlo sampling of Wigner functions in combination with a surface hopping algorithm for non-adiabatic quantum dynamics. The approximation of Wigner functions is realized by an adaption of the Metropolis algorithm for real-valued functions with disconnected support. The integration, which is necessary for computing values of the Wigner function, uses importance sampling with a Gaussian weight function. The numerical experiments agree with theoretical considerations and show an error of 2-3%.

Fast non-Abelian geometric gates via transitionless quantum driving.

PubMed

Zhang, J; Kyaw, Thi Ha; Tong, D M; Sjöqvist, Erik; Kwek, Leong-Chuan

2015-12-21

A practical quantum computer must be capable of performing high fidelity quantum gates on a set of quantum bits (qubits). In the presence of noise, the realization of such gates poses daunting challenges. Geometric phases, which possess intrinsic noise-tolerant features, hold the promise for performing robust quantum computation. In particular, quantum holonomies, i.e., non-Abelian geometric phases, naturally lead to universal quantum computation due to their non-commutativity. Although quantum gates based on adiabatic holonomies have already been proposed, the slow evolution eventually compromises qubit coherence and computational power. Here, we propose a general approach to speed up an implementation of adiabatic holonomic gates by using transitionless driving techniques and show how such a universal set of fast geometric quantum gates in a superconducting circuit architecture can be obtained in an all-geometric approach. Compared with standard non-adiabatic holonomic quantum computation, the holonomies obtained in our approach tends asymptotically to those of the adiabatic approach in the long run-time limit and thus might open up a new horizon for realizing a practical quantum computer.

Fast non-Abelian geometric gates via transitionless quantum driving

PubMed Central

Zhang, J.; Kyaw, Thi Ha; Tong, D. M.; Sjöqvist, Erik; Kwek, Leong-Chuan

2015-01-01

A practical quantum computer must be capable of performing high fidelity quantum gates on a set of quantum bits (qubits). In the presence of noise, the realization of such gates poses daunting challenges. Geometric phases, which possess intrinsic noise-tolerant features, hold the promise for performing robust quantum computation. In particular, quantum holonomies, i.e., non-Abelian geometric phases, naturally lead to universal quantum computation due to their non-commutativity. Although quantum gates based on adiabatic holonomies have already been proposed, the slow evolution eventually compromises qubit coherence and computational power. Here, we propose a general approach to speed up an implementation of adiabatic holonomic gates by using transitionless driving techniques and show how such a universal set of fast geometric quantum gates in a superconducting circuit architecture can be obtained in an all-geometric approach. Compared with standard non-adiabatic holonomic quantum computation, the holonomies obtained in our approach tends asymptotically to those of the adiabatic approach in the long run-time limit and thus might open up a new horizon for realizing a practical quantum computer. PMID:26687580

Performance of quantum annealing on random Ising problems implemented using the D-Wave Two

NASA Astrophysics Data System (ADS)

Wang, Zhihui; Job, Joshua; Rønnow, Troels F.; Troyer, Matthias; Lidar, Daniel A.; USC Collaboration; ETH Collaboration

2014-03-01

Detecting a possible speedup of quantum annealing compared to classical algorithms is a pressing task in experimental adiabatic quantum computing. In this talk, we discuss the performance of the D-Wave Two quantum annealing device on Ising spin glass problems. The expected time to solution for the device to solve random instances with up to 503 spins and with specified coupling ranges is evaluated while carefully addressing the issue of statistical errors. We perform a systematic comparison of the expected time to solution between the D-Wave Two and classical stochastic solvers, specifically simulated annealing, and simulated quantum annealing based on quantum Monte Carlo, and discuss the question of speedup.

Dispersive Readout of Adiabatic Phases

NASA Astrophysics Data System (ADS)

Kohler, Sigmund

2017-11-01

We propose a protocol for the measurement of adiabatic phases of periodically driven quantum systems coupled to an open cavity that enables dispersive readout. It turns out that the cavity transmission exhibits peaks at frequencies determined by a resonance condition that involves the dynamical and the geometric phase. Since these phases scale differently with the driving frequency, one can determine them by fitting the peak positions to the theoretically expected behavior. For the derivation of the resonance condition and for a numerical study, we develop a Floquet theory for the dispersive readout of ac driven quantum systems. The feasibility is demonstrated for two test cases that generalize Landau-Zener-Stückelberg-Majorana interference to two-parameter driving.

General Quantum Meet-in-the-Middle Search Algorithm Based on Target Solution of Fixed Weight

NASA Astrophysics Data System (ADS)

Fu, Xiang-Qun; Bao, Wan-Su; Wang, Xiang; Shi, Jian-Hong

2016-10-01

Similar to the classical meet-in-the-middle algorithm, the storage and computation complexity are the key factors that decide the efficiency of the quantum meet-in-the-middle algorithm. Aiming at the target vector of fixed weight, based on the quantum meet-in-the-middle algorithm, the algorithm for searching all n-product vectors with the same weight is presented, whose complexity is better than the exhaustive search algorithm. And the algorithm can reduce the storage complexity of the quantum meet-in-the-middle search algorithm. Then based on the algorithm and the knapsack vector of the Chor-Rivest public-key crypto of fixed weight d, we present a general quantum meet-in-the-middle search algorithm based on the target solution of fixed weight, whose computational complexity is \\sumj = 0d {(O(\\sqrt {Cn - k + 1d - j }) + O(C_kj log C_k^j))} with Σd i =0 Ck i memory cost. And the optimal value of k is given. Compared to the quantum meet-in-the-middle search algorithm for knapsack problem and the quantum algorithm for searching a target solution of fixed weight, the computational complexity of the algorithm is lower. And its storage complexity is smaller than the quantum meet-in-the-middle-algorithm. Supported by the National Basic Research Program of China under Grant No. 2013CB338002 and the National Natural Science Foundation of China under Grant No. 61502526

Demonstration of a compiled version of Shor's quantum factoring algorithm using photonic qubits.

PubMed

Lu, Chao-Yang; Browne, Daniel E; Yang, Tao; Pan, Jian-Wei

2007-12-21

We report an experimental demonstration of a complied version of Shor's algorithm using four photonic qubits. We choose the simplest instance of this algorithm, that is, factorization of N=15 in the case that the period r=2 and exploit a simplified linear optical network to coherently implement the quantum circuits of the modular exponential execution and semiclassical quantum Fourier transformation. During this computation, genuine multiparticle entanglement is observed which well supports its quantum nature. This experiment represents an essential step toward full realization of Shor's algorithm and scalable linear optics quantum computation.

Optical simulation of quantum algorithms using programmable liquid-crystal displays

DOE Office of Scientific and Technical Information (OSTI.GOV)

Puentes, Graciana; La Mela, Cecilia; Ledesma, Silvia

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

Shortcuts to adiabaticity from linear response theory

DOE PAGES

Acconcia, Thiago V.; Bonança, Marcus V. S.; Deffner, Sebastian

2015-10-23

A shortcut to adiabaticity is a finite-time process that produces the same final state as would result from infinitely slow driving. We show that such shortcuts can be found for weak perturbations from linear response theory. Moreover, with the help of phenomenological response functions, a simple expression for the excess work is found—quantifying the nonequilibrium excitations. For two specific examples, i.e., the quantum parametric oscillator and the spin 1/2 in a time-dependent magnetic field, we show that finite-time zeros of the excess work indicate the existence of shortcuts. We finally propose a degenerate family of protocols, which facilitates shortcuts tomore » adiabaticity for specific and very short driving times.« less

Strong-field adiabatic passage in the continuum: Electromagnetically induced transparency and stimulated Raman adiabatic passage

NASA Astrophysics Data System (ADS)

Eilam, A.; Shapiro, M.

2012-01-01

We present a fully quantum-mechanical theory of the mutual light-matter effects when two laser pulses interact with three discrete states coupled to a (quasi)continuum. Our formulation uses a single set of equations to describe the time dependence of the discrete and continuum populations, as well as pulse propagation in electromagnetically induced transparency (EIT) and stimulated Raman adiabatic passage (STIRAP) situations, for both weak and strong laser pulses. The theory gives a mechanistic picture of the “slowing down of light” and the state of spontaneously emitted photons during this process. Surprising features regarding the time dependence of material and radiative transients as well as limitations on quantum light storage and retrieval are unraveled.

Cavity control as a new quantum algorithms implementation treatment

NASA Astrophysics Data System (ADS)

AbuGhanem, M.; Homid, A. H.; Abdel-Aty, M.

2018-02-01

Based on recent experiments [ Nature 449, 438 (2007) and Nature Physics 6, 777 (2010)], a new approach for realizing quantum gates for the design of quantum algorithms was developed. Accordingly, the operation times of such gates while functioning in algorithm applications depend on the number of photons present in their resonant cavities. Multi-qubit algorithms can be realized in systems in which the photon number is increased slightly over the qubit number. In addition, the time required for operation is considerably less than the dephasing and relaxation times of the systems. The contextual use of the photon number as a main control in the realization of any algorithm was demonstrated. The results indicate the possibility of a full integration into the realization of multi-qubit multiphoton states and its application in algorithm designs. Furthermore, this approach will lead to a successful implementation of these designs in future experiments.

Energy efficient quantum machines

NASA Astrophysics Data System (ADS)

Abah, Obinna; Lutz, Eric

2017-05-01

We investigate the performance of a quantum thermal machine operating in finite time based on shortcut-to-adiabaticity techniques. We compute efficiency and power for a paradigmatic harmonic quantum Otto engine by taking the energetic cost of the shortcut driving explicitly into account. We demonstrate that shortcut-to-adiabaticity machines outperform conventional ones for fast cycles. We further derive generic upper bounds on both quantities, valid for any heat engine cycle, using the notion of quantum speed limit for driven systems. We establish that these quantum bounds are tighter than those stemming from the second law of thermodynamics.

Q-Learning-Based Adjustable Fixed-Phase Quantum Grover Search Algorithm

NASA Astrophysics Data System (ADS)

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

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

A Novel Color Image Encryption Algorithm Based on Quantum Chaos Sequence

NASA Astrophysics Data System (ADS)

Liu, Hui; Jin, Cong

2017-03-01

In this paper, a novel algorithm of image encryption based on quantum chaotic is proposed. The keystreams are generated by the two-dimensional logistic map as initial conditions and parameters. And then general Arnold scrambling algorithm with keys is exploited to permute the pixels of color components. In diffusion process, a novel encryption algorithm, folding algorithm, is proposed to modify the value of diffused pixels. In order to get the high randomness and complexity, the two-dimensional logistic map and quantum chaotic map are coupled with nearest-neighboring coupled-map lattices. Theoretical analyses and computer simulations confirm that the proposed algorithm has high level of security.

Compact beam splitters in coupled waveguides using shortcuts to adiabaticity

NASA Astrophysics Data System (ADS)

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.

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

PubMed

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.

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

NASA Astrophysics Data System (ADS)

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.

Quantum gates by periodic driving

PubMed Central

Shi, Z. C.; Wang, W.; Yi, X. X.

2016-01-01

Topological quantum computation has been extensively studied in the past decades due to its robustness against decoherence. One way to realize the topological quantum computation is by adiabatic evolutions—it requires relatively long time to complete a gate, so the speed of quantum computation slows down. In this work, we present a method to realize single qubit quantum gates by periodic driving. Compared to adiabatic evolution, the single qubit gates can be realized at a fixed time much shorter than that by adiabatic evolution. The driving fields can be sinusoidal or square-well field. With the sinusoidal driving field, we derive an expression for the total operation time in the high-frequency limit, and an exact analytical expression for the evolution operator without any approximations is given for the square well driving. This study suggests that the period driving could provide us with a new direction in regulations of the operation time in topological quantum computation. PMID:26911900

Quantum gates by periodic driving.

PubMed

Shi, Z C; Wang, W; Yi, X X

2016-02-25

Topological quantum computation has been extensively studied in the past decades due to its robustness against decoherence. One way to realize the topological quantum computation is by adiabatic evolutions-it requires relatively long time to complete a gate, so the speed of quantum computation slows down. In this work, we present a method to realize single qubit quantum gates by periodic driving. Compared to adiabatic evolution, the single qubit gates can be realized at a fixed time much shorter than that by adiabatic evolution. The driving fields can be sinusoidal or square-well field. With the sinusoidal driving field, we derive an expression for the total operation time in the high-frequency limit, and an exact analytical expression for the evolution operator without any approximations is given for the square well driving. This study suggests that the period driving could provide us with a new direction in regulations of the operation time in topological quantum computation.

Quantum Associative Neural Network with Nonlinear Search Algorithm

NASA Astrophysics Data System (ADS)

Zhou, Rigui; Wang, Huian; Wu, Qian; Shi, Yang

2012-03-01

Based on analysis on properties of quantum linear superposition, to overcome the complexity of existing quantum associative memory which was proposed by Ventura, a new storage method for multiply patterns is proposed in this paper by constructing the quantum array with the binary decision diagrams. Also, the adoption of the nonlinear search algorithm increases the pattern recalling speed of this model which has multiply patterns to O( {log2}^{2^{n -t}} ) = O( n - t ) time complexity, where n is the number of quantum bit and t is the quantum information of the t quantum bit. Results of case analysis show that the associative neural network model proposed in this paper based on quantum learning is much better and optimized than other researchers' counterparts both in terms of avoiding the additional qubits or extraordinary initial operators, storing pattern and improving the recalling speed.

Quantum algorithms on Walsh transform and Hamming distance for Boolean functions

NASA Astrophysics Data System (ADS)

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.

Optimizing Variational Quantum Algorithms Using Pontryagin’s Minimum Principle

DOE Office of Scientific and Technical Information (OSTI.GOV)

Yang, Zhi -Cheng; Rahmani, Armin; Shabani, Alireza

We use Pontryagin’s minimum principle to optimize variational quantum algorithms. We show that for a fixed computation time, the optimal evolution has a bang-bang (square pulse) form, both for closed and open quantum systems with Markovian decoherence. Our findings support the choice of evolution ansatz in the recently proposed quantum approximate optimization algorithm. Focusing on the Sherrington-Kirkpatrick spin glass as an example, we find a system-size independent distribution of the duration of pulses, with characteristic time scale set by the inverse of the coupling constants in the Hamiltonian. The optimality of the bang-bang protocols and the characteristic time scale ofmore » the pulses provide an efficient parametrization of the protocol and inform the search for effective hybrid (classical and quantum) schemes for tackling combinatorial optimization problems. Moreover, we find that the success rates of our optimal bang-bang protocols remain high even in the presence of weak external noise and coupling to a thermal bath.« less

Optimizing Variational Quantum Algorithms Using Pontryagin’s Minimum Principle

DOE PAGES

Yang, Zhi -Cheng; Rahmani, Armin; Shabani, Alireza; ...

2017-05-18

We use Pontryagin’s minimum principle to optimize variational quantum algorithms. We show that for a fixed computation time, the optimal evolution has a bang-bang (square pulse) form, both for closed and open quantum systems with Markovian decoherence. Our findings support the choice of evolution ansatz in the recently proposed quantum approximate optimization algorithm. Focusing on the Sherrington-Kirkpatrick spin glass as an example, we find a system-size independent distribution of the duration of pulses, with characteristic time scale set by the inverse of the coupling constants in the Hamiltonian. The optimality of the bang-bang protocols and the characteristic time scale ofmore » the pulses provide an efficient parametrization of the protocol and inform the search for effective hybrid (classical and quantum) schemes for tackling combinatorial optimization problems. Moreover, we find that the success rates of our optimal bang-bang protocols remain high even in the presence of weak external noise and coupling to a thermal bath.« less

Optimal control of the power adiabatic stroke of an optomechanical heat engine.

PubMed

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.

Quantum-to-classical crossover near quantum critical point

DOE PAGES

Vasin, M.; Ryzhov, V.; Vinokur, V. M.

2015-12-21

A quantum phase transition (QPT) is an inherently dynamic phenomenon. However, while non-dissipative quantum dynamics is described in detail, the question, that is not thoroughly understood is how the omnipresent dissipative processes enter the critical dynamics near a quantum critical point (QCP). Here we report a general approach enabling inclusion of both adiabatic and dissipative processes into the critical dynamics on the same footing. We reveal three distinct critical modes, the adiabatic quantum mode (AQM), the dissipative classical mode [classical critical dynamics mode (CCDM)], and the dissipative quantum critical mode (DQCM). We find that as a result of the transitionmore » from the regime dominated by thermal fluctuations to that governed by the quantum ones, the system acquires effective dimension d+zΛ(T), where z is the dynamical exponent, and temperature-depending parameter Λ(T)ε[0, 1] decreases with the temperature such that Λ(T=0) = 1 and Λ(T →∞) = 0. Lastly, our findings lead to a unified picture of quantum critical phenomena including both dissipation- and dissipationless quantum dynamic effects and offer a quantitative description of the quantum-to-classical crossover.« less

Data-driven gradient algorithm for high-precision quantum control

NASA Astrophysics Data System (ADS)

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.

Quantum Cryptography Based on the Deutsch-Jozsa Algorithm

NASA Astrophysics Data System (ADS)

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

Implementing an ancilla-free 1→M economical phase-covariant quantum cloning machine with superconducting quantum-interference devices in cavity QED

NASA Astrophysics Data System (ADS)

Yu, Long-Bao; Zhang, Wen-Hai; Ye, Liu

2007-09-01

We propose a simple scheme to realize 1→M economical phase-covariant quantum cloning machine (EPQCM) with superconducting quantum interference device (SQUID) qubits. In our scheme, multi-SQUIDs are fixed into a microwave cavity by adiabatic passage for their manipulation. Based on this model, we can realize the EPQCM with high fidelity via adiabatic quantum computation.

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

PubMed

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.

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

NASA Astrophysics Data System (ADS)

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.

Reversibility and energy dissipation in adiabatic superconductor logic.

PubMed

Takeuchi, Naoki; Yamanashi, Yuki; Yoshikawa, Nobuyuki

2017-03-06

Reversible computing is considered to be a key technology to achieve an extremely high energy efficiency in future computers. In this study, we investigated the relationship between reversibility and energy dissipation in adiabatic superconductor logic. We analyzed the evolution of phase differences of Josephson junctions in the reversible quantum-flux-parametron (RQFP) gate and confirmed that the phase differences can change time reversibly, which indicates that the RQFP gate is physically, as well as logically, reversible. We calculated energy dissipation required for the RQFP gate to perform a logic operation and numerically demonstrated that the energy dissipation can fall below the thermal limit, or the Landauer bound, by lowering operation frequencies. We also investigated the 1-bit-erasure gate as a logically irreversible gate and the quasi-RQFP gate as a physically irreversible gate. We calculated the energy dissipation of these irreversible gates and showed that the energy dissipation of these gate is dominated by non-adiabatic state changes, which are induced by unwanted interactions between gates due to logical or physical irreversibility. Our results show that, in reversible computing using adiabatic superconductor logic, logical and physical reversibility are required to achieve energy dissipation smaller than the Landauer bound without non-adiabatic processes caused by gate interactions.

Temporal Planning for Compilation of Quantum Approximate Optimization Algorithm Circuits

NASA Technical Reports Server (NTRS)

Venturelli, Davide; Do, Minh Binh; Rieffel, Eleanor Gilbert; Frank, Jeremy David

2017-01-01

We investigate the application of temporal planners to the problem of compiling quantum circuits to newly emerging quantum hardware. While our approach is general, we focus our initial experiments on Quantum Approximate Optimization Algorithm (QAOA) circuits that have few ordering constraints and allow highly parallel plans. We report on experiments using several temporal planners to compile circuits of various sizes to a realistic hardware. This early empirical evaluation suggests that temporal planning is a viable approach to quantum circuit compilation.

Non-adiabatic dynamics around a conical intersection with surface-hopping coupled coherent states

DOE Office of Scientific and Technical Information (OSTI.GOV)

Humeniuk, Alexander; Mitrić, Roland, E-mail: roland.mitric@uni-wuerzburg.de

A surface-hopping extension of the coupled coherent states-method [D. Shalashilin and M. Child, Chem. Phys. 304, 103-120 (2004)] for simulating non-adiabatic dynamics with quantum effects of the nuclei is put forward. The time-dependent Schrödinger equation for the motion of the nuclei is solved in a moving basis set. The basis set is guided by classical trajectories, which can hop stochastically between different electronic potential energy surfaces. The non-adiabatic transitions are modelled by a modified version of Tully’s fewest switches algorithm. The trajectories consist of Gaussians in the phase space of the nuclei (coherent states) combined with amplitudes for an electronicmore » wave function. The time-dependent matrix elements between different coherent states determine the amplitude of each trajectory in the total multistate wave function; the diagonal matrix elements determine the hopping probabilities and gradients. In this way, both interference effects and non-adiabatic transitions can be described in a very compact fashion, leading to the exact solution if convergence with respect to the number of trajectories is achieved and the potential energy surfaces are known globally. The method is tested on a 2D model for a conical intersection [A. Ferretti, J. Chem. Phys. 104, 5517 (1996)], where a nuclear wavepacket encircles the point of degeneracy between two potential energy surfaces and interferes with itself. These interference effects are absent in classical trajectory-based molecular dynamics but can be fully incorpo rated if trajectories are replaced by surface hopping coupled coherent states.« less

Multiple-state quantum Otto engine, 1D box system

DOE Office of Scientific and Technical Information (OSTI.GOV)

Latifah, E., E-mail: enylatifah@um.ac.id; Purwanto, A.

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.

Quantum Otto heat engine with three-qubit XXZ model as working substance

NASA Astrophysics Data System (ADS)

Huang, X. L.; Sun, Qi; Guo, D. Y.; Yu, Qian

2018-02-01

A quantum Otto heat engine is established with a three-qubit Heisenberg XXZ model with Dzyaloshinskii-Moriya (DM) interaction under a homogeneous magnetic field as the working substance. The quantum Otto engine is composed of two quantum isochoric processes and two quantum adiabatic processes. Here we have restricted Bc /Bh =Jc /Jh = r in the two adiabatic processes, where r is the adiabatic compression ratio. The work output and efficiency are calculated for our cycle. The possible adiabatic compression ratios and the ratios of work output between our working substance and a single spin under the same external conditions in the Otto cycle are analyzed with different DM interaction parameters and anisotropic parameters. The effects of pairwise entanglements on the heat engine efficiency are discussed.

A homonuclear spin-pair filter for solid-state NMR based on adiabatic-passage techniques

NASA Astrophysics Data System (ADS)

Verel, René; Baldus, Marc; Ernst, Matthias; Meier, Beat H.

1998-05-01

A filtering scheme for the selection of spin pairs (and larger spin clusters) under fast magic-angle spinning is proposed. The scheme exploits the avoided level crossing in spin pairs during an adiabatic amplitude sweep through the so-called HORROR recoupling condition. The advantages over presently used double-quantum filters are twofold. (i) The maximum theoretical filter efficiency is, due to the adiabatic variation, 100% instead of 73% as for transient methods. (ii) Since the filter does not rely on the phase-cycling properties of the double-quantum coherence, there is no need to obtain the full double-quantum intensity for all spins in the sample at one single point in time. The only important requirement is that all coupled spins pass through a two-spin state during the amplitude sweep. This makes the pulse scheme robust with respect to rf-amplitude missetting, rf-field inhomogeneity and chemical-shift offset.

Fast CNOT gate between two spatially separated atoms via shortcuts to adiabatic passage.

PubMed

Liang, Yan; Song, Chong; Ji, Xin; Zhang, Shou

2015-09-07

Quantum logic gate is indispensable to quantum computation. One of the important qubit operations is the quantum controlled-not (CNOT) gate that performs a NOT operation on a target qubit depending on the state of the control qubit. In this paper we present a scheme to realize the quantum CNOT gate between two spatially separated atoms via shortcuts to adiabatic passage. The influence of various decoherence processes on the fidelity is discussed. The strict numerical simulation results show that the fidelity for the CNOT gate is relatively high.

Quantum cluster variational method and message passing algorithms revisited

NASA Astrophysics Data System (ADS)

Domínguez, E.; Mulet, Roberto

2018-02-01

We present a general framework to study quantum disordered systems in the context of the Kikuchi's cluster variational method (CVM). The method relies in the solution of message passing-like equations for single instances or in the iterative solution of complex population dynamic algorithms for an average case scenario. We first show how a standard application of the Kikuchi's CVM can be easily translated to message passing equations for specific instances of the disordered system. We then present an "ad hoc" extension of these equations to a population dynamic algorithm representing an average case scenario. At the Bethe level, these equations are equivalent to the dynamic population equations that can be derived from a proper cavity ansatz. However, at the plaquette approximation, the interpretation is more subtle and we discuss it taking also into account previous results in classical disordered models. Moreover, we develop a formalism to properly deal with the average case scenario using a replica-symmetric ansatz within this CVM for quantum disordered systems. Finally, we present and discuss numerical solutions of the different approximations for the quantum transverse Ising model and the quantum random field Ising model in two-dimensional lattices.

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

PubMed

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.

Parameter Estimation of Fractional-Order Chaotic Systems by Using Quantum Parallel Particle Swarm Optimization Algorithm

PubMed Central

Huang, Yu; Guo, Feng; Li, Yongling; Liu, Yufeng

2015-01-01

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

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

NASA Astrophysics Data System (ADS)

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.

Revisiting Adiabatic Switching for Initial Conditions in Quasi-Classical Trajectory Calculations: Application to CH4.

PubMed

Qu, Chen; Bowman, Joel M

2016-07-14

Semiclassical quantization of vibrational energies, using adiabatic switching (AS), is applied to CH4 using a recent ab initio potential energy surface, for which exact quantum calculations of vibrational energies are available. Details of the present calculations, which employ a harmonic normal-mode zeroth-order Hamiltonian, emphasize the importance of transforming to the Eckart frame during the propagation of the adiabatically switched Hamiltonian. The AS energies for the zero-point, and fundamental excitations of two modes are in good agreement with the quantum ones. The use of AS in the context of quasi-classical trajectory calculations is revisited, following previous work reported in 1995, which did not recommend the procedure. We come to a different conclusion here.

Improved quantum backtracking algorithms using effective resistance estimates

NASA Astrophysics Data System (ADS)

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.

Improving the quantum cost of reversible Boolean functions using reorder algorithm

NASA Astrophysics Data System (ADS)

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.

Quantum-inspired algorithm for estimating the permanent of positive semidefinite matrices

NASA Astrophysics Data System (ADS)

Chakhmakhchyan, L.; Cerf, N. J.; Garcia-Patron, R.

2017-08-01

We construct a quantum-inspired classical algorithm for computing the permanent of Hermitian positive semidefinite matrices by exploiting a connection between these mathematical structures and the boson sampling model. Specifically, the permanent of a Hermitian positive semidefinite matrix can be expressed in terms of the expected value of a random variable, which stands for a specific photon-counting probability when measuring a linear-optically evolved random multimode coherent state. Our algorithm then approximates the matrix permanent from the corresponding sample mean and is shown to run in polynomial time for various sets of Hermitian positive semidefinite matrices, achieving a precision that improves over known techniques. This work illustrates how quantum optics may benefit algorithm development.

Quantum evolution: The case of weak localization for a 3D alloy-type Anderson model and application to Hamiltonian based quantum computation

NASA Astrophysics Data System (ADS)

Cao, Zhenwei

Over the years, people have found Quantum Mechanics to be extremely useful in explaining various physical phenomena from a microscopic point of view. Anderson localization, named after physicist P. W. Anderson, states that disorder in a crystal can cause non-spreading of wave packets, which is one possible mechanism (at single electron level) to explain metal-insulator transitions. The theory of quantum computation promises to bring greater computational power over classical computers by making use of some special features of Quantum Mechanics. The first part of this dissertation considers a 3D alloy-type model, where the Hamiltonian is the sum of the finite difference Laplacian corresponding to free motion of an electron and a random potential generated by a sign-indefinite single-site potential. The result shows that localization occurs in the weak disorder regime, i.e., when the coupling parameter lambda is very small, for energies E ≤ --Clambda 2. The second part of this dissertation considers adiabatic quantum computing (AQC) algorithms for the unstructured search problem to the case when the number of marked items is unknown. In an ideal situation, an explicit quantum algorithm together with a counting subroutine are given that achieve the optimal Grover speedup over classical algorithms, i.e., roughly speaking, reduce O(2n) to O(2n/2), where n is the size of the problem. However, if one considers more realistic settings, the result shows this quantum speedup is achievable only under a very rigid control precision requirement (e.g., exponentially small control error).

Non-adiabatic molecular dynamics by accelerated semiclassical Monte Carlo

DOE PAGES

White, Alexander J.; Gorshkov, Vyacheslav N.; Tretiak, Sergei; ...

2015-07-07

Non-adiabatic dynamics, where systems non-radiatively transition between electronic states, plays a crucial role in many photo-physical processes, such as fluorescence, phosphorescence, and photoisomerization. Methods for the simulation of non-adiabatic dynamics are typically either numerically impractical, highly complex, or based on approximations which can result in failure for even simple systems. Recently, the Semiclassical Monte Carlo (SCMC) approach was developed in an attempt to combine the accuracy of rigorous semiclassical methods with the efficiency and simplicity of widely used surface hopping methods. However, while SCMC was found to be more efficient than other semiclassical methods, it is not yet as efficientmore » as is needed to be used for large molecular systems. Here, we have developed two new methods: the accelerated-SCMC and the accelerated-SCMC with re-Gaussianization, which reduce the cost of the SCMC algorithm up to two orders of magnitude for certain systems. In many cases shown here, the new procedures are nearly as efficient as the commonly used surface hopping schemes, with little to no loss of accuracy. This implies that these modified SCMC algorithms will be of practical numerical solutions for simulating non-adiabatic dynamics in realistic molecular systems.« less

Graphene-based room-temperature implementation of a modified Deutsch-Jozsa quantum algorithm.

PubMed

Dragoman, Daniela; Dragoman, Mircea

2015-12-04

We present an implementation of a one-qubit and two-qubit modified Deutsch-Jozsa quantum algorithm based on graphene ballistic devices working at room temperature. The modified Deutsch-Jozsa algorithm decides whether a function, equivalent to the effect of an energy potential distribution on the wave function of ballistic charge carriers, is constant or not, without measuring the output wave function. The function need not be Boolean. Simulations confirm that the algorithm works properly, opening the way toward quantum computing at room temperature based on the same clean-room technologies as those used for fabrication of very-large-scale integrated circuits.

Quantum rotation gates with controlled nonadiabatic evolutions

NASA Astrophysics Data System (ADS)

Abdelrahim, Abdelrahman A. H.; Benmachiche, Abderrahim; Subhi Mahmoud, Gharib; Messikh, Azeddine

2018-04-01

Quantum gates can be implemented adiabatically and nonadiabatically. Many schemes used at least two sequentially implemented gates to obtain an arbitrary one-qubit gate. Recently, it has been shown that nonadiabatic gates can be realized by single-shot implementation. It has also been shown that quantum gates can be implemented with controlled adiabatic evolutions. In this paper, we combine the advantage of single-shot implementation with controlled adiabatic evolutions to obtain controlled nonadiabatic evolutions. We also investigate the robustness to different types of errors. We find that the fidelity is close to unity for realistic decoherence rates.

A surface hopping algorithm for nonadiabatic minimum energy path calculations.

PubMed

Schapiro, Igor; Roca-Sanjuán, Daniel; Lindh, Roland; Olivucci, Massimo

2015-02-15

The article introduces a robust algorithm for the computation of minimum energy paths transiting along regions of near-to or degeneracy of adiabatic states. The method facilitates studies of excited state reactivity involving weakly avoided crossings and conical intersections. Based on the analysis of the change in the multiconfigurational wave function the algorithm takes the decision whether the optimization should continue following the same electronic state or switch to a different state. This algorithm helps to overcome convergence difficulties near degeneracies. The implementation in the MOLCAS quantum chemistry package is discussed. To demonstrate the utility of the proposed procedure four examples of application are provided: thymine, asulam, 1,2-dioxetane, and a three-double-bond model of the 11-cis-retinal protonated Schiff base. © 2015 Wiley Periodicals, Inc.

Robust quantum logic in neutral atoms via adiabatic Rydberg dressing

DOE PAGES

Keating, Tyler; Cook, Robert L.; Hankin, Aaron M.; ...

2015-01-28

We study a scheme for implementing a controlled-Z (CZ) gate between two neutral-atom qubits based on the Rydberg blockade mechanism in a manner that is robust to errors caused by atomic motion. By employing adiabatic dressing of the ground electronic state, we can protect the gate from decoherence due to random phase errors that typically arise because of atomic thermal motion. In addition, the adiabatic protocol allows for a Doppler-free configuration that involves counterpropagating lasers in a σ +/σ - orthogonal polarization geometry that further reduces motional errors due to Doppler shifts. The residual motional error is dominated by dipole-dipolemore » forces acting on doubly-excited Rydberg atoms when the blockade is imperfect. As a result, for reasonable parameters, with qubits encoded into the clock states of 133Cs, we predict that our protocol could produce a CZ gate in < 10 μs with error probability on the order of 10 -3.« less

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

PubMed

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.

Single-temperature quantum engine without feedback control.

PubMed

Yi, Juyeon; Talkner, Peter; Kim, Yong Woon

2017-08-01

A cyclically working quantum-mechanical engine that operates at a single temperature is proposed. Its energy input is delivered by a quantum measurement. The functioning of the engine does not require any feedback control. We analyze work, heat, and the efficiency of the engine for the case of a working substance that is governed by the laws of quantum mechanics and that can be adiabatically compressed and expanded. The obtained general expressions are exemplified for a spin in an adiabatically changing magnetic field and a particle moving in a potential with slowly changing shape.

Effect of Fourier transform on the streaming in quantum lattice gas algorithms

NASA Astrophysics Data System (ADS)

Oganesov, Armen; Vahala, George; Vahala, Linda; Soe, Min

2018-04-01

All our previous quantum lattice gas algorithms for nonlinear physics have approximated the kinetic energy operator by streaming sequences to neighboring lattice sites. Here, the kinetic energy can be treated to all orders by Fourier transforming the kinetic energy operator with interlaced Dirac-based unitary collision operators. Benchmarking against exact solutions for the 1D nonlinear Schrodinger equation shows an extended range of parameters (soliton speeds and amplitudes) over the Dirac-based near-lattice-site streaming quantum algorithm.

Experimental limits on the fidelity of adiabatic geometric phase gates in a single solid-state spin qubit

DOE PAGES

Zhang, Kai; Nusran, N. M.; Slezak, B. R.; ...

2016-05-17

While it is often thought that the geometric phase is less sensitive to fluctuations in the control fields, a very general feature of adiabatic Hamiltonians is the unavoidable dynamic phase that accompanies the geometric phase. The effect of control field noise during adiabatic geometric quantum gate operations has not been probed experimentally, especially in the canonical spin qubit system that is of interest for quantum information. We present measurement of the Berry phase and carry out adiabatic geometric phase gate in a single solid-state spin qubit associated with the nitrogen-vacancy center in diamond. We manipulate the spin qubit geometrically bymore » careful application of microwave radiation that creates an effective rotating magnetic field, and observe the resulting Berry phase signal via spin echo interferometry. Our results show that control field noise at frequencies higher than the spin echo clock frequency causes decay of the quantum phase, and degrades the fidelity of the geometric phase gate to the classical threshold after a few (~10) operations. This occurs in spite of the geometric nature of the state preparation, due to unavoidable dynamic contributions. In conclusion, we have carried out systematic analysis and numerical simulations to study the effects of the control field noise and imperfect driving waveforms on the quantum phase gate.« less

Experimental limits on the fidelity of adiabatic geometric phase gates in a single solid-state spin qubit

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhang, Kai; Nusran, N. M.; Slezak, B. R.

While it is often thought that the geometric phase is less sensitive to fluctuations in the control fields, a very general feature of adiabatic Hamiltonians is the unavoidable dynamic phase that accompanies the geometric phase. The effect of control field noise during adiabatic geometric quantum gate operations has not been probed experimentally, especially in the canonical spin qubit system that is of interest for quantum information. We present measurement of the Berry phase and carry out adiabatic geometric phase gate in a single solid-state spin qubit associated with the nitrogen-vacancy center in diamond. We manipulate the spin qubit geometrically bymore » careful application of microwave radiation that creates an effective rotating magnetic field, and observe the resulting Berry phase signal via spin echo interferometry. Our results show that control field noise at frequencies higher than the spin echo clock frequency causes decay of the quantum phase, and degrades the fidelity of the geometric phase gate to the classical threshold after a few (~10) operations. This occurs in spite of the geometric nature of the state preparation, due to unavoidable dynamic contributions. In conclusion, we have carried out systematic analysis and numerical simulations to study the effects of the control field noise and imperfect driving waveforms on the quantum phase gate.« less

Non-stoquastic Hamiltonians in quantum annealing via geometric phases

NASA Astrophysics Data System (ADS)

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.

Quantum algorithm for solving some discrete mathematical problems by probing their energy spectra

NASA Astrophysics Data System (ADS)

Wang, Hefeng; Fan, Heng; Li, Fuli

2014-01-01

When a probe qubit is coupled to a quantum register that represents a physical system, the probe qubit will exhibit a dynamical response only when it is resonant with a transition in the system. Using this principle, we propose a quantum algorithm for solving discrete mathematical problems based on the circuit model. Our algorithm has favorable scaling properties in solving some discrete mathematical problems.

Non-adiabatic dynamics of molecules in optical cavities

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kowalewski, Markus, E-mail: mkowalew@uci.edu; Bennett, Kochise; Mukamel, Shaul, E-mail: smukamel@uci.edu

2016-02-07

Strong coupling of molecules to the vacuum field of micro cavities can modify the potential energy surfaces thereby opening new photophysical and photochemical reaction pathways. While the influence of laser fields is usually described in terms of classical field, coupling to the vacuum state of a cavity has to be described in terms of dressed photon-matter states (polaritons) which require quantized fields. We present a derivation of the non-adiabatic couplings for single molecules in the strong coupling regime suitable for the calculation of the dressed state dynamics. The formalism allows to use quantities readily accessible from quantum chemistry codes likemore » the adiabatic potential energy surfaces and dipole moments to carry out wave packet simulations in the dressed basis. The implications for photochemistry are demonstrated for a set of model systems representing typical situations found in molecules.« less

Slowly changing potential problems in Quantum Mechanics: Adiabatic theorems, ergodic theorems, and scattering

DOE Office of Scientific and Technical Information (OSTI.GOV)

Fishman, S., E-mail: fishman@physics.technion.ac.il; Soffer, A., E-mail: soffer@math.rutgers.edu

2016-07-15

We employ the recently developed multi-time scale averaging method to study the large time behavior of slowly changing (in time) Hamiltonians. We treat some known cases in a new way, such as the Zener problem, and we give another proof of the adiabatic theorem in the gapless case. We prove a new uniform ergodic theorem for slowly changing unitary operators. This theorem is then used to derive the adiabatic theorem, do the scattering theory for such Hamiltonians, and prove some classical propagation estimates and asymptotic completeness.

Adiabatic quantum-flux-parametron cell library designed using a 10 kA cm-2 niobium fabrication process

NASA Astrophysics Data System (ADS)

Takeuchi, Naoki; Nagasawa, Shuichi; China, Fumihiro; Ando, Takumi; Hidaka, Mutsuo; Yamanashi, Yuki; Yoshikawa, Nobuyuki

2017-03-01

Adiabatic quantum-flux-parametron (AQFP) logic is an energy-efficient superconductor logic with zero static power consumption and very small switching energy. In this paper, we report a new AQFP cell library designed using the AIST 10 kA cm-2 Nb high-speed standard process (HSTP), which is a high-critical-current-density version of the AIST 2.5 kA cm-2 Nb standard process (STP2). Since the intrinsic damping of the Josephson junction (JJ) of HSTP is relatively strong, shunt resistors for JJs were removed and the energy efficiency improved significantly. Also, excitation transformers in the new cells were redesigned so that the cells can operate in a four-phase excitation mode. We described the detail of HSTP and the AQFP cell library designed using HSTP, and showed experimental results of cell test circuits.

Adiabatic photo-steering theory in topological insulators.

PubMed

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.

Adiabatic photo-steering theory in topological insulators

NASA Astrophysics Data System (ADS)

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.

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

PubMed Central

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

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

PubMed

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.

Single Channel Quantum Color Image Encryption Algorithm Based on HSI Model and Quantum Fourier Transform

NASA Astrophysics Data System (ADS)

Gong, Li-Hua; He, Xiang-Tao; Tan, Ru-Chao; Zhou, Zhi-Hong

2018-01-01

In order to obtain high-quality color images, it is important to keep the hue component unchanged while emphasize the intensity or saturation component. As a public color model, Hue-Saturation Intensity (HSI) model is commonly used in image processing. A new single channel quantum color image encryption algorithm based on HSI model and quantum Fourier transform (QFT) is investigated, where the color components of the original color image are converted to HSI and the logistic map is employed to diffuse the relationship of pixels in color components. Subsequently, quantum Fourier transform is exploited to fulfill the encryption. The cipher-text is a combination of a gray image and a phase matrix. Simulations and theoretical analyses demonstrate that the proposed single channel quantum color image encryption scheme based on the HSI model and quantum Fourier transform is secure and effective.

Experimental Raman adiabatic transfer of optical states in rubidium

NASA Astrophysics Data System (ADS)

Appel, Jürgen; Figueroa, Eden; Vewinger, Frank; Marzlin, Karl-Peter; Lvovsky, Alexander

2007-06-01

An essential element of a quantum optical communication network is a tool for transferring and/or distributing quantum information between optical modes (possibly of different frequencies) in a loss- and decoherence-free fashion. We present a theory [1] and an experimental demonstration [2] of a protocol for routing and frequency conversion of optical quantum information via electromagnetically-induced transparency in an atomic system with multiple excited levels. Transfer of optical states between different signal modes is implemented by adiabatically changing the control fields. The proof-of-principle experiment is performed using the hyperfine levels of the rubidium D1 line. [1] F. Vewinger, J. Appel, E. Figueroa, A. I. Lvovsky, quant-ph/0611181 [2] J. Appel, K.-P. Marzlin, A. I. Lvovsky, Phys. Rev. A 73, 013804 (2006)

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

NASA Astrophysics Data System (ADS)

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

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

Machnes, S.; Institute for Theoretical Physics, University of Ulm, D-89069 Ulm; Sander, U.

2011-08-15

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 aremore » 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.« less

General A Scheme to Share Information via Employing Discrete Algorithm to Quantum States

NASA Astrophysics Data System (ADS)

Kang, Guo-Dong; Fang, Mao-Fa

2011-02-01

We propose a protocol for information sharing between two legitimate parties (Bob and Alice) via public-key cryptography. In particular, we specialize the protocol by employing discrete algorithm under mod that maps integers to quantum states via photon rotations. Based on this algorithm, we find that the protocol is secure under various classes of attacks. Specially, owe to the algorithm, the security of the classical privacy contained in the quantum public-key and the corresponding ciphertext is guaranteed. And the protocol is robust against the impersonation attack and the active wiretapping attack by designing particular checking processing, thus the protocol is valid.

Quantum algorithms for topological and geometric analysis of data

PubMed Central

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

Cross-coupling effects in circuit-QED stimulated Raman adiabatic passage

NASA Astrophysics Data System (ADS)

Vepsäläinen, A.; Paraoanu, G. S.

2018-03-01

Stimulated Raman adiabatic passage is a quantum protocol that can be used for robust state preparation in a three-level system. It has been commonly employed in quantum optics, but recently this technique has drawn attention also in circuit quantum electrodynamics. The protocol relies on two slowly varying drive pulses that couple the initial and the target state via an intermediate state, which remains unpopulated. Here we study the detrimental effect of the parasitic couplings of the drives into transitions other than those required by the protocol. The effect is most prominent in systems with almost harmonic energy level structure, such as the transmon. We show that under these conditions in the presence of decoherence there exists an optimal STIRAP amplitude for population transfer.

Completing the physical representation of quantum algorithms provides a retrocausal explanation of the speedup

NASA Astrophysics Data System (ADS)

Castagnoli, Giuseppe

2017-05-01

The usual representation of quantum algorithms, limited to the process of solving the problem, is physically incomplete as it lacks the initial measurement. We extend it to the process of setting the problem. An initial measurement selects a problem setting at random, and a unitary transformation sends it into the desired setting. The extended representation must be with respect to Bob, the problem setter, and any external observer. It cannot be with respect to Alice, the problem solver. It would tell her the problem setting and thus the solution of the problem implicit in it. In the representation to Alice, the projection of the quantum state due to the initial measurement should be postponed until the end of the quantum algorithm. In either representation, there is a unitary transformation between the initial and final measurement outcomes. As a consequence, the final measurement of any ℛ-th part of the solution could select back in time a corresponding part of the random outcome of the initial measurement; the associated projection of the quantum state should be advanced by the inverse of that unitary transformation. This, in the representation to Alice, would tell her, before she begins her problem solving action, that part of the solution. The quantum algorithm should be seen as a sum over classical histories in each of which Alice knows in advance one of the possible ℛ-th parts of the solution and performs the oracle queries still needed to find it - this for the value of ℛ that explains the algorithm's speedup. We have a relation between retrocausality ℛ and the number of oracle queries needed to solve an oracle problem quantumly. All the oracle problems examined can be solved with any value of ℛ up to an upper bound attained by the optimal quantum algorithm. This bound is always in the vicinity of 1/2 . Moreover, ℛ =1/2 always provides the order of magnitude of the number of queries needed to solve the problem in an optimal quantum way. If this

Oscillating potential well in the complex plane and the adiabatic theorem

NASA Astrophysics Data System (ADS)

Longhi, Stefano

2017-10-01

A quantum particle in a slowly changing potential well V (x ,t ) =V ( x -x0(ɛ t ) ) , periodically shaken in time at a slow frequency ɛ , provides an important quantum mechanical system where the adiabatic theorem fails to predict the asymptotic dynamics over time scales longer than ˜1 /ɛ . Specifically, we consider a double-well potential V (x ) sustaining two bound states spaced in frequency by ω0 and periodically shaken in a complex plane. Two different spatial displacements x0(t ) are assumed: the real spatial displacement x0(ɛ t ) =A sin(ɛ t ) , corresponding to ordinary Hermitian shaking, and the complex one x0(ɛ t ) =A -A exp(-i ɛ t ) , corresponding to non-Hermitian shaking. When the particle is initially prepared in the ground state of the potential well, breakdown of adiabatic evolution is found for both Hermitian and non-Hermitian shaking whenever the oscillation frequency ɛ is close to an odd resonance of ω0. However, a different physical mechanism underlying nonadiabatic transitions is found in the two cases. For the Hermitian shaking, an avoided crossing of quasienergies is observed at odd resonances and nonadiabatic transitions between the two bound states, resulting in Rabi flopping, can be explained as a multiphoton resonance process. For the complex oscillating potential well, breakdown of adiabaticity arises from the appearance of Floquet exceptional points at exact quasienergy crossing.

Efficient quantum algorithm for computing n-time correlation functions.

PubMed

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

2014-07-11

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

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

NASA Astrophysics Data System (ADS)

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.

Fast Quantum Algorithm for Predicting Descriptive Statistics of Stochastic Processes

NASA Technical Reports Server (NTRS)

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.

Quantum Spin Glasses, Annealing and Computation

NASA Astrophysics Data System (ADS)

Chakrabarti, Bikas K.; Inoue, Jun-ichi; Tamura, Ryo; Tanaka, Shu

2017-05-01

List of tables; List of figures, Preface; 1. Introduction; Part I. Quantum Spin Glass, Annealing and Computation: 2. Classical spin models from ferromagnetic spin systems to spin glasses; 3. Simulated annealing; 4. Quantum spin glass; 5. Quantum dynamics; 6. Quantum annealing; Part II. Additional Notes: 7. Notes on adiabatic quantum computers; 8. Quantum information and quenching dynamics; 9. A brief historical note on the studies of quantum glass, annealing and computation.

MCTDH on-the-fly: Efficient grid-based quantum dynamics without pre-computed potential energy surfaces

NASA Astrophysics Data System (ADS)

Richings, Gareth W.; Habershon, Scott

2018-04-01

We present significant algorithmic improvements to a recently proposed direct quantum dynamics method, based upon combining well established grid-based quantum dynamics approaches and expansions of the potential energy operator in terms of a weighted sum of Gaussian functions. Specifically, using a sum of low-dimensional Gaussian functions to represent the potential energy surface (PES), combined with a secondary fitting of the PES using singular value decomposition, we show how standard grid-based quantum dynamics methods can be dramatically accelerated without loss of accuracy. This is demonstrated by on-the-fly simulations (using both standard grid-based methods and multi-configuration time-dependent Hartree) of both proton transfer on the electronic ground state of salicylaldimine and the non-adiabatic dynamics of pyrazine.

Adiabatic Berry phase in an atom-molecule conversion system

DOE Office of Scientific and Technical Information (OSTI.GOV)

Fu Libin; Center for Applied Physics and Technology, Peking University, Beijing 100084; Liu Jie, E-mail: liu_jie@iapcm.ac.c

2010-11-15

We investigate the Berry phase of adiabatic quantum evolution in the atom-molecule conversion system that is governed by a nonlinear Schroedinger equation. We find that the Berry phase consists of two parts: the usual Berry connection term and a novel term from the nonlinearity brought forth by the atom-molecule coupling. The total geometric phase can be still viewed as the flux of the magnetic field of a monopole through the surface enclosed by a closed path in parameter space. The charge of the monopole, however, is found to be one third of the elementary charge of the usual quantized monopole.more » We also derive the classical Hannay angle of a geometric nature associated with the adiabatic evolution. It exactly equals minus Berry phase, indicating a novel connection between Berry phase and Hannay angle in contrast to the usual derivative form.« less

Quantum machine learning for quantum anomaly detection

NASA Astrophysics Data System (ADS)

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.

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

NASA Astrophysics Data System (ADS)

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.

Dynamics of the quantum search and quench-induced first-order phase transitions.

PubMed

Coulamy, Ivan B; Saguia, Andreia; Sarandy, Marcelo S

2017-02-01

We investigate the excitation dynamics at a first-order quantum phase transition (QPT). More specifically, we consider the quench-induced QPT in the quantum search algorithm, which aims at finding out a marked element in an unstructured list. We begin by deriving the exact dynamics of the model, which is shown to obey a Riccati differential equation. Then, we discuss the probabilities of success by adopting either global or local adiabaticity strategies. Moreover, we determine the disturbance of the quantum criticality as a function of the system size. In particular, we show that the critical point exponentially converges to its thermodynamic limit even in a fast evolution regime, which is characterized by both entanglement QPT estimators and the Schmidt gap. The excitation pattern is manifested in terms of quantum domain walls separated by kinks. The kink density is then shown to follow an exponential scaling as a function of the evolution speed, which can be interpreted as a Kibble-Zurek mechanism for first-order QPTs.

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

PubMed

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

2016-11-18

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

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

NASA Astrophysics Data System (ADS)

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.

Super-heavy electron material as metallic refrigerant for adiabatic demagnetization cooling

PubMed Central

Tokiwa, Yoshifumi; Piening, Boy; Jeevan, Hirale S.; Bud’ko, Sergey L.; Canfield, Paul C.; Gegenwart, Philipp

2016-01-01

Low-temperature refrigeration is of crucial importance in fundamental research of condensed matter physics, because the investigations of fascinating quantum phenomena, such as superconductivity, superfluidity, and quantum criticality, often require refrigeration down to very low temperatures. Currently, cryogenic refrigerators with 3He gas are widely used for cooling below 1 K. However, usage of the gas has been increasingly difficult because of the current worldwide shortage. Therefore, it is important to consider alternative methods of refrigeration. We show that a new type of refrigerant, the super-heavy electron metal YbCo2Zn20, can be used for adiabatic demagnetization refrigeration, which does not require 3He gas. This method has a number of advantages, including much better metallic thermal conductivity compared to the conventional insulating refrigerants. We also demonstrate that the cooling performance is optimized in Yb1−xScxCo2Zn20 by partial Sc substitution, with x ~ 0.19. The substitution induces chemical pressure that drives the materials to a zero-field quantum critical point. This leads to an additional enhancement of the magnetocaloric effect in low fields and low temperatures, enabling final temperatures well below 100 mK. This performance has, up to now, been restricted to insulators. For nearly a century, the same principle of using local magnetic moments has been applied for adiabatic demagnetization cooling. This study opens new possibilities of using itinerant magnetic moments for cryogen-free refrigeration. PMID:27626073

Super-heavy electron material as metallic refrigerant for adiabatic demagnetization cooling

DOE PAGES

Tokiwa, Yoshifumi; Piening, Boy; Jeevan, Hirale S.; ...

2016-09-09

Low-temperature refrigeration is of crucial importance in fundamental research of condensed matter physics, because the investigations of fascinating quantum phenomena, such as superconductivity, superfluidity, and quantum criticality, often require refrigeration down to very low temperatures. Currently, cryogenic refrigerators with 3He gas are widely used for cooling below 1 Kelvin. However, usage of the gas has been increasingly difficult because of the current world-wide shortage. Therefore, it is important to consider alternative methods of refrigeration. We show that a new type of refrigerant, the super-heavy electron metal YbCo 2Zn 20, can be used for adiabatic demagnetization refrigeration, which does not requiremore » 3He gas. This method has a number of advantages, including much better metallic thermal conductivity compared to the conventional insulating refrigerants. We also demonstrate that the cooling performance is optimized in Yb 1$-$xSc xCo 2Zn 20 by partial Sc substitution, with x ~ 0.19. The substitution induces chemical pressure that drives the materials to a zero-field quantum critical point. This leads to an additional enhancement of the magnetocaloric effect in low fields and low temperatures, enabling final temperatures well below 100 mK. This performance has, up to now, been restricted to insulators. For nearly a century, the same principle of using local magnetic moments has been applied for adiabatic demagnetization cooling. Lastly, this study opens new possibilities of using itinerant magnetic moments for cryogen-free refrigeration.« less

Super-heavy electron material as metallic refrigerant for adiabatic demagnetization cooling.

PubMed

Tokiwa, Yoshifumi; Piening, Boy; Jeevan, Hirale S; Bud'ko, Sergey L; Canfield, Paul C; Gegenwart, Philipp

2016-09-01

Low-temperature refrigeration is of crucial importance in fundamental research of condensed matter physics, because the investigations of fascinating quantum phenomena, such as superconductivity, superfluidity, and quantum criticality, often require refrigeration down to very low temperatures. Currently, cryogenic refrigerators with (3)He gas are widely used for cooling below 1 K. However, usage of the gas has been increasingly difficult because of the current worldwide shortage. Therefore, it is important to consider alternative methods of refrigeration. We show that a new type of refrigerant, the super-heavy electron metal YbCo2Zn20, can be used for adiabatic demagnetization refrigeration, which does not require (3)He gas. This method has a number of advantages, including much better metallic thermal conductivity compared to the conventional insulating refrigerants. We also demonstrate that the cooling performance is optimized in Yb1-x Sc x Co2Zn20 by partial Sc substitution, with x ~ 0.19. The substitution induces chemical pressure that drives the materials to a zero-field quantum critical point. This leads to an additional enhancement of the magnetocaloric effect in low fields and low temperatures, enabling final temperatures well below 100 mK. This performance has, up to now, been restricted to insulators. For nearly a century, the same principle of using local magnetic moments has been applied for adiabatic demagnetization cooling. This study opens new possibilities of using itinerant magnetic moments for cryogen-free refrigeration.

Super-heavy electron material as metallic refrigerant for adiabatic demagnetization cooling

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tokiwa, Yoshifumi; Piening, Boy; Jeevan, Hirale S.

Low-temperature refrigeration is of crucial importance in fundamental research of condensed matter physics, because the investigations of fascinating quantum phenomena, such as superconductivity, superfluidity, and quantum criticality, often require refrigeration down to very low temperatures. Currently, cryogenic refrigerators with 3He gas are widely used for cooling below 1 Kelvin. However, usage of the gas has been increasingly difficult because of the current world-wide shortage. Therefore, it is important to consider alternative methods of refrigeration. We show that a new type of refrigerant, the super-heavy electron metal YbCo 2Zn 20, can be used for adiabatic demagnetization refrigeration, which does not requiremore » 3He gas. This method has a number of advantages, including much better metallic thermal conductivity compared to the conventional insulating refrigerants. We also demonstrate that the cooling performance is optimized in Yb 1$-$xSc xCo 2Zn 20 by partial Sc substitution, with x ~ 0.19. The substitution induces chemical pressure that drives the materials to a zero-field quantum critical point. This leads to an additional enhancement of the magnetocaloric effect in low fields and low temperatures, enabling final temperatures well below 100 mK. This performance has, up to now, been restricted to insulators. For nearly a century, the same principle of using local magnetic moments has been applied for adiabatic demagnetization cooling. Lastly, this study opens new possibilities of using itinerant magnetic moments for cryogen-free refrigeration.« less

Time Scale for Adiabaticity Breakdown in Driven Many-Body Systems and Orthogonality Catastrophe

NASA Astrophysics Data System (ADS)

Lychkovskiy, Oleg; Gamayun, Oleksandr; Cheianov, Vadim

2017-11-01

The adiabatic theorem is a fundamental result in quantum mechanics, which states that a system can be kept arbitrarily close to the instantaneous ground state of its Hamiltonian if the latter varies in time slowly enough. The theorem has an impressive record of applications ranging from foundations of quantum field theory to computational molecular dynamics. In light of this success it is remarkable that a practicable quantitative understanding of what "slowly enough" means is limited to a modest set of systems mostly having a small Hilbert space. Here we show how this gap can be bridged for a broad natural class of physical systems, namely, many-body systems where a small move in the parameter space induces an orthogonality catastrophe. In this class, the conditions for adiabaticity are derived from the scaling properties of the parameter-dependent ground state without a reference to the excitation spectrum. This finding constitutes a major simplification of a complex problem, which otherwise requires solving nonautonomous time evolution in a large Hilbert space.

Accelerated quantum control using superadiabatic dynamics in a solid-state lambda system

DOE PAGES

Zhou, Brian B.; Baksic, Alexandre; Ribeiro, Hugo; ...

2016-11-28

Adiabatic evolutions find widespread utility in applications to quantum state engineering1 , geometric quantum computation2 , and quantum simulation3 . Although offering desirable robustness to experimental imperfections, adiabatic techniques are susceptible to decoherence during their long operation time. A recent strategy termed ‘shortcuts to adiabaticity’ 4–10 (STA) aims to circumvent this trade-off by designing fast dynamics to reproduce the results of infinitely slow, adiabatic processes. Here, as a realization of this strategy, we implement ‘superadiabatic’ transitionless driving11 (SATD) to speed up stimulated Raman adiabatic passage1,12–15 (STIRAP) in a solid-state lambda (Λ) system. Utilizing optical transitions to a dissipative excited statemore » in the nitrogen vacancy (NV) center in diamond, we demonstrate the accelerated performance of different shortcut trajectories for population transfer and for the transfer and initialization of coherent superpositions. We reveal that SATD protocols exhibit robustness to dissipation and experimental uncertainty, and can be optimized when these effects are present. These results motivate STA as a promising tool for controlling open quantum systems comprising individual or hybrid nanomechanical, superconducting, and photonic elements in the solid state12–17.« less

A Novel Quantum-Behaved Bat Algorithm with Mean Best Position Directed for Numerical Optimization

PubMed Central

Zhu, Wenyong; Liu, Zijuan; Duan, Qingyan; Cao, Long

2016-01-01

This paper proposes a novel quantum-behaved bat algorithm with the direction of mean best position (QMBA). In QMBA, the position of each bat is mainly updated by the current optimal solution in the early stage of searching and in the late search it also depends on the mean best position which can enhance the convergence speed of the algorithm. During the process of searching, quantum behavior of bats is introduced which is beneficial to jump out of local optimal solution and make the quantum-behaved bats not easily fall into local optimal solution, and it has better ability to adapt complex environment. Meanwhile, QMBA makes good use of statistical information of best position which bats had experienced to generate better quality solutions. This approach not only inherits the characteristic of quick convergence, simplicity, and easy implementation of original bat algorithm, but also increases the diversity of population and improves the accuracy of solution. Twenty-four benchmark test functions are tested and compared with other variant bat algorithms for numerical optimization the simulation results show that this approach is simple and efficient and can achieve a more accurate solution. PMID:27293424

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

PubMed

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.

Non-Adiabatic Molecular Dynamics Methods for Materials Discovery

DOE Office of Scientific and Technical Information (OSTI.GOV)

Furche, Filipp; Parker, Shane M.; Muuronen, Mikko J.

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 ofmore » 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.« less

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

NASA Technical Reports Server (NTRS)

Gingold, H.

1991-01-01

A counterexample to the adiabatic approximation theorem is given when degeneracies are present. A formulation of an alternative version is proposed. A complete asymptotic decomposition for n dimensional self-adjoint Hamiltonian systems is restated and used.

Constructing diabatic representations using adiabatic and approximate diabatic data--Coping with diabolical singularities.

PubMed

Zhu, Xiaolei; Yarkony, David R

2016-01-28

We have recently introduced a diabatization scheme, which simultaneously fits and diabatizes adiabatic ab initio electronic wave functions, Zhu and Yarkony J. Chem. Phys. 140, 024112 (2014). The algorithm uses derivative couplings in the defining equations for the diabatic Hamiltonian, H(d), and fits all its matrix elements simultaneously to adiabatic state data. This procedure ultimately provides an accurate, quantifiably diabatic, representation of the adiabatic electronic structure data. However, optimizing the large number of nonlinear parameters in the basis functions and adjusting the number and kind of basis functions from which the fit is built, which provide the essential flexibility, has proved challenging. In this work, we introduce a procedure that combines adiabatic state and diabatic state data to efficiently optimize the nonlinear parameters and basis function expansion. Further, we consider using direct properties based diabatizations to initialize the fitting procedure. To address this issue, we introduce a systematic method for eliminating the debilitating (diabolical) singularities in the defining equations of properties based diabatizations. We exploit the observation that if approximate diabatic data are available, the commonly used approach of fitting each matrix element of H(d) individually provides a starting point (seed) from which convergence of the full H(d) construction algorithm is rapid. The optimization of nonlinear parameters and basis functions and the elimination of debilitating singularities are, respectively, illustrated using the 1,2,3,4(1)A states of phenol and the 1,2(1)A states of NH3, states which are coupled by conical intersections.

Modification of optical properties by adiabatic shifting of resonances in a four-level atom

NASA Astrophysics Data System (ADS)

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.

Non-commuting two-local Hamiltonians for quantum error suppression

NASA Astrophysics Data System (ADS)

Jiang, Zhang; Rieffel, Eleanor G.

2017-04-01

Physical constraints make it challenging to implement and control many-body interactions. For this reason, designing quantum information processes with Hamiltonians consisting of only one- and two-local terms is a worthwhile challenge. Enabling error suppression with two-local Hamiltonians is particularly challenging. A no-go theorem of Marvian and Lidar (Phys Rev Lett 113(26):260504, 2014) demonstrates that, even allowing particles with high Hilbert space dimension, it is impossible to protect quantum information from single-site errors by encoding in the ground subspace of any Hamiltonian containing only commuting two-local terms. Here, we get around this no-go result by encoding in the ground subspace of a Hamiltonian consisting of non-commuting two-local terms arising from the gauge operators of a subsystem code. Specifically, we show how to protect stored quantum information against single-qubit errors using a Hamiltonian consisting of sums of the gauge generators from Bacon-Shor codes (Bacon in Phys Rev A 73(1):012340, 2006) and generalized-Bacon-Shor code (Bravyi in Phys Rev A 83(1):012320, 2011). Our results imply that non-commuting two-local Hamiltonians have more error-suppressing power than commuting two-local Hamiltonians. While far from providing full fault tolerance, this approach improves the robustness achievable in near-term implementable quantum storage and adiabatic quantum computations, reducing the number of higher-order terms required to encode commonly used adiabatic Hamiltonians such as the Ising Hamiltonians common in adiabatic quantum optimization and quantum annealing.

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

PubMed

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.

A formulation of a matrix sparsity approach for the quantum ordered search algorithm

NASA Astrophysics Data System (ADS)

Parmar, Jupinder; Rahman, Saarim; Thiara, Jaskaran

One specific subset of quantum algorithms is Grovers Ordered Search Problem (OSP), the quantum counterpart of the classical binary search algorithm, which utilizes oracle functions to produce a specified value within an ordered database. Classically, the optimal algorithm is known to have a log2N complexity; however, Grovers algorithm has been found to have an optimal complexity between the lower bound of ((lnN-1)/π≈0.221log2N) and the upper bound of 0.433log2N. We sought to lower the known upper bound of the OSP. With Farhi et al. MITCTP 2815 (1999), arXiv:quant-ph/9901059], we see that the OSP can be resolved into a translational invariant algorithm to create quantum query algorithm restraints. With these restraints, one can find Laurent polynomials for various k — queries — and N — database sizes — thus finding larger recursive sets to solve the OSP and effectively reducing the upper bound. These polynomials are found to be convex functions, allowing one to make use of convex optimization to find an improvement on the known bounds. According to Childs et al. [Phys. Rev. A 75 (2007) 032335], semidefinite programming, a subset of convex optimization, can solve the particular problem represented by the constraints. We were able to implement a program abiding to their formulation of a semidefinite program (SDP), leading us to find that it takes an immense amount of storage and time to compute. To combat this setback, we then formulated an approach to improve results of the SDP using matrix sparsity. Through the development of this approach, along with an implementation of a rudimentary solver, we demonstrate how matrix sparsity reduces the amount of time and storage required to compute the SDP — overall ensuring further improvements will likely be made to reach the theorized lower bound.

Experimental realization of non-Abelian non-adiabatic geometric gates.

PubMed

Abdumalikov, A A; Fink, J M; Juliusson, K; Pechal, M; Berger, S; Wallraff, A; Filipp, S

2013-04-25

The geometric aspects of quantum mechanics are emphasized most prominently by the concept of geometric phases, which are acquired whenever a quantum system evolves along a path in Hilbert space, that is, the space of quantum states of the system. The geometric phase is determined only by the shape of this path and is, in its simplest form, a real number. However, if the system has degenerate energy levels, then matrix-valued geometric state transformations, known as non-Abelian holonomies--the effect of which depends on the order of two consecutive paths--can be obtained. They are important, for example, for the creation of synthetic gauge fields in cold atomic gases or the description of non-Abelian anyon statistics. Moreover, there are proposals to exploit non-Abelian holonomic gates for the purposes of noise-resilient quantum computation. In contrast to Abelian geometric operations, non-Abelian ones have been observed only in nuclear quadrupole resonance experiments with a large number of spins, and without full characterization of the geometric process and its non-commutative nature. Here we realize non-Abelian non-adiabatic holonomic quantum operations on a single, superconducting, artificial three-level atom by applying a well-controlled, two-tone microwave drive. Using quantum process tomography, we determine fidelities of the resulting non-commuting gates that exceed 95 per cent. We show that two different quantum gates, originating from two distinct paths in Hilbert space, yield non-equivalent transformations when applied in different orders. This provides evidence for the non-Abelian character of the implemented holonomic quantum operations. In combination with a non-trivial two-quantum-bit gate, our method suggests a way to universal holonomic quantum computing.

The Quantum Approximation Optimization Algorithm for MaxCut: A Fermionic View

NASA Technical Reports Server (NTRS)

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

2017-01-01

Farhi et al. recently proposed a class of quantum algorithms, the Quantum Approximate Optimization Algorithm (QAOA), for approximately solving combinatorial optimization problems. A level-p QAOA circuit consists of steps in which a classical Hamiltonian, derived from the cost function, is applied followed by a mixing Hamiltonian. The 2p times for which these two Hamiltonians are applied are the parameters of the algorithm. As p increases, however, the parameter search space grows quickly. 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 QAOA applied to MAXCUT. For 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 1D antiferromagnetic ring, we provide an analysis for arbitrarily high level. Using a Fermionic representation, the evolution of the system under QAOA translates into quantum optimal control of an ensemble of independent spins. This treatment enables us to obtain analytical expressions for the performance of QAOA for any p. It also greatly simplifies numerical search for the optimal values of the parameters. By exploring symmetries, we identify a lower-dimensional sub-manifold 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.

Possible quantum algorithm for the Lipshitz-Sarkar-Steenrod square for Khovanov homology

NASA Astrophysics Data System (ADS)

Ospina, Juan

2013-05-01

Recently the celebrated Khovanov Homology was introduced as a target for Topological Quantum Computation given that the Khovanov Homology provides a generalization of the Jones polynomal and then it is possible to think about of a generalization of the Aharonov.-Jones-Landau algorithm. Recently, Lipshitz and Sarkar introduced a space-level refinement of Khovanov homology. which is called Khovanov Homotopy. This refinement induces a Steenrod square operation Sq2 on Khovanov homology which they describe explicitly and then some computations of Sq2 were presented. Particularly, examples of links with identical integral Khovanov homology but with distinct Khovanov homotopy types were showed. In the presente work we will introduce possible quantum algorithms for the Lipshitz- Sarkar-Steenrod square for Khovanov Homolog and their possible simulations using computer algebra.

A Circuit-Based Quantum Algorithm Driven by Transverse Fields for Grover's Problem

NASA Technical Reports Server (NTRS)

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

2017-01-01

We designed a quantum search algorithm, giving the same quadratic speedup achieved by Grover's original algorithm; we replace Grover's diffusion operator (hard to implement) with a product diffusion operator generated by transverse fields (easy to implement). In our algorithm, the problem Hamiltonian (oracle) and the transverse fields are applied to the system alternatively. We construct such a sequence that the corresponding unitary generates a closed transition between the initial state (even superposition of all states) and a modified target state, which has a high degree of overlap with the original target state.

Multi-state trajectory approach to non-adiabatic dynamics: General formalism and the active state trajectory approximation

NASA Astrophysics Data System (ADS)

Tao, Guohua

2017-07-01

A general theoretical framework is derived for the recently developed multi-state trajectory (MST) approach from the time dependent Schrödinger equation, resulting in equations of motion for coupled nuclear-electronic dynamics equivalent to Hamilton dynamics or Heisenberg equation based on a new multistate Meyer-Miller (MM) model. The derived MST formalism incorporates both diabatic and adiabatic representations as limiting cases and reduces to Ehrenfest or Born-Oppenheimer dynamics in the mean-field or the single-state limits, respectively. In the general multistate formalism, nuclear dynamics is represented in terms of a set of individual state-specific trajectories, while in the active state trajectory (AST) approximation, only one single nuclear trajectory on the active state is propagated with its augmented images running on all other states. The AST approximation combines the advantages of consistent nuclear-coupled electronic dynamics in the MM model and the single nuclear trajectory in the trajectory surface hopping (TSH) treatment and therefore may provide a potential alternative to both Ehrenfest and TSH methods. The resulting algorithm features in a consistent description of coupled electronic-nuclear dynamics and excellent numerical stability. The implementation of the MST approach to several benchmark systems involving multiple nonadiabatic transitions and conical intersection shows reasonably good agreement with exact quantum calculations, and the results in both representations are similar in accuracy. The AST treatment also reproduces the exact results reasonably, sometimes even quantitatively well, with a better performance in the adiabatic representation.

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

NASA Astrophysics Data System (ADS)

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.

Polynomial-time quantum algorithm for the simulation of chemical dynamics

PubMed Central

Kassal, Ivan; Jordan, Stephen P.; Love, Peter J.; Mohseni, Masoud; Aspuru-Guzik, Alán

2008-01-01

The computational cost of exact methods for quantum simulation using classical computers grows exponentially with system size. As a consequence, these techniques can be applied only to small systems. By contrast, we demonstrate that quantum computers could exactly simulate chemical reactions in polynomial time. Our algorithm uses the split-operator approach and explicitly simulates all electron-nuclear and interelectronic interactions in quadratic time. Surprisingly, this treatment is not only more accurate than the Born–Oppenheimer approximation but faster and more efficient as well, for all reactions with more than about four atoms. This is the case even though the entire electronic wave function is propagated on a grid with appropriately short time steps. Although the preparation and measurement of arbitrary states on a quantum computer is inefficient, here we demonstrate how to prepare states of chemical interest efficiently. We also show how to efficiently obtain chemically relevant observables, such as state-to-state transition probabilities and thermal reaction rates. Quantum computers using these techniques could outperform current classical computers with 100 qubits. PMID:19033207

Constructing diabatic representations using adiabatic and approximate diabatic data – Coping with diabolical singularities

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhu, Xiaolei, E-mail: virtualzx@gmail.com; Yarkony, David R., E-mail: yarkony@jhu.edu

2016-01-28

We have recently introduced a diabatization scheme, which simultaneously fits and diabatizes adiabatic ab initio electronic wave functions, Zhu and Yarkony J. Chem. Phys. 140, 024112 (2014). The algorithm uses derivative couplings in the defining equations for the diabatic Hamiltonian, H{sup d}, and fits all its matrix elements simultaneously to adiabatic state data. This procedure ultimately provides an accurate, quantifiably diabatic, representation of the adiabatic electronic structure data. However, optimizing the large number of nonlinear parameters in the basis functions and adjusting the number and kind of basis functions from which the fit is built, which provide the essential flexibility,more » has proved challenging. In this work, we introduce a procedure that combines adiabatic state and diabatic state data to efficiently optimize the nonlinear parameters and basis function expansion. Further, we consider using direct properties based diabatizations to initialize the fitting procedure. To address this issue, we introduce a systematic method for eliminating the debilitating (diabolical) singularities in the defining equations of properties based diabatizations. We exploit the observation that if approximate diabatic data are available, the commonly used approach of fitting each matrix element of H{sup d} individually provides a starting point (seed) from which convergence of the full H{sup d} construction algorithm is rapid. The optimization of nonlinear parameters and basis functions and the elimination of debilitating singularities are, respectively, illustrated using the 1,2,3,4{sup 1}A states of phenol and the 1,2{sup 1}A states of NH{sub 3}, states which are coupled by conical intersections.« less

Adiabatic Soliton Laser

NASA Astrophysics Data System (ADS)

Bednyakova, Anastasia; Turitsyn, Sergei K.

2015-03-01

The key to generating stable optical pulses is mastery of nonlinear light dynamics in laser resonators. Modern techniques to control the buildup of laser pulses are based on nonlinear science and include classical solitons, dissipative solitons, parabolic pulses (similaritons) and various modifications and blending of these methods. Fiber lasers offer remarkable opportunities to apply one-dimensional nonlinear science models for the design and optimization of very practical laser systems. Here, we propose a new concept of a laser based on the adiabatic amplification of a soliton pulse in the cavity—the adiabatic soliton laser. The adiabatic change of the soliton parameters during evolution in the resonator relaxes the restriction on the pulse energy inherent in traditional soliton lasers. Theoretical analysis is confirmed by extensive numerical modeling.

Geometric manipulation of trapped ions for quantum computation.

PubMed

Duan, L M; Cirac, J I; Zoller, P

2001-06-01

We propose an experimentally feasible scheme to achieve quantum computation based solely on geometric manipulations of a quantum system. The desired geometric operations are obtained by driving the quantum system to undergo appropriate adiabatic cyclic evolutions. Our implementation of the all-geometric quantum computation is based on laser manipulation of a set of trapped ions. An all-geometric approach, apart from its fundamental interest, offers a possible method for robust quantum computation.

An algorithmic approach to solving polynomial equations associated with quantum circuits

NASA Astrophysics Data System (ADS)

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

2009-12-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 Gröbner 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 Gröbner 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 Gröbner bases over F 2.

Role of quantum correlations in light-matter quantum heat engines

NASA Astrophysics Data System (ADS)

Barrios, G. Alvarado; Albarrán-Arriagada, F.; Cárdenas-López, F. A.; Romero, G.; Retamal, J. C.

2017-11-01

We study a quantum Otto engine embedding a working substance composed of a two-level system interacting with a harmonic mode. The physical properties of the substance are described by a generalized quantum Rabi model arising in superconducting circuit realizations. We show that light-matter quantum correlation reduction during the hot bath stage and adiabatic stages act as an indicator for enhanced work extraction and efficiency, respectively. Also, we demonstrate that the anharmonic spectrum of the working substance has a direct impact on the transition from heat engine into refrigerator as the light-matter coupling is increased. These results shed light on the search for optimal conditions in the performance of quantum heat engines.

Deterministic quantum state transfer between remote qubits in cavities

NASA Astrophysics Data System (ADS)

Vogell, B.; Vermersch, B.; Northup, T. E.; Lanyon, B. P.; Muschik, C. A.

2017-12-01

Performing a faithful transfer of an unknown quantum state is a key challenge for enabling quantum networks. The realization of networks with a small number of quantum links is now actively pursued, which calls for an assessment of different state transfer methods to guide future design decisions. Here, we theoretically investigate quantum state transfer between two distant qubits, each in a cavity, connected by a waveguide, e.g., an optical fiber. We evaluate the achievable success probabilities of state transfer for two different protocols: standard wave packet shaping and adiabatic passage. The main loss sources are transmission losses in the waveguide and absorption losses in the cavities. While special cases studied in the literature indicate that adiabatic passages may be beneficial in this context, it remained an open question under which conditions this is the case and whether their use will be advantageous in practice. We answer these questions by providing a full analysis, showing that state transfer by adiabatic passage—in contrast to wave packet shaping—can mitigate the effects of undesired cavity losses, far beyond the regime of coupling to a single waveguide mode and the regime of lossless waveguides, as was proposed so far. Furthermore, we show that the photon arrival probability is in fact bounded in a trade-off between losses due to non-adiabaticity and due to coupling to off-resonant waveguide modes. We clarify that neither protocol can avoid transmission losses and discuss how the cavity parameters should be chosen to achieve an optimal state transfer.

Interfacing External Quantum Devices to a Universal Quantum Computer

PubMed Central

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

2011-01-01

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

Interfacing external quantum devices to a universal quantum computer.

PubMed

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

2011-01-01

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

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

ERIC Educational Resources Information Center

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…

Generation of three-qubit Greenberger-Horne-Zeilinger state of superconducting qubits via transitionless quantum driving

NASA Astrophysics Data System (ADS)

Zhang, Xu; Chen, Ye-Hong; Wu, Qi-Cheng; Shi, Zhi-Cheng; Song, Jie; Xia, Yan

2017-01-01

We present an efficient scheme to quickly generate three-qubit Greenberger-Horne-Zeilinger (GHZ) states by using three superconducting qubits (SQs) separated by two coplanar waveguide resonators (CPWRs) capacitively. The scheme is based on quantum Zeno dynamics and the approach of transitionless quantum driving to construct shortcuts to adiabatic passage. In order to highlight the advantages, we compare the present scheme with the traditional one with adiabatic passage. The comparison result shows the shortcut scheme is closely related to the adiabatic scheme but is better than it. Moreover, we discuss the influence of various decoherences with numerical simulation. The result proves that the present scheme is less sensitive to the energy relaxation, the decay of CPWRs and the deviations of the experimental parameters the same as the adiabatic passage. However, the shortcut scheme is effective and robust against the dephasing of SQs in comparison with the adiabatic scheme.

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

DOE PAGES

Colless, J. I.; Ramasesh, V. V.; Dahlen, D.; ...

2018-02-12

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. Here, we use a superconducting-qubit-based processor to apply the QSE approach to the H 2 molecule, extracting both groundmore » 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.« less

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

Colless, J. I.; Ramasesh, V. V.; Dahlen, D.

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. Here, we use a superconducting-qubit-based processor to apply the QSE approach to the H 2 molecule, extracting both groundmore » 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.« less

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

Whiteside, R.A.; Binkley, J.S.; Colvin, M.E.

1987-02-15

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. Themore » 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.« less

Efficient quantum state transfer in an engineered chain of quantum bits

NASA Astrophysics Data System (ADS)

Sandberg, Martin; Knill, Emanuel; Kapit, Eliot; Vissers, Michael R.; Pappas, David P.

2016-03-01

We present a method of performing quantum state transfer in a chain of superconducting quantum bits. Our protocol is based on engineering the energy levels of the qubits in the chain and tuning them all simultaneously with an external flux bias. The system is designed to allow sequential adiabatic state transfers, resulting in on-demand quantum state transfer from one end of the chain to the other. Numerical simulations of the master equation using realistic parameters for capacitive nearest-neighbor coupling, energy relaxation, and dephasing show that fast, high-fidelity state transfer should be feasible using this method.

Research progress on quantum informatics and quantum computation

NASA Astrophysics Data System (ADS)

Zhao, Yusheng

2018-03-01

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

Quantum Parameter Estimation: From Experimental Design to Constructive Algorithm

NASA Astrophysics Data System (ADS)

Yang, Le; Chen, Xi; Zhang, Ming; Dai, Hong-Yi

2017-11-01

In this paper we design the following two-step scheme to estimate the model parameter ω 0 of the quantum system: first we utilize the Fisher information with respect to an intermediate variable v=\\cos ({ω }0t) to determine an optimal initial state and to seek optimal parameters of the POVM measurement operators; second we explore how to estimate ω 0 from v by choosing t when a priori information knowledge of ω 0 is available. Our optimal initial state can achieve the maximum quantum Fisher information. The formulation of the optimal time t is obtained and the complete algorithm for parameter estimation is presented. We further explore how the lower bound of the estimation deviation depends on the a priori information of the model. Supported by the National Natural Science Foundation of China under Grant Nos. 61273202, 61673389, and 61134008

Quantum approximate optimization algorithm for MaxCut: A fermionic view

NASA Astrophysics Data System (ADS)

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.

Semiclassical modelling of finite-pulse effects on non-adiabatic photodynamics via initial condition filtering: The predissociation of NaI as a test case

DOE Office of Scientific and Technical Information (OSTI.GOV)

Martínez-Mesa, Aliezer; Institut für Chemie, Universität Potsdam, Karl-Liebknecht-Strasse 24-25, D-14476 Potsdam-Golm; Saalfrank, Peter

2015-05-21

Femtosecond-laser pulse driven non-adiabatic spectroscopy and dynamics in molecular and condensed phase systems continue to be a challenge for theoretical modelling. One of the main obstacles is the “curse of dimensionality” encountered in non-adiabatic, exact wavepacket propagation. A possible route towards treating complex molecular systems is via semiclassical surface-hopping schemes, in particular if they account not only for non-adiabatic post-excitation dynamics but also for the initial optical excitation. One such approach, based on initial condition filtering, will be put forward in what follows. As a simple test case which can be compared with exact wavepacket dynamics, we investigate the influencemore » of the different parameters determining the shape of a laser pulse (e.g., its finite width and a possible chirp) on the predissociation dynamics of a NaI molecule, upon photoexcitation of the A(0{sup +}) state. The finite-pulse effects are mapped into the initial conditions for semiclassical surface-hopping simulations. The simulated surface-hopping diabatic populations are in qualitative agreement with the quantum mechanical results, especially concerning the subpicosend photoinduced dynamics, the main deviations being the relative delay of the non-adiabatic transitions in the semiclassical picture. Likewise, these differences in the time-dependent electronic populations calculated via the semiclassical and the quantum methods are found to have a mild influence on the overall probability density distribution. As a result, the branching ratios between the bound and the dissociative reaction channels and the time-evolution of the molecular wavepacket predicted by the semiclassical method agree with those computed using quantum wavepacket propagation. Implications for more challenging molecular systems are given.« less

Shortcuts to adiabatic passage for the generation of a maximal Bell state and W state in an atom–cavity system

NASA Astrophysics Data System (ADS)

Lu, Mei; Chen, Qing-Qin

2018-05-01

We propose an efficient scheme to generate the maximal entangle states in an atom–cavity system between two three-level atoms in cavity quantum electronic dynamics system based on shortcuts to adiabatic passage. In the accelerate scheme, there is no need to design a time-varying coupling coefficient for the cavity. We only need to tactfully design time-dependent lasers to drive the system into the desired entangled states. Controlling the detuning between the cavity mode and lasers, we deduce a determinate analysis formula for this quantum information processing. The lasers do not need to distinguish which atom is to be affected, therefore the implementation of the experiment is simpler. The method is also generalized to generate a W state. Moreover, the accelerated program can be extended to a multi-body system and an analytical solution in a higher-dimensional system can be achieved. The influence of decoherence and variations of the parameters are discussed by numerical simulation. The results show that the maximally entangled states can be quickly prepared in a short time with high fidelity, and which are robust against both parameter fluctuations and dissipation. Our study enriches the physics and applications of multi-particle quantum entanglement preparation via shortcuts to adiabatic passage in quantum electronic dynamics.

Adiabatic and nonadiabatic perturbation theory for coherence vector description of neutrino oscillations

NASA Astrophysics Data System (ADS)

Hollenberg, Sebastian; Päs, Heinrich

2012-01-01

The standard wave function approach for the treatment of neutrino oscillations fails in situations where quantum ensembles at a finite temperature with or without an interacting background plasma are encountered. As a first step to treat such phenomena in a novel way, we propose a unified approach to both adiabatic and nonadiabatic two-flavor oscillations in neutrino ensembles with finite temperature and generic (e.g., matter) potentials. Neglecting effects of ensemble decoherence for now, we study the evolution of a neutrino ensemble governed by the associated quantum kinetic equations, which apply to systems with finite temperature. The quantum kinetic equations are solved formally using the Magnus expansion and it is shown that a convenient choice of the quantum mechanical picture (e.g., the interaction picture) reveals suitable parameters to characterize the physics of the underlying system (e.g., an effective oscillation length). It is understood that this method also provides a promising starting point for the treatment of the more general case in which decoherence is taken into account.

Quantum algorithm for energy matching in hard optimization problems

NASA Astrophysics Data System (ADS)

Baldwin, C. L.; Laumann, C. R.

2018-06-01

We consider the ability of local quantum dynamics to solve the "energy-matching" problem: given an instance of a classical optimization problem and a low-energy state, find another macroscopically distinct low-energy state. Energy matching is difficult in rugged optimization landscapes, as the given state provides little information about the distant topography. Here, we show that the introduction of quantum dynamics can provide a speedup over classical algorithms in a large class of hard optimization problems. Tunneling allows the system to explore the optimization landscape while approximately conserving the classical energy, even in the presence of large barriers. Specifically, we study energy matching in the random p -spin model of spin-glass theory. Using perturbation theory and exact diagonalization, we show that introducing a transverse field leads to three sharp dynamical phases, only one of which solves the matching problem: (1) a small-field "trapped" phase, in which tunneling is too weak for the system to escape the vicinity of the initial state; (2) a large-field "excited" phase, in which the field excites the system into high-energy states, effectively forgetting the initial energy; and (3) the intermediate "tunneling" phase, in which the system succeeds at energy matching. The rate at which distant states are found in the tunneling phase, although exponentially slow in system size, is exponentially faster than classical search algorithms.

Underwater sonar image detection: A combination of non-local spatial information and quantum-inspired shuffled frog leaping algorithm.

PubMed

Wang, Xingmei; Liu, Shu; Liu, Zhipeng

2017-01-01

This paper proposes a combination of non-local spatial information and quantum-inspired shuffled frog leaping algorithm to detect underwater objects in sonar images. Specifically, for the first time, the problem of inappropriate filtering degree parameter which commonly occurs in non-local spatial information and seriously affects the denoising performance in sonar images, was solved with the method utilizing a novel filtering degree parameter. Then, a quantum-inspired shuffled frog leaping algorithm based on new search mechanism (QSFLA-NSM) is proposed to precisely and quickly detect sonar images. Each frog individual is directly encoded by real numbers, which can greatly simplify the evolution process of the quantum-inspired shuffled frog leaping algorithm (QSFLA). Meanwhile, a fitness function combining intra-class difference with inter-class difference is adopted to evaluate frog positions more accurately. On this basis, recurring to an analysis of the quantum-behaved particle swarm optimization (QPSO) and the shuffled frog leaping algorithm (SFLA), a new search mechanism is developed to improve the searching ability and detection accuracy. At the same time, the time complexity is further reduced. Finally, the results of comparative experiments using the original sonar images, the UCI data sets and the benchmark functions demonstrate the effectiveness and adaptability of the proposed method.

Underwater sonar image detection: A combination of non-local spatial information and quantum-inspired shuffled frog leaping algorithm

PubMed Central

Liu, Zhipeng

2017-01-01

This paper proposes a combination of non-local spatial information and quantum-inspired shuffled frog leaping algorithm to detect underwater objects in sonar images. Specifically, for the first time, the problem of inappropriate filtering degree parameter which commonly occurs in non-local spatial information and seriously affects the denoising performance in sonar images, was solved with the method utilizing a novel filtering degree parameter. Then, a quantum-inspired shuffled frog leaping algorithm based on new search mechanism (QSFLA-NSM) is proposed to precisely and quickly detect sonar images. Each frog individual is directly encoded by real numbers, which can greatly simplify the evolution process of the quantum-inspired shuffled frog leaping algorithm (QSFLA). Meanwhile, a fitness function combining intra-class difference with inter-class difference is adopted to evaluate frog positions more accurately. On this basis, recurring to an analysis of the quantum-behaved particle swarm optimization (QPSO) and the shuffled frog leaping algorithm (SFLA), a new search mechanism is developed to improve the searching ability and detection accuracy. At the same time, the time complexity is further reduced. Finally, the results of comparative experiments using the original sonar images, the UCI data sets and the benchmark functions demonstrate the effectiveness and adaptability of the proposed method. PMID:28542266

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

PubMed

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.

Self-similar expansion of adiabatic electronegative dusty plasma

NASA Astrophysics Data System (ADS)

Shahmansouri, M.; Bemooni, A.; Mamun, A. A.

2017-12-01

The self-similar expansion of an adiabatic electronegative dusty plasma (consisting of inertialess adiabatic electrons, inertialess adiabatic ions and inertial adiabatic negatively charged dust fluids) is theoretically investigated by employing the self-similar approach. It is found that the effects of the plasma adiabaticity (represented by the adiabatic index ) and dusty plasma parameters (determined by dust temperature and initial dust population) significantly modify the nature of the plasma expansion. The implications of our results are expected to play an important role in understanding the physics of the expansion of space and laboratory electronegative dusty plasmas.

Holonomic quantum computation in the presence of decoherence.

PubMed

Fuentes-Guridi, I; Girelli, F; Livine, E

2005-01-21

We present a scheme to study non-Abelian adiabatic holonomies for open Markovian systems. As an application of our framework, we analyze the robustness of holonomic quantum computation against decoherence. We pinpoint the sources of error that must be corrected to achieve a geometric implementation of quantum computation completely resilient to Markovian decoherence.

Non-Abelian holonomies, charge pumping, and quantum computation with Josephson junctions.

PubMed

Faoro, Lara; Siewert, Jens; Fazio, Rosario

2003-01-17

Non-Abelian holonomies can be generated and detected in certain superconducting nanocircuits. Here we consider an example where the non-Abelian operations are related to the adiabatic charge dynamics of the Josephson network. We demonstrate that such a device can be applied both for adiabatic charge pumping and as an implementation of a quantum computer.

Stimulated Raman adiabatic passage in physics, chemistry, and beyond

NASA Astrophysics Data System (ADS)

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

A harmonic adiabatic approximation to calculate highly excited vibrational levels of ``floppy molecules''

NASA Astrophysics Data System (ADS)

Lauvergnat, David; Nauts, André; Justum, Yves; Chapuisat, Xavier

2001-04-01

The harmonic adiabatic approximation (HADA), an efficient and accurate quantum method to calculate highly excited vibrational levels of molecular systems, is presented. It is well-suited to applications to "floppy molecules" with a rather large number of atoms (N>3). A clever choice of internal coordinates naturally suggests their separation into active, slow, or large amplitude coordinates q', and inactive, fast, or small amplitude coordinates q″, which leads to an adiabatic (or Born-Oppenheimer-type) approximation (ADA), i.e., the total wave function is expressed as a product of active and inactive total wave functions. However, within the framework of the ADA, potential energy data concerning the inactive coordinates q″ are required. To reduce this need, a minimum energy domain (MED) is defined by minimizing the potential energy surface (PES) for each value of the active variables q', and a quadratic or harmonic expansion of the PES, based on the MED, is used (MED harmonic potential). In other words, the overall picture is that of a harmonic valley about the MED. In the case of only one active variable, we have a minimum energy path (MEP) and a MEP harmonic potential. The combination of the MED harmonic potential and the adiabatic approximation (harmonic adiabatic approximation: HADA) greatly reduces the size of the numerical computations, so that rather large molecules can be studied. In the present article however, the HADA is applied to our benchmark molecule HCN/CNH, to test the validity of the method. Thus, the HADA vibrational energy levels are compared and are in excellent agreement with the ADA calculations (adiabatic approximation with the full PES) of Light and Bačić [J. Chem. Phys. 87, 4008 (1987)]. Furthermore, the exact harmonic results (exact calculations without the adiabatic approximation but with the MEP harmonic potential) are compared to the exact calculations (without any sort of approximation). In addition, we compare the densities of

Fast generations of tree-type three-dimensional entanglement via Lewis-Riesenfeld invariants and transitionless quantum driving

PubMed Central

Wu, Jin-Lei; Ji, Xin; Zhang, Shou

2016-01-01

Recently, a novel three-dimensional entangled state called tree-type entanglement, which is likely to have applications for improving quantum communication security, was prepared via adiabatic passage by Song et al. Here we propose two schemes for fast generating tree-type three-dimensional entanglement among three spatially separated atoms via shortcuts to adiabatic passage. With the help of quantum Zeno dynamics, two kinds of different but equivalent methods, Lewis-Riesenfeld invariants and transitionless quantum driving, are applied to construct shortcuts to adiabatic passage. The comparisons between the two methods are discussed. The strict numerical simulations show that the tree-type three-dimensional entangled states can be fast prepared with quite high fidelities and the two schemes are both robust against the variations in the parameters, atomic spontaneous emissions and the cavity-fiber photon leakages. PMID:27667583

Microscopic Description of Spontaneous Emission in Stark Chirped Rapid Adiabatic Passages

NASA Astrophysics Data System (ADS)

Shi, Xuan; Yuan, Hao; Zhao, Hong-Quan

2018-01-01

A microscopic approach describing the effect of spontaneous emission in the stark-chirped rapid adiabatic passages (SCRAPs) for quantum computation is presented. Apart from the phenomenological model, this microscopic one can investigate the dependence of the population dynamics both on the temperature of the environment and the decay rate γ. With flux-biased Josephson qubits as a specifical example, we study the efficiency of the SCRAP for realizing the basic Pauli-X and iSWAP gates. Our results show clearly that the behavior of the population transfer described by the microscopic model is similar with the phenomenological one at zero temperature. In the limit of very high temperature, the population probabilities of the qubit states exhibit strong stability properties. High efficiency for the quantum gate manipulations in SCRAPs is available against the weak decay rate γ ≪ 1 at low temperature.

A Controlled-Phase Gate via Adiabatic Rydberg Dressing of Neutral Atoms

NASA Astrophysics Data System (ADS)

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.

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

PubMed

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.

Quantum Statistical Mechanics on a Quantum Computer

NASA Astrophysics Data System (ADS)

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

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.

Coherent states, quantum gravity, and the Born-Oppenheimer approximation. I. General considerations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Stottmeister, Alexander, E-mail: alexander.stottmeister@gravity.fau.de; Thiemann, Thomas, E-mail: thomas.thiemann@gravity.fau.de

2016-06-15

This article, as the first of three, aims at establishing the (time-dependent) Born-Oppenheimer approximation, in the sense of space adiabatic perturbation theory, for quantum systems constructed by techniques of the loop quantum gravity framework, especially the canonical formulation of the latter. The analysis presented here fits into a rather general framework and offers a solution to the problem of applying the usual Born-Oppenheimer ansatz for molecular (or structurally analogous) systems to more general quantum systems (e.g., spin-orbit models) by means of space adiabatic perturbation theory. The proposed solution is applied to a simple, finite dimensional model of interacting spin systems,more » which serves as a non-trivial, minimal model of the aforesaid problem. Furthermore, it is explained how the content of this article and its companion affect the possible extraction of quantum field theory on curved spacetime from loop quantum gravity (including matter fields).« less

Robust Multiple-Range Coherent Quantum State Transfer

PubMed Central

Chen, Bing; Peng, Yan-Dong; Li, Yong; Qian, Xiao-Feng

2016-01-01

We propose a multiple-range quantum communication channel to realize coherent two-way quantum state transport with high fidelity. In our scheme, an information carrier (a qubit) and its remote partner are both adiabatically coupled to the same data bus, i.e., an N-site tight-binding chain that has a single defect at the center. At the weak interaction regime, our system is effectively equivalent to a three level system of which a coherent superposition of the two carrier states constitutes a dark state. The adiabatic coupling allows a well controllable information exchange timing via the dark state between the two carriers. Numerical results show that our scheme is robust and efficient under practically inevitable perturbative defects of the data bus as well as environmental dephasing noise. PMID:27364891

Robust Multiple-Range Coherent Quantum State Transfer.

PubMed

Chen, Bing; Peng, Yan-Dong; Li, Yong; Qian, Xiao-Feng

2016-07-01

We propose a multiple-range quantum communication channel to realize coherent two-way quantum state transport with high fidelity. In our scheme, an information carrier (a qubit) and its remote partner are both adiabatically coupled to the same data bus, i.e., an N-site tight-binding chain that has a single defect at the center. At the weak interaction regime, our system is effectively equivalent to a three level system of which a coherent superposition of the two carrier states constitutes a dark state. The adiabatic coupling allows a well controllable information exchange timing via the dark state between the two carriers. Numerical results show that our scheme is robust and efficient under practically inevitable perturbative defects of the data bus as well as environmental dephasing noise.

Models of optical quantum computing

NASA Astrophysics Data System (ADS)

Krovi, Hari

2017-03-01

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.

Lorentz quantum mechanics

NASA Astrophysics Data System (ADS)

Zhang, Qi; Wu, Biao

2018-01-01

We present a theoretical framework for the dynamics of bosonic Bogoliubov quasiparticles. We call it Lorentz quantum mechanics because the dynamics is a continuous complex Lorentz transformation in complex Minkowski space. In contrast, in usual quantum mechanics, the dynamics is the unitary transformation in Hilbert space. In our Lorentz quantum mechanics, three types of state exist: space-like, light-like and time-like. Fundamental aspects are explored in parallel to the usual quantum mechanics, such as a matrix form of a Lorentz transformation, and the construction of Pauli-like matrices for spinors. We also investigate the adiabatic evolution in these mechanics, as well as the associated Berry curvature and Chern number. Three typical physical systems, where bosonic Bogoliubov quasi-particles and their Lorentz quantum dynamics can arise, are presented. They are a one-dimensional fermion gas, Bose-Einstein condensate (or superfluid), and one-dimensional antiferromagnet.

Single-server blind quantum computation with quantum circuit model

NASA Astrophysics Data System (ADS)

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.

Piecewise adiabatic following in non-Hermitian cycling