Architecture-aware synthesis of phase polynomials for NISQ devices

AM de Griend, R Duncan - arxiv preprint arxiv:2004.06052, 2020 - arxiv.org
We propose a new algorithm to synthesise quantum circuits for phase polynomials, which
takes into account the qubit connectivity of the quantum computer. We focus on the …

Optimization complexity and resource minimization of emitter-based photonic graph state generation protocols

E Takou, E Barnes, SE Economou - arxiv preprint arxiv:2407.15777, 2024 - arxiv.org
Photonic graph states are important for measurement-and fusion-based quantum
computing, quantum networks, and sensing. They can in principle be generated …

Does qubit connectivity impact quantum circuit complexity?

P Yuan, J Allcock, S Zhang - IEEE Transactions on Computer …, 2023 - ieeexplore.ieee.org
Some physical implementation schemes of quantum computing can apply two-qubit gates
only on certain pairs of qubits. These connectivity constraints are commonly viewed as a …

Resource optimized quantum squaring circuit

A Sultana, E Muñoz-Coreas - The Journal of Supercomputing, 2025 - Springer
Quantum squaring operation is a useful building block in implementing quantum algorithms
such as linear regression, regularized least squares algorithm, order-finding algorithm …

Architecture-aware synthesis of stabilizer circuits from clifford tableaus

D Winderl, Q Huang, AM de Griend… - arxiv preprint arxiv …, 2023 - arxiv.org
Since quantum computing is currently in the NISQ-Era, compilation strategies to reduce the
number of gates executed on specific hardware are required. In this work, we utilize the …

Dynamic qubit routing with CNOT circuit synthesis for quantum compilation

AM de Griend, SM Li - arxiv preprint arxiv:2205.00724, 2022 - arxiv.org
Many quantum computers have constraints regarding which two-qubit operations are locally
allowed. To run a quantum circuit under those constraints, qubits need to be mapped to …

Redefining lexicographical ordering: Optimizing pauli string decompositions for quantum compiling

Q Huang, D Winderl… - 2024 IEEE …, 2024 - ieeexplore.ieee.org
In quantum computing, the efficient optimization of Pauli string decompositions is a crucial
aspect for the compilation of quantum circuits for many applications, such as chemistry …

Optimal Layout-Aware CNOT Circuit Synthesis with Qubit Permutation

I Shaik, J van de Pol - ECAI 2024, 2024 - ebooks.iospress.nl
CNOT optimization plays a significant role in noise reduction for Quantum Circuits. Several
heuristic and exact approaches exist for CNOT optimization. In this paper, we investigate …

Global Synthesis of CNOT Circuits with Holes

E Murphy, A Kissinger - arxiv preprint arxiv:2308.16496, 2023 - arxiv.org
A common approach to quantum circuit transformation is to use the properties of a specific
gate set to create an efficient representation of a given circuit's unitary, such as a parity …

Nearest neighbor synthesis of CNOT circuits on general quantum architectures

X Chen, M Zhu, X Cheng, P Zhu, Z Guan - arxiv preprint arxiv:2310.00592, 2023 - arxiv.org
In recent years, quantum computing has entered the Noisy Intermediate-Scale Quantum
(NISQ). However, NISQ devices have inherent limitations in terms of connectivity and …