Related papers: Repeat-Until-Success: Non-deterministic decomposit…
We propose a direct (non-recursive) algorithm for applying a rotation $R_{\theta^\ast}$, $\epsilon$-close to a desired rotation $R_\theta$, to a single qubit using the Clifford+Toffoli gate set. Our algorithm does not rely on repeatedly…
In this work, we report on a novel quantum gate approximation algorithm based on the application of parametric two-qubit gates in the synthesis process. The utilization of these parametric two-qubit gates in the circuit design allows us to…
We show how to efficiently exploit decoherence free subspaces (DFSs), which are immune to collective noise, for realizing quantum repeaters with long lived quantum memories. Our setup consists of an assembly of simple modules and we show…
We present a 1D repetition code based on the so-called cat qubits as a viable approach toward hardware-efficient universal and fault-tolerant quantum computation. The cat qubits that are stabilized by a two-photon driven-dissipative…
Characterization of experimental systems is an essential step in developing and improving quantum hardware. A collection of protocols known as Randomized Benchmarking (RB) was developed in the past decade, which provides an efficient way to…
Many quantum algorithms can be written as a composition of unitaries, some of which can be exactly synthesized by a universal fault-tolerant gate set, while others can be approximately synthesized. A quantum compiler synthesizes each…
Product formula methods, particularly the second-order Suzuki decomposition, are an important tool for simulating quantum dynamics on quantum computers due to their simplicity and unitarity preservation. While higher-order schemes have been…
We propose a theoretical scheme to realize arbitrary single-qubit gates through two simple device units: one-dimensional semiconductor wires with Dresselhaus spin-orbit coupling (SOC) and Rashba SOC, separately. Qubit information coded by…
Quantum circuits of a general quantum gate acting on multiple $d$-level quantum systems play a prominent role in multi-valued quantum computation. We first propose a new recursive Cartan decomposition of semi-simple unitary Lie group…
We present a classical simulation method for fermionic quantum systems which, without loss of generality, can be represented by parity-preserving circuits made of two-qubit gates in a brick-wall structure. We map such circuits to a…
One-parameter interpolations between any two unitary matrices (e.g., quantum gates) $U_1$ and $U_2$ along efficient paths contained in the unitary group are constructed. Motivated by applications, we propose the continuous unitary path…
We demonstrate the possibility to perform distributed quantum computing using only single photon sources (atom-cavity-like systems), linear optics and photon detectors. The qubits are encoded in stable ground states of the sources. To…
Given an arbitrary single-qubit operation, an important task is to efficiently decompose this operation into an (exact or approximate) sequence of fault-tolerant quantum operations. We derive a depth-optimal canonical form for single-qubit…
The creation of composite quantum gates that implement quantum response functions $\hat{U}(\theta)$ dependent on some parameter of interest $\theta$ is often more of an art than a science. Through inspired design, a sequence of $L$…
In this paper we consider circuit synthesis for n-wire linear reversible circuits using the C-NOT gate library. These circuits are an important class of reversible circuits with applications to quantum computation. Previous algorithms,…
To maximize the received power at a user equipment, the problem of optimizing a reconfigurable intelligent surface (RIS) with a limited phase range R < 2{\pi} and nonuniform discrete phase shifts with adjustable gains is addressed.…
We describe how randomized benchmarking can be used to reconstruct the unital part of any trace-preserving quantum map, which in turn is sufficient for the full characterization of any unitary evolution, or more generally, any unital…
As experimental platforms for quantum information processing continue to mature, characterization of the quality of unitary gates that can be applied to their quantum bits (qubits) becomes essential. Eventually, the quality must be…
Simulating quantum systems with their environments often requires non-unitary operations, and mapping these to quantum devices often involves expensive dilations or prohibitive measurement costs to achieve desired precisions. Building on…
Linear reversible circuits represent a subclass of reversible circuits with many applications in quantum computing. These circuits can be efficiently simulated by classical computers and their size is polynomially bounded by the number of…