Qubit Mapping and Routing via MaxSAT

Molavi, Abtin; Xu, Amanda; Diges, Martin; Pick, Lauren; Tannu, Swamit; Albarghouthi, Aws

doi:10.1109/micro56248.2022.00077

Cited by 15 publications

(3 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Generic Quantum Compiler Optimization: Today's quantum compilers (e.g., Qiskit [29], Cirq [9], Q# [21]) usually run multiple passes to optimize a quantum circuit. Typical passes include gate cancellation [26], gate rewrite [33], and routing [23,24]. These optimization methods (passes) are usually small-scale local circuit transformations.…”

Section: Related Workmentioning

confidence: 99%

“…Formal Methods in Quantum Compilation: Several previous works bring the SAT method to qubit mapping and routing on connectivity-constrained architectures by different constraint encoding, including [11,23,34,35,41], and [25] (SMT based). These methods focus on different aspects (fidelity, gate count, and circuit depth) and still optimize the gates in the final quantum circuit.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Fermihedral: On the Optimal Compilation for Fermion-to-Qubit Encoding

Liu,

Che,

Zhou

et al. 2024

Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems,

View full text Add to dashboard Cite

This paper introduces Fermihedral, a compiler framework focusing on discovering the optimal Fermion-to-qubit encoding for targeted Fermionic Hamiltonians. Fermion-to-qubit encoding is a crucial step in harnessing quantum computing for efficient simulation of Fermionic quantum systems. Utilizing Pauli algebra, Fermihedral redefines complex constraints and objectives of Fermion-to-qubit encoding into a Boolean Satisfiability problem which can then be solved with high-performance solvers. To accommodate larger-scale scenarios, this paper proposed two new strategies that yield approximate optimal solutions mitigating the overhead from the exponentially large number of clauses. Evaluation across diverse Fermionic systems highlights the superiority of Fermihedral, showcasing substantial reductions in implementation costs, gate counts, and circuit depth in the compiled circuits. Real-system experiments on IonQ's device affirm its effectiveness, notably enhancing simulation accuracy. CCS Concepts: • Computer systems organization → Quantum computing; • Software and its engineering → Formal methods; • Hardware → Emerging languages and compilers.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Fermihedral: On the Optimal Compilation for Fermion-to-Qubit Encoding

Liu,

Che,

Zhou

et al. 2024

Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems,

View full text Add to dashboard Cite

show abstract

“…Under existing technical conditions, it is difficult to achieve full direct coupling of all qubits on a quantum chip, whereas two-qubits gate in the logical quantum circuit may act on any two qubits [15][16][17]. A simple and straightforward solution is to SWAP the quantum states of the two qubits involved in the two-qubits gate operation to two qubits with direct coupling by inserting a series of SWAP gates [18][19][20], then perform the operation on these two qubits, after the operation, reverse the SWAP path. However, in most quantum computers, there is no direct implementation of the SWAP gate [21], and it is usually necessary to further decompose the SWAP gate into a combination of basic gate-set.…”

Section: Introductionmentioning

confidence: 99%

BQA: a high-performance quantum circuits scheduling strategy based on heuristic search

Chen,

Wang,

et al. 2023

J Supercomput

View full text Add to dashboard Cite

Quantum computing is currently a research hotspot in both academia and industry. The inherent parallelism of quantum computers and the resulting powerful computing power will bring new solutions to many problems that are difficult for classical computers. However, due to the limitations of technical conditions, it is difficult to achieve full direct coupling of all qubits on a quantum chip. When compiling a quantum circuit onto a physical chip, it is necessary to ensure those two-qubit gates act on pairs of directly coupled qubits by inserting SWAP gates. It will cause great additional cost when a large number of SWAP gates are inserted, leading to the execution time of quantum circuits longer. In this paper, we designed a strategy based on the business of each individual qubit to insert SWAP gates, named Busy-Qubits-Avoid Strategy. On the one hand, we try to hide the time overhead incurred by the inserted SWAP gates by exploiting the uneven distribution of quantum gates over qubits. On the other hand, we also expect the inserted SWAP gates to make as little negative impact on subsequent two-qubit gates as possible. We designed a heuristic function which take into account both of these points. Compared with Srabe and tket, we achieved a better effect. In addition, as the number of two-qubit gates increases, better optimization results will be achieved. This implies higher execution efficiency and lower decoherence error rate.

show abstract

Lightning Talk: Scaling Up Quantum Compilation – Challenges and Opportunities

Cong

2023

2023 60th ACM/IEEE Design Automation Conference (DAC)

View full text Add to dashboard Cite

Qubit Mapping and Routing via MaxSAT

Cited by 15 publications

References 34 publications

Fermihedral: On the Optimal Compilation for Fermion-to-Qubit Encoding

Fermihedral: On the Optimal Compilation for Fermion-to-Qubit Encoding

BQA: a high-performance quantum circuits scheduling strategy based on heuristic search

Lightning Talk: Scaling Up Quantum Compilation – Challenges and Opportunities

Contact Info

Product

Resources

About