arXiv subjects

Emanuel Knill

Publications and source records attributed to Emanuel Knill.

At least 55 records · Page 3Linked to original sources

arXiv2014

Optimizing Passive Quantum Clocks

We describe protocols for passive atomic clocks based on quantum interrogation of the atoms. Unlike previous techniques, our protocols are adaptive and take advantage of prior information about the clock's state. To reduce deviations from an ideal clock, each interrogation is optimized by means of a semidefinite program for atomic state preparation and measurement whose objective function depends on the prior information. Our knowledge of the clock's state is maintained according to a Bayesian model that accounts for noise and measurement results. We implement a full simulation of a running clock with power-law noise models and find significant improvements by applying our techniques.

quant-ph↗

arXiv2013

Efficient quantification of experimental evidence against local realism

Tests of local realism and their applications aim for very high confidence in their results even in the presence of potentially adversarial effects. For this purpose, one can measure a quantity that reflects the amount of violation of local realism and determine a bound on the probability, according to local realism, of obtaining a violation at least that observed. In general, it is difficult to obtain sufficiently robust and small bounds. Here we describe an efficient protocol for computing such bounds from any set of Bell inequalities for any number of parties, measurement settings, or outcomes. The protocol can be applied to tests of other properties (such as entanglement or dimensionality) that are witnessed by linear inequalities.

quant-ph↗

arXiv2012

Gradient-based stopping rules for maximum-likelihood quantum-state tomography

When performing maximum-likelihood quantum-state tomography, one must find the quantum state that maximizes the likelihood of the state given observed measurements on identically prepared systems. The optimization is usually performed with iterative algorithms. This paper provides a gradient-based upper bound on the ratio of the true maximum likelihood and the likelihood of the state of the current iteration, regardless of the particular algorithm used. This bound is useful for formulating stopping rules for halting iterations of maximization algorithms. We discuss such stopping rules in the context of determining confidence regions from log-likelihood differences when the differences are approximately chi-squared distributed.

quant-ph↗

arXiv2012

Magic-state distillation with the four-qubit code

The distillation of magic states is an often-cited technique for enabling universal quantum computing once the error probability for a special subset of gates has been made negligible by other means. We present a routine for magic-state distillation that reduces the required overhead for a range of parameters of practical interest. Each iteration of the routine uses a four-qubit error-detecting code to distill the +1 eigenstate of the Hadamard gate at a cost of ten input states per two improved output states. Use of this routine in combination with the 15-to-1 distillation routine described by Bravyi and Kitaev allows for further improvements in overhead.

quant-ph↗

arXiv2011

Asymptotically optimal data analysis for rejecting local realism

Reliable experimental demonstrations of violations of local realism are highly desirable for fundamental tests of quantum mechanics. One can quantify the violation witnessed by an experiment in terms of a statistical p-value, which can be defined as the maximum probability according to local realism of a violation at least as high as that witnessed. Thus, high violation corresponds to small p-value. We propose a prediction-based-ratio (PBR) analysis protocol whose p-values are valid even if the prepared quantum state varies arbitrarily and local realistic models can depend on previous measurement settings and outcomes. It is therefore not subject to the memory loophole [J. Barrett et al., Phys. Rev. A 66, 042111 (2002)]. If the prepared state does not vary in time, the p-values are asymptotically optimal. For comparison, we consider protocols derived from the number of standard deviations of violation of a Bell inequality and from martingale theory [R. Gill, arXiv:quant-ph/0110137]. We find that the p-values of the former can be too small and are therefore not statistically valid, while those derived from the latter are sub-optimal. PBR p-values do not require a predetermined Bell inequality and can be used to compare results from different tests of local realism independent of experimental details.

quant-ph↗

arXiv2011

Generation of degenerate, factorizable, pulsed squeezed light at telecom wavelengths

We characterize a periodically poled KTP crystal that produces an entangled, two-mode, squeezed state with orthogonal polarizations, nearly identical, factorizable frequency modes, and few photons in unwanted frequency modes. We focus the pump beam to create a nearly circular joint spectral probability distribution between the two modes. After disentangling the two modes, we observe Hong-Ou-Mandel interference with a raw (background corrected) visibility of 86 % (95 %) when an 8.6 nm bandwidth spectral filter is applied. We measure second order photon correlations of the entangled and disentangled squeezed states with both superconducting nanowire single-photon detectors and photon-number-resolving transition-edge sensors. Both methods agree and verify that the detected modes contain the desired photon number distributions.

quant-ph↗

arXiv2011

Improving Quantum Clocks via Semidefinite Programming

