HHHenry L. Haselgrove

Henry L. Haselgrove

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Henry L. Haselgrove has a total of 8 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Noise thresholds for optical cluster-state quantum computation

    by Christopher M. Dawson, Henry L. Haselgrove, Michael A. Nielsen

    In this paper we do a detailed numerical investigation of the fault-tolerant threshold for optical cluster-state quantum computation. Our noise model allows both photon loss and depolarizing noise, as a general proxy for all types of local noise other than photon loss noise. We obtain a threshold region of allowed pairs of values for the two types of noise. Roughly speaking, our results show that scalable optical quantum computing is possible for photon loss probabilities less than 0.003, and for depolarization probabilities less than 0.0001. Our fault-tolerant protocol involves a number of innovations, including a method for syndrome extraction known as telecorrection, whereby repeated syndrome measurements are guaranteed to agree. This paper is an extended version of [Dawson et al., Phys. Rev. Lett. 96, 020501].

  • Noise thresholds for optical cluster-state quantum computation

    by Christopher M. Dawson, Henry L. Haselgrove, Michael A. Nielsen

    In this paper we do a detailed numerical investigation of the fault-tolerant threshold for optical cluster-state quantum computation. Our noise model allows both photon loss and depolarizing noise, as a general proxy for all types of local noise other than photon loss noise. We obtain a threshold region of allowed pairs of values for the two types of noise. Roughly speaking, our results show that scalable optical quantum computing is possible in the combined presence of both noise types, provided that the loss probability is less than 3×10−3 and the depolarization probability is less than 10−4. Our fault-tolerant protocol involves a number of innovations, including a method for syndrome extraction known as telecorrection, whereby repeated syndrome measurements are guaranteed to agree. This paper is an extended version of Dawson et al. [Phys. Rev. Lett. 96, 020501 (2006)].


  • Optimal state encoding for quantum walks and quantum communication over spin systems

    by Henry L. Haselgrove

    Recent work has shown that a simple chain of interacting spins can be used as a medium for high-fidelity quantum communication. We describe a scheme for quantum communication using a spin system that conserves z spin, but otherwise is arbitrary. The sender and receiver are assumed to directly control several spins each, with the sender encoding the message state onto the larger state space of her control spins. Given that the encoding for the “zero” message basis state is chosen to be the all-spin-down state, we show how to find the encoding for the “one” basis state that maximizes the fidelity of communication, using a simple method based on the singular-value decomposition. Also, we show that this solution can be used to increase communication fidelity in a rather different circumstance: where no encoding of initial states is used, but where the sender and receiver control exactly two spins each and vary the interactions on those spins over time. The methods presented are computationally efficient, and numerical examples are given for systems having up to 300 spins.


  • Open Access

    Quantum computing and polynomial equations over the finite field Z_2

    by Christopher M. Dawson, Henry L. Haselgrove, Andrew P. Hines, Duncan Mortimer, Michael A. Nielsen, Tobias J. Osborne

    What is the computational power of a quantum computer? We show that determining the output of a quantum computation is equivalent to counting the number of solutions to an easily computed set of polynomials defined over the finite field Z_2. This connection allows simple proofs to be given for two known relationships between quantum and classical complexity classes.


  • Quantum States far from the Energy Eigenstates of Any Local Hamiltonian

    by Henry L. Haselgrove, Michael A. Nielsen, Tobias J. Osborne

    What quantum states are possible energy eigenstates of a many-body Hamiltonian? Suppose the Hamiltonian is nontrivial, i.e., not a multiple of the identity, and L local, in the sense of containing interaction terms involving at most L bodies, for some fixed L. We construct quantum states ψ which are “far away” from all the eigenstates E of any nontrivial L-local Hamiltonian, in the sense that ‖ψ−E‖ is greater than some constant lower bound, independent of the form of the Hamiltonian.


  • Open Access

    Entanglement, correlations, and the energy gap in many-body quantum systems

    by Henry L. Haselgrove, Michael A. Nielsen, Tobias J. Osborne

    What correlations are present in the ground state of a many-body Hamiltonian? We study the relationship between ground-state correlations, especially entanglement, and the energy gap between the ground and first excited states. We prove several general inequalities which show quantitatively that ground-state correlations between systems not directly coupled by the Hamiltonian necessarily imply a small energy gap.

  • Open Access

    Lower bounds on the complexity of simulating quantum gates

    by Andrew M. Childs, Henry L. Haselgrove, Michael A. Nielsen

    We give a simple proof of a formula for the minimal time required to simulate a two-qubit unitary operation using a fixed two-qubit Hamiltonian together with fast local unitaries. We also note that a related lower bound holds for arbitrary n-qubit gates.

  • Open Access

    On the practicality of time-optimal two-qubit Hamiltonian simulation

    by Henry L. Haselgrove, Michael A. Nielsen, Tobias J. Osborne

    What is the time-optimal way of using a set of control Hamiltonians to obtain a desired interaction? Vidal, Hammerer and Cirac [Phys. Rev. Lett. 88 (2002) 237902] have obtained a set of powerful results characterizing the time-optimal simulation of a two-qubit quantum gate using a fixed interaction Hamiltonian and fast local control over the individual qubits. How practically useful are these results? We prove that there are two-qubit Hamiltonians such that time-optimal simulation requires infinitely many steps of evolution, each infinitesimally small, and thus is physically impractical. A procedure is given to determine which two-qubit Hamiltonians have this property, and we show that almost all Hamiltonians do. Finally, we determine some bounds on the penalty that must be paid in the simulation time if the number of steps is fixed at a finite number, and show that the cost in simulation time is not too great.

  • Open Access

    Quantum states far from the energy eigenstates of any local Hamiltonian

    by Henry L. Haselgrove, Michael A. Nielsen, Tobias J. Osborne

    What quantum states are possible energy eigenstates of a many-body Hamiltonian? Suppose the Hamiltonian is non-trivial, i.e., not a multiple of the identity, and L-local, in the sense of containing interaction terms involving at most L bodies, for some fixed L. We construct quantum states \psi which are ``far away'' from all the eigenstates E of any non-trivial L-local Hamiltonian, in the sense that |\psi-E| is greater than some constant lower bound, independent of the form of the Hamiltonian.