IDEAS home Printed from https://ideas.repec.org/a/inm/orijoc/v37y2025i1p22-41.html

Optimized Noise Suppression for Quantum Circuits

Author

Listed:
  • Friedrich Wagner

    (Department of Data Science, University of Erlangen-Nürnberg, 91058 Erlangen, Germany; and Fraunhofer Institute for Integrated Circuits, 90411 Nürnberg, Germany)

  • Daniel J. Egger

    (IBMQuantum, IBM Research Europe – Zurich, CH–8803 Rüschlikon, Switzerland)

  • Frauke Liers

    (Department of Data Science, University of Erlangen-Nürnberg, 91058 Erlangen, Germany)

Abstract

Quantum computation promises to advance a wide range of computational tasks. However, current quantum hardware suffers from noise and is too small for error correction. Thus, accurately utilizing noisy quantum computers strongly relies on noise characterization, mitigation, and suppression. Crucially, these methods must also be efficient in terms of their classical and quantum overhead. Here, we efficiently characterize and mitigate crosstalk noise, which is a severe error source in, for example, cross-resonance based superconducting quantum processors. For crosstalk characterization, we develop a simplified measurement experiment. Furthermore, we analyze the problem of optimal experiment scheduling and solve it for common hardware architectures. After characterization, we mitigate noise in quantum circuits by a noise-aware qubit routing algorithm. Our integer programming algorithm extends previous work on optimized qubit routing by swap insertion. We incorporate the measured crosstalk errors in addition to other, more easily accessible noise data in the objective function. Furthermore, we strengthen the underlying integer linear model by proving a convex hull result about an associated class of polytopes, which has applications beyond this work. We evaluate the proposed method by characterizing crosstalk noise for two chips with up to 127 qubits and leverage the resulting data to improve the approximation ratio of the Quantum Approximate Optimization Algorithm by up to 10% compared with other established noise-aware routing methods. Our work clearly demonstrates the gains of including noise data when mapping abstract quantum circuits to hardware native ones.

