Searcharxiv⌕ Search

arXiv subjects

Charles D. Hill

Publications and source records attributed to Charles D. Hill.

49 records · Page 3Linked to original sources

Spin-guides and spin-splitters: Waveguide analogies in one-dimensional spin chains

Here we show a direct mapping between waveguide theory and spin chain transport, opening an alternative approach to quantum information transport in the solid-state. By applying temporally varying control profiles to a spin chain, we design a virtual waveguide or 'spin-guide' to conduct individual spin excitations along defined space-time trajectories of the chain. We explicitly show that the concepts of confinement, adiabatic bend loss and beamsplitting can be mapped from optical waveguide theory to spin-guides (and hence 'spin-splitters'). Importantly, the spatial scale of applied control pulses is required to be large compared to the inter-spin spacing, and thereby allowing the design of scalable control architectures.

quant-ph↗

Ultra-sensitive Diamond Magnetometry Using Optimal Dynamic Decoupling

New magnetometry techniques based on Nitrogen Vacancy (NV) defects in diamond have received much attention of late as a means to probe nanoscale magnetic environments. The sensitivity of a single NV magnetometer is primarily determined by the transverse spin relaxation time, $T_2$. Current approaches to improving the sensitivity employ crystals with a high NV density at the cost of spatial resolution, or extend $T_2$ via the manufacture of novel isotopically pure diamond crystals. We adopt a complementary approach, in which optimal dynamic decoupling techniques extend coherence times out to the self-correlation time of the spin bath. This suggests single spin, room temperature magnetometer sensitivities as low as 5\,pT\,Hz$^{-1/2}$ with current technology.

quant-ph↗

Surface code quantum communication

Quantum communication typically involves a linear chain of repeater stations, each capable of reliable local quantum computation and connected to their nearest neighbors by unreliable communication links. The communication rate in existing protocols is low as two-way classical communication is used. We show that, if Bell pairs are generated between neighboring stations with a probability of heralded success greater than 0.65 and fidelity greater than 0.96, two-way classical communication can be entirely avoided and quantum information can be sent over arbitrary distances with arbitrarily low error at a rate limited only by the local gate speed. The number of qubits per repeater scales logarithmically with the communication distance. If the probability of heralded success is less than 0.65 and Bell pairs between neighboring stations with fidelity no less than 0.92 are generated only every T_B seconds, the logarithmic resource scaling remains and the communication rate through N links is proportional to 1/(T_B log^2 N).

quant-ph↗

A competitive game whose maximal Nash-equilibrium payoff requires quantum resources for its achievement

While it is known that shared quantum entanglement can offer improved solutions to a number of purely cooperative tasks for groups of remote agents, controversy remains regarding the legitimacy of quantum games in a competitive setting--in particular, whether they offer any advantage beyond what is achievable using classical resources. We construct a competitive game between four players based on the minority game where the maximal Nash-equilibrium payoff when played with the appropriate quantum resource is greater than that obtainable by classical means, assuming a local hidden variable model. The game is constructed in a manner analogous to a Bell inequality. This result is important in confirming the legitimacy of quantum games.

quant-ph↗

Sensing of Fluctuating Nanoscale Magnetic Fields Using NV Centres in Diamond

New magnetometry techniques based on Nitrogen-Vacancy (NV) defects in diamond allow for the imaging of static (DC) and oscillatory (AC) nanoscopic magnetic systems. However, these techniques require accurate knowledge and control of the sample dynamics, and are thus limited in their ability to image fields arising from rapidly fluctuating (FC) environments. We show here that FC fields place restrictions on the DC field sensitivity of an NV qubit magnetometer, and that by probing the dephasing rate of the qubit in a magnetic FC environment, we are able to measure fluctuation rates and RMS field strengths that would be otherwise inaccessible with the use of DC and AC magnetometry techniques. FC sensitivities are shown to be comparable to those of AC fields, whilst requiring no additional experimental overheads or control over the sample.

cond-mat.mes-hall↗

Time evolution of the one-dimensional Jaynes-Cummings-Hubbard Hamiltonian

