GASP: a genetic algorithm for state preparation on quantum computers.

The efficient preparation of quantum states is an important step in the execution of many quantum algorithms. In the noisy intermediate-scale quantum (NISQ) computing era, this is a significant challenge given quantum resources are scarce and typically only low-depth quantum circuits can be implemented on physical devices. We present a genetic algorithm for state preparation (GASP) which generates relatively low-depth quantum circuits for initialising a quantum computer in a specified quantum state. The method uses a basis set of [Formula: see text], [Formula: see text], [Formula: see text], and CNOT gates and a genetic algorithm to systematically generate circuits to synthesize the target state to the required fidelity. GASP can produce more efficient circuits of a given accuracy with lower depth and gate counts than other methods. This variability of the required accuracy facilitates overall higher accuracy on implementation, as error accumulation in high-depth circuits can be avoided. We directly compare the method to the state initialisation technique based on an exact synthesis technique by implemented in IBM Qiskit simulated with noise and implemented on physical IBM Quantum devices. Results achieved by GASP outperform Qiskit's exact general circuit synthesis method on a variety of states such as Gaussian states and W-states, and consistently show the method reduces the number of gates required for the quantum circuits to generate these quantum states to the required accuracy.

Chemistry beyond the Hartree-Fock energy via quantum computed moments.

Quantum computers hold promise to circumvent the limitations of conventional computing for difficult molecular problems. However, the accumulation of quantum logic errors on real devices represents a major challenge, particularly in the pursuit of chemical accuracy requiring the inclusion of electronic correlation effects. In this work we implement the quantum computed moments (QCM) approach for hydrogen chain molecular systems up to H[Formula: see text]. On a superconducting quantum processor, Hamiltonian moments, [Formula: see text] are computed with respect to the Hartree-Fock state, which are then employed in Lanczos expansion theory to determine an estimate for the ground-state energy which incorporates electronic correlations and manifestly improves on the direct energy measurement. Post-processing purification of the raw QCM data takes the estimate below the Hartree-Fock energy to within 99.9% of the exact electronic ground-state energy for the largest system studied, H[Formula: see text]. Calculated dissociation curves indicate precision at about 10mH for this system and as low as 0.1mH for molecular hydrogen, H[Formula: see text], over a range of bond lengths. In the context of stringent precision requirements for chemical problems, these results provide strong evidence for the error suppression capability of the QCM method, particularly when coupled with post-processing error mitigation. While calculations based on the Hartree-Fock state are tractable to classical computation, these results represent a first step towards implementing the QCM method in a quantum chemical trial circuit. Greater emphasis on more efficient representations of the Hamiltonian and classical preprocessing steps may enable the solution of larger systems on near-term quantum processors.

Entanglement in a 20-Qubit Superconducting Quantum Computer.

The ability to prepare sizeable multi-qubit entangled states with full qubit control is a critical milestone for physical platforms upon which quantum computers are built. We investigate the extent to which entanglement is found within a prepared graph state on the 20-qubit superconducting quantum computer IBM Q Poughkeepsie. We prepared a graph state along a path consisting of all twenty qubits within the device and performed full quantum state tomography on all groups of four connected qubits along this path. We determined that each pair of connected qubits was inseparable and hence the prepared state was entangled. Additionally, a genuine multipartite entanglement witness was measured on all qubit subpaths of the graph state and we found genuine multipartite entanglement on chains of up to three qubits. These results represent a demonstration of entanglement in one of the largest solid-state qubit arrays to date and indicate the positive direction of progress towards the goal of implementing complex quantum algorithms relying on such effects.

Fan-out Estimation in Spin-based Quantum Computer Scale-up.

