Optimal Mapping for Near-Term Quantum Architectures based on Rydberg Atoms

Brandhofer, Sebastian; Büchler, Hans Peter; Polian, Ilia

doi:10.1109/iccad51958.2021.9643490

Cited by 8 publications

(3 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…1. The pioneering attempt to harness this extra degree of freedom was made by Brandhofer et al [31]. Their approach does not encompass general shuttling operations but focuses solely on one-dimensional displacements of atom rows.…”

Section: Shuttling Compilermentioning

confidence: 99%

“…Manual optimization becomes infeasible as system sizes scale, necessitating automated processes and comprehensive toolkits to establish a complete compilation pipeline. While a multitude of frameworks is available for other hardware platforms, such as superconducting chips [13][14][15][16][17][18][19][20][21][22], or trapped ions [23][24][25][26][27], the landscape of compiler tools tailored to NA-specific hardware constraints [28][29][30][31][32][33][34][35][36] is still less developed.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Computational capabilities and compiler development for neutral atom quantum processors—connecting tool developers and hardware experts

Schmid,

Locher,

Rispler

et al. 2024

Quantum Sci. Technol.

View full text Add to dashboard Cite

Neutral Atom Quantum Computing (NAQC) emerges as a promising hardware platform primarily due to its long coherence times and scalability. Additionally, NAQC offers computational advantages encompassing potential long-range connectivity, native multi-qubit gate support, and the ability to physically rearrange qubits with high fidelity. However, for the successful operation of a NAQC processor, one additionally requires new software tools to translate high-level algorithmic descriptions into a hardware executable representation, taking maximal advantage of the hardware capabilities. Realizing new software tools requires a close connection between tool developers and hardware experts to ensure that the corresponding software tools obey the corresponding physical constraints. This work aims to provide a basis to establish this connection by investigating the broad spectrum of capabilities intrinsic to the NAQC platform and its implications on the compilation process. To this end, we first review the physical background of NAQC and derive how it affects the overall compilation process by formulating suitable constraints and figures of merit. We then provide a summary of the compilation process and discuss currently available software tools in this overview. Finally, we present selected case studies and employ the discussed figures of merit to evaluate the different capabilities of NAQC and compare them between two hardware setups.

show abstract

Section: Shuttling Compilermentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Computational capabilities and compiler development for neutral atom quantum processors—connecting tool developers and hardware experts

Schmid,

Locher,

Rispler

et al. 2024

Quantum Sci. Technol.

View full text Add to dashboard Cite

show abstract

“…Dependencies given by quantum gates or qubit wires within a quantum circuit enforce that the quantum circuit is executed on one partition, i.e. on a set of connected qubits that can interact with each other potentially after inserting auxiliary operations [27]- [32]. Here, a gate dependency represents the requirement of qubits involved in the same multiqubit gate to be connected.…”

Section: Example Quantum Circuit Partitioningmentioning

confidence: 99%

Optimal Partitioning of Quantum Circuits Using Gate Cuts and Wire Cuts

Brandhofer,

Polian,

Krsulich

2024

IEEE Trans. Quantum Eng.

Self Cite

View full text Add to dashboard Cite

A limited number of qubits, high error rates, and limited qubit connectivity are major challenges for effective near-term quantum computations. Quantum circuit partitioning divides a quantum computation into classical postprocessing steps and a set of smaller-scale quantum computations that individually require fewer qubits, lower qubit connectivity, and typically incur less error. However, as partitioning generally increases the duration of a quantum computation exponentially in the required partitioning effort, it is crucial to select optimal partitioning points, so-called cuts, and to use optimal cut realizations. In this work, we develop the first optimal partitioning method relying on quantum circuit knitting for optimal cut realizations and an optimal selection of wire cuts and gate cuts that trades off ancilla qubit insertions for a decrease in quantum computing time. Using this combination, the developed method demonstrates a reduction in quantum computing runtime by 41% on average compared to previous quantum circuit partitioning methods. Furthermore, the qubit requirement of the evaluated quantum circuits was reduced by 40% on average for a runtime budget of one hour and a sampling frequency of 1 kHz. These results highlight the optimality gap of previous quantum circuit partitioning methods and the possible extension in the computational reach of near-term quantum computers.

show abstract

Layout Synthesis for Near-Term Quantum Computing: Gap Analysis and Optimal Solution

Tan

Cong

2022

Design Automation of Quantum Computers

View full text Add to dashboard Cite

Optimal Mapping for Near-Term Quantum Architectures based on Rydberg Atoms

Cited by 8 publications

References 36 publications

Computational capabilities and compiler development for neutral atom quantum processors—connecting tool developers and hardware experts

Computational capabilities and compiler development for neutral atom quantum processors—connecting tool developers and hardware experts

Optimal Partitioning of Quantum Circuits Using Gate Cuts and Wire Cuts

Layout Synthesis for Near-Term Quantum Computing: Gap Analysis and Optimal Solution

Contact Info

Product

Resources

About