Adiabatic Quantum Transistors

  title={Adiabatic Quantum Transistors},
  author={Dave Bacon and Steven T. Flammia and Gregory Crosswhite},
  journal={Physical Review X},
We describe a many-body quantum system that can be made to quantum compute by the adiabatic application of a large applied field to the system. Prior to the application of the field, quantum information is localized on one boundary of the device, and after the application of the field, this information propagates to the other side of the device, with a quantum circuit applied to the information. The applied circuit depends on the many-body Hamiltonian of the material, and the computation takes… 

Symmetry-protected adiabatic quantum transistors

Adiabatic quantum transistors (AQT) allow quantum logic gates to be performed by applying a large field to a quantum many-body system prepared in its ground state, without the need for local control.

Quantum computation and communication in strongly interacting systems

A novel, low-control way of performing a two-qubit gate on qubits encoded in a decoherence-free subspace is found, making use of many-body interactions that may already be present, and a very different model from the normal circuit model is focus, combining ideas from measurement-based quantum computation and holonomic quantum computation, showing that all MBQC patterns with a property called gflow can be converted into a holonomic computation.

Adiabatic and Hamiltonian computing on a 2D lattice with simple two-qubit interactions

We show how to perform universal Hamiltonian and adiabatic computing using a time-independent Hamiltonian on a 2D grid describing a system of hopping particles which string together and interact to

Voltage-controlled Hubbard spin transistor

Transistors are key elements for enabling computational hardware in both classical and quantum domains. Here we propose a voltage-gated spin transistor using itinerant electrons in the Hubbard model

Adiabatic topological quantum computing

This work develops 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 computation size and introduces only simple local Hamiltonian interactions.

Automatically Translating Quantum Programs from a Subset of Common Gates to an Adiabatic Representation

Adiabatic computing with two degrees of freedom of 2-local Hamiltonians has been theoretically shown to be equivalent to the gate model of universal quantum computing. But today’s quantum annealers,

Quantum thermodynamics in adiabatic open systems and its trapped-ion experimental realization

Quantum thermodynamics aims at investigating both the emergence and the limits of the laws of thermodynamics from a quantum mechanical microscopic approach. In this scenario, thermodynamic processes

Adiabatic graph-state quantum computation

Measurement-based quantum computation (MBQC) and holonomic quantum computation (HQC) are two very different computational methods. The computation in MBQC is driven by adaptive measurements executed

Combining Hard and Soft Constraints in Quantum Constraint-Satisfaction Systems

This work presents a generalization of NchooseK, a constraint satisfaction system designed to target both quantum circuit devices and quantum annealing devices, and shows how support for soft constraints can be added to the model and implementation, broadening the classes of problems that can be expressed elegantly in NCHOoseK without sacrificing portability across different quantum devices.



Quantum Simulators

An overview of how quantum simulators may become a reality in the near future as the required technologies are now within reach is presented.

Quantum computation on the edge of a symmetry-protected topological order.

This work shows that the logical information of a universal quantum computer can be written and processed perfectly on the edge state of the system, supported by the persistent entanglement from the bulk even when the ground state and its evolution cannot be exactly analyzed.

Identifying phases of quantum many-body systems that are universal for quantum computation.

A simple spin-lattice system based on the cluster-state model is investigated, and it is demonstrated that it possesses a quantum phase transition between a disordered phase and an ordered "cluster phase" in which it is possible to perform a universal set of quantum gates.

Simple nearest-neighbor two-body Hamiltonian system for which the ground state is a universal resource for quantum computation

We present a simple quantum many-body system - a two-dimensional lattice of qubits with a Hamiltonian composed of nearest-neighbor two-body interactions - such that the ground state is a universal

Adiabatic quantum computation is equivalent to standard quantum computation

The model of adiabatic quantum computation has recently attracted attention in the physics and computer science communities, but its exact computational power has been unknown, so this result implies that the adiABatic computation model and the standard quantum circuit model are polynomially equivalent.

The complexity of quantum spin systems on a two-dimensional square lattice

It is obtained that quantum adiabatic computation using 2-local interactions restricted to a 2-D square lattice is equivalent to the circuitmodel of quantum computation.

A single quantum cannot be cloned

If a photon of definite polarization encounters an excited atom, there is typically some nonvanishing probability that the atom will emit a second photon by stimulated emission. Such a photon is

Measurement-based quantum computer in the gapped ground state of a two-body Hamiltonian.

Every logical qubit is encoded in the gapped degenerate ground subspace of a spin-1 chain with nearest-neighbor two-body interactions, so that it equips built-in robustness against noise in a ground-code measurement-based quantum computer.

Quantum computational renormalization in the Haldane phase.

It is shown how single-spin measurements on the ground state of an interacting spin lattice can mimic renormalization group transformations and remove the short-ranged variations of the state that can reduce the fidelity of a computation.

Adiabatic gate teleportation.

A simple universal primitive, adiabatic gate teleportation is introduced, 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.