arXiv subjects

Theodore J. Yoder

Publications and source records attributed to Theodore J. Yoder.

45 records · Page 3Linked to original sources

arXiv2017

Fixed-Point Adiabatic Quantum Search

Fixed-point quantum search algorithms succeed at finding one of $M$ target items among $N$ total items even when the run time of the algorithm is longer than necessary. While the famous Grover's algorithm can search quadratically faster than a classical computer, it lacks the fixed-point property --- the fraction of target items must be known precisely to know when to terminate the algorithm. Recently, Yoder, Low, and Chuang gave an optimal gate-model search algorithm with the fixed-point property. Meanwhile, it is known that an adiabatic quantum algorithm, operating by continuously varying a Hamiltonian, can reproduce the quadratic speedup of gate-model Grover search. We ask, can an adiabatic algorithm also reproduce the fixed-point property? We show that the answer depends on what interpolation schedule is used, so as in the gate model, there are both fixed-point and non-fixed-point versions of adiabatic search, only some of which attain the quadratic quantum speedup. Guided by geometric intuition on the Bloch sphere, we rigorously justify our claims with an explicit upper bound on the error in the adiabatic approximation. We also show that the fixed-point adiabatic search algorithm can be simulated in the gate model with neither loss of the quadratic Grover speedup nor of the fixed-point property. Finally, we discuss natural uses of fixed-point algorithms such as preparation of a relatively prime state and oblivious amplitude amplification.

quant-ph↗

arXiv2016

Universal fault-tolerant gates on concatenated stabilizer codes

It is an oft-cited fact that no quantum code can support a set of fault-tolerant logical gates that is both universal and transversal. This no-go theorem is generally responsible for the interest in alternative universality constructions including magic state distillation. Widely overlooked, however, is the possibility of non-transversal, yet still fault-tolerant, gates that work directly on small quantum codes. Here we demonstrate precisely the existence of such gates. In particular, we show how the limits of non-transversality can be overcome by performing rounds of intermediate error-correction to create logical gates on stabilizer codes that use no ancillas other than those required for syndrome measurement. Moreover, the logical gates we construct, the most prominent examples being Toffoli and controlled-controlled-Z, often complete universal gate sets on their codes. We detail such universal constructions for the smallest quantum codes, the 5-qubit and 7-qubit codes, and then proceed to generalize the approach. One remarkable result of this generalization is that any nondegenerate stabilizer code with a complete set of fault-tolerant single-qubit Clifford gates has a universal set of fault-tolerant gates. Another is the interaction of logical qubits across different stabilizer codes, which, for instance, implies a broadly applicable method of code switching.

quant-ph↗

arXiv2016

Hamiltonian Simulation with Optimal Sample Complexity

We investigate the sample complexity of Hamiltonian simulation: how many copies of an unknown quantum state are required to simulate a Hamiltonian encoded by the density matrix of that state? We show that the procedure proposed by Lloyd, Mohseni, and Rebentrost [Nat. Phys., 10(9):631--633, 2014] is optimal for this task. We further extend their method to the case of multiple input states, showing how to simulate any Hermitian polynomial of the states provided. As applications, we derive optimal algorithms for commutator simulation and orthogonality testing, and we give a protocol for creating a coherent superposition of pure states, when given sample access to those states. We also show that this sample-based Hamiltonian simulation can be used as the basis of a universal model of quantum computation that requires only partial swap operations and simple single-qubit states.

quant-ph↗

arXiv2014

Fixed-point quantum search with an optimal number of queries

Grover's quantum search and its generalization, quantum amplitude amplification, provide quadratic advantage over classical algorithms for a diverse set of tasks, but are tricky to use without knowing beforehand what fraction $λ$ of the initial state is comprised of the target states. In contrast, fixed-point search algorithms need only a reliable lower bound on this fraction, but, as a consequence, lose the very quadratic advantage that makes Grover's algorithm so appealing. Here we provide the first version of amplitude amplification that achieves fixed-point behavior without sacrificing the quantum speedup. Our result incorporates an adjustable bound on the failure probability, and, for a given number of oracle queries, guarantees that this bound is satisfied over the broadest possible range of $λ$.

