skip to main content

Explore Research Products in the NSF-PAR

Title: Efficient Distribution of Quantum Circuits
Quantum computing hardware is improving in robustness, but individual computers still have small number of qubits (for storing quantum information). Computations needing a large number of qubits can only be performed by distributing them over a network of smaller quantum computers. In this paper, we consider the problem of distributing a quantum computation, represented as a quantum circuit, over a homogeneous network of quantum computers, minimizing the number of communication operations needed to complete every step of the computation. We propose a two-step solution: dividing the given circuit’s qubits among the computers in the network, and scheduling communication operations, called migrations, to share quantum information among the computers to ensure that every operation can be performed locally. While the first step is an intractable problem, we present a polynomial-time solution for the second step in a special setting, and a O(log n)-approximate solution in the general setting. We provide empirical results which show that our two-step solution outperforms existing heuristic for this problem by a significant margin (up to 90%, in some cases).  more » « less
Award ID(s):
2106447
NSF-PAR ID:
10352366
Author(s) / Creator(s):
; ;
Editor(s):
Gilbert, Seth
Publisher / Repository:
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Date Published:
Volume:
209
ISSN:
1868-8969
ISBN:
978-3-95977-210-5
Subject(s) / Keyword(s):
Distributed Quantum Computing Hypergraph Min-Cut Computing methodologies → Distributed computing methodologies Computing methodologies → Distributed algorithms
Format(s):
Medium: X Size: 20 pages; 1910061 bytes Other: application/pdf
Size(s):
20 pages 1910061 bytes
Right(s):
Creative Commons Attribution 4.0 International license; info:eu-repo/semantics/openAccess
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; ; ; ; ; ; ( , Nature Communications)
    null (Ed.)
    Abstract The transfer of information between quantum systems is essential for quantum communication and computation. In quantum computers, high connectivity between qubits can improve the efficiency of algorithms, assist in error correction, and enable high-fidelity readout. However, as with all quantum gates, operations to transfer information between qubits can suffer from errors associated with spurious interactions and disorder between qubits, among other things. Here, we harness interactions and disorder between qubits to improve a swap operation for spin eigenstates in semiconductor gate-defined quantum-dot spins. We use a system of four electron spins, which we configure as two exchange-coupled singlet–triplet qubits. Our approach, which relies on the physics underlying discrete time crystals, enhances the quality factor of spin-eigenstate swaps by up to an order of magnitude. Our results show how interactions and disorder in multi-qubit systems can stabilize non-trivial quantum operations and suggest potential uses for non-equilibrium quantum phenomena, like time crystals, in quantum information processing applications. Our results also confirm the long-predicted emergence of effective Ising interactions between exchange-coupled singlet–triplet qubits. 
    more » « less
  2. ; ( , 2021 IEEE International Conference on Quantum Computing and Engineering (QCE))
    Graph states form an important class of multipartite entangled quantum states. We propose a new approach for distributing graph states across a quantum network. We consider a quantum network consisting of nodes—quantum computers within which local operations are free—and EPR pairs shared between nodes that can continually be generated. We prove upper bounds for our approach on the number of EPR pairs consumed, completion time, and amount of classical communication required, all of which are equal to or better than that of prior work [10]. We also reduce the problem of minimizing the completion time to distribute a graph state using our approach to a network flow problem having polynomial time complexity. 
    more » « less
  3. ; ; ; ; ; ; ; ; ; ; et al ( , ACM)
    Cloud-based quantum computers have become a re- ality with a number of companies allowing for cloud-based access to their machines with tens to more than 100 qubits. With easy access to quantum computers, quantum information processing will potentially revolutionize computation, and superconducting transmon-based quantum computers are among some of the more promising devices available. Cloud service providers today host a variety of these and other prototype quantum computers with highly diverse device properties, sizes, and performances. The variation that exists in today’s quantum computers, even among those of the same underlying hardware, motivate the study of how one device can be clearly differentiated and identified from the next. As a case study, this work focuses on the properties of 25 IBM superconducting, fixed-frequency transmon-based quantum computers that range in age from a few months to approximately 2.5 years. Through the analysis of current and historical quantum computer calibration data, this work uncovers key features within the machines, primarily frequency characteristics of transmon qubits, that can serve as a basis for a unique hardware fingerprint of each quantum computer. 
    more » « less
  4. ; ; ; ( , Quantum)

    Dynamically field-programmable qubit arrays (DPQA) have recently emerged as a promising platform for quantum information processing. In DPQA, atomic qubits are selectively loaded into arrays of optical traps that can be reconfigured during the computation itself. Leveraging qubit transport and parallel, entangling quantum operations, different pairs of qubits, even those initially far away, can be entangled at different stages of the quantum program execution. Such reconfigurability and non-local connectivity present new challenges for compilation, especially in the layout synthesis step which places and routes the qubits and schedules the gates. In this paper, we consider a DPQA architecture that contains multiple arrays and supports 2D array movements, representing cutting-edge experimental platforms. Within this architecture, we discretize the state space and formulate layout synthesis as a satisfiability modulo theories problem, which can be solved by existing solvers optimally in terms of circuit depth. For a set of benchmark circuits generated by random graphs with complex connectivities, our compiler OLSQ-DPQA reduces the number of two-qubit entangling gates on small problem instances by 1.7x compared to optimal compilation results on a fixed planar architecture. To further improve scalability and practicality of the method, we introduce a greedy heuristic inspired by the iterative peeling approach in classical integrated circuit routing. Using a hybrid approach that combined the greedy and optimal methods, we demonstrate that our DPQA-based compiled circuits feature reduced scaling overhead compared to a grid fixed architecture, resulting in 5.1X less two-qubit gates for 90 qubit quantum circuits. These methods enable programmable, complex quantum circuits with neutral atom quantum computers, as well as informing both future compilers and future hardware choices.

     
    more » « less
  5. ; ; ; ; ; ; ; ; ; ; et al ( , Nature)
    Abstract

    A key challenge in realizing practical quantum networks for long-distance quantum communication involves robust entanglement between quantum memory nodes connected by fibre optical infrastructure1–3. Here we demonstrate a two-node quantum network composed of multi-qubit registers based on silicon-vacancy (SiV) centres in nanophotonic diamond cavities integrated with a telecommunication fibre network. Remote entanglement is generated by the cavity-enhanced interactions between the electron spin qubits of the SiVs and optical photons. Serial, heralded spin-photon entangling gate operations with time-bin qubits are used for robust entanglement of separated nodes. Long-lived nuclear spin qubits are used to provide second-long entanglement storage and integrated error detection. By integrating efficient bidirectional quantum frequency conversion of photonic communication qubits to telecommunication frequencies (1,350 nm), we demonstrate the entanglement of two nuclear spin memories through 40 km spools of low-loss fibre and a 35-km long fibre loop deployed in the Boston area urban environment, representing an enabling step towards practical quantum repeaters and large-scale quantum networks.

     
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email