Physical synthesis of quantum circuits using templates

Mirkhani, Zahra; Mohammadzadeh, Naser

doi:10.1007/s11128-016-1377-x

Cited by 5 publications

(3 citation statements)

References 53 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Trusted and authentic node identification for scheduling and optimization is important to consider in the future. QC‐based physical level schedulers and optimizers : Physical synthesis, scheduling, and optimization processes are important to reduce the latency in quantum circuits, improve the performances, proper circuit allocation, and efficient sharing of the resources between processes. In this process, the important challenges that need to be addressed include 138–140 : (i) how to apply proper placement and routing heuristics in physical design layout, (ii) to design effective data flow‐based gates or circuit placement and routing. Various students in recent times have explored graph‐based data flow approaches to accomplish this task, (iii) to apply proper instruction‐eel scheduling in instruction issue logic to quantum gates and circuits, (iv) to apply iteration of optimization loops in the scheduling information and incremental updates in scheduling processes, and (v) among other challenges, identification of appropriate heuristic algorithm, error analysis approach, and performance analysis (e.g., time complexity analysis) are required to be studied in future. QC‐based error‐correction firmwares/software : An efficient quantum error‐correction firmware integrates the quantum algorithms and imperfect hardware efficiently.…”

Section: Quantum Software Tools Technologies and Practicesmentioning

confidence: 99%

Quantum computing: A taxonomy, systematic review and future directions

et al. 2021

View full text Add to dashboard Cite

Quantum computing (QC) is an emerging paradigm with the potential to offer significant computational advantage over conventional classical computing by exploiting quantum‐mechanical principles such as entanglement and superposition. It is anticipated that this computational advantage of QC will help to solve many complex and computationally intractable problems in several application domains such as drug design, data science, clean energy, finance, industrial chemical development, secure communications, and quantum chemistry. In recent years, tremendous progress in both quantum hardware development and quantum software/algorithm has brought QC much closer to reality. Indeed, the demonstration of quantum supremacy marks a significant milestone in the Noisy Intermediate Scale Quantum (NISQ) era—the next logical step being the quantum advantage whereby quantum computers solve a real‐world problem much more efficiently than classical computing. As the quantum devices are expected to steadily scale up in the next few years, quantum decoherence and qubit interconnectivity are two of the major challenges to achieve quantum advantage in the NISQ era. QC is a highly topical and fast‐moving field of research with significant ongoing progress in all facets. A systematic review of the existing literature on QC will be invaluable to understand the state‐of‐the‐art of this emerging field and identify open challenges for the QC community to address in the coming years. This article presents a comprehensive review of QC literature and proposes taxonomy of QC. The proposed taxonomy is used to map various related studies to identify the research gaps. A detailed overview of quantum software tools and technologies, post‐quantum cryptography, and quantum computer hardware development captures the current state‐of‐the‐art in the respective areas. The article identifies and highlights various open challenges and promising future directions for research and innovation in QC.

show abstract

Section: Quantum Software Tools Technologies and Practicesmentioning

confidence: 99%

Quantum computing: A taxonomy, systematic review and future directions

et al. 2021

View full text Add to dashboard Cite

show abstract

“…Some researchers [6,7,[11][12][13][14][15][16] worked on the entire physical design flow and proposed techniques for each of its step while others [17][18][19][20] proposed some techniques for scheduling of a quantum circuit on a layout. Mohammadzadeh et al [21][22][23] introduced the physical synthesis concept for quantum circuits and proposed some practical physical synthesis techniques [21,[23][24][25]. Since the main focus of this paper is on the partitioning step, in the rest of this section, the partitioning techniques are reviewed in more detail.…”

Section: Related Workmentioning

confidence: 99%

Automated window-based partitioning of quantum circuits

et al. 2021

Self Cite

View full text Add to dashboard Cite

Developing a scalable quantum computer as a single processing unit is challenging due to technology limitations. A solution to deal with this challenge is distributed quantum computing where several distant quantum processing units are used to perform the computation. The main design issue of this approach is costly communication between the processing units. Focused on this issue, in this paper, an efficient partitioning approach is proposed which combines both gate and qubit teleportation concepts in an efficient manner to minimize the communication. Experimental results show the proposed approach on average reduces the communication cost by about 29.5% in comparison with the best approaches in the literature.

show abstract

“…The physical synthesis concept in quantum circuits was introduced in [6] for the first time and some physical synthesis techniques proposed for ion trap technology in the next papers [30][31][32][33].…”

Section: Related Workmentioning

confidence: 99%

A Transformation-Based Quantum Physical Synthesis Approach for Nearest-Neighbor Architectures

Hoseinimanesh

Mohammadzadeh

2021

Quantum Reports

Self Cite

View full text Add to dashboard Cite

The physical synthesis concept for quantum circuits, the interaction between synthesis and physical design processes, was first introduced in our previous work. This concept inspires us to propose some techniques that can minimize the number of extra inserted SWAP operations required to run a circuit on a nearest-neighbor architecture. Minimizing the number of SWAP operations potentially decreases the latency and error probability of a quantum circuit. Focusing on this concept, we present a physical synthesis technique based on transformation rules to decrease the number of SWAP operations in nearest-neighbor architectures. After the qubits of a circuit are mapped onto the physical qubits provided by the target architecture, our procedure is fed by this mapping information. Our method uses the obtained placement and scheduling information to apply some transformation rules to the original netlist to decrease the number of extra SWAP gates required for running the circuit on the architecture. We follow two policies in applying a transformation rule, greedy and simulated-annealing-based policies. Simulation results show that the proposed technique decreases the average number of extra SWAP operations by about 20.6% and 24.1% based on greedy and simulated-annealing-based policies, respectively, compared with the best in the literature.

show abstract

Physical synthesis of quantum circuits using templates

Cited by 5 publications

References 53 publications

Quantum computing: A taxonomy, systematic review and future directions

Quantum computing: A taxonomy, systematic review and future directions

Automated window-based partitioning of quantum circuits

A Transformation-Based Quantum Physical Synthesis Approach for Nearest-Neighbor Architectures

Contact Info

Product

Resources

About