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.
An official website of the United States government
Here’s how you know
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
Several authors have described the basic requirements essential to building a scalable quantum computer. Because many physical implementation schemes for quantum computing rely on nearest neighbor interactions, there is a hidden quantum communication overhead to connect distant memory nodes of the computer. In this paper we provide a solution to this problem which together with the key building blocks provides a pathway to building a scalable quantum architecture using nonlocal interactions. Our solution involves the concept of a quantum bus that acts as a refreshable entanglement resource to connect distant memory nodes. In some ways the concepts described here along with the initial requirements provide a broad architectural concept for quantum computers in a manner analogous to the von Neumann architecture for classical computers.
Citation
Physical Review A (Atomic, Molecular and Optical Physics)
Volume
67
Issue
NO. 5
Pub Type
Journals
Keywords
computer architectures, quantum information
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 12, 2025)