Randomized Benchmarking of Quantum Gates

A key requirement for scalable quantum computing is that elementary quantum gates can be implemented with sufficiently low error. One method for determining the error behavior of a gate implementation is to perform process tomography. However, standard process tomography is limited by errors in state preparation, measurement and one-qubit gates. It suffers from inefficient scaling with number of qubits and does not detect adverse error-compounding when gates are composed in long sequences. An additional problem is due to the fact that desirable error probabilities for scalable quantum computing are of the order of 0.0001 or lower. Experimentally proving such low errors is challenging. We describe a randomized benchmarking method that yields estimates of the computationally relevant errors without relying on accurate state preparation and measurement. Since it involves long sequences of randomly chosen gates, it also verifies that error behavior is stable when used in long computations. We implemented randomized benchmarking on trapped atomic ion qubits, establishing a one-qubit error probability per randomized pi/2 pulse of 0.00482(17) in a particular experiment. We expect this error probability to be readily improved with straightforward technical modifications.Comment: 13 page

Long-lived qubit memory using atomic ions

We demonstrate experimentally a robust quantum memory using a magnetic-field-independent hyperfine transition in 9Be+ atomic ion qubits at a magnetic field B ~= 0.01194 T. We observe that the single physical qubit memory coherence time is greater than 10 seconds, an improvement of approximately five orders of magnitude from previous experiments with 9Be+. We also observe long coherence times of decoherence-free subspace logical qubits comprising two entangled physical qubits and discuss the merits of each type of qubit.Comment: 5 pages, 4 figure

Cleaning of first mirrors in ITER by means of radio frequency discharges

First mirrors of optical diagnostics in ITER are subject to charge exchange fluxes of Be, W, and potentially other elements. This may degrade the optical performance significantly via erosion or deposition. In order to restore reflectivity, cleaning by applying radio frequency (RF) power to the mirror itself and thus creating a discharge in front of the mirror will be used. The plasma generated in front of the mirror surface sputters off deposition, restoring its reflectivity. Although the functionality of such a mirror cleaning technique is proven in laboratory experiments, the technical implementation in ITER revealed obstacles which needs to be overcome: Since the discharge as an RF load in general is not very well matched to the power generator and transmission line, power reflections will occur leading to a thermal load of the cable. Its implementation for ITER requires additional R&D. This includes the design of mirrors as RF electrodes, as well as feeders and matching networks inside the vacuum vessel. Mitigation solutions will be evaluated and discussed. Furthermore, technical obstacles (i.e., cooling water pipes for the mirrors) need to be solved. Since cooling water lines are usually on ground potential at the feed through of the vacuum vessel, a solution to decouple the ground potential from the mirror would be a major simplification. Such a solution will be presented

Quantum control, quantum information processing, and quantum-limited metrology with trapped ions

We briefly discuss recent experiments on quantum information processing using trapped ions at NIST. A central theme of this work has been to increase our capabilities in terms of quantum computing protocols, but we have also applied the same concepts to improved metrology, particularly in the area of frequency standards and atomic clocks. Such work may eventually shed light on more fundamental issues, such as the quantum measurement problem.Comment: Proceedings of the International Conference on Laser Spectroscopy (ICOLS), 10 pages, 5 figure

Effects of syntactic context on eye movements during reading

Previous research has demonstrated that properties of a currently fixated word and of adjacent words influence eye movement control in reading. In contrast to such local effects, little is known about the global effects on eye movement control, for example global adjustments caused by processing difficulty of previous sentences. In the present study, participants read text passages in which voice (active vs. passive) and sentence structure (embedded vs. non-embedded) were manipulated. These passages were followed by identical target sentences. The results revealed effects of previous sentence structure on gaze durations in the target sentence, implying that syntactic properties of previously read sentences may lead to a global adjustment of eye movement control

The programming of sequences of saccades

Saccadic eye movements move the high-resolution fovea to point at regions of interest. Saccades can only be generated serially (i.e., one at a time). However, what remains unclear is the extent to which saccades are programmed in parallel (i.e., a series of such moments can be planned together) and how far ahead such planning occurs. In the current experiment, we investigate this issue with a saccade contingent preview paradigm. Participants were asked to execute saccadic eye movements in response to seven small circles presented on a screen. The extent to which participants were given prior information about target locations was varied on a trial-by-trial basis: participants were aware of the location of the next target only, the next three, five, or all seven targets. The addition of new targets to the display was made during the saccade to the next target in the sequence. The overall time taken to complete the sequence was decreased as more targets were available up to all seven targets. This was a result of a reduction in the number of saccades being executed and a reduction in their saccade latencies. Surprisingly, these results suggest that, when faced with a demand to saccade to a large number of target locations, saccade preparation about all target locations is carried out in paralle

How strongly do word reading times and lexical decision times correlate? Combining data from eye movement corpora and megastudies

We assess the amount of shared variance between three measures of visual word recognition latencies: eye movement latencies, lexical decision times and naming times. After partialling out the effects of word frequency and word length, two well-documented predictors of word recognition latencies, we see that 7-44% of the variance is uniquely shared between lexical decision times and naming times, depending on the frequency range of the words used. A similar analysis of eye movement latencies shows that the percentage of variance they uniquely share either with lexical decision times or with naming times is much lower. It is 5 – 17% for gaze durations and lexical decision times in studies with target words presented in neutral sentences, but drops to .2% for corpus studies in which eye movements to all words are analysed. Correlations between gaze durations and naming latencies are lower still. These findings suggest that processing times in isolated word processing and continuous text reading are affected by specific task demands and presentation format, and that lexical decision times and naming times are not very informative in predicting eye movement latencies in text reading once the effect of word frequency and word length are taken into account. The difference between controlled experiments and natural reading suggests that reading strategies and stimulus materials may determine the degree to which the immediacy-of-processing assumption and the eye-mind assumption apply. Fixation times are more likely to exclusively reflect the lexical processing of the currently fixated word in controlled studies with unpredictable target words rather than in natural reading of sentences or texts

Path Selection for Quantum Repeater Networks

Quantum networks will support long-distance quantum key distribution (QKD) and distributed quantum computation, and are an active area of both experimental and theoretical research. Here, we present an analysis of topologically complex networks of quantum repeaters composed of heterogeneous links. Quantum networks have fundamental behavioral differences from classical networks; the delicacy of quantum states makes a practical path selection algorithm imperative, but classical notions of resource utilization are not directly applicable, rendering known path selection mechanisms inadequate. To adapt Dijkstra's algorithm for quantum repeater networks that generate entangled Bell pairs, we quantify the key differences and define a link cost metric, seconds per Bell pair of a particular fidelity, where a single Bell pair is the resource consumed to perform one quantum teleportation. Simulations that include both the physical interactions and the extensive classical messaging confirm that Dijkstra's algorithm works well in a quantum context. Simulating about three hundred heterogeneous paths, comparing our path cost and the total work along the path gives a coefficient of determination of 0.88 or better.Comment: 12 pages, 8 figure