Decomposing and Routing Quantum Circuits Under Constraints for Neutral Atom Architectures

• URL: http://arxiv.org/abs/2307.14996v1
• Date: Thu, 27 Jul 2023 16:47:13 GMT
• Title: Decomposing and Routing Quantum Circuits Under Constraints for Neutral Atom Architectures
• Authors: Natalia Nottingham, Michael A. Perlin, Ryan White, Hannes Bernien, Frederic T. Chong, and Jonathan M. Baker
• Abstract summary: We propose the first compiler designed to overcome the challenges of limited local addressibility in neutral atom quantum computers. We present algorithms to decompose circuits into the neutral atom native gate set, with emphasis on optimizing total pulse area of global gates. Our decomposition optimizations result in up to 3.5x and 2.9x speedup in time spent executing global gates and time spent executing single-qubit gates.
• Score: 3.4374322617416166
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum computing is in an era defined by rapidly evolving quantum hardware technologies, combined with persisting high gate error rates, large amounts of noise, and short coherence times. Overcoming these limitations requires systems-level approaches that account for the strengths and weaknesses of the underlying hardware technology. Yet few hardware-aware compiler techniques exist for neutral atom devices, with no prior work on compiling to the neutral atom native gate set. In particular, current neutral atom hardware does not support certain single-qubit rotations via local addressing, which often requires the circuit to be decomposed into a large number of gates, leading to long circuit durations and low overall fidelities. We propose the first compiler designed to overcome the challenges of limited local addressibility in neutral atom quantum computers. We present algorithms to decompose circuits into the neutral atom native gate set, with emphasis on optimizing total pulse area of global gates, which dominate gate execution costs in several current architectures. Furthermore, we explore atom movement as an alternative to expensive gate decompositions, gaining immense speedup with routing, which remains a huge overhead for many quantum circuits. Our decomposition optimizations result in up to ~3.5x and ~2.9x speedup in time spent executing global gates and time spent executing single-qubit gates, respectively. When combined with our atom movement routing algorithms, our compiler achieves up to ~10x reduction in circuit duration, with over ~2x improvement in fidelity. We show that our compiler strategies can be adapted for a variety of hardware-level parameters as neutral atom technology continues to develop.

Related papers

• Unlocking the power of global quantum gates with machine learning [3.9000096678531606]
  We study a circuit ansatze composed of a finite number of global gates and layers of single-qubit unitaries. We demonstrate the expressibility of these ansatze and apply them to the problem of ground state preparation for the Heisenberg model and the toric code Hamiltonian.
  arXiv  Detail & Related papers  (2025-02-04T15:24:12Z)
• Universal quantum computation via scalable measurement-free error correction [45.29832252085144]
  We show that universal quantum computation can be made fault-tolerant in a scenario where the error-correction is implemented without mid-circuit measurements. We introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical $mathitCCZ$ gate. In particular, our findings support that below-breakeven logical performance is achievable with a circuit-level error rate below $10-3$.
  arXiv  Detail & Related papers  (2024-12-19T18:55:44Z)
• On the Constant Depth Implementation of Pauli Exponentials [49.48516314472825]
  We decompose arbitrary exponentials into circuits of constant depth using $mathcalO(n)$ ancillae and two-body XX and ZZ interactions. We prove the correctness of our approach, after introducing novel rewrite rules for circuits which benefit from qubit recycling.
  arXiv  Detail & Related papers  (2024-08-15T17:09:08Z)
• Efficient Implementation of Multi-Controlled Quantum Gates [0.0]
  We present an implementation of multi-controlled quantum gates which provides significant reductions of cost compared to state-of-the-art methods. We extend our methods for any number of target qubits, and provide further cost reductions if additional ancilla qubits are available.
  arXiv  Detail & Related papers  (2024-04-02T20:13:18Z)
• PreRoutGNN for Timing Prediction with Order Preserving Partition: Global Circuit Pre-training, Local Delay Learning and Attentional Cell Modeling [84.34811206119619]
  We propose a two-stage approach to pre-routing timing prediction. First, we propose global circuit training to pre-train a graph auto-encoder that learns the global graph embedding from circuit netlist. Second, we use a novel node updating scheme for message passing on GCN, following the topological sorting sequence of the learned graph embedding and circuit graph. Experiments on 21 real world circuits achieve a new SOTA R2 of 0.93 for slack prediction, which is significantly surpasses 0.59 by previous SOTA method.
  arXiv  Detail & Related papers  (2024-02-27T02:23:07Z)
• Improving Qubit Routing by Using Entanglement Mediated Remote Gates [1.9299285312415735]
  Near-term quantum computers often have connectivity constraints, on which pairs of qubits in the device can interact. We develop a method to optimize the routing of circuits with both standard gates and EPR mediated remote controlled-NOT gates. We demonstrate that EPR-mediated operations can substantially reduce the total number of gates and depths of compiled circuits.
  arXiv  Detail & Related papers  (2023-09-22T18:51:36Z)
• Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array Processors [5.012570785656963]
  Dynamically field-programmable qubit arrays (DPQA) have emerged as a promising platform for quantum information processing. In this paper, we consider a DPQA architecture that contains multiple arrays and supports 2D array movements. We show that our DPQA-based compiled circuits feature reduced scaling overhead compared to a grid fixed architecture.
  arXiv  Detail & Related papers  (2023-06-06T08:13:10Z)
• 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)
• Reducing Runtime Overhead via Use-Based Migration in Neutral Atom Quantum Architectures [0.0]
  We develop strategies to combat the detrimental effects of lost computational space. We divide the architecture into separate sections, and run the circuit in each section, free of lost atoms. These techniques reduce the overall runtime by a total 50% for 30 qubit circuit.
  arXiv  Detail & Related papers  (2022-11-28T20:24:17Z)
• Transversal Injection: A method for direct encoding of ancilla states for non-Clifford gates using stabiliser codes [55.90903601048249]
  We introduce a protocol to potentially reduce this overhead for non-Clifford gates. Preliminary results hint at high quality fidelities at larger distances.
  arXiv  Detail & Related papers  (2022-11-18T06:03:10Z)
• Exploiting Long-Distance Interactions and Tolerating Atom Loss in Neutral Atom Quantum Architectures [4.979871961444077]
  We evaluate the advantages and disadvantages of a Neutral Atom (NA) architecture. NA systems offer several promising advantages such as long range interactions and native multiqubit gates. We propose hardware and compiler methods to increase system resilience to atom loss dramatically reducing total computation time.
  arXiv  Detail & Related papers  (2021-11-11T21:34:31Z)
• Software mitigation of coherent two-qubit gate errors [55.878249096379804]
  Two-qubit gates are important components of quantum computing. But unwanted interactions between qubits (so-called parasitic gates) can degrade the performance of quantum applications. We present two software methods to mitigate parasitic two-qubit gate errors.
  arXiv  Detail & Related papers  (2021-11-08T17:37:27Z)
• Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms [55.41644538483948]
  We provide the first complete characterization of sources of error in a neutral-atom quantum computer. We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
  arXiv  Detail & Related papers  (2021-05-27T23:29:53Z)

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.