An Overview of Approaches to Modernize Quantum Annealing Using Local Searches

I describe how real quantum annealers may be used to perform local (in state space) searches around specified states, rather than the global searches traditionally implemented in the quantum annealing algorithm. The quantum annealing algorithm is an analogue of simulated annealing, a classical numerical technique which is now obsolete. Hence, I explore strategies to use an annealer in a way which takes advantage of modern classical optimization algorithms, and additionally should be less sensitive to problem mis-specification then the traditional quantum annealing algorithm.Comment: In Proceedings PC 2016, arXiv:1606.06513. An extended version of this contribution will appear on arXiv soon which will describe more detailed algorithms, comment more on robustness to problem mis-specification, comment on thermal sampling applications, and discuss applications on real device

Non-Markovian Equilibration Controlled by Symmetry Breaking

We study the effects of symmetry breaking on non-Markovian dynamics in various system-bath arrangements. It is shown that by breaking certain symmetries features signaling non-Markovian time evolution disappear within a finite time t_{g}. We demonstrate numerically that the scaling of t_{g} with the symmetry breaking strength is different for various types of symmetry. We provide a mathematical explanation for these differences related to the spectrum of the total system-bath Hamiltonian and provide arguments that the scaling properties of t_{g} should be universal.Comment: 12 pages, 9 figures, (incl. supp. mat) spectral arguments about universality moved to main text and expanded at request of referee, supp. mat expanded significantl

Local quenches in frustrated quantum spin chains: global vs. subsystem equilibration

We study the equilibration behavior following local quenches, using frustrated quantum spin chains as an example of interacting closed quantum systems. Specifically, we examine the statistics of the time series of the Loschmidt echo, the trace distance of the time-evolved local density matrix to its average state, and the local magnetization. Depending on the quench parameters, the equilibration statistics of these quantities show features of good or poor equilibration, indicated by Gaussian, exponential or bistable distribution functions. These universal functions provide valuable tools to characterize the various time-evolution responses and give insight into the plethora of equilibration phenomena in complex quantum systems.Comment: 8 pages, 9 figure

Graphical Structures for Design and Verification of Quantum Error Correction

We introduce a high-level graphical framework for designing and analysing quantum error correcting codes, centred on what we term the coherent parity check (CPC). The graphical formulation is based on the diagrammatic tools of the zx-calculus of quantum observables. The resulting framework leads to a construction for stabilizer codes that allows us to design and verify a broad range of quantum codes based on classical ones, and that gives a means of discovering large classes of codes using both analytical and numerical methods. We focus in particular on the smaller codes that will be the first used by near-term devices. We show how CSS codes form a subset of CPC codes and, more generally, how to compute stabilizers for a CPC code. As an explicit example of this framework, we give a method for turning almost any pair of classical [n,k,3] codes into a [[2n - k + 2, k, 3]] CPC code. Further, we give a simple technique for machine search which yields thousands of potential codes, and demonstrate its operation for distance 3 and 5 codes. Finally, we use the graphical tools to demonstrate how Clifford computation can be performed within CPC codes. As our framework gives a new tool for constructing small- to medium-sized codes with relatively high code rates, it provides a new source for codes that could be suitable for emerging devices, while its zx-calculus foundations enable natural integration of error correction with graphical compiler toolchains. It also provides a powerful framework for reasoning about all stabilizer quantum error correction codes of any size.Comment: Computer code associated with this paper may be found at https://doi.org/10.15128/r1bn999672

Pfaffian-like ground states for bosonic atoms and molecules in one-dimensional optical lattices

We study ground states and elementary excitations of a system of bosonic atoms and diatomic Feshbach molecules trapped in a one-dimensional optical lattice using exact diagonalization and variational Monte Carlo methods. We primarily study the case of an average filling of one boson per site. In agreement with bosonization theory, we show that the ground state of the system in the thermodynamic limit corresponds to the Pfaffian-like state when the system is tuned towards the superfluid-to-Mott insulator quantum phase transition. Our study clarifies the possibility of the creation of exotic Pfaffian-like states in realistic one-dimensional systems. We also present preliminary evidence that such states support non-Abelian anyonic excitations that have potential application for fault-tolerant topological quantum computation.Comment: 10 pages, 10 figures. Matching the version published Phys.Rev.

Using the J1-J2 Quantum Spin Chain as an Adiabatic Quantum Data Bus

This paper investigates numerically a phenomenon which can be used to transport a single q-bit down a J1-J2 Heisenberg spin chain using a quantum adiabatic process. The motivation for investigating such processes comes from the idea that this method of transport could potentially be used as a means of sending data to various parts of a quantum computer made of artificial spins, and that this method could take advantage of the easily prepared ground state at the so called Majumdar-Ghosh point. We examine several annealing protocols for this process and find similar result for all of them. The annealing process works well up to a critical frustration threshold.Comment: 14 pages, 13 figures (2 added), revisions made to add citations and additional discussion at request of referee