Searcharxiv⌕ Search

arXiv subjects

J. A. Jones

Publications and source records attributed to J. A. Jones.

At least 19 recordsLinked to original sources
arXiv2020

Drive-noise tolerant optical switching inspired by composite pulses

Electro-optic modulators within Mach--Zehnder interferometers are a common construction for optical switches in integrated photonics. A challenge faced when operating at high switching speeds is that noise from the electronic drive signals will effect switching performance. Inspired by the Mach--Zehnder lattice switching devices of Van Campenhout et al. [Opt. Express, 17, 23793 (2009)] and techniques from the field of Nuclear Magnetic Resonance known as composite pulses, we present switches which offer protection against drive-noise in both the on and off state of the switch for both the phase and intensity information encoded in the switched optical mode.

physics.app-ph↗
arXiv2020

Cross-verification of independent quantum devices

Quantum computers are on the brink of surpassing the capabilities of even the most powerful classical computers. This naturally raises the question of how one can trust the results of a quantum computer when they cannot be compared to classical simulation. Here we present a verification technique that exploits the principles of measurement-based quantum computation to link quantum circuits of different input size, depth, and structure. Our approach enables consistency checks of quantum computations within a device, as well as between independent devices. We showcase our protocol by applying it to five state-of-the-art quantum processors, based on four distinct physical architectures: nuclear magnetic resonance, superconducting circuits, trapped ions, and photonics, with up to 6 qubits and 200 distinct circuits.

quant-ph↗
arXiv2012

Implementing quantum logic gates with GRAPE: principles and practicalities

We briefly describe the use of GRAPE pulses to implement quantum logic gates in NMR quantum computers, and discuss a range of simple extensions to the core technique. We then consider a range of difficulties which can arise in practical implementations of GRAPE sequences, reflecting non-idealities in the experimental systems used.

quant-ph↗
arXiv2011

Comment on "The Jones-Hore theory of radical-ion-pair reactions is not self-consistent" (arXiv:1010.3888v3)

A short comment on "The Jones-Hore theory of radical-ion-pair reactions is not self-consistent" (arXiv:1010.3888v3) is presented. In the comment, it is pointed out that the paper includes a misconception about the Jones-Hore approach in Chem. Phys. Lett. 488 (2010) 90-93. The re-formulation is presented and it is demonstrated that the Jones-Hore theory is consistent at least on the point claimed by I. K. Kominis in the paper.

quant-ph↗
arXiv2007

Comment on "NMR Experiment Factors Numbers with Gauss Sums"

Mehring et al. have recently described an elegant nuclear magnetic resonance (NMR) experiment implementing an algorithm to factor numbers based on the properties of Gauss sums. Similar experiments have also been described by Mahesh et al. In fact these algorithms do not factor numbers directly, but rather check whether a trial integer $\ell$ is a factor of a given integer $N$. Here I show that these NMR schemes cannot be used for factor checking without first implicitly determining whether or not $\ell$ is a factor of $N$.

quant-ph↗
arXiv2005

Sharing Polarization within Quantum Subspaces

Given an ensemble of n spins, at least some of which are partially polarized, we investigate the sharing of this polarization within a subspace of k spins. We assume that the sharing results in a pseudopure state, characterized by a single purity parameter which we call the bias. As a concrete example we consider ensembles of spin-1/2 nuclei in liquid-state nuclear magnetic resonance (NMR) systems. The shared bias levels are compared with some current entanglement bounds to determine whether the reduced subspaces can give rise to entangled states.

quant-ph↗
arXiv2005

Compiling gate networks on an Ising quantum computer

Here we describe a simple mechanical procedure for compiling a quantum gate network into the natural gates (pulses and delays) for an Ising quantum computer. The aim is not necessarily to generate the most efficient pulse sequence, but rather to develop an efficient compilation algorithm that can be easily implemented in large spin systems. The key observation is that it is not always necessary to refocus all the undesired couplings in a spin system. Instead the coupling evolution can simply be tracked and then corrected at some later time. Although described within the language of NMR the algorithm is applicable to any design of quantum computer based on Ising couplings.

quant-ph↗
arXiv2004

Practical Implementations of Twirl Operations

