11,255 research outputs found
Unconditionally verifiable blind computation
Blind Quantum Computing (BQC) allows a client to have a server carry out a
quantum computation for them such that the client's input, output and
computation remain private. A desirable property for any BQC protocol is
verification, whereby the client can verify with high probability whether the
server has followed the instructions of the protocol, or if there has been some
deviation resulting in a corrupted output state. A verifiable BQC protocol can
be viewed as an interactive proof system leading to consequences for complexity
theory. The authors, together with Broadbent, previously proposed a universal
and unconditionally secure BQC scheme where the client only needs to be able to
prepare single qubits in separable states randomly chosen from a finite set and
send them to the server, who has the balance of the required quantum
computational resources. In this paper we extend that protocol with new
functionality allowing blind computational basis measurements, which we use to
construct a new verifiable BQC protocol based on a new class of resource
states. We rigorously prove that the probability of failing to detect an
incorrect output is exponentially small in a security parameter, while resource
overhead remains polynomial in this parameter. The new resource state allows
entangling gates to be performed between arbitrary pairs of logical qubits with
only constant overhead. This is a significant improvement on the original
scheme, which required that all computations to be performed must first be put
into a nearest neighbour form, incurring linear overhead in the number of
qubits. Such an improvement has important consequences for efficiency and
fault-tolerance thresholds.Comment: 46 pages, 10 figures. Additional protocol added which allows
arbitrary circuits to be verified with polynomial securit
Parallelizing Quantum Circuits
We present a novel automated technique for parallelizing quantum circuits via
forward and backward translation to measurement-based quantum computing
patterns and analyze the trade off in terms of depth and space complexity. As a
result we distinguish a class of polynomial depth circuits that can be
parallelized to logarithmic depth while adding only polynomial many auxiliary
qubits. In particular, we provide for the first time a full characterization of
patterns with flow of arbitrary depth, based on the notion of influencing paths
and a simple rewriting system on the angles of the measurement. Our method
leads to insightful knowledge for constructing parallel circuits and as
applications, we demonstrate several constant and logarithmic depth circuits.
Furthermore, we prove a logarithmic separation in terms of quantum depth
between the quantum circuit model and the measurement-based model.Comment: 34 pages, 14 figures; depth complexity, measurement-based quantum
computing and parallel computin
The Measurement Calculus
Measurement-based quantum computation has emerged from the physics community
as a new approach to quantum computation where the notion of measurement is the
main driving force of computation. This is in contrast with the more
traditional circuit model which is based on unitary operations. Among
measurement-based quantum computation methods, the recently introduced one-way
quantum computer stands out as fundamental.
We develop a rigorous mathematical model underlying the one-way quantum
computer and present a concrete syntax and operational semantics for programs,
which we call patterns, and an algebra of these patterns derived from a
denotational semantics. More importantly, we present a calculus for reasoning
locally and compositionally about these patterns.
We present a rewrite theory and prove a general standardization theorem which
allows all patterns to be put in a semantically equivalent standard form.
Standardization has far-reaching consequences: a new physical architecture
based on performing all the entanglement in the beginning, parallelization by
exposing the dependency structure of measurements and expressiveness theorems.
Furthermore we formalize several other measurement-based models:
Teleportation, Phase and Pauli models and present compositional embeddings of
them into and from the one-way model. This allows us to transfer all the theory
we develop for the one-way model to these models. This shows that the framework
we have developed has a general impact on measurement-based computation and is
not just particular to the one-way quantum computer.Comment: 46 pages, 2 figures, Replacement of quant-ph/0412135v1, the new
version also include formalization of several other measurement-based models:
Teleportation, Phase and Pauli models and present compositional embeddings of
them into and from the one-way model. To appear in Journal of AC
Simple proof of fault tolerance in the graph-state model
We consider the problem of fault tolerance in the graph-state model of
quantum computation. Using the notion of composable simulations, we provide a
simple proof for the existence of an accuracy threshold for graph-state
computation by invoking the threshold theorem derived for quantum circuit
computation. Lower bounds for the threshold in the graph-state model are then
obtained from known bounds in the circuit model under the same noise process.Comment: 6 pages, 2 figures, REVTeX4. (v4): Minor revisions and new title;
published versio
Efficient approximate unitary t-designs from partially invertible universal sets and their application to quantum speedup
At its core a -design is a method for sampling from a set of unitaries in
a way which mimics sampling randomly from the Haar measure on the unitary
group, with applications across quantum information processing and physics. We
construct new families of quantum circuits on -qubits giving rise to
-approximate unitary -designs efficiently in
depth. These quantum circuits are based on a relaxation of technical
requirements in previous constructions. In particular, the construction of
circuits which give efficient approximate -designs by Brandao, Harrow, and
Horodecki (F.G.S.L Brandao, A.W Harrow, and M. Horodecki, Commun. Math. Phys.
(2016).) required choosing gates from ensembles which contained inverses for
all elements, and that the entries of the unitaries are algebraic. We reduce
these requirements, to sets that contain elements without inverses in the set,
and non-algebraic entries, which we dub partially invertible universal sets. We
then adapt this circuit construction to the framework of measurement based
quantum computation(MBQC) and give new explicit examples of -qubit graph
states with fixed assignments of measurements (graph gadgets) giving rise to
unitary -designs based on partially invertible universal sets, in a natural
way. We further show that these graph gadgets demonstrate a quantum speedup, up
to standard complexity theoretic conjectures. We provide numerical and
analytical evidence that almost any assignment of fixed measurement angles on
an -qubit cluster state give efficient -designs and demonstrate a quantum
speedup.Comment: 25 pages,7 figures. Comments are welcome. Some typos corrected in
newest version. new References added.Proofs unchanged. Results unchange
Determinism in the one-way model
We introduce a flow condition on open graph states (graph states with inputs
and outputs) which guarantees globally deterministic behavior of a class of
measurement patterns defined over them. Dependent Pauli corrections are derived
for all such patterns, which equalize all computation branches, and only depend
on the underlying entanglement graph and its choice of inputs and outputs.
The class of patterns having flow is stable under composition and
tensorization, and has unitary embeddings as realizations. The restricted class
of patterns having both flow and reverse flow, supports an operation of
adjunction, and has all and only unitaries as realizations.Comment: 8 figures, keywords: measurement based quantum computing,
deterministic computing; Published version, including a new section on
circuit decompositio
- …