arXiv subjects

Simon C. Benjamin

Publications and source records attributed to Simon C. Benjamin.

At least 55 records · Page 3Linked to original sources

arXiv2017

Efficient variational quantum simulator incorporating active error minimisation

One of the key applications for quantum computers will be the simulation of other quantum systems that arise in chemistry, materials science, etc, in order to accelerate the process of discovery. It is important to ask: Can this be achieved using near future quantum processors, of modest size and under imperfect control, or must it await the more distant era of large-scale fault-tolerant quantum computing? Here we propose a variational method involving closely integrated classical and quantum coprocessors. We presume that all operations in the quantum coprocessor are prone to error. The impact of such errors is minimised by boosting them artificially and then extrapolating to the zero-error case. In comparison to a more conventional optimised Trotterisation technique, we find that our protocol is efficient and appears to be fundamentally more robust against error accumulation.

quant-ph↗

arXiv2017

A measurement driven analog of adiabatic quantum computation for frustration-free Hamiltonians

The adiabatic quantum algorithm has drawn intense interest as a potential approach to accelerating optimization tasks using quantum computation. The algorithm is most naturally realised in systems which support Hamiltonian evolution, rather than discrete gates. We explore an alternative approach in which slowly varying measurements are used to mimic adiabatic evolution. We show that for certain Hamiltonians, which remain frustration-free all along the adiabatic path, the necessary measurements can be implemented through the measurement of random terms from the Hamiltonian. This offers a new, and potentially more viable, method of realising adiabatic evolution in gate-based quantum computer architectures.

quant-ph↗

arXiv2017

Entanglement Distillation between Solid-State Quantum Network Nodes

The potential impact of future quantum networks hinges on high-quality quantum entanglement shared between network nodes. Unavoidable real-world imperfections necessitate means to improve remote entanglement by local quantum operations. Here we realize entanglement distillation on a quantum network primitive of distant electron-nuclear two-qubit nodes. We demonstrate the heralded generation of two copies of a remote entangled state through single-photon-mediated entangling of the electrons and robust storage in the nuclear spins. After applying local two-qubit gates, single-shot measurements herald the distillation of an entangled state with increased fidelity that is available for further use. In addition, this distillation protocol significantly speeds up entanglement generation compared to previous two-photon-mediated schemes. The key combination of generating, storing and processing entangled states demonstrated here opens the door to exploring and utilizing multi-particle entanglement on an extended quantum network.

quant-ph↗

arXiv2017

One-dimensional quantum computing with a 'segmented chain' is feasible with today's gate fidelities

In principle a 1D array of nearest-neighbour linked qubits is compatible with fault tolerant quantum computing. However such a restricted topology necessitates a large overhead for shuffling qubits and consequently the fault tolerance threshold is far lower than in 2D architectures. Here we identify a middle ground: a 1D segmented chain which is a linear array of segments, each of which is a well-connected zone with all-to-all connectivity. The architecture is relevant to both ion trap and solid-state systems. We establish that fault tolerance can be achieved either by a surface code alone, or via an additional concatenated four-qubit gauge code. We find that the fault tolerance threshold is 0.12% for 15-qubit segments, while larger segments are superior. For 35 or more qubits per segment one can achieve computation on a meaningful scale with today's state-of-the-art fidelities without the use of the upper concatenation layer, thus minimising the overall device size.

quant-ph↗

arXiv2016

A Direct Mapping of Max k-SAT and High Order Parity Checks to a Chimera Graph

We demonstrate a direct mapping of max k-SAT problems (and weighted max k-SAT) to a Chimera graph, which is the non-planar hardware graph of the devices built by D-Wave Systems Inc. We further show that this mapping can be used to map a similar class of maximum satisfiability problems where the clauses are replaced by parity checks over potentially large numbers of bits. The latter is of specific interest for applications in decoding for communication. We discuss an example in which the decoding of a turbo code, which has been demonstrated to perform near the Shannon limit, can be mapped to a Chimera graph. The weighted max k-SAT problem is the most general class of satisfiability problems, so our result effectively demonstrates how any satisfiability problem may be directly mapped to a Chimera graph. Our methods faithfully reproduce the low energy spectrum of the target problems, so therefore may also be used for maximum entropy inference.

