Content area
Quantum Computing furnishes a potential exponential acceleration compared with classical counterparts. Many potential applications that require heavy computing resources, including machine learning, molecule simulation, encryption algorithms, and fluid dynamic simulation, are under exploration. However, the fundamental structure of quantum computation is still under exploration. Currently, quantum computers have over 100 qubits available publically with an error rate of around 1% on each quantum gate execution. Quantum algorithms, on the other hand, are limited to many aspects and are difficult to address real-world complex tasks. To this end, quantum Electronic Design Automation (QEDA) is introduced to assist with the design and automation of the quantum algorithms. This approach allows users to focus less on the intricacies of quantum algorithms and hardware and more on leveraging quantum computing’s potential to address complex challenges effectively.
In order to address the challenges mentioned above, QEDA is leveraged as a subdomain of quantum computing as a low-level software stack to assist with the commercialization of quantum computers. It includes the study of quantum circuits’ simulation, transpilation, high-level synthesis, equivalence checking, automated quantum error correction embedding, and several security issues that may lead to privacy information leakage to the attackers. This dissertation provides many efficient frameworks to enhance the capability of QEDA tools, which includes 1) design and optimization of complex arithmetic quantum circuits, where it facilitates the execution of various algorithms that require the mentioned algorithm to reduce the communication between classical and quantum end; 2) high-level synthesis of quantum circuits to automatically convert C code to quantum circuits, which reduce the complexity to design quantum circuits; 3) efficient quantum circuits equivalence checking algorithms, including formal verification and simulation-based verification, where it can verify whether two quantum circuits are functionally equivalent; 4) timing-based side-channel attack of quantum cloud services, where it enhances the security property of quantum computation on cloud services.
To conclude, this dissertation builds a bridge between the application layer of different quantum applications and the low-level quantum circuits design automation, as well as the verification of the designs, where it facilitates the broadness of application of quantum computers, and ensures the compilation process of quantum circuits design. Our contributions push the development of QEDA to the next level, where the usage of quantum computers worries less about the circuits and hardware level to finish the desired task and potentially inspire many future works for more efficient QDEA toolsets.