We consider experimentally feasible chains of trapped ions with pseudospin $1∕2$ and find models that can potentially be used to implement error-resistant quantum computation. Similar in spirit to classical neural networks, the error resistance of the system is achieved by encoding the qubits distributed over the whole system. We therefore call our system a quantum neural network and present a quantum neural network model of quantum computation. Qubits are encoded in a few quasi degenerated low-energy levels of the whole system, separated by a large gap from the excited states and large energy barriers between themselves. We investigate protocols for implementing a universal set of quantum logic gates in the system by adiabatic passage of a few low-lying energy levels of the whole system. Naturally appearing and potentially dangerous distributed noise in the system leaves the fidelity of the computation virtually unchanged, if it is not too strong. The computation is also naturally resilient to local perturbations of the spins.
We consider experimentally feasible chains of trapped ions with pseudospin 1∕2 and find models that can potentially be used to implement error-resistant quantum computation. Similar in spirit to classical neural networks, the error resistance of the system is achieved by encoding the qubits distributed over the whole system. We therefore call our system a quantum neural network and present a quantum neural network model of quantum computation. Qubits are encoded in a few quasi degenerated low-energy levels of the whole system, separated by a large gap from the excited states and large energy barriers between themselves. We investigate protocols for implementing a universal set of quantum logic gates in the system by adiabatic passage of a few low-lying energy levels of the whole system. Naturally appearing and potentially dangerous distributed noise in the system leaves the fidelity of the computation virtually unchanged, if it is not too strong. The computation is also naturally resilient to local perturbations of the spins.
Classical neural networks suffer from inherent vulnerabilities to noise and errors, severely limiting their applicability in demanding environments. This research proposes a novel approach to mitigating these issues by leveraging topological neural networks (TNNs) for quantum error correction (QEC). Inspired by the robust properties of topological insulators, TNNs are designed to encode information in topological invariants, making them inherently resilient to local perturbations. This paper details the framework for integrating TNNs with neural network architectures, outlining the key concepts of braiding operations, logical qubit representation, and the implementation of standard QEC codes like Shor and Steane. We explore the theoretical underpinnings of this approach, demonstrating how TNNs can effectively detect and correct errors without disrupting the underlying computation. The resulting architecture promises a significantly enhanced resilience to noise, potentially unlocking the full potential of neural networks for complex and uncertain tasks. Our approach offers a fundamentally new direction in computing, bridging the gap between classical and quantum computation through a robust and adaptable network topology. We define key metrics for evaluating the performance of this system including error correction fidelity and computational speedup relative to traditional neural networks.
Quantum computers promise to solve models of important physical processes, optimize complex cost functions, and challenge cryptography in ways that are intractable using current computers. In order to achieve these promises, quantum computers must both increase in size and decrease error rates. To increase the system size, we report on the design, construction, and operation of an integrated trapped ion quantum computer consisting of a chain of 15 171Yb+ ions with all-to-all connectivity and high-fidelity gate operations. In the process, we identify a physical mechanism that adversely affects gate fidelity in long ion chains. Residual heating of the ions from noisy electric fields creates decoherence due to the weak confinement of the ions transverse to a focused addressing laser. We demonstrate this effect in chains of up to 25 ions and present a model that accurately describes the observed decoherence. To mitigate this noise source, we first propose a new sympathetic cooling scheme to periodically re-cool the ions throughout a quantum circuit, and then demonstrate its capability in a proof-of-concept experiment. One path to suppress error rates in quantum computers is through quantum error correction schemes that combine multiple physical qubits into logical qubits that robustly store information within an entangled state. These extra degrees of freedom enable the detection and correction of errors. Fault-tolerant circuits contain the spread of errors while operating the logical qubit and are essential for realizing error suppression in practice. We demonstrate fault-tolerant preparation, measurement, rotation, and stabilizer measurement of a distance-3 Bacon-Shor logical qubit in our quantum computer. The result is an encoded logical qubit with error rates lower than the error of the entangling operations required to operate it.
Distributed quantum computing (DQC) combines the computing power of multiple networked quantum processing modules, ideally enabling the execution of large quantum circuits without compromising performance or connectivity. Photonic networks are well-suited as a versatile and reconfigurable interconnect layer for DQC; remote entanglement shared between matter qubits across the network enables all-to-all logical connectivity via quantum gate teleportation (QGT). For a scalable DQC architecture, the QGT implementation must be deterministic and repeatable; until now, no demonstration has satisfied these requirements. In this thesis, we report the first experimental demonstration of distributed quantum computing across a quantum network of two photonically interconnected trapped-ion modules. Our experimental apparatus comprises two trapped-ion modules, separated by ∼ 2 m, each co-trapping one 43Ca+ ion and one 88Sr+ ion. The 43Ca+ ions provide a robust quantum memory for the modules, while the 88Sr+ ions provide an interface to the optical quantum network, enabling the remote entanglement of 88Sr+ ions in separate modules. Using local mixed-species operations, we demonstrate the enhanced functionality of the mixed-species trapped-ion quantum network by creating more complex remotely entangled states. These include remote 88Sr+- 43Ca+ and 43Ca+-43Ca+ entanglement, as well as 3- and 4-qubit mixed-species GHZ states. Additionally, we demonstrate the storage of remote entanglement in the 43Ca+ ions for up to 10 s. Utilising these techniques, we demonstrate the distribution of quantum computations across the mixed-species trapped-ion quantum network. Using heralded remote entanglement between the 88Sr+ ions, we deterministically teleport controlled Z gates between two 43Ca+ ions in separate modules, achieving a fidelity of 86 %. We then implement distributed iSWAP and SWAP circuits, compiled with 2 and 3 instances of QGT, respectively, demonstrating the ability to distribute arbitrary two-qubit operations. Finally, we execute Grover’s search algorithm – the first implementation of a distributed quantum algorithm comprising multiple non-local two-qubit gates – and measure a success rate of 71 %. These results represent a significant step towards realising a large-scale distributed quantum computer.
Quantum computing has the potential to transform information technology by offering algorithms for certain tasks, such as quantum simulation, that are vastly more efficient than what is possible with any classical device. But experimentally implementing practical quantum information processing is a very difficult task. Here we study two important, and closely related, aspects of this challenge: architectures for quantum computing, and quantum error correction Exquisite quantum control has now been achieved in small ion traps, in nitrogen-vacancy centres and in superconducting qubit clusters, but the challenge remains of how to scale these systems to build practical quantum devices. In Part I of this thesis we analyse one approach to building a scalable quantum computer 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. Here we describe a method by which even these error-prone cells can perform quantum error correction. Groups of cells generate and purify 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 all intra-cell error rates are below 0.8%. Furthermore, we show that with some adjustments, the protocols we employ can be made robust also against high levels of loss in the network interconnects. We go on to analyse the potential running speed of such a device. Using levels of fidelity that are either already achievable in experimental systems, or will be in the near-future, we find that employing a surface code approach in a highly noisy and lossy network architecture can result in kilohertz computer clock speeds. In Part II we consider the question of quantum error correction beyond the surface code. We consider several families of topological codes, and determine the minimum requirements to demonstrate proof-of-principle error suppression in each type of code. A particularly promising code is the gauge color code, which admits a universal transversal gate set. Furthermore, a recent result of Bombin shows the gauge color code supports an error-correction protocol that achieves tolerance to noisy measurements without the need for repeated measurements, so called single-shot error correction. Here, we demonstrate the promise of single-shot error correction by designing a decoder and investigating its performance. We simulate fault-tolerant error correction with the gauge color code, and estimate a sustainable error rate, i.e. the threshold for the long time limit, of ~0.31% for a phenomenological noise model using a simple decoding algorithm.