quant-ph↗

arXiv2016

Stabilisers as a design tool for new forms of Lechner-Hauke-Zoller Annealer

In a recent paper Lechner, Hauke and Zoller (LHZ) described a means to translate a Hamiltonian of $N$ spin-$\frac{1}{2}$ particles with 'all-to-all' interactions into a larger physical lattice with only on-site energies and local parity constraints. LHZ used this mapping to propose a novel form of quantum annealing. Here we provide a stabiliser-based formulation within which we can describe both this prior approach and a wide variety of variants. Examples include a triangular array supporting all-to-all connectivity, and moreover arrangements requiring only $2N$ or $N\log N$ spins but providing interesting bespoke connectivities. Further examples show that arbitrarily high order logical terms can be efficiently realised, even in a strictly 2D layout. Our stabilisers can correspond to either even-parity constraints, as in the LHZ proposal, or as odd-parity constraints. Considering the latter option applied to the original LHZ layout, we note it may simplify the physical realisation since the required ancillas are only spin-$\frac{1}{2}$ systems (i.e. qubits, rather than qutrits) and moreover the interactions are very simple. We make a preliminary assessment of the impact of this design choices by simulating small (few-qubit) systems; we find some indications that the new variant may maintain a larger minimum energy gap during the annealing process.

quant-ph↗

arXiv2016

Minimally complex ion traps as modules for quantum communication and computing

Optically linked ion traps are promising as components of network-based quantum technologies, including communication systems and modular computers. Experimental results achieved to date indicate that the fidelity of operations within each ion trap module will be far higher than the fidelity of operations involving the links; fortunately internal storage and processing can effectively upgrade the links through the process of purification. Here we perform the most detailed analysis to date on this purification task, using a protocol which is balanced to maximise fidelity while minimising the device complexity and the time cost of the process. Moreover we 'compile down' the quantum circuit to device-level operations including cooling and shutting events. We find that a linear trap with only five ions (two of one species, three of another) can support our protocol while incorporating desirable features such as 'global control', i.e. laser control pulses need only target an entire zone rather than differentiating one ion from its neighbour. To evaluate the capabilities of such a module we consider its use both as a universal communications node for quantum key distribution, and as the basic repeating unit of a quantum computer. For the latter case we evaluate the threshold for fault tolerant quantum computing using the surface code, finding acceptable fidelities for the 'raw' entangling link as low as 83% (or under 75% if an additional ion is available).

quant-ph↗

arXiv2015

Hierarchical surface code for network quantum computing with modules of arbitrary size

The network paradigm for quantum computing involves interconnecting many modules to form a scalable machine. Typically it is assumed that the links between modules are prone to noise while operations within modules have significantly higher fidelity. To optimise fault tolerance in such architectures we introduce a hierarchical generalisation of the surface code: a small `patch' of the code exists within each module, and constitutes a single effective qubit of the logic-level surface code. Errors primarily occur in a two-dimensional subspace, i.e. patch perimeters extruded over time, and the resulting noise threshold for inter-module links can exceed ~ 10% even in the absence of purification. Increasing the number of qubits within each module decreases the number of qubits necessary for encoding a logical qubit. But this advantage is relatively modest, and broadly speaking a `fine grained' network of small modules containing only ~ 8 qubits is competitive in total qubit count versus a `course' network with modules containing many hundreds of qubits.

quant-ph↗

arXiv2015

A silicon-based surface code quantum computer