Suggested Citation

  • Friedrich Wagner & Daniel J. Egger & Frauke Liers, 2025. "Optimized Noise Suppression for Quantum Circuits," INFORMS Journal on Computing, INFORMS, vol. 37(1), pages 22-41, January.
  • Handle: RePEc:inm:orijoc:v:37:y:2025:i:1:p:22-41
    DOI: 10.1287/ijoc.2024.0551
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/ijoc.2024.0551
    Download Restriction: no

    File URL: https://libkey.io/10.1287/ijoc.2024.0551?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Friedrich Wagner & Andreas Bärmann & Frauke Liers & Markus Weissenbäck, 2023. "Improving Quantum Computation by Optimized Qubit Routing," Journal of Optimization Theory and Applications, Springer, vol. 197(3), pages 1161-1194, June.
    2. Frank Arute & Kunal Arya & Ryan Babbush & Dave Bacon & Joseph C. Bardin & Rami Barends & Rupak Biswas & Sergio Boixo & Fernando G. S. L. Brandao & David A. Buell & Brian Burkett & Yu Chen & Zijun Chen, 2019. "Quantum supremacy using a programmable superconducting processor," Nature, Nature, vol. 574(7779), pages 505-510, October.
    3. Alexander Erhard & Joel J. Wallman & Lukas Postler & Michael Meth & Roman Stricker & Esteban A. Martinez & Philipp Schindler & Thomas Monz & Joseph Emerson & Rainer Blatt, 2019. "Characterizing large-scale quantum computers via cycle benchmarking," Nature Communications, Nature, vol. 10(1), pages 1-7, December.
    4. Youngseok Kim & Andrew Eddins & Sajant Anand & Ken Xuan Wei & Ewout Berg & Sami Rosenblatt & Hasan Nayfeh & Yantao Wu & Michael Zaletel & Kristan Temme & Abhinav Kandala, 2023. "Evidence for the utility of quantum computing before fault tolerance," Nature, Nature, vol. 618(7965), pages 500-505, June.
    5. Jacob Biamonte & Peter Wittek & Nicola Pancotti & Patrick Rebentrost & Nathan Wiebe & Seth Lloyd, 2017. "Quantum machine learning," Nature, Nature, vol. 549(7671), pages 195-202, September.
    6. F. Liers & G. Pardella, 2012. "Partitioning planar graphs: a fast combinatorial approach for max-cut," Computational Optimization and Applications, Springer, vol. 51(1), pages 323-344, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Isaiah Hull & Or Sattath & Eleni Diamanti & Göran Wendin, 2024. "Quantum Algorithms," Contributions to Economics, in: Quantum Technology for Economists, chapter 0, pages 37-103, Springer.
    2. Nikolaos Schetakis & Davit Aghamalyan & Michael Boguslavsky & Agnieszka Rees & Marc Rakotomalala & Paul Robert Griffin, 2024. "Quantum Machine Learning for Credit Scoring," Mathematics, MDPI, vol. 12(9), pages 1-12, May.
    3. Elies Gil-Fuster & Jens Eisert & Carlos Bravo-Prieto, 2024. "Understanding quantum machine learning also requires rethinking generalization," Nature Communications, Nature, vol. 15(1), pages 1-12, December.
    4. Ryan Snodgrass & Vincent Kotsubo & Scott Backhaus & Joel Ullom, 2024. "Dynamic acoustic optimization of pulse tube refrigerators for rapid cooldown," Nature Communications, Nature, vol. 15(1), pages 1-8, December.
    5. Noah Goss & Alexis Morvan & Brian Marinelli & Bradley K. Mitchell & Long B. Nguyen & Ravi K. Naik & Larry Chen & Christian Jünger & John Mark Kreikebaum & David I. Santiago & Joel J. Wallman & Irfan S, 2022. "High-fidelity qutrit entangling gates for superconducting circuits," Nature Communications, Nature, vol. 13(1), pages 1-6, December.
    6. Alen Senanian & Sridhar Prabhu & Vladimir Kremenetski & Saswata Roy & Yingkang Cao & Jeremy Kline & Tatsuhiro Onodera & Logan G. Wright & Xiaodi Wu & Valla Fatemi & Peter L. McMahon, 2024. "Microwave signal processing using an analog quantum reservoir computer," Nature Communications, Nature, vol. 15(1), pages 1-9, December.
    7. Ojas Parekh, 2023. "Synergies Between Operations Research and Quantum Information Science," INFORMS Journal on Computing, INFORMS, vol. 35(2), pages 266-273, March.
    8. Phuong-Nam Nguyen, 2025. "Quantum technology: a financial risk assessment," Digital Finance, Springer, vol. 7(2), pages 133-172, June.
    9. Suhas Ganjam & Yanhao Wang & Yao Lu & Archan Banerjee & Chan U Lei & Lev Krayzman & Kim Kisslinger & Chenyu Zhou & Ruoshui Li & Yichen Jia & Mingzhao Liu & Luigi Frunzio & Robert J. Schoelkopf, 2024. "Surpassing millisecond coherence in on chip superconducting quantum memories by optimizing materials and circuit design," Nature Communications, Nature, vol. 15(1), pages 1-13, December.
    10. Johannes Herrmann & Sergi Masot Llima & Ants Remm & Petr Zapletal & Nathan A. McMahon & Colin Scarato & François Swiadek & Christian Kraglund Andersen & Christoph Hellings & Sebastian Krinner & Nathan, 2022. "Realizing quantum convolutional neural networks on a superconducting quantum processor to recognize quantum phases," Nature Communications, Nature, vol. 13(1), pages 1-7, December.
    11. Ko, Hyunmin & Kwon, Seokbeom, 2025. "Prominence of corporate science in quantum computing research," Technological Forecasting and Social Change, Elsevier, vol. 212(C).
    12. Jing, Hang & Li, Yan & Brandsema, Matthew J. & Chen, Yousu & Yue, Meng, 2024. "HHL algorithm with mapping function and enhanced sampling for model predictive control in microgrids," Applied Energy, Elsevier, vol. 361(C).
    13. Yuxuan Du & Min-Hsiu Hsieh & Dacheng Tao, 2025. "Efficient learning for linear properties of bounded-gate quantum circuits," Nature Communications, Nature, vol. 16(1), pages 1-8, December.
    14. Ajagekar, Akshay & You, Fengqi, 2022. "Quantum computing and quantum artificial intelligence for renewable and sustainable energy: A emerging prospect towards climate neutrality," Renewable and Sustainable Energy Reviews, Elsevier, vol. 165(C).
    15. Mohamad Kazouini & Janis Peter & Zisu Emily Guo & Benedikt Wilde & Kevin Uhl & Dieter Koelle & Reinhold Kleiner & Daniel Bothner, 2026. "Tunable and nonlinearity-enhanced dispersive-plus-dissipative coupling in photon-pressure circuits," Nature Communications, Nature, vol. 17(1), pages 1-13, December.
    16. M. Cerezo & Martin Larocca & Diego García-Martín & N. L. Diaz & Paolo Braccia & Enrico Fontana & Manuel S. Rudolph & Pablo Bermejo & Aroosa Ijaz & Supanut Thanasilp & Eric R. Anschuetz & Zoë Holmes, 2025. "Does provable absence of barren plateaus imply classical simulability?," Nature Communications, Nature, vol. 16(1), pages 1-15, December.
    17. Yanwu Gu & Wei-Feng Zhuang & Xudan Chai & Dong E. Liu, 2023. "Benchmarking universal quantum gates via channel spectrum," Nature Communications, Nature, vol. 14(1), pages 1-12, December.
    18. Sultan H Almotiri, 2024. "Quantum-resilient software security: A fuzzy AHP-based assessment framework in the era of quantum computing," PLOS ONE, Public Library of Science, vol. 19(12), pages 1-25, December.
    19. Abraham Itzhak Weinberg, 2025. "Hybrid Quantum-Classical Ensemble Learning for S\&P 500 Directional Prediction," Papers 2512.15738, arXiv.org.
    20. Vivek Katial & Kate Smith-Miles & Charles Hill & Lloyd Hollenberg, 2025. "On the Instance Dependence of Parameter Initialization for the Quantum Approximate Optimization Algorithm: Insights via Instance Space Analysis," INFORMS Journal on Computing, INFORMS, vol. 37(1), pages 146-171, January.

    More about this item

    Keywords

    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:orijoc:v:37:y:2025:i:1:p:22-41. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.