Related papers: A complete transformation rule set and a minimal e…
These notes introduce quantum computation and quantum error correction, emphasising the importance of stabilisers and the mathematical foundations in basic Lie theory. We begin by using the double cover map $\mathrm{SU}_2 \rightarrow…
Quantum computer architectures impose restrictions on qubit interactions. We propose efficient circuit transformations that modify a given quantum circuit to fit an architecture, allowing for any initial and final mapping of circuit qubits…
We introduce a complete equational theory for the fragment of quantum circuits generated by the real Clifford gates plus the two-qubit controlled-Hadamard gate. That is, we give a simple set of equalities between circuits of this fragment,…
Simpler encoding and decoding networks are necessary for more reliable quantum error correcting codes (QECCs). The simplification of the encoder-decoder circuit for a perfect five-qubit QECC can be derived analytically if the QECC is…
Existing quantum compilers optimize quantum circuits by applying circuit transformations designed by experts. This approach requires significant manual effort to design and implement circuit transformations for different quantum devices,…
We present QEst, a procedure to systematically generate approximations for quantum circuits to reduce their CNOT gate count. Our approach employs circuit partitioning for scalability with procedures to 1) reduce circuit length using…
Current superconducting quantum devices impose strict connectivity constraints on quantum circuit execution, necessitating circuit transformation before executing quantum circuits on physical hardware. Numerous quantum circuit…
A Hadamard-free Clifford transformation is a circuit composed of quantum Phase (P), CZ, and CNOT gates. It is known that such a circuit can be written as a three-stage computation, -P-CZ-CNOT-, where each stage consists only of gates of the…
Transitions of many-particle quantum systems between distinct phases at absolute-zero temperature, known as quantum phase transitions, require an exacting treatment of particle correlations. In this work, we present a general…
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 more complicated variations of optimal synthesis by…
We apply quantum optimal control theory (QOCT) to an exactly solvable non-Markovian open quantum bit (qubit) system to achieve state-independent quantum control and construct high-fidelity quantum gates for moderate qubit decaying…
We describe the construction of a conditional quantum control-not (CNOT) gate from linear optical elements following the program of Knill, Laflamme and Milburn [Nature {\bf 409}, 46 (2001)]. We show that the basic operation of this gate can…
NISQ devices have inherent limitations in terms of connectivity and hardware noise. The synthesis of CNOT circuits considers the physical constraints and transforms quantum algorithms into low-level quantum circuits that can execute on…
This paper addresses quantum circuit mapping for Noisy Intermediate-Scale Quantum (NISQ) computers. Since NISQ computers constraint two-qubit operations on limited couplings, an input circuit must be transformed into an equivalent output…
The preparation of $n$-qubit quantum states is a cross-cutting subroutine for many quantum algorithms, and the effort to reduce its circuit complexity is a significant challenge. In the literature, the quantum state preparation algorithm by…
Realizing a conceptual quantum algorithm on an actual physical device necessitates the algorithm's quantum circuit description to undergo certain transformations in order to adhere to all constraints imposed by the hardware. In this regard,…
This paper proposes a new optimized quantum block-ZXZ decomposition method [7,8,10] that results in more optimal quantum circuits than the quantum Shannon decomposition (QSD)[27], which was introduced in 2006 by Shende et al. The…
Five different versions of the three-dimensional (3D) reduction of the Bethe-Salpeter (BS) equation in the instantaneous approximation for kernel of BS equation for the two-fermion systems are formulated. The normalization condition for the…
Decoherence -- in the current physical implementations of quantum computers -- makes depth reduction a vital task in quantum-circuit design. Moore and Nilsson (SIAM Journal of Computing, 2001) demonstrated that additional qubits -- known as…
While the question ``how many CNOT gates are needed to simulate an arbitrary two-qubit operator'' has been conclusively answered -- three are necessary and sufficient -- previous work on this topic assumes that one wants to simulate a given…