Individual impurity atoms in silicon can make superb individual qubits, but it remains an immense challenge to build a multi-qubit processor: There is a basic conflict between nanometre separation desired for qubit-qubit interactions, and the much larger scales that would enable control and addressing in a manufacturable and fault tolerant architecture. Here we resolve this conflict by establishing the feasibility of surface code quantum computing using solid state spins, or `data qubits', that are widely separated from one another. We employ a second set of `probe' spins which are mechanically separate from the data qubits and move in-and-out of their proximity. The spin dipole-dipole interactions give rise to phase shifts; measuring a probe's total phase reveals the collective parity of the data qubits along the probe's path. We introduce a protocol to balance the systematic errors due to the spins being imperfectly located during device fabrication. Detailed simulations show that the surface code's threshold then corresponds to misalignments that are substantial on the scale of the array, indicating that it is very robust. We conclude that this simple `orbital probe' architecture overcomes many of the difficulties facing solid state quantum computing, while minimising the complexity and offering qubit densities that are several orders of magnitude greater than other systems.

quant-ph↗

arXiv2015

Resource costs for fault-tolerant linear optical quantum computing

Linear optical quantum computing (LOQC) seems attractively simple: information is borne entirely by light and processed by components such as beam splitters, phase shifters and detectors. However this very simplicity leads to limitations, such as the lack of deterministic entangling operations, which are compensated for by using substantial hardware overheads. Here we quantify the resource costs for full scale LOQC by proposing a specific protocol based on the surface code. With the caveat that our protocol can be further optimised, we report that the required number of physical components is at least five orders of magnitude greater than in comparable matter-based systems. Moreover the resource requirements grow higher if the per-component photon loss rate is worse than one in a thousand, or the per-component noise rate is worse than $10^{-5}$. We identify the performance of switches in the network as the single most influential factor influencing resource scaling.

quant-ph↗

arXiv2015

Quantum dynamics in a tiered non-Markovian environment

We introduce a new analytical method for studying the open quantum systems problem of a discrete system weakly coupled to an environment of harmonic oscillators. Our approach is based on a phase space representation of the density matrix for a system coupled to a two-tiered environment. The dynamics of the system and its immediate environment are resolved in a non-Markovian way, and the environmental modes of the inner environment can themselves be damped by a wider `universe'. Applying our approach to the canonical cases of the Rabi and spin-boson models we obtain new analytical expressions for an effective thermalisation temperature and corrections to the environmental response functions as direct consequences of considering such a tiered environment. A comparison with exact numerical simulations confirms that our approximate expressions are remarkably accurate, while their analytic nature offers the prospect of deeper understanding of the physics which they describe. A unique advantage of our method is that it permits the simultaneous inclusion of a continuous bath as well as discrete environmental modes, leading to wide and versatile applicability.

quant-ph↗

arXiv2014

Electrically driven spin resonance in a bent disordered carbon nanotube

Resonant manipulation of carbon nanotube valley-spin qubits by an electric field is investigated theoretically. We develop a new analysis of electrically driven spin resonance exploiting fixed physical characteristics of the nanotube: a bend and inhomogeneous disorder. The spectrum is simulated for an electron valley-spin qubit coupled to a hole valley-spin qubit and an impurity electron spin, and features that coincide with a recent measurement are identified. We show that the same mechanism allows resonant control of the full four-dimensional spin-valley space.

cond-mat.mes-hall↗

arXiv2014

Freely Scalable Quantum Technologies using Cells of 5-to-50 Qubits with Very Lossy and Noisy Photonic Links

Exquisite quantum control has now been achieved in small ion traps, in nitrogen-vacancy centres and in superconducting qubit clusters. We can regard such a system as a universal cell with diverse technological uses from communication to large-scale computing, provided that the cell is able to network with others and overcome any noise in the interlinks. Here we show that loss-tolerant entanglement purification makes quantum computing feasible with the noisy and lossy links that are realistic today: With a modestly complex cell design, and using a surface code protocol with a network noise threshold of 13.3%, we find that interlinks which attempt entanglement at a rate of 2MHz but suffer 98% photon loss can result in kilohertz computer clock speeds (i.e. rate of high fidelity stabilizer measurements). Improved links would dramatically increase the clock speed. Our simulations employed local gates of a fidelity already achieved in ion trap devices.

