Universal two-body-Hamiltonian quantum computing

Daniel Nagaj
Phys. Rev. A 85, 032330 – Published 27 March 2012

Abstract

We present a Hamiltonian quantum-computation scheme universal for quantum computation. Our Hamiltonian is a sum of a polynomial number (in the number of gates L in the quantum circuit) of constant-norm, time-independent, two-body interaction terms. Furthermore, each qubit in the system interacts only with a constant number of other qubits in a three-layer, geometrically local layout. The computer runs in three steps—it starts in a simple initial product state, evolves according to a time-independent Hamiltonian for time of order L2 (up to logarithmic factors), and finishes with a two-qubit measurement. Our model improves previous universal two-local-Hamiltonian constructions, as it avoids using perturbation gadgets and large energy-penalty terms in the Hamiltonian, which would result in a large required run time.

  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Received 22 November 2011

DOI:https://doi.org/10.1103/PhysRevA.85.032330

©2012 American Physical Society

Authors & Affiliations

Daniel Nagaj*

  • Research Center for Quantum Information, Institute of Physics, Slovak Academy of Sciences, Dúbravská cesta 9, 84215 Bratislava, Slovakia

  • *daniel.nagaj@savba.sk

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 85, Iss. 3 — March 2012

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review A

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×