arXiv subjects

Simon J. Devitt

Publications and source records attributed to Simon J. Devitt.

60 records · Page 4Linked to original sources

arXiv2006

Precision characterisation of two-qubit Hamiltonians via entanglement mapping

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 the Hamiltonian in this way is possible as the coefficients of each operator control the oscillation frequencies of the entanglement function. The number of measurements required to achieve a given precision in the Hamiltonian parameters is determined and an efficient measurement strategy designed. We derive the relationship between the number of measurements, the resulting precision and the ultimate discrete error probability generated by a systematic mis-characterisation, when implementing two-qubit gates for quantum computing.

quant-ph↗

arXiv2006

Scalable Error Correction in Distributed Ion Trap Computers

A major challenge for quantum computation in ion trap systems is scalable integration of error correction and fault tolerance. We analyze a distributed architecture with rapid high fidelity local control within nodes and entangled links between nodes alleviating long-distance transport. We demonstrate fault-tolerant operator measurements which are used for error correction and non-local gates. This scheme is readily applied to linear ion traps which cannot be scaled up beyond a few ions per individual trap but which have access to a probabilistic entanglement mechanism. A proof-of-concept system is presented which is within the reach of current experiment.

quant-ph↗

arXiv2006

Robustness of Shor's algorithm

Shor's factorisation algorithm is a combination of classical pre- and post-processing and a quantum period finding (QPF) subroutine which allows an exponential speed up over classical factoring algorithms. We consider the stability of this subroutine when exposed to a discrete error model that acts to perturb the computational trajectory of a quantum computer. Through detailed state vector simulations of an appropriate quantum circuit, we show that the error locations within the circuit itself heavily influences the probability of success of the QPF subroutine. The results also indicate that the naive estimate of required component precision is too conservative.

quant-ph↗

arXiv2005

Scheme for direct measurement of a general two-qubit Hamiltonian

The construction of two-qubit gates appropriate for universal quantum computation is of enormous importance to quantum information processing. Building such gates is dependent on accurate knowledge of the interaction dynamics between two qubit systems. This letter will present a systematic method for reconstructing the full two-qubit interaction Hamiltonian through experimental measures of concurrence. This not only gives a convenient method for constructing two qubit quantum gates, but can also be used to experimentally determine various Hamiltonian parameters in physical systems. We show explicitly how this method can be employed to determine the first and second order spin-orbit corrections to the exchange coupling in quantum dots.

quant-ph↗

arXiv2005

Quantum information transport to multiple receivers

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 transportation of a qubit, operator measurements and entanglement, using a 1-D array of quantum sites with a single sender (Alice) and multiple receivers (Bobs). Alice need not know which Bob is the receiver, and if several Bobs try to receive the signal, they obtain a superposition state which can be used to realize two-qubit operator measurements for the generation of maximally entangled states.

quant-ph↗

arXiv2004

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

Shor's algorithm, which given appropriate hardware can factorise an integer $N$ in a time polynomial in its binary length $L$, has arguable spurred the race to build a practical quantum computer. Several different quantum circuits implementing Shor's algorithm have been designed, but each tacitly assumes that arbitrary pairs of qubits within the computer can be interacted. While some quantum computer architectures possess this property, many promising proposals are best suited to realising a single line of qubits with nearest neighbour interactions only. In light of this, we present a circuit implementing Shor's factorisation algorithm designed for such a linear nearest neighbour architecture. Despite the interaction restrictions, the circuit requires just $2L+4$ qubits and to first order requires $8L^{4}$ gates arranged in a circuit of depth $32L^{3}$ -- identical to first order to that possible using an architecture that can interact arbitrary pairs of qubits.

quant-ph↗