quant-ph↗

arXiv2014

Classical noise assists the flow of quantum energy by `momentum rejuvenation'

An important challenge in quantum science is to fully understand the efficiency of energy flow in networks. Here we present a simple and intuitive explanation for the intriguing observation that optimally efficient networks are not purely quantum, but are assisted by some interaction with a `noisy' classical environment. By considering the system's dynamics in both the site-basis and the momentum-basis, we show that the effect of classical noise is to sustain a broad momentum distribution, countering the depletion of high mobility terms which occurs as energy exits from the network. This picture predicts that the optimal level of classical noise is reciprocally related to the linear dimension of the lattice; our numerical simulations verify this prediction to high accuracy for regular 1D and 2D networks over a range of sizes up to thousands of sites. This insight leads to the discovery that dramatic further improvements in performance occur when a driving field targets noise at the low mobility components.

quant-ph↗

arXiv2013

Comment on "Quantum Coherence and Sensitivity of Avian Magnetoreception"

In a recent Letter [Phys. Rev. Lett. 109, 110502 (2012), arXiv:1204.6528], Bandyopadhyay, Paterek and Kaszlikowski report their analysis of spin coherence time in the radical pair involved in avian magnetoreception, concluding that is of the order of a microsecond. However, a combination of an erroneous numerical calculation together with an incorrect parameter drawn from an experimental source have resulted in the authors underestimating by two orders of magnitude. Consequently, one must reverse the authors' conclusion that the timescale is consistent with experiments on cryptochrome.

physics.bio-ph↗

arXiv2013

Topological quantum computing with a very noisy network and local error rates approaching one percent

A scalable quantum computer could be built by networking together many simple processor cells, thus avoiding the need to create a single complex structure. The difficulty is that realistic quantum links are very error prone. A solution is for cells to repeatedly communicate with each other and so 'purify' any imperfections; however prior studies suggest that the cells themselves must then have prohibitively low internal error rates. Here we describe a method by which even error-prone cells can perform purification: groups of cells generate shared resource states, which then enable stabilization of topologically encoded data. Given a realistically noisy network (>=10% error rate) we find that our protocol can succeed provided that intra-cell error rates for initialisation, state manipulation and measurement are below 0.82%. This level of fidelity is already achievable in several laboratory systems.

quant-ph↗

arXiv2013

Practicality of spin chain 'wiring' in diamond quantum technologies

Coupled spin chains are promising candidates for 'wiring up' qubits in solid-state quantum computing (QC). In particular, two nitrogen-vacancy centers in diamond can be connected by a chain of implanted nitrogen impurities; when driven by a suitable global fields the chain can potentially enable quantum state transfer at room temperature. However, our detailed analysis of error effects suggests that foreseeable systems may fall far short of the fidelities required for QC. Fortunately the chain can function in the more modest role as a mediator of noisy entanglement, enabling QC provided that we use subsequent purification. For instance, a chain of 5 spins with inter-spin distances of 10 nm has finite entangling power as long as the T2 time of the spins exceeds 0.55 ms. Moreover we show that re-purposing the chain this way can remove the restriction to nearest-neighbor interactions, so eliminating the need for complicated dynamical decoupling sequences.

quant-ph↗

arXiv2013

Quantum sensors based on weak-value amplification cannot overcome decoherence

Sensors that harness exclusively quantum phenomena (such as entanglement) can achieve superior performance compared to those employing only classical principles. Recently, a technique based on postselected, weakly-performed measurements has emerged as a method of overcoming technical noise in the detection and estimation of small interaction parameters, particularly in optical systems. The question of which other types of noise may be combatted remains open. We here analyze whether the effect can overcome decoherence in a typical field sensing scenario. Benchmarking a weak, postselected measurement strategy against a strong, direct strategy we conclude that no advantage is achievable, and that even a small amount of decoherence proves catastrophic to the weak-value amplification technique.

quant-ph↗