1,442 research outputs found
Interconnection Networks for Scalable Quantum Computers
We show that the problem of communication in a quantum computer reduces to
constructing reliable quantum channels by distributing high-fidelity EPR pairs.
We develop analytical models of the latency, bandwidth, error rate and resource
utilization of such channels, and show that 100s of qubits must be distributed
to accommodate a single data communication. Next, we show that a grid of
teleportation nodes forms a good substrate on which to distribute EPR pairs. We
also explore the control requirements for such a network. Finally, we propose a
specific routing architecture and simulate the communication patterns of the
Quantum Fourier Transform to demonstrate the impact of resource contention.Comment: To appear in International Symposium on Computer Architecture 2006
(ISCA 2006
Distributed quantum computing: A distributed Shor algorithm
We present a distributed implementation of Shor's quantum factoring algorithm
on a distributed quantum network model. This model provides a means for small
capacity quantum computers to work together in such a way as to simulate a
large capacity quantum computer. In this paper, entanglement is used as a
resource for implementing non-local operations between two or more quantum
computers. These non-local operations are used to implement a distributed
factoring circuit with polynomially many gates. This distributed version of
Shor's algorithm requires an additional overhead of O((log N)^2) communication
complexity, where N denotes the integer to be factored.Comment: 13 pages, 12 figures, extra figures are remove
An Introduction to Quantum Computing for Non-Physicists
Richard Feynman's observation that quantum mechanical effects could not be
simulated efficiently on a computer led to speculation that computation in
general could be done more efficiently if it used quantum effects. This
speculation appeared justified when Peter Shor described a polynomial time
quantum algorithm for factoring integers.
In quantum systems, the computational space increases exponentially with the
size of the system which enables exponential parallelism. This parallelism
could lead to exponentially faster quantum algorithms than possible
classically. The catch is that accessing the results, which requires
measurement, proves tricky and requires new non-traditional programming
techniques.
The aim of this paper is to guide computer scientists and other
non-physicists through the conceptual and notational barriers that separate
quantum computing from conventional computing. We introduce basic principles of
quantum mechanics to explain where the power of quantum computers comes from
and why it is difficult to harness. We describe quantum cryptography,
teleportation, and dense coding. Various approaches to harnessing the power of
quantum parallelism are explained, including Shor's algorithm, Grover's
algorithm, and Hogg's algorithms. We conclude with a discussion of quantum
error correction.Comment: 45 pages. To appear in ACM Computing Surveys. LATEX file. Exposition
improved throughout thanks to reviewers' comment
Quantum-Assisted Telescope Arrays
Quantum networks provide a platform for astronomical interferometers capable
of imaging faint stellar objects. In a recent work [arXiv:1809.01659], we
presented a protocol that circumvents transmission losses with efficient use of
quantum resources and modest quantum memories. Here we analyze a number of
extensions to that scheme. We show that it can be operated as a truly broadband
interferometer and generalized to multiple sites in the array. We also analyze
how imaging based on the quantum Fourier transform provides improved
signal-to-noise ratio compared to classical processing. Finally, we discuss
physical realizations including photon-detection-based quantum state transfer.Comment: 10 pages, 8 figures; v2 - clarifications and references; v3 - close
to published versio
Simulating chemistry efficiently on fault-tolerant quantum computers
Quantum computers can in principle simulate quantum physics exponentially
faster than their classical counterparts, but some technical hurdles remain.
Here we consider methods to make proposed chemical simulation algorithms
computationally fast on fault-tolerant quantum computers in the circuit model.
Fault tolerance constrains the choice of available gates, so that arbitrary
gates required for a simulation algorithm must be constructed from sequences of
fundamental operations. We examine techniques for constructing arbitrary gates
which perform substantially faster than circuits based on the conventional
Solovay-Kitaev algorithm [C.M. Dawson and M.A. Nielsen, \emph{Quantum Inf.
Comput.}, \textbf{6}:81, 2006]. For a given approximation error ,
arbitrary single-qubit gates can be produced fault-tolerantly and using a
limited set of gates in time which is or ; with sufficient parallel preparation of ancillas, constant average
depth is possible using a method we call programmable ancilla rotations.
Moreover, we construct and analyze efficient implementations of first- and
second-quantized simulation algorithms using the fault-tolerant arbitrary gates
and other techniques, such as implementing various subroutines in constant
time. A specific example we analyze is the ground-state energy calculation for
Lithium hydride.Comment: 33 pages, 18 figure
Arithmetic on a Distributed-Memory Quantum Multicomputer
We evaluate the performance of quantum arithmetic algorithms run on a
distributed quantum computer (a quantum multicomputer). We vary the node
capacity and I/O capabilities, and the network topology. The tradeoff of
choosing between gates executed remotely, through ``teleported gates'' on
entangled pairs of qubits (telegate), versus exchanging the relevant qubits via
quantum teleportation, then executing the algorithm using local gates
(teledata), is examined. We show that the teledata approach performs better,
and that carry-ripple adders perform well when the teleportation block is
decomposed so that the key quantum operations can be parallelized. A node size
of only a few logical qubits performs adequately provided that the nodes have
two transceiver qubits. A linear network topology performs acceptably for a
broad range of system sizes and performance parameters. We therefore recommend
pursuing small, high-I/O bandwidth nodes and a simple network. Such a machine
will run Shor's algorithm for factoring large numbers efficiently.Comment: 24 pages, 10 figures, ACM transactions format. Extended version of
Int. Symp. on Comp. Architecture (ISCA) paper; v2, correct one circuit error,
numerous small changes for clarity, add reference
- …