The accuracies of modern quantum logic clocks have surpassed those of standard atomic fountain clocks. These clocks also provide a greater degree of control, because before and after clock queries, we are able to apply chosen unitary operations and measurements. Here, we take advantage of these choices and present a numerical technique designed to increase the accuracy of these clocks. We use a greedy approach, minimizing the phase variance of a noisy classical oscillator with respect to a perfect frequency standard after an interrogation step; we do not optimize over successive interrogations or the probe times. We consider arbitrary prior frequency knowledge and compare clocks with varying numbers of ions and queries interlaced with unitary control. Our technique is based on the semidefinite programming formulation of quantum query complexity, a method first developed in the context of deriving algorithmic lower bounds. The application of semidefinite programming to an inherently continuous problem like that considered here requires discretization; we derive bounds on the error introduced and show that it can be made suitably small.

quant-ph↗

arXiv2011

Generation of Optical Coherent State Superpositions by Number-Resolved Photon Subtraction from Squeezed Vacuum

We have created heralded coherent state superpositions (CSS), by subtracting up to three photons from a pulse of squeezed vacuum light. To produce such CSSs at a sufficient rate, we used our high-efficiency photon-number-resolving transition edge sensor to detect the subtracted photons. This is the first experiment enabled by and utilizing the full photon-number-resolving capabilities of this detector. The CSS produced by three-photon subtraction had a mean photon number of 2.75 -0.24/+0.06 and a fidelity of 0.59 -0.14/+0.04 with an ideal CSS. This confirms that subtracting more photons results in higher-amplitude CSSs.

quant-ph↗

arXiv2010

The statistical strength of experiments to reject local realism with photon pairs and inefficient detectors

Because of the fundamental importance of Bell's theorem, a loophole-free demonstration of a violation of local realism (LR) is highly desirable. Here, we study violations of LR involving photon pairs. We quantify the experimental evidence against LR by using measures of statistical strength related to the Kullback-Leibler (KL) divergence, as suggested by van Dam et al. [W. van Dam, R. Gill and P. Grunwald, IEEE Trans. Inf. Theory. 51, 2812 (2005)]. Specifically, we analyze a test of LR with entangled states created from two independent polarized photons passing through a polarizing beam splitter. We numerically study the detection efficiency required to achieve a specified statistical strength for the rejection of LR depending on whether photon counters or detectors are used. Based on our results, we find that a test of LR free of the detection loophole requires photon counters with efficiencies of at least 89.71%, or photon detectors with efficiencies of at least 91.11%. For comparison, we also perform this analysis with ideal unbalanced Bell states, which are known to allow rejection of LR with detector efficiencies above 2/3.

quant-ph↗

arXiv2009

Restrictions on Transversal Encoded Quantum Gate Sets

Transversal gates play an important role in the theory of fault-tolerant quantum computation due to their simplicity and robustness to noise. By definition, transversal operators do not couple physical subsystems within the same code block. Consequently, such operators do not spread errors within code blocks and are, therefore, fault tolerant. Nonetheless, other methods of ensuring fault tolerance are required, as it is invariably the case that some encoded gates cannot be implemented transversally. This observation has led to a long-standing conjecture that transversal encoded gate sets cannot be universal. Here we show that the ability of a quantum code to detect an arbitrary error on any single physical subsystem is incompatible with the existence of a universal, transversal encoded gate set for the code.

quant-ph↗

arXiv2006

Optimal Quantum Measurements of Expectation Values of Observables

Experimental characterizations of a quantum system involve the measurement of expectation values of observables for a preparable state |psi> of the quantum system. Such expectation values can be measured by repeatedly preparing |psi> and coupling the system to an apparatus. For this method, the precision of the measured value scales as 1/sqrt(N) for N repetitions of the experiment. For the problem of estimating the parameter phi in an evolution exp(-i phi H), it is possible to achieve precision 1/N (the quantum metrology limit) provided that sufficient information about H and its spectrum is available. We consider the more general problem of estimating expectations of operators A with minimal prior knowledge of A. We give explicit algorithms that approach precision 1/N given a bound on the eigenvalues of A or on their tail distribution. These algorithms are particularly useful for simulating quantum systems on quantum computers because they enable efficient measurement of observables and correlation functions. Our algorithms are based on a method for efficiently measuring the complex overlap of |psi> and U|psi>, where U is an implementable unitary operator. We explicitly consider the issue of confidence levels in measuring observables and overlaps and show that, as expected, confidence levels can be improved exponentially with linear overhead. We further show that the algorithms given here can typically be parallelized with minimal increase in resource usage.

quant-ph↗

arXiv2006

Efficient solvability of Hamiltonians and limits on the power of some quantum computational models

We consider quantum computational models defined via a Lie-algebraic theory. In these models, specified initial states are acted on by Lie-algebraic quantum gates and the expectation values of Lie algebra elements are measured at the end. We show that these models can be efficiently simulated on a classical computer in time polynomial in the dimension of the algebra, regardless of the dimension of the Hilbert space where the algebra acts. Similar results hold for the computation of the expectation value of operators implemented by a gate-sequence. We introduce a Lie-algebraic notion of generalized mean-field Hamiltonians and show that they are efficiently ("exactly") solvable by means of a Jacobi-like diagonalization method. Our results generalize earlier ones on fermionic linear optics computation and provide insight into the source of the power of the conventional model of quantum computation.

