Related papers: Efficient, direct compilation of SU(N) operations …
Geometric gates that use the global property of the geometric phase is believed to be a powerful tool to realize fault-tolerant quantum computation. However, for singlet-triplet qubits in semiconductor quantum dot, the low Rabi frequency of…
Recently it has been shown that Repeat-Until-Success (RUS) circuits can approximate a given single-qubit unitary with an expected number of $T$ gates of about $1/3$ of what is required by optimal, deterministic, ancilla-free decompositions…
The ability to implement the Quantum Fourier Transform (QFT) efficiently on a quantum computer facilitates the advantages offered by a variety of fundamental quantum algorithms, such as those for integer factoring, computing discrete…
We show a certain kind of non-local operations can be simulated by sampling a set of local operations with a quasi-probability distribution when the task of a quantum circuit is to evaluate an expectation value of observables. Utilizing the…
Multi-controlled unitary gates have been a subject of interest in quantum computing since its inception, and are widely used in quantum algorithms. The current state-of-the-art approach to implementing n-qubit multi-controlled gates…
Classical simulations of quantum circuits are essential for verifying and benchmarking quantum algorithms, particularly for large circuits, where computational demands increase exponentially with the number of qubits. Among available…
We present two efficient methods for implementing the Fredkin gate with atoms separately trapped in an array of three high-$Q$ coupled cavities. The first proposal is based on the resonant dynamics, which leads to a fast resonant…
We propose novel methods for the exact synthesis of single-qubit unitaries with high success probability and gate fidelity, considering both time-bin and frequency-bin encodings. The proposed schemes are experimentally implementable with a…
The ground state of the negatively charged NV center forms a spin-1 manifold providing a versatile platform for sensing and information processing. Here we present a scheme for implementing fast arbitrary qutrit gates in the low-field…
We present a scheme designed to suppress the dominant source of infidelity in entangling gates between quantum systems coupled through intermediate bosonic oscillator modes. Such systems are particularly susceptible to residual…
Recently, it was shown that the qudits used in circuits of a convolutional form (e.g., Matrix Product State sand Multi-scale Entanglement Renormalization Ansatz) can be reset unitarily…
This paper concerns the efficient implementation of quantum circuits for qudits. We show that controlled two-qudit gates can be implemented without ancillas and prove that the gate library containing arbitrary local unitaries and one…
We propose entangling operations based on the energy curvature couplings of encoded spin qubits to a superconducting cavity, exploring the non-linear qubit response to a gate voltage variation. For a two-qubit ($n$-qubit) entangling gate we…
Despite major ongoing advancements in neutral atom hardware technology, there remains limited work in systems-level software tailored to overcoming the challenges of neutral atom quantum computers. In particular, most current neutral atom…
The compiling of quantum gates is crucial for the successful quantum algorithm implementations. The environmental noise as well as the bandwidth of control pulses pose a challenge to precise and fast qubit control, especially in a weakly…
Solid state quantum processors based on spins in silicon quantum dots are emerging as a powerful platform for quantum information processing. High fidelity single- and two-qubit gates have recently been demonstrated and large extendable…
Three-qubit gates can be constructed using combinations of single-qubit and two-qubit gates, making their independent realization unnecessary. However, direct implementation of three-qubit gates reduces the depth of quantum circuits,…
We present a new number theoretic definition of discrete fractional Fourier transform (DFrFT) . In this approach the DFrFT is defined as the $N \times N$ dimensional unitary representation of the generator of the arithmetic rotational group…
In this paper, we propose an efficient compilation method for distributed quantum computing (DQC) using the Linear Nearest Neighbor (LNN) architecture. By exploiting the LNN topology's symmetry, we optimize quantum circuit compilation for…
Recent achievements in the field of gate defined semiconductor quantum dots reinforce the concept of a spin-based quantum computer consisting of nodes of locally connected qubits which communicate with each other via superconducting circuit…