← Back to all lectures

#BochenTan

1 lecture with this tag

14 | Compilation for Near-Term Quantum Computing: Gap Analysis and Optimal Solution

14 | Compilation for Near-Term Quantum Computing: Gap Analysis and Optimal Solution

The most challenging stage in compilation for near-term quantum computing is qubit mapping, also called layout synthesis, where qubits in quantum programs are mapped to physical qubits.