Related papers: Optimal synthesis of general multi-qutrit quantum …

Efficient decompositions of multi-qubit gates are essential in NISQ applications, where the number of gates or the circuit depth is limited. This paper presents efficient decompositions of CCZ and CCCZ gates, typical multi-qubit gates,…

To utilize higher-dimensional quantum systems, in this Letter, we derive a generalized cross-resonance (GCR) scheme for realizing maximally entangling two-qutrit gates on fixed-frequency transmons beyond the 0-1 subspace. Our two-qutrit…

We perform optimal-control-theory calculations to determine the minimum number of two-qubit CNOT gates needed to perform quantum state preparation and unitary operator synthesis for few-qubit systems. By considering all possible gate…

Quantum state preparation is an important subroutine for quantum computing. We show that any $n$-qubit quantum state can be prepared with a $\Theta(n)$-depth circuit using only single- and two-qubit gates, although with a cost of an…

We prove that a generic three-qubit quantum logic gate can be implemented using at most 98 one-qubit rotations about the $y$- and $z$-axes and 40 CNOT gates, beating an earlier bound of 64 CNOT gates.

We present a comprehensive and self-contained simplified review of the quantum computing scheme of Phys. Rev. Lett. 98, 190504 (2007), which features a 2-D nearest neighbor coupled lattice of qubits, a threshold error rate approaching 1%,…

We propose a method for exact circuit synthesis using a discrete gate set, as required for fault-tolerant quantum computing. Our approach translates the problem of synthesizing a gate specified by its unitary matrix into a boolean…

We present quantum circuits for comparison and increment operations that achieve an asymptotically optimal gate count of $\Theta(n)$ and depth of $\Theta(\log n)$ over the Clifford+Toffoli gate set, while using a provably minimal number of…

Quantum circuit depth minimization is critical for practical applications of circuit-based quantum computation. In this work, we present a systematic procedure to decompose multiqubit controlled unitary gates, which is essential in many…

Most quantum computing architectures to date natively support multi-valued logic, albeit being typically operated in a binary fashion. Multi-valued, or qudit, quantum processors have access to much richer forms of quantum entanglement,…

Gate-level quantum circuits are often derived manually from higher level algorithms. While this suffices for small implementations and demonstrations, ultimately automatic circuit design will be required to realise complex algorithms using…

A critical step in developing circuits for quantum simulation is to synthesize a desired unitary operator using the circuit building blocks. Studying unitaries and their generators from the Lie algebraic perspective has given rise to…

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…

In this paper, we explore multilevel circuit optimization (MLCO), where we deploy multiple gate sets and progressively lower the source circuit through the gate sets to the target circuit. At each level, we first perform an appropriate set…

Qubits, which are quantum counterparts of classical bits, are used as basic information units for quantum information processing, whereas underlying physical information carriers, e.g. (artificial) atoms or ions, admit encoding of more…

We developed a general framework for synthesizing target gates by using a finite set of basic gates, which is a crucial step in quantum compilation. When approximating a gate in SU($n$), a naive brute-force search requires a computational…

The primary objective of quantum circuit synthesis is to efficiently and accurately realize specific quantum algorithms or operations utilizing a predefined set of quantum gates, while also optimizing the circuit size. It holds a pivotal…

GCD computations and variants of the Euclidean algorithm enjoy broad uses in both classical and quantum algorithms. In this paper, we propose quantum circuits for GCD computation with $O(n \log n)$ depth with O(n) ancillae. Prior circuit…

We present improved quantum circuits for elliptic curve scalar multiplication, the most costly component in Shor's algorithm to compute discrete logarithms in elliptic curve groups. We optimize low-level components such as reversible…

Numerous scientific developments in this NISQ-era (Noisy Intermediate Scale Quantum) have raised the importance for quantum algorithms relative to their conventional counterparts due to its asymptotic advantage. For resource estimates in…