Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A Fast and Adaptable Algorithm for Optimal Multi-Qubit Pathfinding in Quantum Circuit Compilation (2405.18785v1)

Published 29 May 2024 in quant-ph

Abstract: Quantum computing has the potential to significantly enhance our ability to simulate and solve complex, classically intractable problems across various fields of research and industry. However, we are currently in the noisy intermediate-scale quantum (NISQ) era, where devices are relatively small and suffer from substantial noise levels, prohibiting large-scale computations. To achieve any quantum advantage in this regime and beyond, it is crucial to minimise the impact of noise from qubit decoherence and two-qubit gates. A direct approach is to improve the optimisation of quantum circuit compilation processes that map circuits onto physical devices, thereby reducing noisy gates and circuit execution times. 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, while also optimising for accumulated gate errors and can be flexibly adapted to various problem modifications. This multi-qubit pathfinding algorithm incorporates considerations for gate-error penalties, SWAP movement constraints, and configurable arrangements of source and target qubit locations and qubit teams. 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. The results demonstrate the algorithm's practical runtimes on current quantum devices and compare its effectiveness across different hardware configurations, providing insights for future quantum hardware design.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (33)
  1. Quantum circuit placement. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 27(4):752–763, 2008.
  2. On the complexity of quantum circuit compilation. In Eleventh Annual Symposium on Combinatorial Search, 2018.
  3. Near-term quantum computing techniques: Variational quantum algorithms, error mitigation, circuit compilation, benchmarking and classical simulation. Science China Physics, Mechanics & Astronomy, 66(5):250302, 2023.
  4. Survey on quantum circuit compilation for noisy intermediate-scale quantum computers: Artificial intelligence to heuristics. IEEE Transactions on Quantum Engineering, 2:1–16, 2021.
  5. Depth-optimal quantum circuit placement for arbitrary topologies. arXiv preprint arXiv:1703.08540, 2017.
  6. Time-optimal qubit mapping. In Proceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, pages 360–374, 2021.
  7. Tackling the qubit mapping problem for NISQ-era quantum devices. In Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems, pages 1001–1014, 2019.
  8. An efficient methodology for mapping quantum circuits to the IBM QX architectures. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 38(7):1226–1236, 2018.
  9. Greedy randomized search for scalable compilation of quantum circuits. In Integration of Constraint Programming, Artificial Intelligence, and Operations Research: 15th International Conference, CPAIOR 2018, Delft, The Netherlands, June 26–29, 2018, Proceedings 15, pages 446–461. Springer, 2018.
  10. Optimal layout synthesis for quantum computing. In Proceedings of the 39th International Conference on Computer-Aided Design, pages 1–9, 2020.
  11. Mapping quantum circuits to IBM QX architectures using the minimal number of SWAP and H operations. In Proceedings of the 56th Annual Design Automation Conference 2019, pages 1–6, 2019.
  12. Optimal SWAP gate insertion for nearest neighbor quantum circuits. In 2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC), pages 489–494. IEEE, 2014.
  13. Quantum circuit optimizations for NISQ architectures. Quantum Science and Technology, 5(2):025010, 2020.
  14. Quantum circuit compilation for nearest-neighbor architecture based on reinforcement learning. Quantum Information Processing, 22(8):295, 2023.
  15. A structured method for compilation of QAOA circuits in quantum computing. arXiv preprint arXiv:2112.06143, 2021.
  16. Comparing and integrating constraint programming and temporal planning for quantum circuit compilation. In Proceedings of the International Conference on Automated Planning and Scheduling, volume 28, 2018.
  17. Compiling quantum circuits to realistic hardware architectures using temporal planners. Quantum Science and Technology, 3(2):025004, 2018.
  18. Temporal planning for compilation of quantum approximate optimization circuits. In IJCAI, pages 4440–4446, 2017.
  19. Qubit allocation as a combination of subgraph isomorphism and token swapping. Proceedings of the ACM on Programming Languages, 3(OOPSLA):1–29, 2019.
  20. An exact qubit allocation approach for NISQ architectures. Quantum Information Processing, 19(11):391, 2020.
  21. Qubit placement to minimize communication overhead in 2D quantum architectures. In 2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC), pages 495–500. IEEE, 2014.
  22. Pavel Surynek. Multi-agent path finding with generalized conflicts: An experimental study. In International Conference on Agents and Artificial Intelligence, pages 118–142. Springer, 2019a.
  23. Pavel Surynek. Conflict handling framework in generalized multi-agent path finding: Advantages and shortcomings of satisfiability modulo approach. In ICAART (2), pages 192–203, 2019b.
  24. Determining the minimal number of swap gates for multi-dimensional nearest neighbor quantum circuits. In The 20th Asia and South Pacific Design Automation Conference, pages 178–183. IEEE, 2015.
  25. Nisq circuit compilation is the travelling salesman problem on a torus. Quantum Science and Technology, 6(2):025016, 2021.
  26. IBM Quantum Platform. https://www.ibm.com/quantum. (Accessed 15 May 2024).
  27. Unsupervised machine learning on a hybrid quantum computer. arXiv preprint arXiv:1712.05771, 2017.
  28. On the computational complexity of integer programming problems. In Optimization and Operations Research, pages 161–172. Springer, 1978.
  29. Thomas S Ferguson et al. Who solved the secretary problem? Statistical Science, 4(3):282–289, 1989.
  30. Integer programming, volume 271. Springer, 2014.
  31. Robert J Vanderbei et al. Linear programming, volume 3. Springer, 2015.
  32. Simple and fast algorithm for binary integer and online linear programming. arXiv preprint arXiv:2003.02513, 2020.
  33. Progress in linear programming-based algorithms for integer programming: An exposition. Informs Journal on Computing, 12(1):2–23, 2000.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets