Skip to main content

NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.

Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.

U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Quantum-Computer Architecture Using Nonlocal Interactions

Published

Author(s)

G K. Brennen, D Song, Carl J. Williams

Abstract

Many protocols for quantum information processing use a control sequence or circuit of interactions between qubits and control fields wherein arbitrary qubits can be made to interact with one another. The primary problem with many ''physically scalable architectures is that the qubits are restricted to nearest neighbor interactions and quantum wires between distant qubits do not exist. Because of errors, nearest neighbor interactions often present difficulty with scalability. In this paper we describe a generalized quantum architecture that provides efficient nonlocal operations for such a system. We describe a protocol that efficiently performs nonlocal gates between elements of separated static logical qubits using a bus of dynamic qubits that can be used as a refreshable entanglement resource.
Citation
Physical Review A (Atomic, Molecular and Optical Physics)
Volume
l. 67
Issue
No. 5

Keywords

entanglement swapping, quantum architecture, quantum computing, teleportation

Citation

Brennen, G. , Song, D. and Williams, C. (2003), Quantum-Computer Architecture Using Nonlocal Interactions, Physical Review A (Atomic, Molecular and Optical Physics) (Accessed October 27, 2025)

Issues

If you have any questions about this publication or are having problems accessing it, please contact [email protected].

Created April 30, 2003, Updated October 12, 2021
Was this page helpful?