Solid-state spin-based qubits offer good prospects for scaling based on their long coherence times and nexus to large-scale electronic scale-up technologies. However, high-threshold quantum error correction requires a two-dimensional qubit array operating in parallel, posing significant challenges in fabrication and control. While architectures incorporating distributed quantum control meet this challenge head-on, most designs rely on individual control and readout of all qubits with high gate densities. We analysed the fan-out routing overhead of a dedicated control line architecture, basing the analysis on a generalised solid-state spin qubit platform parameterised to encompass Coulomb confined (e.g. donor based spin qubits) or electrostatically confined (e.g. quantum dot based spin qubits) implementations. The spatial scalability under this model is estimated using standard electronic routing methods and present-day fabrication constraints. Based on reasonable assumptions for qubit control and readout we estimate 102-105 physical qubits, depending on the quantum interconnect implementation, can be integrated and fanned-out independently. Assuming relatively long control-free interconnects the scalability can be extended. Ultimately, the universal quantum computation may necessitate a much higher number of integrated qubits, indicating that higher dimensional electronics fabrication and/or multiplexed distributed control and readout schemes may be the preferredstrategy for large-scale implementation.

A surface code quantum computer in silicon.

The exceptionally long quantum coherence times of phosphorus donor nuclear spin qubits in silicon, coupled with the proven scalability of silicon-based nano-electronics, make them attractive candidates for large-scale quantum computing. However, the high threshold of topological quantum error correction can only be captured in a two-dimensional array of qubits operating synchronously and in parallel-posing formidable fabrication and control challenges. We present an architecture that addresses these problems through a novel shared-control paradigm that is particularly suited to the natural uniformity of the phosphorus donor nuclear spin qubit states and electronic confinement. The architecture comprises a two-dimensional lattice of donor qubits sandwiched between two vertically separated control layers forming a mutually perpendicular crisscross gate array. Shared-control lines facilitate loading/unloading of single electrons to specific donors, thereby activating multiple qubits in parallel across the array on which the required operations for surface code quantum error correction are carried out by global spin control. The complexities of independent qubit control, wave function engineering, and ad hoc quantum interconnects are explicitly avoided. With many of the basic elements of fabrication and control based on demonstrated techniques and with simulated quantum operation below the surface code error threshold, the architecture represents a new pathway for large-scale quantum information processing in silicon and potentially in other qubit systems where uniformity can be exploited.

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

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

Monitoring ion-channel function in real time through quantum decoherence.

In drug discovery, there is a clear and urgent need for detection of cell-membrane ion-channel operation with wide-field capability. Existing techniques are generally invasive or require specialized nanostructures. We show that quantum nanotechnology could provide a solution. The nitrogen-vacancy (NV) center in nanodiamond is of great interest as a single-atom quantum probe for nanoscale processes. However, until now nothing was known about the quantum behavior of a NV probe in a complex biological environment. We explore the quantum dynamics of a NV probe in proximity to the ion channel, lipid bilayer, and surrounding aqueous environment. Our theoretical results indicate that real-time detection of ion-channel operation at millisecond resolution is possible by directly monitoring the quantum decoherence of the NV probe. With the potential to scan and scale up to an array-based system, this conclusion may have wide-ranging implications for nanoscale biology and drug discovery.

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 of existing protocols is low as two-way classical communication is used. By using a surface code across the repeater chain and generating Bell pairs between neighboring stations with probability of heralded success greater than 0.65 and fidelity greater than 0.96, we show that two-way communication can be avoided and quantum information can be sent over arbitrary distances with arbitrarily low error at a rate limited only by the local gate speed. This is achieved by using the unreliable Bell pairs to measure nonlocal stabilizers and feeding heralded failure information into post-transmission error correction. Our scheme also applies when the probability of heralded success is arbitrarily low.

Robust controlled-NOT gates from almost any interaction.

There are many cases where the interaction between two qubits is not precisely known, but single-qubit operations are available. In this Letter we show how, regardless of an incomplete knowledge of the strength or form of the interaction between two qubits, it is often possible to construct a controlled-NOT gate which has arbitrarily high fidelity. In particular, we show that oscillations in the strength of the exchange interaction in solid state Si and Ge structures are correctable.