A Quantum Computer Architecture using Nonlocal Interactions
Gavin K. Brennen, Daegene Song, Carl J. Williams
备注：
4 pages, 2 figures, Slight modifications to satisfy referee, 2 new references, modified acknowledgement. This draft to appear in PRA Rapid Communications
Several authors have described the basic requirements essential to build 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 nodes of the computer. In this paper we propose a physical solution to this problem which, together with the key building blocks, provides a pathway to 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 providing an architectural concept for quantum computers analogous to the von Neumann architecture for classical computers.
Increasingly sophisticated quantum computers motivate the exploration of their abilities in certifying genuine quantum phenomena. Here, we demonstrate the power of state-of-the-art IBM quantum computers in correlation experiments inspired by quantum networks. Our experiments feature up to 12 qubits and require the implementation of paradigmatic Bell-State Measurements for scalable entanglement-swapping. First, we demonstrate quantum correlations that defy classical models in up to nine-qubit systems while only assuming that the quantum computer operates on qubits. Harvesting these quantum adva…
Nonlocal games are extensions of Bell inequalities, aimed at demonstrating quantum advantage. These games are well suited for noisy quantum computers because they only require the preparation of a shallow circuit, followed by the measurement of non-commuting observable. Here, we consider the minimal implementation of the nonlocal game proposed in Science 362, 308 (2018). We test this game by preparing a 6-qubit cluster state using quantum computers on the cloud by IBM, Ionq, and Honeywell. Our approach includes several levels of optimization, such as circuit identities and error mitigation and…
Several proposed quantum computer models include measurement processes, in order to implement nonlocal gates and create necessary entanglement resources during the computation. We introduce a scheme in which the measurements can be delayed for two- and three-qubit nonlocal gates. We also discuss implementing arbitrary nonlocal gates when measurements are included during the process.
We propose a set of Bell-type nonlocal games that can be used to prove an unconditional quantum advantage in an objective and hardware-agnostic manner. In these games, the circuit depth needed to prepare a cyclic cluster state and measure a subset of its Pauli stabilizers on a quantum computer is compared to that of classical Boolean circuits with the same, nearest-neighboring gate connectivity. Using a circuit-based trapped-ion quantum computer, we prepare and measure a six-qubit cyclic cluster state with an overall fidelity of 60.6% and 66.4%, before and after correcting for measurement-read…
An obstacle affecting any proposal for a topological quantum computer based on Ising anyons is that quasiparticle braiding can only implement a finite (non-universal) set of quantum operations. The computational power of this restricted set of operations (often called stabilizer operations) has been studied in quantum information theory, and it is known that no quantum-computational advantage can be obtained without the help of an additional non-stabilizer operation. Similarly, a bipartite two-qubit system based on Ising anyons cannot exhibit non-locality (in the sense of violating a Bell ineq…
Quantum chemistry provides key applications for near-term quantum computing, but these are greatly complicated by the presence of noise. In this work we present an efficient ansatz for the computation of two-electron atoms and molecules within a hybrid quantum-classical algorithm. The ansatz exploits the fundamental structure of the two-electron system, and treating the nonlocal and local degrees of freedom on the quantum and classical computers, respectively. Here the nonlocal degrees of freedom scale linearly with respect to basis-set size, giving a linear ansatz with only $\mathcal{O}(1)$ c…
An analogous model system for quantum information processing is discussed, based on classical wave optics. The model system is applied to three examples that involve three qubits: ({\em i}) three-particle Greenberger-Horne-Zeilinger entanglement, ({\em ii}) quantum teleportation, and ({\em iii}) a simple quantum error correction network. It is found that the model system can successfully simulate most features of entanglement, but fails to simulate quantum nonlocality. Investigations of how far the classical simulation can be pushed show that {\em quantum nonlocality} is the essential ingredie…
Nonlocal game as a novel witness of the nonlocality of entanglement is of fundamental importance in various fields. The known nonlocal games or equivalent linear Bell inequalities are only useful for Bell networks of single entanglement. Our goal in this paper is to propose a unified method for constructing cooperating games in network scenarios. We first propose an efficient method to construct numerous multipartite games from any graphs. The main idea is the graph representation of entanglement-based quantum networks. We further specify these graphic games with quantum advantages by providin…
The mapping of quantum circuits to qubits represented by ion states in a storage ring quantum computer is examined. Serial, parallel and hybrid architectures for mapping such qubits onto a storage ring quantum computer are presented. Parallelism is an important part of the SRQC architecture in terms of multiple ions, windows and lasers. A "predecessor problem" that arises in such architectures is identified and a solution is proposed. Representative numerical sizing and timing calculations are presented. The entire methodology is very general and extends to several implementation options. Open…
We experimentally verify the link existing between entanglement and the amount of wave-particle duality in a bipartite quantum system, with superconducting qubits in the IBM Q quantum computer. We consider both pure and mixed states, and study the influence of state purity on the observation of the complementarity "triality" relation of Jakob and Bergou. This work confirms the quantitative completion of local Bohr's complementarity principle by the nonlocal quantum entanglement typical of a truly bipartite quantum system.
We discuss the scalability of superconducting quantum computers, especially in a wiring problem. The number of wiring inside a cryostat is almost proportional to the number of qubits in current wiring architectures. We introduce regularity, modularity, and hierarchy to an architecture design of superconducting quantum computers. The key to the wiring elimination is found in the quantum error correction codes having thresholds and spatial translational symmetry, i.e., the surface code. We show a superconducting-digital-logic-based architecture and introduce a stacked heterogeneous structure of …
Trade-offs and experimental feasibility of nonlocal polygamy with two-outcome Bell inequalities
CRISP – Centre de Recerca Independent de sa Pobla（萨波拉独立研究中心）；Systems Research Institute, Polish Academy of Sciences（波兰科学院系统研究所）；Nicolaus Copernicus Astronomical Center, Polish Academy of Sciences（波兰科学院尼古拉·哥白尼天文中心）；Center of Excellence in Artificial Intelligence, AGH University（AGH大学人工智能卓越中心）；Faculty of Physics, University of Warsaw（华沙大学物理学院）；Faculty of Physics and Applied Informatics, University of Lodz（罗兹大学物理与应用信息学院）
We demonstrate a five-bit nuclear-magnetic-resonance quantum computer that distinguishes among various functions on four bits, making use of quantum parallelism. Its construction draws on the recognition of the sufficiency of linear coupling along a chain of nuclear spins, the synthesis of a suitably coupled molecule, and the use of a multi-channel spectrometer.
One of the basics tasks in computer systems is the control of access of resources. Basically, there is a finite amount of resources that can be, for example, the CPU, memory or I/O ports, and several processes requiring those resources. If there is not enough resource in order to attend the demand, some kind of control access has to be employed. In this work, recognizing the resource sharing problem as a competition, we employ a simplified multiplayer quantum game as an access controller. The proposed quantum game can be employed in the architecture of quantum computers.
The practical construction of scalable quantum computer hardware capable of executing non-trivial quantum algorithms will require the juxtaposition of different types of quantum systems. We analyze a modular ion trap quantum computer architecture with a hierarchy of interactions that can scale to very large numbers of qubits. Local entangling quantum gates between qubit memories within a single register are accomplished using natural interactions between the qubits, and entanglement between separate registers is completed via a probabilistic photonic interface between qubits in different regis…
Nonlocal Games as Cross-Platform Quantum Benchmarks: Exceeding unconditional classical bounds on trapped-ion processors
Joint Quantum Institute and Department of Physics, University of Maryland（马里兰大学联合量子研究所与物理系）；National Quantum Laboratory (QLab), University of Maryland（马里兰大学国家量子实验室（QLab））；Physical Detection Systems and Deployment Division, Pacific Northwest National Laboratory（太平洋西北国家实验室物理探测系统与部署部）；Duke Quantum Center, Department of Physics, and Department of Electrical and Computer Engineering, Duke University（杜克大学杜克量子中心、物理系及电气与计算机工程系）；Quantum Information Science Section, Oak Ridge National Laboratory（橡树岭国家实验室量子信息科学科）；Quantum Center, University of Tennessee at Chattanooga（田纳西大学查塔努加分校量子中心）
The trapped-ion QCCD (quantum charge-coupled device) architecture proposal lays out a blueprint for a universal quantum computer. The design begins with electrodes patterned on a two-dimensional surface configured to trap multiple arrays of ions (or ion crystals). Communication within the ion crystal network allows for the machine to be scaled while keeping the number of ions in each crystal to a small number, thereby preserving the low error rates demonstrated in trapped-ion experiments. By proposing to communicate quantum information by moving the ions through space to interact with other di…
As the size of quantum systems becomes bigger, more complicated hardware is required to control these systems. In order to reduce the complexity, I discuss the amount of parallelism required for a fault-tolerant quantum computer and what computation speed can be achieved in different architectures. To build a large-scale quantum computer, one can use architectural principles, from classical computer architecture, like multiplexing or pipelining. In this document, a Quantum von Neumann architecture is introduced which uses specialized hardware for the different tasks of a quantum computer, like…
First solid state quantum computer was built using transmons (cooper pair boxes). The operation of the computer is limited because of using a number of the rigit cooper boxes working with fixed frequency at temperatures of superconducting material. Here, we propose a novel architecture of quantum computer based on a flexible wire circuit of many coupled quantum nodes containing controlled atomic (molecular) ensembles. We demonstrate wide opportunities of the proposed computer. Firstly, we reveal a perfect storage of external photon qubits to multi-mode quantum memory node and demonstrate a rev…
In existing general-purpose architectures for surface-code-based fault-tolerant quantum computers, the cost of a quantum computation is determined by the circuit volume, i.e., the number of qubits multiplied by the number of non-Clifford gates. We introduce an architecture using non-2D-local connections in which the cost does not scale with the number of qubits, and instead only with the number of logical operations. Each logical operation has an associated active volume, such that the cost of a quantum computation can be quantified as a sum of active volumes of all operations. For quantum com…
The imaginary-time evolution method is widely known to be efficient for obtaining the ground state in quantum many-body problems on a classical computer. A recently proposed quantum imaginary-time evolution method (QITE) faces problems of deep circuit depth and difficulty in the implementation on noisy intermediate-scale quantum (NISQ) devices. In this study, a nonlocal approximation is developed to tackle this difficulty. We found that by removing the locality condition or local approximation (LA), which was imposed when the imaginary-time evolution operator is converted to a unitary operator…
As quantum computers increase in size, the total energy used by a quantum data center, including the cooling, will become a greater concern. The cooling requirements of quantum computers, which must operate at temperatures near absolute zero, are determined by computing system parameters, including the number and type of physical qubits, the operating temperature, the packaging efficiency of the system, and the split between circuits operating at cryogenic temperatures and those operating at room temperature. When combined with thermal system parameters such as cooling efficiency and cryostat …
A promising architecture for scaling up quantum computers based on trapped ions are so called Quantum Charged-Coupled Devices (QCCD). These consist of multiple ion traps, each designed for solving specific tasks, that are connected by transport links. In this paper we present the backend compiler phases needed for running quantum circuits on a QCCD architecture, while providing strategies to solve the optimization problems that occur when generating assembly instructions. We implement and test these strategies for the QVLS-Q1 chip architecture.
A scenario for realization of a quantum computer is proposed consisting of spatially distributed q-bits fabricated in a host structure where nuclear spin-spin coupling is mediated by laser pulse controlled electron-nuclear transferred hyperfine (superhyperfine) Fermi contact interaction. Operations illustrating entanglement, nonlocality, and quantum control logic operations are presented and discussed. The notion of universality of quantum computation is introduced and the irreducible conditions are presented. It is demonstrated that the proposed generic scenario for realization of a quantum c…
If a quantum computer is stabilized by fault-tolerant quantum error correction (QEC), then most of its resources (qubits and operations) are dedicated to the extraction of error information. Analysis of this process leads to a set of central requirements for candidate computing devices, in addition to the basic ones of stable qubits and controllable gates and measurements. The logical structure of the extraction process has a natural geometry and hierarchy of communication needs; a computer whose physical architecture is designed to reflect this will be able to tolerate the most noise. The rel…
The availability of a universal quantum computer will have fundamental impact on a vast number of research fields and society as a whole. An increasingly large scientific and industrial community is working towards the realization of such a device. An arbitrarily large quantum computer is best constructed using a modular approach. We present a blueprint for a trapped-ion based scalable quantum computer module which makes it possible to create a scalable quantum computer architecture based on long-wavelength radiation quantum gates. The modules control all operations as stand-alone units, are c…
We show how the execution time of algorithms on quantum computers depends on the architecture of the quantum computer, the choice of algorithms (including subroutines such as arithmetic), and the ``clock speed'' of the quantum computer. The primary architectural features of interest are the ability to execute multiple gates concurrently, the number of application-level qubits available, and the interconnection network of qubits. We analyze Shor's algorithm for factoring large numbers in this context. Our results show that, if arbitrary interconnection of qubits is possible, a machine with an a…
In bulk silicon, intervalley electronic interference has been shown to lead to strong oscillations in the exchange coupling between impurity electronic wavefunctions, posing a serious manufacturability problem for proposed quantum computers. Here we show that this problem does not arise in proposed architectures using Si/SiGe quantum dots because of the large in-plane strain in Si quantum wells together with the strong confinement potential typical of heterostructures.
In this work, we propose a quantum neural network named quantum perceptron over a field (QPF). Quantum computers are not yet a reality and the models and algorithms proposed in this work cannot be simulated in actual (or classical) computers. QPF is a direct generalization of a classical perceptron and solves some drawbacks found in previous models of quantum perceptrons. We also present a learning algorithm named Superposition based Architecture Learning algorithm (SAL) that optimizes the neural network weights and architectures. SAL searches for the best architecture in a finite set of neura…
We propose a runtime architecture that can be used in the development of a quantum programming language and its programming environment. The proposed runtime architecture enables dynamic interaction between classical and quantum data following the restriction that a quantum computer is available in the cloud as a batch computer, with no interaction with the classical computer during its execution. It is done by leaving the quantum code generation for the runtime and introducing the concept of futures for quantum measurements. When implemented in a quantum programming language, those strategies…
We develop a theory for micro-Raman scattering by single and coupled two-donor states in silicon. We find the Raman spectra to have significant dependence on the donor exchange splitting and the relative spatial positions of the two donor sites. In particular, we establish a strong correlation between the temperature dependence of the Raman peak intensity and the interdonor exchange coupling. Micro-Raman scattering can therefore potentially become a powerful tool to measure interqubit coupling in the development of a Si quantum computer architecture.
Training artificial neural networks requires a tedious empirical evaluation to determine a suitable neural network architecture. To avoid this empirical process several techniques have been proposed to automatise the architecture selection process. In this paper, we propose a method to perform parameter and architecture selection for a quantum weightless neural network (qWNN). The architecture selection is performed through the learning procedure of a qWNN with a learning algorithm that uses the principle of quantum superposition and a non-linear quantum operator. The main advantage of the pro…
Being a very promising technology, with impressive advances in the recent years, it is still unclear how quantum computing will scale to satisfy the requirements of its most powerful applications. Although continued progress in the fabrication and control of qubits is required, quantum computing scalability will depend as well on a comprehensive architectural design considering a multi-core approach as an alternative to the traditional monolithic version, hence including a communications perspective. However, this goes beyond introducing mere interconnects. Rather, it implies consolidating the…
We theoretically consider coherence times for spins in two quantum computer architectures, where the qubit is the spin of an electron bound to a P donor impurity in Si or within a GaAs quantum dot. We show that low temperature decoherence is dominated by spin-spin interactions, through spectral diffusion and dipolar flip-flop mechanisms. These contributions lead to 1-100 $μ$s calculated spin coherence times for a wide range of parameters, much higher than former estimates based on $T_{2}^{*}$ measurements.
The silicon-based quantum computer proposal has been one of the intensely pursued ideas during the past three years. Here we calculate the donor electron exchange in silicon and germanium, and demonstrate an atomic-scale challenge for quantum computing in Si (and Ge), as the six (four) conduction band minima in Si (Ge) lead to inter-valley electronic interferences, generating strong oscillations in the exchange splitting of two-donor two-electron states. Donor positioning with atomic scale precision within the unit cell thus becomes a decisive factor in determining the strength of the exchange…
The primordial model of quantum computation was introduced over thirty years ago and the first quantum algorithms have appeared for over twenty years. Yet the exact architectures for quantum computer seem foreign to an undergraduate student major in computer science or engineering, even though the mass media has helped popularize the terminologies in the past decade. Despite being a cutting-edge technology from both the theoretical and the experimental perspectives, quantum computation is indeed imminent and it would be helpful to give the undergraduate students at least a skeleton understandi…
The possibility of performing single spin measurements in Si-based quantum computers through electric field control of electrons bound to double donors near a barrier interface is assessed. We find that both the required electric fields and the tunneling times involved are probably too large for practical implementations. On the other hand, operations with double donors in their first excited state require smaller fields and faster tunneling times, and are therefore suitable for spin-to-charge conversion measurements. We also propose a measurement scheme that would render statistical (ensemble…
