Efficiency of Ground State Quantum Computer

Abstract

The energy gap is calculated for the ground state quantum computer circuit, which was recently proposed by Mizel et.al. When implementing a quantum algorithm by Hamiltonians containing only pairwise interaction, the inverse of energy gap $1/\Delta$ is proportional to $N^{4k}$, where $N$ is the number of bits involved in the problem, and $N^k$ is the number of control operations performed in a standard quantum paradigm. Besides suppressing decoherence due to the energy gap, in polynomial time ground state quantum computer can finish the quantum algorithms that are supposed to be implemented by standard quantum computer in polynomial time.

5 pages, 2 figures

References in corpus (1)

• Mimicking Time Evolution within a Quantum Ground State: Ground-State Quantum Computation, Cloning, and Teleportation

Cited by in corpus (4)

• Adiabatic Quantum Computing
• Simple proof of equivalence between adiabatic quantum computation and the circuit model
• Solving Satisfiability Problems by the Ground-State Quantum Computer
• Quantum Algorithm to Solve Satisfiability Problems