Implementation of a quantum addressable router using superconducting qubits

• URL: http://arxiv.org/abs/2503.04295v2
• Date: Thu, 03 Apr 2025 20:24:44 GMT
• Title: Implementation of a quantum addressable router using superconducting qubits
• Authors: Connie Miao, Sébastien Léger, Ziqian Li, Gideon Lee, Liang Jiang, David I. Schuster,
• Abstract summary: We realize a Q2-router that uses fixed-frequency transmon qubits to implement a routing protocol based on two native controlled-iSWAP gates.<n>We find an estimated average routing fidelity of 95.3%, with errors arising primarily from decoherence or state preparation and measurement.
• Score: 1.882190456060289
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The implementation of a quantum router capable of performing both quantum signal routing and quantum addressing (a Q2-router) represents a key step toward building quantum networks and quantum random access memories. We realize a Q2-router that uses fixed-frequency transmon qubits to implement a routing protocol based on two native controlled-iSWAP gates. These gates leverage a large ZZ interaction to selectively route information according to a quantum address. We find an estimated average routing fidelity of 95.3%, with errors arising primarily from decoherence or state preparation and measurement. We present a comprehensive calibration and characterization of both the c-iSWAP gates and the overall routing protocol through randomized benchmarking techniques and state tomography.

Related papers

• Demonstrating Coherent Quantum Routers for Bucket-Brigade Quantum Random Access Memory on a Superconducting Processor [12.944302217239247]
  We demonstrate coherent quantum routers using a superconducting quantum processor.<n>We achieve individual Q fidelities up to 95.74%, and validate scalability through a two-layer quantum routing network.
  arXiv  Detail & Related papers  (2025-05-20T05:42:19Z)
• Roadmap to fault tolerant quantum computation using topological qubit arrays [37.024540100400536]
  We describe a device roadmap towards a fault-tolerant quantum computing architecture based on noise-resilient, topologically protected Majorana-based qubits.<n>Our roadmap encompasses four generations of devices: a single-qubit device that enables a measurement-based qubit benchmarking protocol; a two-qubit device that uses measurement-based braiding to perform single-qubit Clifford operations; and an eight-qubit device that can be used to show an improvement of a two-qubit operation when performed on logical qubits.
  arXiv  Detail & Related papers  (2025-02-17T19:00:10Z)
• Characterization of Noise using variants of Unitarity Randomized Benchmarking [6.376549579074444]
  Unitarity randomized benchmarking (URB) protocol is a method to estimate the coherence of noise induced by the quantum gates. We for the first time implement the URB protocol in a quantum simulator with all the parameters and noise model are used from a real quantum device.
  arXiv  Detail & Related papers  (2024-10-27T17:46:51Z)
• SWAP-less Implementation of Quantum Algorithms [0.0]
  We present a formalism based on tracking the flow of parity quantum information to implement algorithms on devices with limited connectivity. We leverage the fact that entangling gates not only manipulate quantum states but can also be exploited to transport quantum information.
  arXiv  Detail & Related papers  (2024-08-20T14:51:00Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Multi-User Entanglement Distribution in Quantum Networks Using Multipath Routing [55.2480439325792]
  We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing. The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
  arXiv  Detail & Related papers  (2023-03-06T18:06:00Z)
• Quantum Routing for Emerging Quantum Networks [0.0]
  Quantum routing, the entanglement of an input quantum signal over multiple output paths, will be an important aspect of future quantum networks. We design a combined circuit for quantum routing and quantum error correction, and carry out the first implementation of such a circuit on a noisy real-world quantum device. Our experiments validate, for the first time, that error-corrected quantum routing in near-term noisy quantum-computing devices is feasible.
  arXiv  Detail & Related papers  (2022-11-11T08:58:29Z)
• Scalable fast benchmarking for individual quantum gates with local twirling [1.7995166939620801]
  We propose a character-cycle benchmarking protocol and a character-average benchmarking protocol only using local twirling gates. We numerically demonstrate our protocols for a non-Clifford gate -- controlled-$(TX)$ and a Clifford gate -- five-qubit quantum error-correcting encoding circuit.
  arXiv  Detail & Related papers  (2022-03-19T13:01:14Z)
• Quantum thermodynamic methods to purify a qubit on a quantum processing unit [68.8204255655161]
  We report on a quantum thermodynamic method to purify a qubit on a quantum processing unit equipped with identical qubits. Our starting point is a three qubit design that emulates the well known two qubit swap engine. We implement it on a publicly available superconducting qubit based QPU, and observe a purification capability down to 200 mK.
  arXiv  Detail & Related papers  (2022-01-31T16:13:57Z)
• Purification and Entanglement Routing on Quantum Networks [55.41644538483948]
  A quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between users. We introduce effectives enabling fast path-finding algorithms for maximizing entanglement shared between two nodes on a quantum network.
  arXiv  Detail & Related papers  (2020-11-23T19:00:01Z)
• Using Reinforcement Learning to Perform Qubit Routing in Quantum Compilers [0.0]
  We propose a qubit routing procedure that uses a modified version of the deep Q-learning paradigm. The system is able to outperform the qubit routing procedures from two of the most advanced quantum compilers currently available.
  arXiv  Detail & Related papers  (2020-07-31T10:57:24Z)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)
• Programming a quantum computer with quantum instructions [39.994876450026865]
  We use a density matrixiation protocol to execute quantum instructions on quantum data. A fixed sequence of classically-defined gates performs an operation that uniquely depends on an auxiliary quantum instruction state. The utilization of quantum instructions obviates the need for costly tomographic state reconstruction and recompilation.
  arXiv  Detail & Related papers  (2020-01-23T22:43:29Z)

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.