Architecture-aware synthesis of phase polynomials for NISQ devices
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 …
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
Photonic graph states are important for measurement-and fusion-based quantum
computing, quantum networks, and sensing. They can in principle be generated …
computing, quantum networks, and sensing. They can in principle be generated …
Does qubit connectivity impact quantum circuit complexity?
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 …
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 …
such as linear regression, regularized least squares algorithm, order-finding algorithm …
Architecture-aware synthesis of stabilizer circuits from clifford tableaus
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 …
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
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 …
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
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 …
aspect for the compilation of quantum circuits for many applications, such as chemistry …
Optimal Layout-Aware CNOT Circuit Synthesis with Qubit Permutation
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 …
heuristic and exact approaches exist for CNOT optimization. In this paper, we investigate …
Global Synthesis of CNOT Circuits with Holes
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 …
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
In recent years, quantum computing has entered the Noisy Intermediate-Scale Quantum
(NISQ). However, NISQ devices have inherent limitations in terms of connectivity and …
(NISQ). However, NISQ devices have inherent limitations in terms of connectivity and …