The Jaynes-Cummings-Hubbard (JCH) system describes a network of single-mode photonic cavities connected via evanescent coupling. Each cavity contains a single two level system which can be tuned in resonance with the cavity. Here we explore the behavior of single excitations (where an excitation can be either photonic or atomic) in the linear JCH system, which describes a coupled cavity waveguide. We use direct, analytic diagonalization of the Hamiltonian to study cases where inter-cavity coupling is either uniform or varies parabolically along the chain. Both excitations located in a single cavity, as well as one excitation as a Gaussian pulse spread over many cavities, are investigated as initial states. We predict unusual behavior of this system in the time domain, including slower than expected propagation of the excitation, and also splitting of the excitation into two distinct pulses, which travel at distinct speeds. In certain limits, we show that the JCH system mimics two Heisenberg spin chains.

quant-ph↗

Universal quantum dynamics from two 2-local Hamiltonians

In this paper, we show that the ability to switch globally between two 2-local Hamiltonians on n qubits is sufficient for achieving universal unitary dynamics on those n qubits. Of the two Hamiltonians used in the construction, one is comprised of nearest-neighbour two-qubit interactions on a one-dimensional chain, the other is comprised of single-qubit interactions. We describe a scheme for choosing the switching times in order to generate arbitrary one- and two-qubit gates on the n qubits. However the switching scheme is inefficient, and we leave as an open problem the question of whether the universality of the Hamiltonians can be exploited in an efficient way.

quant-ph↗

Weak measurement and control of entanglement generation

In this paper we show how weak joint measurement and local feedback can be used to control entanglement generation between two qubits. To do this, we make use of a decoherence free subspace (DFS). Weak measurement and feedback can be used to drive the system into this subspace rapidly. Once within the subspace, feedback can generate entanglement rapidly, or turn off entanglement generation dynamically. We also consider, in the context of weak measurement, some of differences between purification and generating entanglement.

quant-ph↗

Weak measurement and rapid state reduction in bipartite quantum systems

In this paper we consider feedback control algorithms for the rapid purification of a bipartite state consisting of two qubits, when the observer has access to only one of the qubits. We show 1) that the algorithm that maximizes the average purification rate is not the same as that that for a single qubit, and 2) that it is always possible to construct an algorithm that generates a deterministic rate of purification for {\em both} qubits. We also reveal a key difference between projective and continuous measurements with regard to state-purification.

quant-ph↗

Global control and fast solid-state donor electron spin quantum computing

We propose a scheme for quantum information processing based on donor electron spins in semiconductors, with an architecture complementary to the original Kane proposal. We show that a naive implementation of electron spin qubits provides only modest improvement over the Kane scheme, however through the introduction of global gate control we are able to take full advantage of the fast electron evolution timescales. We estimate that the latent clock speed is 100-1000 times that of the nuclear spin quantum computer with the ratio $T_{2}/T_{ops}$ approaching the $10^{6}$ level.

quant-ph↗

Gates for the Kane Quantum Computer in the Presence of Dephasing

In this paper we investigate the effect of dephasing on proposed quantum gates for the solid-state Kane quantum computing architecture. Using a simple model of the decoherence, we find that the typical error in a CNOT gate is $8.3 \times 10^{-5}$. We also compute the fidelities of Z, X, Swap, and Controlled Z operations under a variety of dephasing rates. We show that these numerical results are comparable with the error threshold required for fault tolerant quantum computation.

quant-ph↗

Quantum Error Correction on Linear Nearest Neighbor Qubit Arrays

A minimal depth quantum circuit implementing 5-qubit quantum error correction in a manner optimized for a linear nearest neighbor architecture is described. The canonical decomposition is used to construct fast and simple gates that incorporate the necessary swap operations. Simulations of the circuit's performance when subjected to discrete and continuous errors are presented. The relationship between the error rate of a physical qubit and that of a logical qubit is investigated with emphasis on determining the concatenated error correction threshold.

quant-ph↗

Fast Non-Adiabatic Two Qubit Gates for the Kane Quantum Computer

In this paper we apply the canonical decomposition of two qubit unitaries to find pulse schemes to control the proposed Kane quantum computer. We explicitly find pulse sequences for the CNOT, swap, square root of swap and controlled Z rotations. We analyze the speed and fidelity of these gates, both of which compare favorably to existing schemes. The pulse sequences presented in this paper are theoretically faster, higher fidelity, and simpler than existing schemes. Any two qubit gate may be easily found and implemented using similar pulse sequences. Numerical simulation is used to verify the accuracy of each pulse scheme.

quant-ph↗