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
- Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
We develop a reinforcement learning-based quantum compiler for a superconducting processor.
We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths.
Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
arXiv Detail & Related papers (2024-06-18T01:49:48Z) - A Fast and Adaptable Algorithm for Optimal Multi-Qubit Pathfinding in Quantum Circuit Compilation [0.0]
This work focuses on multi-qubit pathfinding as a critical subroutine within the quantum circuit compilation mapping problem.
We introduce an algorithm, modelled using binary integer linear programming, that navigates qubits on quantum hardware optimally with respect to circuit SWAP-gate depth.
We have benchmarked the algorithm across a variety of quantum hardware layouts, assessing properties such as computational runtimes, solution SWAP depths, and accumulated SWAP-gate error rates.
arXiv Detail & Related papers (2024-05-29T05:59:15Z) - Arctic: A Field Programmable Quantum Array Scheduling Technique [0.0]
I present the first compiler pass designed to optimize reconfigurable coupling in zoned neutral atom architectures.
I approach qubit mapping and movement scheduling as a max-cut and layered cross-minimization problem.
I compare the method across various algorithms sourced from Supermarq and Qasmbench.
arXiv Detail & Related papers (2024-05-10T01:56:01Z) - 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) - Optimizing quantum gates towards the scale of logical qubits [78.55133994211627]
A foundational assumption of quantum gates theory is that quantum gates can be scaled to large processors without exceeding the error-threshold for fault tolerance.
Here we report on a strategy that can overcome such problems.
We demonstrate it by choreographing the frequency trajectories of 68 frequency-tunablebits to execute single qubit while superconducting errors.
arXiv Detail & Related papers (2023-08-04T13:39:46Z) - Quantum Gate Optimization for Rydberg Architectures in the Weak-Coupling
Limit [55.05109484230879]
We demonstrate machine learning assisted design of a two-qubit gate in a Rydberg tweezer system.
We generate optimal pulse sequences that implement a CNOT gate with high fidelity.
We show that local control of single qubit operations is sufficient for performing quantum computation on a large array of atoms.
arXiv Detail & Related papers (2023-06-14T18:24:51Z) - High-fidelity parallel entangling gates on a neutral atom quantum
computer [41.74498230885008]
We report the realization of two-qubit entangling gates with 99.5% fidelity on up to 60 atoms in parallel.
These advances lay the groundwork for large-scale implementation of quantum algorithms, error-corrected circuits, and digital simulations.
arXiv Detail & Related papers (2023-04-11T18:00:04Z) - BQA: A High-performance Quantum Circuits Scheduling Strategy Based on
Heuristic Search [6.765549459416703]
It is necessary to ensure that the two-qubit gate acts on a pair of coupled qubits by inserting swap gates.
In this paper, we designed a way based on the business to insert swap gates BQA(Busy Qubits Avoid)
Compared with qiskit, the execution time of the circuit optimized by our proposed method is only 0.5 times that of the qiskit compiled circuit.
arXiv Detail & Related papers (2022-09-08T02:49:51Z) - 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) - 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.