Qubit Mapping and Routing via MaxSAT
Open accessAbstract
Near-term quantum computers will operate in a noisy environment, without error correction. A critical problem for near-term quantum computing is laying out a logical circuit onto a physical device with limited connectivity between qubits. This is known as the qubit mapping and routing (QMR) problem, an intractable combinatorial problem. It is important to solve QMR as optimally as possible to reduce the amount of added noise, which may render a quantum computation useless. In this paper, we present a novel approach for optimally solving the QMR problem via a reduction to maximum satisfiability (MAXSAT). Additionally, we present two novel relaxation ideas that shrink the size of the MAXSAT constraints by exploiting the structure of a quantum circuit. Our thorough empirical evaluation demonstrates (1) the scalability of our approach compared to state-of-the-art optimal QMR techniques (solves more than 3x benchmarks with 40x speedup), (2) the significant cost reduction compared to state-of-the-art heuristic approaches (an average of ~5x swap reduction), and (3) the power of our proposed constraint relaxations.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Exact methods for qubit mapping, although optimal for small circuits, are inferior to heuristic methods in large circuits.
“However, these exact methods, although being able to achieve optimality for small circuits, are inferior to the heuristic methods in large circuits.”
From Robust Qubit Mapping Algorithm via Double-Source Optimal Routing on Large Quantum Circuits (2024) · cites this paper as [36]
Cites
<i>Quantum Computation and Quantum Information</i>
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895 · see citing works
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830 · see citing works
A Quantum Approximate Optimization Algorithm
Farhi, E., Goldstone, J., & Gutmann, S. (2014) · arXiv · doi:10.48550/arxiv.1411.4028 · Cited by 1,789 · see citing works
Biere, A., Heule, M. J. H., van Maaren, H., & Walsh, T. (2021) · Frontiers in artificial intelligence and applications · doi:10.3233/faia336 · Cited by 1,407 · see citing works
Tackling the Qubit Mapping Problem for NISQ-Era Quantum Devices
Li, G., Ding, Y., & Xie, Y. (2019) · Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems · doi:10.1145/3297858.3304023 · Cited by 594 · see citing works
RevLib: An Online Resource for Reversible Functions and Reversible Circuits
Wille, R., Grosse, D. J., Teuber, L., Dueck, G. W., & Drechsler, R. (2008) · IEEE International Symposium on Multiple-Valued Logic (ISMVL) · doi:10.1109/ismvl.2008.43 · Cited by 509 · see citing works
t|ket⟩: a retargetable compiler for NISQ devices
Sivarajah, S., Dilkes, S., Cowtan, A., Simmons, W., Edgington, A., & Duncan, R. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/ab8e92 · Cited by 475 · see citing works
Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers
Murali, P., Baker, J. M., Javadi-Abhari, A., Chong, F. T., & Martonosi, M. (2019) · Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems · doi:10.1145/3297858.3304075 · Cited by 411 · see citing works
An Efficient Methodology for Mapping Quantum Circuits to the IBM QX Architectures
Zulehner, A., Paler, A., & Wille, R. (2018) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2018.2846658 · Cited by 382 · see citing works
Green, A. S., Lumsdaine, P. L., Ross, N. J., Selinger, P., & Valiron, B. (2013) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/2491956.2462177 · Cited by 341 · see citing works
Program synthesis by sketching
Bodík, R., & Solar-Lezama, A. (2008) · Cited by 319 · see citing works
Tannu, S. S., & Qureshi, M. K. (2019) · Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems · doi:10.1145/3297858.3304007 · Cited by 306 · see citing works
Self-citationSiraichi, M. Y., Santos, V. F. D., Collange, C., & Pereira, F. M. Q. (2018) · Proceedings of the 2018 International Symposium on Code Generation and Optimization · doi:10.1145/3168822 · Cited by 254 · see citing works
Synthesis of quantum circuits for linear nearest neighbor architectures
Saeedi, M., Wille, R., & Drechsler, R. (2010) · Quantum Information Processing · doi:10.1007/s11128-010-0201-2 · Cited by 213 · see citing works
Mapping Quantum Circuits to IBM QX Architectures Using the Minimal Number of SWAP and H Operations
Wille, R., Burgholzer, L., & Zulehner, A. (2019) · Proceedings of the 56th Annual Design Automation Conference 2019 · doi:10.1145/3316781.3317859 · Cited by 207 · see citing works
(2014) · doi:10.1145/2597917.2597939 · Cited by 152 · see citing works
Compiling quantum circuits to realistic hardware architectures using temporal planners
Venturelli, D., Do, M., Rieffel, E. G., & Frank, J. (2017) · Quantum Science and Technology · doi:10.1088/2058-9565/aaa331 · Cited by 137 · see citing works
On the Qubit Routing ProblemPreprint
Cowtan, A., Dilkes, S., Duncan, R., Krajenbrink, A., Simmons, W., & Sivarajah, S. (2019) · arXiv (Cornell University) · doi:10.4230/lipics.tqc.2019.5 · Cited by 132 · see citing works
Optimal layout synthesis for quantum computing
Tan, B., & Cong, J. (2020) · Proceedings of the 39th International Conference on Computer-Aided Design · doi:10.1145/3400302.3415620 · Cited by 126 · see citing works
Optimization of quantum circuits for interaction distance in linear nearest neighbor architectures
Shafaei, A., Saeedi, M., & Pedram, M. (2013) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/2463209.2488785 · Cited by 123 · see citing works
Look-ahead schemes for nearest neighbor optimization of 1D and 2D quantum circuits
Wille, R., Keszöcze, O., Walter, M., Rohrs, P., Chattopadhyay, A., & Drechsler, R. (2016) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1109/aspdac.2016.7428026 · Cited by 120 · see citing works
Compiling SU(4) Quantum Circuits to IBM QX Architectures
Zulehner, A., & Wille, R. (2018) · Asia and South Pacific Design Automation Conference · doi:10.1145/3287624.3287704 · Cited by 108 · see citing works
Semantic-based Automated Reasoning for AWS Access Policies using SMT
Backes, J., Bolignano, P., Cook, B., Dodge, C., Gacek, A., Luckow, K., Rungta, N., Tkachuk, O., & Varming, C. (2018) · 2018 Formal Methods in Computer Aided Design (FMCAD) · doi:10.23919/fmcad.2018.8602994 · Cited by 106 · see citing works
Tannu, S. S., & Qureshi, M. (2019) · Proceedings of the 52nd Annual IEEE/ACM International Symposium on Microarchitecture · doi:10.1145/3352460.3358257 · Cited by 100 · see citing works
Self-citationOptimality Study of Existing Quantum Computing Layout Synthesis Tools
Tan, D. B., & Cong, J. (2020) · IEEE Transactions on Computers · doi:10.1109/tc.2020.3009140 · Cited by 92 · see citing works
Demonstration of quantum volume 64 on a superconducting quantum computing system
Jurcevic, P., Javadi-Abhari, A., Bishop, L. S., Lauer, I., Bogorin, D. F., Brink, M., Capelluto, L., Günlük, O., Itoko, T., Kanazawa, N., et al. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abe519 · Cited by 85 · see citing works
Circuit Transformations for Quantum ArchitecturesPreprint
Childs, A. M., Schoute, E., & Unsal, C. M. (2019) · arXiv (Cornell University) · doi:10.4230/lipics.tqc.2019.3 · Cited by 82 · see citing works
Two-step approach to scheduling quantum circuits
Guerreschi, G. G., & Park, J. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aacf0b · Cited by 80 · see citing works
Qubit allocation as a combination of subgraph isomorphism and token swapping
Siraichi, M. Y., dos Santos, V. F., Collange, C., & Pereira, F. M. Q. (2019) · Proc. ACM Program. Lang. · doi:10.1145/3360546 · Cited by 79 · see citing works
An efficient conversion of quantum circuits to a linear nearest neighbor architecture
Hirata, Y., Nakanishi, M., Yamashita, S., & Nakashima, Y. (2011) · Quantum Information and Computation · doi:10.26421/qic11.1-2-10 · Cited by 77 · see citing works
Circuit Compilation Methodologies for Quantum Approximate Optimization Algorithm
Alam, M., Saki, A. A., & Ghosh, S. (2020) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1109/micro50266.2020.00029 · Cited by 76 · see citing works
Zhang, C., Hayes, A. B., Qiu, L., Jin, Y., Chen, Y., & Zhang, E. Z. (2021) · Proceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems · doi:10.1145/3445814.3446706 · Cited by 74 · see citing works
ADAPT: Mitigating Idling Errors in Qubits via Adaptive Dynamical Decoupling
Das, P., Tannu, S., Dangwal, S., & Qureshi, M. (2021) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1145/3466752.3480059 · Cited by 69 · see citing works
Self-citationGeneralized swap networks for near-term quantum computingPreprint
O’Gorman, B., Huggins, W. J., Rieffel, E. G., & Whaley, K. B. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.05118 · Cited by 55 · see citing works
Stein, S., Wiebe, N., Ding, Y., Peng, B., Kowalski, K., Baker, N., Ang, J., & Li, A. (2022) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/3470496.3527434 · Cited by 55 · see citing works
Linear Nearest Neighbor Synthesis of Reversible Circuits by Graph PartitioningPreprint
Chakrabarti, A., Sur‐Kolay, S., & Chaudhury, A. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1112.0564 · Cited by 52 · see citing works
Temporal Planning for Compilation of Quantum Approximate Optimization Circuits
Venturelli, D., Do, M., Rieffel, E. G., & Frank, J. (2017) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2017/620 · Cited by 42 · see citing works
JigSaw: Boosting Fidelity of NISQ Programs via Measurement Subsetting
Das, P., Tannu, S., & Qureshi, M. (2021) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1145/3466752.3480044 · Cited by 42 · see citing works
Self-citationDepth-Optimal Quantum Circuit Placement for Arbitrary TopologiesPreprint
Bhattacharjee, D., & Chattopadhyay, A. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1703.08540 · Cited by 42 · see citing works
Improved Mapping of Quantum Circuits to IBM QX Architectures
Kole, A., Hillmich, S., Datta, K., Wille, R., & Sengupta, I. (2020) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2019.2962753 · Cited by 41 · see citing works
Maslov, D., Falconer, S. M., & Mosca, M. (2007) · Proceedings - ACM IEEE Design Automation Conference · doi:10.1145/1278480.1278717 · Cited by 37 · see citing works
VERITAS: Accurately Estimating the Correct Output on Noisy Intermediate-Scale Quantum Computers
Patel, T., & Tiwari, D. (2020) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1109/sc41405.2020.00019 · Cited by 34 · see citing works
Flagged first, then by citations
1 of the 44 references couldn’t be matched to a known paper.
Cited by
Sorted by citations
Liu, L., & Dou, X. (2023) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/3631525 · Cited by 39 · see citing works
Scalable Optimal Layout Synthesis for NISQ Quantum Processors
Lin, W.-H., Kimko, J., Tan, D. B., Bjørner, N. S., & Cong, J. (2023) · Design Automation Conference · doi:10.1109/dac56929.2023.10247760 · Cited by 43 · see citing works
Atomique: A Quantum Compiler for Reconfigurable Neutral Atom Arrays
Wang, H., Liu, P., Tan, D. B., Liu, Y., Gu, J., Pan, D. Z., Cong, J., Acar, U. A., & Han, S. (2024) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca59077.2024.00030 · Cited by 31 · see citing works
Tackling the Qubit Mapping Problem with Permutation-Aware Synthesis
Liu, J., Younis, E., Weiden, M., Hovland, P., Kubiatowicz, J. D., & Iancu, C. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00090 · Cited by 27 · see citing works
Systems Architecture for Quantum Random Access Memory
Xu, S., Hann, C. T., Foxman, B., Girvin, S. M., & Ding, Y. (2023) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1145/3613424.3614270 · Cited by 24 · see citing works
Robust Qubit Mapping Algorithm via Double-Source Optimal Routing on Large Quantum Circuits
Cheng, C.-Y., Yang, C.-Y., Kuo, Y.-H., Wang, R.-C., Cheng, H.-C., & Huang, C.-Y. (. (2024) · ACM Transactions on Quantum Computing · doi:10.1145/3680291 · Cited by 19 · see citing works
FlatDD: A High-Performance Quantum Circuit Simulator using Decision Diagram and Flat Array
Jiang, S., Fu, R., Burgholzer, L., Wille, R., Ho, T.-Y., & Huang, T. (2024) · Proceedings of the International Conference on Parallel Processing · doi:10.1145/3673038.3673073 · Cited by 17 · see citing works
Tan, D. B., Lin, W.-H., & Cong, J. (2025) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1145/3658617.3697778 · Cited by 15 · see citing works
Optimal Layout Synthesis for Quantum Circuits as Classical Planning
Shaik, I., & van de Pol, J. (2023) · 2023 IEEE/ACM International Conference on Computer Aided Design (ICCAD) · doi:10.1109/iccad57390.2023.10323924 · Cited by 24 · see citing works
Route-Forcing: Scalable Quantum Circuit Mapping for Scalable Quantum Computing Architectures
Escofet, P., Gonzalvo, A., Alarcón, E., Almudéver, C. G., & Abadal, S. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00110 · Cited by 13 · see citing works
Tetris: A Compilation Framework for VQA Applications in Quantum Computing
Jin, Y., Li, Z., Hua, F., Hao, T., Zhou, H., Huang, Y., & Zhang, E. Z. (2024) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca59077.2024.00029 · Cited by 11 · see citing works
Dependency-Aware Compilation for Surface Code Quantum Architectures
Molavi, A., Xu, A., Tannu, S., & Albarghouthi, A. (2025) · Proceedings of the ACM on Programming Languages · doi:10.1145/3720416 · Cited by 11 · see citing works
Self-citationQECC-Synth: A Layout Synthesizer for Quantum Error Correction Codes on Sparse Architectures
Yin, K., Zhang, H., Fang, X., Shi, Y., Humble, T. S., Li, A., & Ding, Y. (2025) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3669940.3707236 · Cited by 9 · see citing works
Lightcone bounds for quantum circuit mapping via uncomplexity
Steinberg, M., Bandić, M., Szkudlarek, S., Almudéver, C. G., Sarkar, A., & Feld, S. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00909-7 · Cited by 8 · see citing works
Profiling quantum circuits for their efficient execution on single- and multi-core architectures
Bandić, M., le Henaff, P., Ovide, A., Escofet, P., Rached, S. B., Rodrigo, S., van Someren, H., Abadal, S., Alarcón, E., Almudéver, C. G., et al. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ada180 · Cited by 6 · see citing works
Lightning Talk: Scaling Up Quantum Compilation – Challenges and Opportunities
Cong, J. (2023) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac56929.2023.10247677 · Cited by 6 · see citing works
Jin, Y., Hua, F., Chen, Y., Hayes, A. B., Zhang, C., & Zhang, E. Z. (2023) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3623278.3624751 · Cited by 6 · see citing works
Automated Reasoning in Quantum Circuit Compilation
Thanos, D., Villoria, A., Brand, S., Quist, A.-J., Mei, J., Coopmans, T. J., & Laarman, A. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-66149-5_6 · Cited by 4 · see citing works
Compiler Optimizations for QAOA
Zhu, Y., Zhou, Y., Cheng, J., Jin, Y., Li, B., Niu, S., & Liang, Z. (2024) · doi:10.1145/3676536.3697127 · Cited by 4 · see citing works
QVM: Quantum Gate Virtualization Machine
Tornow, N., Giortamis, E., & Bhatotia, P. (2025) · Proceedings of the ACM on Programming Languages · doi:10.1145/3729290 · Cited by 3 · see citing works
Noise-aware Token Swapping for Qubit Routing
Sharma, A., & Banerjee, A. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00018 · Cited by 3 · see citing works
Optimizing Quantum Fourier Transformation (QFT) Kernels for Modern NISQ and FT Architectures
Jin, Y., Gao, X., Guo, M., Chen, H., Hua, F., Zhang, C., & Zhang, E. Z. (2024) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1109/sc41406.2024.00074 · Cited by 3 · see citing works
MLQM: Machine learning approach for accelerating optimal qubit mapping
Sun, W., Li, X., Yu, L., Wang, Z., Chen, G., & Yang, G. (2025) · Future Generation Computer Systems · doi:10.1016/j.future.2025.107906 · Cited by 3 · see citing works
HATT: Hamiltonian Adaptive Ternary Tree for Optimizing Fermion-to-Qubit Mapping
Liu, Y., Yao, K., Hong, J., Froustey, J., Rrapaj, E., Iancull, C., Li, G., & Shi, Y. (2025) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca61900.2025.00022 · Cited by 2 · see citing works
Local Optimization of Quantum Circuits
Arora, J., Xu, M., Westrick, S., Liu, P., Li, D., Ding, Y., & Acar, U. A. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00069 · Cited by 2 · see citing works
Towards Effective Local Search for Qubit Mapping
Luo, C. W., Cao, S., Guo, S., & Hu, C. (2025) · IEEE Transactions on Computers · doi:10.1109/tc.2025.3544869 · Cited by 2 · see citing works
Kattemölle, J., & Hariharan, S. (2025) · ACM Transactions on Quantum Computing · doi:10.1145/3733842 · Cited by 2 · see citing works
S-SYNC: Shuttle and Swap Co-Optimization in Quantum Charge-Coupled Devices
Zhu, C., Wu, X. G., Wang, J., & Wang, X. (2025) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/3695053.3731084 · Cited by 3 · see citing works
Chu, T., Tan, S., Lu, L., Leng, J., Liu, F., Lang, C., Guo, Y., & Yin, J. (2025) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac63849.2025.11132786 · Cited by 2 · see citing works
HeteroQNN: Enabling Distributed QNN Under Heterogeneous Quantum Devices
Lu, L., Chu, T., Tan, S., Leng, J., Liu, F., Lang, C., Guo, Y., & Yin, J. (2025) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2025.3588457 · Cited by 1 · see citing works
POPQC: Parallel Optimization for Quantum Circuits
Liu, P., Arora, J., Xu, M., & Acar, U. A. (2025) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/3694906.3743325 · Cited by 1 · see citing works
A Scalable and Robust Compilation Framework for Emitter-Photonic Graph State
Ren, X., Huang, Y., Liang, Z., & Barbalace, A. (2025) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac63849.2025.11132949 · Cited by 1 · see citing works
Enhancing the yield of bucket brigade quantum random access memory using redundancy repair
Kim, D., Heng, S., Lee, S., & Han, Y. (2025) · Scientific Reports · doi:10.1038/s41598-025-32955-2 · Cited by 4 · see citing works
Generating Compilers for Qubit Mapping and Routing
Molavi, A., Xu, A., Cecchetti, E., Tannu, S., & Albarghouthi, A. (2026) · Proceedings of the ACM on Programming Languages · doi:10.1145/3776720 · Cited by 1 · see citing works
Self-citationEffective and Efficient Parallel Qubit Mapper
Fu, H., Zhu, M., Chen, F., Zhang, C., Wu, J., Xie, W., & Li, X. (2024) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2024.3500784 · Cited by 1 · see citing works
Weaver: A Retargetable Compiler Framework for FPQA Quantum Architectures
Kırmemiş, O., Romão, F., Giortamis, E., & Bhatotia, P. (2025) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1145/3696443.3708965 · Cited by 1 · see citing works
Bqa: A High-Performance Quantum Circuits Scheduling Strategy Based on Heuristic SearchPreprint
Chen, X.-M., Wang, S., Ye, Y.-J., Wu, Y.-Z., & Jiang, B. (2022) · SSRN Electronic Journal · doi:10.2139/ssrn.4261653
An Ising-based Model for Qubit Mapping
Ushijima‐Mwesigwa, H., & Liu, X. (2023) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1145/3624062.3624225
BQA: a high-performance quantum circuits scheduling strategy based on heuristic search
Chen, X.-M., Wang, S., Ye, Y.-J., Wu, Y.-Z., & Jiang, B. (2023) · The Journal of Supercomputing · doi:10.1007/s11227-023-05848-2
Mathematical Model for SWAP Gate Minimization on NISQ Hardware
Bringman, S., Wilkie, A., Herrman, R., & Ostrowski, J. (2024) · IEEE Computer Society Annual Symposium on VLSI · doi:10.1109/isvlsi61997.2024.00122
A binary integer programming-based method for qubit mapping in sparse architectures
Jiang, H., Fu, J., Deng, Y., & Wu, J. (2024) · Acta Informatica · doi:10.1007/s00236-024-00471-x · Cited by 1 · see citing works
Xu, K., Li, Z., Liu, X., Li, D., & Wang, Y. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202500125
Parallel token swapping for qubit routing
Bansal, I., Günlük, O., & Shapley, R. (2025) · Discrete Applied Mathematics · doi:10.1016/j.dam.2025.08.005
Assessing Quantum Layout Synthesis Tools via Known Optimal-SWAP Cost Benchmarks
Ping, S., Lin, W.-H., Tan, D. B., & Cong, J. (2025) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac63849.2025.11133143
DDRoute: a Novel Depth-Driven Approach to the Qubit Routing Problem
Annechini, A., Vénere, M., Sciuto, D., & Santambrogio, M. D. (2025) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac63849.2025.11133018
Zhao, Y., Li, K., Guo, Z., & Zhang, J. (2025) · doi:10.1109/iccad66269.2025.11240780
A Framework for Dynamic Quantum Circuit Execution: Balancing Effectiveness and Efficiency
Chen, F., Fu, H., Zhu, M., Zhang, C., Xie, W., & Li, X.-Y. (2025) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2025.3626447
CLASS: A Controller-Centric Layout Synthesizer for Dynamic Quantum Circuits
Chen, Y., Zhao, Y., Li, B., Li, H., Wang, M., Han, Y., & Wang, Y. (2025) · doi:10.1109/iccad66269.2025.11240650
A System Architecture for Low Latency Multiprogramming Quantum Computing
Zhao, Y.-L., Chen, Y., Chang, K.-Y., Li, H., Li, B., Han, Y., & Wang, Y. (2026) · ACM Transactions on Architecture and Code Optimization (TACO) · doi:10.1145/3845611 · Cited by 1 · see citing works
Dependence-Driven, Scalable Quantum Circuit Mapping with Affine Abstractions
Benbetka, M., Bekkar, M., Baghdadi, R., & Kong, M. (2026) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1109/cgo68049.2026.11394841
PropHunt: Automated Optimization of Quantum Syndrome Measurement Circuits
Viszlai, J., Maurya, S., Tannu, S., Martonosi, M., & Chong, F. T. (2026) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3779212.3790205
Self-citationQDP: Worst Case Fidelity-Aware Qubit Mapping and Routing Using Dynamic Programming
Jiang, S., Cheng, W., Chung, Y.-H., Ho, T.-Y., & Huang, T. (2026) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2026.3693628
Branch-Aware Quantum Constant Propagation for Dynamic Quantum Circuits
Fulginiti, I., & Chen, Y. (2026) · IEEE International Conference on Quantum Software (QSW) · doi:10.1109/qsw72780.2026.00024
AI-Empowered Quantum Circuit Synthesis and Compilation Optimization: Overview and Prospects
Yan, G., Wu, W., Chen, Y., Pan, K., Lü, X., Zh, Z., Wang, Y., Wang, R. L., & Yan, J. (2026) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2026.3715237 · Cited by 40 · see citing works
- Authors
- Molavi, A., Xu, A., Diges, M., Pick, L., Tannu, S., & Albarghouthi, A.
- Affiliations
- University of Wisconsin–Madison (US)
- Venue
- 2022 55th IEEE/ACM International Symposium on Microarchitecture (MICRO)
- Publisher
- IEEE
- Published
- 2022-10
- Pages
- 1078-1091
- ISSN
- 1072-4451 (ISSN-L)
- OpenAlex
- W4308083589
- Cited by
- 54
- References
- 44
- Citations by year
- 2026: 7 · 2025: 23 · 2024: 13 · 2023: 10 · 2022: 1
- FWCI
- 6.49
- Type
- conference paper
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- IEEE/ACM International Symposium on Microarchitecture (MICRO) (publishedVersion)
- arXiv (Cornell University) (submittedVersion, cc-by-nc-sa)
- arXiv (Cornell University)
- Funders
- Wisconsin Alumni Research Foundation
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Engineering › Electrical and Electronic Engineering › VLSI and FPGA Design Techniques
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
- Keywords
- qubit mapping, qubit routing, MaxSAT, quantum circuit compilation, noisy quantum computers, constraint relaxation, combinatorial optimization, SWAP gate, quantum hardware mapping
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
