arXiv subjects

Simon C. Benjamin

Publications and source records attributed to Simon C. Benjamin.

At least 91 records · Page 5Linked to original sources

arXiv2008

Large Spin Entangled Current from a Passive Device

We show that a large entangled current can be produced from a very simple passive device: a cluster of three resonant quantum dots, tunnel coupled to one input lead and two output leads. The device can function in a `clean' mode, when almost all emitted electrons are paired in Bell states, or a `dirty' mode with a far higher emission rate but a significant portion of non-entangled electrons. Subsequent charge detection can enhance performance by identifying the pairs that are most likely to be entangled. The device is robust to specific choice of system parameters and therefore lends itself to immediate experimental demonstration. Applications include quantum repeaters and unconditionally secure interfaces.

quant-ph↗

arXiv2008

Measurement based entanglement under conditions of extreme photon loss

The act of measuring optical emissions from two remote qubits can entangle them. By demanding that a photon from each qubit reaches the detectors, one can ensure than no photon was lost. But the failure rate then rises quadratically with loss probability. In [1] this resulted in 30 successes per billion attempts. We describe a means to exploit the low grade entanglement heralded by the detection of a lone photon: A subsequent perfect operation is quickly achieved by consuming this noisy resource. We require only two qubits per node, and can tolerate both path length variation and loss asymmetry. The impact of photon loss upon the failure rate is then linear; realistic high-loss devices can gain orders of magnitude in performance and thus support QIP.

quant-ph↗

arXiv2008

High fidelity all-optical control of quantum dot spins: detailed study of the adiabatic approach

Confined electron spins are preferred candidates for embodying quantum information in the solid state. A popular idea is the use of optical excitation to achieve the ``best of both worlds'', i.e. marrying the long spin decoherence times with rapid gating. Here we study an all-optical adiabatic approach to generating single qubit phase gates. We find that such a gate can be extremely robust against the combined effect of all principal sources of decoherence, with an achievable fidelity of 0.999 even at finite temperature. Crucially this performance can be obtained with only a small time cost: the adiabatic gate duration is within about an order of magnitude of a simple dynamic implementation. An experimental verification of these predictions is immediately feasible with only modest resources.

quant-ph↗

arXiv2008

Measurement-based approach to entanglement generation in coupled quantum dots

Measurements provide a novel mechanism for generating the entanglement resource necessary for performing scalable quantum computation. Recently, we proposed a method for performing parity measurements in a coupled quantum dot system. In this paper we generalise this scheme and perform a comprehensive analytic and numerical study of environmental factors. We calculate the effects of possible error sources including non-ideal photon detectors, ineffective spin-selective excitation and dot distinguishability (both spatial and spectral). Furthermore, we present an experimental approach for verifying the success of the parity measurement.

quant-ph↗

arXiv2007

Efficient growth of complex graph states via imperfect path erasure

Given a suitably large and well connected (complex) graph state, any quantum algorithm can be implemented purely through local measurements on the individual qubits. Measurements can also be used to create the graph state: Path erasure techniques allow one to entangle multiple qubits by determining only global properties of the qubits. Here, this powerful approach is extended by demonstrating that even imperfect path erasure can produce the required graph states with high efficiency. By characterizing the degree of error in each path erasure attempt, one can subsume the resulting imperfect entanglement into an extended graph state formalism. The subsequent growth of the improper graph state can be guided, through a series of strategic decisions, in such a way as to bound the growth of the error and eventually yield a high-fidelity graph state. As an implementation of these techniques, we develop an analytic model for atom (or atom-like) qubits in mismatched cavities, under the double-heralding entanglement procedure of Barrett and Kok [Phys. Rev. A 71, 060310 (2005)]. Compared to straightforward postselection techniques our protocol offers a dramatic improvement in growing complex high-fidelity graph states.

quant-ph↗

arXiv2007

Adaptive strategies for graph state growth in the presence of monitored errors

Graph states (or cluster states) are the entanglement resource that enables one-way quantum computing. They can be grown by projective measurements on the component qubits. Such measurements typically carry a significant failure probability. Moreover, they may generate imperfect entanglement. Here we describe strategies to adapt growth operations in order to cancel incurred errors. Nascent states that initially deviate from the ideal graph states evolve toward the desired high fidelity resource without impractical overheads. Our analysis extends the diagrammatic language of graph states to include characteristics such as tilted vertices, weighted edges, and partial fusion, which arise from experimental imperfections. The strategies we present are relevant to parity projection schemes such as optical `path erasure' with distributed matter qubits.

quant-ph↗

arXiv2006

All-Optical Measurement Based QIP in Quantum Dots

Parity measurements on qubits can generate the entanglement resource necessary for scalable quantum computation. Here we describe a method for fast optical parity measurements on electron spin qubits within coupled quantum dots. The measurement scheme, which can be realised with existing technology, consists of the optical excitation of excitonic states followed by monitored relaxation. Conditional on the observation of a photon, the system is projected into the odd/even parity subspaces. Our model incorporates all the primary sources of error, including detector inefficiency, effects of spatial separation and non-resonance of the dots, and also unwanted excitations. Through an analytical treatment we establish that the scheme is robust to such effects. Two applications are presented: a realisation of a CNOT gate, and a technique for growing large scale graph states.

quant-ph↗

arXiv2006

Quantum Information Processing with Delocalized Qubits under Global Control

Any technology for quantum information processing (QIP) must embody within it quantum bits (qubits) and maintain control of their key quantum properties of superposition and entanglement. Typical QIP schemes envisage an array of physical systems, such as electrons or nuclei, with each system representing a given qubit. For adequate control, systems must be distinguishable either by physical separation or unique frequencies, and their mutual interactions must be individually manipulable. These difficult requirements exclude many nanoscale technologies where systems are densely packed and continuously interacting. Here we demonstrate a new paradigm: restricting ourselves to global control pulses we permit systems to interact freely and continuously, with the consequence that qubits can become delocalized over the entire device. We realize this using NMR studies of three carbon-13 nuclei in alanine, demonstrating all the key aspects including a quantum mirror, one- and two-qubit gates, permutation of densely packed qubits and Deutsch algorithms.

quant-ph↗

arXiv2006

Computation in Self-assembled Nanometre Scale Arrays

Ordered nanoarrays, i.e. regular patterns of quantum structures at the nanometre scale, have recently been synthesized in a wide range of systems. Here I explore a possible route to technological exploitation: assuming a simple form of bistability for the individual units, I find that arrays can compute in a way that is robust, efficient, programmable and highly defect tolerant. The nanoarray would need to be 'wired' to conventional technologies only at its boundary; its internal dynamics are driven simply by applying optical pulses to the entire structure indiscriminately. Any self-assembled array would have a unique set of defects, therefore I employ an ab initio evolutionary process to subsume such flaws without any need to determine their location or nature. The approach succeeds for various forms of physical interaction within the array.

cond-mat.other↗

arXiv2006

A Processor Core Model for Quantum Computing

We describe an architecture based on a processing 'core' where multiple qubits interact perpetually, and a separate 'store' where qubits exist in isolation. Computation consists of single qubit operations, swaps between the store and the core, and free evolution of the core. This enables computation using physical systems where the entangling interactions are 'always on'. Alternatively, for switchable systems our model constitutes a prescription for optimizing many-qubit gates. We discuss implementations of the quantum Fourier transform, Hamiltonian simulation, and quantum error correction.

quant-ph↗

arXiv2006

Bang-bang control of fullerene qubits using ultra-fast phase gates

Quantum mechanics permits an entity, such as an atom, to exist in a superposition of multiple states simultaneously. Quantum information processing (QIP) harnesses this profound phenomenon to manipulate information in radically new ways. A fundamental challenge in all QIP technologies is the corruption of superposition in a quantum bit (qubit) through interaction with its environment. Quantum bang-bang control provides a solution by repeatedly applying `kicks' to a qubit, thus disrupting an environmental interaction. However, the speed and precision required for the kick operations has presented an obstacle to experimental realization. Here we demonstrate a phase gate of unprecedented speed on a nuclear spin qubit in a fullerene molecule (N@C60), and use it to bang-bang decouple the qubit from a strong environmental interaction. We can thus trap the qubit in closed cycles on the Bloch sphere, or lock it in a given state for an arbitrary period. Our procedure uses operations on a second qubit, an electron spin, in order to generate an arbitrary phase on the nuclear qubit. We anticipate the approach will be vital for QIP technologies, especially at the molecular scale where other strategies, such as electrode switching, are unfeasible.

quant-ph↗

arXiv2005

Brokered Graph State Quantum Computing

We describe a procedure for graph state quantum computing that is tailored to fully exploit the physics of optically active multi-level systems. Leveraging ideas from the literature on distributed computation together with the recent work on probabilistic cluster state synthesis, our model assigns to each physical system two logical qubits: the broker and the client. Groups of brokers negotiate new graph state fragments via a probabilistic optical protocol. Completed fragments are mapped from broker to clients via a simple state transition and measurement. The clients, whose role is to store the nascent graph state long term, remain entirely insulated from failures during the brokerage. We describe an implementation in terms of NV-centres in diamond, where brokers and clients are very naturally embodied as electron and nuclear spins.

