Co-Designed Architectures for Modular Superconducting Quantum Computers

• URL: http://arxiv.org/abs/2205.04387v3
• Date: Wed, 19 Oct 2022 21:37:37 GMT
• Title: Co-Designed Architectures for Modular Superconducting Quantum Computers
• Authors: Evan McKinney, Mingkang Xia, Chao Zhou, Pinlei Lu, Michael Hatridge, Alex K. Jones
• Abstract summary: Noisy, Intermediate Scale Quantum (NISQ) computers have reached the point where they can show the potential for quantum advantage over classical computing. We propose a co-designed superconducting quantum computer using a Superconducting Asymmetric Inductive eLement modulator.
• Score: 2.415999158941119
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Noisy, Intermediate Scale Quantum (NISQ) computers have reached the point where they can show the potential for quantum advantage over classical computing. Unfortunately, NISQ machines introduce sufficient noise that even for moderate size quantum circuits the results can be unreliable. We propose a co-designed superconducting quantum computer using a Superconducting Nonlinear Asymmetric Inductive eLement (SNAIL) modulator. The SNAIL modulator is designed by considering both the ideal fundamental qubit gate operation while maximizing the qubit coupling capabilities. First, the SNAIL natively implements $\sqrt[n]{\texttt{iSWAP}}$ gates realized through proportionally scaled pulse lengths. This naturally includes $\sqrt{\texttt{iSWAP}}$, which provides an advantage over $\texttt{CNOT}$ as a basis gate. Second, the SNAIL enables high-degree couplings that allow rich and highly parallel qubit connection topologies without suffering from frequency crowding. Building on our previously demonstrated SNAIL-based quantum state router we propose a quantum 4-ary tree and a hypercube inspired corral built from interconnected quantum modules. We compare their advantage in data movement based on necessary \texttt{SWAP} gates to the traditional lattice and heavy-hex lattice used in latest commercial quantum computers. We demonstrate the co-design advantage of our SNAIL-based machine with $\sqrt{\texttt{iSWAP}}$ basis gates and rich topologies against $\texttt{CNOT}$/heavy-hex and $\texttt{FSIM}$/lattice for 16-20 qubit and extrapolated designs circa 80 qubit architectures. We compare total circuit time and total gate count to understand fidelity for systems dominated by decoherence and control imperfections, respectively. Finally, we provide a gate duration sensitivity study on further decreasing the SNAIL pulse length to realize $\sqrt[n]{\texttt{iSWAP}}$ qubit systems to reduce decoherence times.

Related papers

• Quantum Neural Network Training of a Repeater Node [0.0]
  Real-world quantum computers suffer from many forms of noise, characterized by the decoherence and relaxation times of a quantum circuit. A quantum neural network (QNN) is constructed to perform the swap operation and compare a trained QNN solution to the standard swap gate. We find that the QNN easily generalizes for two qubits and can be scaled up to more qubits without additional training.
  arXiv  Detail & Related papers  (2024-08-08T18:19:09Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• NFNet: Non-interacting Fermion Network for Efficient Simulation of Large-scale Quantum Systems [0.0]
  NFNet is a framework for simulation of large-scale, continuously controlled quantum systems. It supports parallel matrix computation and auto-differentiation of network parameters. NFNet is both an efficient large-scale quantum simulator, and a quantum-inspired classical computing network structure.
  arXiv  Detail & Related papers  (2022-12-12T09:02:21Z)
• Universal qudit gate synthesis for transmons [44.22241766275732]
  We design a superconducting qudit-based quantum processor. We propose a universal gate set featuring a two-qudit cross-resonance entangling gate. We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
  arXiv  Detail & Related papers  (2022-12-08T18:59:53Z)
• QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional Networks [124.7972093110732]
  We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations. To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections. Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
  arXiv  Detail & Related papers  (2022-11-09T21:43:16Z)
• A trapped ion quantum computer with robust entangling gates and quantum coherent feedback [0.0]
  Chains of ions held in a linear Paul trap are a promising platform for constructing such quantum computers. We report on the construction of a small, five-qubit, universal quantum computer using $88textSr+$ ions in an RF trap.
  arXiv  Detail & Related papers  (2021-11-07T19:17:23Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• A quantum algorithm for training wide and deep classical neural networks [72.2614468437919]
  We show that conditions amenable to classical trainability via gradient descent coincide with those necessary for efficiently solving quantum linear systems. We numerically demonstrate that the MNIST image dataset satisfies such conditions. We provide empirical evidence for $O(log n)$ training of a convolutional neural network with pooling.
  arXiv  Detail & Related papers  (2021-07-19T23:41:03Z)
• Superconducting Circuit Architecture for Digital-Analog Quantum Computing [0.0]
  superconducting circuit architecture suitable for digital-analog quantum computing (DAQC) DAQC makes a smart use of digital steps (single qubit rotations) and analog blocks (parametrized multiqubit operations) to outperform digital quantum computing algorithms.
  arXiv  Detail & Related papers  (2021-03-29T15:29:58Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)
• Universal topological quantum computation with strongly correlated Majorana edge modes [7.930410828384357]
  Majorana-based quantum gates are not complete for performing universal topological quantum computation. We show the application to Shor's integer factorization algorithm.
  arXiv  Detail & Related papers  (2020-04-07T12:03:14Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.