most citedIdentifying an Experimental Two-State Hamiltonian to Arbitrary Accuracy

87 citations · 201 across the 4 of their papers we have counts for

collaborators
Showing quant-phShow all

7 papers · 1 filter

quant-ph200543 cited

Identifying a Two-State Hamiltonian in the Presence of Decoherence

Jared H. Cole, Andrew D. Greentree, Daniel K. L. Oi +3

Mapping the system evolution of a two-state system allows the determination of the effective system Hamiltonian directly. We show how this can be achieved even if the system is dec…

quant-ph200520 cited

Precision characterisation of two-qubit Hamiltonians via entanglement mapping

Jared H. Cole, Simon J. Devitt, Lloyd C. L. Hollenberg

We show that the general Heisenberg Hamiltonian with non-uniform couplings can be characterised by mapping the entanglement it generates as a function of time. Identification of th…

quant-ph200551 cited

Quantum information transport to multiple receivers

Andrew D. Greentree, Simon J. Devitt, Lloyd C. L. Hollenberg

The importance of transporting quantum information and entanglement with high fidelity cannot be overemphasized. We present a scheme based on adiabatic passage that allows for tran…

quant-ph200587 cited

Identifying an Experimental Two-State Hamiltonian to Arbitrary Accuracy

Jared H. Cole, Sonia G. Schirmer, Andrew D. Greentree +3

Precision control of a quantum system requires accurate determination of the effective system Hamiltonian. We develop a method for estimating the Hamiltonian parameters for some un…

quant-ph20044 cited

An algorithm for simulating the Ising model on a type-II quantum computer

J. H. Cole, L. C. L. Hollenberg, S. Prawer

Presented here is an algorithm for a type-II quantum computer which simulates the Ising model in one and two dimensions. It is equivalent to the Metropolis Monte-Carlo method and t…

quant-ph20043 cited

Implementation of Shor's Algorithm on a Linear Nearest Neighbour Qubit Array

Austin G. Fowler, Simon J. Devitt, Lloyd C. L. Hollenberg

Shor's algorithm, which given appropriate hardware can factorise an integer in a time polynomial in its binary length , has arguable spurred the race to build a practical qu…