Search results for "Quantum Computation"
showing 10 items of 43 documents
Simulating long-distance entanglement in quantum spin chains by superconducting flux qubits
2014
We investigate the performance of superconducting flux qubits for the adiabatic quantum simulation of long distance entanglement (LDE), namely a finite ground-state entanglement between the end spins of a quantum spin chain with open boundary conditions. As such, LDE can be considered an elementary precursor of edge modes and topological order. We discuss two possible implementations which simulate open chains with uniform bulk and weak end bonds, either with Ising or with XX nearest-neighbor interactions. In both cases we discuss a suitable protocol for the adiabatic preparation of the ground state in the physical regimes featuring LDE. In the first case the adiabatic manipulation and the …
Resetting of a planar superconducting quantum memory
2009
We consider and analyze a scheme for the reset of a M × N planar array of inductively coupled Josephson flux qubits. We prove that it is possible to minimize the resetting time of an arbitrary chosen row of qubits by properly switching on and off the coupling between pairs of qubits belonging to the same column. In addition, the analysis of the time evolution of the array allows us to single out the class of generalized W states which can be successfully reset.
Efficient adiabatic tracking of driven quantum nonlinear systems
2013
We derive a technique of robust and efficient adiabatic passage for a driven nonlinear quantum system, describing the transfer to a molecular Bose-Einstein condensate from an atomic one by external fields. The pulse ingredients are obtained by tracking the dynamics derived from a Hamiltonian formulation, in the adiabatic limit. This leads to a nonsymmetric and nonmonotonic chirp. The efficiency of the method is demonstrated in terms of classical phase space, more specifically with the underlying fixed points and separatrices. We also prove the crucial property that this nonlinear system does not have any solution leading exactly to a complete transfer. It can only be reached asymptotically …
Simulating open quantum systems with trapped ions
2005
This paper focuses on the possibility of simulating the open system dynamics of a paradigmatic model, namely the damped harmonic oscillator, with single trapped ions. The key idea consists in using a controllable physical system, i.e. a single trapped ion interacting with an engineered reservoir, to simulate the dynamics of other open systems usually difficult to study. The exact dynamics of the damped harmonic oscillator under very general conditions is firstly derived. Some peculiar characteristic of the system’s dynamics are then presented. Finally a way to implement with trapped ion the specific quantum simulator of interest is discussed.
Nonadiabatic quantum search algorithms
2007
7 pages, 4 figures.-- PACS nrs.: 03.67.Lx, 05.45.Mt, 72.15.Rn.-- ISI Article Identifier: 000251326400049.-- ArXiv pre-print available at: http://arxiv.org/abs/0706.1139
Spectrum of the non-abelian phase in Kitaev's honeycomb lattice model
2008
The spectral properties of Kitaev's honeycomb lattice model are investigated both analytically and numerically with the focus on the non-abelian phase of the model. After summarizing the fermionization technique which maps spins into free Majorana fermions, we evaluate the spectrum of sparse vortex configurations and derive the interaction between two vortices as a function of their separation. We consider the effect vortices can have on the fermionic spectrum as well as on the phase transition between the abelian and non-abelian phases. We explicitly demonstrate the $2^n$-fold ground state degeneracy in the presence of $2n$ well separated vortices and the lifting of the degeneracy due to t…
Simulation of many-qubit quantum computation with matrix product states
2006
Matrix product states provide a natural entanglement basis to represent a quantum register and operate quantum gates on it. This scheme can be materialized to simulate a quantum adiabatic algorithm solving hard instances of a NP-Complete problem. Errors inherent to truncations of the exact action of interacting gates are controlled by the size of the matrices in the representation. The property of finding the right solution for an instance and the expected value of the energy are found to be remarkably robust against these errors. As a symbolic example, we simulate the algorithm solving a 100-qubit hard instance, that is, finding the correct product state out of ~ 10^30 possibilities. Accum…
Stimulated Raman adiabatic passage in an open quantum system: Master equation approach
2010
A master equation approach to the study of environmental effects in the adiabatic population transfer in three-state systems is presented. A systematic comparison with the non-Hermitian Hamiltonian approach [N. V. Vitanov and S. Stenholm, Phys. Rev. A {\bf 56}, 1463 (1997)] shows that in the weak coupling limit the two treatments lead to essentially the same results. Instead, in the strong damping limit the predictions are quite different: in particular the counterintuitive sequences in the STIRAP scheme turn out to be much more efficient than expected before. This point is explained in terms of quantum Zeno dynamics.
Quantum search by parallel eigenvalue adiabatic passage
2008
We propose a strategy to achieve the Grover search algorithm by adiabatic passage in a very efficient way. An adiabatic process can be characterized by the instantaneous eigenvalues of the pertaining Hamiltonian, some of which form a gap. The key to the efficiency is based on the use of parallel eigenvalues. This allows us to obtain non-adiabatic losses which are exponentially small, independently of the number of items in the database in which the search is performed.
Irreconcilable Difference Between Quantum Walks and Adiabatic Quantum Computing
2016
Continuous-time quantum walks and adiabatic quantum evolution are two general techniques for quantum computing, both of which are described by Hamiltonians that govern their evolutions by Schr\"odinger's equation. In the former, the Hamiltonian is fixed, while in the latter, the Hamiltonian varies with time. As a result, their formulations of Grover's algorithm evolve differently through Hilbert space. We show that this difference is fundamental; they cannot be made to evolve along each other's path without introducing structure more powerful than the standard oracle for unstructured search. For an adiabatic quantum evolution to evolve like the quantum walk search algorithm, it must interpo…