Twirl operations, which convert impure singlet states into Werner states, play an important role in many schemes for entanglement purification. In this paper we describe strategies for implementing twirl operations, with an emphasis on methods suitable for ensemble quantum information processors such as nuclear magnetic resonance (NMR) quantum computers. We implement our twirl operation on a general two-spin mixed state using liquid state NMR techniques, demonstrating that we can obtain the singlet Werner state with high fidelity.

quant-ph↗
arXiv2004

Implementing Grover's Quantum Search on a Para-Hydrogen based Pure State NMR Quantum Computer

We demonstrate the implementation of Grover's quantum search algorithm on a liquid state nuclear magnetic resonance (NMR) quantum computer using essentially pure states. This was achieved using a two qubit device where the initial state is an essentially pure ($ε=1.06\pm0.04$) singlet nuclear spin state of a pair of 1H nuclei arising from a chemical reaction involving para-hydrogen. We have implemented Grover's search to find one of four inputs which satisfies a function.

quant-ph↗
arXiv2004

Implementation of NMR quantum computation with para-hydrogen derived high purity quantum states

We demonstrate the first implementation of a quantum algorithm on a liquid state nuclear magnetic resonance (NMR) quantum computer using almost pure states. This was achieved using a two qubit device where the initial state is an almost pure singlet nuclear spin state of a pair of 1H nuclei arising from a chemical reaction involving para-hydrogen. We have implemented Deutsch's algorithm for distinguishing between constant and balanced functions with a single query.

quant-ph↗
arXiv2004

Preparing high purity initial states for nuclear magnetic resonance quantum computing

Here we demonstrate how para-hydrogen can be used to prepare a two-spin system in an almost pure state which is suitable for implementing nuclear magnetic resonance (NMR) quantum computation. A 12ns laser pulse is used to initiate a chemical reaction involving pure para-hydrogn (the nuclear spin singlet of H2). The product, formed on the microsecond timescale, contains a hydrogen derived two-spin system with an effective spin-state purity of 0.916. To achieve a comparable result by direct cooling would require an unmanageable (in the liquid state) effective spin temperature of 6.4mK or an impractical magnetic field of 0.45MT at room temperature. The resulting spin state has an entanglement of formation of 0.822 and cannot be described by local hidden variable models.

quant-ph↗
arXiv2002

Tackling Systematic Errors in Quantum Logic Gates with Composite Rotations

We describe the use of composite rotations to combat systematic errors in single qubit quantum logic gates and discuss three families of composite rotations which can be used to correct off-resonance and pulse length errors. Although developed and described within the context of NMR quantum computing these sequences should be applicable to any implementation of quantum computation.

quant-ph↗
arXiv2002

Fidelity of Single Qubit Maps

We describe a simple way of characterizing the average fidelity between a unitary (or anti-unitary) operator and a general operation on a single qubit, which only involves calculating the fidelities for a few pure input states, and discuss possible applications to experimental techniques including Nuclear Magnetic Resonance (NMR).

quant-ph↗
arXiv2001

Quantum Computing and Nuclear Magnetic Resonance

Quantum information processing is the use of inherently quantum mechanical phenomena to perform information processing tasks that cannot be achieved using conventional classical information technologies. One famous example is quantum computing, which would permit calculations to be performed that are beyond the reach of any conceivable conventional computer. Initially it appeared that actually building a quantum computer would be extremely difficult, but in the last few years there has been an explosion of interest in the use of techniques adapted from conventional liquid state nuclear magnetic resonance (NMR) experiments to build small quantum computers. After a brief introduction to quantum computing I will review the current state of the art, describe some of the topics of current interest, and assess the long term contribution of NMR studies to the eventual implementation of practical quantum computers capable of solving real computational problems.

quant-ph↗
arXiv2001

Fidelity of Single Qubit Maps

We give a simple way of characterising the average fidelity between a unitary and a general operation on a single qubit which only involves calculating the fidelities for a few pure input states.

quant-ph↗
arXiv2000

NMR Quantum Computation

In this article I will describe how NMR techniques may be used to build simple quantum information processing devices, such as small quantum computers, and show how these techniques are related to more conventional NMR experiments.

quant-ph↗