Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Noise-Aware Circuit Compilations for a Continuously Parameterized Two-Qubit Gateset

Christopher G. Yale

Published Mar 1, 2024• 0 citations
Publisher
DOI
10.2172/2540393

Related papers

Noise-Aware Error Rate Reduction of Single-Qubit Gates

Thomas J. Maldonado, Alexey Galda, Johannes Flick +2 more

Bulletin of the American Physical Society•Mar 15, 2021•0 citations

Noise-aware circuit compilations for a continuously parameterized two-qubit gateset

Christopher G. Yale, Rich Rines, Victory Omole +9 more

State-of-the-art noisy-intermediate-scale quantum processors are currently implemented across a variety of hardware platforms, each with their own distinct gatesets. As such, circuit compilation should not only be aware of but also deeply connect to the native gateset and noise properties of each. Trapped-ion processors are one such platform that provides a gateset that can be continuously parameterized across both one- and two-qubit gates. Here we use the Quantum Scientific Computing Open User Testbed to study noise-aware compilations focused on continuously parameterized two-qubit Z Z gates (based on the Mølmer-Sørensen interaction) using , a quantum software platform for hardware-aware circuit compiler optimizations. We discuss the realization of Z Z gates with arbitrary angle on the all-to-all connected trapped-ion system. Then we discuss a variety of different compiler optimizations that innately target these Z Z gates and their noise properties. These optimizations include moving from a restricted maximally entangling gateset to a continuously parameterized one, swap mirroring to further reduce the total entangling angle of the operations, focusing the heaviest Z Z angle participation on the best-performing gate pairs, and circuit approximation to remove the least impactful Z Z gates. We demonstrate these compilation approaches on the hardware with randomized quantum volume circuits, observing the potential to realize a larger quantum volume as a result of these optimizations. Using differing yet complementary analysis techniques, we observe the distinct improvements in system performance provided by these noise-aware compilations and study the role of stochastic and coherent error channels for each compilation choice.

arXiv:2411.01094•Physical Review Applied•Jul 14, 2025•5 citations

The Impact of Qubit Connectivity on Quantum Advantage in Noisy IQP Circuits

Leonardo Placidi, Enrico Rinaldi, Keisuke Fujii +1 more

Instantaneous Quantum Polynomial-time (IQP) circuits are a candidate for demonstrating near-term quantum advantage, as their sampling task is believed to be classically hard in the ideal theoretical setting under standard complexity-theoretic assumptions. In noisy implementations, however, this hardness can disappear once circuit depth exceeds a noise-dependent critical threshold. We show that qubit connectivity is a key parameter in this transition, since sparse architectures require additional routing to implement long-range interactions, thereby increasing compiled circuit depth. To make this explicit, we present a connectivity-aware analysis of compiled IQP circuits. For a fixed abstract IQP instance, different hardware connectivity graphs yield different compiled depths and thus different effective positions relative to the noisy-IQP simulatability boundary. We quantify this architecture-dependent shift using the compiled depth overhead and the corresponding simulatability margin. We combine analytic depth estimates for sparse geometries, including the two-dimensional grid, with native-gateset-aware compilation experiments across seven hardware-grounded experimental device models derived from publicly available topologies. To compare these device models under a unified empirical framework, we approximate the effective noise level primarily through reported two-qubit gate error rates. This lets us compare how much effective noise sparse and fully connected architectures can tolerate for the same position relative to the noisy-IQP simulatability boundary. Our results show that sparse connectivity requires a lower effective noise level to sustain the same margin relative to the noisy-IQP simulatability boundary, and they provide a quantitative framework for determining when compiled IQP experiments are likely to remain outside, or instead enter, the classically simulatable regime.

quant-pharXiv:2604.12635•Apr 15, 2026•6 citations

Noise-Aware Quantum Circuit Simulation with Decision Diagrams

Thomas Grurl, Jürgen Fuß, Robert Wille

Synthesis lectures on engineering, science, and technology•Nov 29, 2024•0 citations

Risk-aware neural pulse compilation of continuously parameterized single-qubit gates with optimal-control benchmarking and NMR hardware validation

Arash Fath Lipaei, Ebrahim Khaleghian, Gani Göral +3 more

Pulse-level compilation can reduce the depth and calibration overhead associated with decomposing continuously parameterized quantum operations into fixed gate libraries, but conventional optimal control requires a new optimization for each target and can be sensitive to hardware uncertainty. We introduce a physics-informed neural compilation framework that learns a reusable map from continuously parameterized single-qubit gate targets directly to experimentally admissible control waveforms. The compiler is trained end-to-end through differentiable quantum dynamics without precomputed optimal-pulse labels, and its robustness is improved by first diagnosing physically relevant failure modes and then applying tail-risk-aware fine-tuning. On a three-qubit liquid-state nuclear magnetic resonance (NMR) model, the learned compiler generalizes across Haar-distributed single-qubit targets with mean nominal fidelity above 0.99 and generates new pulses in submillisecond inference time. Matched benchmarks reveal complementary advantages: robust gradient ascent pulse engineering (GRAPE) achieves the highest per-target fidelity, whereas the trained neural compiler amortizes the optimization cost across the target family, enabling substantially faster online pulse generation. Risk-aware training substantially broadens tolerance to radio-frequency (RF)-amplitude errors, including perturbations beyond the training range. Experiments on a three-spin NMR processor reproduce the predicted broadening of the RF-tolerance response, although the absolute experimental correlations are lower than the simulated values. These results establish a general workflow combining amortized machine learning, physical sensitivity diagnosis, risk-aware control, optimal-control benchmarking, and hardware testing, providing a route toward fast and robust pulse-level compilation for repeatedly varying quantum operations.

