Related papers: Repeat-Until-Success circuits with fixed-point obl…
Grover's Search algorithm was a breakthrough at the time it was introduced, and its underlying procedure of amplitude amplification has been a building block of many other algorithms and patterns for extracting information encoded in…
Efficient verification of the functioning of quantum devices is a key to the development of quantum technologies, but is a daunting task as the system size increases. Here we propose a simple and general framework for verifying unitary…
With the increasing scale of communication networks, the likelihood of failures grows as well. Since these networks form a critical backbone of our digital society, it is important that they rely on robust routing algorithms which ensure…
I describe the use of techniques based on composite rotations to combat systematic errors in controlled phase gates, which form the basis of two qubit quantum logic gates. Although developed and described within the context of Nuclear…
We study numerically the effects of static imperfections and residual couplings between qubits for the quantum phase estimation algorithm with two qubits. We show that the success probability of the algorithm is affected significantly more…
We present an efficient proposal for error-rejecting quantum computing with quantum dots (QD) embedded in single-sided optical microcavities based on the interface between the circularly polarized photon and QDs. An almost unity fidelity of…
Quantum random access memory (QRAM) enables efficient classical data access for quantum computers -- a prerequisite for many quantum algorithms to achieve quantum speedup. Despite various proposals, the experimental realization of QRAM…
We study the (in)feasibility of quantum pseudorandom notions in a quantum analog of the random oracle model, where all the parties, including the adversary, have oracle access to the same Haar random unitary. In this model, we show the…
The rapid advancement of quantum hardware calls for the development of reliable methods to certify its correct functioning. However, existing certification tests often fall short: they either rely on flawless state preparation and…
Quantum reservoir computing has emerged as a promising machine learning paradigm for processing temporal data on near-term quantum devices, as it allows for exploiting the large computational capacity of the qubits without suffering from…
According to the fundamental laws of quantum optics, noise is necessarily added to the system when one tries to clone or amplify a quantum state. However, it has recently been shown that the quantum noise related to the operation of a…
Amplification underlies the operation of many biological and engineering systems. Simple electrical, optical, and mechanical amplifiers are reciprocal: the backward coupling of the output to the input equals the forward coupling of the…
A general error correction method is presented which is capable of correcting coherent errors originating from static residual inter-qubit couplings in a quantum computer. It is based on a randomization of static imperfections in a…
In this paper, we investigate the problem of \textit{episodic reinforcement learning} with quantum oracles for state evolution. To this end, we propose an \textit{Upper Confidence Bound} (UCB) based quantum algorithmic framework to…
The hope of the quantum computing field is that quantum architectures are able to scale up and realize fault-tolerant quantum computing. Due to engineering challenges, such ''cheap'' error correction may be decades away. In the meantime, we…
Quantum systems have potential to demonstrate significant computational advantage, but current quantum devices suffer from the rapid accumulation of error that prevents the storage of quantum information over extended periods. The…
Amplitude amplification provides a quadratic speed-up for an array of quantum algorithms when run on a quantum machine perfectly isolated from its environment. However, the advantage is substantially diminished as the NISQ-era quantum…
A new method for simulation of a binary homogeneous Markov process using a quantum computer was proposed. This new method allows using the distinguished properties of the quantum mechanical systems -- superposition, entanglement and…
Entangling operations are among the most important primitive gates employed in quantum computing and it is crucial to ensure high-fidelity implementations as systems are scaled up. We experimentally realize and characterize a simple scheme…
In higher-order quantum computing (HOQC), one typically considers the universal transformation of unknown quantum operations, treated as blackboxes. It is also implicitly assumed that the resulting operation must act on arbitrary, and thus…