quant-ph↗

arXiv2005

Random decoupling schemes for quantum dynamical control and error suppression

We present a general control-theoretic framework for constructing and analyzing random decoupling schemes, applicable to quantum dynamical control of arbitrary finite-dimensional composite systems. The basic idea is to design the control propagator according to a random rather than deterministic path on a group. We characterize the performance of random decoupling protocols, and identify control scenarios where they can significantly weaken time scale requirements as compared to cyclic counterparts. Implications for reliable quantum computation are discussed.

quant-ph↗

arXiv2004

Entanglement as an Observer-Dependent Concept: An Application to Quantum Phase Transitions

This paper addresses the following main question: Do we have a theoretical understanding of entanglement applicable to a full variety of physical settings? It is clear that not only the assumption of distinguishability, but also the few-subsystem scenario, are too narrow to embrace all possible physical settings. In particular, the need to go beyond the traditional subsystem-based framework becomes manifest when one tries to apply the conventional concept of entanglement to the physics of matter, since the constituents of a quantum many-body system are indistinguishable particles. We shall discuss here a notion of generalized entanglement, which can be applied to any operator language (fermions, bosons, spins, etc.) used to describe a physical system and which includes the conventional entanglement settings introduced to date in a unified fashion. This is realized by noticing that entanglement is an observer-dependent concept, whose properties are determined by the expectations of a distinguished set of observables without reference to a preferred subsystem decomposition, i.e., it depends on the physically relevant point of view. This viewpoint depends in turn upon the relationship between different sets of observables that determine our ability to control the system of interest. Indeed, the extent to which entanglement is present depends on the observables used to measure a system and describe its states. This represents a most conspicuous advantage as will be highlighted by the condensed-matter application we will discuss.

quant-ph↗

arXiv2004

Nature and Measure of Entanglement in Quantum Phase Transitions

Characterizing and quantifying quantum correlations in states of many-particle systems is at the core of a full understanding of phase transitions in matter. In this work, we continue our investigation of the notion of generalized entanglement [Barnum et al. Phys. Rev. A 68, 032308 (2003)] by focusing on a simple Lie-algebraic measure of purity of a quantum state relative to an observable set. For the algebra of local observables on multi-qubit systems, the resulting local purity measure is equivalent to a recently introduced global entanglement measure [Meyer and Wallach, J. Math. Phys. 43, 4273 (2002)]. In the condensed-matter setting, the notion of Lie-algebraic purity is exploited to identify and characterize the quantum phase transitions present in two exactly solvable models: the Lipkin-Meshkov-Glick model, and the spin-1/2 anisotropic XY model in a transverse magnetic field. For the latter, we argue that a natural fermionic observable-set arising after the Jordan-Wigner transformation, better characterizes the transition than alternative measures based on qubits. This illustrates the usefulness of going beyond the standard subsystem-based framework while providing a global disorder parameter for this model. Our results show how generalized entanglement leads to useful tools for distinguishing between the ordered and disordered phases in the case of broken symmetry quantum phase transitions. Additional implications and possible extensions of concepts to other systems of interest in condensed matter physics are also discussed.

quant-ph↗

arXiv2004

Entanglement beyond subsystems

We present a notion of generalized entanglement which goes beyond the conventional definition based on quantum subsystems. This is accomplished by directly defining entanglement as a property of quantum states relative to a distinguished set of observables singled out by Physics. While recovering standard entanglement as a special case, our notion allows for substantially broader generality and flexibility, being applicable, in particular, to situations where existing tools are not directly useful.

quant-ph↗

arXiv2004

The quantum query complexity of the hidden subgroup problem is polynomial

We present a quantum algorithm which identifies with certainty a hidden subgroup of an arbitrary finite group G in only a polynomial (in log |G|) number of calls to the oracle. This is exponentially better than the best classical algorithm. However our quantum algorithm requires exponential time, as in the classical case. Our algorithm utilizes a new technique for constructing error-free algorithms for non-decision problems on quantum computers.

quant-ph↗

arXiv2003

A subsystem-independent generalization of entanglement

We introduce a generalization of entanglement based on the idea that entanglement is relative to a distinguished subspace of observables rather than a distinguished subsystem decomposition. A pure quantum state is entangled relative to such a subspace if its expectations are a proper mixture of those of other states. Many information-theoretic aspects of entanglement can be extended to the general setting, suggesting new ways of measuring and classifying entanglement in multipartite systems. By going beyond the distinguishable-subsystem framework, generalized entanglement also provides novel tools for probing quantum correlations in interacting many-body systems.

quant-ph↗