quant-ph↗

arXiv2014

Quantum imaging by coherent enhancement

Conventional wisdom dictates that to image the position of fluorescent atoms or molecules, one should stimulate as much emission and collect as many photons as possible. That is, in this classical case, it has always been assumed that the coherence time of the system should be made short, and that the statistical scaling $\sim1/\sqrt{t}$ defines the resolution limit for imaging time $t$. However, here we show in contrast that given the same resources, a long coherence time permits a higher resolution image. In this quantum regime, we give a procedure for determining the position of a single two-level system, and demonstrate that the standard errors of our position estimates scale at the Heisenberg limit as $\sim 1/t$, a quadratic, and notably optimal, improvement over the classical case.

quant-ph↗

arXiv2014

Quantum Inference on Bayesian Networks

Performing exact inference on Bayesian networks is known to be #P-hard. Typically approximate inference techniques are used instead to sample from the distribution on query variables given the values $e$ of evidence variables. Classically, a single unbiased sample is obtained from a Bayesian network on $n$ variables with at most $m$ parents per node in time $\mathcal{O}(nmP(e)^{-1})$, depending critically on $P(e)$, the probability the evidence might occur in the first place. By implementing a quantum version of rejection sampling, we obtain a square-root speedup, taking $\mathcal{O}(n2^mP(e)^{-\frac12})$ time per sample. We exploit the Bayesian network's graph structure to efficiently construct a quantum state, a q-sample, representing the intended classical distribution, and also to efficiently apply amplitude amplification, the source of our speedup. Thus, our speedup is notable as it is unrelativized -- we count primitive operations and require no blackbox oracle queries.

quant-ph↗

arXiv2014

Optimal arbitrarily accurate composite pulse sequences

Implementing a single qubit unitary is often hampered by imperfect control. Systematic amplitude errors $ε$, caused by incorrect duration or strength of a pulse, are an especially common problem. But a sequence of imperfect pulses can provide a better implementation of a desired operation, as compared to a single primitive pulse. We find optimal pulse sequences consisting of $L$ primitive $π$ or $2π$ rotations that suppress such errors to arbitrary order $\mathcal{O}(ε^{n})$ on arbitrary initial states. Optimality is demonstrated by proving an $L=\mathcal{O}(n)$ lower bound and saturating it with $L=2n$ solutions. Closed-form solutions for arbitrary rotation angles are given for $n=1,2,3,4$. Perturbative solutions for any $n$ are proven for small angles, while arbitrary angle solutions are obtained by analytic continuation up to $n=12$. The derivation proceeds by a novel algebraic and non-recursive approach, in which finding amplitude error correcting sequences can be reduced to solving polynomial equations.

quant-ph↗

arXiv2013

Lorentz and CPT violation in the hydrogen spectrum

We have studied the effect of hypothetical violations of Lorentz and CPT symmetry by calculating the corrections to the energy levels of hydrogen induced by the Standard-Model Extension (SME). Hydrogen studies are interesting because the energy levels of hydrogen can be measured with great precision and the theory for hydrogen based on the Standard Model (SM) is well understood. We obtained corrections through order α^2 times the SME parameters for all levels of hydrogen and applied them to determine the SME corrections to the transition frequency for the 2S-1S transition.

hep-ph↗

arXiv2012

Higher order corrections to the hydrogen spectrum from the Standard-Model Extension

We have studied the effects of the Standard-Model Extension (SME) on hydrogen as a realization of new physics effects that incorporate Lorentz and CPT violation. Specifically, we calculated the SME-induced energy level shifts at order $α^2$ times the SME parameters. We obtained contributions at this order both from the non-relativistic effective Hamiltonian for motion of a spin-1/2 particle in the presence of SME interactions and also from SME corrections to the propagator for exchange photons. We applied our result to the $2S-1S$ transition in hydrogen, which has been measured with extremely high precision. The results obtained in this work give the leading SME corrections for this transition.

hep-ph↗