quant-pharXiv:2604.11314•Apr 14, 2026•1 citation

Noise-Aware Qubit Allocation Techniques for NISQ Devices

Michael Cubeddu, Will Finigan, Vitali Vinokour +1 more

Bulletin of the American Physical Society•Mar 2, 2020•0 citations
State-of-the-art noisy-intermediate-scale quantum processors are currently implemented across a variety of hardware platforms, each with their own distinct gatesets. As such, circuit compilation should not only be aware of but also deeply connect to the native gateset and noise properties of each. Trapped-ion processors are one such platform that provides a gateset that can be continuously parameterized across both one- and two-qubit gates. Here we use the Quantum Scientific Computing Open User Testbed to study noise-aware compilations focused on continuously parameterized two-qubit Z Z gates (based on the Mølmer-Sørensen interaction) using , a quantum software platform for hardware-aware circuit compiler optimizations. We discuss the realization of Z Z gates with arbitrary angle on the all-to-all connected trapped-ion system. Then we discuss a variety of different compiler optimizations that innately target these Z Z gates and their noise properties. These optimizations include moving from a restricted maximally entangling gateset to a continuously parameterized one, swap mirroring to further reduce the total entangling angle of the operations, focusing the heaviest Z Z angle participation on the best-performing gate pairs, and circuit approximation to remove the least impactful Z Z gates. We demonstrate these compilation approaches on the hardware with randomized quantum volume circuits, observing the potential to realize a larger quantum volume as a result of these optimizations. Using differing yet complementary analysis techniques, we observe the distinct improvements in system performance provided by these noise-aware compilations and study the role of stochastic and coherent error channels for each compilation choice.
Instantaneous Quantum Polynomial-time (IQP) circuits are a candidate for demonstrating near-term quantum advantage, as their sampling task is believed to be classically hard in the ideal theoretical setting under standard complexity-theoretic assumptions. In noisy implementations, however, this hardness can disappear once circuit depth exceeds a noise-dependent critical threshold. We show that qubit connectivity is a key parameter in this transition, since sparse architectures require additional routing to implement long-range interactions, thereby increasing compiled circuit depth. To make this explicit, we present a connectivity-aware analysis of compiled IQP circuits. For a fixed abstract IQP instance, different hardware connectivity graphs yield different compiled depths and thus different effective positions relative to the noisy-IQP simulatability boundary. We quantify this architecture-dependent shift using the compiled depth overhead and the corresponding simulatability margin. We combine analytic depth estimates for sparse geometries, including the two-dimensional grid, with native-gateset-aware compilation experiments across seven hardware-grounded experimental device models derived from publicly available topologies. To compare these device models under a unified empirical framework, we approximate the effective noise level primarily through reported two-qubit gate error rates. This lets us compare how much effective noise sparse and fully connected architectures can tolerate for the same position relative to the noisy-IQP simulatability boundary. Our results show that sparse connectivity requires a lower effective noise level to sustain the same margin relative to the noisy-IQP simulatability boundary, and they provide a quantitative framework for determining when compiled IQP experiments are likely to remain outside, or instead enter, the classically simulatable regime.
Pulse-level compilation can reduce the depth and calibration overhead associated with decomposing continuously parameterized quantum operations into fixed gate libraries, but conventional optimal control requires a new optimization for each target and can be sensitive to hardware uncertainty. We introduce a physics-informed neural compilation framework that learns a reusable map from continuously parameterized single-qubit gate targets directly to experimentally admissible control waveforms. The compiler is trained end-to-end through differentiable quantum dynamics without precomputed optimal-pulse labels, and its robustness is improved by first diagnosing physically relevant failure modes and then applying tail-risk-aware fine-tuning. On a three-qubit liquid-state nuclear magnetic resonance (NMR) model, the learned compiler generalizes across Haar-distributed single-qubit targets with mean nominal fidelity above 0.99 and generates new pulses in submillisecond inference time. Matched benchmarks reveal complementary advantages: robust gradient ascent pulse engineering (GRAPE) achieves the highest per-target fidelity, whereas the trained neural compiler amortizes the optimization cost across the target family, enabling substantially faster online pulse generation. Risk-aware training substantially broadens tolerance to radio-frequency (RF)-amplitude errors, including perturbations beyond the training range. Experiments on a three-spin NMR processor reproduce the predicted broadening of the RF-tolerance response, although the absolute experimental correlations are lower than the simulated values. These results establish a general workflow combining amortized machine learning, physical sensitivity diagnosis, risk-aware control, optimal-control benchmarking, and hardware testing, providing a route toward fast and robust pulse-level compilation for repeatedly varying quantum operations.