quant-ph↗

arXiv2005

Efficient Graph State Construction Under the Barrett and Kok Scheme

Recently Barrett and Kok (BK) proposed an elegant method for entangling separated matter qubits. They outlined a strategy for using their entangling operation (EO) to build graph states, the resource for one-way quantum computing. However by viewing their EO as a graph fusion event, one perceives that each successful event introduces an ideal redundant graph edge, which growth strategies should exploit. For example, if each EO succeeds with probability p=0.4 then a highly connected graph can be formed with an overhead of only about ten EO attempts per graph edge. The BK scheme then becomes competitive with the more elaborate entanglement procedures designed to permit p to approach unity.

quant-ph↗

arXiv2005

Optical Quantum Computation with Perpetually Coupled Spins

The possibility of using strongly and continuously interacting spins for quantum computation has recently been discussed. Here we present a simple optical scheme that achieves this goal while avoiding the drawbacks of earlier proposals. We employ a third state, accessed by a classical laser field, to create an effective barrier to information transfer. The mechanism proves to be highly efficient both for continuous and pulsed laser modes; moreover it is very robust, tolerating high decay rates for the excited states. The approach is applicable to a broad range of systems, in particular dense structures such as solid state self-assembled (e.g., molecular) devices. Importantly, there are existing structures upon which `first step' experiments could be immediately performed.

quant-ph↗

arXiv2004

Quantum error correction in globally controlled arrays

An interesting concept in quantum computation is that of global control (GC), where there is no need to manipulate qubits individually. One can implement a universal set of quantum gates on a one-dimensional array purely via signals that target the entire structure indiscriminately. But large-scale quantum computation imposes several requirements in terms of noise level, time, space (scaling) and in particular parallelism. Keeping in mind these requirements, we prove GC can support error-correction, by implementing two simple codes. This opens the way to fault-tolerant computation with this type of architecture.

quant-ph↗

arXiv2004

Multi-Qubit Gates in Arrays Coupled by 'Always On' Interactions

Recently there has been interest in the idea of quantum computing without control of the physical interactions between component qubits. This is highly appealing since the 'switching' of such interactions is a principal difficulty in creating real devices. It has been established that one can employ 'always on' interactions in a one-dimensional Heisenberg chain, provided that one can tune the Zeeman energies of the individual (pseudo-)spins. It is important to generalize this scheme to higher dimensional networks, since a real device would probably be of that kind. Such generalisations have been proposed, but only at the severe cost that the efficiency of qubit storage must *fall*. Here we propose the use of multi-qubit gates within such higher-dimensional arrays, finding a novel three-qubit gate that can in fact increase the efficiency beyond the linear model. Thus we are able to propose higher dimensional networks that can constitute a better embodiment of the 'always on' concept - a substantial step toward bringing this novel concept to full fruition.

quant-ph↗

arXiv2003

Quantum Computing with an 'Always On' Heisenberg Interaction

Many promising ideas for quantum computing demand the experimental ability to directly switch 'on' and 'off' a physical coupling between the component qubits. This is typically the key difficulty in implementation, and precludes quantum computation in generic solid state systems, where interactions between the constituents are 'always on'. Here we show that quantum computation is possible in strongly coupled (Heisenberg) systems even when the interaction cannot be controlled. The modest ability of 'tuning' the transition energies of individual qubits proves to be sufficient, with a suitable encoding of the logical qubits, to generate universal quantum gates. Furthermore, by tuning the qubits collectively we provide a scheme with exceptional experimental simplicity: computations are controlled via a single 'switch' of only six settings. Our schemes are applicable to a wide range of physical implementations, from excitons and spins in quantum dots through to bulk magnets.

quant-ph↗

arXiv2001

Quantum Computing with Globally Controlled Exchange-type Interactions

If the interaction between qubits in a quantum computer has a non-diagonal form (e.g. the Heisenberg interaction), then one must be able to "switch it off" in order to prevent uncontrolled propagation of states. Therefore, such QC schemes typically demand local control of the interaction strength between each pair of neighboring qubits. Here we demonstrate that this degree of control is not necessary: it suffices to switch the interaction collectively - something that can in principle be achieved by global fields rather than with local manipulations. This observation may offer a significant simplification for various solid state, optical lattice and NMR implementations.

quant-ph↗