Quantum Design Automation and Quantum Architectures / Dr. Naser Mohammadzadeh
Sprache des Titels:
Englisch
Original Kurzfassung:
Quantum computing is a rapidly evolving research area. Its huge computational power compared to classical computing is the main motivation of researchers. Although the demonstration of quantum systems has been limited to some dozen qubits, scaling the current small-sized lab quantum systems to large-scale quantum systems that are capable of solving meaningful practical problems needs design automation techniques. In a large picture view, the quantum circuit design flow can be divided into two processes: synthesis and physical design. The synthesis process converts a description into an optimized gate-level and technology-independent netlist. The physical design process maps the resulted netlist onto the quantum circuit fabric. The physical design of quantum circuits is typically partitioned into (I) placement and routing, (II) scheduling, (III) physical synthesis, and (IV) optimization that attempts to improve circuit metrics. In the first part, I´ll talk about some of our contributions in the physical design automation, such as Quantum Physical Synthesis concept.
The architecture of a quantum computer plays a key role in its performance. The main task of a quantum architecture is to determine the organization of processing units and how they interconnect and communicate to manipulate data. Much of the quantum research until now has been concentrated on the two extremes: quantum algorithms and complexity theory at the top, and quantum physics at the bottom. Quantum information processing has moved up to the point where architecture-level solutions can be beneficial to close this gap. In spite of their importance, they have not received much attention, leaving much area for high-impact research. Although several candidate technologies have been presented for the realization of a quantum computer to date, developing a scalable computer architecture for each one is still a challenging problem.