Related papers: Optimal fidelity in implementing Grover's search a…
We analyze the robustness of Grover's quantum search algorithm performed by a quantum register under a possibly time-correlated noise acting locally on the qubits. We model the noise as originating from an arbitrary but fixed unitary…
The theory of decoherent histories is an attempt to derive classical physics from positing only quantum laws at the fundamental level without notions of a classical apparatus or collapse of the wave-function. Searching for a marked target…
We consider the effect of two different environments on the performance of the quantum adiabatic search algorithm, a thermal bath at finite temperature, and a structured environment similar to the one encountered in systems coupled to the…
This paper researches how the systematic errors in phase inversions affect the success rate and the number of iterations in optimized quantum random-walk search algorithm. Through geometric description of this algorithm, the model of the…
Two main obstacles for observing quantum advantage in noisy intermediate-scale quantum computers (NISQ) are the finite precision effects due to control errors, or disorders, and decoherence effects due to thermal fluctuations. It has been…
We provide a characterization and analysis of the effects of dissipation on oscillator assisted (qubus) quantum gates. The effects can be understood and minimized by looking at the dynamics of the signal coherence and its entanglement with…
Methods of optimal control are applied to a model system of interacting two-level particles (e.g., spin-half atomic nuclei or electrons or two-level atoms) to produce high-fidelity quantum gates while simultaneously negating the detrimental…
Optimal control is a central problem in quantum thermodynamics. When minimizing dissipated work and work fluctuations defined via the two-point measurement scheme in open quantum systems, existing approaches largely focus on the rapid- and…
In the Grover-type quantum search process a search operator is iteratively applied, say, k times, on the initial database state. We present an additive decomposition scheme such that the iteration process is expressed, in the computational…
Loading classical data into quantum computers represents an essential stage in many relevant quantum algorithms, especially in the field of quantum machine learning. Therefore, the inefficiency of this loading process means a major…
We propose a potentially practical scheme for realization of an n-qubit (n>2) conditional phase flip (CPF) gate and implementation of Grover search algorithm in the ion-trap system. We demonstrate both analytically and numerically that, our…
Search-base algorithms have widespread applications in different scenarios. Grover's quantum search algorithms and its generalization, amplitude amplification, provide a quadratic speedup over classical search algorithms for unstructured…
Simulating the dynamics of open quantum systems is a crucial task in quantum computing, offering wide-ranging applications but remaining computationally challenging. In this paper, we propose two quantum algorithms for simulating the…
Entanglement lies at the heart of quantum mechanics and has no classical analogue. It is central to the speed up achieved by quantum algorithms over their classical counterparts. The Grover's search algorithm is one such algorithm which…
A stochastic representation of the dynamics of open quantum systems, suitable for non-perturbative system-reservoir interaction, non-Markovian effects and arbitrarily driven systems is presented. It includes the case of driving on…
Deep-circuit quantum computation, like Shor's algorithm, is undermined by error accumulation, and near-future quantum techniques are far from adequate for full-fledged quantum error correction. Instead of resorting to shallow-circuit…
We investigate the problem of quantum searching on a noisy quantum computer. Taking a 'fault-ignorant' approach, we analyze quantum algorithms that solve the task for various different noise strengths, which are possibly unknown beforehand.…
Developing optimal strategies to calibrate quantum processors for high-fidelity operation is one of the outstanding challenges in quantum computing today. Here, we demonstrate multiple examples of high-fidelity operations achieved using a…
The entanglement of a quantum system can be valuated using Mermin polynomials. This gives us a means to study entanglement evolution during the execution of quantum algorithms. We first consider Grover's quantum search algorithm, noticing…
Quantum search is among the most important algorithms in quantum computing. At its core is quantum amplitude amplification, a technique that achieves a quadratic speedup over classical search by combining two global reflections: the oracle,…