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

arXiv:2009.05532 · Nature Physics

Limitations of optimization algorithms on noisy quantum devices

Daniel Stilck França, Raúl García−Patrón

Published Oct 21, 2021• 282 citations
arXivHTMLPDF
DOI
10.1038/s41567-021-01356-3

Related papers

Towards noise-resilient quantum optimization

Madelyn Cain, Leo Zhou, Hannes Pichler +2 more

Bulletin of the American Physical Society•Jun 3, 2021•0 citations

Near-optimal routing of noisy quantum states

Ronald J. Sadlier, Travis S. Humble

Placement, routing, and scheduling are essential tasks for near-optimal performance of programs for noisy quantum processors. Reliable execution of an arbitrary quantum circuit on current devices requires routing methods that overcome connectivity limitations while meeting data locality requirements. However, current devices also express highly variable noise levels in both the quantum gates and quantum registers. This requires any routing algorithm to be adaptive to both the circuit and the operating conditions. We demonstrate near-optimal routing methods of noisy quantum states that minimize the overall error of data movement while also limiting the computational complexity of routing decisions. We evaluate our methods against the noise characteristics of a 20-qubit superconducting quantum processor.

Quantum Communications and Quantum Imaging•Sep 6, 2019•2 citations

The Average Relative Entropy and Transpilation Depth determines the noise robustness in Variational Quantum Classifiers

Aakash Ravindra Shinde, Arianne Meijer - van de Griend, Jukka K. Nurminen

Variational Quantum Algorithms (VQAs) have been extensively researched for applications in Quantum Machine Learning (QML), Optimization, and Molecular simulations. Although designed for Noisy Intermediate-Scale Quantum (NISQ) devices, VQAs are predominantly evaluated classically due to uncertain results on noisy devices and limited resource availability. Raising concern over the reproducibility of simulated VQAs on noisy hardware. While prior studies indicate that VQAs may exhibit noise resilience in specific parameterized shallow quantum circuits, there are no definitive measures to establish what defines a shallow circuit or the optimal circuit depth for VQAs on a noisy platform. These challenges extend naturally to Variational Quantum Classification (VQC) algorithms, a subclass of VQAs for supervised learning. In this article, we propose a relative entropy-based metric to verify whether a VQC model would perform similarly on a noisy device as it does on simulations. We establish a strong correlation between the average relative entropy difference in classes, transpilation circuit depth, and their performance difference on a noisy quantum device. Our results further indicate that circuit depth alone is insufficient to characterize shallow circuits. We present empirical evidence to support these assertions across a diverse array of techniques for implementing VQC, datasets, and multiple noisy quantum devices.

quant-pharXiv:2603.21300•Mar 24, 2026•0 citations

Towards practical quantum optimization

András Czégel

•Sep 18, 2026•0 citations

Optimization of CNOT circuits on limited-connectivity architecture

Bujiao Wu, Xiaoyu He, Shuai Yang +4 more

A controlled-not (cnot) circuit is the key gadget for entangling qubits in quantum computing systems. However, the qubit connectivity of noisy intermediate-scale quantum (NISQ) devices is constrained by their limited-connectivity architecture. To improve the performance of cnot circuits on NISQ devices, we investigate the optimization of the size/depth of cnot circuits under the limited-connectivity architecture. We present a method that can optimize the size of any $n$-qubit cnot circuit $O(\frac{{n}^{2}}{log\ensuremath{\delta}})$ on any connected graph with minimum degree $\ensuremath{\delta}$, and prove this bound is optimal for the regular graph. For the near-term sparsely connected structure, we additionally present a method that can optimize the size of any $n$-qubit cnot circuit to below $2{n}^{2}$. The numerical experiment shows that our method performs better than state-of-the-art results. Specifically, we present an example to illustrate the applicability of our algorithm. For the grid structure, which is commonly used in current quantum devices, we demonstrate that the depth of any $n$-qubit cnot circuit can be optimized to be linear in $n$ with certain ancillary qubits (ancillas). Experimental results indicate that this method has significant improvements compared with all of the existing methods. We additionally test our algorithms on the five-qubit IBMQ devices, and the experiments show that the measurement results of the optimized circuit with our algorithm are more robust to noise compared with the IBM mapping method.

arXiv:1910.14478•Physical Review Research•Jan 31, 2023•36 citations

Challenges and opportunities in quantum optimization

Amira Abbas, Andris Ambainis, Brandon Augustino +43 more

arXiv:2312.02279•Nature Reviews Physics•Oct 28, 2024•424 citations
Placement, routing, and scheduling are essential tasks for near-optimal performance of programs for noisy quantum processors. Reliable execution of an arbitrary quantum circuit on current devices requires routing methods that overcome connectivity limitations while meeting data locality requirements. However, current devices also express highly variable noise levels in both the quantum gates and quantum registers. This requires any routing algorithm to be adaptive to both the circuit and the operating conditions. We demonstrate near-optimal routing methods of noisy quantum states that minimize the overall error of data movement while also limiting the computational complexity of routing decisions. We evaluate our methods against the noise characteristics of a 20-qubit superconducting quantum processor.
Variational Quantum Algorithms (VQAs) have been extensively researched for applications in Quantum Machine Learning (QML), Optimization, and Molecular simulations. Although designed for Noisy Intermediate-Scale Quantum (NISQ) devices, VQAs are predominantly evaluated classically due to uncertain results on noisy devices and limited resource availability. Raising concern over the reproducibility of simulated VQAs on noisy hardware. While prior studies indicate that VQAs may exhibit noise resilience in specific parameterized shallow quantum circuits, there are no definitive measures to establish what defines a shallow circuit or the optimal circuit depth for VQAs on a noisy platform. These challenges extend naturally to Variational Quantum Classification (VQC) algorithms, a subclass of VQAs for supervised learning. In this article, we propose a relative entropy-based metric to verify whether a VQC model would perform similarly on a noisy device as it does on simulations. We establish a strong correlation between the average relative entropy difference in classes, transpilation circuit depth, and their performance difference on a noisy quantum device. Our results further indicate that circuit depth alone is insufficient to characterize shallow circuits. We present empirical evidence to support these assertions across a diverse array of techniques for implementing VQC, datasets, and multiple noisy quantum devices.
A controlled-not (cnot) circuit is the key gadget for entangling qubits in quantum computing systems. However, the qubit connectivity of noisy intermediate-scale quantum (NISQ) devices is constrained by their limited-connectivity architecture. To improve the performance of cnot circuits on NISQ devices, we investigate the optimization of the size/depth of cnot circuits under the limited-connectivity architecture. We present a method that can optimize the size of any nnn-qubit cnot circuit $O(\frac{{n}^{2}}{log\ensuremath{\delta}})$ on any connected graph with minimum degree $\ensuremath{\delta}$, and prove this bound is optimal for the regular graph. For the near-term sparsely connected structure, we additionally present a method that can optimize the size of any nnn-qubit cnot circuit to below 2n22{n}^{2}2n2. The numerical experiment shows that our method performs better than state-of-the-art results. Specifically, we present an example to illustrate the applicability of our algorithm. For the grid structure, which is commonly used in current quantum devices, we demonstrate that the depth of any nnn-qubit cnot circuit can be optimized to be linear in nnn with certain ancillary qubits (ancillas). Experimental results indicate that this method has significant improvements compared with all of the existing methods. We additionally test our algorithms on the five-qubit IBMQ devices, and the experiments show that the measurement results of the optimized circuit with our algorithm are more robust to noise compared with the IBM mapping method.