arXiv subjects

Andrew C. Doherty

Publications and source records attributed to Andrew C. Doherty.

At least 55 records · Page 3Linked to original sources

arXiv2013

Convergence of SDP hierarchies for polynomial optimization on the hypersphere

We show how to bound the accuracy of a family of semi-definite programming relaxations for the problem of polynomial optimization on the hypersphere. Our method is inspired by a set of results from quantum information known as quantum de Finetti theorems. In particular, we prove a de Finetti theorem for a special class of real symmetric matrices to establish the existence of approximate representing measures for moment matrix relaxations.

math.OC↗

arXiv2013

Two-Qubit Gates for Resonant Exchange Qubits

A new approach to single-qubit operations using exchange interactions of single electrons in gate-defined quantum dots has recently been demonstrated: the resonant exchange qubit. We show that two-qubit operations, specifically the CPHASE gate, can be performed between resonant exchange qubits very straightforwardly, using a single exchange pulse. This is in marked contrast to the best known protocols for exchange qubits where such a gate requires many pulses so that leakage processes arising from the exchange interaction can be overcome. For resonant exchange qubits a simple two-qubit gate is possible because in this mode of operation energy conservation suppresses leakage.

cond-mat.mes-hall↗

arXiv2013

Minimum requirements for feedback enhanced force sensing

The problem of estimating an unknown force driving a linear oscillator is revisited. When using linear measurement, feedback is often cited as a mechanism to enhance bandwidth or sensitivity. We show that as long as the oscillator dynamics are known, there exists a real-time estimation strategy that reproduces the same measurement record as any arbitrary feedback protocol. Consequently some form of nonlinearity is required to gain any advantage beyond estimation alone. This result holds true in both quantum and classical systems, with non-stationary forces and feedback, and in the general case of non-Gaussian and correlated noise. Recently, feedback enhanced incoherent force sensing has been demonstrated [Nat. Nano. \textbf{7}, 509 (2012)], with the enhancement attributed to a feedback induced modification of the mechanical susceptibility. As a proof-of-principle we experimentally reproduce this result through straightforward filtering.

quant-ph↗

arXiv2013

Strong thermomechanical squeezing via weak measurement

We experimentally surpass the 3dB limit to steady state parametric squeezing of a mechanical oscillator. The localization of a AFM cantilever, achieved by optimal estimation, is enhanced by up to 6.2 dB in one position quadrature when a detuned parametric drive is used. This squeezing is, in principle, limited only by the oscillator Q-factor. Used on low temperature, high frequency oscillators, this technique provides a pathway to achieve robust quantum squeezing below the zero-point motion. Broadly, our results demonstrate that control systems engineering can overcome well established limits in applications of nonlinear processes. Conversely, by localizing the mechanical position to better than the measurement precision of our apparatus, they demonstrate the usefulness of nonlinearities in control applications.

cond-mat.mes-hall↗

arXiv2012

Symmetry protection of measurement-based quantum computation in ground states

The two-dimensional cluster state, a universal resource for measurement-based quantum computation, is also the gapped ground state of a short-ranged Hamiltonian. Here, we examine the effect of perturbations to this Hamiltonian. We prove that, provided the perturbation is sufficiently small and respects a certain symmetry, the perturbed ground state remains a universal resource. We do this by characterising the operation of an adaptive measurement protocol throughout a suitable symmetry-protected quantum phase, relying on generic properties of the phase rather than any analytic control over the ground state.

quant-ph↗

arXiv2012

Position Estimation of a Parametrically Driven Optomechanical System

We study the position estimation of a mechanical oscillator undergoing both detuned parametric amplification and continuous quantum measurement. This model, which can be utilised to produce squeezed states, is applied to a general optoelectromechanical system. Using a stochastic master equation formalism, we derive general formulae for the reduction in position uncertainty of one quadrature of motion. The filter for extracting the optimal position estimate from the measurement record is derived. We also find that since this scheme does not work far into the back-action dominated regime, implementing resolved-sideband cooling improves the squeezing only marginally.

quant-ph↗

arXiv2012

Symmetry-protected phases for measurement-based quantum computation

Ground states of spin lattices can serve as a resource for measurement-based quantum computation. Ideally, the ability to perform quantum gates via measurements on such states would be insensitive to small variations in the Hamiltonian. Here, we describe a class of symmetry-protected topological orders in one-dimensional systems, any one of which ensures the perfect operation of the identity gate. As a result, measurement-based quantum gates can be a robust property of an entire phase in a quantum spin lattice, when protected by an appropriate symmetry.

quant-ph↗

arXiv2011

Mechanical squeezing via parametric amplification and weak measurement

Nonlinear forces allow motion of a mechanical oscillator to be squeezed below the zero-point motion. Of existing methods, mechanical parametric amplification is relatively accessible, but previously thought to be limited to 3dB of squeezing in the steady state. We consider the effect of applying continuous weak measurement and feedback to this system. If the parametric drive is optimally detuned from resonance, correlations between the quadratures of motion allow unlimited steady-state squeezing. Compared to back-action evasion, we demonstrate that the measurement strength, temperature and efficiency requirements for quantum squeezing are significantly relaxed.

quant-ph↗

arXiv2011

Toric codes and quantum doubles from two-body Hamiltonians

We present a procedure to obtain the Hamiltonians of the toric code and Kitaev quantum double models as the low-energy limits of entirely two-body Hamiltonians. Our construction makes use of a new type of perturbation gadget based on error-detecting subsystem codes. The procedure is motivated by a PEPS description of the target models, and reproduces the target models' behavior using only couplings which are natural in terms of the original Hamiltonians. This allows our construction to exactly capture the symmetries of the target models.

