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

Two-Color Terawatt Laser System For High-Intensity Laser-Plasma Experiments

We report a two-color terawatt laser system for use in controlling laser-plasma instabilities. The system includes a commercial 45 TW Ti:Sapphire laser system at 800 nm, temporally synchronized with a 1 TW CPA Raman-Ti:Sapphire hybrid laser centered at 873nm that we designed and built to complement the 800 nm system. The two-color system will be used to seed, enhance, suppress, or otherwise control a variety of instabilities which arise in laser-plasma interactions.Physic

Ordered Measurements of Permutationally-Symmetric Qubit Strings

We show that any sequence of measurements on a permutationally-symmetric (pure or mixed) multi-qubit string leaves the unmeasured qubit substring also permutationally-symmetric. In addition, we show that the measurement probabilities for an arbitrary sequence of single-qubit measurements are independent of how many unmeasured qubits have been lost prior to the measurement. Our results are valuable for quantum information processing of indistinguishable particles by post-selection, e.g. in cases where the results of an experiment are discarded conditioned upon the occurrence of a given event such as particle loss. Furthermore, our results are important for the design of adaptive-measurement strategies, e.g. a series of measurements where for each measurement instance, the measurement basis is chosen depending on prior measurement results.Comment: 13 page

Nearest-neighbor coupling asymmetry in the generation of cluster states

We demonstrate that charge-qubit cluster state generation by capacitive coupling is anisotropic. Specifically, horizontal vs vertical nearest-neighbor inter-qubit coupling differs in a rectangular lattice. We show how to ameliorate this anisotropy by applying potential biases to the array of double dots.Comment: 7 pages, 2 figure

Constraints on turbulent velocity broadening for a sample of clusters, groups and elliptical galaxies using XMM-Newton

Using the width of emission lines in XMM-Newton Reflection Grating Spectrometer spectra, we place direct constraints on the turbulent velocities of the X-ray emitting medium in the cores of 62 galaxy clusters, groups and elliptical galaxies. We find five objects where we can place an upper limit on the line-of-sight broadening of 500 km/s (90 per cent confidence level), using a single thermal component model. Two other objects are lower than this limit when two thermal components are used. Half of the objects examined have an upper limit on the velocity broadening of less than 700 km/s. To look for objects which have significant turbulent broadening, we use Chandra spectral maps to compute the expected broadening caused by the spatial extent of the source. Comparing these with our observed results, we find that Klemola 44 has extra broadening at the level of 1500 km/s. RX J1347.5-1145 shows weak evidence for turbulent velocities at 800 km/s. In addition we obtain limits on turbulence for Zw3146, Abell 496, Abell 1795, Abell 2204 and HCG 62 of less than 200 km/s. After subtraction of the spatial contribution and including a 50 km/s systematic uncertainty, we find at least 15 sources with less than 20 per cent of the thermal energy density in turbulence.Comment: 17 pages, 17 figures, accepted by MNRAS. Includes minor edits to proo

Gravitational polarization and the phenomenology of MOND

The modified Newtonian dynamics (MOND) has been proposed as an alternative to the dark matter paradigm; the philosophy behind is that there is no dark matter and we witness a violation of the Newtonian law of dynamics. In this article, we interpret differently the phenomenology sustaining MOND, as resulting from an effect of "gravitational polarization", of some cosmic fluid made of dipole moments, aligned in the gravitational field, and representing a new form of dark matter. We invoke an internal force, of non-gravitational origin, in order to hold together the microscopic constituents of the dipole. The dipolar particles are weakly influenced by the distribution of ordinary matter; they are accelerated not by the gravitational field, but by its gradient, or tidal gravitational field.Comment: 14 pages, 1 figure, to appear in Classical and Quantum Gravit

Partitioning Complex Networks via Size-constrained Clustering

The most commonly used method to tackle the graph partitioning problem in practice is the multilevel approach. During a coarsening phase, a multilevel graph partitioning algorithm reduces the graph size by iteratively contracting nodes and edges until the graph is small enough to be partitioned by some other algorithm. A partition of the input graph is then constructed by successively transferring the solution to the next finer graph and applying a local search algorithm to improve the current solution. In this paper, we describe a novel approach to partition graphs effectively especially if the networks have a highly irregular structure. More precisely, our algorithm provides graph coarsening by iteratively contracting size-constrained clusterings that are computed using a label propagation algorithm. The same algorithm that provides the size-constrained clusterings can also be used during uncoarsening as a fast and simple local search algorithm. Depending on the algorithm's configuration, we are able to compute partitions of very high quality outperforming all competitors, or partitions that are comparable to the best competitor in terms of quality, hMetis, while being nearly an order of magnitude faster on average. The fastest configuration partitions the largest graph available to us with 3.3 billion edges using a single machine in about ten minutes while cutting less than half of the edges than the fastest competitor, kMetis