Ground State Quantum Computation

Abstract

We formulate a novel ground state quantum computation approach that requires no unitary evolution of qubits in time: the qubits are fixed in stationary states of the Hamiltonian. This formulation supplies a completely time-independent approach to realizing quantum computers. We give a concrete suggestion for a ground state quantum computer involving linked quantum dots.

4 pages, 2 figures

References in corpus (1)

• Coherent control of macroscopic quantum states in a single-Cooper-pair box

Cited by in corpus (20)

• Adiabatic Quantum Computing
• Simple proof of equivalence between adiabatic quantum computation and the circuit model
• Quantum annealing correction for random Ising problems
• Decoherence in adiabatic quantum computation
• Universal adiabatic quantum computation via the space-time circuit-to-Hamiltonian construction
• Critically damped quantum search
• Space-Time Circuit-to-Hamiltonian Construction and Its Applications
• Adiabatic and Hamiltonian computing on a 2D lattice with simple 2-qubit interactions
• Mimicking Time Evolution within a Quantum Ground State: Ground-State Quantum Computation, Cloning, and Teleportation
• The Stability of Quantum Concatenated Code Hamiltonians
• Decoherence induced deformation of the ground state in adiabatic quantum computation
• Hamiltonian quantum computing with superconducting qubits
• Proof of efficient, parallelized, universal adiabatic quantum computation
• Quantum Algorithm to Solve Satisfiability Problems
• Solving Satisfiability Problems by the Ground-State Quantum Computer
• The speed of Markovian relaxation towards the ground state
• Efficiency of Ground State Quantum Computer
• On fixed-gap adiabatic quantum computation
• Renormalization method for proving frustration-free local spin chains are gapped
• Experimental implementation of leakage elimination operators