14,259 research outputs found
Optimal Vertex Fault Tolerant Spanners (for fixed stretch)
A -spanner of a graph is a sparse subgraph whose shortest path
distances match those of up to a multiplicative error . In this paper we
study spanners that are resistant to faults. A subgraph is an
vertex fault tolerant (VFT) -spanner if is a -spanner
of for any small set of vertices that might "fail." One
of the main questions in the area is: what is the minimum size of an fault
tolerant -spanner that holds for all node graphs (as a function of ,
and )? This question was first studied in the context of geometric
graphs [Levcopoulos et al. STOC '98, Czumaj and Zhao SoCG '03] and has more
recently been considered in general undirected graphs [Chechik et al. STOC '09,
Dinitz and Krauthgamer PODC '11].
In this paper, we settle the question of the optimal size of a VFT spanner,
in the setting where the stretch factor is fixed. Specifically, we prove
that every (undirected, possibly weighted) -node graph has a
-spanner resilient to vertex faults with edges, and this is fully optimal (unless the famous Erdos Girth
Conjecture is false). Our lower bound even generalizes to imply that no data
structure capable of approximating similarly can
beat the space usage of our spanner in the worst case. We also consider the
edge fault tolerant (EFT) model, defined analogously with edge failures rather
than vertex failures. We show that the same spanner upper bound applies in this
setting. Our data structure lower bound extends to the case (and hence we
close the EFT problem for -approximations), but it falls to for . We leave it as an open problem to
close this gap.Comment: To appear in SODA 201
Classical simulatability, entanglement breaking, and quantum computation thresholds
We investigate the amount of noise required to turn a universal quantum gate
set into one that can be efficiently modelled classically. This question is
useful for providing upper bounds on fault tolerant thresholds, and for
understanding the nature of the quantum/classical computational transition. We
refine some previously known upper bounds using two different strategies. The
first one involves the introduction of bi-entangling operations, a class of
classically simulatable machines that can generate at most bipartite
entanglement. Using this class we show that it is possible to sharpen
previously obtained upper bounds in certain cases. As an example, we show that
under depolarizing noise on the controlled-not gate, the previously known upper
bound of 74% can be sharpened to around 67%. Another interesting consequence is
that measurement based schemes cannot work using only 2-qubit non-degenerate
projections. In the second strand of the work we utilize the Gottesman-Knill
theorem on the classically efficient simulation of Clifford group operations.
The bounds attained for the pi/8 gate using this approach can be as low as 15%
for general single gate noise, and 30% for dephasing noise.Comment: 12 pages, 3 figures. v2: small typos changed, no change to result
Fault-Tolerant Spanners: Better and Simpler
A natural requirement of many distributed structures is fault-tolerance:
after some failures, whatever remains from the structure should still be
effective for whatever remains from the network. In this paper we examine
spanners of general graphs that are tolerant to vertex failures, and
significantly improve their dependence on the number of faults , for all
stretch bounds.
For stretch we design a simple transformation that converts every
-spanner construction with at most edges into an -fault-tolerant
-spanner construction with at most edges.
Applying this to standard greedy spanner constructions gives -fault tolerant
-spanners with edges. The previous
construction by Chechik, Langberg, Peleg, and Roddity [STOC 2009] depends
similarly on but exponentially on (approximately like ).
For the case and unit-length edges, an -approximation
algorithm is known from recent work of Dinitz and Krauthgamer [arXiv 2010],
where several spanner results are obtained using a common approach of rounding
a natural flow-based linear programming relaxation. Here we use a different
(stronger) LP relaxation and improve the approximation ratio to ,
which is, notably, independent of the number of faults . We further
strengthen this bound in terms of the maximum degree by using the \Lovasz Local
Lemma.
Finally, we show that most of our constructions are inherently local by
designing equivalent distributed algorithms in the LOCAL model of distributed
computation.Comment: 17 page
Sparse Fault-Tolerant BFS Trees
This paper addresses the problem of designing a sparse {\em fault-tolerant}
BFS tree, or {\em FT-BFS tree} for short, namely, a sparse subgraph of the
given network such that subsequent to the failure of a single edge or
vertex, the surviving part of still contains a BFS spanning tree for
(the surviving part of) . Our main results are as follows. We present an
algorithm that for every -vertex graph and source node constructs a
(single edge failure) FT-BFS tree rooted at with O(n \cdot
\min\{\Depth(s), \sqrt{n}\}) edges, where \Depth(s) is the depth of the BFS
tree rooted at . This result is complemented by a matching lower bound,
showing that there exist -vertex graphs with a source node for which any
edge (or vertex) FT-BFS tree rooted at has edges. We then
consider {\em fault-tolerant multi-source BFS trees}, or {\em FT-MBFS trees}
for short, aiming to provide (following a failure) a BFS tree rooted at each
source for some subset of sources . Again, tight bounds
are provided, showing that there exists a poly-time algorithm that for every
-vertex graph and source set of size constructs a
(single failure) FT-MBFS tree from each source , with
edges, and on the other hand there exist
-vertex graphs with source sets of cardinality , on
which any FT-MBFS tree from has edges.
Finally, we propose an approximation algorithm for constructing
FT-BFS and FT-MBFS structures. The latter is complemented by a hardness result
stating that there exists no approximation algorithm for these
problems under standard complexity assumptions
Bounding quantum gate error rate based on reported average fidelity
Remarkable experimental advances in quantum computing are exemplified by
recent announcements of impressive average gate fidelities exceeding 99.9% for
single-qubit gates and 99% for two-qubit gates. Although these high numbers
engender optimism that fault-tolerant quantum computing is within reach, the
connection of average gate fidelity with fault-tolerance requirements is not
direct. Here we use reported average gate fidelity to determine an upper bound
on the quantum-gate error rate, which is the appropriate metric for assessing
progress towards fault-tolerant quantum computation, and we demonstrate that
this bound is asymptotically tight for general noise. Although this bound is
unlikely to be saturated by experimental noise, we demonstrate using explicit
examples that the bound indicates a realistic deviation between the true error
rate and the reported average fidelity. We introduce the Pauli distance as a
measure of this deviation, and we show that knowledge of the Pauli distance
enables tighter estimates of the error rate of quantum gates.Comment: New Journal of Physics Fast Track Communication. Gold open access
journa
- β¦