quant-ph↗

arXiv2011

A time-dependent Tsirelson's bound from limits on the rate of information gain in quantum systems

We consider the problem of distinguishing between a set of arbitrary quantum states in a setting in which the time available to perform the measurement is limited. We provide simple upper bounds on how well we can perform state discrimination in a given time as a function of either the average energy or the range of energies available during the measurement. We exhibit a specific strategy that nearly attains this bound. Finally, we consider several applications of our result. First, we obtain a time-dependent Tsirelson's bound that limits the extent of the Bell inequality violation that can be in principle be demonstrated in a given time t. Second, we obtain a Margolus-Levitin type bound when considering the special case of distinguishing orthogonal pure states.

quant-ph↗

arXiv2009

Transitions in the computational power of thermal states for measurement-based quantum computation

We show that the usefulness of the thermal state of a specific spin-lattice model for measurement-based quantum computing exhibits a transition between two distinct "phases" - one in which every state is a universal resource for quantum computation, and another in which any local measurement sequence can be simulated efficiently on a classical computer. Remarkably, this transition in computational power does not coincide with any phase transition, classical or quantum, in the underlying spin-lattice model.

quant-ph↗

arXiv2009

Identifying phases of quantum many-body systems that are universal for quantum computation

Quantum computation can proceed solely through single-qubit measurements on an appropriate quantum state, such as the ground state of an interacting many-body system. We investigate a simple spin-lattice system based on the cluster-state model, and by using nonlocal correlation functions that quantify the fidelity of quantum gates performed between distant qubits, we demonstrate that it possesses a quantum (zero-temperature) phase transition between a disordered phase and an ordered "cluster phase" in which it is possible to perform a universal set of quantum gates.

quant-ph↗

arXiv2009

Symmetric extension in two-way quantum key distribution

We introduce symmetric extensions of bipartite quantum states as a tool for analyzing protocols that distill secret key from quantum correlations. Whether the correlations are coming from a prepare-and-measure quantum key distribution scheme or from an entanglement-based scheme, the protocol has to produce effective states without a symmetric extension in order to succeed. By formulating the symmetric extension problem as a semidefinite program, we solve the problem for Bell-diagonal states. Applying this result to the six-state and BB84 schemes, we show that for the entangled states that cannot be distilled by current key distillation procedures, the failure can be understood in terms of a failure to break a symmetric extension.

quant-ph↗

arXiv2009

Thresholds for topological codes in the presence of loss

Many proposals for quantum information processing are subject to detectable loss errors. In this paper, we show that topological error correcting codes, which protect against computational errors, are also extremely robust against losses. We present analytical results showing the maximum tolerable loss rate is 50 %, which is determined by the square-lattice bond percolation threshold. This saturates the bound set by the no-cloning theorem. Our numerical results support this, and show a graceful trade-off between computational and loss errors.

quant-ph↗

arXiv2009

Characterizing measurement-based quantum gates in quantum many-body systems using correlation functions

In measurement-based quantum computation (MBQC), local adaptive measurements are performed on the quantum state of a lattice of qubits. Quantum gates are associated with a particular measurement sequence, and one way of viewing MBQC is that such a measurement sequence prepares a resource state suitable for `gate teleportation'. We demonstrate how to quantify the performance of quantum gates in MBQC by using correlation functions on the pre-measurement resource state.

quant-ph↗

arXiv2009

First order phase transition in the anisotropic quantum orbital compass model

We investigate the anisotropic quantum orbital compass model on an infinite square lattice by means of the infinite projected entangled-pair state algorithm. For varying values of the $J_x$ and $J_z$ coupling constants of the model, we approximate the ground state and evaluate quantities such as its expected energy and local order parameters. We also compute adiabatic time evolutions of the ground state, and show that several ground states with different local properties coexist at $J_x = J_z$. All our calculations are fully consistent with a first order quantum phase transition at this point, thus corroborating previous numerical evidence. Our results also suggest that tensor network algorithms are particularly fitted to characterize first order quantum phase transitions.

cond-mat.str-el↗

arXiv2008

A lower bound on the dimension of a quantum system given measured data

We imagine an experiment on an unknown quantum mechanical system in which the system is prepared in various ways and a range of measurements are performed. For each measurement M and preparation rho the experimenter can determine, given enough time, the probability of a given outcome a: p(a|M,rho). How large does the Hilbert space of the quantum system have to be in order to allow us to find density matrices and measurement operators that will reproduce the given probability distribution? In this note, we prove a simple lower bound for the dimension of the Hilbert space. The main insight is to relate this problem to the construction of quantum random access codes, for which interesting bounds on Hilbert space dimension already exist. We discuss several applications of our result to hidden variable, or ontological models, to Bell inequalities and to properties of the smooth min-entropy.

quant-ph↗

arXiv2008

Understanding photonic quantum-logic gates: The road to fault tolerance

Fault-tolerant quantum computing requires gates which function correctly despite the presence of errors, and are scalable if the error probability-per-gate is below a threshold value. To date, no method has been described for calculating this probability from measurements on a gate. Here we introduce a technique enabling quantitative benchmarking of quantum-logic gates against fault-tolerance thresholds for any architecture. We demonstrate our technique experimentally using a photonic entangling-gate. The relationship between experimental errors and their quantum logic effect is non-trivial: revealing this relationship requires a comprehensive theoretical model of the quantum-logic gate. We show the first such model for any architecture, and find multi-photon emission--a small effect previously regarded as secondary to mode-mismatch--to be the dominant source of logic error. We show that reducing this will move photonic quantum computing to within striking distance of fault-tolerance.

quant-ph↗