skip to main content

Title: A quantum walk control plane for distributed quantum computing in quantum networks
Quantum networks are complex systems formed by the interaction among quantum processors through quantum channels. Analogous to classical computer networks, quantum networks allow for the distribution of quantum computation among quantum computers. In this work, we describe a quantum walk protocol to perform distributed quantum computing in a quantum network. The protocol uses a quantum walk as a quantum control signal to perform distributed quantum operations. We consider a generalization of the discrete-time coined quantum walk model that accounts for the interaction between a quantum walker system in the network graph with quantum registers inside the network nodes. The protocol logically captures distributed quantum computing, abstracting hardware implementation and the transmission of quantum information through channels. Control signal transmission is mapped to the propagation of the walker system across the network, while interactions between the control layer and the quantum registers are embedded into the application of coin operators. We demonstrate how to use the quantum walker system to perform a distributed CNOT operation, which shows the universality of the protocol for distributed quantum computing. Furthermore, we apply the protocol to the task of entanglement distribution in a quantum network.
; ; ;
Award ID(s):
Publication Date:
Journal Name:
2021 IEEE International Conference on Quantum Computing and Engineering (QCE)
Page Range or eLocation-ID:
313 to 323
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract The nitrogen-vacancy (NV) color center in diamond has rapidly emerged as an important solid-state system for quantum information processing. Whereas individual spin registers have been used to implement small-scale diamond quantum computing, the realization of a large-scale device requires the development of an on-chip quantum bus for transporting information between distant qubits. Here, we propose a method for coherent quantum transport of an electron and its spin state between distant NV centers. Transport is achieved by the implementation of spatial stimulated adiabatic Raman passage through the optical control of the NV center charge states and the confined conduction states of a diamond nanostructure. Our models show that, for two NV centers in a diamond nanowire, high-fidelity transport can be achieved over distances of order hundreds of nanometers in timescales of order hundreds of nanoseconds. Spatial adiabatic passage is therefore a promising option for realizing an on-chip spin quantum bus.
  2. Quantum networks will enable a variety of applications, from secure communication and precision measurements to distributed quantum computing. Storing photonic qubits and controlling their frequency, bandwidth, and retrieval time are important functionalities in future optical quantum networks. Here we demonstrate these functions using an ensemble of erbium ions in yttrium orthosilicate coupled to a silicon photonic resonator and controlled via on-chip electrodes. Light in the telecommunication C-band is stored, manipulated, and retrieved using a dynamic atomic frequency comb protocol controlled by linear DC Stark shifts of the ion ensemble’s transition frequencies. We demonstrate memory time control in a digital fashion in increments of 50 ns, frequency shifting by more than a pulse width (±<#comment/>39MHz), and a bandwidth increase by a factor of 3, from 6 to 18 MHz. Using on-chip electrodes, electric fields as high as 3 kV/cm were achieved with a low applied bias of 5 V, making this an appealing platform for rare-earth ions, which experience Stark shifts of the order of 10 kHz/(V/cm).

  3. Abstract

    Quantum annealing is a powerful alternative model of quantum computing, which can succeed in the presence of environmental noise even without error correction. However, despite great effort, no conclusive demonstration of a quantum speedup (relative to state of the art classical algorithms) has been shown for these systems, and rigorous theoretical proofs of a quantum advantage (such as the adiabatic formulation of Grover’s search problem) generally rely on exponential precision in at least some aspects of the system, an unphysical resource guaranteed to be scrambled by experimental uncertainties and random noise. In this work, we propose a new variant of quantum annealing, called RFQA, which can maintain a scalable quantum speedup in the face of noise and modest control precision. Specifically, we consider a modification of flux qubit-based quantum annealing which includes low-frequency oscillations in the directions of the transverse field terms as the system evolves. We show that this method produces a quantum speedup for finding ground states in the Grover problem and quantum random energy model, and thus should be widely applicable to other hard optimization problems which can be formulated as quantum spin glasses. Further, we explore three realistic noise channels and show that the speedupmore »from RFQA is resilient to 1/f-like local potential fluctuations and local heating from interaction with a sufficiently low temperature bath. Another noise channel, bath-assisted quantum cooling transitions, actually accelerates the algorithm and may outweigh the negative effects of the others. We also detail how RFQA may be implemented experimentally with current technology.

    « less
  4. In a quantum network that successfully creates links—shared Bell states between neighboring repeater nodes—with probability p in each time slot, and performs Bell State Measurements at nodes with success probability q < 1, the end-to-end entanglement generation rate drops exponentially with the distance between consumers, despite multi-path routing. If repeaters can perform multi-qubit projective measurements in the GHZ basis that succeed with probability q, the rate does not change with distance in a certain (p,q) region, but decays exponentially outside. This region where the distance-independent rate occurs is the super-critical region of a new percolation problem. We extend this GHZ protocol to incorporate a time-multiplexing blocklength k, the number of time slots over which a repeater can mix-and-match successful links to perform fusion on. As k increases, the super-critical region expands. For a given (p,q), the entanglement rate initially increases with k, and once inside the super-critical region for a high enough k, it decays as 1/k GHZ states per time slot. When memory coherence time exponentially distributed with mean μ is incorporated, it is seen that increasing k does not indefinitely increase the super-critical region; it has a hard μ-dependent limit. Finally, we find that incorporating space-division multiplexing, i.e.,more »running the above protocol independently in up to d disconnected network regions, where d is the network’s node degree, one can go beyond the 1 GHZ state per time slot rate that the above randomized local-link-state protocol cannot surpass. As (p,q) increases, one can approach the ultimate min-cut entanglement-generation capacity of d GHZ states per slot.« less
  5. Abstract

    We study the sampling complexity of a probability distribution associated with an ensemble of identical noninteracting bosons undergoing a quantum random walk on a one-dimensional lattice. With uniform nearest-neighbor hopping we show that one can efficiently sample the distribution for times logarithmic in the size of the system, while for longer times there is no known efficient sampling algorithm. With time-dependent hopping and optimal control, we design the time evolution to approximate an arbitrary Haar-random unitary map analogous to that designed for photons in a linear optical network. This approach highlights a route to generating quantum complexity by optimal control only of a single-body unitary matrix. We study this in the context of two potential experimental realizations: a spinor optical lattice of ultracold atoms and a quantum gas microscope.