16,638 research outputs found
Quantum computation with linear optics
We present a constructive method to translate small quantum circuits into
their optical analogues, using linear components of present-day quantum optics
technology only. These optical circuits perform precisely the computation that
the quantum circuits are designed for, and can thus be used to test the
performance of quantum algorithms. The method relies on the representation of
several quantum bits by a single photon, and on the implementation of universal
quantum gates using simple optical components (beam splitters, phase shifters,
etc.). The optical implementation of Brassard et al.'s teleportation circuit, a
non-trivial 3-bit quantum computation, is presented as an illustration.Comment: LaTeX with llncs.cls, 11 pages with 5 postscript figures, Proc. of
1st NASA Workshop on Quantum Computation and Quantum Communication (QCQC 98
Synthesis of Quantum Logic Circuits
We discuss efficient quantum logic circuits which perform two tasks: (i)
implementing generic quantum computations and (ii) initializing quantum
registers. In contrast to conventional computing, the latter task is nontrivial
because the state-space of an n-qubit register is not finite and contains
exponential superpositions of classical bit strings. Our proposed circuits are
asymptotically optimal for respective tasks and improve published results by at
least a factor of two.
The circuits for generic quantum computation constructed by our algorithms
are the most efficient known today in terms of the number of expensive gates
(quantum controlled-NOTs). They are based on an analogue of the Shannon
decomposition of Boolean functions and a new circuit block, quantum
multiplexor, that generalizes several known constructions. A theoretical lower
bound implies that our circuits cannot be improved by more than a factor of
two. We additionally show how to accommodate the severe architectural
limitation of using only nearest-neighbor gates that is representative of
current implementation technologies. This increases the number of gates by
almost an order of magnitude, but preserves the asymptotic optimality of gate
counts.Comment: 18 pages; v5 fixes minor bugs; v4 is a complete rewrite of v3, with
6x more content, a theory of quantum multiplexors and Quantum Shannon
Decomposition. A key result on generic circuit synthesis has been improved to
~23/48*4^n CNOTs for n qubit
Fault Models for Quantum Mechanical Switching Networks
The difference between faults and errors is that, unlike faults, errors can
be corrected using control codes. In classical test and verification one
develops a test set separating a correct circuit from a circuit containing any
considered fault. Classical faults are modelled at the logical level by fault
models that act on classical states. The stuck fault model, thought of as a
lead connected to a power rail or to a ground, is most typically considered. A
classical test set complete for the stuck fault model propagates both binary
basis states, 0 and 1, through all nodes in a network and is known to detect
many physical faults. A classical test set complete for the stuck fault model
allows all circuit nodes to be completely tested and verifies the function of
many gates. It is natural to ask if one may adapt any of the known classical
methods to test quantum circuits. Of course, classical fault models do not
capture all the logical failures found in quantum circuits. The first obstacle
faced when using methods from classical test is developing a set of realistic
quantum-logical fault models. Developing fault models to abstract the test
problem away from the device level motivated our study. Several results are
established. First, we describe typical modes of failure present in the
physical design of quantum circuits. From this we develop fault models for
quantum binary circuits that enable testing at the logical level. The
application of these fault models is shown by adapting the classical test set
generation technique known as constructing a fault table to generate quantum
test sets. A test set developed using this method is shown to detect each of
the considered faults.Comment: (almost) Forgotten rewrite from 200
An Algebraic Approach to Linear-Optical Schemes for Deterministic Quantum Computing
Linear-Optical Passive (LOP) devices and photon counters are sufficient to
implement universal quantum computation with single photons, and particular
schemes have already been proposed. In this paper we discuss the link between
the algebraic structure of LOP transformations and quantum computing. We first
show how to decompose the Fock space of N optical modes in finite-dimensional
subspaces that are suitable for encoding strings of qubits and invariant under
LOP transformations (these subspaces are related to the spaces of irreducible
unitary representations of U(N)). Next we show how to design in algorithmic
fashion
LOP circuits which implement any quantum circuit deterministically. We also
present some simple examples, such as the circuits implementing a CNOT gate and
a Bell-State Generator/Analyzer.Comment: new version with minor modification
- …