373 research outputs found

    Quantum walks on Cayley graphs

    Full text link
    We address the problem of the construction of quantum walks on Cayley graphs. Our main motivation is the relationship between quantum algorithms and quantum walks. In particular, we discuss the choice of the dimension of the local Hilbert space and consider various classes of graphs on which the structure of quantum walks may differ. We completely characterise quantum walks on free groups and present partial results on more general cases. Some examples are given, including a family of quantum walks on the hypercube involving a Clifford Algebra.Comment: J. Phys. A (accepted for publication

    Combined Error Correction Techniques for Quantum Computing Architectures

    Get PDF
    Proposals for quantum computing devices are many and varied. They each have unique noise processes that make none of them fully reliable at this time. There are several error correction/avoidance techniques which are valuable for reducing or eliminating errors, but not one, alone, will serve as a panacea. One must therefore take advantage of the strength of each of these techniques so that we may extend the coherence times of the quantum systems and create more reliable computing devices. To this end we give a general strategy for using dynamical decoupling operations on encoded subspaces. These encodings may be of any form; of particular importance are decoherence-free subspaces and quantum error correction codes. We then give means for empirically determining an appropriate set of dynamical decoupling operations for a given experiment. Using these techniques, we then propose a comprehensive encoding solution to many of the problems of quantum computing proposals which use exchange-type interactions. This uses a decoherence-free subspace and an efficient set of dynamical decoupling operations. It also addresses the problems of controllability in solid state quantum dot devices.Comment: Contribution to Proceedings of the 2002 Physics of Quantum Electronics Conference", to be published in J. Mod. Optics. This paper provides a summary and review of quant-ph/0205156 and quant-ph/0112054, and some new result

    Bounds for mixing time of quantum walks on finite graphs

    Full text link
    Several inequalities are proved for the mixing time of discrete-time quantum walks on finite graphs. The mixing time is defined differently than in Aharonov, Ambainis, Kempe and Vazirani (2001) and it is found that for particular examples of walks on a cycle, a hypercube and a complete graph, quantum walks provide no speed-up in mixing over the classical counterparts. In addition, non-unitary quantum walks (i.e., walks with decoherence) are considered and a criterion for their convergence to the unique stationary distribution is derived.Comment: This is the journal version (except formatting); it is a significant revision of the previous version, in particular, it contains a new result about the convergence of quantum walks with decoherence; 16 page

    Decoherence and Quantum Walks: anomalous diffusion and ballistic tails

    Get PDF
    The common perception is that strong coupling to the environment will always render the evolution of the system density matrix quasi-classical (in fact, diffusive) in the long time limit. We present here a counter-example, in which a particle makes quantum transitions between the sites of a d-dimensional hypercubic lattice whilst strongly coupled to a bath of two-level systems which 'record' the transitions. The long-time evolution of an initial wave packet is found to be most unusual: the mean square displacement of the particle density matrix shows long-range ballitic behaviour, but simultaneously a kind of weakly-localised behaviour near the origin. This result may have important implications for the design of quantum computing algorithms, since it describes a class of quantum walks.Comment: 4 pages, 1 figur

    Influence of RANEY nickel on the formation of intermediates in the degradation of lignin

    Get PDF
    Lignin forms an important part of lignocellulosic biomass and is an abundantly available residue. It is a potential renewable source of phenol. Liquefaction of enzymatic hydrolysis lignin as well as catalytical hydrodeoxygenation of the main intermediates in the degradation of lignin, that is, catechol and guaiacol, was studied. The cleavage of the ether bonds, which are abundant in the molecular structure of lignin, can be realised in near-critical water (573 to 673 K, 20 to 30MPa). Hydrothermal treatment in this context provides high selectivity in respect to hydroxybenzenes, especially catechol. RANEY Nickel was found to be an adequate catalyst for hydrodeoxygenation. Although it does not influence the cleavage of ether bonds, RANEY Nickel favours the production of phenol from both lignin and catechol. The main product from hydrodeoxygenation of guaiacol with RANEY Nickel was cyclohexanol. Reaction mechanism and kinetics of the degradation of guaiacol were explored

    Explicit lower and upper bounds on the entangled value of multiplayer XOR games

    Get PDF
    XOR games are the simplest model in which the nonlocal properties of entanglement manifest themselves. When there are two players, it is well known that the bias --- the maximum advantage over random play --- of entangled players can be at most a constant times greater than that of classical players. Recently, P\'{e}rez-Garc\'{i}a et al. [Comm. Math. Phys. 279 (2), 2008] showed that no such bound holds when there are three or more players: the advantage of entangled players over classical players can become unbounded, and scale with the number of questions in the game. Their proof relies on non-trivial results from operator space theory, and gives a non-explicit existence proof, leading to a game with a very large number of questions and only a loose control over the local dimension of the players' shared entanglement. We give a new, simple and explicit (though still probabilistic) construction of a family of three-player XOR games which achieve a large quantum-classical gap (QC-gap). This QC-gap is exponentially larger than the one given by P\'{e}rez-Garc\'{i}a et. al. in terms of the size of the game, achieving a QC-gap of order N\sqrt{N} with N2N^2 questions per player. In terms of the dimension of the entangled state required, we achieve the same (optimal) QC-gap of N\sqrt{N} for a state of local dimension NN per player. Moreover, the optimal entangled strategy is very simple, involving observables defined by tensor products of the Pauli matrices. Additionally, we give the first upper bound on the maximal QC-gap in terms of the number of questions per player, showing that our construction is only quadratically off in that respect. Our results rely on probabilistic estimates on the norm of random matrices and higher-order tensors which may be of independent interest.Comment: Major improvements in presentation; results identica

    Overview of Quantum Error Prevention and Leakage Elimination

    Full text link
    Quantum error prevention strategies will be required to produce a scalable quantum computing device and are of central importance in this regard. Progress in this area has been quite rapid in the past few years. In order to provide an overview of the achievements in this area, we discuss the three major classes of error prevention strategies, the abilities of these methods and the shortcomings. We then discuss the combinations of these strategies which have recently been proposed in the literature. Finally we present recent results in reducing errors on encoded subspaces using decoupling controls. We show how to generally remove mixing of an encoded subspace with external states (termed leakage errors) using decoupling controls. Such controls are known as ``leakage elimination operations'' or ``LEOs.''Comment: 8 pages, no figures, submitted to the proceedings of the Physics of Quantum Electronics, 200

    Controlling discrete quantum walks: coins and intitial states

    Full text link
    In discrete time, coined quantum walks, the coin degrees of freedom offer the potential for a wider range of controls over the evolution of the walk than are available in the continuous time quantum walk. This paper explores some of the possibilities on regular graphs, and also reports periodic behaviour on small cyclic graphs.Comment: 10 (+epsilon) pages, 10 embedded eps figures, typos corrected, references added and updated, corresponds to published version (except figs 5-9 optimised for b&w printing here

    The power of quantum systems on a line

    Full text link
    We study the computational strength of quantum particles (each of finite dimensionality) arranged on a line. First, we prove that it is possible to perform universal adiabatic quantum computation using a one-dimensional quantum system (with 9 states per particle). This might have practical implications for experimentalists interested in constructing an adiabatic quantum computer. Building on the same construction, but with some additional technical effort and 12 states per particle, we show that the problem of approximating the ground state energy of a system composed of a line of quantum particles is QMA-complete; QMA is a quantum analogue of NP. This is in striking contrast to the fact that the analogous classical problem, namely, one-dimensional MAX-2-SAT with nearest neighbor constraints, is in P. The proof of the QMA-completeness result requires an additional idea beyond the usual techniques in the area: Not all illegal configurations can be ruled out by local checks, so instead we rule out such illegal configurations because they would, in the future, evolve into a state which can be seen locally to be illegal. Our construction implies (assuming the quantum Church-Turing thesis and that quantum computers cannot efficiently solve QMA-complete problems) that there are one-dimensional systems which take an exponential time to relax to their ground states at any temperature, making them candidates for being one-dimensional spin glasses.Comment: 21 pages. v2 has numerous corrections and clarifications, and most importantly a new author, merged from arXiv:0705.4067. v3 is the published version, with additional clarifications, publisher's version available at http://www.springerlink.co

    Almost uniform sampling via quantum walks

    Get PDF
    Many classical randomized algorithms (e.g., approximation algorithms for #P-complete problems) utilize the following random walk algorithm for {\em almost uniform sampling} from a state space SS of cardinality NN: run a symmetric ergodic Markov chain PP on SS for long enough to obtain a random state from within ϵ\epsilon total variation distance of the uniform distribution over SS. The running time of this algorithm, the so-called {\em mixing time} of PP, is O(δ1(logN+logϵ1))O(\delta^{-1} (\log N + \log \epsilon^{-1})), where δ\delta is the spectral gap of PP. We present a natural quantum version of this algorithm based on repeated measurements of the {\em quantum walk} Ut=eiPtU_t = e^{-iPt}. We show that it samples almost uniformly from SS with logarithmic dependence on ϵ1\epsilon^{-1} just as the classical walk PP does; previously, no such quantum walk algorithm was known. We then outline a framework for analyzing its running time and formulate two plausible conjectures which together would imply that it runs in time O(δ1/2logNlogϵ1)O(\delta^{-1/2} \log N \log \epsilon^{-1}) when PP is the standard transition matrix of a constant-degree graph. We prove each conjecture for a subclass of Cayley graphs.Comment: 13 pages; v2 added NSF grant info; v3 incorporated feedbac
    corecore