Spatial search in a honeycomb network

The spatial search problem consists in minimizing the number of steps required to find a given site in a network, under the restriction that only oracle queries or translations to neighboring sites are allowed. In this paper, a quantum algorithm for the spatial search problem on a honeycomb lattice with $N$ sites and torus-like boundary conditions. The search algorithm is based on a modified quantum walk on a hexagonal lattice and the general framework proposed by Ambainis, Kempe and Rivosh is used to show that the time complexity of this quantum search algorithm is $O(\sqrt{N \log N})$.Comment: 10 pages, 2 figures; Minor typos corrected, one Reference added. accepted in Math. Structures in Computer Science, special volume on Quantum Computin

Understanding Pound-Drever-Hall locking using voltage controlled radio-frequency oscillators: An undergraduate experiment

We have developed a senior undergraduate experiment that illustrates frequency stabilization techniques using radio-frequency electronics. The primary objective is to frequency stabilize a voltage controlled oscillator to a cavity resonance at 800 MHz using the Pound-Drever-Hall method. This technique is commonly applied to stabilize lasers at optical frequencies. By using only radio-frequency equipment it is possible to systematically study aspects of the technique more thoroughly, inexpensively, and free from eye hazards. Students also learn about modular radio-frequency electronics and basic feedback control loops. By varying the temperature of the resonator, students can determine the thermal expansion coefficients of copper, aluminum, and super invar.Comment: 9 pages, 10 figure

Quantum Chinos Game: winning strategies through quantum fluctuations

We apply several quantization schemes to simple versions of the Chinos game. Classically, for two players with one coin each, there is a symmetric stable strategy that allows each player to win half of the times on average. A partial quantization of the game (semiclassical) allows us to find a winning strategy for the second player, but it is unstable w.r.t. the classical strategy. However, in a fully quantum version of the game we find a winning strategy for the first player that is optimal: the symmetric classical situation is broken at the quantum level.Comment: REVTEX4.b4 file, 3 table

Magnetic screening in proximity effect Josephson-junction arrays

The modulation with magnetic field of the sheet inductance measured on proximity effect Josephson-junction arrays (JJAs) is progressively vanishing on lowering the temperature, leading to a low temperature field-independent response. This behaviour is consistent with the decrease of the two-dimensional penetration length below the lattice parameter. Low temperature data are quantitatively compared with theoretical predictions based on the XY model in absence of thermal fluctuations. The results show that the description of a JJA within the XY model is incomplete and the system is put well beyond the weak screening limit which is usually assumed in order to invoke the well known frustrated XY model describing classical Josephson-junction arrays.Comment: 6 pages, 5 figure

Speed and entropy of an interacting continuous time quantum walk

We present some dynamic and entropic considerations about the evolution of a continuous time quantum walk implementing the clock of an autonomous machine. On a simple model, we study in quite explicit terms the Lindblad evolution of the clocked subsystem, relating the evolution of its entropy to the spreading of the wave packet of the clock. We explore possible ways of reducing the generation of entropy in the clocked subsystem, as it amounts to a deficit in the probability of finding the target state of the computation. We are thus lead to examine the benefits of abandoning some classical prejudice about how a clocking mechanism should operate.Comment: 25 pages, 14 figure

Quantum Portfolios

Quantum computation holds promise for the solution of many intractable problems. However, since many quantum algorithms are stochastic in nature they can only find the solution of hard problems probabilistically. Thus the efficiency of the algorithms has to be characterized both by the expected time to completion {\it and} the associated variance. In order to minimize both the running time and its uncertainty, we show that portfolios of quantum algorithms analogous to those of finance can outperform single algorithms when applied to the NP-complete problems such as 3-SAT.Comment: revision includes additional data and corrects minor typo

The Communication Cost of Simulating Bell Correlations

What classical resources are required to simulate quantum correlations? For the simplest and most important case of local projective measurements on an entangled Bell pair state, we show that exact simulation is possible using local hidden variables augmented by just one bit of classical communication. Certain quantum teleportation experiments, which teleport a single qubit, therefore admit a local hidden variables model.Comment: 4 pages, 2 figures; reference adde

Quantum Convolutional Error Correcting Codes

I report two general methods to construct quantum convolutional codes for $N$-state quantum systems. Using these general methods, I construct a quantum convolutional code of rate 1/4, which can correct one quantum error for every eight consecutive quantum registers.Comment: Minor revisions and clarifications. To appear in Phys. Rev.

Quantum phase retrieval of a Rydberg wave packet using a half-cycle pulse

A terahertz half-cycle pulse was used to retrieve information stored as quantum phase in an $N$-state Rydberg atom data register. The register was prepared as a wave packet with one state phase-reversed from the others (the "marked bit"). A half-cycle pulse then drove a significant portion of the electron probability into the flipped state via multimode interference.Comment: accepted by PR