Related papers: Repeat-Until-Success circuits with fixed-point obl…
We present a decomposition technique that uses non-deterministic circuits to approximate an arbitrary single-qubit unitary to within distance $\epsilon$ and requires significantly fewer non-Clifford gates than existing techniques. We…
We introduce an architecture for robust and scalable quantum computation using both stationary qubits (e.g. single photon sources made out of trapped atoms, molecules, ions, quantum dots, or defect centers in solids) and flying qubits (e.g.…
Repeat-until-success strategy is a standard method to obtain success with a probability which grows exponentially in the number of iterations. However, since quantum systems are disturbed after a quantum measurement, it is not…
In order to achieve universal quantum computation using continuous variables, one needs to jump out of the set of Gaussian operations and have a non-Gaussian element, such as the cubic phase gate. However, such a gate is currently very…
We develop a method for approximate synthesis of single--qubit rotations of the form $e^{-i f(\phi_1,\ldots,\phi_k)X}$ that is based on the Repeat-Until-Success (RUS) framework for quantum circuit synthesis. We demonstrate how smooth…
Recently, it was shown that Repeat-Until-Success (RUS) circuits can achieve a $2.5$ times reduction in expected $T$-count over ancilla-free techniques for single-qubit unitary decomposition. However, the previously best known algorithm to…
The quantum simulation of classical fluids often involves the use of probabilistic algorithms that encode the result of the dynamics in the form of the amplitude of the selected quantum state. In most cases, however, the amplitude…
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 success probability in an ancilla based circuit generally decreases exponentially in the number of qubits consisted in the ancilla. Although the probability can be amplified through the amplitude amplification process, the input…
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…
We propose a repeat-until-success protocol to improve the performance of probabilistic quantum repeaters. Quantum repeaters rely on passive static linear optics elements and photodetectors to perform Bell-state measurements (BSMs).…
The success probability of a quantum algorithm constructed from noisy quantum gates cannot be accurately predicted from single parameter metrics that compare noisy and ideal gates. We illustrate this concept by examining a system with…
Overcoming the influence of noise and imperfections is a major challenge in quantum computing. Here, we present an approach based on applying a desired unitary computation in superposition between the system of interest and some auxiliary…
We present a \textit{robust error accumulation suppression} (\textbf{REAS}) technique to manage errors in quantum computers. Our method reduces the accumulation of errors in any quantum circuit composed of single- or two-qubit gates…
Most of the schemes for "noiseless" amplification of coherent states, which have recently been attracting theoretical and experimental interest, share a common trait: the amplification is not truly noiseless, or perfect, for non-zero…
The success of quantum circuits in providing reliable outcomes for a given problem depends on the gate count and depth in near-term noisy quantum computers. Quantum circuit compilers that decompose high-level gates to native gates of the…
Quantum algorithms for diverse problems, including search and optimization problems, require the implementation of a reflection operator over a target state. Commonly, such reflections are approximately implemented using phase estimation.…
Overcoming the influence of noise and imperfections in quantum devices is one of the main challenges for viable quantum applications. In this article, we present different protocols, which we denote as "superposed quantum error mitigation",…
Systematic errors in quantum operations can be the dominating source of imperfection in achieving control over quantum systems. This problem, which has been well studied in nuclear magnetic resonance, can be addressed by replacing single…
With a combination of the quantum repeater and the cluster state approaches, we show that efficient quantum computation can be constructed even if all the entangling quantum gates only succeed with an arbitrarily small probability $p$. The…