• Rapid Communication

Schemes for parallel quantum computation without local control of qubits

S. C. Benjamin
Phys. Rev. A 61, 020301(R) – Published 18 January 2000
PDFExport Citation

Abstract

Typical quantum computing schemes require transformations (gates) to be targeted at specific elements (qubits). In many physical systems, direct targeting is difficult to achieve; an alternative is to encode local gates into globally applied transformations. Here we demonstrate the minimum physical requirements for such an approach: a one-dimensional array composed of two alternating “types” of two-state system. Each system need be sensitive only to the net state of its nearest neighbors, i.e. the number in state minus the number in . Additionally, we show that all such arrays can perform quite general parallel operations. A broad range of physical systems and interactions is suitable: we highlight two examples.

  • Received 29 March 1999

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

©2000 American Physical Society

Authors & Affiliations

S. C. Benjamin*

  • Center for Quantum Computation, Clarendon Laboratory, University of Oxford OXI 3PU, United Kingdom

  • *Electronic address: s.benjamin@physics.ox.ac.uk

References (Subscription Required)

Click to Expand
Issue

Vol. 61, Iss. 2 — February 2000

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
×